gksato/1-install.sh

## 1-install.sh
#! /bin/bash

sudo apt-get update
sudo apt-get upgrade -y
apt-get install -y build-essential curl libffi-dev libffi8ubuntu1 libgmp-dev libgmp10 libncurses-dev libncurses5 libtinfo5 llvm-13

curl --proto '=https' --tlsv1.2 -sSf https://get-ghcup.haskell.org | BOOTSTRAP_HASKELL_NONINTERACTIVE=1 BOOTSTRAP_HASKELL_GHC_VERSION=9.4.4 BOOTSTRAP_HASKELL_CABAL_VERSION=3.8.1.0 BOOTSTRAP_HASKELL_INSTALL_NO_STACK=1 sh
source ~/.ghcup/env

cd /judge

mkdir -p submission/app

cd submission

cat > submission.cabal <<'PKG_CABAL_EOF'
cabal-version:      3.4
name:               submission
version:            0.1.0.0
synopsis:           A Haskell program submitted to AtCoder
-- description:
license:            NONE
author:             submitter-anonymous
maintainer:         NONE
-- copyright:
category:           Competitive
build-type:         Simple
-- extra-doc-files:    CHANGELOG.md
-- extra-source-files:

common warnings
    ghc-options: -Wall

executable main
    import:           warnings
    main-is:          Main.hs
    -- other-modules:
    -- other-extensions:
    build-depends:
                  base ^>=4.17.0.0,
                  QuickCheck,
                  array,
                  attoparsec,
                  bitvec,
                  bytestring,
                  containers,
                  deepseq,
                  exceptions,
                  extra,
                  fgl,
                  ghc-bignum,
                  hashable,
                  heaps,
                  integer-logarithms,
                  lens,
                  linear-base,
                  massiv,
                  mono-traversable,
                  mtl,
                  mutable-containers,
                  mwc-random,
                  parallel,
                  parsec,
                  primitive,
                  psqueues,
                  random,
                  reflection,
                  regex-tdfa,
                  safe-exceptions,
                  template-haskell,
                  text,
                  tf-random,
                  transformers,
                  unboxing-vector,
                  unordered-containers,
                  utility-ht,
                  vector,
                  vector-algorithms,
                  vector-stream,
                  vector-th-unbox

    hs-source-dirs:   app
    default-language: GHC2021
PKG_CABAL_EOF

cat > cabal.project <<'CABAL_PROJECT_EOF'
packages: ./submission.cabal

constraints: bitvec +libgmp,
             clock +llvm,
             vector-algorithms +llvm
optimization: 2

package *
    compiler: ghc
    ghc-options: -fllvm -Wall

CABAL_PROJECT_EOF

echo "main = return () :: IO ()" > app/Main.hs

cabal v2-update
cabal v2-freeze
cabal v2-build --only-dependencies

rm app/Main.hs


## 2-license-report.md

      
    Raw
  

              2-license-report.md
            
          
    Dependency License Report

Bold-faced **package-name**s denote standard libraries bundled with ghc-9.4.4.
Direct dependencies of submission:exe:main


Name
Version
SPDX License Id
Description
Also depended upon by


QuickCheck
2.14.2
BSD-3-Clause
Automatic testing of Haskell programs
storable-record


array
0.5.4.0
BSD-3-Clause
Mutable and immutable arrays
adjunctions, attoparsec, binary, containers, deepseq, fgl, indexed-traversable, integer-logarithms, invariant, kan-extensions, lens, parallel, regex-base, regex-tdfa, stm, text


attoparsec
0.14.4
BSD-3-Clause
Fast combinator parsing for bytestrings and text


base
4.17.0.0
BSD-3-Clause
Basic libraries
(core library)


bitvec
1.1.3.0
BSD-3-Clause
Space-efficient bit vectors
vector-algorithms


bytestring
0.11.3.1
BSD-3-Clause
Fast, compact, strict and lazy byte strings with a list interface
attoparsec, binary, bitvec, hashable, lens, massiv, mono-traversable, parsec, random, regex-base, regex-tdfa, scientific, strict, text, unix, vector-algorithms


containers
0.6.6
BSD-3-Clause
Assorted concrete container types
QuickCheck, adjunctions, attoparsec, bifunctors, binary, comonad, fgl, free, hashable, indexed-traversable, invariant, kan-extensions, lens, linear-base, linear-generics, mono-traversable, mutable-containers, parallel, regex-base, regex-tdfa, scientific, semigroupoids, th-abstraction


deepseq
1.4.8.0
BSD-3-Clause
Deep evaluation of data structures
QuickCheck, attoparsec, bitvec, bytestring, containers, fgl, hashable, massiv, math-functions, parallel, pretty, primitive, process, psqueues, pvar, random, safe-exceptions, scheduler, scientific, splitmix, strict, tagged, text, these, time, unboxing-vector, unordered-containers, vector


exceptions
0.10.5
BSD-3-Clause
Extensible optionally-pure exceptions
free, lens, massiv, safe-exceptions, scheduler


extra
1.7.12
BSD-3-Clause
Extra functions I use.


fgl
5.8.1.1
BSD-3-Clause
Martin Erwig's Functional Graph Library


ghc-bignum
1.3
BSD-3-Clause
GHC BigNum library
base, bitvec, hashable, integer-logarithms


hashable
1.4.2.0
BSD-3-Clause
A class for types that can be converted to a hash value
lens, linear-base, mono-traversable, psqueues, scientific, semigroupoids, strict, these, unordered-containers


heaps
0.4
BSD-3-Clause
Asymptotically optimal Brodal/Okasaki heaps.


integer-logarithms
1.0.3.1
MIT
Integer logarithms.
scientific


lens
5.2.1
BSD-2-Clause
Lenses, Folds and Traversals


linear-base
0.3.0
MIT
Standard library for linear types.


massiv
1.0.3.0
BSD-3-Clause
Massiv (Массив) is an Array Library.


mono-traversable
1.0.15.3
MIT
Type classes for mapping, folding, and traversing monomorphic containers
mutable-containers, unboxing-vector


mtl
2.2.2
BSD-3-Clause
Monad classes, using functional dependencies
adjunctions, exceptions, free, kan-extensions, lens, parsec, random, regex-tdfa


mutable-containers
0.3.4.1
MIT
Abstactions and concrete implementations of mutable containers


mwc-random
0.15.0.2
BSD-3-Clause
Fast, high quality pseudo random number generation


parallel
3.2.2.0
BSD-3-Clause
Parallel programming library
lens


parsec
3.1.15.0
BSD-2-Clause
Monadic parser combinators
regex-tdfa


primitive
0.8.0.0
BSD-3-Clause
Primitive memory-related operations
atomic-primops, bitvec, linear-base, massiv, math-functions, mutable-containers, mwc-random, pvar, scheduler, scientific, tf-random, unboxing-vector, vector, vector-algorithms


psqueues
0.2.7.3
BSD-3-Clause
Pure priority search queues


random
1.2.1.1
BSD-3-Clause
Pseudo-random number generation
QuickCheck, massiv, mwc-random, tf-random


reflection
2.1.7
BSD-3-Clause
Reifies arbitrary terms into types that can be reflected back into terms
lens


regex-tdfa
1.3.2
BSD-3-Clause
Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)


safe-exceptions
0.1.7.3
MIT
Safe, consistent, and easy exception handling


template-haskell
2.19.0.0
BSD-3-Clause
Support library for Template Haskell
OneTuple, QuickCheck, bifunctors, bytestring, containers, exceptions, free, invariant, lens, linear-generics, primitive, reflection, scientific, semigroupoids, tagged, text, th-abstraction, unordered-containers, vector-th-unbox


text
2.0.1
BSD-2-Clause
An efficient packed Unicode text type.
attoparsec, hashable, lens, linear-base, mono-traversable, parsec, regex-base, regex-tdfa, scientific, strict


tf-random
0.5
BSD-3-Clause
High-quality splittable pseudorandom number generator


transformers
0.5.6.2
BSD-3-Clause
Concrete functor and monad transformers
QuickCheck, StateVar, adjunctions, attoparsec, bifunctors, comonad, contravariant, distributive, exceptions, fgl, free, indexed-traversable, invariant, kan-extensions, lens, linear-base, mono-traversable, mtl, primitive, profunctors, safe-exceptions, semigroupoids, storable-record, strict, tagged, transformers-base, transformers-compat, unliftio-core


unboxing-vector
0.2.0.0
BSD-3-Clause
A newtype-friendly variant of unboxed vectors


unordered-containers
0.2.19.1
BSD-3-Clause
Efficient hashing-based container types
indexed-traversable-instances, invariant, lens, mono-traversable, semigroupoids


utility-ht
0.0.16
BSD-3-Clause
Various small helper functions for Lists, Maybes, Tuples, Functions
storable-record, storable-tuple


