// File: @openzeppelin/contracts/access/AccessControl.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (access/AccessControl.sol)

pragma solidity ^0.8.0;

import "./IAccessControl.sol";
import "../utils/Context.sol";
import "../utils/Strings.sol";
import "../utils/introspection/ERC165.sol";

/**
 * @dev Contract module that allows children to implement role-based access
 * control mechanisms. This is a lightweight version that doesn't allow enumerating role
 * members except through off-chain means by accessing the contract event logs. Some
 * applications may benefit from on-chain enumerability, for those cases see
 * {AccessControlEnumerable}.
 *
 * Roles are referred to by their `bytes32` identifier. These should be exposed
 * in the external API and be unique. The best way to achieve this is by
 * using `public constant` hash digests:
 *
 * ```solidity
 * bytes32 public constant MY_ROLE = keccak256("MY_ROLE");
 * ```
 *
 * Roles can be used to represent a set of permissions. To restrict access to a
 * function call, use {hasRole}:
 *
 * ```solidity
 * function foo() public {
 *     require(hasRole(MY_ROLE, msg.sender));
 *     ...
 * }
 * ```
 *
 * Roles can be granted and revoked dynamically via the {grantRole} and
 * {revokeRole} functions. Each role has an associated admin role, and only
 * accounts that have a role's admin role can call {grantRole} and {revokeRole}.
 *
 * By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means
 * that only accounts with this role will be able to grant or revoke other
 * roles. More complex role relationships can be created by using
 * {_setRoleAdmin}.
 *
 * WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to
 * grant and revoke this role. Extra precautions should be taken to secure
 * accounts that have been granted it. We recommend using {AccessControlDefaultAdminRules}
 * to enforce additional security measures for this role.
 */
abstract contract AccessControl is Context, IAccessControl, ERC165 {
    struct RoleData {
        mapping(address => bool) members;
        bytes32 adminRole;
    }

    mapping(bytes32 => RoleData) private _roles;

    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;

    /**
     * @dev Modifier that checks that an account has a specific role. Reverts
     * with a standardized message including the required role.
     *
     * The format of the revert reason is given by the following regular expression:
     *
     *  /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/
     *
     * _Available since v4.1._
     */
    modifier onlyRole(bytes32 role) {
        _checkRole(role);
        _;
    }

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IAccessControl).interfaceId || super.supportsInterface(interfaceId);
    }

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) public view virtual override returns (bool) {
        return _roles[role].members[account];
    }

    /**
     * @dev Revert with a standard message if `_msgSender()` is missing `role`.
     * Overriding this function changes the behavior of the {onlyRole} modifier.
     *
     * Format of the revert message is described in {_checkRole}.
     *
     * _Available since v4.6._
     */
    function _checkRole(bytes32 role) internal view virtual {
        _checkRole(role, _msgSender());
    }

    /**
     * @dev Revert with a standard message if `account` is missing `role`.
     *
     * The format of the revert reason is given by the following regular expression:
     *
     *  /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/
     */
    function _checkRole(bytes32 role, address account) internal view virtual {
        if (!hasRole(role, account)) {
            revert(
                string(
                    abi.encodePacked(
                        "AccessControl: account ",
                        Strings.toHexString(account),
                        " is missing role ",
                        Strings.toHexString(uint256(role), 32)
                    )
                )
            );
        }
    }

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) public view virtual override returns (bytes32) {
        return _roles[role].adminRole;
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleGranted} event.
     */
    function grantRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {
        _grantRole(role, account);
    }

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleRevoked} event.
     */
    function revokeRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {
        _revokeRole(role, account);
    }

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been revoked `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `account`.
     *
     * May emit a {RoleRevoked} event.
     */
    function renounceRole(bytes32 role, address account) public virtual override {
        require(account == _msgSender(), "AccessControl: can only renounce roles for self");

        _revokeRole(role, account);
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event. Note that unlike {grantRole}, this function doesn't perform any
     * checks on the calling account.
     *
     * May emit a {RoleGranted} event.
     *
     * [WARNING]
     * ====
     * This function should only be called from the constructor when setting
     * up the initial roles for the system.
     *
     * Using this function in any other way is effectively circumventing the admin
     * system imposed by {AccessControl}.
     * ====
     *
     * NOTE: This function is deprecated in favor of {_grantRole}.
     */
    function _setupRole(bytes32 role, address account) internal virtual {
        _grantRole(role, account);
    }

    /**
     * @dev Sets `adminRole` as ``role``'s admin role.
     *
     * Emits a {RoleAdminChanged} event.
     */
    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual {
        bytes32 previousAdminRole = getRoleAdmin(role);
        _roles[role].adminRole = adminRole;
        emit RoleAdminChanged(role, previousAdminRole, adminRole);
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleGranted} event.
     */
    function _grantRole(bytes32 role, address account) internal virtual {
        if (!hasRole(role, account)) {
            _roles[role].members[account] = true;
            emit RoleGranted(role, account, _msgSender());
        }
    }

    /**
     * @dev Revokes `role` from `account`.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleRevoked} event.
     */
    function _revokeRole(bytes32 role, address account) internal virtual {
        if (hasRole(role, account)) {
            _roles[role].members[account] = false;
            emit RoleRevoked(role, account, _msgSender());
        }
    }
}

// File: @openzeppelin/contracts/access/AccessControlEnumerable.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.5.0) (access/AccessControlEnumerable.sol)

pragma solidity ^0.8.0;

import "./IAccessControlEnumerable.sol";
import "./AccessControl.sol";
import "../utils/structs/EnumerableSet.sol";

/**
 * @dev Extension of {AccessControl} that allows enumerating the members of each role.
 */
abstract contract AccessControlEnumerable is IAccessControlEnumerable, AccessControl {
    using EnumerableSet for EnumerableSet.AddressSet;

    mapping(bytes32 => EnumerableSet.AddressSet) private _roleMembers;

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IAccessControlEnumerable).interfaceId || super.supportsInterface(interfaceId);
    }

    /**
     * @dev Returns one of the accounts that have `role`. `index` must be a
     * value between 0 and {getRoleMemberCount}, non-inclusive.
     *
     * Role bearers are not sorted in any particular way, and their ordering may
     * change at any point.
     *
     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure
     * you perform all queries on the same block. See the following
     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]
     * for more information.
     */
    function getRoleMember(bytes32 role, uint256 index) public view virtual override returns (address) {
        return _roleMembers[role].at(index);
    }

    /**
     * @dev Returns the number of accounts that have `role`. Can be used
     * together with {getRoleMember} to enumerate all bearers of a role.
     */
    function getRoleMemberCount(bytes32 role) public view virtual override returns (uint256) {
        return _roleMembers[role].length();
    }

    /**
     * @dev Overload {_grantRole} to track enumerable memberships
     */
    function _grantRole(bytes32 role, address account) internal virtual override {
        super._grantRole(role, account);
        _roleMembers[role].add(account);
    }

    /**
     * @dev Overload {_revokeRole} to track enumerable memberships
     */
    function _revokeRole(bytes32 role, address account) internal virtual override {
        super._revokeRole(role, account);
        _roleMembers[role].remove(account);
    }
}

// File: @openzeppelin/contracts/access/IAccessControl.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (access/IAccessControl.sol)

pragma solidity ^0.8.0;

/**
 * @dev External interface of AccessControl declared to support ERC165 detection.
 */
interface IAccessControl {
    /**
     * @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole`
     *
     * `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite
     * {RoleAdminChanged} not being emitted signaling this.
     *
     * _Available since v3.1._
     */
    event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole);

    /**
     * @dev Emitted when `account` is granted `role`.
     *
     * `sender` is the account that originated the contract call, an admin role
     * bearer except when using {AccessControl-_setupRole}.
     */
    event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Emitted when `account` is revoked `role`.
     *
     * `sender` is the account that originated the contract call:
     *   - if using `revokeRole`, it is the admin role bearer
     *   - if using `renounceRole`, it is the role bearer (i.e. `account`)
     */
    event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) external view returns (bool);

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {AccessControl-_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) external view returns (bytes32);

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function grantRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function revokeRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been granted `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `account`.
     */
    function renounceRole(bytes32 role, address account) external;
}

// File: @openzeppelin/contracts/access/IAccessControlEnumerable.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (access/IAccessControlEnumerable.sol)

pragma solidity ^0.8.0;

import "./IAccessControl.sol";

/**
 * @dev External interface of AccessControlEnumerable declared to support ERC165 detection.
 */
interface IAccessControlEnumerable is IAccessControl {
    /**
     * @dev Returns one of the accounts that have `role`. `index` must be a
     * value between 0 and {getRoleMemberCount}, non-inclusive.
     *
     * Role bearers are not sorted in any particular way, and their ordering may
     * change at any point.
     *
     * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure
     * you perform all queries on the same block. See the following
     * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]
     * for more information.
     */
    function getRoleMember(bytes32 role, uint256 index) external view returns (address);

    /**
     * @dev Returns the number of accounts that have `role`. Can be used
     * together with {getRoleMember} to enumerate all bearers of a role.
     */
    function getRoleMemberCount(bytes32 role) external view returns (uint256);
}

// File: @openzeppelin/contracts/interfaces/IERC1155.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (interfaces/IERC1155.sol)

pragma solidity ^0.8.0;

import "../token/ERC1155/IERC1155.sol";

// File: @openzeppelin/contracts/interfaces/IERC1155Receiver.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (interfaces/IERC1155Receiver.sol)

pragma solidity ^0.8.0;

import "../token/ERC1155/IERC1155Receiver.sol";

// File: @openzeppelin/contracts/interfaces/IERC721.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (interfaces/IERC721.sol)

pragma solidity ^0.8.0;

import "../token/ERC721/IERC721.sol";

// File: @openzeppelin/contracts/interfaces/IERC721Receiver.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (interfaces/IERC721Receiver.sol)

pragma solidity ^0.8.0;

