diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -54,3 +54,8 @@
 ## 0.4.2.0 -- 2022-03-24
 
 * Fourth version revised B. Updated the dependency boundaries to support the latest GHC and Cabal.
+
+## 0.5.0.0 -- 2023-02-03
+
+* Fifth version. Switched to NoImplicitPrelude extension. Updated the metadata and dependecies boundaries.
+
diff --git a/LICENSE b/LICENSE
--- a/LICENSE
+++ b/LICENSE
@@ -1,4 +1,4 @@
-Copyright (c) 2020 OleksandrZhabenko
+Copyright (c) 2020-2023 Oleksandr Zhabenko
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the
diff --git a/Main.hs b/Main.hs
--- a/Main.hs
+++ b/Main.hs
@@ -1,9 +1,9 @@
 -- |
 -- Module      :  Main
--- Copyright   :  (c) OleksandrZhabenko 2020-2021
+-- Copyright   :  (c) Oleksandr Zhabenko 2020-2023
 -- License     :  MIT
 -- Stability   :  Experimental
--- Maintainer  :  olexandr543@yahoo.com
+-- Maintainer  :  oleksandr.zhabenko@yahoo.com
 --
 -- Can be used to calculate the approximations of the Ukrainian phonemes
 -- using some prepared text with its correct (at least mostly) pronunciation.
@@ -21,17 +21,25 @@
 -- For more information, please, see the documentation for them.
 --
 