vector
0.13.0.0
BSD-3-Clause
Efficient Arrays
bitvec, indexed-traversable-instances, lens, linear-base, massiv, math-functions, mono-traversable, mutable-containers, mwc-random, unboxing-vector, vector-algorithms, vector-th-unbox


vector-algorithms
0.9.0.1
BSD-3-Clause
Efficient algorithms for vector arrays
mono-traversable


vector-stream
0.1.0.0
BSD-3-Clause
Efficient Streams
massiv, vector


vector-th-unbox
0.2.2
BSD-3-Clause
Deriver for Data.Vector.Unboxed using Template Haskell


Indirect transitive dependencies


Name
Version
SPDX License Id
Description
Depended upon by


OneTuple
0.4.1.1
BSD-3-Clause
Singleton Tuple
indexed-traversable-instances


StateVar
1.2.2
BSD-3-Clause
State variables
contravariant, invariant


adjunctions
4.4.2
BSD-3-Clause
Adjunctions and representable functors
kan-extensions


assoc
1.0.2
BSD-3-Clause
swap and assoc: Symmetric and Semigroupy Bifunctors
lens, strict, these


atomic-primops
0.8.4
BSD-3-Clause
A safe approach to CAS and other atomic ops in Haskell.
scheduler


attoparsec
0.14.4
BSD-3-Clause
Fast combinator parsing for bytestrings and text
attoparsec


base-orphans
0.9.0
MIT
Backwards-compatible orphan instances for base
bifunctors, distributive, lens, profunctors, semigroupoids, storable-tuple, transformers-base


bifunctors
5.5.15
BSD-3-Clause
Bifunctors
assoc, invariant, lens, profunctors, semigroupoids


binary
0.8.9.1
BSD-3-Clause
Binary serialisation for Haskell values using lazy ByteStrings
scientific, strict, text, these


call-stack
0.4.0
MIT
Use GHC call-stacks in a backward compatible way
lens


clock
0.8.3
BSD-3-Clause
High-resolution clock functions: monotonic, realtime, cputime.
extra


comonad
5.0.8
BSD-3-Clause
Comonads
adjunctions, bifunctors, free, invariant, kan-extensions, lens, profunctors, semigroupoids


contravariant
1.5.5
BSD-3-Clause
Contravariant functors
adjunctions, invariant, kan-extensions, lens, profunctors, semigroupoids


data-default-class
0.1.2.0
BSD-3-Clause
A class for types with a default value
math-functions


directory
1.3.7.1
BSD-3-Clause
Platform-agnostic library for filesystem operations
extra, process


distributive
0.6.2.1
BSD-3-Clause
Distributive functors -- Dual to Traversable
adjunctions, comonad, free, kan-extensions, lens, profunctors, semigroupoids


filepath
1.4.2.2
BSD-3-Clause
Library for manipulating FilePaths in a cross platform way.
directory, extra, hashable, lens, process


free
5.1.10
BSD-3-Clause
Monads for free
adjunctions, kan-extensions, lens


ghc-boot-th
9.4.4
MISSING
MISSING
template-haskell


ghc-prim
0.9.0
BSD-3-Clause
GHC primitives
(core library)


indexed-traversable
0.1.2.1
BSD-2-Clause
FunctorWithIndex, FoldableWithIndex, TraversableWithIndex
comonad, free, indexed-traversable-instances, lens


indexed-traversable-instances
0.1.1.2
BSD-2-Clause
More instances of FunctorWithIndex, FoldableWithIndex, TraversableWithIndex
lens


invariant
0.6.1
BSD-2-Clause
Haskell98 invariant functors
kan-extensions


kan-extensions
5.2.5
BSD-3-Clause
Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monads
lens


linear-generics
0.2.1
BSD-3-Clause
Generic programming library for generalised deriving.
linear-base


math-functions
0.3.4.2
BSD-2-Clause
Collection of tools for numeric computations
mwc-random


pretty
1.1.3.6
BSD-3-Clause
Pretty-printing library
template-haskell


process
1.6.16.0
BSD-3-Clause
Process libraries
extra


profunctors
5.6.2
BSD-3-Clause
Profunctors
adjunctions, free, invariant, kan-extensions, lens


pvar
1.0.0.0
BSD-3-Clause
Mutable variable with primitive values
scheduler


regex-base
0.94.0.2
BSD-3-Clause
Common "Text.Regex.*" API for Regex matching
regex-tdfa


scheduler
2.0.0.1
BSD-3-Clause
Work stealing scheduler.
massiv


scientific
0.3.7.0
BSD-3-Clause
Numbers represented using scientific notation
attoparsec


semigroupoids
5.3.7
BSD-2-Clause
Semigroupoids: Category sans id
adjunctions, free, kan-extensions, lens


semigroups
0.20
BSD-3-Clause
Anything that associates
adjunctions, storable-record


split
0.2.3.5
BSD-3-Clause
Combinator library for splitting lists.
mono-traversable


splitmix
0.1.0.4
BSD-3-Clause
Fast Splittable PRNG
QuickCheck, random


stm
2.5.1.0
BSD-3-Clause
Software Transactional Memory
StateVar, exceptions, invariant, transformers-base


storable-record
0.0.7
BSD-3-Clause
Elegant definition of Storable instances for records
storable-tuple


storable-tuple
0.1
BSD-3-Clause
Storable instance for pairs and triples
linear-base


strict
0.4.0.1
BSD-3-Clause
Strict data types and String IO.
lens


tagged
0.8.7
BSD-3-Clause
Haskell 98 phantom types to avoid unsafely passing dummy arguments
adjunctions, assoc, bifunctors, comonad, distributive, indexed-traversable-instances, invariant, kan-extensions, lens, profunctors, semigroupoids


th-abstraction
0.4.5.0
ISC
Nicer interface for reified information about data types
bifunctors, free, invariant, lens, linear-generics


these
1.1.1.1
BSD-3-Clause
An either-or-both data type.
lens, strict


time
1.12.2
BSD-2-Clause
A time library
directory, extra, mwc-random, tf-random, unix


transformers-base
0.4.6
BSD-3-Clause
Lift computations from the bottom of a transformer stack
free


transformers-compat
0.7.2
BSD-3-Clause
A small compatibility shim for the transformers library
adjunctions, comonad, invariant, kan-extensions, lens, semigroupoids, transformers-base


unix
2.7.3
BSD-3-Clause
POSIX functionality
directory, extra, process


unliftio-core
0.2.1.0
MIT
The MonadUnliftIO typeclass for unlifting monads to IO
massiv, scheduler


void
0.7.3
BSD-3-Clause
A Haskell 98 logically uninhabited data type
adjunctions


## 3-Imports.hs
module Main where


-- QuickCheck-2.14.2
import qualified Test.QuickCheck
import qualified Test.QuickCheck.Arbitrary
import qualified Test.QuickCheck.Gen
import qualified Test.QuickCheck.Gen.Unsafe
import qualified Test.QuickCheck.Monadic
import qualified Test.QuickCheck.Modifiers
import qualified Test.QuickCheck.Property
import qualified Test.QuickCheck.Test
import qualified Test.QuickCheck.Text
import qualified Test.QuickCheck.Poly
import qualified Test.QuickCheck.State
import qualified Test.QuickCheck.Random
import qualified Test.QuickCheck.Exception
import qualified Test.QuickCheck.Features
import qualified Test.QuickCheck.Function
import qualified Test.QuickCheck.All

-- array-0.5.4.0
import qualified Data.Array
import qualified Data.Array.Base
import qualified Data.Array.IArray
import qualified Data.Array.IO
import qualified Data.Array.IO.Safe
import qualified Data.Array.IO.Internals
import qualified Data.Array.MArray
import qualified Data.Array.MArray.Safe
import qualified Data.Array.ST
import qualified Data.Array.ST.Safe
import qualified Data.Array.Storable
import qualified Data.Array.Storable.Safe
import qualified Data.Array.Storable.Internals
import qualified Data.Array.Unboxed
import qualified Data.Array.Unsafe

-- attoparsec-0.14.4
import qualified Data.Attoparsec
import qualified Data.Attoparsec.ByteString
import qualified Data.Attoparsec.ByteString.Char8
import qualified Data.Attoparsec.ByteString.Lazy
import qualified Data.Attoparsec.Char8
import qualified Data.Attoparsec.Combinator
import qualified Data.Attoparsec.Internal
import qualified Data.Attoparsec.Internal.Types
import qualified Data.Attoparsec.Lazy
import qualified Data.Attoparsec.Number
import qualified Data.Attoparsec.Text
import qualified Data.Attoparsec.Text.Lazy
import qualified Data.Attoparsec.Types
import qualified Data.Attoparsec.Zepto