import "../token/ERC721/IERC721Receiver.sol";

// File: @openzeppelin/contracts/proxy/Clones.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (proxy/Clones.sol)

pragma solidity ^0.8.0;

/**
 * @dev https://eips.ethereum.org/EIPS/eip-1167[EIP 1167] is a standard for
 * deploying minimal proxy contracts, also known as "clones".
 *
 * > To simply and cheaply clone contract functionality in an immutable way, this standard specifies
 * > a minimal bytecode implementation that delegates all calls to a known, fixed address.
 *
 * The library includes functions to deploy a proxy using either `create` (traditional deployment) or `create2`
 * (salted deterministic deployment). It also includes functions to predict the addresses of clones deployed using the
 * deterministic method.
 *
 * _Available since v3.4._
 */
library Clones {
    /**
     * @dev Deploys and returns the address of a clone that mimics the behaviour of `implementation`.
     *
     * This function uses the create opcode, which should never revert.
     */
    function clone(address implementation) internal returns (address instance) {
        /// @solidity memory-safe-assembly
        assembly {
            // Cleans the upper 96 bits of the `implementation` word, then packs the first 3 bytes
            // of the `implementation` address with the bytecode before the address.
            mstore(0x00, or(shr(0xe8, shl(0x60, implementation)), 0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000))
            // Packs the remaining 17 bytes of `implementation` with the bytecode after the address.
            mstore(0x20, or(shl(0x78, implementation), 0x5af43d82803e903d91602b57fd5bf3))
            instance := create(0, 0x09, 0x37)
        }
        require(instance != address(0), "ERC1167: create failed");
    }

    /**
     * @dev Deploys and returns the address of a clone that mimics the behaviour of `implementation`.
     *
     * This function uses the create2 opcode and a `salt` to deterministically deploy
     * the clone. Using the same `implementation` and `salt` multiple time will revert, since
     * the clones cannot be deployed twice at the same address.
     */
    function cloneDeterministic(address implementation, bytes32 salt) internal returns (address instance) {
        /// @solidity memory-safe-assembly
        assembly {
            // Cleans the upper 96 bits of the `implementation` word, then packs the first 3 bytes
            // of the `implementation` address with the bytecode before the address.
            mstore(0x00, or(shr(0xe8, shl(0x60, implementation)), 0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000))
            // Packs the remaining 17 bytes of `implementation` with the bytecode after the address.
            mstore(0x20, or(shl(0x78, implementation), 0x5af43d82803e903d91602b57fd5bf3))
            instance := create2(0, 0x09, 0x37, salt)
        }
        require(instance != address(0), "ERC1167: create2 failed");
    }

    /**
     * @dev Computes the address of a clone deployed using {Clones-cloneDeterministic}.
     */
    function predictDeterministicAddress(
        address implementation,
        bytes32 salt,
        address deployer
    ) internal pure returns (address predicted) {
        /// @solidity memory-safe-assembly
        assembly {
            let ptr := mload(0x40)
            mstore(add(ptr, 0x38), deployer)
            mstore(add(ptr, 0x24), 0x5af43d82803e903d91602b57fd5bf3ff)
            mstore(add(ptr, 0x14), implementation)
            mstore(ptr, 0x3d602d80600a3d3981f3363d3d373d3d3d363d73)
            mstore(add(ptr, 0x58), salt)
            mstore(add(ptr, 0x78), keccak256(add(ptr, 0x0c), 0x37))
            predicted := keccak256(add(ptr, 0x43), 0x55)
        }
    }

    /**
     * @dev Computes the address of a clone deployed using {Clones-cloneDeterministic}.
     */
    function predictDeterministicAddress(
        address implementation,
        bytes32 salt
    ) internal view returns (address predicted) {
        return predictDeterministicAddress(implementation, salt, address(this));
    }
}

// File: @openzeppelin/contracts/token/ERC1155/IERC1155.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC1155/IERC1155.sol)

pragma solidity ^0.8.0;

import "../../utils/introspection/IERC165.sol";

/**
 * @dev Required interface of an ERC1155 compliant contract, as defined in the
 * https://eips.ethereum.org/EIPS/eip-1155[EIP].
 *
 * _Available since v3.1._
 */
interface IERC1155 is IERC165 {
    /**
     * @dev Emitted when `value` tokens of token type `id` are transferred from `from` to `to` by `operator`.
     */
    event TransferSingle(address indexed operator, address indexed from, address indexed to, uint256 id, uint256 value);

    /**
     * @dev Equivalent to multiple {TransferSingle} events, where `operator`, `from` and `to` are the same for all
     * transfers.
     */
    event TransferBatch(
        address indexed operator,
        address indexed from,
        address indexed to,
        uint256[] ids,
        uint256[] values
    );

    /**
     * @dev Emitted when `account` grants or revokes permission to `operator` to transfer their tokens, according to
     * `approved`.
     */
    event ApprovalForAll(address indexed account, address indexed operator, bool approved);

    /**
     * @dev Emitted when the URI for token type `id` changes to `value`, if it is a non-programmatic URI.
     *
     * If an {URI} event was emitted for `id`, the standard
     * https://eips.ethereum.org/EIPS/eip-1155#metadata-extensions[guarantees] that `value` will equal the value
     * returned by {IERC1155MetadataURI-uri}.
     */
    event URI(string value, uint256 indexed id);

    /**
     * @dev Returns the amount of tokens of token type `id` owned by `account`.
     *
     * Requirements:
     *
     * - `account` cannot be the zero address.
     */
    function balanceOf(address account, uint256 id) external view returns (uint256);

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {balanceOf}.
     *
     * Requirements:
     *
     * - `accounts` and `ids` must have the same length.
     */
    function balanceOfBatch(
        address[] calldata accounts,
        uint256[] calldata ids
    ) external view returns (uint256[] memory);

    /**
     * @dev Grants or revokes permission to `operator` to transfer the caller's tokens, according to `approved`,
     *
     * Emits an {ApprovalForAll} event.
     *
     * Requirements:
     *
     * - `operator` cannot be the caller.
     */
    function setApprovalForAll(address operator, bool approved) external;

    /**
     * @dev Returns true if `operator` is approved to transfer ``account``'s tokens.
     *
     * See {setApprovalForAll}.
     */
    function isApprovedForAll(address account, address operator) external view returns (bool);

    /**
     * @dev Transfers `amount` tokens of token type `id` from `from` to `to`.
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - If the caller is not `from`, it must have been approved to spend ``from``'s tokens via {setApprovalForAll}.
     * - `from` must have a balance of tokens of type `id` of at least `amount`.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155Received} and return the
     * acceptance magic value.
     */
    function safeTransferFrom(address from, address to, uint256 id, uint256 amount, bytes calldata data) external;

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {safeTransferFrom}.
     *
     * Emits a {TransferBatch} event.
     *
     * Requirements:
     *
     * - `ids` and `amounts` must have the same length.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155BatchReceived} and return the
     * acceptance magic value.
     */
    function safeBatchTransferFrom(
        address from,
        address to,
        uint256[] calldata ids,
        uint256[] calldata amounts,
        bytes calldata data
    ) external;
}

// File: @openzeppelin/contracts/token/ERC1155/IERC1155Receiver.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.5.0) (token/ERC1155/IERC1155Receiver.sol)

pragma solidity ^0.8.0;

import "../../utils/introspection/IERC165.sol";

/**
 * @dev _Available since v3.1._
 */
interface IERC1155Receiver is IERC165 {
    /**
     * @dev Handles the receipt of a single ERC1155 token type. This function is
     * called at the end of a `safeTransferFrom` after the balance has been updated.
     *
     * NOTE: To accept the transfer, this must return
     * `bytes4(keccak256("onERC1155Received(address,address,uint256,uint256,bytes)"))`
     * (i.e. 0xf23a6e61, or its own function selector).
     *
     * @param operator The address which initiated the transfer (i.e. msg.sender)
     * @param from The address which previously owned the token
     * @param id The ID of the token being transferred
     * @param value The amount of tokens being transferred
     * @param data Additional data with no specified format
     * @return `bytes4(keccak256("onERC1155Received(address,address,uint256,uint256,bytes)"))` if transfer is allowed
     */
    function onERC1155Received(
        address operator,
        address from,
        uint256 id,
        uint256 value,
        bytes calldata data
    ) external returns (bytes4);

    /**
     * @dev Handles the receipt of a multiple ERC1155 token types. This function
     * is called at the end of a `safeBatchTransferFrom` after the balances have
     * been updated.
     *
     * NOTE: To accept the transfer(s), this must return
     * `bytes4(keccak256("onERC1155BatchReceived(address,address,uint256[],uint256[],bytes)"))`
     * (i.e. 0xbc197c81, or its own function selector).
     *
     * @param operator The address which initiated the batch transfer (i.e. msg.sender)
     * @param from The address which previously owned the token
     * @param ids An array containing ids of each token being transferred (order and length must match values array)
     * @param values An array containing amounts of each token being transferred (order and length must match ids array)
     * @param data Additional data with no specified format
     * @return `bytes4(keccak256("onERC1155BatchReceived(address,address,uint256[],uint256[],bytes)"))` if transfer is allowed
     */
    function onERC1155BatchReceived(
        address operator,
        address from,
        uint256[] calldata ids,
        uint256[] calldata values,
        bytes calldata data
    ) external returns (bytes4);
}

// File: @openzeppelin/contracts/token/ERC20/IERC20.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 standard as defined in the EIP.
 */
interface IERC20 {
    /**
     * @dev Emitted when `value` tokens are moved from one account (`from`) to
     * another (`to`).
     *
     * Note that `value` may be zero.
     */
    event Transfer(address indexed from, address indexed to, uint256 value);

    /**
     * @dev Emitted when the allowance of a `spender` for an `owner` is set by
     * a call to {approve}. `value` is the new allowance.
     */
    event Approval(address indexed owner, address indexed spender, uint256 value);