+{-# LANGUAGE NoImplicitPrelude #-}
+
+{-# OPTIONS_HADDOCK -show-extensions #-}
+
 module Main where
 
+import GHC.Base
+import GHC.Real ((/))
+import GHC.Float (sqrt)
+import GHC.Num ((*),(-),abs)
+import System.IO
 import Data.Char (isAlpha)
-import Numeric.Wrapper.R.GLPK.Phonetics.Ukrainian.Durations
+import Phladiprelio.RGLPK.Ukrainian
 import System.Environment (getArgs)
 import GHC.Arr
 import Text.Read
 import Data.List
 import Data.Maybe (fromMaybe)
-import Melodics.Ukrainian.ArrInt8
-
+import Phladiprelio.Ukrainian.Melodics
 
 main :: IO ()
 main = do
diff --git a/Numeric/Wrapper/R/GLPK/Phonetics/Ukrainian/Durations.hs b/Numeric/Wrapper/R/GLPK/Phonetics/Ukrainian/Durations.hs
deleted file mode 100644
--- a/Numeric/Wrapper/R/GLPK/Phonetics/Ukrainian/Durations.hs
+++ /dev/null
@@ -1,195 +0,0 @@
-{-# LANGUAGE CPP #-}
-{-# OPTIONS_HADDOCK show-extensions #-}
-
--- |
--- Module      :  Numeric.Wrapper.R.GLPK.Phonetics.Ukrainian.Durations
--- Copyright   :  (c) OleksandrZhabenko 2020-2021
--- License     :  MIT
--- Stability   :  Experimental
--- Maintainer  :  olexandr543@yahoo.com
---
--- Can be used to calculate the durations of the approximations of the Ukrainian phonemes
--- using some prepared text with its correct (at least mostly) pronunciation.
--- The prepared text is located in the same directory and contains lines --- the
--- Ukrainian word and its duration in seconds separated with whitespace.
--- The library is intended to use the functionality of the :
---
--- 1) R programming language https://www.r-project.org/
---
--- 2) Rglpk library https://cran.r-project.org/web/packages/Rglpk/index.html
---
--- 3) GNU GLPK library https://www.gnu.org/software/glpk/glpk.html
---
--- For more information, please, see the documentation for them.
---
--- For the model correctness the js here refers to \"ABCEFXYabcdefghijklmnopqrstuvxyz\".
--- To get such js some of the Ukrainian words in the abovementioned file must contain an apostrophe and there should be
--- somewhat like \"їх_друг\".
-
-module Numeric.Wrapper.R.GLPK.Phonetics.Ukrainian.Durations where
-
-#ifdef __GLASGOW_HASKELL__
-#if __GLASGOW_HASKELL__>=710
-/* code that applies only to GHC 7.10.* and higher versions */
-import GHC.Base (mconcat)
-#endif
-#endif
-import Data.Monoid hiding (mconcat)
-import Text.Read
-import Data.Maybe
-import CaseBi.Arr (getBFstLSorted')
-import Data.Foldable (foldl')
-import GHC.Arr
-import GHC.Int
-import Numeric
-import Data.List (intercalate)
-import Data.Lists.FLines (newLineEnding)
-import Data.Foldable.Ix (findIdx1)
-#ifdef __GLASGOW_HASKELL__
-#if __GLASGOW_HASKELL__==708
-/* code that applies only to GHC 7.8.* */
-mconcat = concat
-#endif
-#endif
-
-createCoeffsObj :: Int -> [String] -> [Double]
-createCoeffsObj l xss
-  | length xss < l = f (xss  `mappend`  replicate (l - length xss) "1.0")
-  | otherwise = f (take l xss)
-      where f tss = map (\ts -> fromMaybe 1.0 (readMaybe ts::Maybe Double)) tss
-
-countCharInWords :: [String] -> Char -> [Int]
-countCharInWords xss x
-  | null xss = []
-  | otherwise = map (length . filter (== x)) xss
-
-matrix1Column :: [String] -> String -> Char -> [Int]
-matrix1Column xss js x = pairwiseComparings x (countCharInWords xss x  `mappend`  rs  `mappend`  rs)
-  where l =  length js
-        iX = fromMaybe (-l - 1) . findIdx1 x $ js
-        rs = if iX < 0 then [] else replicate iX 0  `mappend`  [1]  `mappend`  replicate (l - 1 - iX) 0
-
-pairwiseComparings :: Char -> [Int] -> [Int]
-pairwiseComparings x ys = ys `mappend` pairs' x
-
-{-| @since 0.3.0.0
-Changed the \'f\' -- \'v\' (\'ф\' -- \'в\') proportions. The Ukrainian \'в\' is almost always shorter than
-\'ф\'.
--}
-pairs' :: Char -> [Int]
-pairs' x
-  | x == 'f' =  [10,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
-  | x == 'v' =  [-9,-20,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
-  | x == 'x' =  [0,0,10,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
-  | x == 'h' =  [0,0,-7,-13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
-  | x == 'g' =  [0,0,0,0,10,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
-  | x == 'k' =  [0,0,0,0,-7,-13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
-  | x == 'j' =  [0,0,0,0,0,0,10,10,0,0,10,10,0,0,0,0,0,0,0,0,10,10,0,0]
-  | x == 'B' =  [0,0,0,0,0,0,-10,-15,0,0,0,0,0,0,0,0,0,0,10,10,0,0,0,0]
-  | x == 'A' =  [0,0,0,0,0,0,0,0,10,10,0,0,0,0,0,0,0,0,0,0,0,0,10,10]
-  | x == 'z' =  [0,0,0,0,0,0,0,0,-10,-15,0,0,0,0,0,0,10,10,0,0,0,0,0,0]
-  | x == 'd' =  [0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,10,10,0,0,0,0,0,0,0,0]
-  | x == 'b' =  [0,0,0,0,0,0,0,0,0,0,0,0,10,10,0,0,0,0,0,0,0,0,0,0]
-  | x == 'p' =  [0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0,0,0,0,0,0,0]
-  | x == 't' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0,0,0,0,0]
-  | x == 's' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0,0,0]
-  | x == 'F' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0]
-  | x == 'E' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-8,-14,0,0]
-  | x == 'c' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-8,-14]
-  | otherwise =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
-
--- | Actually @n@ is a 'length' bss.
-matrixLine :: [String] -> String -> Int -> String
-matrixLine bss js n
-  | null bss || n <=0 = []
-  | otherwise = "mat1 <- matrix(c("  `mappend`  (intercalate ", " . map show $ (concatMap (matrix1Column (bss  `mappend`  bss) js) js))  `mappend`  "), nrow = "  `mappend`  show (2 * n + 2 * length js + 24)  `mappend`  ")" `mappend` newLineEnding
-
-{-| @since 0.3.0.0
-Switched to the array representation as the cheaper one.
--}
-objLine :: Array Int Double -> String
-objLine v
- | length v >= 32 = "obj1 <- c("  `mappend`  (intercalate ", " . map (\t -> showFFloat Nothing t "") $ objCoeffs v)  `mappend`  ")" `mappend` newLineEnding
- | otherwise = error "Numeric.Wrapper.R.GLPK.Phonetics.Ukrainian.Durations.objLine: Not defined for the short argument. "
-
-{-| @since 0.3.0.0
-Switched to the array representation as the cheaper one.
--}
-objCoeffs :: Array Int Double -> [Double]
-objCoeffs arr =
-  let lst = [(0, unsafeAt arr 14), (1, unsafeAt arr 16), (2, unsafeAt arr 9), (3, unsafeAt arr 17),
-        (4, unsafeAt arr 18), (5, unsafeAt arr 1), (6, unsafeAt arr 2), (7, unsafeAt arr 3), (8, unsafeAt arr 19),
-          (9, unsafeAt arr 20), (10, unsafeAt arr 21), (11, unsafeAt arr 4), (12, unsafeAt arr 22),
-           (13, unsafeAt arr 23), (14, unsafeAt arr 24), (15, unsafeAt arr 5), (16, unsafeAt arr 25),
-            (17, unsafeAt arr 26), (18, unsafeAt arr 10), (19, unsafeAt arr 11), (20, unsafeAt arr 12),
-             (21, unsafeAt arr 6), (22, unsafeAt arr 27), (23, unsafeAt arr 0), (24, unsafeAt arr 13),
-              (25, unsafeAt arr 28), (26, unsafeAt arr 29), (27, unsafeAt arr 7), (28, unsafeAt arr 14),
-                (29, unsafeAt arr 30), (30, unsafeAt arr 8), (31, unsafeAt arr 31)] in
-                  take 32 . map (getBFstLSorted' 1.0 lst) $ [0..31]
-
-maxLine :: String
-maxLine = "max1 <- TRUE\n"
-
-dirLine :: [String] -> String -> String
-dirLine bss js = "dir1 <- c(\"<"  `mappend`  g "<" bss  `mappend`  "\", \">"  `mappend`  g ">" (bss  `mappend`  map (:[]) js)  `mappend`  "\""  `mappend`  h0 32  `mappend`  h 12  `mappend`  ")" `mappend` newLineEnding
-  where g xs ys = (intercalate ("\", \""  `mappend`  xs) . replicate (length ys) $ "=")
-        h n = concat . replicate n $ ", \">=\", \"<=\""
-        h0 n = concat . replicate n $ ", \"<=\""
-
-rhsLineG :: [Double] -> [Double] -> [Double] -> String
-rhsLineG zs xs ys = "rhs1 <- c("  `mappend`  f (xs  `mappend`  ys  `mappend`  zs)  `mappend`  ")" `mappend` newLineEnding
-  where f ts = (intercalate ", " . map (\t -> showFFloat Nothing t "") $ ts)
-
-rhsLine :: [Double] -> [Double] -> String
-rhsLine = rhsLineG (minDurations  `mappend`  maxDurations  `mappend`  constraintsR1 12)
-
-constraintsR1 :: Int -> [Double]
-constraintsR1 n = replicate (2 * n) 0.0
-
-minDurations :: [Double]
-minDurations = map h [0..31]
-  where h i = if i == 23 then 0.02 else getBFstLSorted' 0.06 (zip [7,11,15,21,27,30] . replicate 6 $ 0.2) i
-
-maxDurations :: [Double]
-maxDurations = replicate 32 0.3
-
--- | A variant of the more general 'answer2' where the randomization parameters are used to produce every time being run a new result (e. g. this
--- allows to model accents).
-answer :: Array Int Double -> [String] -> [Double] -> [Double] -> String -> String
-answer = answer2 (-0.003) 0.003 (-0.0012) 0.0012
-
-answer2 :: Double -> Double -> Double -> Double -> Array Int Double -> [String] -> [Double] -> [Double] -> String -> String
-answer2 min1 max1 min2 max2 lsts bss xs ys js = mconcat ["library(\"Rglpk\")",newLineEnding,objLine lsts,matrixLine bss js (length bss),dirLine bss js,
- rhsLine xs ys,maxLine,newLineEnding,"k <- Rglpk_solve_LP(obj = obj1, mat = mat1, dir = dir1, rhs = rhs1, max = max1)",newLineEnding,
-  "y <- runif(32, min = ",showFFloat Nothing (-(abs min1)) ", max = ", showFFloat Nothing (abs max1) ")", newLineEnding,
-   "if (k$status == 0){k$solution / mean(k$solution)} else {c()}", newLineEnding,
-    "if (k$status == 0){z<- k$solution * 0.02 / k$solution[24] + y; z[24] <- 0.02 + runif(1, min = ", showFFloat Nothing (- (abs min2)) ", max = ",
-     showFFloat Nothing (abs max2) "); z;} else {c()}",newLineEnding,
-      "if (k$status == 0){sprintf(\"uzpp2DurationN = X.getBFst\' (%.8f, VB.fromList [(UZ \'A\' D, %.8f), (UZ \'A\' K, %.8f), (UZ \'B\' D, %.8f), ",
-       "(UZ \'B\' K, %.8f), (UZ \'C\' S, %.8f), (UZ \'D\' N, %.8f), (UZ \'E\' L, %.8f), (UZ \'E\' M, %.8f), (UZ \'F\' L, %.8f), (UZ \'F\' M, %.8f), ",
-        "(UZ \'a\' W, %.8f), ",
-          "(UZ \'b\' D, %.8f), (UZ \'b\' K, %.8f), (UZ \'c\' D, %.8f), (UZ \'d\' D, %.8f), (UZ \'d\' K, %.8f), (UZ \'e\' W, %.8f), (UZ \'f\' L, %.8f), ",
-            "(UZ \'f\' M, %.8f), (UZ \'g\' D, %.8f), (UZ \'g\' K, %.8f), (UZ \'h\' D, %.8f), (UZ \'h\' K, %.8f), (UZ \'i\' W, %.8f), (UZ \'j\' D, %.8f),",
-              " (UZ \'j\' K, %.8f), (UZ \'k\' L, %.8f), (UZ \'k\' M, %.8f), (UZ \'l\' S, %.8f), (UZ \'l\' O, %.8f), (UZ \'m\' S, %.8f), ",
-                "(UZ \'m\' O, %.8f), (UZ \'n\' S, %.8f), (UZ \'n\' O, %.8f), (UZ \'o\' W, %.8f), (UZ \'p\' L, %.8f), (UZ \'p\' M, %.8f), ",
-                  "(UZ \'q\' E, %.8f), (UZ \'r\' S, %.8f), (UZ \'r\' O, %.8f), (UZ \'s\' L, %.8f), (UZ \'t\' L, %.8f), (UZ \'t\' M, %.8f), ",
-                    "(UZ \'u\' W, %.8f), (UZ \'v\' S, %.8f), (UZ \'v\' O, %.8f), (UZ \'w\' N, %.8f), (UZ \'x\' L, %.8f), (UZ \'x\' M, %.8f), ",
-                      "(UZ \'y\' W, %.8f), (UZ \'z\' D, %.8f), (UZ \'z\' K, %.8f)])\",(z[6] + z[7]) / 2,z[1],z[1],z[2],z[2],z[3],z[26]+z[24],",
-                        "z[4],z[4],z[5],z[5],z[8],z[9],z[9],z[10],z[11],z[11],z[12],z[13],z[13],z[14],z[14],z[15],z[15],z[16],z[17],z[17],z[18],",
-                          "z[18],z[19],z[19],z[20],z[20],z[21],z[21],z[22],z[23],z[23],z[24],z[25],z[25],z[26],z[27],z[27],z[28],z[29],z[29],",
-                            "z[10]+z[24],z[30],z[30],z[31],z[32],z[32])} else {print(\"", newLineEnding, "\")}"]
-
-charReplace :: [Char] -> [Char]
-charReplace = concatMap g
- where g x
-        | x == '0' = "Y"
-        | x == 'w' = "cq"
-        | x == 'D' = "sq"
-        | otherwise = [x]
-{-# INLINE charReplace #-}
-
-s8toChar :: Int8 -> Char
-s8toChar = getBFstLSorted' ' ' [(1,'a'),(2,'e'),(3,'o'),(4,'u'),(5,'y'),(6,'i'),(7,'q'),(8,'A'),(10,'B'),(15,'b'),(17,'d'),
-   (19,'g'),(21,'h'),(23,'j'),(25,'z'),(27,'C'),(28,'l'),(30,'m'),(32,'n'),(34,'r'),(36,'v'),(38,'c'),(39,'E'),(41,'F'),
-     (43,'f'),(45,'k'),(47,'p'),(49,'s'),(50,'t'),(52,'x'),(54,'D'),(66,'w')]
-{-# INLINE s8toChar #-}
diff --git a/Phladiprelio/RGLPK/Ukrainian.hs b/Phladiprelio/RGLPK/Ukrainian.hs
new file mode 100644
--- /dev/null
+++ b/Phladiprelio/RGLPK/Ukrainian.hs
@@ -0,0 +1,186 @@
+{-# LANGUAGE NoImplicitPrelude #-}
+{-# OPTIONS_HADDOCK show-extensions #-}
+
+-- |
+-- Module      :  Phladiprelio.RGLPK.Ukrainian
+-- Copyright   :  (c) OleksandrZhabenko 2020-2023
+-- License     :  MIT
+-- Stability   :  Experimental
+-- Maintainer  :  oleksandr.zhabenko@yahoo.com
+--
+-- Can be used to calculate the durations of the approximations of the Ukrainian phonemes
+-- using some prepared text with its correct (at least mostly) pronunciation.
+-- The prepared text is located in the same directory and contains lines --- the
+-- Ukrainian word and its duration in seconds separated with whitespace.
+-- The library is intended to use the functionality of the :
+--
+-- 1) R programming language https://www.r-project.org/
+--
+-- 2) Rglpk library https://cran.r-project.org/web/packages/Rglpk/index.html
+--
+-- 3) GNU GLPK library https://www.gnu.org/software/glpk/glpk.html
+--
+-- For more information, please, see the documentation for them.
+--
+-- For the model correctness the js here refers to \"ABCEFXYabcdefghijklmnopqrstuvxyz\".
+-- To get such js some of the Ukrainian words in the abovementioned file must contain an apostrophe and there should be
+-- somewhat like \"їх_друг\".
+
+module Phladiprelio.RGLPK.Ukrainian where
+
+import GHC.Base
+import GHC.List
+import GHC.Num ((+),(-),(*),abs)
+import Text.Read
+import Text.Show (Show(..))
+import Data.Maybe
+import CaseBi.Arr (getBFstLSorted')
+import Data.Foldable (foldl')
+import GHC.Arr
+import GHC.Int
+import Numeric
+import Data.List (intercalate)
+import Data.Lists.FLines (newLineEnding)
+import Data.Foldable.Ix (findIdx1)
+
+createCoeffsObj :: Int -> [String] -> [Double]
+createCoeffsObj l xss
+  | length xss < l = f (xss  `mappend`  replicate (l - length xss) "1.0")
+  | otherwise = f (take l xss)
+      where f tss = map (\ts -> fromMaybe 1.0 (readMaybe ts::Maybe Double)) tss
+
+countCharInWords :: [String] -> Char -> [Int]
+countCharInWords xss x
+  | null xss = []
+  | otherwise = map (length . filter (== x)) xss
+
+matrix1Column :: [String] -> String -> Char -> [Int]
+matrix1Column xss js x = pairwiseComparings x (countCharInWords xss x  `mappend`  rs  `mappend`  rs)
+  where l =  length js
+        iX = fromMaybe (-l - 1) . findIdx1 x $ js
+        rs = if iX < 0 then [] else replicate iX 0  `mappend`  [1]  `mappend`  replicate (l - 1 - iX) 0
+
+pairwiseComparings :: Char -> [Int] -> [Int]
+pairwiseComparings x ys = ys `mappend` pairs' x
+
+{-| @since 0.3.0.0
+Changed the \'f\' -- \'v\' (\'ф\' -- \'в\') proportions. The Ukrainian \'в\' is almost always shorter than
+\'ф\'.
+-}
+pairs' :: Char -> [Int]
+pairs' x
+  | x == 'f' =  [10,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+  | x == 'v' =  [-9,-20,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+  | x == 'x' =  [0,0,10,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+  | x == 'h' =  [0,0,-7,-13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+  | x == 'g' =  [0,0,0,0,10,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+  | x == 'k' =  [0,0,0,0,-7,-13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+  | x == 'j' =  [0,0,0,0,0,0,10,10,0,0,10,10,0,0,0,0,0,0,0,0,10,10,0,0]
+  | x == 'B' =  [0,0,0,0,0,0,-10,-15,0,0,0,0,0,0,0,0,0,0,10,10,0,0,0,0]
+  | x == 'A' =  [0,0,0,0,0,0,0,0,10,10,0,0,0,0,0,0,0,0,0,0,0,0,10,10]
+  | x == 'z' =  [0,0,0,0,0,0,0,0,-10,-15,0,0,0,0,0,0,10,10,0,0,0,0,0,0]
+  | x == 'd' =  [0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,10,10,0,0,0,0,0,0,0,0]
+  | x == 'b' =  [0,0,0,0,0,0,0,0,0,0,0,0,10,10,0,0,0,0,0,0,0,0,0,0]
+  | x == 'p' =  [0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0,0,0,0,0,0,0]
+  | x == 't' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0,0,0,0,0]
+  | x == 's' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0,0,0]
+  | x == 'F' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-7,-13,0,0,0,0]
+  | x == 'E' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-8,-14,0,0]
+  | x == 'c' =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-8,-14]
+  | otherwise =  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
+
+-- | Actually @n@ is a 'length' bss.
+matrixLine :: [String] -> String -> Int -> String
+matrixLine bss js n
+  | null bss || n <=0 = []
+  | otherwise = "mat1 <- matrix(c("  `mappend`  (intercalate ", " . map show $ (concatMap (matrix1Column (bss  `mappend`  bss) js) js))  `mappend`  "), nrow = "  `mappend`  show (2 * n + 2 * length js + 24)  `mappend`  ")" `mappend` newLineEnding
+
+{-| @since 0.3.0.0
+Switched to the array representation as the cheaper one.
+-}
+objLine :: Array Int Double -> String
+objLine v
+ | numElements v >= 32 = "obj1 <- c("  `mappend`  (intercalate ", " . map (\t -> showFFloat Nothing t "") $ objCoeffs v)  `mappend`  ")" `mappend` newLineEnding
+ | otherwise = error "Phladiprelio.RGLPK.Ukrainian.objLine: Not defined for the short argument. "
+
+{-| @since 0.3.0.0
+Switched to the array representation as the cheaper one.
+-}
+objCoeffs :: Array Int Double -> [Double]
+objCoeffs arr =
+  let lst = [(0, unsafeAt arr 14), (1, unsafeAt arr 16), (2, unsafeAt arr 9), (3, unsafeAt arr 17),
+        (4, unsafeAt arr 18), (5, unsafeAt arr 1), (6, unsafeAt arr 2), (7, unsafeAt arr 3), (8, unsafeAt arr 19),
+          (9, unsafeAt arr 20), (10, unsafeAt arr 21), (11, unsafeAt arr 4), (12, unsafeAt arr 22),
+           (13, unsafeAt arr 23), (14, unsafeAt arr 24), (15, unsafeAt arr 5), (16, unsafeAt arr 25),
+            (17, unsafeAt arr 26), (18, unsafeAt arr 10), (19, unsafeAt arr 11), (20, unsafeAt arr 12),
+             (21, unsafeAt arr 6), (22, unsafeAt arr 27), (23, unsafeAt arr 0), (24, unsafeAt arr 13),
+              (25, unsafeAt arr 28), (26, unsafeAt arr 29), (27, unsafeAt arr 7), (28, unsafeAt arr 14),
+                (29, unsafeAt arr 30), (30, unsafeAt arr 8), (31, unsafeAt arr 31)] in
+                  take 32 . map (getBFstLSorted' 1.0 lst) $ [0..31]
+
+maxLine :: String
+maxLine = "max1 <- TRUE\n"
+
+dirLine :: [String] -> String -> String
+dirLine bss js = "dir1 <- c(\"<"  `mappend`  g "<" bss  `mappend`  "\", \">"  `mappend`  g ">" (bss  `mappend`  map (:[]) js)  `mappend`  "\""  `mappend`  h0 32  `mappend`  h 12  `mappend`  ")" `mappend` newLineEnding
+  where g xs ys = (intercalate ("\", \""  `mappend`  xs) . replicate (length ys) $ "=")
+        h n = concat . replicate n $ ", \">=\", \"<=\""
+        h0 n = concat . replicate n $ ", \"<=\""
+
+rhsLineG :: [Double] -> [Double] -> [Double] -> String
+rhsLineG zs xs ys = "rhs1 <- c("  `mappend`  f (xs  `mappend`  ys  `mappend`  zs)  `mappend`  ")" `mappend` newLineEnding
+  where f ts = (intercalate ", " . map (\t -> showFFloat Nothing t "") $ ts)
+
+rhsLine :: [Double] -> [Double] -> String
+rhsLine = rhsLineG (minDurations  `mappend`  maxDurations  `mappend`  constraintsR1 12)
+
+constraintsR1 :: Int -> [Double]
+constraintsR1 n = replicate (2 * n) 0.0
+
+minDurations :: [Double]
+minDurations = map h [0..31]
+  where h i = if i == 23 then 0.02 else getBFstLSorted' 0.06 (zip [7,11,15,21,27,30] . replicate 6 $ 0.2) i
+
+maxDurations :: [Double]
+maxDurations = replicate 32 0.3
+
+-- | A variant of the more general 'answer2' where the randomization parameters are used to produce every time being run a new result (e. g. this
+-- allows to model accents).
+answer :: Array Int Double -> [String] -> [Double] -> [Double] -> String -> String
+answer = answer2 (-0.003) 0.003 (-0.0012) 0.0012
+
+answer2 :: Double -> Double -> Double -> Double -> Array Int Double -> [String] -> [Double] -> [Double] -> String -> String
+answer2 min1 max1 min2 max2 lsts bss xs ys js = mconcat ["library(\"Rglpk\")",newLineEnding,objLine lsts,matrixLine bss js (length bss),dirLine bss js,
+ rhsLine xs ys,maxLine,newLineEnding,"k <- Rglpk_solve_LP(obj = obj1, mat = mat1, dir = dir1, rhs = rhs1, max = max1)",newLineEnding,
+  "y <- runif(32, min = ",showFFloat Nothing (-(abs min1)) ", max = ", showFFloat Nothing (abs max1) ")", newLineEnding,
+   "if (k$status == 0){k$solution / mean(k$solution)} else {c()}", newLineEnding,
+    "if (k$status == 0){z<- k$solution * 0.02 / k$solution[24] + y; z[24] <- 0.02 + runif(1, min = ", showFFloat Nothing (- (abs min2)) ", max = ",
+     showFFloat Nothing (abs max2) "); z;} else {c()}",newLineEnding,
+      "if (k$status == 0){sprintf(\"uzpp2DurationN = X.getBFst\' (%.8f, VB.fromList [(UZ \'A\' D, %.8f), (UZ \'A\' K, %.8f), (UZ \'B\' D, %.8f), ",
+       "(UZ \'B\' K, %.8f), (UZ \'C\' S, %.8f), (UZ \'D\' N, %.8f), (UZ \'E\' L, %.8f), (UZ \'E\' M, %.8f), (UZ \'F\' L, %.8f), (UZ \'F\' M, %.8f), ",
+        "(UZ \'a\' W, %.8f), ",
+          "(UZ \'b\' D, %.8f), (UZ \'b\' K, %.8f), (UZ \'c\' D, %.8f), (UZ \'d\' D, %.8f), (UZ \'d\' K, %.8f), (UZ \'e\' W, %.8f), (UZ \'f\' L, %.8f), ",
+            "(UZ \'f\' M, %.8f), (UZ \'g\' D, %.8f), (UZ \'g\' K, %.8f), (UZ \'h\' D, %.8f), (UZ \'h\' K, %.8f), (UZ \'i\' W, %.8f), (UZ \'j\' D, %.8f),",
+              " (UZ \'j\' K, %.8f), (UZ \'k\' L, %.8f), (UZ \'k\' M, %.8f), (UZ \'l\' S, %.8f), (UZ \'l\' O, %.8f), (UZ \'m\' S, %.8f), ",
+                "(UZ \'m\' O, %.8f), (UZ \'n\' S, %.8f), (UZ \'n\' O, %.8f), (UZ \'o\' W, %.8f), (UZ \'p\' L, %.8f), (UZ \'p\' M, %.8f), ",
+                  "(UZ \'q\' E, %.8f), (UZ \'r\' S, %.8f), (UZ \'r\' O, %.8f), (UZ \'s\' L, %.8f), (UZ \'t\' L, %.8f), (UZ \'t\' M, %.8f), ",
+                    "(UZ \'u\' W, %.8f), (UZ \'v\' S, %.8f), (UZ \'v\' O, %.8f), (UZ \'w\' N, %.8f), (UZ \'x\' L, %.8f), (UZ \'x\' M, %.8f), ",
+                      "(UZ \'y\' W, %.8f), (UZ \'z\' D, %.8f), (UZ \'z\' K, %.8f)])\",(z[6] + z[7]) / 2,z[1],z[1],z[2],z[2],z[3],z[26]+z[24],",
+                        "z[4],z[4],z[5],z[5],z[8],z[9],z[9],z[10],z[11],z[11],z[12],z[13],z[13],z[14],z[14],z[15],z[15],z[16],z[17],z[17],z[18],",
+                          "z[18],z[19],z[19],z[20],z[20],z[21],z[21],z[22],z[23],z[23],z[24],z[25],z[25],z[26],z[27],z[27],z[28],z[29],z[29],",
+                            "z[10]+z[24],z[30],z[30],z[31],z[32],z[32])} else {print(\"", newLineEnding, "\")}"]
+
+charReplace :: [Char] -> [Char]
+charReplace = concatMap g
+ where g x
+        | x == '0' = "Y"
+        | x == 'w' = "cq"
+        | x == 'D' = "sq"
+        | otherwise = [x]
+{-# INLINE charReplace #-}
+
+s8toChar :: Int8 -> Char
+s8toChar = getBFstLSorted' ' ' [(1,'a'),(2,'e'),(3,'o'),(4,'u'),(5,'y'),(6,'i'),(7,'q'),(8,'A'),(10,'B'),(15,'b'),(17,'d'),
+   (19,'g'),(21,'h'),(23,'j'),(25,'z'),(27,'C'),(28,'l'),(30,'m'),(32,'n'),(34,'r'),(36,'v'),(38,'c'),(39,'E'),(41,'F'),
+     (43,'f'),(45,'k'),(47,'p'),(49,'s'),(50,'t'),(52,'x'),(54,'D'),(66,'w')]
+{-# INLINE s8toChar #-}
diff --git a/r-glpk-phonetic-languages-ukrainian-durations.cabal b/r-glpk-phonetic-languages-ukrainian-durations.cabal
--- a/r-glpk-phonetic-languages-ukrainian-durations.cabal
+++ b/r-glpk-phonetic-languages-ukrainian-durations.cabal
@@ -3,14 +3,14 @@
 -- http://haskell.org/cabal/users-guide/
 
 name:                r-glpk-phonetic-languages-ukrainian-durations
-version:             0.4.2.0
+version:             0.5.0.0
 synopsis:            Can be used to calculate the durations of the approximations of the Ukrainian phonemes.
 description:         Can be used to calculate the durations of the approximations of the Ukrainian phonemes using some prepared text with its correct (at least mostly) pronunciation. The prepared text is located in the same directory and contains lines --- the Ukrainian word and its duration in seconds separated with whitespace.
 homepage:            https://hackage.haskell.org/package/r-glpk-phonetic-languages-ukrainian-durations
 license:             MIT
 license-file:        LICENSE
 author:              OleksandrZhabenko
-maintainer:          olexandr543@yahoo.com
+maintainer:          oleksandr.zhabenko@yahoo.com
 copyright:           Oleksandr Zhabenko
 category:            Language,Math
 build-type:          Simple
@@ -18,17 +18,17 @@
 cabal-version:       >=1.10
 
 library
-  exposed-modules:     Numeric.Wrapper.R.GLPK.Phonetics.Ukrainian.Durations
+  exposed-modules:     Phladiprelio.RGLPK.Ukrainian
   other-modules:       Main
-  other-extensions:    CPP
-  build-depends:       base >=4.8 && <5, mmsyn2-array ==0.3.0.0, ukrainian-phonetics-basic-array ==0.5.3.0, lists-flines ==0.1.2.0 && <1, foldable-ix ==0.2.1.0
+  other-extensions:    NoImplicitPrelude
+  build-depends:       base >=4.13 && <5, mmsyn2-array ==0.3.1.1, ukrainian-phonetics-basic-array ==0.7.0.0, lists-flines ==0.1.3.0, foldable-ix ==0.3.0.0
   -- hs-source-dirs:
   default-language:    Haskell2010
 
 executable pldUkr
   main-is:             Main.hs
-  other-modules:       Numeric.Wrapper.R.GLPK.Phonetics.Ukrainian.Durations
-  -- other-extensions:
-  build-depends:       base >=4.8 && <5, mmsyn2-array ==0.3.0.0, ukrainian-phonetics-basic-array >=0.5.3.0, lists-flines ==0.1.2.0 && <1, foldable-ix ==0.2.1.0
+  other-modules:       Phladiprelio.RGLPK.Ukrainian
+  other-extensions:    NoImplicitPrelude
+  build-depends:       base >=4.13 && <5, mmsyn2-array ==0.3.1.1, ukrainian-phonetics-basic-array ==0.7.0.0, lists-flines ==0.1.3.0, foldable-ix ==0.3.0.0
   -- hs-source-dirs:
   default-language:    Haskell2010