-- base-4.17.0.0
import qualified Control.Applicative
import qualified Control.Arrow
import qualified Control.Category
import qualified Control.Concurrent
import qualified Control.Concurrent.Chan
import qualified Control.Concurrent.MVar
import qualified Control.Concurrent.QSem
import qualified Control.Concurrent.QSemN
import qualified Control.Exception
import qualified Control.Exception.Base
import qualified Control.Monad
import qualified Control.Monad.Fail
import qualified Control.Monad.Fix
import qualified Control.Monad.Instances
import qualified Control.Monad.IO.Class
import qualified Control.Monad.ST
import qualified Control.Monad.ST.Lazy
import qualified Control.Monad.ST.Lazy.Safe
import qualified Control.Monad.ST.Lazy.Unsafe
import qualified Control.Monad.ST.Safe
import qualified Control.Monad.ST.Strict
import qualified Control.Monad.ST.Unsafe
import qualified Control.Monad.Zip
import qualified Data.Array.Byte
import qualified Data.Bifoldable
import qualified Data.Bifunctor
import qualified Data.Bitraversable
import qualified Data.Bits
import qualified Data.Bool
import qualified Data.Char
import qualified Data.Coerce
import qualified Data.Complex
import qualified Data.Data
import qualified Data.Dynamic
import qualified Data.Either
import qualified Data.Eq
import qualified Data.Fixed
import qualified Data.Foldable
import qualified Data.Function
import qualified Data.Functor
import qualified Data.Functor.Classes
import qualified Data.Functor.Contravariant
import qualified Data.Functor.Compose
import qualified Data.Functor.Const
import qualified Data.Functor.Identity
import qualified Data.Functor.Product
import qualified Data.Functor.Sum
import qualified Data.IORef
import qualified Data.Int
import qualified Data.Ix
import qualified Data.Kind
import qualified Data.List
import qualified Data.List.NonEmpty
import qualified Data.Maybe
import qualified Data.Monoid
import qualified Data.Ord
import qualified Data.Proxy
import qualified Data.Ratio
import qualified Data.Semigroup
import qualified Data.STRef
import qualified Data.STRef.Lazy
import qualified Data.STRef.Strict
import qualified Data.String
import qualified Data.Traversable
import qualified Data.Tuple
import qualified Data.Type.Bool
import qualified Data.Type.Coercion
import qualified Data.Type.Equality
import qualified Data.Type.Ord
import qualified Data.Typeable
import qualified Data.Unique
import qualified Data.Version
import qualified Data.Void
import qualified Data.Word
import qualified Debug.Trace
import qualified Foreign
import qualified Foreign.C
import qualified Foreign.C.Error
import qualified Foreign.C.String
import qualified Foreign.C.Types
import qualified Foreign.Concurrent
import qualified Foreign.ForeignPtr
import qualified Foreign.ForeignPtr.Safe
import qualified Foreign.ForeignPtr.Unsafe
import qualified Foreign.Marshal
import qualified Foreign.Marshal.Alloc
import qualified Foreign.Marshal.Array
import qualified Foreign.Marshal.Error
import qualified Foreign.Marshal.Pool
import qualified Foreign.Marshal.Safe
import qualified Foreign.Marshal.Unsafe
import qualified Foreign.Marshal.Utils
import qualified Foreign.Ptr
import qualified Foreign.Safe
import qualified Foreign.StablePtr
import qualified Foreign.Storable
import qualified GHC.Arr
import qualified GHC.ArrayArray
import qualified GHC.Base
import qualified GHC.Bits
import qualified GHC.ByteOrder
import qualified GHC.Char
import qualified GHC.Clock
import qualified GHC.Conc
import qualified GHC.Conc.IO
import qualified GHC.Conc.Signal
import qualified GHC.Conc.Sync
import qualified GHC.ConsoleHandler
import qualified GHC.Constants
import qualified GHC.Desugar
import qualified GHC.Enum
import qualified GHC.Environment
import qualified GHC.Err
import qualified GHC.Event.TimeOut
import qualified GHC.Exception
import qualified GHC.Exception.Type
import qualified GHC.ExecutionStack
import qualified GHC.ExecutionStack.Internal
import qualified GHC.Exts
import qualified GHC.Fingerprint
import qualified GHC.Fingerprint.Type
import qualified GHC.Float
import qualified GHC.Float.ConversionUtils
import qualified GHC.Float.RealFracMethods
import qualified GHC.Foreign
import qualified GHC.ForeignPtr
import qualified GHC.GHCi
import qualified GHC.GHCi.Helpers
import qualified GHC.Generics
import qualified GHC.IO
import qualified GHC.IO.Buffer
import qualified GHC.IO.BufferedIO
import qualified GHC.IO.Device
import qualified GHC.IO.Encoding
import qualified GHC.IO.Encoding.CodePage
import qualified GHC.IO.Encoding.Failure
import qualified GHC.IO.Encoding.Iconv
import qualified GHC.IO.Encoding.Latin1
import qualified GHC.IO.Encoding.Types
import qualified GHC.IO.Encoding.UTF16
import qualified GHC.IO.Encoding.UTF32
import qualified GHC.IO.Encoding.UTF8
import qualified GHC.IO.Exception
import qualified GHC.IO.FD
import qualified GHC.IO.Handle
import qualified GHC.IO.Handle.FD
import qualified GHC.IO.Handle.Internals
import qualified GHC.IO.Handle.Lock
import qualified GHC.IO.Handle.Text
import qualified GHC.IO.Handle.Types
import qualified GHC.IO.IOMode
import qualified GHC.IO.Unsafe
import qualified GHC.IO.StdHandles
import qualified GHC.IO.SubSystem
import qualified GHC.IOArray
import qualified GHC.IORef
import qualified GHC.Int
import qualified GHC.Integer
import qualified GHC.Integer.Logarithms
import qualified GHC.IsList
import qualified GHC.Ix
import qualified GHC.List
import qualified GHC.Maybe
import qualified GHC.MVar
import qualified GHC.Natural
import qualified GHC.Num
import qualified GHC.OldList
import qualified GHC.OverloadedLabels
import qualified GHC.Pack
import qualified GHC.Profiling
import qualified GHC.Ptr
import qualified GHC.Read
import qualified GHC.Real
import qualified GHC.Records
import qualified GHC.ResponseFile
import qualified GHC.RTS.Flags
import qualified GHC.ST
import qualified GHC.Stack.CloneStack
import qualified GHC.StaticPtr
import qualified GHC.STRef
import qualified GHC.Show
import qualified GHC.Stable
import qualified GHC.StableName
import qualified GHC.Stack
import qualified GHC.Stack.CCS
import qualified GHC.Stack.Types
import qualified GHC.Stats
import qualified GHC.Storable
import qualified GHC.TopHandler
import qualified GHC.TypeError
import qualified GHC.TypeLits
import qualified GHC.TypeLits.Internal
import qualified GHC.TypeNats
import qualified GHC.TypeNats.Internal
import qualified GHC.Unicode
import qualified GHC.Weak
import qualified GHC.Word
import qualified Numeric
import qualified Numeric.Natural
import qualified Prelude
import qualified System.CPUTime
import qualified System.Console.GetOpt
import qualified System.Environment
import qualified System.Environment.Blank
import qualified System.Exit
import qualified System.IO
import qualified System.IO.Error
import qualified System.IO.Unsafe
import qualified System.Info
import qualified System.Mem
import qualified System.Mem.StableName
import qualified System.Mem.Weak
import qualified System.Posix.Internals
import qualified System.Posix.Types
import qualified System.Timeout
import qualified Text.ParserCombinators.ReadP
import qualified Text.ParserCombinators.ReadPrec
import qualified Text.Printf
import qualified Text.Read
import qualified Text.Read.Lex
import qualified Text.Show
import qualified Text.Show.Functions
import qualified Type.Reflection
import qualified Type.Reflection.Unsafe
import qualified Unsafe.Coerce
import qualified GHC.IOPort
import qualified GHC.Event

-- bitvec-1.1.3.0
import qualified Data.Bit
import qualified Data.Bit.ThreadSafe

-- bytestring-0.11.3.1
import qualified Data.ByteString
import qualified Data.ByteString.Char8
import qualified Data.ByteString.Unsafe
import qualified Data.ByteString.Internal
import qualified Data.ByteString.Lazy
import qualified Data.ByteString.Lazy.Char8
import qualified Data.ByteString.Lazy.Internal
import qualified Data.ByteString.Short
import qualified Data.ByteString.Short.Internal
import qualified Data.ByteString.Builder
import qualified Data.ByteString.Builder.Extra
import qualified Data.ByteString.Builder.Prim
import qualified Data.ByteString.Builder.RealFloat
import qualified Data.ByteString.Builder.Internal
import qualified Data.ByteString.Builder.Prim.Internal