    /**
     * @dev Returns the amount of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns the amount of tokens owned by `account`.
     */
    function balanceOf(address account) external view returns (uint256);

    /**
     * @dev Moves `amount` tokens from the caller's account to `to`.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transfer(address to, uint256 amount) external returns (bool);

    /**
     * @dev Returns the remaining number of tokens that `spender` will be
     * allowed to spend on behalf of `owner` through {transferFrom}. This is
     * zero by default.
     *
     * This value changes when {approve} or {transferFrom} are called.
     */
    function allowance(address owner, address spender) external view returns (uint256);

    /**
     * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * IMPORTANT: Beware that changing an allowance with this method brings the risk
     * that someone may use both the old and the new allowance by unfortunate
     * transaction ordering. One possible solution to mitigate this race
     * condition is to first reduce the spender's allowance to 0 and set the
     * desired value afterwards:
     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
     *
     * Emits an {Approval} event.
     */
    function approve(address spender, uint256 amount) external returns (bool);

    /**
     * @dev Moves `amount` tokens from `from` to `to` using the
     * allowance mechanism. `amount` is then deducted from the caller's
     * allowance.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 amount) external returns (bool);
}

// File: @openzeppelin/contracts/token/ERC20/extensions/IERC20Permit.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.4) (token/ERC20/extensions/IERC20Permit.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 *
 * ==== Security Considerations
 *
 * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature
 * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be
 * considered as an intention to spend the allowance in any specific way. The second is that because permits have
 * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should
 * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be
 * generally recommended is:
 *
 * ```solidity
 * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {
 *     try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}
 *     doThing(..., value);
 * }
 *
 * function doThing(..., uint256 value) public {
 *     token.safeTransferFrom(msg.sender, address(this), value);
 *     ...
 * }
 * ```
 *
 * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of
 * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also
 * {SafeERC20-safeTransferFrom}).
 *
 * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so
 * contracts should have entry points that don't rely on permit.
 */
interface IERC20Permit {
    /**
     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
     * given ``owner``'s signed approval.
     *
     * IMPORTANT: The same issues {IERC20-approve} has related to transaction
     * ordering also apply here.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `deadline` must be a timestamp in the future.
     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
     * over the EIP712-formatted function arguments.
     * - the signature must use ``owner``'s current nonce (see {nonces}).
     *
     * For more information on the signature format, see the
     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
     * section].
     *
     * CAUTION: See Security Considerations above.
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) external;

    /**
     * @dev Returns the current nonce for `owner`. This value must be
     * included whenever a signature is generated for {permit}.
     *
     * Every successful call to {permit} increases ``owner``'s nonce by one. This
     * prevents a signature from being used multiple times.
     */
    function nonces(address owner) external view returns (uint256);

    /**
     * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
     */
    // solhint-disable-next-line func-name-mixedcase
    function DOMAIN_SEPARATOR() external view returns (bytes32);
}

// File: @openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.3) (token/ERC20/utils/SafeERC20.sol)

pragma solidity ^0.8.0;

import "../IERC20.sol";
import "../extensions/IERC20Permit.sol";
import "../../../utils/Address.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.
 * 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 {
    using Address for address;

    /**
     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeTransfer(IERC20 token, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));
    }

    /**
     * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
     * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
     */
    function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));
    }

    /**
     * @dev Deprecated. This function has issues similar to the ones found in
     * {IERC20-approve}, and its usage is discouraged.
     *
     * Whenever possible, use {safeIncreaseAllowance} and
     * {safeDecreaseAllowance} instead.
     */
    function safeApprove(IERC20 token, address spender, uint256 value) internal {
        // safeApprove should only be called when setting an initial allowance,
        // or when resetting it to zero. To increase and decrease it, use
        // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
        require(
            (value == 0) || (token.allowance(address(this), spender) == 0),
            "SafeERC20: approve from non-zero to non-zero allowance"
        );
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));
    }

    /**
     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        uint256 oldAllowance = token.allowance(address(this), spender);
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, oldAllowance + value));
    }

    /**
     * @dev Decrease the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeDecreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        unchecked {
            uint256 oldAllowance = token.allowance(address(this), spender);
            require(oldAllowance >= value, "SafeERC20: decreased allowance below zero");
            _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, oldAllowance - value));
        }
    }

    /**
     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
     * to be set to zero before setting it to a non-zero value, such as USDT.
     */
    function forceApprove(IERC20 token, address spender, uint256 value) internal {
        bytes memory approvalCall = abi.encodeWithSelector(token.approve.selector, spender, value);

        if (!_callOptionalReturnBool(token, approvalCall)) {
            _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, 0));
            _callOptionalReturn(token, approvalCall);
        }
    }

    /**
     * @dev Use a ERC-2612 signature to set the `owner` approval toward `spender` on `token`.
     * Revert on invalid signature.
     */
    function safePermit(
        IERC20Permit token,
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal {
        uint256 nonceBefore = token.nonces(owner);
        token.permit(owner, spender, value, deadline, v, r, s);
        uint256 nonceAfter = token.nonces(owner);
        require(nonceAfter == nonceBefore + 1, "SafeERC20: permit did not succeed");
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
        // the target address contains contract code and also asserts for success in the low-level call.

        bytes memory returndata = address(token).functionCall(data, "SafeERC20: low-level call failed");
        require(returndata.length == 0 || abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     *
     * This is a variant of {_callOptionalReturn} that silents catches all reverts and returns a bool instead.
     */
    function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We cannot use {Address-functionCall} here since this should return false
        // and not revert is the subcall reverts.

        (bool success, bytes memory returndata) = address(token).call(data);
        return
            success && (returndata.length == 0 || abi.decode(returndata, (bool))) && Address.isContract(address(token));
    }
}

// File: @openzeppelin/contracts/token/ERC721/IERC721.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC721/IERC721.sol)

pragma solidity ^0.8.0;

import "../../utils/introspection/IERC165.sol";

/**
 * @dev Required interface of an ERC721 compliant contract.
 */
interface IERC721 is IERC165 {
    /**
     * @dev Emitted when `tokenId` token is transferred from `from` to `to`.
     */
    event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.
     */
    event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.
     */
    event ApprovalForAll(address indexed owner, address indexed operator, bool approved);

    /**
     * @dev Returns the number of tokens in ``owner``'s account.
     */
    function balanceOf(address owner) external view returns (uint256 balance);

    /**
     * @dev Returns the owner of the `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function ownerOf(uint256 tokenId) external view returns (address owner);

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes calldata data) external;

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients
     * are aware of the ERC721 protocol to prevent tokens from being forever locked.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must have been allowed to move this token by either {approve} or {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Transfers `tokenId` token from `from` to `to`.
     *
     * WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC721
     * or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must
     * understand this adds an external call which potentially creates a reentrancy vulnerability.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Gives permission to `to` to transfer `tokenId` token to another account.
     * The approval is cleared when the token is transferred.
     *
     * Only a single account can be approved at a time, so approving the zero address clears previous approvals.
     *
     * Requirements:
     *
     * - The caller must own the token or be an approved operator.
     * - `tokenId` must exist.
     *
     * Emits an {Approval} event.
     */
    function approve(address to, uint256 tokenId) external;

    /**
     * @dev Approve or remove `operator` as an operator for the caller.
     * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.
     *
     * Requirements:
     *
     * - The `operator` cannot be the caller.
     *
     * Emits an {ApprovalForAll} event.
     */
    function setApprovalForAll(address operator, bool approved) external;

    /**
     * @dev Returns the account approved for `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function getApproved(uint256 tokenId) external view returns (address operator);

    /**
     * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.
     *
     * See {setApprovalForAll}
     */
    function isApprovedForAll(address owner, address operator) external view returns (bool);
}

// File: @openzeppelin/contracts/token/ERC721/IERC721Receiver.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC721/IERC721Receiver.sol)

pragma solidity ^0.8.0;

/**
 * @title ERC721 token receiver interface
 * @dev Interface for any contract that wants to support safeTransfers
 * from ERC721 asset contracts.
 */
interface IERC721Receiver {
    /**
     * @dev Whenever an {IERC721} `tokenId` token is transferred to this contract via {IERC721-safeTransferFrom}
     * by `operator` from `from`, this function is called.
     *
     * It must return its Solidity selector to confirm the token transfer.
     * If any other value is returned or the interface is not implemented by the recipient, the transfer will be reverted.
     *
     * The selector can be obtained in Solidity with `IERC721Receiver.onERC721Received.selector`.
     */
    function onERC721Received(
        address operator,
        address from,
        uint256 tokenId,
        bytes calldata data
    ) external returns (bytes4);
}

// File: @openzeppelin/contracts/utils/Address.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     *
     * Furthermore, `isContract` will also return true if the target contract within
     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,
     * which only has an effect at the end of a transaction.
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        require(address(this).balance >= amount, "Address: insufficient balance");

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason, it is bubbled up by this
     * function (like regular Solidity function calls).
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     *
     * _Available since v3.1._
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, "Address: low-level call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    function _revert(bytes memory returndata, string memory errorMessage) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            /// @solidity memory-safe-assembly
            assembly {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert(errorMessage);
        }
    }
}

// File: @openzeppelin/contracts/utils/Context.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.4) (utils/Context.sol)

pragma solidity ^0.8.0;

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }

    function _contextSuffixLength() internal view virtual returns (uint256) {
        return 0;
    }
}

// File: @openzeppelin/contracts/utils/Strings.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)

pragma solidity ^0.8.0;

import "./math/Math.sol";
import "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant _SYMBOLS = "0123456789abcdef";
    uint8 private constant _ADDRESS_LENGTH = 20;

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), _SYMBOLS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toString(int256 value) internal pure returns (string memory) {
        return string(abi.encodePacked(value < 0 ? "-" : "", toString(SignedMath.abs(value))));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = _SYMBOLS[value & 0xf];
            value >>= 4;
        }
        require(value == 0, "Strings: hex length insufficient");
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