-- containers-0.6.6
import qualified Data.Containers.ListUtils
import qualified Data.IntMap
import qualified Data.IntMap.Lazy
import qualified Data.IntMap.Strict
import qualified Data.IntMap.Strict.Internal
import qualified Data.IntMap.Internal
import qualified Data.IntMap.Internal.Debug
import qualified Data.IntMap.Merge.Lazy
import qualified Data.IntMap.Merge.Strict
import qualified Data.IntSet.Internal
import qualified Data.IntSet
import qualified Data.Map
import qualified Data.Map.Lazy
import qualified Data.Map.Merge.Lazy
import qualified Data.Map.Strict.Internal
import qualified Data.Map.Strict
import qualified Data.Map.Merge.Strict
import qualified Data.Map.Internal
import qualified Data.Map.Internal.Debug
import qualified Data.Set.Internal
import qualified Data.Set
import qualified Data.Graph
import qualified Data.Sequence
import qualified Data.Sequence.Internal
import qualified Data.Sequence.Internal.Sorting
import qualified Data.Tree
import qualified Utils.Containers.Internal.BitUtil
import qualified Utils.Containers.Internal.BitQueue
import qualified Utils.Containers.Internal.StrictPair

-- deepseq-1.4.8.0
import qualified Control.DeepSeq

-- exceptions-0.10.5
import qualified Control.Monad.Catch
import qualified Control.Monad.Catch.Pure

-- extra-1.7.12
import qualified Extra
import qualified Control.Concurrent.Extra
import qualified Control.Exception.Extra
import qualified Control.Monad.Extra
import qualified Data.Foldable.Extra
import qualified Data.Either.Extra
import qualified Data.IORef.Extra
import qualified Data.List.Extra
import qualified Data.List.NonEmpty.Extra
import qualified Data.Tuple.Extra
import qualified Data.Typeable.Extra
import qualified Data.Version.Extra
import qualified Numeric.Extra
import qualified System.Directory.Extra
import qualified System.Environment.Extra
import qualified System.Info.Extra
import qualified System.IO.Extra
import qualified System.Process.Extra
import qualified System.Time.Extra
import qualified Text.Read.Extra

-- fgl-5.8.1.1
import qualified Data.Graph.Inductive.Internal.Heap
import qualified Data.Graph.Inductive.Internal.Queue
import qualified Data.Graph.Inductive.Internal.RootPath
import qualified Data.Graph.Inductive.Internal.Thread
import qualified Data.Graph.Inductive.Basic
import qualified Data.Graph.Inductive.Example
import qualified Data.Graph.Inductive.Graph
import qualified Data.Graph.Inductive.Monad
import qualified Data.Graph.Inductive.NodeMap
import qualified Data.Graph.Inductive.PatriciaTree
import qualified Data.Graph.Inductive.Query
import qualified Data.Graph.Inductive.Tree
import qualified Data.Graph.Inductive.Monad.IOArray
import qualified Data.Graph.Inductive.Monad.STArray
import qualified Data.Graph.Inductive.Query.ArtPoint
import qualified Data.Graph.Inductive.Query.BCC
import qualified Data.Graph.Inductive.Query.BFS
import qualified Data.Graph.Inductive.Query.DFS
import qualified Data.Graph.Inductive.Query.Dominators
import qualified Data.Graph.Inductive.Query.GVD
import qualified Data.Graph.Inductive.Query.Indep
import qualified Data.Graph.Inductive.Query.MST
import qualified Data.Graph.Inductive.Query.MaxFlow
import qualified Data.Graph.Inductive.Query.MaxFlow2
import qualified Data.Graph.Inductive.Query.Monad
import qualified Data.Graph.Inductive.Query.SP
import qualified Data.Graph.Inductive.Query.TransClos
import qualified Data.Graph.Inductive

-- ghc-bignum-1.3
import qualified GHC.Num.Primitives
import qualified GHC.Num.WordArray
import qualified GHC.Num.BigNat
import qualified GHC.Num.Backend
import qualified GHC.Num.Backend.Selected
import qualified GHC.Num.Backend.Native
import qualified GHC.Num.Natural
import qualified GHC.Num.Integer

-- hashable-1.4.2.0
import qualified Data.Hashable
import qualified Data.Hashable.Generic
import qualified Data.Hashable.Lifted

-- heaps-0.4
import qualified Data.Heap

-- integer-logarithms-1.0.3.1
import qualified Math.NumberTheory.Logarithms
import qualified Math.NumberTheory.Powers.Integer
import qualified Math.NumberTheory.Powers.Natural
import qualified GHC.Integer.Logarithms.Compat

-- lens-5.2.1
import qualified Control.Lens
import qualified Control.Exception.Lens
import qualified Control.Lens.At
import qualified Control.Lens.Combinators
import qualified Control.Lens.Cons
import qualified Control.Lens.Each
import qualified Control.Lens.Empty
import qualified Control.Lens.Equality
import qualified Control.Lens.Extras
import qualified Control.Lens.Fold
import qualified Control.Lens.Getter
import qualified Control.Lens.Indexed
import qualified Control.Lens.Internal
import qualified Control.Lens.Internal.Bazaar
import qualified Control.Lens.Internal.ByteString
import qualified Control.Lens.Internal.Context
import qualified Control.Lens.Internal.CTypes
import qualified Control.Lens.Internal.Deque
import qualified Control.Lens.Internal.Exception
import qualified Control.Lens.Internal.FieldTH
import qualified Control.Lens.Internal.PrismTH
import qualified Control.Lens.Internal.Fold
import qualified Control.Lens.Internal.Getter
import qualified Control.Lens.Internal.Indexed
import qualified Control.Lens.Internal.Instances
import qualified Control.Lens.Internal.Iso
import qualified Control.Lens.Internal.Level
import qualified Control.Lens.Internal.List
import qualified Control.Lens.Internal.Magma
import qualified Control.Lens.Internal.Prism
import qualified Control.Lens.Internal.Profunctor
import qualified Control.Lens.Internal.Review
import qualified Control.Lens.Internal.Setter
import qualified Control.Lens.Internal.TH
import qualified Control.Lens.Internal.Zoom
import qualified Control.Lens.Iso
import qualified Control.Lens.Lens
import qualified Control.Lens.Level
import qualified Control.Lens.Operators
import qualified Control.Lens.Plated
import qualified Control.Lens.Prism
import qualified Control.Lens.Profunctor
import qualified Control.Lens.Reified
import qualified Control.Lens.Review
import qualified Control.Lens.Setter
import qualified Control.Lens.TH
import qualified Control.Lens.Traversal
import qualified Control.Lens.Tuple
import qualified Control.Lens.Type
import qualified Control.Lens.Unsound
import qualified Control.Lens.Wrapped
import qualified Control.Lens.Zoom
import qualified Control.Monad.Error.Lens
import qualified Control.Parallel.Strategies.Lens
import qualified Control.Seq.Lens
import qualified Data.Array.Lens
import qualified Data.Bits.Lens
import qualified Data.ByteString.Lens
import qualified Data.ByteString.Strict.Lens
import qualified Data.ByteString.Lazy.Lens
import qualified Data.Complex.Lens
import qualified Data.Data.Lens
import qualified Data.Dynamic.Lens
import qualified Data.HashSet.Lens
import qualified Data.IntSet.Lens
import qualified Data.List.Lens
import qualified Data.Map.Lens
import qualified Data.Sequence.Lens
import qualified Data.Set.Lens
import qualified Data.Text.Lens
import qualified Data.Text.Strict.Lens
import qualified Data.Text.Lazy.Lens
import qualified Data.Tree.Lens
import qualified Data.Typeable.Lens
import qualified Data.Vector.Lens
import qualified Data.Vector.Generic.Lens
import qualified GHC.Generics.Lens
import qualified System.Exit.Lens
import qualified System.FilePath.Lens
import qualified System.IO.Error.Lens
import qualified Language.Haskell.TH.Lens
import qualified Numeric.Lens
import qualified Numeric.Natural.Lens

-- linear-base-0.3.0
import qualified Control.Monad.IO.Class.Linear
import qualified Control.Functor.Linear
import qualified Control.Functor.Linear.Internal.Class
import qualified Control.Functor.Linear.Internal.Instances
import qualified Control.Functor.Linear.Internal.Kan
import qualified Control.Functor.Linear.Internal.MonadTrans
import qualified Control.Functor.Linear.Internal.Reader
import qualified Control.Functor.Linear.Internal.State
import qualified Control.Optics.Linear
import qualified Control.Optics.Linear.Internal
import qualified Control.Optics.Linear.Iso
import qualified Control.Optics.Linear.Lens
import qualified Control.Optics.Linear.Prism
import qualified Control.Optics.Linear.Traversal
import qualified Data.Arity.Linear
import qualified Data.Arity.Linear.Internal
import qualified Data.Array.Destination
import qualified Data.Array.Destination.Internal
import qualified Data.Array.Mutable.Linear
import qualified Data.Array.Mutable.Linear.Internal
import qualified Data.Array.Mutable.Unlifted.Linear
import qualified Data.Array.Polarized
import qualified Data.Array.Polarized.Pull
import qualified Data.Array.Polarized.Pull.Internal
import qualified Data.Array.Polarized.Push
import qualified Data.Bifunctor.Linear
import qualified Data.Bifunctor.Linear.Internal.Bifunctor
import qualified Data.Bifunctor.Linear.Internal.SymmetricMonoidal
import qualified Data.Bool.Linear
import qualified Data.Either.Linear
import qualified Data.Functor.Linear
import qualified Data.Functor.Linear.Internal.Functor
import qualified Data.Functor.Linear.Internal.Applicative
import qualified Data.Functor.Linear.Internal.Traversable
import qualified Data.HashMap.Mutable.Linear
import qualified Data.HashMap.Mutable.Linear.Internal
import qualified Data.List.Linear
import qualified Data.Maybe.Linear
import qualified Data.Monoid.Linear
import qualified Data.Monoid.Linear.Internal.Monoid
import qualified Data.Monoid.Linear.Internal.Semigroup
import qualified Data.Num.Linear
import qualified Data.Ord.Linear
import qualified Data.Ord.Linear.Internal.Ord
import qualified Data.Ord.Linear.Internal.Eq
import qualified Data.Profunctor.Kleisli.Linear
import qualified Data.Profunctor.Linear
import qualified Data.Set.Mutable.Linear
import qualified Data.Set.Mutable.Linear.Internal
import qualified Data.Tuple.Linear
import qualified Data.Unrestricted.Linear
import qualified Data.Unrestricted.Linear.Internal.Consumable
import qualified Data.Unrestricted.Linear.Internal.Dupable
import qualified Data.Unrestricted.Linear.Internal.Movable
import qualified Data.Unrestricted.Linear.Internal.Instances
import qualified Data.Unrestricted.Linear.Internal.Ur
import qualified Data.Unrestricted.Linear.Internal.UrT
import qualified Data.Replicator.Linear
import qualified Data.Replicator.Linear.Internal
import qualified Data.Replicator.Linear.Internal.ReplicationStream
import qualified Data.Replicator.Linear.Internal.Instances
import qualified Data.V.Linear
import qualified Data.V.Linear.Internal
import qualified Data.V.Linear.Internal.Instances
import qualified Data.Vector.Mutable.Linear
import qualified Data.Vector.Mutable.Linear.Internal
import qualified Debug.Trace.Linear
import qualified Foreign.Marshal.Pure
import qualified Foreign.Marshal.Pure.Internal
import qualified Prelude.Linear
import qualified Prelude.Linear.Generically
import qualified Prelude.Linear.GenericUtil
import qualified Prelude.Linear.Internal
import qualified Prelude.Linear.Internal.Generically
import qualified Prelude.Linear.Internal.TypeEq
import qualified Prelude.Linear.Unsatisfiable
import qualified Streaming.Linear
import qualified Streaming.Linear.Internal.Consume
import qualified Streaming.Linear.Internal.Interop
import qualified Streaming.Linear.Internal.Many
import qualified Streaming.Linear.Internal.Process
import qualified Streaming.Linear.Internal.Produce
import qualified Streaming.Linear.Internal.Type
import qualified Streaming.Prelude.Linear
import qualified System.IO.Linear
import qualified System.IO.Resource.Linear
import qualified System.IO.Resource.Linear.Internal
import qualified Unsafe.Linear

-- massiv-1.0.3.0
import qualified Data.Massiv.Array
import qualified Data.Massiv.Array.Delayed
import qualified Data.Massiv.Array.Manifest
import qualified Data.Massiv.Array.Manifest.Vector
import qualified Data.Massiv.Array.Mutable
import qualified Data.Massiv.Array.Mutable.Algorithms
import qualified Data.Massiv.Array.Mutable.Atomic
import qualified Data.Massiv.Array.Numeric
import qualified Data.Massiv.Array.Numeric.Integral
import qualified Data.Massiv.Array.Stencil
import qualified Data.Massiv.Array.Unsafe
import qualified Data.Massiv.Core
import qualified Data.Massiv.Core.Index
import qualified Data.Massiv.Core.List
import qualified Data.Massiv.Core.Operations
import qualified Data.Massiv.Vector
import qualified Data.Massiv.Vector.Stream

-- mono-traversable-1.0.15.3
import qualified Data.Containers
import qualified Data.MonoTraversable
import qualified Data.MonoTraversable.Unprefixed
import qualified Data.NonNull
import qualified Data.Sequences

-- mtl-2.2.2
import qualified Control.Monad.Cont
import qualified Control.Monad.Cont.Class
import qualified Control.Monad.Error
import qualified Control.Monad.Error.Class
import qualified Control.Monad.Except
import qualified Control.Monad.Identity
import qualified Control.Monad.List
import qualified Control.Monad.RWS
import qualified Control.Monad.RWS.Class
import qualified Control.Monad.RWS.Lazy
import qualified Control.Monad.RWS.Strict
import qualified Control.Monad.Reader
import qualified Control.Monad.Reader.Class
import qualified Control.Monad.State
import qualified Control.Monad.State.Class
import qualified Control.Monad.State.Lazy
import qualified Control.Monad.State.Strict
import qualified Control.Monad.Trans
import qualified Control.Monad.Writer
import qualified Control.Monad.Writer.Class
import qualified Control.Monad.Writer.Lazy
import qualified Control.Monad.Writer.Strict

-- mutable-containers-0.3.4.1
import qualified Data.Mutable

-- mwc-random-0.15.0.2
import qualified System.Random.MWC
import qualified System.Random.MWC.Distributions
import qualified System.Random.MWC.CondensedTable
import qualified System.Random.MWC.SeedSource

-- parallel-3.2.2.0
import qualified Control.Seq
import qualified Control.Parallel
import qualified Control.Parallel.Strategies

-- parsec-3.1.15.0
import qualified Text.Parsec
import qualified Text.Parsec.String
import qualified Text.Parsec.ByteString
import qualified Text.Parsec.ByteString.Lazy
import qualified Text.Parsec.Text
import qualified Text.Parsec.Text.Lazy
import qualified Text.Parsec.Pos
import qualified Text.Parsec.Error
import qualified Text.Parsec.Prim
import qualified Text.Parsec.Char
import qualified Text.Parsec.Combinator
import qualified Text.Parsec.Token
import qualified Text.Parsec.Expr
import qualified Text.Parsec.Language
import qualified Text.Parsec.Perm
import qualified Text.ParserCombinators.Parsec
import qualified Text.ParserCombinators.Parsec.Char
import qualified Text.ParserCombinators.Parsec.Combinator
import qualified Text.ParserCombinators.Parsec.Error
import qualified Text.ParserCombinators.Parsec.Expr
import qualified Text.ParserCombinators.Parsec.Language
import qualified Text.ParserCombinators.Parsec.Perm
import qualified Text.ParserCombinators.Parsec.Pos
import qualified Text.ParserCombinators.Parsec.Prim
import qualified Text.ParserCombinators.Parsec.Token

-- primitive-0.8.0.0
import qualified Control.Monad.Primitive
import qualified Data.Primitive
import qualified Data.Primitive.MachDeps
import qualified Data.Primitive.Types
import qualified Data.Primitive.Array
import qualified Data.Primitive.ByteArray
import qualified Data.Primitive.PrimArray
import qualified Data.Primitive.SmallArray
import qualified Data.Primitive.Ptr
import qualified Data.Primitive.MutVar
import qualified Data.Primitive.MVar
import qualified Data.Primitive.PrimVar

-- psqueues-0.2.7.3
import qualified Data.HashPSQ
import qualified Data.IntPSQ
import qualified Data.OrdPSQ

-- random-1.2.1.1
import qualified System.Random
import qualified System.Random.Internal
import qualified System.Random.Stateful

-- reflection-2.1.7
import qualified Data.Reflection