// File: @openzeppelin/contracts/utils/introspection/ERC165.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol)

pragma solidity ^0.8.0;

import "./IERC165.sol";

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check
 * for the additional interface id that will be supported. For example:
 *
 * ```solidity
 * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
 *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
 * }
 * ```
 *
 * Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation.
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// File: @openzeppelin/contracts/utils/introspection/IERC165.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[EIP].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

// File: @openzeppelin/contracts/utils/math/Math.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

    /**
     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0
     * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv)
     * with further edits by Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2^256 + prod0.
            uint256 prod0; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod0 := mul(x, y)
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1, "Math: mulDiv overflow");

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.
            // See https://cs.stackexchange.com/q/138556/92363.

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works
            // in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 128;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 64;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 32;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 16;
            }
            if (value >> 8 > 0) {
                value >>= 8;
                result += 8;
            }
            if (value >> 4 > 0) {
                value >>= 4;
                result += 4;
            }
            if (value >> 2 > 0) {
                value >>= 2;
                result += 2;
            }
            if (value >> 1 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0);
        }
    }
}

// File: @openzeppelin/contracts/utils/math/SignedMath.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

// File: @openzeppelin/contracts/utils/structs/EnumerableSet.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.

pragma solidity ^0.8.0;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableSet.
 * ====
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position of the value in the `values` array, plus 1 because index 0
        // means a value is not in the set.
        mapping(bytes32 => uint256) _indexes;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._indexes[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We read and store the value's index to prevent multiple reads from the same storage slot
        uint256 valueIndex = set._indexes[value];

        if (valueIndex != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 toDeleteIndex = valueIndex - 1;
            uint256 lastIndex = set._values.length - 1;

            if (lastIndex != toDeleteIndex) {
                bytes32 lastValue = set._values[lastIndex];

                // Move the last value to the index where the value to delete is
                set._values[toDeleteIndex] = lastValue;
                // Update the index for the moved value
                set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
            }

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the index for the deleted slot
            delete set._indexes[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value) private view returns (bool) {
        return set._indexes[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index) private view returns (bytes32) {
        return set._values[index];
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function _values(Set storage set) private view returns (bytes32[] memory) {
        return set._values;
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
        return _at(set._inner, index);
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
        bytes32[] memory store = _values(set._inner);
        bytes32[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value) internal returns (bool) {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value) internal returns (bool) {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value) internal view returns (bool) {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index) internal view returns (address) {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(AddressSet storage set) internal view returns (address[] memory) {
        bytes32[] memory store = _values(set._inner);
        address[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value) internal returns (bool) {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value) internal view returns (bool) {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index) internal view returns (uint256) {
        return uint256(_at(set._inner, index));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(UintSet storage set) internal view returns (uint256[] memory) {
        bytes32[] memory store = _values(set._inner);
        uint256[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }
}

// File: contracts/nft-staking/NFTStakingAggregator.sol



//SPDX-License-Identifier: MIT
pragma solidity =0.8.18;

import '@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol';
import '@openzeppelin/contracts/utils/structs/EnumerableSet.sol';
import '@openzeppelin/contracts/access/AccessControlEnumerable.sol';
import '@openzeppelin/contracts/proxy/Clones.sol';

import './NFTStakingPool.sol';

/**
 * @title NFTStakingAggregator
 * @author gotbit
 * @notice Contract is an aggregator for staking pools. It is responsible for creating, initializing and freezing staking pools.
 */
contract NFTStakingAggregator is AccessControlEnumerable {
    using EnumerableSet for EnumerableSet.AddressSet;

    bytes32 public constant ADMIN_ROLE =
        keccak256(abi.encodePacked('ADMIN_ROLE'));

    address payable[] public pools;

    address payable public immutable baseImplementation;

    // name => pool
    mapping(string => address) public poolByName;

    modifier onlySupportedPool(uint256 poolIndex) {
        require(poolIndex < pools.length, 'Pool not supported');
        _;
    }

    modifier onlyFundsManager(uint256 poolIndex) {
        address pool = pools[poolIndex];
        require(hasRole(roleForPool(pool), msg.sender), 'Not funds manager');
        _;
    }

    /// @notice Creates a new contract
    /// @param impl - NFT StakingPool base implementation address
    constructor(address payable impl) {
        require(impl != address(0), 'Impl 0x0');
        baseImplementation = impl;
        _grantRole(DEFAULT_ADMIN_ROLE, msg.sender);
    }

    /// @notice Creates a role for each pool contract
    /// @param poolAddr - NFTStakingPool address
    /// @return role - bytes32 role hash("FUNDS_MANAGER_ROLE" + poolAddr)
    function roleForPool(address poolAddr) public pure returns (bytes32) {
        string memory role = 'FUNDS_MANAGER_ROLE';
        string memory roleStr = string.concat(
            role,
            string(abi.encodePacked(poolAddr))
        );
        return keccak256(abi.encode(roleStr));
    }

    /// @notice Adds bonus tokens to a pool
    /// @param poolIndex - NFTStakingPool index
    /// @param from - token holder
    /// @param amount - token amount
    function addBonusForPool(
        uint256 poolIndex,
        address from,
        uint256 amount
    ) external onlyRole(ADMIN_ROLE) onlySupportedPool(poolIndex) {
        NFTStakingPool(pools[poolIndex]).addBonus(from, amount);
    }

    /// @notice Creates a new pool
    /// @param rewardToken_ - reward token address
    /// @param nftConfigs_ - NFTConfig struct array
    /// @param periods_ - array of structs with stakingPeriods, APRs
    /// @param unstakeData_ - struct with instant / early unstake fees and instant / liquidation delays
    /// @param bonusToken_ - bonus token address
    /// @param bonusQuoteForUnstake_ - amount of a bonus quote which is given to a user after unstake
    function createPool(
        IERC20 rewardToken_,
        NFTStakingPool.NFTConfig[] calldata nftConfigs_,
        NFTStakingPool.Period[] calldata periods_,
        NFTStakingPool.UnstakeData calldata unstakeData_,
        IERC20 bonusToken_,
        uint256 bonusQuoteForUnstake_
    ) external onlyRole(ADMIN_ROLE) {
        address pool = Clones.clone(baseImplementation);

        NFTStakingPool(payable(pool)).initialize(
            rewardToken_,
            nftConfigs_,
            periods_,
            unstakeData_,
            bonusToken_,
            bonusQuoteForUnstake_
        );

        pools.push(payable(pool));
    }

    /// @notice Sets new name and image link for the pool contract
    /// @param pool - staking pool index in pools array
    /// @param name_ New name string
    /// @param imageLink_ New image link string
    function setNameAndLink(
        uint256 pool,
        string calldata name_,
        string calldata imageLink_
    ) external onlyRole(ADMIN_ROLE) onlySupportedPool(pool) {
        address payable poolAddr = pools[pool];
        require(poolByName[name_] == address(0), 'Name is already taken');
        // remove previous name
        string memory oldName = NFTStakingPool(poolAddr).name();
        if ((bytes(oldName)).length != 0) {
            // remove only if name has been set
            poolByName[oldName] = address(0);
        }
        // set the new name
        poolByName[name_] = poolAddr;
        NFTStakingPool(poolAddr).setNameAndLink(name_, imageLink_);
    }

    /// @notice Sets new whitelist for a certain nft in a pool
    /// @param pool - staking pool index in pools array
    /// @param nftIndex - nft index in pool
    /// @param whitelist_ New whitelist
    function setWhitelistForNFT(
        uint256 pool,
        uint256 nftIndex,
        NFTStakingPool.Range[] memory whitelist_
    ) external onlyRole(ADMIN_ROLE) onlySupportedPool(pool) {
        NFTStakingPool(pools[pool]).setWhitelist(nftIndex, whitelist_);
    }

    /// @notice Allows owner to liquidate stake position
    /// @param pool - staking pool index in pools array
    /// @param id Stake id
    /// @param transferFunds Flag (true if transfer principal and rewards to recepient address, else if leave funds on contract address)
    /// @param recepient Fees receiver address
    function liquidate(
        uint256 pool,
        uint256 id,
        bool transferFunds,
        address payable recepient
    ) external onlyRole(ADMIN_ROLE) onlySupportedPool(pool) {
        NFTStakingPool(pools[pool]).liquidate(id, transferFunds, recepient);
    }

    /// @notice Can withdraw extra funds from the pool contract (can be called by the owner only)
    /// @param pool - staking pool index in pools array
    /// @param recepient - recepient address
    /// @param amount - bonus amount
    function withdrawAvailableRewards(
        uint256 pool,
        address payable recepient,
        uint256 amount
    ) external onlySupportedPool(pool) onlyFundsManager(pool) {
        NFTStakingPool(pools[pool]).emergencyWithdrawFunds(recepient, amount);
    }

    /// @notice Can withdraw extra bonus tokens from the pool contract (can be called by the owner only)
    /// @param pool - staking pool index in pools array
    /// @param recepient - recepient address
    /// @param amount - bonus amount
    function withdrawAvailableBonus(
        uint256 pool,
        address recepient,
        uint256 amount
    ) external onlySupportedPool(pool) onlyFundsManager(pool) {
        NFTStakingPool(pools[pool]).emergencyWithdrawBonus(recepient, amount);
    }

    /// @notice Locks a specific staking pool
    /// @param pool - staking pool index in pools array
    function lockPool(
        uint256 pool
    ) external onlyRole(ADMIN_ROLE) onlySupportedPool(pool) {
        require(!NFTStakingPool(pools[pool]).paused(), 'Paused');
        NFTStakingPool(pools[pool]).setPaused(true);
    }

    /// @notice Unlocks a specific staking pool
    /// @param pool - staking pool index in pools array
    function unlockPool(
        uint256 pool
    ) external onlyRole(ADMIN_ROLE) onlySupportedPool(pool) {
        require(NFTStakingPool(pools[pool]).paused(), 'Unpaused');
        NFTStakingPool(pools[pool]).setPaused(false);
    }

    /// @notice Allows to get a slice of pools array
    /// @param offset Starting index in user ids array
    /// @param length return array length
    /// @return Array-slice of pools
    function getPoolsSlice(
        uint256 offset,
        uint256 length
    ) external view returns (address[] memory) {
        address[] memory res = new address[](length);
        for (uint256 i; i < length; ) {
            res[i] = pools[i + offset];
            unchecked {
                ++i;
            }
        }

        return res;
    }

    /// @notice Allows to get a length of pools array
    /// @return Length of user pools array
    function getPoolsLength() external view returns (uint256) {
        return pools.length;
    }
}