-- regex-tdfa-1.3.2
import qualified Data.IntMap.CharMap2
import qualified Data.IntMap.EnumMap2
import qualified Data.IntSet.EnumSet2
import qualified Text.Regex.TDFA
import qualified Text.Regex.TDFA.ByteString
import qualified Text.Regex.TDFA.ByteString.Lazy
import qualified Text.Regex.TDFA.Common
import qualified Text.Regex.TDFA.CorePattern
import qualified Text.Regex.TDFA.IntArrTrieSet
import qualified Text.Regex.TDFA.NewDFA.Engine
import qualified Text.Regex.TDFA.NewDFA.Engine_FA
import qualified Text.Regex.TDFA.NewDFA.Engine_NC
import qualified Text.Regex.TDFA.NewDFA.Engine_NC_FA
import qualified Text.Regex.TDFA.NewDFA.Tester
import qualified Text.Regex.TDFA.NewDFA.Uncons
import qualified Text.Regex.TDFA.NewDFA.MakeTest
import qualified Text.Regex.TDFA.Pattern
import qualified Text.Regex.TDFA.ReadRegex
import qualified Text.Regex.TDFA.Sequence
import qualified Text.Regex.TDFA.String
import qualified Text.Regex.TDFA.TDFA
import qualified Text.Regex.TDFA.TNFA
import qualified Text.Regex.TDFA.Text
import qualified Text.Regex.TDFA.Text.Lazy

-- safe-exceptions-0.1.7.3
import qualified Control.Exception.Safe

-- template-haskell-2.19.0.0
import qualified Language.Haskell.TH
import qualified Language.Haskell.TH.Lib
import qualified Language.Haskell.TH.Ppr
import qualified Language.Haskell.TH.PprLib
import qualified Language.Haskell.TH.Quote
import qualified Language.Haskell.TH.Syntax
import qualified Language.Haskell.TH.LanguageExtensions
import qualified Language.Haskell.TH.CodeDo
import qualified Language.Haskell.TH.Lib.Internal

-- text-2.0.1
import qualified Data.Text
import qualified Data.Text.Array
import qualified Data.Text.Encoding
import qualified Data.Text.Encoding.Error
import qualified Data.Text.Foreign
import qualified Data.Text.IO
import qualified Data.Text.Internal
import qualified Data.Text.Internal.Builder
import qualified Data.Text.Internal.Builder.Functions
import qualified Data.Text.Internal.Builder.Int.Digits
import qualified Data.Text.Internal.Builder.RealFloat.Functions
import qualified Data.Text.Internal.ByteStringCompat
import qualified Data.Text.Internal.PrimCompat
import qualified Data.Text.Internal.Encoding.Fusion
import qualified Data.Text.Internal.Encoding.Fusion.Common
import qualified Data.Text.Internal.Encoding.Utf16
import qualified Data.Text.Internal.Encoding.Utf32
import qualified Data.Text.Internal.Encoding.Utf8
import qualified Data.Text.Internal.Fusion
import qualified Data.Text.Internal.Fusion.CaseMapping
import qualified Data.Text.Internal.Fusion.Common
import qualified Data.Text.Internal.Fusion.Size
import qualified Data.Text.Internal.Fusion.Types
import qualified Data.Text.Internal.IO
import qualified Data.Text.Internal.Lazy
import qualified Data.Text.Internal.Lazy.Encoding.Fusion
import qualified Data.Text.Internal.Lazy.Fusion
import qualified Data.Text.Internal.Lazy.Search
import qualified Data.Text.Internal.Private
import qualified Data.Text.Internal.Read
import qualified Data.Text.Internal.Search
import qualified Data.Text.Internal.Unsafe
import qualified Data.Text.Internal.Unsafe.Char
import qualified Data.Text.Lazy
import qualified Data.Text.Lazy.Builder
import qualified Data.Text.Lazy.Builder.Int
import qualified Data.Text.Lazy.Builder.RealFloat
import qualified Data.Text.Lazy.Encoding
import qualified Data.Text.Lazy.IO
import qualified Data.Text.Lazy.Internal
import qualified Data.Text.Lazy.Read
import qualified Data.Text.Read
import qualified Data.Text.Unsafe

-- tf-random-0.5
import qualified System.Random.TF
import qualified System.Random.TF.Gen
import qualified System.Random.TF.Init
import qualified System.Random.TF.Instances

-- transformers-0.5.6.2
import qualified Control.Applicative.Backwards
import qualified Control.Applicative.Lift
import qualified Control.Monad.Signatures
import qualified Control.Monad.Trans.Accum
import qualified Control.Monad.Trans.Class
import qualified Control.Monad.Trans.Cont
import qualified Control.Monad.Trans.Except
import qualified Control.Monad.Trans.Error
import qualified Control.Monad.Trans.Identity
import qualified Control.Monad.Trans.List
import qualified Control.Monad.Trans.Maybe
import qualified Control.Monad.Trans.Reader
import qualified Control.Monad.Trans.RWS
import qualified Control.Monad.Trans.RWS.CPS
import qualified Control.Monad.Trans.RWS.Lazy
import qualified Control.Monad.Trans.RWS.Strict
import qualified Control.Monad.Trans.Select
import qualified Control.Monad.Trans.State
import qualified Control.Monad.Trans.State.Lazy
import qualified Control.Monad.Trans.State.Strict
import qualified Control.Monad.Trans.Writer
import qualified Control.Monad.Trans.Writer.CPS
import qualified Control.Monad.Trans.Writer.Lazy
import qualified Control.Monad.Trans.Writer.Strict
import qualified Data.Functor.Constant
import qualified Data.Functor.Reverse

-- unboxing-vector-0.2.0.0
import qualified Data.Vector.Unboxing
import qualified Data.Vector.Unboxing.Mutable

-- unordered-containers-0.2.19.1
import qualified Data.HashMap.Internal
import qualified Data.HashMap.Internal.Array
import qualified Data.HashMap.Internal.List
import qualified Data.HashMap.Internal.Strict
import qualified Data.HashMap.Lazy
import qualified Data.HashMap.Strict
import qualified Data.HashSet
import qualified Data.HashSet.Internal

-- utility-ht-0.0.16
import qualified Data.Bits.HT
import qualified Data.Bool.HT
import qualified Data.Eq.HT
import qualified Data.Function.HT
import qualified Data.Ix.Enum
import qualified Data.List.HT
import qualified Data.List.Key
import qualified Data.List.Match
import qualified Data.List.Reverse.StrictElement
import qualified Data.List.Reverse.StrictSpine
import qualified Data.Maybe.HT
import qualified Data.Either.HT
import qualified Data.Monoid.HT
import qualified Data.Ord.HT
import qualified Data.Record.HT
import qualified Data.String.HT
import qualified Data.Tuple.HT
import qualified Data.Tuple.Lazy
import qualified Data.Tuple.Strict
import qualified Control.Monad.HT
import qualified Control.Applicative.HT
import qualified Control.Functor.HT
import qualified Data.Strictness.HT
import qualified Text.Read.HT
import qualified Text.Show.HT

-- vector-0.13.0.0
import qualified Data.Vector.Internal.Check
import qualified Data.Vector.Fusion.Util
import qualified Data.Vector.Fusion.Stream.Monadic
import qualified Data.Vector.Fusion.Bundle.Size
import qualified Data.Vector.Fusion.Bundle.Monadic
import qualified Data.Vector.Fusion.Bundle
import qualified Data.Vector.Generic.Mutable.Base
import qualified Data.Vector.Generic.Mutable
import qualified Data.Vector.Generic.Base
import qualified Data.Vector.Generic.New
import qualified Data.Vector.Generic
import qualified Data.Vector.Primitive.Mutable
import qualified Data.Vector.Primitive
import qualified Data.Vector.Storable.Internal
import qualified Data.Vector.Storable.Mutable
import qualified Data.Vector.Storable
import qualified Data.Vector.Unboxed.Base
import qualified Data.Vector.Unboxed.Mutable
import qualified Data.Vector.Unboxed
import qualified Data.Vector.Mutable
import qualified Data.Vector

-- vector-algorithms-0.9.0.1
import qualified Data.Vector.Algorithms
import qualified Data.Vector.Algorithms.Optimal
import qualified Data.Vector.Algorithms.Insertion
import qualified Data.Vector.Algorithms.Intro
import qualified Data.Vector.Algorithms.Merge
import qualified Data.Vector.Algorithms.Radix
import qualified Data.Vector.Algorithms.Search
import qualified Data.Vector.Algorithms.Heap
import qualified Data.Vector.Algorithms.AmericanFlag
import qualified Data.Vector.Algorithms.Tim

-- vector-stream-0.1.0.0
import qualified Data.Stream.Monadic

-- vector-th-unbox-0.2.2
import qualified Data.Vector.Unboxed.Deriving