// File: contracts/nft-staking/NFTStakingPool.sol



//SPDX-License-Identifier: MIT
pragma solidity =0.8.18;

import '@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol';
import '@openzeppelin/contracts/utils/structs/EnumerableSet.sol';
import '@openzeppelin/contracts/utils/introspection/ERC165.sol';
import '@openzeppelin/contracts/interfaces/IERC721.sol';
import '@openzeppelin/contracts/interfaces/IERC1155.sol';
import '@openzeppelin/contracts/interfaces/IERC1155Receiver.sol';
import '@openzeppelin/contracts/interfaces/IERC721Receiver.sol';

/**
 * @title StakingPool
 * @author gotbit
 * @notice Contract represents aт NFT staking pool. It is created as a proxy clone. Contract can accept ERC20 tokens or native currency as a reward token. It accepts 1 / 2 ERC721 / ERC1155 NFTs as staking asset.
 */
contract NFTStakingPool is ERC165 {
    using SafeERC20 for IERC20;
    using EnumerableSet for EnumerableSet.UintSet;

    enum NFTType {
        ERC721,
        ERC1155
    }

    struct Stake {
        address owner;
        uint256[] ids;
        uint256[] amounts;
        uint32 lastClaimTimestamp;
        uint32 periodIndex;
        uint32 timestamp;
        uint32 unstakedAtBlockTimestamp;
    }

    struct Range {
        uint256 lowerId; // included into range
        uint256 upperId; // included into range
        uint256[] blackListedIds; // excluded from range (blacklistedIds must be in range)
    }

    struct Period {
        uint128 duration;
        uint128 aprNumerator;
    }

    struct UnstakeData {
        uint64 instantUnstakeDelay; // <= Min stake period
        uint64 liquidationDelay; // >= MIN_LIQUIDATION_DELAY
        uint64 instantUnstakePenalty; // nominated in percents multiplied by ACCURACY
        uint64 earlyUnstakePenalty; // nominated in percents multiplied by ACCURACY
    }

    struct NFTConfig {
        address nft;
        NFTType nftType;
        Range[] whitelist;
        uint256 basePrice;
        uint256 copyLimit;
    }

    // CONSTANTS ----------------------------------------------------------------------

    uint256 public constant ACCURACY = 10 ** 3;
    uint256 public constant YEAR = 365 days; // one year in seconds
    uint256 public constant MIN_STAKE_PERIOD = 1 days + 1; // due to technical reasons add 1 sec for early unstake after instant unstake
    uint256 public constant MAX_STAKE_PERIOD = 5 * YEAR;
    uint256 public constant MAX_COPY_AMOUNT = 10 ** 18;
    uint256 public constant MAX_BASE_PRICE = 10 ** 55; // 10 ** 55 * MAX COPY AMOUNT * aprNumerator < 10**77
    uint256 public constant MIN_BASE_PRICE = 10 ** 3;
    uint256 public constant STAKING_PERIODS_LIMIT = 10; // max staking periods count
    uint256 public constant ONE_HUNDRED = 100; // 100%
    uint256 public constant MAX_APR_NUMERATOR = ACCURACY * 10000; // max apr = 10_000%
    uint256 public constant MIN_LIQUIDATION_DELAY = 7 days;
    uint256 public constant NFT_RANGES_LIMIT = 10; // limit of ids ranges for NFT WL
    uint256 public constant BLACKLIST_LIMIT = 10; // max blacklisted nfts count
    uint256 public constant LIMIT_IDS = 500; // 500 IDs per each contract
    uint256 public constant NFTS_LIMIT = 10;
    uint256 public constant MAX_FEE = 300 * ACCURACY; // 300%
    uint256 public constant MULTIPLE_STAKES_IDS_LIMIT = 1;
    uint256 public constant REWARDS_ACCUMULATE_THRESHOLD = 5 minutes;

    // IMMUTABLE ----------------------------------------------------------------------

    address public owner;
    Period[] public stakingPeriods;

    NFTConfig[] public nftConfigs;

    // token if != 0x0, else native currency
    IERC20 public rewardToken;
    // token != 0x0
    IERC20 public bonusToken;
    uint256 public bonusQuoteForUnstake;

    UnstakeData public unstakeInfo;

    // MUTABLE ----------------------------------------------------------------------

    // id => stake
    mapping(uint256 => Stake) public stakes;
    // user => ids array
    mapping(address => uint256[]) public idsByUser;
    // user => acive ids set
    mapping(address => EnumerableSet.UintSet) private activeIdsByUser;
    EnumerableSet.UintSet private activeStakeIds;
    // user => received status
    mapping(uint256 => bool) public receivedBonus;
    // NFT => bool
    mapping(address => bool) public isNFT;
    // max potential reward debt
    uint256 public maxPotentialDebt;
    // bonus token balance (if reward token != bonus token)
    uint256 public bonusBalance;

    string public name;
    string public link;
    uint256 public globalId;

    bool public paused;

    // EVENTS ----------------------------------------------------------------------

    event Staked(
        address indexed user,
        uint256 indexed id,
        uint256[] ids,
        uint256[] amounts,
        uint256 stakingPeriodIndex
    );
    event Withdrawn(address indexed user, uint256 indexed id);
    event Claimed(address indexed user, uint256 indexed id, uint256 rewards);
    event Received(address indexed from, uint256 amount);
    event Liquidated(address indexed user, uint256 indexed id);

    // ERRORS ----------------------------------------------------------------------

    error ContractInit();
    error IndexOutOfBounds();
    error NotSupportedID();
    error NotSet();
    error AlreadySet();
    error NotReceiveETH();
    error NotOwner();
    error MaxPotentialDebtExceeded();
    error PaymentFailure();
    error Duplicate();
    error EmptyStr();
    error WrongRange();
    error Paused();
    error ZeroAddress();

    error ValueTooHigh(string message);
    error ValueTooLow(string message);
    error ValueZero(string message);
    error InvalidLength(string message);
    error IntervalsCrossover(string message);
    error InterfaceNotSupported(string message);
    error InvalidState(string message);

    // MODIFIERS ----------------------------------------------------------------------

    modifier whenBonusSet() {
        if (address(bonusToken) == address(0)) revert NotSet();
        _;
    }

    modifier onlyOwner() {
        if (msg.sender != owner) revert NotOwner();
        _;
    }

    modifier onlySupportedId(uint256 id) {
        if (id > globalId || globalId == 0) revert IndexOutOfBounds();
        _;
    }

    // EXTERNAL WRITE ----------------------------------------------------------------------

    /// @notice default receive payable function to accept ether
    receive() external payable {
        if (address(rewardToken) != address(0)) revert NotReceiveETH();
        emit Received(msg.sender, msg.value);
    }

    /// @notice Adds new bonus amount to contract
    /// @param from Token holder
    /// @param amount Bonus token amount
    function addBonus(
        address from,
        uint256 amount
    ) external onlyOwner whenBonusSet {
        if (amount == 0) revert ValueZero('amount');

        bonusBalance += amount;
        bonusToken.safeTransferFrom(from, address(this), amount);
    }

    /// @notice Inutializes contract
    /// @dev Is called by the staking aggregator
    /// @param rewardToken_ - reward token address
    /// @param nftConfigs_ - NFTConfig struct array
    /// @param periods_ - array of structs with stakingPeriods, APRs
    /// @param unstakeData_ - struct with instant / early unstake fees and instant / liquidation delays
    /// @param bonusToken_ - bonus token address
    /// @param bonusQuoteForUnstake_ - amount of a bonus quote which is given to a user after unstake
    function initialize(
        IERC20 rewardToken_,
        NFTConfig[] calldata nftConfigs_,
        Period[] calldata periods_,
        UnstakeData calldata unstakeData_,
        IERC20 bonusToken_,
        uint256 bonusQuoteForUnstake_
    ) external {
        if (nftConfigs.length != 0) revert ContractInit();

        if (nftConfigs_.length == 0 || nftConfigs_.length > NFTS_LIMIT)
            revert InvalidLength('nft config');
        if (periods_.length == 0 || periods_.length > STAKING_PERIODS_LIMIT)
            revert InvalidLength('periods');

        if (unstakeData_.instantUnstakeDelay >= MIN_STAKE_PERIOD)
            revert ValueTooHigh('instant delay');
        if (unstakeData_.liquidationDelay < MIN_LIQUIDATION_DELAY)
            revert ValueTooLow('liquidation delay');

        if (unstakeData_.instantUnstakePenalty > MAX_FEE)
            revert ValueTooHigh('instant penalty');
        if (unstakeData_.earlyUnstakePenalty > MAX_FEE)
            revert ValueTooHigh('early penalty');

        owner = msg.sender;
        unstakeInfo = unstakeData_;
        rewardToken = rewardToken_;

        if (address(bonusToken_) != address(0) && bonusQuoteForUnstake_ != 0) {
            bonusToken = bonusToken_;
            bonusQuoteForUnstake = bonusQuoteForUnstake_;
        }

        // CHECK STAKING PERIODS + APRs
        _checkPeriod(periods_[0]);
        stakingPeriods.push(periods_[0]);
        for (uint256 i = 1; i < periods_.length; ) {
            // make sure that periods are sorted and unique
            if (periods_[i].duration <= periods_[i - 1].duration)
                revert IntervalsCrossover('periods');

            _checkPeriod(periods_[i]);

            // add the new Period
            stakingPeriods.push(periods_[i]);
            unchecked {
                ++i;
            }
        }
        // added periods

        // CHECK NFTs + WL + BL + BASE PRICE + COPY LIMIT
        for (uint256 i; i < nftConfigs_.length; ) {
            NFTConfig memory config = nftConfigs_[i];
            if (config.nft == address(0)) revert ZeroAddress();
            // check for NFT duplicate
            if (isNFT[config.nft]) revert Duplicate();
            // remember nft address
            isNFT[config.nft] = true;

            if (config.nftType == NFTType.ERC1155) {
                if (
                    !IERC1155(config.nft).supportsInterface(
                        type(IERC1155).interfaceId
                    )
                ) revert InterfaceNotSupported('ERC1155');
            } else {
                if (
                    !IERC721(config.nft).supportsInterface(
                        type(IERC721).interfaceId
                    )
                ) revert InterfaceNotSupported('ERC721');
            }

            // check whitelist + blacklist + allowd id limit
            _checkWhitelist(config.whitelist);

            // check base price
            if (config.basePrice > MAX_BASE_PRICE)
                revert ValueTooHigh('base price');
            if (config.basePrice < MIN_BASE_PRICE)
                revert ValueTooLow('base price');

            // check copy amount

            // not allowed empty stake positions
            if (config.copyLimit == 0) revert ValueZero('copy limit');

            if (config.nftType == NFTType.ERC721) {
                // ERC721 can not have copies
                if (config.copyLimit > 1) revert ValueTooHigh('copy limit');
            } else {
                // ERC1155

                if (nftConfigs_.length == 1) {
                    // Single staking => copy limit <= MAX COPY LIMIT
                    if (config.copyLimit > MAX_COPY_AMOUNT)
                        revert ValueTooHigh('copy limit');
                } else {
                    // Multiple staking => only 1 NFT
                    // if MULTIPLE_STAKES_IDS_LIMIT == 1 => only 1 is allowed
                    if (config.copyLimit > MULTIPLE_STAKES_IDS_LIMIT)
                        revert ValueTooHigh('copy limit');
                }
            }

            // add new config
            nftConfigs.push(nftConfigs_[i]);

            unchecked {
                ++i;
            }
        }
        // added configs
    }

    /// @notice Allows users to stake their NFTs in order to earn rewards
    /// @param ids - an array of ids (one for each NFT collection)
    /// @param amounts - an array of amounts (one for each NFT collection and id)
    /// @param stakingPeriodIndex - index of a desired staking period (duration / apr)
    function stake(
        uint256[] memory ids,
        uint256[] memory amounts,
        uint256 stakingPeriodIndex
    ) external {
        if (paused) revert Paused();
        // check lengths
        uint256 nftCount = nftConfigs.length;
        NFTConfig[] memory configs = nftConfigs;

        if (ids.length != nftCount) revert InvalidLength('ids');
        if (amounts.length != nftCount) revert InvalidLength('amounts');

        // check if a staking period with a given index exists
        if (stakingPeriodIndex >= stakingPeriods.length)
            revert IndexOutOfBounds();

        for (uint256 i; i < ids.length; ) {
            if (!inWhitelist(i, ids[i])) revert NotSupportedID();
            if (amounts[i] == 0) revert ValueZero('amount');
            if (amounts[i] > configs[i].copyLimit)
                revert ValueTooHigh('amount');

            unchecked {
                ++i;
            }
        }

        // increase max potential debt

        Period memory period = stakingPeriods[stakingPeriodIndex];

        maxPotentialDebt += _calculateRewardsForDurationAndStakingPeriod(
            amounts,
            period.aprNumerator,
            period.duration
        );

        uint256 balance = contractBalance();

        // ETH is transferred instantly, ERC20 is transferred manually in the end of tx
        address rewardTokenAddress = address(rewardToken);
        address bonusTokenAddress = address(bonusToken);

        if (rewardTokenAddress != address(0)) {
            // ERC20 => possible bonusToken == stakingToken
            uint256 bonusBalanceLocal = bonusBalance;
            if (
                bonusTokenAddress == rewardTokenAddress &&
                bonusBalanceLocal != 0
            ) {
                // reserve a part of contract balance for rewards
                balance -= bonusBalanceLocal;
            }
        }

        // else
        // ETH => impossible bonusToken == stakingToken
        // bonus token not set => no reserved balance
        // bonus token set and != staking token => no receved balance

        // min debt exceeds current balance => revert
        if (maxPotentialDebt > balance) revert MaxPotentialDebtExceeded();

        // increase global id
        uint256 id = ++globalId;

        // add stake
        stakes[id] = Stake({
            owner: msg.sender,
            ids: ids,
            amounts: amounts,
            lastClaimTimestamp: uint32(block.timestamp), // no claim yet
            periodIndex: uint32(stakingPeriodIndex),
            timestamp: uint32(block.timestamp),
            unstakedAtBlockTimestamp: 0
        });

        idsByUser[msg.sender].push(id);
        activeIdsByUser[msg.sender].add(id);
        activeStakeIds.add(id);

        emit Staked(msg.sender, id, ids, amounts, stakingPeriodIndex);

        // receive funds
        _transferNFT(
            nftCount,
            configs,
            msg.sender,
            address(this),
            ids,
            amounts
        );
    }

    /// @notice Allows user to withdraw staked NFTs + claim earned rewards - penalties
    /// @param id Stake id
    function withdraw(uint256 id) external payable onlySupportedId(id) {
        Stake storage _stake = stakes[id];
        // check if already unstaked
        if (_stake.unstakedAtBlockTimestamp != 0)
            revert InvalidState('unstaked');

        // check if can be unstaked by user (NOT liquidation)

        Period memory period = stakingPeriods[_stake.periodIndex];
        if (
            block.timestamp >
            _stake.timestamp + period.duration + unstakeInfo.liquidationDelay
        ) revert InvalidState('liquidated');

        // check if stake owner unstakes position
        if (_stake.owner != msg.sender) revert NotOwner();

        // strict < (because real duration < stake period => early unstake)
        if (block.timestamp < _stake.timestamp + period.duration) {
            // EARLY UNSTAKE
            (, uint256 earnedAmount, uint256 claimedAmount) = _internalClaim(
                id,
                _stake,
                period,
                false,
                true
            );

            // early / instant unstake => pay fees to unstake
            uint256 actualStakingTime = block.timestamp - _stake.timestamp;
            UnstakeData memory unstakeDataLocal = unstakeInfo;
            uint256 fee;
            if (actualStakingTime < unstakeDataLocal.instantUnstakeDelay) {
                // INSTANT UNSTAKE
                fee = unstakeDataLocal.instantUnstakePenalty;
            } else {
                // EARLY UNSTAKE
                fee = unstakeDataLocal.earlyUnstakePenalty;
            }

            // the goal is: contract holds all earned reward + fees
            // target amount = earned * (100% + fee)
            uint256 rewardPenalty = (earnedAmount * fee) /
                (ONE_HUNDRED * ACCURACY);

            // user has to payback all claimed rewards + reward fee
            uint256 rewardToContract = claimedAmount + rewardPenalty;

            // update stake struct
            stakes[id].lastClaimTimestamp = _stake.timestamp;

            _deactivateStake(id, msg.sender);

            // request fees + claimed rewards
            _accept(msg.sender, rewardToContract);
        } else {
            // late unstake => pay left rewards
            (uint256 reward, , ) = _internalClaim(
                id,
                _stake,
                period,
                false,
                false
            );

            // update stake struct
            stakes[id].lastClaimTimestamp = uint32(block.timestamp);

            // NO LIQUIDATION HERE, THE RETURN STATEMENT FOR LIQUIDATION IS ABOVE
            // unstake in time => if bonus not set => no ability to receive bonus => make bonus inactive
            if (address(bonusToken) == address(0))
                _deactivateStake(id, _stake.owner);

            // pay left rewards
            if (reward != 0) _pay(msg.sender, reward);
        }

        emit Withdrawn(msg.sender, id);

        // transfer principal NFT back
        _transferNFT(
            _stake.ids.length,
            nftConfigs,
            address(this),
            msg.sender,
            _stake.ids,
            _stake.amounts
        );
    }

    /// @notice Allows owner to liquidate stake position
    /// @param id Stake id
    /// @param transferFunds Flag (true if transfer principal and rewards to recepient address, else if leave funds on contract address)
    /// @param recepient Fees receiver address
    function liquidate(
        uint256 id,
        bool transferFunds,
        address recepient
    ) external onlyOwner onlySupportedId(id) {
        Stake storage _stake = stakes[id];
        if (_stake.unstakedAtBlockTimestamp != 0)
            revert InvalidState('unstaked');
        // check if can be unstaked by user (NOT liquidation)
        Period storage period = stakingPeriods[_stake.periodIndex];
        if (
            block.timestamp <=
            _stake.timestamp + period.duration + unstakeInfo.liquidationDelay
        ) revert InvalidState('only withdraw');

        (uint256 reward, , ) = _internalClaim(id, _stake, period, false, false);

        _deactivateStake(id, _stake.owner);

        if (recepient == address(0)) revert ZeroAddress();

        emit Liquidated(msg.sender, id);

        // pay rewards if needed
        if (transferFunds) {
            if (reward != 0) _pay(recepient, reward);
        }

        // transfer principal NFT to recepient
        _transferNFT(
            _stake.ids.length,
            nftConfigs,
            address(this),
            recepient,
            _stake.ids,
            _stake.amounts
        );
    }

    /// @notice Internal withdraw / claim / liquidate logic
    /// @param id - stake id
    /// @param stakeData - stake struct instance
    /// @param period - period struct instance
    /// @param isClaim - flag showing if set stake to unstaked or not
    /// @param useRewardAccumulateThreshold - flag showing if earned amount should be calculated not continuously by with a certain step
    /// @return reward - current reward accumulated,  earnedAmount - total reward accumulated,  claimedAmount - previously claimed reward
    function _internalClaim(
        uint256 id,
        Stake memory stakeData,
        Period memory period,
        bool isClaim,
        bool useRewardAccumulateThreshold
    )
        private
        returns (uint256 reward, uint256 earnedAmount, uint256 claimedAmount)
    {
        uint256 claimDuration = stakeData.lastClaimTimestamp -
            stakeData.timestamp;
        claimedAmount = _calculateRewardsForDurationAndStakingPeriod(
            stakeData.amounts,
            period.aprNumerator,
            claimDuration
        );

        uint256 stakeDuration = getStakeRealDuration(id);
        reward =
            _calculateRewardsForDurationAndStakingPeriod(
                stakeData.amounts,
                period.aprNumerator,
                stakeDuration
            ) -
            claimedAmount; // total earned reward - claimed reward

        if (useRewardAccumulateThreshold) {
            // duration accumulates each REWARDS_ACCUMULATE_THRESHOLD seconds (not continuously)
            stakeDuration -= stakeDuration % REWARDS_ACCUMULATE_THRESHOLD;
        }

        earnedAmount = _calculateRewardsForDurationAndStakingPeriod(
            stakeData.amounts,
            period.aprNumerator,
            stakeDuration
        );

        if (isClaim) {
            if (reward == 0) revert ValueZero('reward'); // reward = 0, claim => revert
            maxPotentialDebt -= reward;
            stakes[id].lastClaimTimestamp = uint32(block.timestamp);
        } else {
            // substract the max potential debt
            maxPotentialDebt -= _calculateRewardsForDurationAndStakingPeriod(
                stakeData.amounts,
                period.aprNumerator,
                period.duration - claimDuration // substract only unclaimed reward
            );
            stakes[id].unstakedAtBlockTimestamp = uint32(block.timestamp);
        }
    }

    /// @notice Allows to claim all currently earned reward without unstaking the principal
    /// @param id Stake id
    function claim(uint256 id) external onlySupportedId(id) {
        Stake storage _stake = stakes[id];
        if (_stake.unstakedAtBlockTimestamp != 0)
            revert InvalidState('unstaked');
        if (_stake.owner != msg.sender) revert NotOwner();
        // check if stake is in progress
        Period storage period = stakingPeriods[_stake.periodIndex];
        if (block.timestamp > _stake.timestamp + period.duration)
            revert InvalidState('period ended');

        (uint256 reward, , ) = _internalClaim(id, _stake, period, true, false);

        // ALL TRANSFERS -------------------------------------------------------

        emit Claimed(msg.sender, id, reward);

        // reward != 0 here
        _pay(msg.sender, reward);
    }

    /// @notice Allows user to receive bonus if stake was unstaked safely (not early / instant unstake, not liquidation)
    /// @param id Stake id
    function receiveBonus(
        uint256 id
    ) external whenBonusSet onlySupportedId(id) {
        Stake storage _stake = stakes[id];
        if (receivedBonus[id]) revert InvalidState('received');

        // stake must be withdrawn
        if (_stake.unstakedAtBlockTimestamp == 0)
            revert InvalidState('not unstaked');
        if (_stake.owner != msg.sender) revert NotOwner();

        Period storage period = stakingPeriods[_stake.periodIndex];

        // unstake timestamp != 0 && unstake timestamp > stake timestamp
        uint256 holdTime = _stake.unstakedAtBlockTimestamp - _stake.timestamp;
        if (holdTime > period.duration + unstakeInfo.liquidationDelay)
            revert InvalidState('liquidated');
        if (holdTime < period.duration) revert InvalidState('early withdraw');

        // prevent from double spend
        receivedBonus[id] = true;

        _deactivateStake(id, msg.sender);

        // check bonus balance is sufficient, works even if reward token = bonus token
        if (bonusBalance < bonusQuoteForUnstake)
            revert ValueTooLow('bonus balance');

        bonusBalance -= bonusQuoteForUnstake;

        bonusToken.safeTransfer(_stake.owner, bonusQuoteForUnstake);
    }

    /// @notice Sets paused state for the contract (can be called by the owner only)
    /// @param paused_ paused flag
    function setPaused(bool paused_) external onlyOwner {
        paused = paused_;
    }

    /// @notice Can withdraw extra bonus tokens from the pool contract (can be called by the owner only)
    /// @param recepient - recepient address
    /// @param amount - bonus amount
    function emergencyWithdrawBonus(
        address recepient,
        uint256 amount
    ) external onlyOwner whenBonusSet {
        if (recepient == address(0)) revert ZeroAddress();
        if (amount == 0) revert ValueZero('amount');
        if (amount > bonusBalance) revert ValueTooHigh('amount');

        bonusBalance -= amount;

        bonusToken.safeTransfer(recepient, amount);
    }

    /// @notice Can withdraw extra funds from the pool contract (can be called by the owner only)
    /// @param recepient - recepient address
    /// @param amount - funds amount
    function emergencyWithdrawFunds(
        address payable recepient,
        uint256 amount
    ) external onlyOwner {
        if (recepient == address(0)) revert ZeroAddress();
        if (amount == 0) revert ValueZero('amount');
        if (amount > getRewardsAvailable()) revert ValueTooHigh('amount');
        _pay(recepient, amount);
    }

    /// @notice Sets new name and image link for the pool contract
    /// @param name_ New name string
    /// @param link_ New image link string
    function setNameAndLink(
        string calldata name_,
        string calldata link_
    ) external onlyOwner {
        if ((bytes(name_)).length == 0) revert EmptyStr();
        if ((bytes(link_)).length == 0) revert EmptyStr();
        name = name_;
        link = link_;
    }

    /// @notice Sets new whitelist for a given NFT collection
    /// @param nftIndex nft collection index in nftConfigs array
    /// @param whitelist_ new whitelist
    function setWhitelist(
        uint256 nftIndex,
        Range[] memory whitelist_
    ) external onlyOwner {
        if (nftIndex >= nftConfigs.length) revert IndexOutOfBounds();
        _checkWhitelist(whitelist_);

        uint256 len = whitelist_.length;
        delete nftConfigs[nftIndex].whitelist;
        for (uint256 i; i < len; ) {
            nftConfigs[nftIndex].whitelist.push(whitelist_[i]);
            unchecked {
                ++i;
            }
        }
    }

    /// @notice ERC165 function supportsInterface, in this case it detects that a contract is IERC1155 / IERC721 Receiver
    /// @return interfaceId - the corresponding bytes representation of interface id
    function supportsInterface(
        bytes4 interfaceId
    ) public view virtual override(ERC165) returns (bool) {
        return
            interfaceId == type(IERC1155Receiver).interfaceId ||
            interfaceId == type(IERC721Receiver).interfaceId ||
            super.supportsInterface(interfaceId);
    }

    /// @notice ERC1155 function onERC1155Received
    /// @return selector - the corresponding bytes representation of this function signature
    function onERC1155Received(
        address,
        address,
        uint256,
        uint256,
        bytes memory
    ) external virtual returns (bytes4) {
        return this.onERC1155Received.selector;
    }

    /// @notice ERC1155 function onERC1155BatchReceived
    /// @return selector - the corresponding bytes representation of this function signature
    function onERC1155BatchReceived(
        address,
        address,
        uint256[] memory,
        uint256[] memory,
        bytes memory
    ) external virtual returns (bytes4) {
        return this.onERC1155BatchReceived.selector;
    }

    /// @notice ERC721 function onERC721Received
    /// @return selector - the corresponding bytes representation of this function signature
    function onERC721Received(
        address,
        address,
        uint256,
        bytes memory
    ) external virtual returns (bytes4) {
        return this.onERC721Received.selector;
    }

    // PUBLIC VIEW ----------------------------------------------------------------------

    /// @notice Checks if a certain ID is allowed by the corresponding whitelist
    /// @dev Uses max O(M + N), where M - WL length (M <= 10), N - sum of BL`s lengths (N <= 10)
    /// @param nftIndex - NFTs index in protocol
    /// @param id - NFT id
    /// @return true - if id is allowed for the NFT WL, else - false
    function inWhitelist(
        uint256 nftIndex,
        uint256 id
    ) public view returns (bool) {
        if (nftIndex >= nftConfigs.length) revert IndexOutOfBounds();
        NFTConfig memory config = nftConfigs[nftIndex];

        for (uint256 rangeIndex; rangeIndex < config.whitelist.length; ) {
            Range memory range = config.whitelist[rangeIndex];
            // check if id is in range
            if (id >= range.lowerId && id <= range.upperId) {
                // check if id is not blacklisted
                for (
                    uint256 blacklistId;
                    blacklistId < range.blackListedIds.length;

                ) {
                    // return False if id is in BL
                    if (id == range.blackListedIds[blacklistId]) return false;

                    unchecked {
                        ++blacklistId;
                    }
                }

                // ID in range and is not blacklisted => ID is allowed
                return true;
            }

            // Continue => check the next range
            unchecked {
                ++rangeIndex;
            }
        }

        // all rounds are checked => ID is not included into rounds
        return false;
    }

    /// @notice Allows to view staking token contract balance
    /// @return balance of staking token contract balance
    function contractBalance() public view returns (uint256) {
        if (address(rewardToken) != address(0))
            return rewardToken.balanceOf(address(this));
        else return address(this).balance;
    }

    /// @notice Returns rewards which can be distributed to new users
    /// @return Max reward available at the moment
    function getRewardsAvailable() public view returns (uint256) {
        // maxPotentialDebt = sum of principal + sum of max potential reward
        uint256 balance = contractBalance();
        // can not withdraw bonus here
        uint256 debt;
        if (address(bonusToken) == address(rewardToken))
            debt = maxPotentialDebt + bonusBalance;
        else debt = maxPotentialDebt;

        return (balance > debt) ? balance - debt : 0;
    }

    /// @notice Allows to view current user earned rewards
    /// @param id to view rewards
    /// @return earned - Amount of rewards for the selected user stake
    function earned(uint256 id) external view returns (uint256) {
        Stake storage _stake = stakes[id];
        if (_stake.unstakedAtBlockTimestamp == 0) {
            // ACTIVE STAKE => calculate amount + increase reward per token
            // amountForDuration >= amount
            Period storage period = stakingPeriods[_stake.periodIndex];
            return
                _calculateRewardsForDurationAndStakingPeriod(
                    _stake.amounts,
                    period.aprNumerator,
                    getStakeRealDuration(id)
                );
        }

        // INACTIVE STAKE
        return 0;
    }

    /// @notice Returns the stake exact hold time
    /// @param id stake id
    /// @return duration - stake exact hold time
    function getStakeRealDuration(
        uint256 id
    ) internal view returns (uint256 duration) {
        Stake storage _stake = stakes[id];
        Period storage period = stakingPeriods[_stake.periodIndex];
        uint256 holdTime = block.timestamp - _stake.timestamp;
        uint256 stakingPeriod = period.duration;
        duration = holdTime > stakingPeriod ? stakingPeriod : holdTime;
    }

    /// @notice Returns all available staking periods
    /// @return periods - an array of Period structs
    function getStakePeriods() external view returns (Period[] memory) {
        return stakingPeriods;
    }

    /// @notice Returns all available nft configs
    /// @return configs - an array of NFTConfig structs
    function getNFTConfigs() external view returns (NFTConfig[] memory) {
        return nftConfigs;
    }

    /// @notice Returns a stake struct with a given id
    /// @return stake - Stake struct instance
    function getStake(uint256 id) external view returns (Stake memory) {
        return stakes[id];
    }

    /// @notice Allows to get a slice of user stake ids array
    /// @param user user account
    /// @param offset Starting index in user ids array
    /// @param length return array length
    /// @return Array-slice of user stake ids
    function getUserStakesIdsSlice(
        address user,
        uint256 offset,
        uint256 length
    ) external view returns (uint256[] memory) {
        uint256[] memory res = new uint256[](length);
        for (uint256 i; i < length; ) {
            res[i] = idsByUser[user][i + offset];
            unchecked {
                ++i;
            }
        }
        return res;
    }

    /// @notice Allows to get a slice of current active stake ids array
    /// @param offset Starting index in ids array
    /// @param length return array length
    /// @return Array-slice of active stake ids
    function getActiveStakesIdsSlice(
        uint256 offset,
        uint256 length
    ) external view returns (uint256[] memory) {
        uint256[] memory res = new uint256[](length);
        for (uint256 i; i < length; ) {
            res[i] = activeStakeIds.at(i + offset);
            unchecked {
                ++i;
            }
        }
        return res;
    }

    /// @notice Allows to get a slice of current active user`s stake ids array
    /// @param user - staker address
    /// @param offset Starting index in user ids array
    /// @param length return array length
    /// @return Array-slice of user active stake ids
    function getUserActiveStakesIdsSlice(
        address user,
        uint256 offset,
        uint256 length
    ) external view returns (uint256[] memory) {
        uint256[] memory res = new uint256[](length);
        for (uint256 i; i < length; ) {
            res[i] = activeIdsByUser[user].at(i + offset);
            unchecked {
                ++i;
            }
        }
        return res;
    }

    /// @notice Allows to get a length of current active user`s stake ids array
    /// @param user - staker address
    /// @return Length of user active stake ids array
    function getUserActiveStakesIdsLength(
        address user
    ) external view returns (uint256) {
        return activeIdsByUser[user].length();
    }

    /// @notice Allows to get a length of current active stake ids array
    /// @return Length of active stake ids array
    function getActiveStakesIdsLength() external view returns (uint256) {
        return activeStakeIds.length();
    }

    /// @notice Allows to get a length of user`s stake ids array
    /// @param user - staker address
    /// @return Length of user stake ids array
    function getUserStakesLength(address user) external view returns (uint256) {
        return idsByUser[user].length;
    }

    // PRIVATE ----------------------------------------------------------------------

    /// @notice Calculates the max potential reward after unstake for a stake (without substracting penalties)
    /// @param amounts - staked NFT`s copy amounts
    /// @param aprNumerator - APR numerator
    /// @param duration - stake hold period
    /// @return reward potential unstaked reward
    function _calculateRewardsForDurationAndStakingPeriod(
        uint256[] memory amounts,
        uint256 aprNumerator,
        uint256 duration
    ) private view returns (uint256) {
        uint256 rewardNumerator;
        uint256 len = nftConfigs.length;
        for (uint256 nftIndex; nftIndex < len; ) {
            // only one storage accessing here
            rewardNumerator +=
                nftConfigs[nftIndex].basePrice *
                amounts[nftIndex];
            unchecked {
                ++nftIndex;
            }
        }

        return
            (rewardNumerator * aprNumerator * duration) /
            (YEAR * ONE_HUNDRED * ACCURACY);
    }

    /// @notice Checks if a period is correcty set
    /// @param period - Period struct instance
    function _checkPeriod(Period memory period) private pure {
        if (period.duration < MIN_STAKE_PERIOD) revert ValueTooLow('duration');
        if (period.duration > MAX_STAKE_PERIOD) revert ValueTooHigh('duration');

        if (period.aprNumerator > MAX_APR_NUMERATOR) revert ValueTooHigh('apr');
    }

    /// @notice Checks if a whitelist is correcty set
    /// @param whitelist - Range[] struct instance array, the new whitelist
    function _checkWhitelist(Range[] memory whitelist) private pure {
        if (whitelist.length == 0 || whitelist.length > NFT_RANGES_LIMIT)
            revert InvalidLength('ranges');
        // check if total IDS number is <= 500
        uint256 totalIdsCount = _checkWhitelistRange(whitelist[0]);
        uint256 totalBlackListLength = whitelist[0].blackListedIds.length;

        // max LIMIT_IDS allowed for each whitelist
        if (totalIdsCount > LIMIT_IDS) revert ValueTooHigh('ids count');
        // max BLACKLIST_LIMIT allowed for blacklist in total
        if (totalBlackListLength > BLACKLIST_LIMIT) revert ValueTooHigh('bl');

        for (uint256 i = 1; i < whitelist.length; ) {
            Range memory range = whitelist[i];
            totalIdsCount += _checkWhitelistRange(range);
            totalBlackListLength += whitelist[i].blackListedIds.length;

            // max LIMIT_IDS allowed for each whitelist
            if (totalIdsCount > LIMIT_IDS) revert ValueTooHigh('ids count');
            // max BLACKLIST_LIMIT allowed for blacklist in total
            if (totalBlackListLength > BLACKLIST_LIMIT)
                revert ValueTooHigh('bl');

            // check ranges not overlap and are sorted
            if (range.lowerId <= whitelist[i - 1].upperId)
                revert IntervalsCrossover('ranges');

            unchecked {
                ++i;
            }
        }
    }

    /// @notice Checks if a range is correcty set
    /// @param range - Range struct instance
    function _checkWhitelistRange(
        Range memory range
    ) private pure returns (uint256 length) {
        /*
            1) check lowerId <= upperId
            2) check all blacklistedIds in range (>= lowerId && <= upperId)
            3) check range allows at least id (blacklist.len < rangeLen)
        */
        if (range.lowerId > range.upperId) revert WrongRange();

        uint256 rangeLen = range.upperId - range.lowerId + 1;
        uint256 blLength = range.blackListedIds.length;

        if (rangeLen <= blLength) revert InvalidLength('bl > range');

        for (uint256 j; j < blLength; ) {
            if (
                range.blackListedIds[j] < range.lowerId ||
                range.blackListedIds[j] > range.upperId
            ) revert IndexOutOfBounds();
            unchecked {
                ++j;
            }
        }

        return rangeLen - blLength;
    }

    /// @notice Internal function to transfer ERC721 and ERC1155 NFTs
    /// @param nftCount - NFT collections count
    /// @param configs - NFT configs
    /// @param from - NFT holder
    /// @param to - NFT receiver
    /// @param ids - an array of ids (one for each NFT collection)
    /// @param amounts - an array of amounts (one for each NFT collection and id)
    function _transferNFT(
        uint256 nftCount,
        NFTConfig[] memory configs,
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory amounts
    ) private {
        for (uint256 i; i < nftCount; ) {
            if (NFTType.ERC1155 == configs[i].nftType) {
                IERC1155(configs[i].nft).safeTransferFrom(
                    from,
                    to,
                    ids[i],
                    amounts[i],
                    ''
                );
            } else {
                IERC721(configs[i].nft).safeTransferFrom(from, to, ids[i]);
            }
            unchecked {
                ++i;
            }
        }
    }

    /// @notice Transfers ETH or ERC20 tokens to recepient
    /// @param to - token recepient
    /// @param amount - token amount
    function _pay(address to, uint256 amount) private {
        if (address(rewardToken) == address(0)) {
            // pay ether
            (bool success, ) = payable(to).call{value: amount}('');
            if (!success) revert PaymentFailure();
        } else {
            // transfer ERC20
            rewardToken.safeTransfer(to, amount);
        }
    }

    /// @notice Receives ETH or ERC20 tokens from account
    /// @param from - token holder
    /// @param amount - token amount
    function _accept(address from, uint256 amount) private {
        if (address(rewardToken) == address(0)) {
            // pay ether
            if (msg.value < amount) revert ValueTooLow('amount');
        } else {
            // transfer ERC20
            rewardToken.safeTransferFrom(from, address(this), amount);
        }
    }

    /// @notice Removes stake from active list
    /// @param id - stake id
    function _deactivateStake(uint256 id, address stakeOwner) private {
        activeIdsByUser[stakeOwner].remove(id);
        activeStakeIds.remove(id);
    }
}