main :: Prelude.IO ()
main = Prelude.return ()
	#! /bin/bash

	sudo apt-get update
	sudo apt-get upgrade -y
	apt-get install -y build-essential curl libffi-dev libffi8ubuntu1 libgmp-dev libgmp10 libncurses-dev libncurses5 libtinfo5 llvm-13

	curl --proto '=https' --tlsv1.2 -sSf https://get-ghcup.haskell.org \| BOOTSTRAP_HASKELL_NONINTERACTIVE=1 BOOTSTRAP_HASKELL_GHC_VERSION=9.4.4 BOOTSTRAP_HASKELL_CABAL_VERSION=3.8.1.0 BOOTSTRAP_HASKELL_INSTALL_NO_STACK=1 sh
	source ~/.ghcup/env

	cd /judge

	mkdir -p submission/app

	cd submission

	cat > submission.cabal <<'PKG_CABAL_EOF'
	cabal-version: 3.4
	name: submission
	version: 0.1.0.0
	synopsis: A Haskell program submitted to AtCoder
	-- description:
	license: NONE
	author: submitter-anonymous
	maintainer: NONE
	-- copyright:
	category: Competitive
	build-type: Simple
	-- extra-doc-files: CHANGELOG.md
	-- extra-source-files:

	common warnings
	ghc-options: -Wall

	executable main
	import: warnings
	main-is: Main.hs
	-- other-modules:
	-- other-extensions:
	build-depends:
	base ^>=4.17.0.0,
	QuickCheck,
	array,
	attoparsec,
	bitvec,
	bytestring,
	containers,
	deepseq,
	exceptions,
	extra,
	fgl,
	ghc-bignum,
	hashable,
	heaps,
	integer-logarithms,
	lens,
	linear-base,
	massiv,
	mono-traversable,
	mtl,
	mutable-containers,
	mwc-random,
	parallel,
	parsec,
	primitive,
	psqueues,
	random,
	reflection,
	regex-tdfa,
	safe-exceptions,
	template-haskell,
	text,
	tf-random,
	transformers,
	unboxing-vector,
	unordered-containers,
	utility-ht,
	vector,
	vector-algorithms,
	vector-stream,
	vector-th-unbox

	hs-source-dirs: app
	default-language: GHC2021
	PKG_CABAL_EOF

	cat > cabal.project <<'CABAL_PROJECT_EOF'
	packages: ./submission.cabal

	constraints: bitvec +libgmp,
	clock +llvm,
	vector-algorithms +llvm
	optimization: 2

	package *
	compiler: ghc
	ghc-options: -fllvm -Wall

	CABAL_PROJECT_EOF

	echo "main = return () :: IO ()" > app/Main.hs

	cabal v2-update
	cabal v2-freeze
	cabal v2-build --only-dependencies

	rm app/Main.hs
Name	Version	SPDX License Id	Description	Also depended upon by
`QuickCheck`	`2.14.2`	`BSD-3-Clause`	Automatic testing of Haskell programs	`storable-record`
`array`	`0.5.4.0`	`BSD-3-Clause`	Mutable and immutable arrays	`adjunctions`, `attoparsec`, `binary`, `containers`, `deepseq`, `fgl`, `indexed-traversable`, `integer-logarithms`, `invariant`, `kan-extensions`, `lens`, `parallel`, `regex-base`, `regex-tdfa`, `stm`, `text`
`attoparsec`	`0.14.4`	`BSD-3-Clause`	Fast combinator parsing for bytestrings and text
`base`	`4.17.0.0`	`BSD-3-Clause`	Basic libraries	(core library)
`bitvec`	`1.1.3.0`	`BSD-3-Clause`	Space-efficient bit vectors	`vector-algorithms`
`bytestring`	`0.11.3.1`	`BSD-3-Clause`	Fast, compact, strict and lazy byte strings with a list interface	`attoparsec`, `binary`, `bitvec`, `hashable`, `lens`, `massiv`, `mono-traversable`, `parsec`, `random`, `regex-base`, `regex-tdfa`, `scientific`, `strict`, `text`, `unix`, `vector-algorithms`
`containers`	`0.6.6`	`BSD-3-Clause`	Assorted concrete container types	`QuickCheck`, `adjunctions`, `attoparsec`, `bifunctors`, `binary`, `comonad`, `fgl`, `free`, `hashable`, `indexed-traversable`, `invariant`, `kan-extensions`, `lens`, `linear-base`, `linear-generics`, `mono-traversable`, `mutable-containers`, `parallel`, `regex-base`, `regex-tdfa`, `scientific`, `semigroupoids`, `th-abstraction`
`deepseq`	`1.4.8.0`	`BSD-3-Clause`	Deep evaluation of data structures	`QuickCheck`, `attoparsec`, `bitvec`, `bytestring`, `containers`, `fgl`, `hashable`, `massiv`, `math-functions`, `parallel`, `pretty`, `primitive`, `process`, `psqueues`, `pvar`, `random`, `safe-exceptions`, `scheduler`, `scientific`, `splitmix`, `strict`, `tagged`, `text`, `these`, `time`, `unboxing-vector`, `unordered-containers`, `vector`
`exceptions`	`0.10.5`	`BSD-3-Clause`	Extensible optionally-pure exceptions	`free`, `lens`, `massiv`, `safe-exceptions`, `scheduler`
`extra`	`1.7.12`	`BSD-3-Clause`	Extra functions I use.
`fgl`	`5.8.1.1`	`BSD-3-Clause`	Martin Erwig's Functional Graph Library
`ghc-bignum`	`1.3`	`BSD-3-Clause`	GHC BigNum library	`base`, `bitvec`, `hashable`, `integer-logarithms`
`hashable`	`1.4.2.0`	`BSD-3-Clause`	A class for types that can be converted to a hash value	`lens`, `linear-base`, `mono-traversable`, `psqueues`, `scientific`, `semigroupoids`, `strict`, `these`, `unordered-containers`
`heaps`	`0.4`	`BSD-3-Clause`	Asymptotically optimal Brodal/Okasaki heaps.
`integer-logarithms`	`1.0.3.1`	`MIT`	Integer logarithms.	`scientific`
`lens`	`5.2.1`	`BSD-2-Clause`	Lenses, Folds and Traversals
`linear-base`	`0.3.0`	`MIT`	Standard library for linear types.
`massiv`	`1.0.3.0`	`BSD-3-Clause`	Massiv (Массив) is an Array Library.
`mono-traversable`	`1.0.15.3`	`MIT`	Type classes for mapping, folding, and traversing monomorphic containers	`mutable-containers`, `unboxing-vector`
`mtl`	`2.2.2`	`BSD-3-Clause`	Monad classes, using functional dependencies	`adjunctions`, `exceptions`, `free`, `kan-extensions`, `lens`, `parsec`, `random`, `regex-tdfa`
`mutable-containers`	`0.3.4.1`	`MIT`	Abstactions and concrete implementations of mutable containers
`mwc-random`	`0.15.0.2`	`BSD-3-Clause`	Fast, high quality pseudo random number generation
`parallel`	`3.2.2.0`	`BSD-3-Clause`	Parallel programming library	`lens`
`parsec`	`3.1.15.0`	`BSD-2-Clause`	Monadic parser combinators	`regex-tdfa`
`primitive`	`0.8.0.0`	`BSD-3-Clause`	Primitive memory-related operations	`atomic-primops`, `bitvec`, `linear-base`, `massiv`, `math-functions`, `mutable-containers`, `mwc-random`, `pvar`, `scheduler`, `scientific`, `tf-random`, `unboxing-vector`, `vector`, `vector-algorithms`
`psqueues`	`0.2.7.3`	`BSD-3-Clause`	Pure priority search queues
`random`	`1.2.1.1`	`BSD-3-Clause`	Pseudo-random number generation	`QuickCheck`, `massiv`, `mwc-random`, `tf-random`
`reflection`	`2.1.7`	`BSD-3-Clause`	Reifies arbitrary terms into types that can be reflected back into terms	`lens`
`regex-tdfa`	`1.3.2`	`BSD-3-Clause`	Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)
`safe-exceptions`	`0.1.7.3`	`MIT`	Safe, consistent, and easy exception handling
`template-haskell`	`2.19.0.0`	`BSD-3-Clause`	Support library for Template Haskell	`OneTuple`, `QuickCheck`, `bifunctors`, `bytestring`, `containers`, `exceptions`, `free`, `invariant`, `lens`, `linear-generics`, `primitive`, `reflection`, `scientific`, `semigroupoids`, `tagged`, `text`, `th-abstraction`, `unordered-containers`, `vector-th-unbox`
`text`	`2.0.1`	`BSD-2-Clause`	An efficient packed Unicode text type.	`attoparsec`, `hashable`, `lens`, `linear-base`, `mono-traversable`, `parsec`, `regex-base`, `regex-tdfa`, `scientific`, `strict`
`tf-random`	`0.5`	`BSD-3-Clause`	High-quality splittable pseudorandom number generator
`transformers`	`0.5.6.2`	`BSD-3-Clause`	Concrete functor and monad transformers	`QuickCheck`, `StateVar`, `adjunctions`, `attoparsec`, `bifunctors`, `comonad`, `contravariant`, `distributive`, `exceptions`, `fgl`, `free`, `indexed-traversable`, `invariant`, `kan-extensions`, `lens`, `linear-base`, `mono-traversable`, `mtl`, `primitive`, `profunctors`, `safe-exceptions`, `semigroupoids`, `storable-record`, `strict`, `tagged`, `transformers-base`, `transformers-compat`, `unliftio-core`
`unboxing-vector`	`0.2.0.0`	`BSD-3-Clause`	A newtype-friendly variant of unboxed vectors
`unordered-containers`	`0.2.19.1`	`BSD-3-Clause`	Efficient hashing-based container types	`indexed-traversable-instances`, `invariant`, `lens`, `mono-traversable`, `semigroupoids`
`utility-ht`	`0.0.16`	`BSD-3-Clause`	Various small helper functions for Lists, Maybes, Tuples, Functions	`storable-record`, `storable-tuple`
`vector`	`0.13.0.0`	`BSD-3-Clause`	Efficient Arrays	`bitvec`, `indexed-traversable-instances`, `lens`, `linear-base`, `massiv`, `math-functions`, `mono-traversable`, `mutable-containers`, `mwc-random`, `unboxing-vector`, `vector-algorithms`, `vector-th-unbox`
`vector-algorithms`	`0.9.0.1`	`BSD-3-Clause`	Efficient algorithms for vector arrays	`mono-traversable`
`vector-stream`	`0.1.0.0`	`BSD-3-Clause`	Efficient Streams	`massiv`, `vector`
`vector-th-unbox`	`0.2.2`	`BSD-3-Clause`	Deriver for Data.Vector.Unboxed using Template Haskell
Name	Version	SPDX License Id	Description	Depended upon by
`OneTuple`	`0.4.1.1`	`BSD-3-Clause`	Singleton Tuple	`indexed-traversable-instances`
`StateVar`	`1.2.2`	`BSD-3-Clause`	State variables	`contravariant`, `invariant`
`adjunctions`	`4.4.2`	`BSD-3-Clause`	Adjunctions and representable functors	`kan-extensions`
`assoc`	`1.0.2`	`BSD-3-Clause`	swap and assoc: Symmetric and Semigroupy Bifunctors	`lens`, `strict`, `these`
`atomic-primops`	`0.8.4`	`BSD-3-Clause`	A safe approach to CAS and other atomic ops in Haskell.	`scheduler`
`attoparsec`	`0.14.4`	`BSD-3-Clause`	Fast combinator parsing for bytestrings and text	`attoparsec`
`base-orphans`	`0.9.0`	`MIT`	Backwards-compatible orphan instances for base	`bifunctors`, `distributive`, `lens`, `profunctors`, `semigroupoids`, `storable-tuple`, `transformers-base`
`bifunctors`	`5.5.15`	`BSD-3-Clause`	Bifunctors	`assoc`, `invariant`, `lens`, `profunctors`, `semigroupoids`
`binary`	`0.8.9.1`	`BSD-3-Clause`	Binary serialisation for Haskell values using lazy ByteStrings	`scientific`, `strict`, `text`, `these`
`call-stack`	`0.4.0`	`MIT`	Use GHC call-stacks in a backward compatible way	`lens`
`clock`	`0.8.3`	`BSD-3-Clause`	High-resolution clock functions: monotonic, realtime, cputime.	`extra`
`comonad`	`5.0.8`	`BSD-3-Clause`	Comonads	`adjunctions`, `bifunctors`, `free`, `invariant`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids`
`contravariant`	`1.5.5`	`BSD-3-Clause`	Contravariant functors	`adjunctions`, `invariant`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids`
`data-default-class`	`0.1.2.0`	`BSD-3-Clause`	A class for types with a default value	`math-functions`
`directory`	`1.3.7.1`	`BSD-3-Clause`	Platform-agnostic library for filesystem operations	`extra`, `process`
`distributive`	`0.6.2.1`	`BSD-3-Clause`	Distributive functors -- Dual to Traversable	`adjunctions`, `comonad`, `free`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids`
`filepath`	`1.4.2.2`	`BSD-3-Clause`	Library for manipulating FilePaths in a cross platform way.	`directory`, `extra`, `hashable`, `lens`, `process`
`free`	`5.1.10`	`BSD-3-Clause`	Monads for free	`adjunctions`, `kan-extensions`, `lens`
`ghc-boot-th`	`9.4.4`	MISSING	MISSING	`template-haskell`
`ghc-prim`	`0.9.0`	`BSD-3-Clause`	GHC primitives	(core library)
`indexed-traversable`	`0.1.2.1`	`BSD-2-Clause`	FunctorWithIndex, FoldableWithIndex, TraversableWithIndex	`comonad`, `free`, `indexed-traversable-instances`, `lens`
`indexed-traversable-instances`	`0.1.1.2`	`BSD-2-Clause`	More instances of FunctorWithIndex, FoldableWithIndex, TraversableWithIndex	`lens`
`invariant`	`0.6.1`	`BSD-2-Clause`	Haskell98 invariant functors	`kan-extensions`
`kan-extensions`	`5.2.5`	`BSD-3-Clause`	Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monads	`lens`
`linear-generics`	`0.2.1`	`BSD-3-Clause`	Generic programming library for generalised deriving.	`linear-base`
`math-functions`	`0.3.4.2`	`BSD-2-Clause`	Collection of tools for numeric computations	`mwc-random`
`pretty`	`1.1.3.6`	`BSD-3-Clause`	Pretty-printing library	`template-haskell`
`process`	`1.6.16.0`	`BSD-3-Clause`	Process libraries	`extra`
`profunctors`	`5.6.2`	`BSD-3-Clause`	Profunctors	`adjunctions`, `free`, `invariant`, `kan-extensions`, `lens`
`pvar`	`1.0.0.0`	`BSD-3-Clause`	Mutable variable with primitive values	`scheduler`
`regex-base`	`0.94.0.2`	`BSD-3-Clause`	Common "Text.Regex.*" API for Regex matching	`regex-tdfa`
`scheduler`	`2.0.0.1`	`BSD-3-Clause`	Work stealing scheduler.	`massiv`
`scientific`	`0.3.7.0`	`BSD-3-Clause`	Numbers represented using scientific notation	`attoparsec`
`semigroupoids`	`5.3.7`	`BSD-2-Clause`	Semigroupoids: Category sans id	`adjunctions`, `free`, `kan-extensions`, `lens`
`semigroups`	`0.20`	`BSD-3-Clause`	Anything that associates	`adjunctions`, `storable-record`
`split`	`0.2.3.5`	`BSD-3-Clause`	Combinator library for splitting lists.	`mono-traversable`
`splitmix`	`0.1.0.4`	`BSD-3-Clause`	Fast Splittable PRNG	`QuickCheck`, `random`
`stm`	`2.5.1.0`	`BSD-3-Clause`	Software Transactional Memory	`StateVar`, `exceptions`, `invariant`, `transformers-base`
`storable-record`	`0.0.7`	`BSD-3-Clause`	Elegant definition of Storable instances for records	`storable-tuple`
`storable-tuple`	`0.1`	`BSD-3-Clause`	Storable instance for pairs and triples	`linear-base`
`strict`	`0.4.0.1`	`BSD-3-Clause`	Strict data types and String IO.	`lens`
`tagged`	`0.8.7`	`BSD-3-Clause`	Haskell 98 phantom types to avoid unsafely passing dummy arguments	`adjunctions`, `assoc`, `bifunctors`, `comonad`, `distributive`, `indexed-traversable-instances`, `invariant`, `kan-extensions`, `lens`, `profunctors`, `semigroupoids`
`th-abstraction`	`0.4.5.0`	`ISC`	Nicer interface for reified information about data types	`bifunctors`, `free`, `invariant`, `lens`, `linear-generics`
`these`	`1.1.1.1`	`BSD-3-Clause`	An either-or-both data type.	`lens`, `strict`
`time`	`1.12.2`	`BSD-2-Clause`	A time library	`directory`, `extra`, `mwc-random`, `tf-random`, `unix`
`transformers-base`	`0.4.6`	`BSD-3-Clause`	Lift computations from the bottom of a transformer stack	`free`
`transformers-compat`	`0.7.2`	`BSD-3-Clause`	A small compatibility shim for the transformers library	`adjunctions`, `comonad`, `invariant`, `kan-extensions`, `lens`, `semigroupoids`, `transformers-base`
`unix`	`2.7.3`	`BSD-3-Clause`	POSIX functionality	`directory`, `extra`, `process`
`unliftio-core`	`0.2.1.0`	`MIT`	The MonadUnliftIO typeclass for unlifting monads to IO	`massiv`, `scheduler`
`void`	`0.7.3`	`BSD-3-Clause`	A Haskell 98 logically uninhabited data type	`adjunctions`