11937 files changed, 1894963 insertions, 651175 deletions

diff --git a/.appveyor.yml b/.appveyor.yml
new file mode 100644
index 0000000000..05ff204541
--- /dev/null
+++ b/.appveyor.yml
@@ -0,0 +1,134 @@
+---
+version: '{build}'
+init:
+  - git config --global user.name git
+  - git config --global user.email svn-admin@ruby-lang.org
+  - git config --global core.autocrlf false
+  - git config --global core.eol lf
+  - git config --global advice.detachedHead 0
+shallow_clone: true
+clone_depth: 10
+platform:
+  - x64
+skip_commits:
+  message: /\[DOC\]/
+  files:
+    - doc/*
+    - '**/*.md'
+    - '**/*.rdoc'
+    - '**/.document'
+    - '**/*.[1-8]'
+    - '**/*.ronn'
+environment:
+  ruby_version: "24-%Platform%"
+  matrix:
+    # Test only the oldest supported version because AppVeyor is unstable, its concurrency
+    # is limited, and compatibility issues that happen only in newer versions are rare.
+    # You may test some other stuff on GitHub Actions instead.
+    - build: vs
+      vs: 120 # Visual Studio 2013
+      ssl: OpenSSL-v111
+      # The worker image name. This is NOT the Visual Studio version we're using here.
+      APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2015
+      GEMS_FOR_TEST: ""
+  RELINE_TEST_ENCODING: "UTF-8"
+cache:
+  - c:\Tools\vcpkg\installed\
+for:
+-
+  matrix:
+    only:
+      - build: vs
+  install:
+    - ver
+    - chcp
+    - SET BITS=%Platform:x86=32%
+    - SET BITS=%BITS:x=%
+    - SET OPENSSL_DIR=C:\%ssl%-Win%BITS%
+    - cd C:\Tools\vcpkg
+    - git pull -q
+    - .\bootstrap-vcpkg.bat
+    - ps: Start-FileDownload 'https://github.com/microsoft/vcpkg-tool/releases/download/2023-08-09/vcpkg.exe' -FileName 'C:\Tools\vcpkg\vcpkg.exe'
+    - cd %APPVEYOR_BUILD_FOLDER%
+    - vcpkg --triplet %Platform%-windows install --x-use-aria2 libffi libyaml readline zlib
+    - CALL SET vcvars=%%^VS%VS%COMNTOOLS^%%..\..\VC\vcvarsall.bat
+    - SET vcvars
+    - '"%vcvars%" %Platform:x64=amd64%'
+    - SET ruby_path=C:\Ruby%ruby_version:-x86=%
+    - SET PATH=\usr\local\bin;%ruby_path%\bin;%PATH%;C:\msys64\mingw64\bin;C:\msys64\usr\bin
+    - ruby --version
+    - 'cl'
+    - echo> Makefile srcdir=.
+    - echo>> Makefile MSC_VER=0
+    - echo>> Makefile RT=none
+    - echo>> Makefile RT_VER=0
+    - echo>> Makefile BUILTIN_ENCOBJS=nul
+    - type win32\Makefile.sub >> Makefile
+    - nmake %mflags% up VCSUP="echo Update OK"
+    - nmake %mflags% extract-extlibs
+    - del Makefile
+    - mkdir \usr\local\bin
+    - mkdir \usr\local\include
+    - mkdir \usr\local\lib
+    - for %%I in (%OPENSSL_DIR%\*.dll) do mklink /h \usr\local\bin\%%~nxI %%I
+    - for %%I in (c:\Tools\vcpkg\installed\%Platform%-windows\bin\*.dll) do (
+        if not %%~nI == readline mklink \usr\local\bin\%%~nxI %%I
+      )
+    - attrib +r /s /d
+    - mkdir %Platform%-mswin_%vs%
+  build_script:
+    - set HAVE_GIT=no
+    - cd %APPVEYOR_BUILD_FOLDER%
+    - cd %Platform%-mswin_%vs%
+    - >-
+      ..\win32\configure.bat
+      --with-opt-dir="/usr/local;c:/Tools/vcpkg/installed/%Platform%-windows"
+      --with-openssl-dir=%OPENSSL_DIR:\=/%
+    - nmake -l
+    - nmake install-nodoc
+    - \usr\bin\ruby -v -e "p :locale => Encoding.find('locale'), :filesystem => Encoding.find('filesystem')"
+    - if not "%GEMS_FOR_TEST%" == "" \usr\bin\gem install --no-document %GEMS_FOR_TEST%
+    - \usr\bin\ruby -ropenssl -e "puts 'Build    ' + OpenSSL::OPENSSL_VERSION, 'Runtime  ' + OpenSSL::OPENSSL_LIBRARY_VERSION"
+  test_script:
+    - set /a JOBS=%NUMBER_OF_PROCESSORS%
+    - nmake -l "TESTOPTS=-v -q" btest
+    - nmake -l "TESTOPTS=-v -q" test-basic
+    - >-
+      nmake -l "TESTOPTS=--timeout-scale=3.0
+      --excludes=../test/excludes/_appveyor -j%JOBS%
+      --exclude win32ole
+      --exclude test_bignum
+      --exclude test_syntax
+      --exclude test_open-uri
+      --exclude test_bundled_ca
+      " test-all
+    # separately execute tests without -j which may crash worker with -j.
+    - >-
+      nmake -l
+      "TESTOPTS=--timeout-scale=3.0 --excludes=../test/excludes/_appveyor"
+      TESTS="
+      ../test/win32ole
+      ../test/ruby/test_bignum.rb
+      ../test/ruby/test_syntax.rb
+      ../test/open-uri/test_open-uri.rb
+      ../test/rubygems/test_bundled_ca.rb
+      " test-all
+    - nmake -l test-spec MSPECOPT=-fs # not using `-j` because sometimes `mspec -j` silently dies on Windows
+notifications:
+  - provider: Webhook
+    method: POST
+    url:
+      secure: CcFlJNDJ/a6to7u3Z4Fnz6dScEPNx7hTha2GkSRlV+1U6dqmxY/7uBcLXYb9gR3jfQk6w+2o/HrjNAyXMNGU/JOka3s2WRI4VKitzM+lQ08owvJIh0R7LxrGH0J2e81U # ruby-lang slack: ruby/simpler-alerts-bot
+    body: >-
+      {{^isPullRequest}}
+        {
+          "ci": "AppVeyor CI",
+          "env": "Visual Studio 2013",
+          "url": "{{buildUrl}}",
+          "commit": "{{commitId}}",
+          "branch": "{{branch}}"
+        }
+      {{/isPullRequest}}
+    on_build_success: false
+    on_build_failure: true
+    on_build_status_changed: false
diff --git a/.dir-locals.el b/.dir-locals.el
new file mode 100644
index 0000000000..8f4b96445c
--- /dev/null
+++ b/.dir-locals.el
@@ -0,0 +1,39 @@
+;; Copyright (c) 2018 Urabe, Shyouhei.  All rights reserved.
+;;
+;; This file is a part of  the programming language Ruby.  Permission is hereby
+;; granted, to either  redistribute and/or modify this file,  provided that the
+;; conditions mentioned  in the  file COPYING  are met.   Consult the  file for
+;; details.
+
+((nil .
+     ((indent-tabs-mode . nil)
+      (require-final-newline . t)
+      (tab-width . 8)
+      (show-trailing-whitespace . t)
+      (whitespace-line-column . 80))) ;; See also [Misc #12277]
+
+ ;; (bat-mode . ((buffer-file-coding-system . utf-8-dos)))
+
+ (ruby-mode . ((ruby-indent-level . 2)))
+
+ (rdoc-mode . ((fill-column . 74)))
+
+ (yaml-mode . ((yaml-indent-offset . 2)))
+
+ (makefile-mode . ((indent-tabs-mode . t)))
+
+ (c-mode . ((c-file-style . "ruby")))
+
+ (c++-mode . ((c-file-style . "ruby")))
+
+ (change-log-mode .
+     ((buffer-file-coding-system . us-ascii)
+      (indent-tabs-mode . t)
+      (change-log-indent-text . 2)
+      (add-log-time-format . (lambda (&optional x y)
+        (let* ((time (or x (current-time)))
+	       (system-time-locale "C")
+	       (diff (+ (cadr time) 32400))
+	       (lo (% diff 65536))
+	       (hi (+ (car time) (/ diff 65536))))
+        (format-time-string "%a %b %e %H:%M:%S %Y" (list hi lo) t)))))))
diff --git a/.document b/.document
index 8a05d61beb..3a6b0c238c 100644
--- a/.document
+++ b/.document
@@ -5,18 +5,50 @@
 
 # Process all the C source files
 *.c
+*.y
 
 # prelude
 prelude.rb
+rbconfig.rb
+
+array.rb
+ast.rb
+dir.rb
+gc.rb
+io.rb
+kernel.rb
+marshal.rb
+mjit.rb
+numeric.rb
+nilclass.rb
+pack.rb
+ractor.rb
+string.rb
+symbol.rb
+timev.rb
+thread_sync.rb
+trace_point.rb
+warning.rb
+yjit.rb
 
 # the lib/ directory (which has its own .document file)
-
 lib
 
-
 # and some of the ext/ directory (which has its own .document file)
-
 ext
 
 # rdoc files
-doc/*.rdoc
+NEWS.md
+
+README.md
+README.ja.md
+
+COPYING
+COPYING.ja
+
+LEGAL
+
+# win32/README.win32 linked from README.md
+win32
+
+doc
diff --git a/.editorconfig b/.editorconfig
new file mode 100644
index 0000000000..4633a7acae
--- /dev/null
+++ b/.editorconfig
@@ -0,0 +1,30 @@
+root = true
+
+[*]
+end_of_line = lf
+indent_size = 4
+indent_style = space
+insert_final_newline = true
+tab_width = 8
+trim_trailing_whitespace = true
+
+[*.bat]
+end_of_line = crlf
+
+[*.gemspec]
+indent_size = 2
+
+[*.rb]
+indent_size = 2
+
+[*.yml]
+indent_size = 2
+
+[{*[Mm]akefile*,*.mak,*.mk,depend}]
+indent_style = tab
+
+[enc/*]
+indent_size = 2
+
+[reg*.[ch]]
+indent_size = 2
diff --git a/.gdbinit b/.gdbinit
index 4ed4e7f5e3..34d044caf6 100644
--- a/.gdbinit
+++ b/.gdbinit
@@ -1,80 +1,36 @@
-define rp
+set startup-with-shell off
+
+define hook-run
+  set $color_type = 0
+  set $color_highlite = 0
+  set $color_end = 0
+end
+
+define ruby_gdb_init
+  if !$color_type
+    set $color_type = "\033[31m"
+  end
+  if !$color_highlite
+    set $color_highlite = "\033[36m"
+  end
+  if !$color_end
+    set $color_end = "\033[m"
+  end
   if ruby_dummy_gdb_enums.special_consts
   end
+end
+
+# set prompt \033[36m(gdb)\033[m\040
+
+define rp
+  ruby_gdb_init
   if (VALUE)($arg0) & RUBY_FIXNUM_FLAG
     printf "FIXNUM: %ld\n", (long)($arg0) >> 1
   else
   if ((VALUE)($arg0) & ~(~(VALUE)0<<RUBY_SPECIAL_SHIFT)) == RUBY_SYMBOL_FLAG
     set $id = (($arg0) >> RUBY_SPECIAL_SHIFT)
-    if $id == '!' || $id == '+' || $id == '-' || $id == '*' || $id == '/' || $id == '%' || $id == '<' || $id == '>' || $id == '`'
-      printf "SYMBOL(:%c)\n", $id
-    else
-    if $id == idDot2
-      echo SYMBOL(:..)\n
-    else
-    if $id == idDot3
-      echo SYMBOL(:...)\n
-    else
-    if $id == idUPlus
-      echo SYMBOL(:+@)\n
-    else
-    if $id == idUMinus
-      echo SYMBOL(:-@)\n
-    else
-    if $id == idPow
-      echo SYMBOL(:**)\n
-    else
-    if $id == idCmp
-      echo SYMBOL(:<=>)\n
-    else
-    if $id == idLTLT
-      echo SYMBOL(:<<)\n
-    else
-    if $id == idLE
-      echo SYMBOL(:<=)\n
-    else
-    if $id == idGE
-      echo SYMBOL(:>=)\n
-    else
-    if $id == idEq
-      echo SYMBOL(:==)\n
-    else
-    if $id == idEqq
-      echo SYMBOL(:===)\n
-    else
-    if $id == idNeq
-      echo SYMBOL(:!=)\n
-    else
-    if $id == idEqTilde
-      echo SYMBOL(:=~)\n
-    else
-    if $id == idNeqTilde
-      echo SYMBOL(:!~)\n
-    else
-    if $id == idAREF
-      echo SYMBOL(:[])\n
-    else
-    if $id == idASET
-      echo SYMBOL(:[]=)\n
-    else
-      printf "SYMBOL(%ld)\n", $id
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
-    end
+    printf "%sSYMBOL%s: ", $color_type, $color_end
+    rp_id $id
   else
   if ($arg0) == RUBY_Qfalse
     echo false\n
@@ -89,85 +45,69 @@ define rp
     echo undef\n
   else
   if (VALUE)($arg0) & RUBY_IMMEDIATE_MASK
-    echo immediate\n
+    if ((VALUE)($arg0) & RUBY_FLONUM_MASK) == RUBY_FLONUM_FLAG
+      printf "%sFLONUM%s: %g\n", $color_type, $color_end, (double)rb_float_value($arg0)
+    else
+      echo immediate\n
+    end
   else
   set $flags = ((struct RBasic*)($arg0))->flags
+  if ($flags & RUBY_FL_PROMOTED) == RUBY_FL_PROMOTED
+    printf "[PROMOTED] "
+  end
   if ($flags & RUBY_T_MASK) == RUBY_T_NONE
-    printf "T_NONE: "
+    printf "%sT_NONE%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_NIL
-    printf "T_NIL: "
+    printf "%sT_NIL%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_OBJECT
-    printf "T_OBJECT: "
-    print (struct RObject *)($arg0)
+    printf "%sT_OBJECT%s: ", $color_type, $color_end
+    print ((struct RObject *)($arg0))->basic
+    if ($flags & ROBJECT_EMBED)
+      print/x *((VALUE*)((struct RObject*)($arg0))->as.ary) @ (ROBJECT_EMBED_LEN_MAX+0)
+    else
+      print (((struct RObject *)($arg0))->as.heap)
+      if (((struct RObject*)($arg0))->as.heap.numiv) > 0
+        print/x *(((struct RObject*)($arg0))->as.heap.ivptr) @ (((struct RObject*)($arg0))->as.heap.numiv)
+      end
+    end
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_CLASS
-    printf "T_CLASS%s: ", ($flags & RUBY_FL_SINGLETON) ? "*" : ""
-    print (struct RClass *)($arg0)
+    printf "%sT_CLASS%s%s: ", $color_type, ($flags & RUBY_FL_SINGLETON) ? "*" : "", $color_end
+    rp_class $arg0
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_ICLASS
-    printf "T_ICLASS: "
-    print (struct RClass *)($arg0)
+    printf "%sT_ICLASS%s: ", $color_type, $color_end
+    rp_class $arg0
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_MODULE
-    printf "T_MODULE: "
-    print (struct RClass *)($arg0)
+    printf "%sT_MODULE%s: ", $color_type, $color_end
+    rp_class $arg0
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_FLOAT
-    printf "T_FLOAT: %.16g ", (((struct RFloat*)($arg0))->float_value)
+    printf "%sT_FLOAT%s: %.16g ", $color_type, $color_end, (((struct RFloat*)($arg0))->float_value)
     print (struct RFloat *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_STRING
-    printf "T_STRING: "
-    set print address off
-    output (char *)(($flags & RUBY_FL_USER1) ? \
-	    ((struct RString*)($arg0))->as.heap.ptr : \
-	    ((struct RString*)($arg0))->as.ary)
-    set print address on
-    printf " bytesize:%ld ", ($flags & RUBY_FL_USER1) ? \
-            ((struct RString*)($arg0))->as.heap.len : \
-            (($flags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
-    if !($flags & RUBY_FL_USER1)
-      printf "(embed) "
-    else
-      if ($flags & RUBY_FL_USER2)
-        printf "(shared) "
-      end
-      if ($flags & RUBY_FL_USER3)
-        printf "(assoc) "
-      end
-    end
-    printf "encoding:%d ", ($flags & RUBY_ENCODING_MASK) >> RUBY_ENCODING_SHIFT
-    if ($flags & RUBY_ENC_CODERANGE_MASK) == 0
-      printf "coderange:unknown "
-    else
-    if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_7BIT
-      printf "coderange:7bit "
-    else
-    if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_VALID
-      printf "coderange:valid "
-    else
-      printf "coderange:broken "
-    end
-    end
-    end
-    print (struct RString *)($arg0)
+    printf "%sT_STRING%s: ", $color_type, $color_end
+    rp_string $arg0 $flags
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_REGEXP
     set $regsrc = ((struct RRegexp*)($arg0))->src
     set $rsflags = ((struct RBasic*)$regsrc)->flags
-    printf "T_REGEXP: "
+    printf "%sT_REGEXP%s: ", $color_type, $color_end
+    set $len = ($rsflags & RUBY_FL_USER1) ? \
+            ((struct RString*)$regsrc)->as.heap.len : \
+            (($rsflags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
     set print address off
-    output (char *)(($rsflags & RUBY_FL_USER1) ? \
+    output *(char *)(($rsflags & RUBY_FL_USER1) ? \
 	    ((struct RString*)$regsrc)->as.heap.ptr : \
-	    ((struct RString*)$regsrc)->as.ary)
+	    ((struct RString*)$regsrc)->as.ary) @ $len
     set print address on
-    printf " len:%ld ", ($rsflags & RUBY_FL_USER1) ? \
-            ((struct RString*)$regsrc)->as.heap.len : \
-            (($rsflags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
+    printf " len:%ld ", $len
     if $flags & RUBY_FL_USER6
       printf "(none) "
     end
@@ -183,20 +123,20 @@ define rp
   if ($flags & RUBY_T_MASK) == RUBY_T_ARRAY
     if ($flags & RUBY_FL_USER1)
       set $len = (($flags & (RUBY_FL_USER3|RUBY_FL_USER4)) >> (RUBY_FL_USHIFT+3))
-      printf "T_ARRAY: len=%ld ", $len
+      printf "%sT_ARRAY%s: len=%ld ", $color_type, $color_end, $len
       printf "(embed) "
       if ($len == 0)
 	printf "{(empty)} "
       else
-	output/x *((VALUE*)((struct RArray*)($arg0))->as.ary) @ $len
+	print/x *((VALUE*)((struct RArray*)($arg0))->as.ary) @ $len
 	printf " "
       end
     else
       set $len = ((struct RArray*)($arg0))->as.heap.len
-      printf "T_ARRAY: len=%ld ", $len
+      printf "%sT_ARRAY%s: len=%ld ", $color_type, $color_end, $len
       if ($flags & RUBY_FL_USER2)
 	printf "(shared) shared="
-	output/x ((struct RArray*)($arg0))->as.heap.aux.shared
+	output/x ((struct RArray*)($arg0))->as.heap.aux.shared_root
 	printf " "
       else
 	printf "(ownership) capa=%ld ", ((struct RArray*)($arg0))->as.heap.aux.capa
@@ -204,101 +144,132 @@ define rp
       if ($len == 0)
 	printf "{(empty)} "
       else
-	output/x *((VALUE*)((struct RArray*)($arg0))->as.heap.ptr) @ $len
+	print/x *((VALUE*)((struct RArray*)($arg0))->as.heap.ptr) @ $len
 	printf " "
       end
     end
     print (struct RArray *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_FIXNUM
-    printf "T_FIXNUM: "
+    printf "%sT_FIXNUM%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_HASH
-    printf "T_HASH: ",
-    if ((struct RHash *)($arg0))->ntbl
-      printf "len=%ld ", ((struct RHash *)($arg0))->ntbl->num_entries
+    printf "%sT_HASH%s: ", $color_type, $color_end,
+    if (((struct RHash *)($arg0))->basic.flags & RHASH_ST_TABLE_FLAG)
+      printf "st len=%ld ", ((struct RHash *)($arg0))->as.st->num_entries
+    else
+      printf "li len=%ld bound=%ld ", \
+        ((((struct RHash *)($arg0))->basic.flags & RHASH_AR_TABLE_SIZE_MASK) >> RHASH_AR_TABLE_SIZE_SHIFT), \
+        ((((struct RHash *)($arg0))->basic.flags & RHASH_AR_TABLE_BOUND_MASK) >> RHASH_AR_TABLE_BOUND_SHIFT)
     end
     print (struct RHash *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_STRUCT
-    printf "T_STRUCT: len=%ld ", \
-      (($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
+    set $len = (($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
        ($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) >> (RUBY_FL_USHIFT+1) : \
        ((struct RStruct *)($arg0))->as.heap.len)
+    printf "%sT_STRUCT%s: len=%ld ", $color_type, $color_end, $len
     print (struct RStruct *)($arg0)
-    x/xw (($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
-          ((struct RStruct *)($arg0))->as.ary : \
-          ((struct RStruct *)($arg0))->as.heap.ptr)
+    output/x *(($flags & (RUBY_FL_USER1|RUBY_FL_USER2)) ? \
+              ((struct RStruct *)($arg0))->as.ary : \
+              ((struct RStruct *)($arg0))->as.heap.ptr) @ $len
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_BIGNUM
-    printf "T_BIGNUM: sign=%d len=%ld ", \
-      (($flags & RUBY_FL_USER1) != 0), \
-      (($flags & RUBY_FL_USER2) ? \
-       ($flags & (RUBY_FL_USER5|RUBY_FL_USER4|RUBY_FL_USER3)) >> (RUBY_FL_USHIFT+3) : \
-       ((struct RBignum*)($arg0))->as.heap.len)
-    if $flags & RUBY_FL_USER2
-      printf "(embed) "
-    end
-    print (struct RBignum *)($arg0)
-    x/xw (($flags & RUBY_FL_USER2) ? \
-          ((struct RBignum*)($arg0))->as.ary : \
-          ((struct RBignum*)($arg0))->as.heap.digits)
+    rp_bignum $arg0
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_RATIONAL
-    printf "T_RATIONAL: "
+    printf "%sT_RATIONAL%s: ", $color_type, $color_end
     print (struct RRational *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_COMPLEX
-    printf "T_COMPLEX: "
+    printf "%sT_COMPLEX%s: ", $color_type, $color_end
     print (struct RComplex *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_FILE
-    printf "T_FILE: "
+    printf "%sT_FILE%s: ", $color_type, $color_end
     print (struct RFile *)($arg0)
     output *((struct RFile *)($arg0))->fptr
     printf "\n"
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_TRUE
-    printf "T_TRUE: "
+    printf "%sT_TRUE%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_FALSE
-    printf "T_FALSE: "
+    printf "%sT_FALSE%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_DATA
     if ((struct RTypedData *)($arg0))->typed_flag == 1
-      printf "T_DATA(%s): ", ((struct RTypedData *)($arg0))->type->wrap_struct_name
+      printf "%sT_DATA%s(%s): ", $color_type, $color_end, ((struct RTypedData *)($arg0))->type->wrap_struct_name
       print (struct RTypedData *)($arg0)
     else
-      printf "T_DATA: "
+      printf "%sT_DATA%s: ", $color_type, $color_end
       print (struct RData *)($arg0)
     end
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_MATCH
-    printf "T_MATCH: "
+    printf "%sT_MATCH%s: ", $color_type, $color_end
     print (struct RMatch *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_SYMBOL
-    printf "T_SYMBOL: "
-    print (struct RBasic *)($arg0)
+    printf "%sT_SYMBOL%s: ", $color_type, $color_end
+    print (struct RSymbol *)($arg0)
+    set $id_type = ((struct RSymbol *)($arg0))->id & RUBY_ID_SCOPE_MASK
+    if $id_type == RUBY_ID_LOCAL
+      printf "l"
+    else
+    if $id_type == RUBY_ID_INSTANCE
+      printf "i"
+    else
+    if $id_type == RUBY_ID_GLOBAL
+      printf "G"
+    else
+    if $id_type == RUBY_ID_ATTRSET
+      printf "a"
+    else
+    if $id_type == RUBY_ID_CONST
+      printf "C"
+    else
+    if $id_type == RUBY_ID_CLASS
+      printf "c"
+    else
+      printf "j"
+    end
+    end
+    end
+    end
+    end
+    end
+    set $id_fstr = ((struct RSymbol *)($arg0))->fstr
+    rp_string $id_fstr
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_UNDEF
-    printf "T_UNDEF: "
+    printf "%sT_UNDEF%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   else
+  if ($flags & RUBY_T_MASK) == RUBY_T_IMEMO
+    printf "%sT_IMEMO%s(", $color_type, $color_end
+    output (enum imemo_type)(($flags>>RUBY_FL_USHIFT)&RUBY_IMEMO_MASK)
+    printf "): "
+    rp_imemo $arg0
+  else
   if ($flags & RUBY_T_MASK) == RUBY_T_NODE
-    printf "T_NODE("
+    printf "%sT_NODE%s(", $color_type, $color_end
     output (enum node_type)(($flags&RUBY_NODE_TYPEMASK)>>RUBY_NODE_TYPESHIFT)
     printf "): "
     print *(NODE *)($arg0)
   else
   if ($flags & RUBY_T_MASK) == RUBY_T_ZOMBIE
-    printf "T_ZOMBIE: "
+    printf "%sT_ZOMBIE%s: ", $color_type, $color_end
     print (struct RData *)($arg0)
   else
-    printf "unknown: "
+  if ($flags & RUBY_T_MASK) == RUBY_T_MOVED
+    printf "%sT_MOVED%s: ", $color_type, $color_end
+    print *(struct RMoved *)$arg0
+  else
+    printf "%sunknown%s: ", $color_type, $color_end
     print (struct RBasic *)($arg0)
   end
   end
@@ -332,11 +303,303 @@ define rp
   end
   end
   end
+  end
+  end
 end
 document rp
   Print a Ruby's VALUE.
 end
 
+define rp_id
+  set $id = (ID)$arg0
+  if $id == '!' || $id == '+' || $id == '-' || $id == '*' || $id == '/' || $id == '%' || $id == '<' || $id == '>' || $id == '`'
+    printf "(:%c)\n", $id
+  else
+  if $id == idDot2
+    printf "(:..)\n"
+  else
+  if $id == idDot3
+    printf "(:...)\n"
+  else
+  if $id == idUPlus
+    printf "(:+@)\n"
+  else
+  if $id == idUMinus
+    printf "(:-@)\n"
+  else
+  if $id == idPow
+    printf "(:**)\n"
+  else
+  if $id == idCmp
+    printf "(:<=>)\n"
+  else
+  if $id == idLTLT
+    printf "(:<<)\n"
+  else
+  if $id == idGTGT
+    printf "(:>>)\n"
+  else
+  if $id == idLE
+    printf "(:<=)\n"
+  else
+  if $id == idGE
+    printf "(:>=)\n"
+  else
+  if $id == idEq
+    printf "(:==)\n"
+  else
+  if $id == idEqq
+    printf "(:===)\n"
+  else
+  if $id == idNeq
+    printf "(:!=)\n"
+  else
+  if $id == idEqTilde
+    printf "(:=~)\n"
+  else
+  if $id == idNeqTilde
+    printf "(:!~)\n"
+  else
+  if $id == idAREF
+    printf "(:[])\n"
+  else
+  if $id == idASET
+    printf "(:[]=)\n"
+  else
+  if $id == idCOLON2
+    printf "(:'::')\n"
+  else
+  if $id == idANDOP
+    printf "(:&&)\n"
+  else
+  if $id == idOROP
+    printf "(:||)\n"
+  else
+  if $id == idANDDOT
+    printf "(:&.)\n"
+  else
+    if $id <= tLAST_OP_ID
+      printf "O"
+    else
+      set $id_type = $id & RUBY_ID_SCOPE_MASK
+      if $id_type == RUBY_ID_LOCAL
+        printf "l"
+      else
+      if $id_type == RUBY_ID_INSTANCE
+        printf "i"
+      else
+      if $id_type == RUBY_ID_GLOBAL
+        printf "G"
+      else
+      if $id_type == RUBY_ID_ATTRSET
+        printf "a"
+      else
+      if $id_type == RUBY_ID_CONST
+        printf "C"
+      else
+      if $id_type == RUBY_ID_CLASS
+        printf "c"
+      else
+        printf "j"
+      end
+      end
+      end
+      end
+      end
+      end
+    end
+    printf "(%ld): ", $id
+    print_id $id
+    echo \n
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+end
+document rp_id
+  Print an ID.
+end
+
+define output_string
+  set $flags = ((struct RBasic*)($arg0))->flags
+  set $len = ($flags & RUBY_FL_USER1) ? \
+          ((struct RString*)($arg0))->as.heap.len : \
+          (($flags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
+  if $len > 0
+    output *(char *)(($flags & RUBY_FL_USER1) ? \
+	    ((struct RString*)($arg0))->as.heap.ptr : \
+	    ((struct RString*)($arg0))->as.ary) @ $len
+  else
+    output ""
+  end
+end
+
+define print_string
+  set $flags = ((struct RBasic*)($arg0))->flags
+  set $len = ($flags & RUBY_FL_USER1) ? \
+          ((struct RString*)($arg0))->as.heap.len : \
+          (($flags & (RUBY_FL_USER2|RUBY_FL_USER3|RUBY_FL_USER4|RUBY_FL_USER5|RUBY_FL_USER6)) >> RUBY_FL_USHIFT+2)
+  if $len > 0
+    printf "%s", *(char *)(($flags & RUBY_FL_USER1) ? \
+	    ((struct RString*)($arg0))->as.heap.ptr : \
+	    ((struct RString*)($arg0))->as.ary) @ $len
+  end
+end
+
+define rp_string
+  output_string $arg0
+  printf " bytesize:%ld ", $len
+  if !($flags & RUBY_FL_USER1)
+    printf "(embed) "
+  else
+    if ($flags & RUBY_FL_USER2)
+      printf "(shared) "
+    end
+    if ($flags & RUBY_FL_USER3)
+      printf "(assoc) "
+    end
+  end
+  printf "encoding:%d ", ($flags & RUBY_ENCODING_MASK) >> RUBY_ENCODING_SHIFT
+  if ($flags & RUBY_ENC_CODERANGE_MASK) == 0
+    printf "coderange:unknown "
+  else
+  if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_7BIT
+    printf "coderange:7bit "
+  else
+  if ($flags & RUBY_ENC_CODERANGE_MASK) == RUBY_ENC_CODERANGE_VALID
+    printf "coderange:valid "
+  else
+    printf "coderange:broken "
+  end
+  end
+  end
+  print (struct RString *)($arg0)
+end
+document rp_string
+  Print the content of a String.
+end
+
+define rp_bignum
+  set $flags = ((struct RBignum*)($arg0))->basic.flags
+  set $len = (($flags & RUBY_FL_USER2) ? \
+       ($flags & (RUBY_FL_USER5|RUBY_FL_USER4|RUBY_FL_USER3)) >> (RUBY_FL_USHIFT+3) : \
+       ((struct RBignum*)($arg0))->as.heap.len)
+  printf "%sT_BIGNUM%s: sign=%d len=%ld ", $color_type, $color_end, \
+         (($flags & RUBY_FL_USER1) != 0), $len
+  if $flags & RUBY_FL_USER2
+    printf "(embed) "
+  end
+  print (struct RBignum *)($arg0)
+  set $ptr = (($flags & RUBY_FL_USER2) ? \
+              ((struct RBignum*)($arg0))->as.ary : \
+              ((struct RBignum*)($arg0))->as.heap.digits)
+  set $len = $len-1
+  printf "0x%x", $ptr[$len]
+  while $len > 0
+    set $len = $len-1
+    set $val = $ptr[$len]
+    set $w = sizeof($ptr[0])
+    printf "_"
+    if $w > 8
+      printf "%.32x", $val
+    else
+    if $w > 4
+      printf "%.16x", $val
+    else
+    if $w > 2
+      printf "%.8x", $val
+    else
+    if $w > 1
+      printf "%.4x", $val
+    else
+      printf "%.2x", $val
+    end
+    end
+    end
+    end
+  end
+  printf "\n"
+end
+document rp_bignum
+  Print the content of a Bignum.
+end
+
+define rp_class
+  printf "(struct RClass *) %p", (void*)$arg0
+  if RCLASS_ORIGIN((struct RClass *)($arg0)) != $arg0
+    printf " -> %p", RCLASS_ORIGIN((struct RClass *)($arg0))
+  end
+  printf "\n"
+  rb_classname $arg0
+  print/x *(struct RClass *)($arg0)
+  print *RCLASS_EXT((struct RClass *)($arg0))
+end
+document rp_class
+  Print the content of a Class/Module.
+end
+
+define rp_imemo
+  set $flags = (enum imemo_type)((((struct RBasic *)($arg0))->flags >> RUBY_FL_USHIFT) & RUBY_IMEMO_MASK)
+  if $flags == imemo_cref
+    printf "(rb_cref_t *) %p\n", (void*)$arg0
+    print *(rb_cref_t *)$arg0
+  else
+  if $flags == imemo_svar
+    printf "(struct vm_svar *) %p\n", (void*)$arg0
+    print *(struct vm_svar *)$arg0
+  else
+  if $flags == imemo_throw_data
+    printf "(struct vm_throw_data *) %p\n", (void*)$arg0
+    print *(struct vm_throw_data *)$arg0
+  else
+  if $flags == imemo_ifunc
+    printf "(struct vm_ifunc *) %p\n", (void*)$arg0
+    print *(struct vm_ifunc *)$arg0
+  else
+  if $flags == imemo_memo
+    printf "(struct MEMO *) %p\n", (void*)$arg0
+    print *(struct MEMO *)$arg0
+  else
+  if $flags == imemo_ment
+    printf "(rb_method_entry_t *) %p\n", (void*)$arg0
+    print *(rb_method_entry_t *)$arg0
+  else
+  if $flags == imemo_iseq
+    printf "(rb_iseq_t *) %p\n", (void*)$arg0
+    print *(rb_iseq_t *)$arg0
+  else
+    printf "(struct RIMemo *) %p\n", (void*)$arg0
+    print *(struct RIMemo *)$arg0
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+end
+document rp_imemo
+  Print the content of a memo
+end
+
 define nd_type
   print (enum node_type)((((NODE*)($arg0))->flags&RUBY_NODE_TYPEMASK)>>RUBY_NODE_TYPESHIFT)
 end
@@ -361,260 +624,237 @@ end
 # Print members of ruby node.
 
 define nd_head
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 define nd_alen
-  printf "u2.argc: "
+  printf "%su2.argc%s: ", $color_highlite, $color_end
   p ($arg0).u2.argc
 end
 
 define nd_next
-  printf "u3.node: "
+  printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
 end
 
 
 define nd_cond
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 define nd_body
-  printf "u2.node: "
+  printf "%su2.node%s: ", $color_highlite, $color_end
   rp ($arg0).u2.node
 end
 
 define nd_else
-  printf "u3.node: "
+  printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
 end
 
 
 define nd_orig
-  printf "u3.value: "
+  printf "%su3.value%s: ", $color_highlite, $color_end
   rp ($arg0).u3.value
 end
 
 
 define nd_resq
-  printf "u2.node: "
+  printf "%su2.node%s: ", $color_highlite, $color_end
   rp ($arg0).u2.node
 end
 
 define nd_ensr
-  printf "u3.node: "
+  printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
 end
 
 
 define nd_1st
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 define nd_2nd
-  printf "u2.node: "
+  printf "%su2.node%s: ", $color_highlite, $color_end
   rp ($arg0).u2.node
 end
 
 
 define nd_stts
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 
 define nd_entry
-  printf "u3.entry: "
+  printf "%su3.entry%s: ", $color_highlite, $color_end
   p ($arg0).u3.entry
 end
 
 define nd_vid
-  printf "u1.id: "
+  printf "%su1.id%s: ", $color_highlite, $color_end
   p ($arg0).u1.id
 end
 
 define nd_cflag
-  printf "u2.id: "
+  printf "%su2.id%s: ", $color_highlite, $color_end
   p ($arg0).u2.id
 end
 
 define nd_cval
-  printf "u3.value: "
+  printf "%su3.value%s: ", $color_highlite, $color_end
   rp ($arg0).u3.value
 end
 
-
-define nd_cnt
-  printf "u3.cnt: "
-  p ($arg0).u3.cnt
-end
-
 define nd_tbl
-  printf "u1.tbl: "
+  printf "%su1.tbl%s: ", $color_highlite, $color_end
   p ($arg0).u1.tbl
 end
 
 
 define nd_var
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 define nd_ibdy
-  printf "u2.node: "
+  printf "%su2.node%s: ", $color_highlite, $color_end
   rp ($arg0).u2.node
 end
 
 define nd_iter
-  printf "u3.node: "
+  printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
 end
 
 
 define nd_value
-  printf "u2.node: "
+  printf "%su2.node%s: ", $color_highlite, $color_end
   rp ($arg0).u2.node
 end
 
 define nd_aid
-  printf "u3.id: "
+  printf "%su3.id%s: ", $color_highlite, $color_end
   p ($arg0).u3.id
 end
 
 
 define nd_lit
-  printf "u1.value: "
+  printf "%su1.value%s: ", $color_highlite, $color_end
   rp ($arg0).u1.value
 end
 
-
-define nd_frml
-  printf "u1.node: "
-  rp ($arg0).u1.node
-end
-
 define nd_rest
-  printf "u2.argc: "
+  printf "%su2.argc%s: ", $color_highlite, $color_end
   p ($arg0).u2.argc
 end
 
 define nd_opt
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 
 define nd_recv
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 define nd_mid
-  printf "u2.id: "
+  printf "%su2.id%s: ", $color_highlite, $color_end
   p ($arg0).u2.id
 end
 
 define nd_args
-  printf "u3.node: "
+  printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
 end
 
-
-define nd_noex
-  printf "u1.id: "
-  p ($arg0).u1.id
-end
-
 define nd_defn
-  printf "u3.node: "
+  printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
 end
 
 
 define nd_old
-  printf "u1.id: "
+  printf "%su1.id%s: ", $color_highlite, $color_end
   p ($arg0).u1.id
 end
 
 define nd_new
-  printf "u2.id: "
+  printf "%su2.id%s: ", $color_highlite, $color_end
   p ($arg0).u2.id
 end
 
 
-define nd_cfnc
-  printf "u1.cfunc: "
-  p ($arg0).u1.cfunc
-end
-
-define nd_argc
-  printf "u2.argc: "
-  p ($arg0).u2.argc
-end
-
-
 define nd_cname
-  printf "u1.id: "
+  printf "%su1.id%s: ", $color_highlite, $color_end
   p ($arg0).u1.id
 end
 
 define nd_super
-  printf "u3.node: "
+  printf "%su3.node%s: ", $color_highlite, $color_end
   rp ($arg0).u3.node
 end
 
 
 define nd_modl
-  printf "u1.id: "
+  printf "%su1.id%s: ", $color_highlite, $color_end
   p ($arg0).u1.id
 end
 
 define nd_clss
-  printf "u1.value: "
+  printf "%su1.value%s: ", $color_highlite, $color_end
   rp ($arg0).u1.value
 end
 
 
 define nd_beg
-  printf "u1.node: "
+  printf "%su1.node%s: ", $color_highlite, $color_end
   rp ($arg0).u1.node
 end
 
 define nd_end
-  printf "u2.node: "
+  printf "%su2.node%s: ", $color_highlite, $color_end
   rp ($arg0).u2.node
 end
 
 define nd_state
-  printf "u3.state: "
+  printf "%su3.state%s: ", $color_highlite, $color_end
   p ($arg0).u3.state
 end
 
 define nd_rval
-  printf "u2.value: "
+  printf "%su2.value%s: ", $color_highlite, $color_end
   rp ($arg0).u2.value
 end
 
 
 define nd_nth
-  printf "u2.argc: "
+  printf "%su2.argc%s: ", $color_highlite, $color_end
   p ($arg0).u2.argc
 end
 
 
 define nd_tag
-  printf "u1.id: "
+  printf "%su1.id%s: ", $color_highlite, $color_end
   p ($arg0).u1.id
 end
 
 define nd_tval
-  printf "u2.value: "
+  printf "%su2.value%s: ", $color_highlite, $color_end
   rp ($arg0).u2.value
 end
 
+define nd_tree
+  set $buf = (struct RString *)rb_str_buf_new(0)
+  call dump_node((VALUE)($buf), rb_str_tmp_new(0), 0, ($arg0))
+  printf "%s\n", $buf->as.heap.ptr
+end
+
 define rb_p
   call rb_p($arg0)
 end
@@ -636,7 +876,7 @@ define rb_numtable_entry
       end
     end
   else
-    set $rb_numtable_p = $rb_numtable_tbl->as.big.bins[$rb_numtable_id % $rb_numtable_tbl->num_bins]
+    set $rb_numtable_p = $rb_numtable_tbl->as.big.bins[st_numhash($rb_numtable_id) % $rb_numtable_tbl->num_bins]
     while $rb_numtable_p
       if $rb_numtable_p->key == $rb_numtable_id
 	set $rb_numtable_key = $rb_numtable_p->key
@@ -650,12 +890,9 @@ define rb_numtable_entry
 end
 
 define rb_id2name
-  rb_numtable_entry global_symbols.id_str (ID)$arg0
-  if $rb_numtable_rec
-    rp $rb_numtable_rec
-  else
-    echo undef\n
-  end
+  ruby_gdb_init
+  printf "%sID%s: ", $color_type, $color_end
+  rp_id $arg0
 end
 document rb_id2name
   Print the name of id
@@ -666,10 +903,10 @@ define rb_method_entry
   set $rb_method_entry_id = (ID)$arg1
   set $rb_method_entry_me = (rb_method_entry_t *)0
   while !$rb_method_entry_me && $rb_method_entry_klass
-    rb_numtable_entry $rb_method_entry_klass->m_tbl $rb_method_entry_id
+    rb_numtable_entry $rb_method_entry_klass->m_tbl_wrapper->tbl $rb_method_entry_id
     set $rb_method_entry_me = (rb_method_entry_t *)$rb_numtable_rec
     if !$rb_method_entry_me
-      set $rb_method_entry_klass = (struct RClass *)$rb_method_entry_klass->ptr->super
+      set $rb_method_entry_klass = (struct RClass *)RCLASS_SUPER($rb_method_entry_klass)
     end
   end
   if $rb_method_entry_me
@@ -684,9 +921,24 @@ document rb_method_entry
 end
 
 define rb_classname
-  call classname($arg0)
-  rb_p $
-  print *(struct RClass*)($arg0)
+  # up to 128bit int
+  set $rb_classname = rb_mod_name($arg0)
+  if $rb_classname != RUBY_Qnil
+    rp $rb_classname
+  else
+    echo anonymous class/module\n
+  end
+end
+
+define rb_ancestors
+  set $rb_ancestors_module = $arg0
+  while $rb_ancestors_module
+    rp_class $rb_ancestors_module
+    set $rb_ancestors_module = RCLASS_SUPER($rb_ancestors_module)
+  end
+end
+document rb_ancestors
+  Print ancestors.
 end
 
 define rb_backtrace
@@ -694,7 +946,7 @@ define rb_backtrace
 end
 
 define iseq
-  if dummy_gdb_enums.special_consts
+  if ruby_dummy_gdb_enums.special_consts
   end
   if ($arg0)->type == ISEQ_ELEMENT_NONE
     echo [none]\n
@@ -719,7 +971,7 @@ define iseq
 end
 
 define rb_ps
-  rb_ps_vm ruby_current_vm
+  rb_ps_vm ruby_current_vm_ptr
 end
 document rb_ps
 Dump all threads and their callstacks
@@ -727,31 +979,372 @@ end
 
 define rb_ps_vm
   print $ps_vm = (rb_vm_t*)$arg0
-  set $ps_threads = (st_table*)$ps_vm->living_threads
-  if $ps_threads->entries_packed
-    set $ps_threads_i = 0
-    while $ps_threads_i < $ps_threads->num_entries
-      set $ps_threads_key = (st_data_t)$ps_threads->bins[$ps_threads_i * 2]
-      set $ps_threads_val = (st_data_t)$ps_threads->bins[$ps_threads_i * 2 + 1]
-      rb_ps_thread $ps_threads_key $ps_threads_val
-      set $ps_threads_i = $ps_threads_i + 1
-    end
-  else
-    set $ps_threads_ptr = (st_table_entry*)$ps_threads->head
-    while $ps_threads_ptr
-      set $ps_threads_key = (st_data_t)$ps_threads_ptr->key
-      set $ps_threads_val = (st_data_t)$ps_threads_ptr->record
-      rb_ps_thread $ps_threads_key $ps_threads_val
-      set $ps_threads_ptr = (st_table_entry*)$ps_threads_ptr->fore
+  set $ps_thread_ln      = $ps_vm->ractor.main_ractor.threads.set.n.next
+  set $ps_thread_ln_last = $ps_vm->ractor.main_ractor.threads.set.n.prev
+  while 1
+    set $ps_thread_th = (rb_thread_t *)$ps_thread_ln
+    set $ps_thread = (VALUE)($ps_thread_th->self)
+    rb_ps_thread $ps_thread
+    if $ps_thread_ln == $ps_thread_ln_last
+      loop_break
     end
+    set $ps_thread_ln = $ps_thread_ln->next
   end
 end
 document rb_ps_vm
 Dump all threads in a (rb_vm_t*) and their callstacks
 end
 
+define print_lineno
+  set $cfp = $arg0
+  set $iseq = $cfp->iseq
+  set $pos = $cfp->pc - $iseq->body->iseq_encoded
+  if $pos != 0
+    set $pos = $pos - 1
+  end
+
+  set $index = 0
+  set $size = $iseq->body->insns_info.size
+  set $table = $iseq->body->insns_info.body
+  set $positions = $iseq->body->insns_info.positions
+  #printf "size: %d\n", $size
+  if $size == 0
+  else
+  if $size == 1
+    printf "%d", $table[0].line_no
+  else
+    if $positions
+      # get_insn_info_linear_search
+      set $index = 1
+      while $index < $size
+        #printf "table[%d]: position: %d, line: %d, pos: %d\n", $i, $positions[$i], $table[$i].line_no, $pos
+        if $positions[$index] > $pos
+          loop_break
+        end
+        set $index = $index + 1
+        if $positions[$index] == $pos
+          loop_break
+        end
+      end
+    else
+      # get_insn_info_succinct_bitvector
+      set $sd = $iseq->body->insns_info.succ_index_table
+      set $immediate_table_size = sizeof($sd->imm_part) / sizeof(uint64_t) * 9
+      if $pos < $immediate_table_size
+        set $i = $pos / 9
+        set $j = $pos % 9
+        set $index = ((int)($sd->imm_part[$i] >> ($j * 7))) & 0x7f
+      else
+        set $block_index = ($pos - $immediate_table_size) / 512
+        set $block = &$sd->succ_part[$block_index]
+        set $block_bit_index = ($pos - $immediate_table_size) % 512
+        set $small_block_index = $block_bit_index / 64
+        set $small_block_popcount = $small_block_index == 0 ? 0 : (((int)($block->small_block_ranks >> (($small_block_index - 1) * 9))) & 0x1ff)
+        set $x = $block->bits[$small_block_index] << (63 - $block_bit_index % 64)
+        set $x = ($x & 0x5555555555555555) + ($x >> 1 & 0x5555555555555555)
+        set $x = ($x & 0x3333333333333333) + ($x >> 2 & 0x3333333333333333)
+        set $x = ($x & 0x0707070707070707) + ($x >> 4 & 0x0707070707070707)
+        set $x = ($x & 0x001f001f001f001f) + ($x >> 8 & 0x001f001f001f001f)
+        set $x = ($x & 0x0000003f0000003f) + ($x >>16 & 0x0000003f0000003f)
+        set $popcnt = ($x & 0x7f) + ($x >>32 & 0x7f)
+        set $index = $block->rank + $small_block_popcount + $popcnt
+      end
+    end
+    printf "%d", $table[$index-1].line_no
+  end
+  end
+end
+
+define check_method_entry
+  set $imemo = (struct RBasic *)$arg0
+  if $imemo != RUBY_Qfalse
+    set $type = ($imemo->flags >> 12) & 0x07
+    if $type == imemo_ment
+      set $me = (rb_callable_method_entry_t *)$imemo
+    else
+    if $type == imemo_svar
+      set $imemo = ((struct vm_svar *)$imemo)->cref_or_me
+      check_method_entry $imemo
+    end
+    end
+  end
+end
+
+define print_id
+  set $id = $arg0
+  # rb_id_to_serial
+  if $id > tLAST_OP_ID
+    set $serial = (rb_id_serial_t)($id >> RUBY_ID_SCOPE_SHIFT)
+  else
+    set $serial = (rb_id_serial_t)$id
+  end
+  if $serial && $serial <= ruby_global_symbols.last_id
+    set $idx = $serial / ID_ENTRY_UNIT
+    set $ids = (struct RArray *)ruby_global_symbols.ids
+    set $flags = $ids->basic.flags
+    if ($flags & RUBY_FL_USER1)
+      set $idsptr = $ids->as.ary
+      set $idslen = (($flags & (RUBY_FL_USER3|RUBY_FL_USER4)) >> (RUBY_FL_USHIFT+3))
+    else
+      set $idsptr = $ids->as.heap.ptr
+      set $idslen = $ids->as.heap.len
+    end
+    if $idx < $idslen
+      set $t = 0
+      set $ary = (struct RArray *)$idsptr[$idx]
+      if $ary != RUBY_Qnil
+        set $flags = $ary->basic.flags
+        if ($flags & RUBY_FL_USER1)
+          set $aryptr = $ary->as.ary
+          set $arylen = (($flags & (RUBY_FL_USER3|RUBY_FL_USER4)) >> (RUBY_FL_USHIFT+3))
+        else
+          set $aryptr = $ary->as.heap.ptr
+          set $arylen = $ary->as.heap.len
+        end
+        set $result = $aryptr[($serial % ID_ENTRY_UNIT) * ID_ENTRY_SIZE + $t]
+        if $result != RUBY_Qnil
+          print_string $result
+        else
+          echo undef
+        end
+      end
+    end
+  end
+end
+
+define print_pathobj
+  set $flags = ((struct RBasic*)($arg0))->flags
+  if ($flags & RUBY_T_MASK) == RUBY_T_STRING
+    print_string $arg0
+  end
+  if ($flags & RUBY_T_MASK) == RUBY_T_ARRAY
+    if $flags & RUBY_FL_USER1
+      set $str = ((struct RArray*)($arg0))->as.ary[0]
+    else
+      set $str = ((struct RArray*)($arg0))->as.heap.ptr[0]
+    end
+    print_string $str
+  end
+end
+
 define rb_ps_thread
   set $ps_thread = (struct RTypedData*)$arg0
-  set $ps_thread_id = $arg1
-  print $ps_thread_th = (rb_thread_t*)$ps_thread->data
+  set $ps_thread_th = (rb_thread_t*)$ps_thread->data
+  printf "* #<Thread:%p rb_thread_t:%p native_thread:%p>\n", \
+    $ps_thread, $ps_thread_th, $ps_thread_th->thread_id
+  set $cfp = $ps_thread_th->ec->cfp
+  set $cfpend = (rb_control_frame_t *)($ps_thread_th->ec->vm_stack + $ps_thread_th->ec->vm_stack_size)-1
+  while $cfp < $cfpend
+    if $cfp->iseq
+      if !((VALUE)$cfp->iseq & RUBY_IMMEDIATE_MASK) && (((imemo_ifunc << RUBY_FL_USHIFT) | RUBY_T_IMEMO)==$cfp->iseq->flags & ((RUBY_IMEMO_MASK << RUBY_FL_USHIFT) | RUBY_T_MASK))
+        printf "%d:ifunc ", $cfpend-$cfp
+        set print symbol-filename on
+        output/a $cfp->iseq.body
+        set print symbol-filename off
+        printf "\n"
+      else
+      if $cfp->pc
+        set $location = $cfp->iseq->body->location
+        printf "%d:", $cfpend-$cfp
+        print_pathobj $location.pathobj
+        printf ":"
+        print_lineno $cfp
+        printf ":in `"
+        print_string $location.label
+        printf "'\n"
+      else
+        printf "%d: ???.rb:???:in `???'\n", $cfpend-$cfp
+      end
+      end
+    else
+      # if VM_FRAME_TYPE($cfp->flag) == VM_FRAME_MAGIC_CFUNC
+      set $ep = $cfp->ep
+      if ($ep[0] & 0xffff0001) == 0x55550001
+        #define VM_ENV_FLAG_LOCAL 0x02
+        #define VM_ENV_PREV_EP(ep)   GC_GUARDED_PTR_REF(ep[VM_ENV_DATA_INDEX_SPECVAL])
+        set $me = 0
+        set $env_specval = $ep[-1]
+        set $env_me_cref = $ep[-2]
+        while ($env_specval & 0x02) != 0
+          check_method_entry $env_me_cref
+          if $me != 0
+            loop_break
+          end
+          set $ep = $ep[0]
+          set $env_specval = $ep[-1]
+          set $env_me_cref = $ep[-2]
+        end
+        if $me == 0
+          check_method_entry $env_me_cref
+        end
+        printf "%d:", $cfpend-$cfp
+        set print symbol-filename on
+        output/a $me->def->body.cfunc.func
+        set print symbol-filename off
+        set $mid = $me->def->original_id
+        printf ":in `"
+        print_id $mid
+        printf "'\n"
+      else
+        printf "%d:unknown_frame:???:in `???'\n", $cfpend-$cfp
+      end
+    end
+    set $cfp = $cfp + 1
+  end
+end
+
+define rb_count_objects
+  set $objspace = ruby_current_vm_ptr->objspace
+  set $counts_00 = 0
+  set $counts_01 = 0
+  set $counts_02 = 0
+  set $counts_03 = 0
+  set $counts_04 = 0
+  set $counts_05 = 0
+  set $counts_06 = 0
+  set $counts_07 = 0
+  set $counts_08 = 0
+  set $counts_09 = 0
+  set $counts_0a = 0
+  set $counts_0b = 0
+  set $counts_0c = 0
+  set $counts_0d = 0
+  set $counts_0e = 0
+  set $counts_0f = 0
+  set $counts_10 = 0
+  set $counts_11 = 0
+  set $counts_12 = 0
+  set $counts_13 = 0
+  set $counts_14 = 0
+  set $counts_15 = 0
+  set $counts_16 = 0
+  set $counts_17 = 0
+  set $counts_18 = 0
+  set $counts_19 = 0
+  set $counts_1a = 0
+  set $counts_1b = 0
+  set $counts_1c = 0
+  set $counts_1d = 0
+  set $counts_1e = 0
+  set $counts_1f = 0
+  set $total = 0
+  set $i = 0
+  while $i < $objspace->heap_pages.allocated_pages
+    printf "\rcounting... %d/%d", $i, $objspace->heap_pages.allocated_pages
+    set $page = $objspace->heap_pages.sorted[$i]
+    set $p = $page->start
+    set $pend = $p + $page->total_slots
+    while $p < $pend
+      set $flags = $p->as.basic.flags & 0x1f
+      eval "set $counts_%02x = $counts_%02x + 1", $flags, $flags
+      set $p = $p + 1
+    end
+    set $total = $total + $page->total_slots
+    set $i = $i + 1
+  end
+  printf "\rTOTAL: %d, FREE: %d\n", $total, $counts_00
+  printf "T_OBJECT: %d\n", $counts_01
+  printf "T_CLASS: %d\n", $counts_02
+  printf "T_MODULE: %d\n", $counts_03
+  printf "T_FLOAT: %d\n", $counts_04
+  printf "T_STRING: %d\n", $counts_05
+  printf "T_REGEXP: %d\n", $counts_06
+  printf "T_ARRAY: %d\n", $counts_07
+  printf "T_HASH: %d\n", $counts_08
+  printf "T_STRUCT: %d\n", $counts_09
+  printf "T_BIGNUM: %d\n", $counts_0a
+  printf "T_FILE: %d\n", $counts_0b
+  printf "T_DATA: %d\n", $counts_0c
+  printf "T_MATCH: %d\n", $counts_0d
+  printf "T_COMPLEX: %d\n", $counts_0e
+  printf "T_RATIONAL: %d\n", $counts_0f
+  #printf "UNKNOWN_10: %d\n", $counts_10
+  printf "T_NIL: %d\n", $counts_11
+  printf "T_TRUE: %d\n", $counts_12
+  printf "T_FALSE: %d\n", $counts_13
+  printf "T_SYMBOL: %d\n", $counts_14
+  printf "T_FIXNUM: %d\n", $counts_15
+  printf "T_UNDEF: %d\n", $counts_16
+  #printf "UNKNOWN_17: %d\n", $counts_17
+  #printf "UNKNOWN_18: %d\n", $counts_18
+  #printf "UNKNOWN_19: %d\n", $counts_19
+  printf "T_IMEMO: %d\n", $counts_1a
+  printf "T_NODE: %d\n", $counts_1b
+  printf "T_ICLASS: %d\n", $counts_1c
+  printf "T_ZOMBIE: %d\n", $counts_1d
+  #printf "UNKNOWN_1E: %d\n", $counts_1e
+  printf "T_MASK: %d\n", $counts_1f
+end
+document rb_count_objects
+  Counts all objects grouped by type.
+end
+
+# Details: https://bugs.ruby-lang.org/projects/ruby-master/wiki/MachineInstructionsTraceWithGDB
+define trace_machine_instructions
+  set logging on
+  set height 0
+  set width 0
+  display/i $pc
+  while !$exit_code
+    info line *$pc
+    si
+  end
+end
+
+define SDR
+  call rb_vmdebug_stack_dump_raw_current()
+end
+
+define rbi
+  if ((LINK_ELEMENT*)$arg0)->type == ISEQ_ELEMENT_LABEL
+    p *(LABEL*)$arg0
+  else
+  if ((LINK_ELEMENT*)$arg0)->type == ISEQ_ELEMENT_INSN
+    p *(INSN*)$arg0
+  else
+  if ((LINK_ELEMENT*)$arg0)->type == ISEQ_ELEMENT_ADJUST
+    p *(ADJUST*)$arg0
+  else
+    print *$arg0
+  end
+  end
+  end
+end
+
+define dump_node
+  set $str = rb_parser_dump_tree($arg0, 0)
+  set $flags = ((struct RBasic*)($str))->flags
+  printf "%s", (char *)(($flags & RUBY_FL_USER1) ? \
+                        ((struct RString*)$str)->as.heap.ptr : \
+                        ((struct RString*)$str)->as.ary)
+end
+
+define print_flags
+  printf "RUBY_FL_WB_PROTECTED: %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_WB_PROTECTED ? "1" : "0"
+  printf "RUBY_FL_PROMOTED0   : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_PROMOTED0 ? "1" : "0"
+  printf "RUBY_FL_PROMOTED1   : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_PROMOTED1 ? "1" : "0"
+  printf "RUBY_FL_FINALIZE    : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_FINALIZE ? "1" : "0"
+  printf "RUBY_FL_SHAREABLE   : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_SHAREABLE ? "1" : "0"
+  printf "RUBY_FL_EXIVAR      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_EXIVAR ? "1" : "0"
+  printf "RUBY_FL_FREEZE      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_FREEZE ? "1" : "0"
+
+  printf "RUBY_FL_USER0       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER0 ? "1" : "0"
+  printf "RUBY_FL_USER1       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER1 ? "1" : "0"
+  printf "RUBY_FL_USER2       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER2 ? "1" : "0"
+  printf "RUBY_FL_USER3       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER3 ? "1" : "0"
+  printf "RUBY_FL_USER4       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER4 ? "1" : "0"
+  printf "RUBY_FL_USER5       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER5 ? "1" : "0"
+  printf "RUBY_FL_USER6       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER6 ? "1" : "0"
+  printf "RUBY_FL_USER7       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER7 ? "1" : "0"
+  printf "RUBY_FL_USER8       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER8 ? "1" : "0"
+  printf "RUBY_FL_USER9       : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER9 ? "1" : "0"
+  printf "RUBY_FL_USER10      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER10 ? "1" : "0"
+  printf "RUBY_FL_USER11      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER11 ? "1" : "0"
+  printf "RUBY_FL_USER12      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER12 ? "1" : "0"
+  printf "RUBY_FL_USER13      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER13 ? "1" : "0"
+  printf "RUBY_FL_USER14      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER14 ? "1" : "0"
+  printf "RUBY_FL_USER15      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER15 ? "1" : "0"
+  printf "RUBY_FL_USER16      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER16 ? "1" : "0"
+  printf "RUBY_FL_USER17      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER17 ? "1" : "0"
+  printf "RUBY_FL_USER18      : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_USER18 ? "1" : "0"
 end
diff --git a/.git-blame-ignore-revs b/.git-blame-ignore-revs
new file mode 100644
index 0000000000..6c5eac5a0f
--- /dev/null
+++ b/.git-blame-ignore-revs
@@ -0,0 +1,23 @@
+# This is a file used by GitHub to ignore the following commits on `git blame`.
+#
+# You can also do the same thing in your local repository with:
+# $ git config --local blame.ignoreRevsFile .git-blame-ignore-revs
+
+# Expand tabs
+5b21e94bebed90180d8ff63dad03b8b948361089
+
+# Enable Style/StringLiterals cop for RubyGems/Bundler
+d7ffd3fea402239b16833cc434404a7af82d44f3
+
+# [ruby/digest] Revert tab-expansion in external files
+48b09aae7ec5632209229dcc294dd0d75a93a17f
+8a65cf3b61c60e4cb886f59a73ff6db44364bfa9
+39dc9f9093901d40d2998653948d5da38b18ee2c
+
+# [ruby/io-nonblock] Revert tab expansion
+f28287d34c03f472ffe90ea262bdde9affd4b965
+0d842fecb4f75ab3b1d4097ebdb8e88f51558041
+4ba2c66761d6a293abdfba409241d31063cefd62
+
+# Make benchmark indentation consistent
+fc4acf8cae82e5196186d3278d831f2438479d91
diff --git a/.gitattributes b/.gitattributes
new file mode 100644
index 0000000000..d0c2d266b4
--- /dev/null
+++ b/.gitattributes
@@ -0,0 +1,8 @@
+*.gemspec diff=ruby
+*.rb diff=ruby
+bin svn-properties=svn:ignore=ruby
+bin/* diff=ruby
+tool/update-deps diff=ruby
+tool/make-snapshot diff=ruby
+tool/format-release diff=ruby
+tool/leaked-globals diff=ruby
diff --git a/.github/SECURITY.md b/.github/SECURITY.md
new file mode 100644
index 0000000000..56baa29942
--- /dev/null
+++ b/.github/SECURITY.md
@@ -0,0 +1,9 @@
+# Security Policy
+
+## Supported Versions
+
+See <https://www.ruby-lang.org/en/downloads/branches/>.
+
+## Reporting a Vulnerability
+
+See <https://www.ruby-lang.org/en/security/>.
diff --git a/.github/codeql/codeql-config.yml b/.github/codeql/codeql-config.yml
new file mode 100644
index 0000000000..91f82b842b
--- /dev/null
+++ b/.github/codeql/codeql-config.yml
@@ -0,0 +1,3 @@
+name: "CodeQL config for the Ruby language"
+
+languages: cpp
diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000000..bc63aca35b
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,6 @@
+version: 2
+updates:
+  - package-ecosystem: 'github-actions'
+    directory: '/'
+    schedule:
+      interval: 'monthly'
diff --git a/.github/workflows/baseruby.yml b/.github/workflows/baseruby.yml
new file mode 100644
index 0000000000..ebaafe3bf0
--- /dev/null
+++ b/.github/workflows/baseruby.yml
@@ -0,0 +1,80 @@
+name: BASERUBY Check
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  baseruby:
+    name: BASERUBY
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    strategy:
+      matrix:
+        ruby:
+          - ruby-2.2
+#         - ruby-2.3
+#         - ruby-2.4
+#         - ruby-2.5
+#         - ruby-2.6
+#         - ruby-2.7
+          - ruby-3.0
+          - ruby-3.1
+
+    steps:
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: .downloaded-cache
+          key: downloaded-cache
+      - uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler: none
+      - run: echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - run: sudo apt-get install build-essential autoconf bison libyaml-dev
+      - run: ./autogen.sh
+      - run: ./configure --disable-install-doc
+      - run: make common-srcs
+      - run: make incs
+      - run: make all
+      - run: make test
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / BASERUBY @ ${{ matrix.ruby }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
diff --git a/.github/workflows/bundled_gems.yml b/.github/workflows/bundled_gems.yml
new file mode 100644
index 0000000000..070c0fa1dd
--- /dev/null
+++ b/.github/workflows/bundled_gems.yml
@@ -0,0 +1,166 @@
+name: bundled_gems
+
+on:
+  push:
+    branches: [ "master" ]
+    paths:
+      - '.github/workflows/bundled_gems.yml'
+      - 'gems/bundled_gems'
+  pull_request:
+    branches: [ "master" ]
+    paths:
+      - '.github/workflows/bundled_gems.yml'
+      - 'gems/bundled_gems'
+  merge_group:
+    branches: [ "master" ]
+    paths:
+      - '.github/workflows/bundled_gems.yml'
+      - 'gems/bundled_gems'
+  schedule:
+    - cron: '45 6 * * *'
+  workflow_dispatch:
+
+permissions:  # added using https://github.com/step-security/secure-workflows
+  contents: read
+
+jobs:
+  update:
+    permissions:
+      contents: write  # for Git to git push
+    if: ${{ github.event_name != 'schedule' || github.repository == 'ruby/ruby' }}
+    name: update ${{ github.workflow }}
+    runs-on: ubuntu-latest
+    steps:
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+          echo "TODAY=$(date +%F)" >> $GITHUB_ENV
+
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: .downloaded-cache
+          key: downloaded-cache-${{ github.sha }}
+          restore-keys: |
+            downloaded-cache
+
+      - name: Download previous gems list
+        run: |
+          data=bundled_gems.json
+          mkdir -p .downloaded-cache
+          ln -s .downloaded-cache/$data .
+          curl -O -R -z ./$data https://stdgems.org/$data
+
+      - name: Update bundled gems list
+        run: |
+          ruby -i~ tool/update-bundled_gems.rb gems/bundled_gems
+
+      - name: Maintain updated gems list in NEWS
+        run: |
+          #!ruby
+          require 'json'
+          news = File.read("NEWS.md")
+          prev = news[/since the \*+(\d+\.\d+\.\d+)\*+/, 1]
+          prevs = [prev, prev.sub(/\.\d+\z/, '')]
+          %W[bundled].each do |type|
+            last = JSON.parse(File.read("#{type}_gems.json"))['gems'].filter_map do |g|
+              v = g['versions'].values_at(*prevs).compact.first
+              g = g['gem']
+              g = 'RubyGems' if g == 'rubygems'
+              [g, v] if v
+            end.to_h
+            changed = File.foreach("gems/#{type}_gems").filter_map do |l|
+              next if l.start_with?("#")
+              g, v = l.split(" ", 3)
+              [g, v] unless last[g] == v
+            end
+            changed, added = changed.partition {|g, _| last[g]}
+            news.sub!(/^\*( +)The following #{type} gems? are updated\.\n+\K(?: \1\*( +).*\n)*/) do
+              mark = "#{$1} *#{$2}"
+              changed.map {|g, v|"#{mark}#{g} #{v}\n"}.join("")
+            end or next
+            news.sub!(/^\*( +)The following default gems are now bundled gems\.\n+\K(?: \1\*( +).*\n)*/) do
+              mark = "#{$1} *#{$2}"
+              added.map {|g, v|"#{mark}#{g} #{v}\n"}.join("")
+            end or next unless added.empty?
+            File.write("NEWS.md", news)
+          end
+        shell: ruby {0}
+
+      - name: Check diffs
+        id: diff
+        run: |
+          git add -- NEWS.md
+          git diff --no-ext-diff --ignore-submodules --quiet -- gems/bundled_gems
+        continue-on-error: true
+
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Build
+        run: |
+          ./autogen.sh
+          ./configure -C --disable-install-doc
+          make
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Prepare bundled gems
+        run: |
+          make -s prepare-gems
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Test bundled gems
+        run: |
+          make -s test-bundled-gems
+          git add -- gems/bundled_gems
+        timeout-minutes: 30
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+        if: ${{ steps.diff.outcome == 'failure' }}
+
+      - name: Show diffs
+        id: show
+        run: |
+          git diff --cached --color --no-ext-diff --ignore-submodules --exit-code --
+        continue-on-error: true
+
+      - name: Commit
+        run: |
+          git pull --ff-only origin ${GITHUB_REF#refs/heads/}
+          message="Update bundled gems list at "
+          if [ ${{ steps.diff.outcome }} = success ]; then
+            git commit --message="${message}${GITHUB_SHA:0:30} [ci skip]"
+          else
+            git commit --message="${message}${TODAY}"
+          fi
+          git push origin ${GITHUB_REF#refs/heads/}
+        env:
+          EMAIL: svn-admin@ruby-lang.org
+          GIT_AUTHOR_NAME: git
+          GIT_COMMITTER_NAME: git
+        if: ${{ github.repository == 'ruby/ruby' && !startsWith(github.event_name, 'pull') && steps.show.outcome == 'failure' }}
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / update",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
diff --git a/.github/workflows/check_dependencies.yml b/.github/workflows/check_dependencies.yml
new file mode 100644
index 0000000000..79b2916feb
--- /dev/null
+++ b/.github/workflows/check_dependencies.yml
@@ -0,0 +1,78 @@
+name: Check Dependencies
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  update-deps:
+    strategy:
+      matrix:
+        os: [ubuntu-22.04]
+      fail-fast: true
+    runs-on: ${{ matrix.os }}
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+        if: ${{ contains(matrix.os, 'ubuntu') }}
+      - name: Install libraries
+        run: |
+          brew install gmp libffi openssl@1.1 zlib autoconf automake libtool readline
+        if: ${{ contains(matrix.os, 'macos') }}
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: .downloaded-cache
+          key: downloaded-cache
+      - run: ./autogen.sh
+      - name: Run configure
+        run: ./configure -C --disable-install-doc --disable-rubygems --with-gcc 'optflags=-O0' 'debugflags=-save-temps=obj -g'
+      - run: make all golf
+      - run: ruby tool/update-deps --fix
+      - run: git diff --no-ext-diff --ignore-submodules --exit-code
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ matrix.os }} / Dependencies need to update",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
diff --git a/.github/workflows/codeql-analysis.yml b/.github/workflows/codeql-analysis.yml
new file mode 100644
index 0000000000..8dba76fbe2
--- /dev/null
+++ b/.github/workflows/codeql-analysis.yml
@@ -0,0 +1,75 @@
+name: "Code scanning - action"
+
+on:
+  # push:
+  #   paths-ignore:
+  #     - 'doc/**'
+  #     - '**/man'
+  #     - '**.md'
+  #     - '**.rdoc'
+  #     - '**/.document'
+  # pull_request:
+  #   paths-ignore:
+  #     - 'doc/**'
+  #     - '**/man'
+  #     - '**.md'
+  #     - '**.rdoc'
+  #     - '**/.document'
+  schedule:
+    - cron: '0 12 * * *'
+  workflow_dispatch:
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:  # added using https://github.com/step-security/secure-workflows
+  contents: read
+
+jobs:
+  CodeQL-Build:
+
+    # CodeQL runs on ubuntu-latest and windows-latest
+    permissions:
+      actions: read  # for github/codeql-action/init to get workflow details
+      contents: read  # for actions/checkout to fetch code
+      security-events: write  # for github/codeql-action/autobuild to send a status report
+    runs-on: ubuntu-latest
+    # CodeQL fails to run pull requests from dependabot due to missing write access to upload results.
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') && github.event.head_commit.pusher.name != 'dependabot[bot]' }}
+
+    env:
+      enable_install_doc: no
+
+    steps:
+    - name: Install libraries
+      run: |
+        set -x
+        sudo apt-get update -q || :
+        sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+
+    - name: Checkout repository
+      uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+
+    - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+      with:
+        path: .downloaded-cache
+        key: downloaded-cache
+
+    - name: Remove an obsolete rubygems vendored file
+      run: sudo rm /usr/lib/ruby/vendor_ruby/rubygems/defaults/operating_system.rb
+
+    - name: Initialize CodeQL
+      uses: github/codeql-action/init@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.37
+      with:
+        config-file: ./.github/codeql/codeql-config.yml
+        trap-caching: false
+
+    - name: Set ENV
+      run: echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+
+    - name: Autobuild
+      uses: github/codeql-action/autobuild@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.37
+
+    - name: Perform CodeQL Analysis
+      uses: github/codeql-action/analyze@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.37
diff --git a/.github/workflows/compilers.yml b/.github/workflows/compilers.yml
new file mode 100644
index 0000000000..caf12cc0f4
--- /dev/null
+++ b/.github/workflows/compilers.yml
@@ -0,0 +1,281 @@
+name: Compilations
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+# GitHub actions does not support YAML anchors.  This creative use of
+# environment variables (plus the "echo $GITHUB_ENV" hack) is to reroute that
+# restriction.
+env:
+  default_cc: clang-15
+  append_cc: ''
+
+  # -O1 is faster than -O3 in our tests... Majority of time are consumed trying
+  # to optimize binaries.  Also GitHub Actions run on relatively modern CPUs
+  # compared to, say, GCC 4 or Clang 3.  We don't specify `-march=native`
+  # because compilers tend not understand what the CPU is.
+  optflags: '-O1'
+
+  # -g0 disables backtraces when SEGV.  Do not set that.
+  debugflags: '-ggdb3'
+
+  default_configure: >-
+    --enable-debug-env
+    --disable-install-doc
+    --with-ext=-test-/cxxanyargs,+
+  append_configure: >-
+    --without-valgrind
+    --without-jemalloc
+    --without-gmp
+
+  UPDATE_UNICODE: >-
+    UNICODE_FILES=.
+    UNICODE_PROPERTY_FILES=.
+    UNICODE_AUXILIARY_FILES=.
+    UNICODE_EMOJI_FILES=.
+  CONFIGURE_TTY: never
+  GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+  RUBY_DEBUG: ci rgengc
+  RUBY_TESTOPTS: >-
+    -q
+    --color=always
+    --tty=no
+
+permissions:
+  contents: read
+
+jobs:
+  compile:
+    strategy:
+      fail-fast: false
+      matrix:
+        env:
+          - {}
+        entry:
+          - { name: gcc-12,    env: { default_cc: gcc-12 } }
+          - { name: gcc-11,    env: { default_cc: gcc-11 } }
+          - { name: gcc-10,    env: { default_cc: gcc-10 } }
+          - { name: gcc-9,     env: { default_cc: gcc-9 } }
+          - { name: gcc-8,     env: { default_cc: gcc-8 } }
+          - { name: gcc-7,     env: { default_cc: gcc-7 } }
+          - name: 'gcc-13 LTO'
+            container: gcc-13
+            env:
+              default_cc: 'gcc-13 -flto=auto -ffat-lto-objects -Werror=lto-type-mismatch'
+              optflags: '-O2'
+            shared: disable
+            # check: true
+          - { name: clang-16,  env: { default_cc: clang-16 } }
+          - { name: clang-15,  env: { default_cc: clang-15 } }
+          - { name: clang-14,  env: { default_cc: clang-14 } }
+          - { name: clang-13,  env: { default_cc: clang-13 } }
+          - { name: clang-12,  env: { default_cc: clang-12 } }
+          - { name: clang-11,  env: { default_cc: clang-11 } }
+          - { name: clang-10,  env: { default_cc: clang-10 } }
+          # llvm-objcopy<=9 doesn't have --wildcard. It compiles, but leaves Rust symbols in libyjit.o.
+          - { name: clang-9,   env: { default_cc: clang-9,   append_configure: '--disable-yjit' } }
+          - { name: clang-8,   env: { default_cc: clang-8,   append_configure: '--disable-yjit' } }
+          - { name: clang-7,   env: { default_cc: clang-7,   append_configure: '--disable-yjit' } }
+          - { name: clang-6.0, env: { default_cc: clang-6.0, append_configure: '--disable-yjit' } }
+          - name: 'clang-16 LTO'
+            container: clang-16
+            env:
+              default_cc: 'clang-16 -flto=auto'
+              optflags: '-O2'
+            shared: disable
+            # check: true
+
+#         - { name: aarch64-linux-gnu,     crosshost: aarch64-linux-gnu, container: crossbuild-essential-arm64 }
+#         - { name: arm-linux-gnueabi,     crosshost: arm-linux-gnueabi }
+#         - { name: arm-linux-gnueabihf,   crosshost: arm-linux-gnueabihf }
+#         - { name: i686-w64-mingw32,      crosshost: i686-w64-mingw32 }
+#         - { name: powerpc-linux-gnu,     crosshost: powerpc-linux-gnu }
+#         - { name: powerpc64le-linux-gnu, crosshost: powerpc64le-linux-gnu, container: crossbuild-essential-ppc64el }
+#         - { name: s390x-linux-gnu,       crosshost: s390x-linux-gnu, container: crossbuild-essential-s390x }
+#         - { name: x86_64-w64-mingw32,    crosshost: x86_64-w64-mingw32, container: mingw-w64 }
+
+          # -Wno-strict-prototypes is necessary with current clang-15 since
+          # older autoconf generate functions without prototype and -pedantic
+          # now implies strict-prototypes. Disabling the error but leaving the
+          # warning generates a lot of noise from use of ANYARGS in
+          # rb_define_method() and friends.
+          # See: https://github.com/llvm/llvm-project/commit/11da1b53d8cd3507959022cd790d5a7ad4573d94
+          - { name: c99,   env: { append_cc: '-std=c99   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+#         - { name: c11,   env: { append_cc: '-std=c11   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+#         - { name: c17,   env: { append_cc: '-std=c17   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+          - { name: c2x,   env: { append_cc: '-std=c2x   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' } }
+          - { name: c++98, env: { CXXFLAGS: '-std=c++98 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+#         - { name: c++11, env: { CXXFLAGS: '-std=c++11 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+#         - { name: c++14, env: { CXXFLAGS: '-std=c++14 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+#         - { name: c++17, env: { CXXFLAGS: '-std=c++17 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+          - { name: c++2a, env: { CXXFLAGS: '-std=c++2a -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' } }
+
+          - { name: '-O0', env: { optflags: '-O0 -march=x86-64 -mtune=generic' } }
+#         - { name: '-O3', env: { optflags: '-O3 -march=x86-64 -mtune=generic' }, check: true }
+
+          - { name: gmp,                  env: { append_configure: '--with-gmp' } }
+          - { name: jemalloc,             env: { append_configure: '--with-jemalloc' } }
+          - { name: valgrind,             env: { append_configure: '--with-valgrind' } }
+          - { name: 'coroutine=ucontext', env: { append_configure: '--with-coroutine=ucontext' } }
+          - { name: 'coroutine=pthread',  env: { append_configure: '--with-coroutine=pthread' } }
+          - { name: disable-jit-support,  env: { append_configure: '--disable-jit-support' } }
+          - { name: disable-dln,          env: { append_configure: '--disable-dln' } }
+          - { name: enable-mkmf-verbose,  env: { append_configure: '--enable-mkmf-verbose' } }
+          - { name: disable-rubygems,     env: { append_configure: '--disable-rubygems' } }
+          - { name: RUBY_DEVEL,           env: { append_configure: '--enable-devel' } }
+
+          - { name: OPT_THREADED_CODE=1,            env: { cppflags: '-DOPT_THREADED_CODE=1' } }
+          - { name: OPT_THREADED_CODE=2,            env: { cppflags: '-DOPT_THREADED_CODE=2' } }
+          - { name: OPT_THREADED_CODE=3,            env: { cppflags: '-DOPT_THREADED_CODE=3' } }
+
+          - { name: NDEBUG,                         env: { cppflags: '-DNDEBUG' } }
+          - { name: RUBY_DEBUG,                     env: { cppflags: '-DRUBY_DEBUG' } }
+#         - { name: ARRAY_DEBUG,                    env: { cppflags: '-DARRAY_DEBUG' } }
+#         - { name: BIGNUM_DEBUG,                   env: { cppflags: '-DBIGNUM_DEBUG' } }
+#         - { name: CCAN_LIST_DEBUG,                env: { cppflags: '-DCCAN_LIST_DEBUG' } }
+#         - { name: CPDEBUG=-1,                     env: { cppflags: '-DCPDEBUG=-1' } }
+#         - { name: ENC_DEBUG,                      env: { cppflags: '-DENC_DEBUG' } }
+#         - { name: GC_DEBUG,                       env: { cppflags: '-DGC_DEBUG' } }
+#         - { name: HASH_DEBUG,                     env: { cppflags: '-DHASH_DEBUG' } }
+#         - { name: ID_TABLE_DEBUG,                 env: { cppflags: '-DID_TABLE_DEBUG' } }
+#         - { name: RGENGC_DEBUG=-1,                env: { cppflags: '-DRGENGC_DEBUG=-1' } }
+#         - { name: SYMBOL_DEBUG,                   env: { cppflags: '-DSYMBOL_DEBUG' } }
+
+#         - { name: RGENGC_CHECK_MODE,              env: { cppflags: '-DRGENGC_CHECK_MODE' } }
+#         - { name: TRANSIENT_HEAP_CHECK_MODE,      env: { cppflags: '-DTRANSIENT_HEAP_CHECK_MODE' } }
+#         - { name: VM_CHECK_MODE,                  env: { cppflags: '-DVM_CHECK_MODE' } }
+
+          - { name: USE_EMBED_CI=0,                 env: { cppflags: '-DUSE_EMBED_CI=0' } }
+          - name: USE_FLONUM=0,
+            env:
+              cppflags: '-DUSE_FLONUM=0'
+              # yjit requires FLONUM for the pointer tagging scheme
+              append_configure: '--disable-yjit'
+#         - { name: USE_GC_MALLOC_OBJ_INFO_DETAILS, env: { cppflags: '-DUSE_GC_MALLOC_OBJ_INFO_DETAILS' } }
+          - { name: USE_LAZY_LOAD,                  env: { cppflags: '-DUSE_LAZY_LOAD' } }
+#         - { name: USE_RINCGC=0,                   env: { cppflags: '-DUSE_RINCGC=0' } }
+#         - { name: USE_SYMBOL_GC=0,                env: { cppflags: '-DUSE_SYMBOL_GC=0' } }
+#         - { name: USE_THREAD_CACHE=0,             env: { cppflags: '-DUSE_THREAD_CACHE=0' } }
+#         - { name: USE_TRANSIENT_HEAP=0,           env: { cppflags: '-DUSE_TRANSIENT_HEAP=0' } }
+#         - { name: USE_RUBY_DEBUG_LOG=1,           env: { cppflags: '-DUSE_RUBY_DEBUG_LOG=1' } }
+          - { name: USE_RVARGC=0,                   env: { cppflags: '-DUSE_RVARGC=0' } }
+#         - { name: USE_RVARGC=1,                   env: { cppflags: '-DUSE_RVARGC=1' } }
+#         - { name: USE_DEBUG_COUNTER,              env: { cppflags: '-DUSE_DEBUG_COUNTER=1', RUBY_DEBUG_COUNTER_DISABLE: '1' } }
+
+          - { name: DEBUG_FIND_TIME_NUMGUESS,       env: { cppflags: '-DDEBUG_FIND_TIME_NUMGUESS' } }
+          - { name: DEBUG_INTEGER_PACK,             env: { cppflags: '-DDEBUG_INTEGER_PACK' } }
+#         - { name: ENABLE_PATH_CHECK,              env: { cppflags: '-DENABLE_PATH_CHECK' } }
+
+          - { name: GC_DEBUG_STRESS_TO_CLASS,       env: { cppflags: '-DGC_DEBUG_STRESS_TO_CLASS' } }
+#         - { name: GC_ENABLE_LAZY_SWEEP=0,         env: { cppflags: '-DGC_ENABLE_LAZY_SWEEP=0' } }
+#         - { name: GC_PROFILE_DETAIL_MEMOTY,       env: { cppflags: '-DGC_PROFILE_DETAIL_MEMOTY' } }
+#         - { name: GC_PROFILE_MORE_DETAIL,         env: { cppflags: '-DGC_PROFILE_MORE_DETAIL' } }
+
+#         - { name: CALC_EXACT_MALLOC_SIZE,         env: { cppflags: '-DCALC_EXACT_MALLOC_SIZE' } }
+#         - { name: MALLOC_ALLOCATED_SIZE_CHECK,    env: { cppflags: '-DMALLOC_ALLOCATED_SIZE_CHECK' } }
+
+#         - { name: IBF_ISEQ_ENABLE_LOCAL_BUFFER,   env: { cppflags: '-DIBF_ISEQ_ENABLE_LOCAL_BUFFER' } }
+
+#         - { name: RGENGC_ESTIMATE_OLDMALLOC,      env: { cppflags: '-DRGENGC_ESTIMATE_OLDMALLOC' } }
+#         - { name: RGENGC_FORCE_MAJOR_GC,          env: { cppflags: '-DRGENGC_FORCE_MAJOR_GC' } }
+#         - { name: RGENGC_OBJ_INFO,                env: { cppflags: '-DRGENGC_OBJ_INFO' } }
+#         - { name: RGENGC_OLD_NEWOBJ_CHECK,        env: { cppflags: '-DRGENGC_OLD_NEWOBJ_CHECK' } }
+#         - { name: RGENGC_PROFILE,                 env: { cppflags: '-DRGENGC_PROFILE' } }
+
+#         - { name: VM_DEBUG_BP_CHECK,              env: { cppflags: '-DVM_DEBUG_BP_CHECK' } }
+#         - { name: VM_DEBUG_VERIFY_METHOD_CACHE,   env: { cppflags: '-DVM_DEBUG_VERIFY_METHOD_CACHE' } }
+
+          - { name: MJIT_FORCE_ENABLE,              env: { cppflags: '-DMJIT_FORCE_ENABLE' } }
+          - { name: YJIT_FORCE_ENABLE,              env: { cppflags: '-DYJIT_FORCE_ENABLE' } }
+
+    name: ${{ matrix.entry.name }}
+    runs-on: ubuntu-latest
+    container:
+      image: ghcr.io/ruby/ruby-ci-image:${{ matrix.entry.container || matrix.entry.env.default_cc || 'clang-15' }}
+      options: --user root
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    env: ${{ matrix.entry.env || matrix.env }}
+    steps:
+      - run: id
+        working-directory:
+      - run: mkdir build
+        working-directory:
+      - name: setenv
+        run: |
+          echo "GNUMAKEFLAGS=-sj$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: >
+          ../src/configure -C ${default_configure} ${append_configure}
+          --${{
+            matrix.entry.crosshost && 'host' || 'with-gcc'
+          }}=${{
+            matrix.entry.crosshost || '"${default_cc}${append_cc:+ $append_cc}"'
+          }}
+          --${{ matrix.entry.shared || 'enable' }}-shared
+      - run: make extract-extlibs
+      - run: make incs
+      - run: make showflags
+      - run: make
+      - run: make leaked-globals
+      - run: make test
+      - run: make install
+        if: ${{ matrix.entry.check }}
+      - run: make test-tool
+        if: ${{ matrix.entry.check }}
+      - run: make test-all TESTS='-- ruby -ext-'
+        if: ${{ matrix.entry.check }}
+      - run: make test-spec
+        env:
+          CHECK_LEAKS: true
+        if: ${{ matrix.entry.check }}
+      - run: make test-annocheck
+        if: ${{ matrix.entry.check && endsWith(matrix.entry.name, 'annocheck') }}
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.entry.name }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/macos.yml b/.github/workflows/macos.yml
new file mode 100644
index 0000000000..d8dc58b119
--- /dev/null
+++ b/.github/workflows/macos.yml
@@ -0,0 +1,113 @@
+name: macOS
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        test_task: ["check"] # "test-bundler-parallel", "test-bundled-gems"
+        os:
+          - macos-13
+          - macos-14
+          - macos-15
+      fail-fast: false
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+    runs-on: ${{ matrix.os }}
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Install libraries
+        run: |
+          brew install gmp libffi openssl@1.1 zlib autoconf automake libtool readline bison
+        working-directory: src
+      - name: Set ENV
+        run: |
+          echo "MAKEFLAGS=-j$((1 + $(sysctl -n hw.activecpu)))" >> $GITHUB_ENV
+          echo "PATH="/usr/local/opt/bison/bin:/opt/homebrew/opt/bison/bin:$PATH"" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --with-openssl-dir=$(brew --prefix openssl@1.1) --with-readline-dir=$(brew --prefix readline)
+      - run: make incs
+      - run: make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+      - run: make
+      - run: make leaked-globals
+        if: ${{ matrix.test_task == 'check' }}
+      - name: make ${{ matrix.test_task }}
+        run: |
+          make -s ${{ matrix.test_task }} ${TESTS:+TESTS=`echo "$TESTS" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|'`}
+        timeout-minutes: 40
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TESTS: ${{ matrix.test_task == 'check' && matrix.skipped_tests || '' }}
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+          PRECHECK_BUNDLED_GEMS: "no"
+      - name: make skipped tests
+        run: |
+          make -s test-all TESTS=`echo "$TESTS" | sed 's| |$$/ -n/|g;s|^|-n/|;s|$|$$/|'`
+        env:
+          GNUMAKEFLAGS: ""
+          RUBY_TESTOPTS: "-v --tty=no"
+          TESTS: ${{ matrix.skipped_tests }}
+          PRECHECK_BUNDLED_GEMS: "no"
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests != '' }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ matrix.os }} / ${{ matrix.test_task }}${{ matrix.configure }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/mingw.yml b/.github/workflows/mingw.yml
new file mode 100644
index 0000000000..0df917d3d8
--- /dev/null
+++ b/.github/workflows/mingw.yml
@@ -0,0 +1,179 @@
+name: MinGW
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+# Notes:
+# Actions console encoding causes issues, see test-all & test-spec steps
+#
+jobs:
+  make:
+    runs-on: windows-2022
+    name: ${{ github.workflow }} (${{ matrix.msystem }})
+    env:
+      MSYSTEM: ${{ matrix.msystem }}
+      MSYS2_ARCH: x86_64
+      CHOST: "x86_64-w64-mingw32"
+      CFLAGS:   "-march=x86-64 -mtune=generic -O3 -pipe"
+      CXXFLAGS: "-march=x86-64 -mtune=generic -O3 -pipe"
+      CPPFLAGS: "-D_FORTIFY_SOURCE=2 -D__USE_MINGW_ANSI_STDIO=1 -DFD_SETSIZE=2048"
+      LDFLAGS:  "-pipe"
+      UPDATE_UNICODE: "UNICODE_FILES=. UNICODE_PROPERTY_FILES=. UNICODE_AUXILIARY_FILES=. UNICODE_EMOJI_FILES=."
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+    strategy:
+      matrix:
+        include:
+          # To mitigate flakiness of MinGW CI, we test only one runtime that newer MSYS2 uses.
+          - msystem: "UCRT64"
+            base_ruby: head
+            test_task: "check"
+            test-all-opts: "--name=!/TestObjSpace#test_reachable_objects_during_iteration/"
+      fail-fast: false
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: git config
+        run: |
+          git config --global core.autocrlf false
+          git config --global core.eol lf
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Set up Ruby & MSYS2
+        uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: ${{ matrix.base_ruby }}
+      - name: set env
+        run: |
+          echo "GNUMAKEFLAGS=-j$((2 * NUMBER_OF_PROCESSORS))" >> $GITHUB_ENV
+
+      - name: where check
+        run: |
+          # show where
+          mv /c/Windows/System32/libcrypto-1_1-x64.dll /c/Windows/System32/libcrypto-1_1-x64.dll_
+          mv /c/Windows/System32/libssl-1_1-x64.dll    /c/Windows/System32/libssl-1_1-x64.dll_
+          result=true
+          for e in gcc.exe ragel.exe make.exe bison.exe libcrypto-1_1-x64.dll libssl-1_1-x64.dll; do
+            echo '##['group']'$'\033[93m'$e$'\033[m'
+            where $e || result=false
+            echo '##['endgroup']'
+          done
+          $result
+
+      - name: version check
+        run: |
+          # show version
+          result=true
+          for e in gcc ragel make bison "openssl version"; do
+            case "$e" in *" "*) ;; *) e="$e --version";; esac
+            echo '##['group']'$'\033[93m'$e$'\033[m'
+            $e || result=false
+            echo '##['endgroup']'
+          done
+          $result
+
+      - name: autogen
+        run: |
+          ./autogen.sh
+        working-directory: src
+
+      - name: configure
+        run: >
+          ../src/configure --disable-install-doc --prefix=/.
+          --build=$CHOST --host=$CHOST --target=$CHOST
+
+      - name: update
+        run: |
+          make incs
+
+      - name: download gems
+        run: |
+          make update-gems
+
+      - name: make all
+        timeout-minutes: 30
+        run: |
+          make
+
+      - run: make leaked-globals
+
+      - name: make install
+        run: |
+          make DESTDIR=../install install-nodoc
+
+      - name: test
+        timeout-minutes: 5
+        run: |
+          make test
+        if: ${{matrix.test_task == 'check' || matrix.test_task == 'test'}}
+
+      - name: test-all
+        timeout-minutes: 45
+        run: |
+          # Actions uses UTF8, causes test failures, similar to normal OS setup
+          chcp.com 437
+          make ${{ StartsWith(matrix.test_task, 'test/') && matrix.test_task || 'test-all' }}
+        env:
+          RUBY_TESTOPTS: >-
+            --retry --job-status=normal --show-skip --timeout-scale=1.5
+            ${{ matrix.test-all-opts }}
+          BUNDLER_VERSION:
+        if: ${{matrix.test_task == 'check' || matrix.test_task == 'test-all' || StartsWith(matrix.test_task, 'test/')}}
+
+      - name: test-spec
+        timeout-minutes: 10
+        run: |
+          make ${{ StartsWith(matrix.test_task, 'spec/') && matrix.test_task || 'test-spec' }}
+        if: ${{matrix.test_task == 'check' || matrix.test_task == 'test-spec' || StartsWith(matrix.test_task, 'spec/')}}
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} ${{ matrix.msystem }} / ${{ matrix.test_task }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
+    shell: sh
diff --git a/.github/workflows/mjit-bindgen.yml b/.github/workflows/mjit-bindgen.yml
new file mode 100644
index 0000000000..26f8a1b2aa
--- /dev/null
+++ b/.github/workflows/mjit-bindgen.yml
@@ -0,0 +1,104 @@
+name: MJIT bindgen
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        include:
+          - task: mjit-bindgen
+      fail-fast: false
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y \
+          build-essential \
+          libssl-dev libyaml-dev libreadline6-dev \
+          zlib1g-dev libncurses5-dev libffi-dev \
+          libclang1-14 \
+          bison autoconf
+          sudo apt-get install -q -y pkg-config || :
+      - name: Set up Ruby
+        uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: '3.1'
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --prefix=$(pwd)/install --enable-yjit=dev_nodebug
+      - run: make incs
+      - run: make
+      - run: make install
+      - run: make ${{ matrix.task }}
+      - run: git diff --exit-code
+        working-directory: src
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ matrix.os }} / ${{ matrix.test_task }}${{ matrix.configure }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/mjit.yml b/.github/workflows/mjit.yml
new file mode 100644
index 0000000000..6f7181489a
--- /dev/null
+++ b/.github/workflows/mjit.yml
@@ -0,0 +1,113 @@
+name: MJIT
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '**.[1-8]'
+      - '**.ronn'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '**.[1-8]'
+      - '**.ronn'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        test_task: [check] # to make job names consistent
+        mjit_opts: [--mjit-wait]
+      fail-fast: false
+    runs-on: ubuntu-latest
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    env:
+      TESTOPTS: '-q --tty=no'
+      RUN_OPTS: '--disable-gems ${{ matrix.mjit_opts }} --mjit-debug=-ggdb3'
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc cppflags=-DVM_CHECK_MODE
+      - run: make incs
+      - run: make
+      - run: sudo make -s install
+      - name: Run test
+        run: |
+          unset GNUMAKEFLAGS
+          make -s test RUN_OPTS="$RUN_OPTS"
+        timeout-minutes: 60
+      # - name: Run test-all
+      #   run: |
+      #     ulimit -c unlimited
+      #     make -s test-all RUN_OPTS="$RUN_OPTS"
+      #   timeout-minutes: 60
+      - name: Run test-spec
+        run: |
+          unset GNUMAKEFLAGS
+          make -s test-spec RUN_OPTS="$RUN_OPTS"
+        timeout-minutes: 60
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.test_task }} ${{ matrix.mjit_opts }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/publish.yml b/.github/workflows/publish.yml
new file mode 100644
index 0000000000..5d4474d978
--- /dev/null
+++ b/.github/workflows/publish.yml
@@ -0,0 +1,18 @@
+name: Start release workflow
+on:
+  push:
+    tags:
+      - '*'
+
+jobs:
+  notify:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Build release package
+        run: |
+          curl -L -X POST \
+            -H "Authorization: Bearer ${{ secrets.MATZBOT_GITHUB_WORKFLOW_TOKEN }}" \
+            -H "Accept: application/vnd.github+json" \
+            -H "X-GitHub-Api-Version: 2022-11-28" \
+            https://api.github.com/repos/ruby/actions/dispatches \
+            -d '{"event_type": "${{ github.ref }}"}'
diff --git a/.github/workflows/scorecards.yml b/.github/workflows/scorecards.yml
new file mode 100644
index 0000000000..c12a95362d
--- /dev/null
+++ b/.github/workflows/scorecards.yml
@@ -0,0 +1,72 @@
+# This workflow uses actions that are not certified by GitHub. They are provided
+# by a third-party and are governed by separate terms of service, privacy
+# policy, and support documentation.
+
+name: Scorecards supply-chain security
+on:
+  # For Branch-Protection check. Only the default branch is supported. See
+  # https://github.com/ossf/scorecard/blob/main/docs/checks.md#branch-protection
+  branch_protection_rule:
+  # To guarantee Maintained check is occasionally updated. See
+  # https://github.com/ossf/scorecard/blob/main/docs/checks.md#maintained
+  schedule:
+    - cron: '22 4 * * 2'
+  push:
+    branches: [ "master" ]
+
+# Declare default permissions as read only.
+permissions: read-all
+
+jobs:
+  analysis:
+    name: Scorecards analysis
+    runs-on: ubuntu-latest
+    permissions:
+      # Needed to upload the results to code-scanning dashboard.
+      security-events: write
+      # Needed to publish results and get a badge (see publish_results below).
+      id-token: write
+      # Uncomment the permissions below if installing in a private repository.
+      # contents: read
+      # actions: read
+
+    steps:
+      - name: "Checkout code"
+        uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          persist-credentials: false
+
+      - name: "Run analysis"
+        uses: ossf/scorecard-action@ea651e62978af7915d09fe2e282747c798bf2dab # v2.4.1
+        with:
+          results_file: results.sarif
+          results_format: sarif
+          # (Optional) Read-only PAT token. Uncomment the `repo_token` line below if:
+          # - you want to enable the Branch-Protection check on a *public* repository, or
+          # - you are installing Scorecards on a *private* repository
+          # To create the PAT, follow the steps in https://github.com/ossf/scorecard-action#authentication-with-pat.
+          repo_token: ${{ secrets.SCORECARD_READ_TOKEN }}
+
+          # Public repositories:
+          #   - Publish results to OpenSSF REST API for easy access by consumers
+          #   - Allows the repository to include the Scorecard badge.
+          #   - See https://github.com/ossf/scorecard-action#publishing-results.
+          # For private repositories:
+          #   - `publish_results` will always be set to `false`, regardless
+          #     of the value entered here.
+          publish_results: true
+
+      # Upload the results as artifacts (optional). Commenting out will disable uploads of run results in SARIF
+      # format to the repository Actions tab.
+      - name: "Upload artifact"
+        uses: actions/upload-artifact@ea165f8d65b6e75b540449e92b4886f43607fa02 # v4.6.2
+        with:
+          name: SARIF file
+          path: results.sarif
+          retention-days: 5
+
+      # Upload the results to GitHub's code scanning dashboard.
+      - name: "Upload to code-scanning"
+        uses: github/codeql-action/upload-sarif@959cbb7472c4d4ad70cdfe6f4976053fe48ab394 # v2.1.27
+        with:
+          sarif_file: results.sarif
diff --git a/.github/workflows/spec_guards.yml b/.github/workflows/spec_guards.yml
new file mode 100644
index 0000000000..4521195a2b
--- /dev/null
+++ b/.github/workflows/spec_guards.yml
@@ -0,0 +1,71 @@
+name: Rubyspec Version Guards Check
+
+on:
+  push:
+    paths:
+      - 'spec/**'
+      - '!spec/*.md'
+  pull_request:
+    paths:
+      - 'spec/**'
+      - '!spec/*.md'
+  merge_group:
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  rubyspec:
+    name: Rubyspec
+
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.head_commit.message, 'Document')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.title, 'Document')
+      || contains(github.event.pull_request.labels.*.name, 'Document')
+      || (github.event_name == 'push' && github.actor == 'dependabot[bot]')
+      )}}
+
+    strategy:
+      matrix:
+        # Specs from ruby/spec should still run on all supported Ruby versions.
+        # This also ensures the needed ruby_version_is guards are there, see spec/README.md.
+        ruby:
+          - ruby-3.1
+          - ruby-3.2
+
+    steps:
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+
+      - uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler: none
+
+      - run: gem install webrick
+
+      - run: ruby ../mspec/bin/mspec
+        working-directory: spec/ruby
+        env:
+          CHECK_LEAKS: true
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / rubyspec @ ${{ matrix.ruby }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/ubuntu.yml b/.github/workflows/ubuntu.yml
new file mode 100644
index 0000000000..4fbca1170e
--- /dev/null
+++ b/.github/workflows/ubuntu.yml
@@ -0,0 +1,146 @@
+name: Ubuntu
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        # main variables included in the job name
+        test_task: [check]
+        configure: [cppflags=-DRUBY_DEBUG] # default to use more assertions
+        arch: ['']
+        # specify all jobs with `include` to avoid testing duplicated things
+        include:
+          - test_task: check
+          - test_task: check
+            arch: i686
+            configure: '' # test without -DRUBY_DEBUG as well
+          - test_task: check
+            configure: "--enable-shared --enable-load-relative"
+          - test_task: test-all TESTS=--repeat-count=2
+          - test_task: test-bundler-parallel
+          - test_task: test-bundled-gems
+      fail-fast: false
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      RUBY_DEBUG: ci
+      SETARCH: ${{ matrix.arch && format('setarch {0}', matrix.arch) }}
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - name: Install libraries
+        env:
+          arch: ${{matrix.arch}}
+        run: |
+          set -x
+          arch=${arch:+:${arch/i[3-6]86/i386}}
+          ${arch:+sudo dpkg --add-architecture ${arch#:}}
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y \
+          ${arch:+cross}build-essential${arch/:/-} \
+          libssl-dev${arch} libyaml-dev${arch} libreadline6-dev${arch} \
+          zlib1g-dev${arch} libncurses5-dev${arch} libffi-dev${arch} \
+          bison autoconf ruby
+          sudo apt-get install -q -y pkg-config${arch} || :
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        env:
+          arch: ${{matrix.arch}}
+        run: >-
+          $SETARCH ../src/configure -C --disable-install-doc ${{ matrix.configure }}
+          ${arch:+--target=$arch-$OSTYPE --host=$arch-$OSTYPE}
+      - run: $SETARCH make incs
+      - run: $SETARCH make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+      - run: $SETARCH make
+      - run: $SETARCH make leaked-globals
+        if: ${{ matrix.test_task == 'check' }}
+      - name: Create dummy files in build dir
+        run: |
+          $SETARCH ./miniruby -e '(("a".."z").to_a+("A".."Z").to_a+("0".."9").to_a+%w[foo bar test zzz]).each{|basename|File.write("#{basename}.rb", "raise %(do not load #{basename}.rb)")}'
+        if: ${{ matrix.test_task == 'check' }}
+      - name: make ${{ matrix.test_task }}
+        run: |
+          $SETARCH make -s ${{ matrix.test_task }} ${TESTS:+TESTS=`echo "$TESTS" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|'`}
+        timeout-minutes: 40
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TESTS: ${{ matrix.test_task == 'check' && matrix.skipped_tests || '' }}
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+          PRECHECK_BUNDLED_GEMS: "no"
+      - name: make skipped tests
+        run: |
+          $SETARCH make -s test-all TESTS=`echo "$TESTS" | sed 's| |$$/ -n/|g;s|^|-n/|;s|$|$$/|'`
+        env:
+          GNUMAKEFLAGS: ""
+          RUBY_TESTOPTS: "-v --tty=no"
+          TESTS: ${{ matrix.skipped_tests }}
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests != '' }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.test_task }} ${{ matrix.configure }}${{ matrix.arch }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/wasm.yml b/.github/workflows/wasm.yml
new file mode 100644
index 0000000000..27920b5821
--- /dev/null
+++ b/.github/workflows/wasm.yml
@@ -0,0 +1,146 @@
+name: WebAssembly
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:  # added using https://github.com/step-security/secure-workflows
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        entry:
+#         # wasmtime can't compile non-optimized Asyncified binary due to locals explosion
+#         - { name: O0-debuginfo, optflags: "-O0", debugflags: "-g", wasmoptflags: "-O1" }
+#         - { name: O1,           optflags: "-O1", debugflags: ""  , wasmoptflags: "-O1" }
+          - { name: O2,           optflags: "-O2", debugflags: ""  , wasmoptflags: "-O2" }
+#         - { name: O3,           optflags: "-O3", debugflags: ""  , wasmoptflags: "-O3" }
+#         # -O4 is equivalent to -O3 in clang, but it's different in wasm-opt
+#         - { name: O4,           optflags: "-O3", debugflags: ""  , wasmoptflags: "-O4" }
+#         - { name: Oz,           optflags: "-Oz", debugflags: ""  , wasmoptflags: "-Oz" }
+      fail-fast: false
+    env:
+      RUBY_TESTOPTS: '-q --tty=no'
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      WASI_SDK_VERSION_MAJOR: 14
+      WASI_SDK_VERSION_MINOR: 0
+      BINARYEN_VERSION: 109
+      WASMTIME_VERSION: v0.33.0
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - name: Install libraries
+        run: |
+          set -ex
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y ruby bison make autoconf git wget
+
+          wasi_sdk_deb="wasi-sdk_${WASI_SDK_VERSION_MAJOR}.${WASI_SDK_VERSION_MINOR}_amd64.deb"
+          wget "https://github.com/WebAssembly/wasi-sdk/releases/download/wasi-sdk-${WASI_SDK_VERSION_MAJOR}/${wasi_sdk_deb}"
+          sudo dpkg -i "$wasi_sdk_deb"
+          rm -f "$wasi_sdk_deb"
+
+          mkdir build-sdk
+          pushd build-sdk
+
+          wasmtime_url="https://github.com/bytecodealliance/wasmtime/releases/download/${WASMTIME_VERSION}/wasmtime-${WASMTIME_VERSION}-x86_64-linux.tar.xz"
+          wget -O - "$wasmtime_url" | tar xJf -
+          sudo ln -fs "$PWD/wasmtime-${WASMTIME_VERSION}-x86_64-linux/wasmtime" /usr/local/bin/wasmtime
+
+          binaryen_tarball="binaryen-version_${BINARYEN_VERSION}-x86_64-linux.tar.gz"
+          binaryen_url="https://github.com/WebAssembly/binaryen/releases/download/version_${BINARYEN_VERSION}/${binaryen_tarball}"
+          wget -O - "$binaryen_url" | tar xfz -
+          sudo ln -fs "$PWD/binaryen-version_${BINARYEN_VERSION}/bin/wasm-opt" /usr/local/bin/wasm-opt
+        working-directory: src
+      - name: Set ENV
+        run: |
+          echo "MAKEFLAGS=-j$((1 + $(sysctl -n hw.activecpu)))" >> $GITHUB_ENV
+          echo "WASI_SDK_PATH=/opt/wasi-sdk" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+
+      - uses: ruby/setup-ruby@13e7a03dc3ac6c3798f4570bfead2aed4d96abfb # v1.244.0
+        with:
+          ruby-version: '3.0'
+          bundler: none
+
+      - name: Download config.guess with wasi version
+        run: |
+          rm tool/config.guess tool/config.sub
+          ruby tool/downloader.rb -d tool -e gnu config.guess config.sub
+        working-directory: src
+
+      - name: Run configure
+        run: |
+          ../src/configure \
+            --host wasm32-unknown-wasi \
+            --with-static-linked-ext \
+            LDFLAGS=" \
+              -Xlinker --stack-first \
+              -Xlinker -z -Xlinker stack-size=16777216 \
+            " \
+            optflags="${{ matrix.entry.optflags }}" \
+            debugflags="${{ matrix.entry.debugflags }}" \
+            wasmoptflags="${{ matrix.entry.wasmoptflags }} ${{ matrix.entry.debugflags }}"
+
+      # miniruby may not be built when cross-compling
+      - run: make mini ruby
+      - name: Run basictest
+        run: wasmtime run ./../build/miniruby --mapdir /::./ -- basictest/test.rb
+        working-directory: src
+      - name: Run bootstraptest (no thread)
+        run: |
+          NO_THREAD_TESTS="$(grep -L Thread -R ./bootstraptest | awk -F/ '{ print $NF }' | uniq | sed -n 's/test_\(.*\).rb/\1/p' | paste -s -d, -)"
+          ruby ./bootstraptest/runner.rb --ruby="$(which wasmtime) run $PWD/../build/ruby --mapdir /::./ -- " --verbose "--sets=$NO_THREAD_TESTS"
+        working-directory: src
+
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.name }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/windows.yml b/.github/workflows/windows.yml
new file mode 100644
index 0000000000..c2bd4881c2
--- /dev/null
+++ b/.github/workflows/windows.yml
@@ -0,0 +1,149 @@
+name: Windows
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  make:
+    strategy:
+      matrix:
+        include:
+          - vs: 2022
+            vcvers: -vcvars_ver=14.2
+      fail-fast: false
+    runs-on: windows-${{ matrix.vs }}
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    name: VisualStudio ${{ matrix.vs }}
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      PATCH: C:\msys64\usr\bin\patch.exe
+      OS_VER: windows-${{ matrix.vs }}
+    steps:
+      - run: md build
+        working-directory:
+      - uses: msys2/setup-msys2@61f9e5e925871ba6c9e3e8da24ede83ea27fa91f # v2.27.0
+        id: setup-msys2
+        with:
+          update: true
+          install: bison patch
+      - name: patch path
+        shell: msys2 {0}
+        run: echo PATCH=$(cygpath -wa $(command -v patch)) >> $GITHUB_ENV
+        if: ${{ steps.setup-msys2.outcome == 'success' }}
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: C:\vcpkg\installed
+          key: ${{ runner.os }}-vcpkg-installed-windows-${{ matrix.vs }}-${{ github.sha }}
+          restore-keys: |
+            ${{ runner.os }}-vcpkg-installed-windows-${{ matrix.vs }}-
+            ${{ runner.os }}-vcpkg-installed-windows-
+      - name: Install libraries with vcpkg
+        run: |
+          iex "& {$(irm get.scoop.sh)} -RunAsAdmin"
+          Join-Path (Resolve-Path ~).Path "scoop\shims" >> $Env:GITHUB_PATH
+          scoop install cmake@3.31.6
+          vcpkg --triplet x64-windows install libffi libyaml openssl readline zlib
+        shell:
+          pwsh
+      - name: git config
+        run: |
+          git config --global core.autocrlf false
+          git config --global core.eol lf
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: setup env
+        # %TEMP% is inconsistent with %TMP% and test-all expects they are consistent.
+        # https://github.com/actions/virtual-environments/issues/712#issuecomment-613004302
+        # msys2/setup-msys2 installs MSYS2 to D:/a/_temp/msys64/usr/bin
+        run: |
+          set Path=D:/a/_temp/msys64/usr/bin;%Path%
+          if not "%VCVARS%" == "" goto :vcset
+            set VCVARS="C:\Program Files (x86)\Microsoft Visual Studio\${{ matrix.vs }}\Enterprise\VC\Auxiliary\Build\vcvars64.bat"
+            if not exist %VCVARS% set VCVARS="C:\Program Files\Microsoft Visual Studio\${{ matrix.vs }}\Enterprise\VC\Auxiliary\Build\vcvars64.bat"
+          :vcset
+          set | C:\msys64\usr\bin\sort > old.env
+          call %VCVARS% ${{ matrix.vcvers || ''}}
+          set TMP=%USERPROFILE%\AppData\Local\Temp
+          set TEMP=%USERPROFILE%\AppData\Local\Temp
+          set /a TEST_JOBS=(15 * %NUMBER_OF_PROCESSORS% / 10) > nul
+          set | C:\msys64\usr\bin\sort > new.env
+          C:\msys64\usr\bin\comm -13 old.env new.env >> %GITHUB_ENV%
+          del *.env
+      - name: compiler version
+        run: cl
+      - name: link libraries
+        run: |
+          for %%I in (C:\vcpkg\installed\x64-windows\bin\*.dll) do (
+            if not %%~nI == readline mklink %%~nxI %%I
+          )
+          for %%I in (libcrypto-1_1-x64 libssl-1_1-x64) do (
+            ren c:\Windows\System32\%%I.dll %%I.dll_
+          )
+      - name: Configure
+        run: >-
+          ../src/win32/configure.bat --disable-install-doc
+          --with-opt-dir=C:/vcpkg/installed/x64-windows
+      - run: nmake incs
+      - run: nmake extract-extlibs
+      - run: nmake
+        env:
+          YACC: bison.exe
+      - run: nmake test
+        timeout-minutes: 5
+      - run: nmake test-spec
+        timeout-minutes: 10
+      - run: nmake test-all
+        env:
+          RUBY_TESTOPTS: -j${{env.TEST_JOBS}} --job-status=normal
+        timeout-minutes: 60
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "VS${{ matrix.vs }} / ${{ matrix.test_task || 'check' }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
+    shell: cmd
diff --git a/.github/workflows/yjit-ubuntu.yml b/.github/workflows/yjit-ubuntu.yml
new file mode 100644
index 0000000000..0b7b9046e9
--- /dev/null
+++ b/.github/workflows/yjit-ubuntu.yml
@@ -0,0 +1,170 @@
+name: YJIT Ubuntu
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+  merge_group:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+
+concurrency:
+  group: ${{ github.workflow }} / ${{ startsWith(github.event_name, 'pull') && github.ref_name || github.sha }}
+  cancel-in-progress: ${{ startsWith(github.event_name, 'pull') }}
+
+permissions:
+  contents: read
+
+jobs:
+  cargo:
+    name: Rust cargo test
+    # GitHub Action's image seems to already contain a Rust 1.58.0.
+    runs-on: ubuntu-22.04
+    steps:
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+      # For now we can't run cargo test --offline because it complains about the
+      # capstone dependency, even though the dependency is optional
+      #- run: cargo test --offline
+      - run: RUST_BACKTRACE=1 cargo test
+        working-directory: yjit
+      # Also compile and test with all features enabled
+      - run: RUST_BACKTRACE=1 cargo test --all-features
+        working-directory: yjit
+      # Check that we can build in release mode too
+      - run: cargo build --release
+        working-directory: yjit
+  make:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - test_task: 'yjit-bindgen'
+            hint: 'To fix: use patch in logs'
+            configure: '--with-gcc=clang-14 --enable-yjit=dev'
+            libclang_path: '/usr/lib/llvm-14/lib/libclang.so.1'
+
+          - test_task: "check"
+            # YJIT should be automatically built in release mode on x86-64 Linux with rustc present
+            #configure: "--enable-yjit RUSTC='rustc +1.58.0'"
+            configure: "RUSTC='rustc +1.58.0'"
+            rust_version: "1.58.0"
+
+          - test_task: "check"
+            configure: "--enable-yjit=dev"
+
+          - test_task: "check"
+            configure: "--enable-yjit=dev"
+            yjit_opts: "--yjit-call-threshold=1 --yjit-verify-ctx"
+
+          - test_task: "test-all TESTS=--repeat-count=2"
+            configure: "--enable-yjit=dev"
+
+          - test_task: "test-bundled-gems"
+            configure: "--enable-yjit=dev"
+
+          - test_task: "yjit-bench"
+            configure: "--enable-yjit=dev"
+            yjit_bench_opts: "--yjit-stats"
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      RUN_OPTS: ${{ matrix.yjit_opts }}
+      YJIT_BENCH_OPTS: ${{ matrix.yjit_bench_opts }}
+      RUBY_DEBUG: ci
+      BUNDLE_JOBS: 8 # for yjit-bench
+    runs-on: ubuntu-22.04
+    if: ${{ !contains(github.event.head_commit.message, '[DOC]') && !contains(github.event.pull_request.labels.*.name, 'Documentation') }}
+    steps:
+      - run: mkdir build
+        working-directory:
+      - name: Install libraries
+        run: |
+          set -x
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y build-essential libssl-dev libyaml-dev libreadline6-dev zlib1g-dev libncurses5-dev libffi-dev bison autoconf ruby
+      - name: Install Rust
+        if: ${{ matrix.rust_version }}
+        run: rustup install ${{ matrix.rust_version }} --profile minimal
+      - name: git config
+        run: |
+          git config --global advice.detachedHead 0
+          git config --global init.defaultBranch garbage
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          path: src
+      - uses: actions/cache@5a3ec84eff668545956fd18022155c47e93e2684 # v4.2.3
+        with:
+          path: src/.downloaded-cache
+          key: downloaded-cache
+      - name: Fixed world writable dirs
+        run: |
+          chmod -v go-w $HOME $HOME/.config
+          sudo chmod -R go-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v go-w $d; done' || :
+      - name: Set ENV
+        run: |
+          echo "GNUMAKEFLAGS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - run: ./autogen.sh
+        working-directory: src
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --prefix=$(pwd)/install ${{ matrix.configure }}
+      - run: make incs
+      - run: make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+      - run: make -j
+      - run: make leaked-globals
+        if: ${{ matrix.test_task == 'check' }}
+      - name: Create dummy files in build dir
+        run: |
+          ./miniruby -e '(("a".."z").to_a+("A".."Z").to_a+("0".."9").to_a+%w[foo bar test zzz]).each{|basename|File.write("#{basename}.rb", "raise %(do not load #{basename}.rb)")}'
+        if: ${{ matrix.test_task == 'check' }}
+      - name: Enable YJIT through ENV
+        run: echo "RUBY_YJIT_ENABLE=1" >> $GITHUB_ENV
+      # Check that the binary was built with YJIT
+      - name: Check YJIT enabled
+        run: ./miniruby --yjit -v | grep "+YJIT"
+      - name: make ${{ matrix.test_task }}
+        run: make -s -j ${{ matrix.test_task }} RUN_OPTS="$RUN_OPTS" YJIT_BENCH_OPTS="$YJIT_BENCH_OPTS"
+        timeout-minutes: 60
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ""
+          PRECHECK_BUNDLED_GEMS: "no"
+          LIBCLANG_PATH: ${{ matrix.libclang_path }}
+        continue-on-error: ${{ matrix.test_task == 'yjit-bench' }}
+      - name: Show ${{ github.event.pull_request.base.ref }} GitHub URL for yjit-bench comparison
+        run: echo "https://github.com/${BASE_REPO}/commit/${BASE_SHA}"
+        env:
+          BASE_REPO: ${{ github.event.pull_request.base.repo.full_name }}
+          BASE_SHA: ${{ github.event.pull_request.base.sha }}
+        if: ${{ matrix.test_task == 'yjit-bench' && startsWith(github.event_name, 'pull') }}
+      - uses: ruby/action-slack@0bd85c72233cdbb6a0fe01d37aaeff1d21b5fce1 # v3.2.1
+        with:
+          payload: |
+            {
+              "ci": "GitHub Actions",
+              "env": "${{ github.workflow }} / ${{ matrix.test_task }} ${{ matrix.configure }}",
+              "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+              "commit": "${{ github.sha }}",
+              "branch": "${{ github.ref_name }}"
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() && github.event_name == 'push' }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.gitignore b/.gitignore
index 8cbef05489..99d32a1825 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,37 +1,70 @@
 *-*-*.def
+*-*-*.exp
+*-*-*.lib
 *.a
 *.bak
+*.bc
+*.bundle
 *.dSYM
+*.dmyh
 *.dylib
+*.elc
+*.i
+*.ii
 *.inc
 *.log
 *.o
+*.o.tmp
+*.obj
+*.old
 *.orig
+*.pch
+*.pdb
+*.rbinc
 *.rej
+*.s
 *.sav
+*.sl
+*.so
+*.so.*
 *.swp
+*.yarb
 *~
-.*-*
 .*.list
 .*.time
 .DS_Store
+.bundle
 .ccmalloc
 .ext
 .pc
 .ppack
 .svn
+.time
+.ruby-version
 Makefile
+cygruby*.def
 extconf.h
 y.output
 y.tab.c
+*.gcda
+*.gcno
+*.gcov
+*.vscode
+lcov*.info
 
 # /
+/*-fake.rb
+/*.dll
+/*.exe
+/*.res
 /*.pc
+/*.rc
 /*_prelude.c
+/.downloaded-cache
+/.top-enc.mk
+/build*/
 /COPYING.LIB
-/ChangeLog-1.8.0
-/ChangeLog.pre-alpha
-/ChangeLog.pre1_1
+/ChangeLog
 /Doxyfile
 /GNUmakefile
 /README.atheos
@@ -41,7 +74,9 @@ y.tab.c
 /archive
 /autom4te*.cache
 /automake
+/benchmark/benchmark-driver
 /beos
+/bmlog-*
 /breakpoints.gdb
 /config.cache
 /config.h
@@ -49,14 +84,23 @@ y.tab.c
 /config.status
 /config.status.lineno
 /configure
+/coverage/simplecov
+/coverage/simplecov-html
+/coverage/doclie
+/coverage/.last_run.json
+/coverage/.resultset.json*
+/coverage/assets
+/coverage/index.html
 /doc/capi
 /enc.mk
-/enc/trans/*.c
 /encdb.h
 /exts.mk
 /goruby
-/id.h
+/id.[ch]
 /largefile.h
+/lcov-c-out
+/lcov-rb-out
+/lcov-out
 /lex.c
 /libruby*.*
 /miniprelude.c
@@ -72,45 +116,94 @@ y.tab.c
 /ppack
 /prelude.c
 /preview
+/probes.dmyh
+/probes.h
 /rbconfig.rb
 /rename2.h
 /repack
 /revision.h
+/revision.tmp
 /riscos
 /rubicon
 /ruby
+/ruby-runner
+/ruby-runner.h
 /ruby-man.rd.gz
+/rubyspec_temp
+/run.gdb
+/sizes.c
+/static-ruby
 /test.rb
+/test-coverage.dat
 /tmp
 /transdb.h
 /uncommon.mk
 /verconf.h
+/verconf.mk
 /web
 /yasmdata.rb
 
+# /bin/
+
+/bin/*.exe
+/bin/*.dll
+/bin/goruby
+/bin/ruby
+
 # /benchmark/
+/benchmark/bm_require.data
 /benchmark/bmx_*.rb
+/benchmark/fasta.output.*
+/benchmark/wc.input
+
+/enc/*.def
+/enc/*.exp
+/enc/*.lib
+/enc/jis/props.h
+/enc/unicode/data
+
+# /coroutine/
+!/coroutine/**/*.s
 
 # /enc/trans/
 /enc/trans/*.c
+/enc/trans/*.def
+/enc/trans/*.exp
+/enc/trans/*.lib
+
+# /exe/
+/exe/goruby
+/exe/ruby
 
 # /ext/
 /ext/extinit.c
+/ext/configure-ext.mk
+/ext/*/exts.mk
+
+# /ext/-test-/cxxanyargs
+/ext/-test-/cxxanyargs/failure*.failed
+
+# /ext/-test-/win32/dln/
+/ext/-test-/win32/dln/dlntest.dll
+/ext/-test-/win32/dln/dlntest.exp
+/ext/-test-/win32/dln/dlntest.lib
 
-# /ext/dl/
-/ext/dl/*.func
+# /ext/-test-/gems
+/ext/-test-/gems
 
-# /ext/dl/callback/
-/ext/dl/callback/*.func
-/ext/dl/callback/callback-*.c
-/ext/dl/callback/callback.c
+# /ext/etc/
+/ext/etc/constdefs.h
 
-# /ext/iconv/
-/ext/iconv/config.charset
-/ext/iconv/iconv.rb
+# /ext/fiddle/
+/ext/fiddle/libffi-*
+
+# /ext/rbconfig/
+/ext/rbconfig/sizeof/sizes.c
+/ext/rbconfig/sizeof/limits.c
 
 # /ext/ripper/
 /ext/ripper/eventids1.c
+/ext/ripper/.eventids2-check
 /ext/ripper/eventids2table.c
 /ext/ripper/ripper.*
 /ext/ripper/ids1
@@ -121,12 +214,37 @@ y.tab.c
 /ext/socket/constdefs.h
 /ext/socket/constdefs.c
 
-# /ext/tk/
-/ext/tk/config_list
+# /gems
+/gems/*.gem
+/gems/src
+/gems/*-*
+
+# /lib/
+/lib/ruby/[1-9]*.*
+/lib/ruby/vendor_ruby
+
+# /misc/
+/misc/**/__pycache__
+
+# /spec/bundler
+/.rspec_status
 
-# /spec/
-/spec/mspec
-/spec/rubyspec
+# /tool/
+/tool/config.guess
+/tool/config.sub
 
 # /win32/
 /win32/*.ico
+
+# MJIT
+/include/ruby-*/*/rb_mjit_min_header-*.h
+/lib/ruby_vm/mjit/instruction.rb
+/mjit_config.h
+/rb_mjit_header.h
+
+# YJIT
+/yjit-bench
+/yjit_exit_locations.dump
+
+# /wasm/
+/wasm/tests/*.wasm
diff --git a/.indent.pro b/.indent.pro
index 6a207a0554..1d61cbcad1 100644
--- a/.indent.pro
+++ b/.indent.pro
@@ -2,12 +2,15 @@
 -nbbb
 -nbc
 -br
+-brs
 -nbs
 -ncdb
--ce
--cli0.5
+-nce
+-cdw
+-cli2
+-cbi2
 -ndj
--ei
+-ncs
 -nfc1
 -i4
 -l120
@@ -16,6 +19,14 @@
 -psl
 -sc
 -sob
+-sbi4
+-nut
+-par
 
 -TID
 -TVALUE
+-Tst_data_t
+-Tst_index_t
+-Tst_table
+-Trb_data_type_t
+-TFILE
diff --git a/.rdoc_options b/.rdoc_options
new file mode 100644
index 0000000000..760507c7a2
--- /dev/null
+++ b/.rdoc_options
@@ -0,0 +1,4 @@
+---
+page_dir: doc
+main_page: README.md
+title: Documentation for Ruby development version
diff --git a/.rspec_parallel b/.rspec_parallel
new file mode 100644
index 0000000000..aaff198a32
--- /dev/null
+++ b/.rspec_parallel
@@ -0,0 +1,2 @@
+--format progress
+--format ParallelTests::RSpec::RuntimeLogger --out tmp/parallel_runtime_rspec.log
diff --git a/.travis.yml b/.travis.yml
deleted file mode 100644
index 286342c1cc..0000000000
--- a/.travis.yml
+++ /dev/null
@@ -1,8 +0,0 @@
-# no installation...
-before_script: autoconf
-script: "./configure && make all test"
-
-branches:
-  only:
-    - trunk
-    - ruby_1_9_3
diff --git a/BSDL b/BSDL
index 82725534fa..66d93598aa 100644
--- a/BSDL
+++ b/BSDL
@@ -1,13 +1,13 @@
-Copyright (C) 1993-2010 Yukihiro Matsumoto. All rights reserved.
+Copyright (C) 1993-2013 Yukihiro Matsumoto. All rights reserved.
 
 Redistribution and use in source and binary forms, with or without
 modification, are permitted provided that the following conditions
 are met:
 1. Redistributions of source code must retain the above copyright
-notice, this list of conditions and the following disclaimer.
+   notice, this list of conditions and the following disclaimer.
 2. Redistributions in binary form must reproduce the above copyright
-notice, this list of conditions and the following disclaimer in the
-documentation and/or other materials provided with the distribution.
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
 
 THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
new file mode 100644
index 0000000000..13df6087ca
--- /dev/null
+++ b/CONTRIBUTING.md
@@ -0,0 +1 @@
+See ["Contributing to Ruby"](https://docs.ruby-lang.org/en/master/contributing_md.html), which includes setup and build instructions.
diff --git a/COPYING b/COPYING
index a1f19ff99d..48e5a96de7 100644
--- a/COPYING
+++ b/COPYING
@@ -2,55 +2,55 @@ Ruby is copyrighted free software by Yukihiro Matsumoto <matz@netlab.jp>.
 You can redistribute it and/or modify it under either the terms of the
 2-clause BSDL (see the file BSDL), or the conditions below:
 
-  1. You may make and give away verbatim copies of the source form of the
-     software without restriction, provided that you duplicate all of the
-     original copyright notices and associated disclaimers.
+1. You may make and give away verbatim copies of the source form of the
+   software without restriction, provided that you duplicate all of the
+   original copyright notices and associated disclaimers.
 
-  2. You may modify your copy of the software in any way, provided that
-     you do at least ONE of the following:
+2. You may modify your copy of the software in any way, provided that
+   you do at least ONE of the following:
 
-       a) place your modifications in the Public Domain or otherwise
-          make them Freely Available, such as by posting said
-	  modifications to Usenet or an equivalent medium, or by allowing
-	  the author to include your modifications in the software.
+   a. place your modifications in the Public Domain or otherwise
+      make them Freely Available, such as by posting said
+      modifications to Usenet or an equivalent medium, or by allowing
+      the author to include your modifications in the software.
 
-       b) use the modified software only within your corporation or
-          organization.
+   b. use the modified software only within your corporation or
+      organization.
 
-       c) give non-standard binaries non-standard names, with
-          instructions on where to get the original software distribution.
+   c. give non-standard binaries non-standard names, with
+      instructions on where to get the original software distribution.
 
-       d) make other distribution arrangements with the author.
+   d. make other distribution arrangements with the author.
 
-  3. You may distribute the software in object code or binary form,
-     provided that you do at least ONE of the following:
+3. You may distribute the software in object code or binary form,
+   provided that you do at least ONE of the following:
 
-       a) distribute the binaries and library files of the software,
-	  together with instructions (in the manual page or equivalent)
-	  on where to get the original distribution.
+   a. distribute the binaries and library files of the software,
+      together with instructions (in the manual page or equivalent)
+      on where to get the original distribution.
 
-       b) accompany the distribution with the machine-readable source of
-	  the software.
+   b. accompany the distribution with the machine-readable source of
+      the software.
 
-       c) give non-standard binaries non-standard names, with
-          instructions on where to get the original software distribution.
+   c. give non-standard binaries non-standard names, with
+      instructions on where to get the original software distribution.
 
-       d) make other distribution arrangements with the author.
+   d. make other distribution arrangements with the author.
 
-  4. You may modify and include the part of the software into any other
-     software (possibly commercial).  But some files in the distribution
-     are not written by the author, so that they are not under these terms.
+4. You may modify and include the part of the software into any other
+   software (possibly commercial).  But some files in the distribution
+   are not written by the author, so that they are not under these terms.
 
-     For the list of those files and their copying conditions, see the
-     file LEGAL.
+   For the list of those files and their copying conditions, see the
+   file LEGAL.
 
-  5. The scripts and library files supplied as input to or produced as 
-     output from the software do not automatically fall under the
-     copyright of the software, but belong to whomever generated them, 
-     and may be sold commercially, and may be aggregated with this
-     software.
+5. The scripts and library files supplied as input to or produced as
+   output from the software do not automatically fall under the
+   copyright of the software, but belong to whomever generated them,
+   and may be sold commercially, and may be aggregated with this
+   software.
 
-  6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
-     IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-     WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-     PURPOSE.
+6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
+   IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+   WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+   PURPOSE.
diff --git a/COPYING.ja b/COPYING.ja
index e50d01c8d1..230376bc60 100644
--- a/COPYING.ja
+++ b/COPYING.ja
@@ -2,50 +2,50 @@
 または以下に示す条件で本プログラムを再配布できます
 2-clause BSDLについてはBSDLファイルを参照して下さい．
 
-  1. 複製は制限なく自由です．
+1. 複製は制限なく自由です．
 
-  2. 以下の条件のいずれかを満たす時に本プログラムのソースを
-     自由に変更できます．
+2. 以下の条件のいずれかを満たす時に本プログラムのソースを
+   自由に変更できます．
 
-     (a) ネットニューズにポストしたり，作者に変更を送付する
-         などの方法で，変更を公開する．
+   a.  ネットニューズにポストしたり，作者に変更を送付する
+       などの方法で，変更を公開する．
 
-     (b) 変更した本プログラムを自分の所属する組織内部だけで
-         使う．
+   b.  変更した本プログラムを自分の所属する組織内部だけで
+       使う．
 
-     (c) 変更点を明示したうえ，ソフトウェアの名前を変更する．
-         そのソフトウェアを配布する時には変更前の本プログラ
-         ムも同時に配布する．または変更前の本プログラムのソー
-         スの入手法を明示する．
+   c.  変更点を明示したうえ，ソフトウェアの名前を変更する．
+       そのソフトウェアを配布する時には変更前の本プログラ
+       ムも同時に配布する．または変更前の本プログラムのソー
+       スの入手法を明示する．
 
-     (d) その他の変更条件を作者と合意する．
+   d.  その他の変更条件を作者と合意する．
 
-  3. 以下の条件のいずれかを満たす時に本プログラムをコンパイ
-     ルしたオブジェクトコードや実行形式でも配布できます．
+3. 以下の条件のいずれかを満たす時に本プログラムをコンパイ
+   ルしたオブジェクトコードや実行形式でも配布できます．
 
-     (a) バイナリを受け取った人がソースを入手できるように，
-         ソースの入手法を明示する．
+   a.  バイナリを受け取った人がソースを入手できるように，
+       ソースの入手法を明示する．
 
-     (b) 機械可読なソースコードを添付する．
+   b.  機械可読なソースコードを添付する．
 
-     (c) 変更を行ったバイナリは名前を変更したうえ，オリジナ
-         ルのソースコードの入手法を明示する．
+   c.  変更を行ったバイナリは名前を変更したうえ，オリジナ
+       ルのソースコードの入手法を明示する．
 
-     (d) その他の配布条件を作者と合意する．
+   d.  その他の配布条件を作者と合意する．
 
-  4. 他のプログラムへの引用はいかなる目的であれ自由です．た
-     だし，本プログラムに含まれる他の作者によるコードは，そ
-     れぞれの作者の意向による制限が加えられる場合があります．
+4. 他のプログラムへの引用はいかなる目的であれ自由です．た
+   だし，本プログラムに含まれる他の作者によるコードは，そ
+   れぞれの作者の意向による制限が加えられる場合があります．
 
-     それらファイルの一覧とそれぞれの配布条件などに付いては
-     LEGALファイルを参照してください．
+   それらファイルの一覧とそれぞれの配布条件などに付いては
+   LEGALファイルを参照してください．
 
-  5. 本プログラムへの入力となるスクリプトおよび，本プログラ
-     ムからの出力の権利は本プログラムの作者ではなく，それぞ
-     れの入出力を生成した人に属します．また，本プログラムに
-     組み込まれるための拡張ライブラリについても同様です．
+5. 本プログラムへの入力となるスクリプトおよび，本プログラ
+   ムからの出力の権利は本プログラムの作者ではなく，それぞ
+   れの入出力を生成した人に属します．また，本プログラムに
+   組み込まれるための拡張ライブラリについても同様です．
 
-  6. 本プログラムは無保証です．作者は本プログラムをサポート
-     する意志はありますが，プログラム自身のバグあるいは本プ
-     ログラムの実行などから発生するいかなる損害に対しても責
-     任を持ちません．
+6. 本プログラムは無保証です．作者は本プログラムをサポート
+   する意志はありますが，プログラム自身のバグあるいは本プ
+   ログラムの実行などから発生するいかなる損害に対しても責
+   任を持ちません．
diff --git a/ChangeLog b/ChangeLog
deleted file mode 100644
index ddd126c17b..0000000000
--- a/ChangeLog
+++ /dev/null
@@ -1,8747 +0,0 @@
-Wed Apr 11 07:38:33 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/digest/sha2/lib/sha2.rb (Digest#block_length):  Fixed method name
-	  in documentation examples.  Patch by naleski via
-	  https://github.com/ruby/ruby/pull/115
-
-Wed Apr 11 07:33:13 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* pack.c (pack_pack):  Warn when an invalid character is found in the
-	  format string when $VERBOSE is true.  [ruby-trunk - Feature #5219]
-	* pack.c (pack_unpack):  ditto
-	* test/ruby/test_pack.rb (class TestPack):  Test for warnings on
-	  invalid format characters.
-
-Wed Apr 11 06:11:10 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* string.c (rb_str_tr):  Documented use of \ to escape characters.
-	  [ruby-trunk - Bug #6161]
-	* string.c (rb_str_count):  ditto
-
-Wed Apr 11 05:14:51 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/abbrev.rb:  Clarified that Abbrev.abbrev returns a Hash instead
-	  of an Array.  Patch by Andrei Bocan.  [ruby-trunk - Bug #6107]
-
-Wed Apr 11 03:02:24 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/ripper/lib/ripper/sexp.rb: fix spelling. patched by
-	  Jonathan Hinkle via https://github.com/ruby/ruby/pull/116
-
-Tue Apr 10 19:07:04 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_enc_raise): new function to raise an exception with
-	  the message in the given encoding.  patched by now (Nikolai
-	  Weibull) at [ruby-core:41160].  [Feature #5650]
-
-Tue Apr 10 18:19:32 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/http.rb (Net::HTTP#send_request_with_body_stream):
-	  use IO.copy_stream for requests using body_stream.
-	  patched by Eric Wong. [ruby-core:40898] [Feature #5605]
-
-Tue Apr 10 16:53:21 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread_pthread.c: add prototype declarations for older Mac OS X.
-	  [ruby-core:43376][Bug #6170]
-
-Tue Apr 10 15:35:21 2012  Koichi Sasada  <ko1@atdot.net>
-
-	* compile.c (iseq_set_sequence): show a hint if there are duplicated
-	  "when" clauses.  [ruby-core:41502] [ruby-trunk - Feature #5716]
-
-Tue Apr 10 09:57:00 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* string.c (rb_str_split_m):  Documented behavior of split on the empty
-	  string.  [ruby-trunk - Feature #3575]
-
-Tue Apr 10 09:48:31 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c (rb_deflate_s_deflate):  Fixed ruby example replacing
-	  NO_FLUSH with FINISH.  [ruby-trunk - Bug #6273]
-
-Mon Apr  9 23:10:26 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (isUNCRoot, winnt_stat): support long UNC.
-	  [ruby-core:30623][Feature #3399]
-
-Mon Apr  9 15:16:01 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (string_content, parser_yylex): count brace nesting to
-	  dispatch embexpr_end.  [ruby-core:43775][Bug #6211]
-
-Mon Apr  9 13:06:58 2012  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* hash.c (rb_hash_set_default_proc): Accept nil, patch by Run Paint
-	  [Feature #4234]
-
-	* test/ruby/test_hash.rb: test for above.
-
-Mon Apr  9 08:01:15 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_strftime.c: gets the value with range() consistetly.
-	* ext/date/date_strftime.c (range): now just replaces the given item.
-
-Mon Apr  9 06:58:01 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* complex.c (nucomp_expt): [ruby-core:44170].
-
-Mon Apr  9 02:52:03 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* complex.c (nucomp_expt): the result of f_complex_new2 may be a fixnum
-	  with mathn. [ruby-core:44170] [Bug #6267]
-
-Sun Apr  8 22:46:01 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json/generator/generator.c (generate_json_bignum):
-	  add RB_GC_GUARD.
-	  http://fb.rubyci.org/~chkbuild/ruby-trunk/log/20120407T210301Z.diff.html.gz
-
-Sun Apr  8 07:26:40 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/webrick/utils.rb (WEBrick::Utils::TimeoutHandler): get keys
-	  and fetch values from it to prevent @timeout_info's error
-	  "can't add a new key into hash during iteration".
-
-Sun Apr  8 06:51:57 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (io_unread): cast as long the value for extra_max.
-	  [ruby-core:44137] [Bug #6257]
-
-Sun Apr  8 06:46:48 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/webrick/httpresponse.rb (WEBrick::HTTPResponse#send_body_io):
-	  use readpartial to get data even if the response is streaming data and
-	  each data is smaller than @buffer_size.
-	  patched by yu nobuoka. [ruby-dev:45471] [Bug #6230]
-
-Sat Apr  7 22:35:36 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* include/ruby/win32.h (rb_w32_aspawn_flags): add the declaration of
-	  new function.
-
-	* process.c (enum): add EXEC_OPTION_PGROUP and move the position
-	  above for the usage in proc_spawn_n().
-
-	* process.c (proc_spawn_n): add an argument to pass new option
-	  `new_pgroup`. The option specifies CREATE_NEW_PROCESS_GROUP flag to
-	  CreateProcessW(). This flag is necessary for the usage of
-	  Process.kill on the subprocess on Windows.
-
-	* process.c (rb_exec_arg_addopt): ditto.
-
-	* process.c (rb_spawn_process): ditto.
-
-	* process.c (documentation for rb_f_spawn): add documentation for new
-	  option `new_pgroup` of spawn.
-
-	* test/ruby/test_process.rb (TestProcess#test_execopts_new_pgroup):
-	  add tests for option `new_pgroup`.
-
-	* test/ruby/test_thread.rb
-	  (TestThreadGroup#test_thread_timer_and_interrupt):
-	  add option `new_pgroup: true` to spawn on Windows. It's needed for
-	  Process.kill on a subprocess.
-
-	* win32/win32.c (CreateChild): add an argument to pass
-	  dwCreationFlags of CreateProcessW().
-
-	* win32/win32.c (rb_w32_spawn): ditto.
-
-	* win32/win32.c (rb_w32_aspawn_flags): add new function to pass
-	  dwCreationFlags.
-
-	* win32/win32.c (rb_w32_aspawn): refactor to move the content to
-	  rb_w32_aspawn_flags().
-	  [ruby-core:43245][Bug #6131]
-
-Sat Apr  7 22:32:00 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/ruby/test_thread.rb
-	  (TestThreadGroup#test_thread_timer_and_interrupt): skip on Windows.
-	  Process.kill cannot kill a subprocess if CREATE_NEW_PROCESS_GROUP
-	  flag is not specified in a call to CreateProcessW().
-
-	* win32/win32.c (CreateChild): revert the usage of
-	  CREATE_NEW_PROCESS_GROUP flag for compatibility.
-	  [ruby-core:43245][Bug #6131]
-
-Sat Apr  7 10:28:40 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: bumping up psych version to match release.
-	* ext/psych/psych.gemspec: ditto
-
-Sat Apr  7 02:07:00 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/parser.c: fall back to any encoding if the external
-	  encoding is wrong.  [ruby-core:44163]
-	* test/psych/test_encoding.rb: fix test
-
-Fri Apr  6 16:24:24 2012  Martin Duerst  <duerst@it.aoyama.ac.jp>
-
-	* struct.c (documentation for rb_struct_members_m):
-	  fix 'array of strings' to 'array of symbols'
-	  [ruby-core:44152][Bug #6264]
-
-Fri Apr  6 14:27:04 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* Makefile.in ($(LIBRUBY_A)): fix typo.
-
-Thu Apr  5 13:26:15 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* missing/alloca.c (xmalloc, xfree): use ruby version, not
-	  depending on RUBY_LIB_PREFIX.  [ruby-dev:45492][Bug #6255]
-
-Wed Apr  4 13:06:39 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/ftp/ftp.rb (Net::FTP#close): restore original read_timeout.
-
-Wed Apr  4 10:33:31 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/ftp/ftp.rb (Net::FTP#close): ignore exceptions from shutdown and
-	  read on closing.
-
-Wed Apr  4 01:48:35 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/ftp/ftp.rb (Net::FTP#close): close socket more gracefully.
-
-	* lib/ftp/ftp.rb (Net::BufferedSocket#shutdown): added.
-
-	* test/net/ftp/test_ftp.rb (FTPTest#create_ftp_server): wait socket
-	  with shutdown and read.
-
-Tue Apr  3 19:00:52 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/net/ftp/test_ftp.rb (FTPTest#create_ftp_server): should wait
-	  a little before closing socket because if the client call
-	  Net::FTP#getmultiline the socket is suddenly closed by the server in
-	  the getline loop.
-
-Tue Apr  3 18:33:38 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* process.c (setreuid, setregid): suppress warnings.
-	  [ruby-core:43374][Bug #6169]
-
-Tue Apr  3 10:18:27 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (inspect_enumerator): suppress uninitialized
-	  instance variable warnings.  [ruby-dev:45449][Bug #6214]
-	  patched by no6v (Nobuhiro IMAI).
-
-Mon Apr  2 13:25:08 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/optparse/ac.rb: autoconf-like options.
-
-Mon Apr  2 10:34:00 2012  eregon  <eregontp@gmail.com>
-
-	* string.c (rb_str_start_with, rb_str_end_with): raise an error if
-	  an argument is not convertible to a String.
-	  [ruby-core:40623][Bug #5536]
-
-Mon Apr  2 03:35:25 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/webrick/server.rb (WEBrick::GenericServer): close socket only if
-	  the socket is not closed yet.
-
-Sun Apr  1 23:03:18 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/ftp.rb (Net::BufferedSocket): should delegate send() to @io
-	  for Net::FTP#abort and Net::FTP#status.
-
-Sun Apr  1 00:41:56 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/ftp.rb: fixed the domain name in examples.
-
-Sat Mar 31 21:39:45 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/webrick/utils.rb (WEBrick::Utils::TimeoutHandler): dup to prevent
-	  @timeout_info's "can't add a new key into hash during iteration".
-
-Sat Mar 31 14:22:59 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (hash_default_value): extract from rb_hash_aref(), to be
-	  shared with rb_hash_shift(), so that overriding Hash#default
-	  will be respected.
-
-Sat Mar 31 14:16:02 2012  Sokolov Yura (funny-falcon)  <funny.falcon@gmail.com>
-
-	* hash.c: do not allocate st_table when it is not necessary.
-
-Sat Mar 31 13:42:39 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/ftp.rb (read_timeout=, open_timeout=): supported timeout.
-
-Sat Mar 31 13:20:40 2012  Sokolov Yura (funny-falcon)  <funny.falcon@gmail.com>
-
-	* hash.c: remove unnecessary checks for Qundef in hash iterations.
-	  since hash use st_foreach_check for iterations, such checks are
-	  needless.
-
-Sat Mar 31 12:05:01 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_x509cert.c: Fix doc typo.
-
-Sat Mar 31 10:13:24 2012  Sokolov Yura (funny-falcon)  <funny.falcon@gmail.com>
-
-	* st.c (st_foreach_check, st_foreach): remove ancient check.  This
-	  check are from initial ordered hash commit when first entry were
-	  created with entry->fore = entry->back = entry.
-
-	* st.c (st_delete): use real_entries in st_delete for packed tables
-
-Sat Mar 31 07:53:23 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c (st_foreach_check): remove the entry by replacing with never
-	  when ST_DELETE.
-
-	* hash.c (st_foreach_safe): since table is not for VALUE, Qundef is
-	  not special value, so use 0 instead.  therefore this function can be
-	  applied to only st_table which 0 is invalid as keys, e.g., IDs.
-
-	* hash.c: Qundef cannot be passed from st_foreach_check().
-
-	* hash.c, marshal.c, object.c, variable.c: fix callback argument types
-	  of iterators.
-
-Thu Mar 29 23:50:15 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c (st_update): pass pointer to key to the callback function.
-
-Thu Mar 29 16:36:10 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c (st_update): add existing parameter to the callback function.
-
-Thu Mar 29 16:35:32 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/test/unit.rb (terminal_width, del_status_line, put_status):
-	  extract as methods.
-
-Thu Mar 29 10:20:18 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_pkcs7.c: fix crash when parsing garbage data.
-	* test/openssl/test_pkcs7.rb: assert correct behavior for it.
-	  Thanks to Matt Venables for reporting the issue.
-	  [ruby-core:43250][Bug #6134]
-
-Thu Mar 29 10:16:05 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* thread_win32.c (TIME_QUANTUM_USEC): 10ms(= old setting) [experimental]
-	  cf. [Bug #6098]
-
-Thu Mar 29 10:12:12 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* thread.c (rb_threadptr_execute_interrupts_common): use defined
-	  TIME_QUANTUM_USEC instead of a magic number.  there is no meanings
-	  to use different values for checking interval of interruption and
-	  thread switching limits.
-	  cf. [Bug #6098]
-
-Thu Mar 29 09:26:17 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_x509cert.rb: exclude test that fails when issuing
-	  a certificate with RSA signature and DSS1 digest for earlier
-	  OpenSSL versions when used in conjunction with OpenSSL 1.0.1.
-	  Thanks, Vit Ondruch, for reporting the issue.
-	  [ruby-core:42949][Bug #6089]
-
-Thu Mar 29 08:25:35 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* NEWS: add note about unified behavior of encoding nil values in
-	  instances of OpenSSL::ASN1::ASN1Data.
-
-Thu Mar 29 07:45:36 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_asn1.c: raise TypeError when trying to encode nil
-	  values for Primitive instances.
-	* test/openssl/test_asn1.rb: Assert consistent behavior when
-	  encoding nil values: Primitives raise TypeError, Constructives
-	  raise NoMethodError.
-	  Fixes [ruby-core:43009][Bug #6102]
-
-Wed Mar 28 16:39:59 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* process.c (obj2uid, obj2gid): allow strings as input user/group id.
-	  [ruby-core:40923][Feature #5610]
-
-Wed Mar 28 15:06:18 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* marshal.c (r_symreal): default to ASCII-8BIT for non-ascii symbols,
-	  otherwise it should be converted to US-ASCII in rb_intern_str() if
-	  possible.  [ruby-core:43762][Bug #6209]
-
-Wed Mar 28 08:44:24 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: updating version to match gem
-	* ext/psych/psych.gemspec: ditto
-	* ext/psych/lib/psych/visitors/to_ruby.rb: fixing deprecation warning
-
-Tue Mar 27 23:44:11 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (io_unread): fixed memory leak.  report by nagachika via IRC.
-
-Tue Mar 27 22:44:23 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (verconf.h): separate load path specific stuff from
-	  config.h.
-
-Tue Mar 27 22:43:40 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/Makefile.sub: fix config.h path to include.
-
-Tue Mar 27 17:08:08 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* win32/win32.c (check_if_dir): fix memory leak.
-
-Tue Mar 27 13:13:51 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (str_new_empty): should copy also the encoding as an
-	  empty substring.  [ruby-dev:45441][Bug #6206]
-
-Mon Mar 26 23:43:04 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/ftp.rb (parse227, parse228, parse229): don't use $~.
-
-Mon Mar 26 23:34:40 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/ftp.rb (parse227, parse228, parse229): don't use local
-	  variables defined by named capture for other Ruby implementations
-	  such as Rubinius.
-
-Mon Mar 26 23:19:03 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/ftp.rb (parse_pasv_port): refactored.
-
-Mon Mar 26 19:49:49 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* test/net/ftp/test_ftp.rb: add the test, which was forgotten in the
-	  previous commit.
-
-Mon Mar 26 19:37:27 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/ftp.rb (parse227, parse228, parse229): refactored.
-
-Mon Mar 26 11:46:23 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (inspect_enumerator): show method arguments of
-	  lazy enumerators correctly.
-
-Mon Mar 26 13:51:23 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (check_if_dir, check_if_wdir): fix for Visual C++
-	  not to use S_ISDIR().  [Feature #2408][ruby-core:26925]
-
-	* ruby.c (load_file_internal): ditto.
-
-Mon Mar 26 11:46:01 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ruby.c (load_file_internal): bail out if the script is a directory.
-	  [Feature #2408][ruby-core:26925]
-
-	* win32/win32.c (rb_w32_open, rb_w32_wopen): check if the file is a
-	  directory when access denied, to set errno to EISDIR.
-
-Sun Mar 25 18:13:14 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* string.c (tr_setup_table): fix multiple non latin argument for
-	  non latin (over 256 characters) tr-like methods.
-	  [ruby-core:43371] [Bug #6167]
-
-Sun Mar 25 00:46:06 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator (lazy_initialize): set the instance variable "receiver"
-	  to include the receiver to the return value of inspect on a lazy
-	  enumerator directly created by Enumerator::Lazy.new.
-
-	* enumerator (RETURN_LAZY): don't set the instance variable "receiver".
-
-Sat Mar 24 23:59:00 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator (enumerator_inspect): include the original receiver and
-	  method name of Enumerator::Lazy in the result of inspect.
-	  [ruby-core:43345] [Bug #6159]
-
-	* enumerator (InitVM_Enumerator): don't use rb_define_alias for
-	  some methods such as collect in order to make rb_frame_this_func()
-	  return the correct method names.
-
-Sat Mar 24 22:22:18 2012  Sambasiva Rao Suda  <sambasivarao@gmail.org>
-
-	* time.c (time_init_1): Time.new will accept seconds as string or
-	  int.  [ruby-core:43569][Bug #6193]
-
-Fri Mar 23 15:12:12 2012  Martin Duerst  <duerst@it.aoyama.ac.jp>
-
-	* transcode.c (documentation for str_encode): Explain
-	  that transcoding to the same encoding is a no-op
-	  (i.e. no exceptions, no replacements,...).
-	  [ruby-core:43557][Bug #6190]
-
-Fri Mar 23 13:19:20 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bignum.c (rb_str_to_inum): must be ASCII compatible encoding as
-	  well as String#hex and String#oct.  [ruby-core:43566][Bug #6192]
-
-	* string.c (rb_must_asciicompat): check if ASCII compatible.
-
-Thu Mar 22 23:14:36 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* transcode.c (str_encode_bang, encoded_dup): if nothing was
-	  transcoded, just set encoding but leave coderange unchanged as
-	  force_encoding.  [ruby-core:43557][Bug #6190]
-
-Thu Mar 22 22:30:44 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* io.c (static int io_fflush): add the definition.
-	  Use it in set_binary_mode_with_seek_cur().
-
-	* io.c (set_binary_mode_with_seek_cur): refactoring to split the
-	  content into io_unread(). Fix the possibility of buffer overflow.
-
-	* io.c (io_unread): add new implementation for Windows. Previous one
-	  caused invalid cursor position using IO#pos with OS text mode. New
-	  one fixes the bug.
-
-	* test/ruby/test_io_m17n.rb
-	  (TestIO_M17N#test_pos_dont_move_cursor_position): add a test for
-	  above bug.
-	  [ruby-core:43497] [Bug #6179]
-
-Thu Mar 22 19:55:08 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (rb_w32_fstat, rb_w32_fstati64): convert FILETIME
-	  to time_t directly, not to be affected by TZ unnecessarily.
-
-	* win32/win32.c (unixtime_to_filetime): convert time_t to FILETIME
-	  simply.
-
-Thu Mar 22 13:43:31 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/openssl/ossl_pkey_rsa.c (rsa_generate): fix argument type.
-	  [Bug #6094]
-
-Thu Mar 22 11:14:10 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io.rb (TestIO#test_pos_with_getc): updated.
-	  see [ruby-core:43550]
-
-Wed Mar 21 17:57:57 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* regcomp.c: Merge Onigmo 3d855b30d574536d3ae600260208c6624ae4791c.
-	  [Bug#6143] [Bug#6144] [Bug#6145]
-
-Wed Mar 21 17:01:55 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io.rb (TestIO#test_pos_with_getc): added.
-	  see [Bug #6179][ruby-core:43518]
-
-Mon Mar 19 17:18:51 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_flat_map_func): convert the block value to
-	  Array if it doesn't respond to each.  [ruby-core:43334]
-	  [Bug #6155]
-
-Mon Mar 19 16:34:14 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enum.c (zip_i): variadic argument needs explicit cast on the
-	  platforms where VALUE is longer than int.
-
-Mon Mar 19 15:36:41 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (enumerable_lazy): add an example of take and first
-	  to the documentation.  [ruby-core:43344] [Bug #6158]
-	  add the description of the behavior when a block is given to zip
-	  or cycle.
-
-Mon Mar 19 15:20:53 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_specialized_instruction): DRY and replace chain
-	  of if-else with switch for special instructions.  based on a
-	  patch by Vasfed.  https://github.com/ruby/ruby/pull/105
-
-Mon Mar 19 15:05:54 2012  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* test/test_pty.rb: same as r29280, skip tests when PTY allocation
-	  failed (that's not our fault).
-
-Sun Mar 18 23:21:17 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (aligned_free): fix condition for free.  memalign() and
-	  posix_memalign() are not defined together normally.
-
-Sun Mar 18 18:31:45 2012  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* gc.c (aligned_malloc, aligned_free): added fallback implementations
-	  for platforms like OSX Leopard.
-
-Sun Mar 18 17:17:48 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bignum.c (rb_big_pow): estimate result bit size more precisely.
-	  [ruby-core:30735][Feature #3429]
-
-Sun Mar 18 17:17:36 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (free_method_entry_i): method entry may be in
-	  unlinked_method_entry_list.  [ruby-core:43383][Bug #6171]
-
-Sun Mar 18 15:27:31 2012  Tanaka Akira  <akr@fsij.org>
-
-	* compile.c: typo fix by Run Paint Run Run.
-	  [ruby-core:28368] [Bug #2824]
-
-Sun Mar 18 10:01:02 2012  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* lib/profiler.rb: support calling singleton methods of
-	  an instance of BasicObject.
-
-Sat Mar 17 06:56:58 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* object.c:  Fix indentation of Class#inherited example.
-
-Sat Mar 17 01:46:05 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* string.c (trnext): fix bug with string ending with '\\'.
-	  [ruby-dev:45374][Bug #6160]
-
-	* test/ruby/test_string.rb (TestString#test_delete): test for
-	  above.
-
-Fri Mar 16 20:06:24 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (trnext): should advance char-wise.
-	  [ruby-core:43335][Bug #6156]
-
-Fri Mar 16 17:42:05 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (block_append_gen): fix unreachable warning line number.
-	  should warn at the code, not jump.
-
-Fri Mar 16 17:33:08 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enum.c (enum_take): allocate buffer array before iteration, as well
-	  as enum_first did.
-
-	* enum.c (enum_first): remove duplication.
-
-Fri Mar 16 14:43:18 2012  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* load.c (ruby_init_ext): don't free the given pointer itself.
-	  It is not guaranteed even that the pointer is on heap.
-
-Fri Mar 16 14:37:57 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* vm_eval.c (rb_mod_module_eval): fix the documentation of
-	  class_eval to mention class variable lookup.  [ruby-core:40649]
-	  [Bug #5544]
-
-Fri Mar 16 14:27:11 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* vm_eval.c (rb_mod_module_eval): fix the documentation of
-	  class_eval to mention constant lookup.  [ruby-core:41718]
-	  [Bug #5777]
-
-Fri Mar 16 14:10:45 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (initialize): raise Net::IMAP::Error when the
-	  connection is closed without a greeting response.
-	  [ruby-core:40938] [Bug #5616]
-
-Fri Mar 16 13:50:12 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (rfc822_text): ignore [] after RFC822.
-	  [ruby-core:40945] [Bug #5620]
-
-Fri Mar 16 12:00:42 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (argument_error): use line number at the beginning
-	  of lambda, not the first code of its body.
-	  [ruby-core:43314][Bug #6151]
-
-	* iseq.c (rb_iseq_first_lineno): constified.
-
-Fri Mar 16 11:20:07 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_take): don't enumerate an extra value.
-	  [ruby-dev:45370] [Bug #6152]
-
-Fri Mar 16 06:30:10 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (lazy_zip_func): variadic argument needs explicit cast
-	  on the platforms where VALUE is longer than int.
-
-	* enumerator.c (lazy_init_iterator): no need to check overflow twice.
-
-Fri Mar 16 05:47:09 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* enumerator.c (lazy_init_iterator):  Fix type error (int vs long).
-
-Thu Mar 15 23:13:36 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enum.c (rb_enum_values_pack): rename from enum_values_pack, and
-	  remove static.
-
-	* enumerator.c (lazy_init_iterator, lazy_init_yielder,
-	  lazy_select_func, lazy_reject_func, lazy_grep_func): handle
-	  multiple values correctly.
-
-	* enumerator.c (lazy_grep): change the behavior when a block is
-	  given, to be consistent with Enumerable#grep.
-
-Thu Mar 15 19:12:31 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_zip): rescue StopIteration returned by
-	  Enumerator#next.
-
-Thu Mar 15 18:19:53 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_zip, lazy_cycle): Enumerator::Lazy#{zip,cycle}
-	  should be eager when a block is given, to be consistent with
-	  Enumerable#{zip,cycle}.
-
-Thu Mar 15 17:45:27 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (InitVM_Enumerator): renamed Enumerable::Lazy to
-	  Enumerator::Lazy.
-
-Thu Mar 15 16:37:38 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (enumerable_lazy): added cycle to the documentation.
-
-Thu Mar 15 15:37:42 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_yylex): fix warning line number.
-
-Thu Mar 15 15:19:38 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (lazy_cycle): check argument number overflow before
-	  creating temporary array.
-
-Thu Mar 15 15:04:54 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* util.c (ruby_strtod): no need to check same digit for hexdigit
-	  twice.  [ruby-dev:45363][Bug #6146]
-
-	* parse.y (sym_check_asciionly): check ascii compatibility before
-	  scanning for code range.
-
-	* parse.y (intern_str): set to us-ascii if ascii only.
-	  [ruby-dev:45363][Bug #6146]
-
-	* file.c (ruby_enc_find_basename): allow NULL as alllen.
-	  [ruby-dev:45363][Bug #6146]
-
-Thu Mar 15 14:49:31 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_conv_enc_opts): default to original encoding.
-
-Thu Mar 15 13:47:17 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* hash.c (env_str_new, rb_f_getenv, env_fetch): use rb_str_conv_enc()
-	  instead of rb_str_encode() to simplify the code.
-
-Thu Mar 15 12:44:50 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c, include/ruby/win32.h (rb_w32_ugetenv): new API to
-	  accept and to return UTF-8 strings.
-
-	* win32/win32.c (rb_w32_getenv): follow above change.
-
-	* win32/win32.c (rb_w32_get_environ): returns UTF-8 environment area.
-
-	* hash.c (env_str_new, rb_f_getenv, env_fetch): follow above changes.
-	  [Bug #5570] [ruby-core:40737]
-
-Thu Mar 15 10:57:27 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_cycle): add Enumerable::Lazy#cycle.
-
-Thu Mar 15 10:31:40 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/test_arity.rb (TestArity#err_mess): use assert_raise.
-
-Thu Mar 15 07:03:52 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* vm_eval.c (check_funcall):  Raise ArgumentError if respond_to?
-	  requires more than three arguments. [Bug #6000]
-
-	* test/ruby/test_object.rb (class TestObject):  Test for respond_to?
-	  requiring more than three arguments.
-
-Thu Mar 15 06:08:06 2012  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* include/ruby/intern.h: Add rb_check_arity, rb_error_arity [#6085]
-
-	* array.c: Use rb_check_arity / rb_error_arity
-
-	* class.c: ditto
-
-	* enumerator.c: ditto
-
-	* eval.c: ditto
-
-	* file.c: ditto
-
-	* hash.c: ditto
-
-	* numeric.c: ditto
-
-	* proc.c: ditto
-
-	* process.c: ditto
-
-	* random.c: ditto
-
-	* re.c: ditto
-
-	* signal.c: ditto
-
-	* string.c: ditto
-
-	* struct.c: ditto
-
-	* transcode.c: ditto
-
-	* vm_eval.c: ditto
-
-	* vm_insnhelper.c: ditto & implementation of rb_error_arity
-
-	* test/ruby/test_arity.rb: tests for above
-
-Thu Mar 15 06:08:05 2012  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* vm_insnhelper.c: improve number of arguments error in case of
-	  optional parameters (issue #6085)
-
-	* include/ruby/intern.h: define UNLIMITED_ARGUMENTS
-
-	* test/ruby/test_arity.rb:  test for above
-
-Thu Mar 15 00:58:04 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (enumerable_lazy): fix the documentation of
-	  Enumerable#lazy.
-
-Wed Mar 14 22:01:06 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_init_iterator): break when Qundef is returned
-	  to make obj.drop(3).take(2) work properly.
-
-	* enumerator.c (lazy_take_while): add Enumerable::Lazy#take_while.
-
-	* enumerator.c (lazy_drop): add Enumerable::Lazy#drop.
-
-	* enumerator.c (lazy_drop_while): add Enumerable::Lazy#drop_while.
-
-	* enumerator.c (InitVM_Enumerator): add Enumerable::Lazy#force as an
-	  alias of to_a.
-
-Wed Mar 14 19:28:40 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_take): add Enumerable::Lazy#take.
-
-Wed Mar 14 18:40:36 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c: use long for array indices.
-
-Wed Mar 14 18:25:18 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c: moved the comment of StopIteration.
-
-Wed Mar 14 17:55:29 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* numeric.c (flodivmod): must go through the same pass if HAVE_FMOD or
-	  not.  this is a bugfix of r35013.
-
-Wed Mar 14 16:41:55 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/test_tmpdir.rb (TestTmpdir#test_world_writable): skip on Windows.
-
-Wed Mar 14 15:09:23 2012  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* numeric.c: fix flodivmod for cornercases [Bug #6044]
-	  add ruby_float_mod
-
-	* insns.def (opt_mod): use ruby_float_mod
-
-	* internal.h: declare ruby_float_mod
-
-	* test/ruby/test_float.rb: tests for above
-
-	* test/ruby/envutil.rb: create helper assert_is_minus_zero
-
-Wed Mar 14 10:44:35 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (lazy_grep_func): should use === instead of =~, as
-	  well as Enumerable#grep
-
-Wed Mar 14 08:15:54 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_flat_map_func): use each for non-Array objects.
-
-Wed Mar 14 08:06:35 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_zip): add Enumerable::Lazy#zip.
-
-	* enumerator.c (lazy_lazy): just returns self.
-
-Wed Mar 14 07:48:36 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c (datetime_s_now): [ruby-core:43256].
-
-Tue Mar 13 22:00:14 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_set_arguments): keyword rest arg without keyword args.
-
-	* node.c (dump_node): dump kw_rest_arg too.
-
-	* parse.y (block_param, f_arg): more kwrest patterns.
-	  [ruby-core:42455][Bug #5989]
-
-	* parse.y (new_args_gen): no extra kw_rest_arg if no keyword rest arg.
-
-Tue Mar 13 15:17:03 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (block_param, f_args): add rules for the case arguments
-	  begin with kwrest.  [ruby-core:42455][Bug #5989]
-
-Tue Mar 13 12:37:53 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (io_encoding_set): always warn if external encoding and internal
-	  encoding are identical. [ruby-core:40727] [Bug #5568]
-
-Tue Mar 13 12:37:03 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c: add ObjectSpace::WeakMap.  [ruby-dev:44565][Bug #5350]
-
-	* lib/weakref.rb: use WeakMap instead of _id2ref.
-
-Tue Mar 13 10:59:48 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/rbinstall.rb (prepare): skip if basedir is not defined.
-	  [ruby-core:39135][Bug #5238]
-
-	* tool/rbinstall.rb (CONFIG.[]): check for mandatory
-	  configurations.
-
-Tue Mar 13 00:09:18 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (enumerable_lazy): added documentation.
-
-Mon Mar 12 20:19:25 2012  Tanaka Akira  <akr@fsij.org>
-
-	* lib/tmpdir.rb (Dir::tmpdir): test the current directory suitable for
-	  temporary directory.
-
-Mon Mar 12 20:08:16 2012  Tanaka Akira  <akr@fsij.org>
-
-	* lib/fileutils.rb (fu_have_symlink?): specify TypeError for rescue
-	  clause.
-
-Mon Mar 12 19:23:13 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (rb_find_encoding): new function find encoding from
-	  arbitrary object as a pointer to rb_encoding, and return NULL if
-	  not found.
-
-	* io.c (io_encoding_set): just warn unsupported encodings, but not
-	  exception.  [ruby-core:40726] [Bug #5567]
-
-Mon Mar 12 19:03:32 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_method.c (Init_eval_method): respond_to? and
-	  respond_to_missing? are public.
-
-Mon Mar 12 14:56:52 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* node.h (NEW_YIELD), parse.y (new_yield_gen): array-values flags
-	  has been already obsolete.  patch by Thomas Enebo.
-	  [ruby-core:41929][Bug #5847]
-
-Mon Mar 12 12:44:33 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_method.c (Init_eval_method): copy basic methods to Exception.
-	  [ruby-core:40287][Bug #5473]
-
-Mon Mar 12 10:13:36 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* eval_jump.c (rb_exec_end_proc): remember the latest exit status.
-	  [ruby-core:43173][Bug #5218]
-
-Mon Mar 12 07:33:12 2012  Tanaka Akira  <akr@fsij.org>
-
-	* lib/tmpdir.rb: update document for changing
-	  FileUtils.remove_entry_secure to FileUtils.remove_entry.
-
-	* NEWS: add incompatibility note for lib/tmpdir.rb.
-
-Mon Mar 12 07:19:03 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/tmpdir.rb (Dir.tmpdir): should not use world-writable but
-	  non-sticky directory.
-
-	* lib/tmpdir.rb (Dir.mktmpdir): check the parent directory.
-
-Mon Mar 12 07:04:11 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* random.c (Init_Random): removed rb_Random_DEFAULT and register as
-	  mark-object instead of global variable.
-
-Mon Mar 12 07:03:32 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* random.c (random_s_rand): ensure default PRNG is re-initialized
-	  after fork.  patched by Eric Wong.  [ruby-core:41209][Bug #5661]
-
-Sun Mar 11 23:57:29 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* pack.c (pack_unpack): when unpack('M') occurs an illegal byte
-	  sequence, output the "=" character and the following character in
-	  the decoded data without any transformation.
-	  [ruby-dev:44875] [Bug #5635]
-
-Sun Mar 11 22:32:43 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json: Merge 164a75c8bd2007d32c4d7665d53140d8fc126dcd.
-	  [ruby-core:41917] [Bug #5846]
-
-Sun Mar 11 17:10:04 2012  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb: Put error message into STDERR if failed to launch
-	  worker (job) process. [ruby-dev:44802] [Bug #5577]
-
-	* lib/test/unit/parallel.rb: If failed to increment_io, exit with code
-	  2. [ruby-dev:44802] [Bug #5577]
-
-Sun Mar 11 15:46:45 2012  Shota Fukumori  <sorah@tubusu.net>
-
-	* io.c: fix rdoc of `IO.binwrite` to show same as `IO.write` except
-	  it opens file with mode "wb:ASCII-8BIT". [Bug #5782] [ruby-core:42592]
-
-Sat Mar 10 23:52:28 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c: pack tables also generic keys.  patched by Sokolov Yura at
-	  https://github.com/ruby/ruby/pull/84
-
-	* st.c: add st_foreach_check for fixing iteration over packed table
-	  and st_delete_safe.  patched by Sokolov Yura at
-	  https://github.com/ruby/ruby/pull/84
-
-	* st.c: fix packed num_entries on delete_safe.  patched by Sokolov
-	  Yura at https://github.com/ruby/ruby/pull/84
-
-Fri Mar  9 14:29:32 2012  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* enumerator.c (lazy_flat_map): add Enumerable::Lazy#flat_map.
-
-Fri Mar  9 06:29:22 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb (load, parse): stop parsing or loading after
-	  the first document has been parsed.
-
-	* test/psych/test_stream.rb: pertinent tests.
-
-Fri Mar  9 06:17:05 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb (parse_stream, load_stream): if a block is
-	  given, documents will be yielded to the block as they are parsed.
-	  [ruby-core:42404] [Bug #5978]
-
-	* ext/psych/lib/psych/handlers/document_stream.rb: add a handler that
-	  yields documents as they are parsed
-
-	* test/psych/test_stream.rb: corresponding tests.
-
-Fri Mar  9 00:35:03 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (lazy_initialize, enumerable_lazy): no additional
-	  arguments.
-
-Fri Mar  9 00:30:23 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c: add Enumerable#lazy. based on the patch by
-	  Innokenty Mikhailov at <https://github.com/ruby/ruby/pull/101>
-	  [ruby-core:37164] [Feature #4890]
-
-Fri Mar  9 00:25:59 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enumerator.c (enumerator_each, generator_each): pass arguments to
-	  the block with yielder.
-
-Fri Mar  9 00:25:02 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_cat): new function to concat objects into array.
-
-Thu Mar  8 16:44:02 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* .gdbinit (rb_numtable_entry): update for recent refactoring of
-	  st_table.
-
-Wed Mar  7 22:41:50 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* lib/xmlrpc/client.rb (module XMLRPC): fix typo.
-
-	* test/xmlrpc/test_client.rb (test_async_call): add test for
-	  XMLRPC::Client#call_async to check above fix.
-
-Wed Mar  7 16:30:24 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_load_fail): should honor encoding.
-
-	* load.c (load_failed): ditto.
-
-Wed Mar  7 12:26:25 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_load_fail): use path as a string, not char*.
-
-	* internal.h: (rb_load_fail): moved from ruby/intern.h.
-
-	* ruby.c (load_file_internal): fname cannot be NULL.
-
-Wed Mar  7 08:32:43 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* error.c (rb_loaderror_with_path): Adding the missing file as an
-	  instance variable to the LoadError exception.
-	  [ruby-core:39079]
-
-	* load.c: call rb_loaderror_with_path so that the missing path is
-	  added to the exception.
-
-	* ruby.c: call rb_loaderror rather than raising our own LoadError
-	  exception.
-
-	* include/ruby/intern.h: add declaration for rb_loaderror_with_path.
-
-	* test/ruby/test_require.rb: add supporting test for LoadError#path
-	  method.
-
-Wed Mar  7 08:28:00 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/xmlrpc/parser.rb: support i8 types. Thanks Stas Kelvich!
-	  [ruby-core:29246] [Feature #3090]
-
-	* test/xmlrpc/test_client.rb: supporting test
-
-Wed Mar  7 07:43:29 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/xmlrpc/client.rb: assume servers that do not send a Content-Type
-	  header are sending 'text/xml'. Thanks Nathan Leavitt!
-	  [ruby-core:41204] [Bug #5660]
-
-	* test/xmlrpc/test_client.rb: supporting test
-
-Wed Mar  7 07:39:28 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* test/xmlrpc/test_client.rb: adding a test for performing an XMLRPC
-	  call.
-	* test/xmlrpc/data/blog.xml: supporting XML document for the response.
-
-Tue Mar  6 16:24:01 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_tokadd_string): escape simple regexp meta
-	  character terminators.
-
-Tue Mar  6 10:11:43 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/io/console/console.c (set_rawmode): clear ECHOE and ECHOK
-	  bits too.
-
-	* ext/io/console/console.c (echo_p): ignore ECHOE and ECHOK bits.
-	  [ruby-dev:45309] [Bug #6116]
-
-	* ext/io/console/console.c (console_raw): fix rdoc.
-
-	* ext/io/console/console.c (console_set_echo): mentioned about
-	  platform dependency.
-
-Tue Mar  6 07:18:10 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/xmlrpc/client.rb: switch net/http post2 calls to modern
-	  `request_post` methods.
-
-Tue Mar  6 02:31:20 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/core_ext.rb: only extend Kernel if IRB is loaded
-	  in order to stop method pollution.
-
-Tue Mar  6 01:34:19 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (block_call): rules for block_call after block_call.
-	  based on a patch by pasberth https://github.com/ruby/ruby/pull/102
-	  [ruby-dev:45308][Bug #6115]
-
-Tue Mar  6 01:24:13 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (block_command, block_call): simplified rules.
-
-Mon Mar  5 18:28:35 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* test/ruby/test_regexp.rb (TestRegexp#test_source): fix typo.
-	* test/ruby/test_regexp.rb (TestRegexp#test_equal): ditto.
-
-Mon Mar  5 17:11:44 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/syck/lib/syck/rubytypes.rb (Exception.yaml_new): fix bug
-	  that causes YAML serialization problem for Exception.
-	  Exception#initialize doesn't use visible instance variable for
-	  the exception message, so call the method with the message.
-	  patched by Jingwen Owen Ou <jingweno AT gmail.com>.
-	  http://github.com/ruby/ruby/pull/41
-
-Mon Mar  5 16:50:22 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_sleep.rb (TestSleep#test_sleep_5sec): syntax error.
-
-	* test/ruby/test_sleep.rb (TestSleep#test_sleep_5sec): call uname
-	  only on linux because it's a workaround for linux only.
-
-Mon Mar  5 12:44:12 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c (unpack_entries): chain entries directly.  based on a patch
-	  by Sokolov Yura <funny.falcon AT gmail.com>.
-
-	* st.c (unpack_entries): use union instead of casted pointer.
-	  patched by Sokolov Yura <funny.falcon AT gmail.com>.
-
-	* st.c: use PACKED_ENT and FIND_ENTRY.  patched by Sokolov
-	  Yura <funny.falcon AT gmail.com>.
-
-	* st.c (unpack_entries): reallocate bins if packed array size
-	  is not same as initial bins size.  based on a patch by
-	  Sokolov Yura <funny.falcon AT gmail.com>.
-
-Mon Mar  5 11:51:48 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/bigdecimal/lib/bigdecimal/math.rb: remove description about
-	  BigMath#log. patched by Sho Hashimoto [ruby-dev:45307] [Bug #6112]
-
-	* string.c (str_byteslice): fix typo.
-
-Sun Mar  4 23:21:10 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_tokadd_string): regexp engine doesn't need
-	  terminators to be escaped.  [ruby-core:40364][Bug #5484]
-
-Sat Mar  3 22:51:46 2012  Tanaka Akira  <akr@fsij.org>
-
-	* process.c (rb_run_exec_options_err): chdir at last to interpret
-	  relative pathnames from the current directory of the parent process.
-
-Sat Mar  3 12:20:44 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_strftime.c: reassigned some variables.
-
-Sat Mar  3 12:12:16 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_{parse,strptime}.c: [ruby-dev:45303].
-
-Sat Mar  3 10:09:21 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/xmlrpc/client.rb (initialize): net/http defaults to 1_2 in 1.8+,
-	  so we can safely remove the call to enable it.
-
-Sat Mar  3 08:42:25 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/xmlrpc/client.rb (new2): use URI for uri parsing.
-	* test/xmlrpc/test_client.rb: test that query params are passed to the
-	  client constructor.
-
-Sat Mar  3 08:20:10 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/xmlrpc/client.rb (new2): raises an ArgumentError on bad
-	  arguments.
-	* test/xmlrpc/test_client.rb: tests for bad uris
-
-Sat Mar  3 08:08:11 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/xmlrpc/client.rb (new2): fix custom port specification when an
-	  SSL uri is used.
-	* test/xmlrpc/test_client.rb: tests for XMLRPC::Client.new2
-
-Sat Mar  3 08:03:29 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/syck/rubyext.c (mktime_do): use ISDIGIT().
-	  [ruby-core:43060] [Bug #6108]
-
-	* ext/syck/token.c (sycklex_yaml_utf8): cast as unsigned char.
-	  [ruby-core:43060] [Bug #6108]
-
-Sat Mar  3 06:57:14 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (ruby_pc): make configurable.  [Bug #6051]
-
-Fri Mar  2 17:49:03 2012  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* .travis.yml (branches): Enable TravisCI for ruby_1_9_3.
-
-Fri Mar  2 17:13:33 2012  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* test/ruby/test_array.rb (test_combination2): Make the test case for
-	  [ruby-core:29240] more descriptive.
-	  cf. http://bugs.jruby.org/6518
-
-Fri Mar  2 16:37:11 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* file.c (file_expand_path): use wcscasecmp().
-
-Fri Mar  2 16:36:31 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread_pthread.c (native_cond_timeout): cast explicitly to suppress
-	  a warning.
-
-Fri Mar  2 16:35:56 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (pipe_open): cmd is no longer used if fork is available.
-
-Thu Mar  1 16:13:18 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* internal.h (rb_file_const, rb_file_load_ok): moved functions for
-	  internal use only.
-
-Thu Mar  1 15:40:05 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/makedirs.bat: new command to make intermediate
-	  directories, and not to report any errors if the directory
-	  already exists.
-
-	* win32/Makefile.sub (MAKEDIRS): enable command extensions.
-
-Thu Mar  1 01:25:43 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* regparse.c (is_onechar_cclass): optimize character class
-	  Merge Onigmo 27278c12e6674043cc8affca6507e20e119a86ee.
-
-	* regparse.c (is_onechar_cclass): [bug] unexpected match occurs when a
-	  char class contains no char
-
-	* enc/unicode.c (init_case_fold_table): define the sizes of case
-	  folding tables in casefold.h
-
-Wed Feb 29 16:11:34 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/Makefile.sub (MAKEDIRS): use mkdir of cmd.exe instead of ruby.
-	  [Bug #6103] [ruby-core:43012]
-
-	* win32/README.win32: added a notice about command extension of cmd.exe.
-
-Wed Feb 29 15:39:39 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io.rb (TestIO#test_readpartial_locktmp): skip on
-	  windows because of the platform restriction.
-
-Wed Feb 29 15:38:50 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/memory_status.rb (Memory): syntax error.
-
-Wed Feb 29 13:06:42 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/memory_status.rb: use /proc/self/status if it is in
-	  the expected format.
-
-Wed Feb 29 06:14:51 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: reverted r34825.
-
-Tue Feb 28 23:20:01 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* Makefile.in (PLATFORM_DIR): add a variable for `win32` directory.
-	* Makefile.in (clean-platform): add new target.
-	  It cleans `win32` directory.
-
-	* common.mk (clean): add a dependency for `win32` directory.
-	* common.mk (distclean): ditto.
-	* common.mk (distclean-platform): add new target.
-	  It cleans `win32` directory.
-	* common.mk ($(PLATFORM_D)): add new target to make `win32` directory.
-	* common.mk (win32/win32.$(OBJEXT)): move win32.o into `win32`
-	  directory.
-	* common.mk (win32/file.$(OBJEXT)): add new target for win32/file.c.
-
-	* configure.in: move win32.o into `win32` directory and add
-	  win32/file.o to MISSING.
-
-	* file.c (file_load_ok, rb_file_load_ok): replace static
-	  file_load_ok() with public rb_file_load_ok().
-	  It's to link Windows implementation in win32/file.c.
-	* file.c (rb_find_file_ext_safe): ditto.
-	* file.c (rb_find_file_safe): ditto.
-
-	* win32/file.c (rb_file_load_ok): new file. Add Windows specific
-	  optimized implementation of rb_file_load_ok(). We created a
-	  separated file to avoid too many #ifdef macro which is unreadable.
-
-	* win32/Makefile.sub (PLATFORM_DIR): add a variable for `win32`
-	  directory.
-	* win32/Makefile.sub (MISSING): move win32.obj into `win32`
-	  directory and add win32/file.obj to MISSING.
-	* win32/Makefile.sub (MAKEDIRS): replace MINIRUBY with BASERUBY.
-	  It's because miniruby doesn't exist when making `win32` directory.
-	* win32/Makefile.sub (clean-platform): add new target to clean `win32`
-	  directory.
-	* win32/Makefile.sub ({$(srcdir)}.c{}.obj): make it not match
-	  win32/file.c to build properly.
-	* win32/Makefile.sub (win32/win32.$(OBJEXT)): move win32.obj into
-	 `win32` directory.
-
-	  Patch created with Luis Lavena.
-	  [ruby-core:42480] [Feature #5999]
-
-Tue Feb 28 20:27:25 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: [ruby-core:42998]
-
-Tue Feb 28 18:47:44 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (io_binwrite, rb_io_syswrite): use shared frozen source
-	  strings.
-
-	* io.c (io_fread, io_getpartial, rb_io_sysread): set buffer size
-	  after check if readable, which can cause thread switch.
-	  [ruby-dev:45297][Bug #6099]
-
-Tue Feb 28 17:16:01 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/time.rb (Time#xmlschema): use strftime specifiers instead of
-	  fractional exponential calculation which yields undesirable
-	  result.  [ruby-core:42997][Bug #6100]
-
-Tue Feb 28 14:15:29 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/protocol.rb: Add OpenTimeout subclass of Timeout::Error
-	* lib/net/pop.rb:  Modernize Timeout usage.  Patch by Eric Wong.
-	  Use Net::OpenTimeout instead of Timeout::Error.  [Bug #5765]
-	* lib/net/http.rb:  ditto
-	* lib/net/smtp.rb:  ditto
-	* lib/net/telnet.rb:  ditto
-
-Tue Feb 28 13:51:12 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/http.rb:  Retry HTTP requests for additional network errors.
-	  Introduce OpenTimeout subclass of Timeout::Error.  [Bug #6001]
-	* test/net/http/test_http.rb:  Reduce timeout to 0.01s for faster test
-	* test/net/http/test_https.rb:  ditto
-
-Tue Feb 28 11:44:49 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (debugflags): check if -ggdb is accepted.
-	  [ruby-core:42875][Bug #6080]
-
-Tue Feb 28 10:28:51 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: default open YAML files with utf8 external
-	  encoding. [ruby-core:42967]
-	* test/psych/test_tainted.rb: ditto
-
-Mon Feb 27 23:46:09 2012  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* parse.y (opt_bv_decl): allow newline at the end.  [ruby-dev:45292]
-
-Mon Feb 27 20:43:05 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (rb_io_set_pos): add rdoc about textmode.
-
-	* test/ruby/test_io.rb (TestIO#test_setpos): use binmode.
-
-Mon Feb 27 17:00:15 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* string.c (rb_str_crypt): Update rdoc and state that this
-	  function is system dependent.  Reviewed by nobu, thanks to
-	  @takai.
-
-Mon Feb 27 17:03:20 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.c (GetVpValueWithPrec): since methods
-	  can be overridden, so should not make an assumption on the type
-	  of results.  [ruby-core:42969][Bug #6093]
-
-Mon Feb 27 10:54:20 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (try_cppflags, try_cflags, try_ldflags): replace the
-	  target flags if the given flag is accepted.
-
-Mon Feb 27 10:53:44 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/rubygems/test_gem_specification.rb (test_self_from_yaml_syck_default_key_bug):
-	  ignore the test for too old versions.
-
-Mon Feb 27 10:53:12 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/test/unit.rb (Test::Unit::Runner#puke): skips with no
-	  messages should be trivial.
-
-Mon Feb 27 10:50:23 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c, process.c, time.c, ext: use rb_sys_fail_str instead of
-	  rb_sys_fail.
-
-Mon Feb 27 10:48:49 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/openssl/extconf.rb: suppress useless deprecation warnings
-	  from OpenSSL added by Apple.
-
-Sun Feb 26 23:29:49 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* regparse.c (add_code_range_to_buf0): wrong condition of duplicated
-	  warnings.
-
-Sun Feb 26 11:26:44 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (iseq_compile_each): call on special object instead of
-	  self.  since stabby lambda is a syntax, so it should not be
-	  affected by the context.  [ruby-core:42349][Bug #5966]
-
-	* insns.def (send): no special deal for FCALL.  self should be put
-	  on TOS instead.
-
-Sun Feb 26 05:35:43 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* error.c (report_bug): use buf and snprintf to avoid consuming stack.
-	  [ruby-dev:45272] [Bug #6058]
-
-Sat Feb 25 17:41:19 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb (headers): try ambiguous headers at last.
-
-Sat Feb 25 17:07:15 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/fileutils.rb: use chomp(?/) instead of sub to optimize and avoid
-	  to regexping invalid string.
-
-Sat Feb 25 16:18:24 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* complex.c (nucomp_marshal_load): raise error on invalid data.
-	  reported by John Firebaugh [ruby-core:42860] [Bug #6076]
-
-Sat Feb 25 14:46:54 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/dl.c (Init_dl): support intrinsic types, size_t, ptrdiff_t
-	  and intptr_t.  [ruby-core:42460][Feature #5992]
-
-	* ext/fiddle/fiddle.c (Init_fiddle): ditto.
-
-	* ext/dl/lib/dl/cparser.rb (DL::CParser#parse_ctype): ditto.
-
-Sat Feb 25 11:08:28 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/curses.c (Init_curses): use rb_define_const once for
-	  Curses::VERSION.
-
-	* ext/dbm/dbm.c (Init_dbm): ditto for DBM::VERSION.
-
-Sat Feb 25 10:34:22 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/curses.c (Init_curses): make Curses::VERSION
-	  understandable without context.
-
-	* ext/dbm/dbm.c (Init_dbm): ditto for DBM::VERSION.
-
-Sat Feb 25 07:53:58 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_tokadd_string): insert a backslash only if
-	  quoted by single quotes.  [ruby-dev:45281] [Bug #6069]
-
-Sat Feb 25 07:53:49 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (dir_inspect), io.c (rb_io_inspect): keep encoding of path.
-	  [Bug #6072]
-
-Sat Feb 25 07:53:40 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (dir_initialize): keep path in original encoding.
-
-	* error.c (syserr_initialize): prefer the encoding of message over
-	  locale.  [ruby-dev:45279][Bug #6071]
-
-Sat Feb 25 06:55:29 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* file.c (utime_internal): fix a variable missed to replace.
-	  [ruby-core:42864] [Bug #6077]
-
-Fri Feb 24 18:21:55 2012  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* test/zlib/test_zlib.rb (TestZlibGzipReader#test_encoding): Add
-	  encoding testcases for GzipReader#read.  read() emits
-	  Encoding.default_external in contrast to read(size) emits BINARY.
-	  See also: http://bugs.jruby.org/6208
-
-Fri Feb 24 17:56:39 2012  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* test/ruby/test_literal.rb (TestRubyLiteral#test_special_const):
-	  test for https://bugs.php.net/bug.php?id=61095
-
-Fri Feb 24 16:48:29 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c, file.c, io.c (rb_sys_fail_path): use rb_sys_fail_str.
-
-	* error.c: new functions to deal exceptions with string instances.
-
-	* dir.c, file.c, io.c: use rb_sys_fail_path.
-
-Fri Feb 24 15:49:07 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (__builtin_unreachable): check for clang.
-	  [ruby-core:42849]
-
-	* include/ruby/ruby.h (UNREACHABLE): fallback definition.
-
-Fri Feb 24 13:54:33 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/parser.c: prevent a memory leak by protecting calls to
-	  handler callbacks.
-	* test/psych/test_parser.rb: test to demonstrate leak.
-
-Fri Feb 24 12:07:34 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* lib/net/http.rb: Fix documentation. Patched from Florian Mhun
-	  via http://github.com/ruby/ruby/pull/96
-
-Fri Feb 24 11:48:07 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* string.c (rb_str_prepend): Fix documentation for String#prepend.
-	  Patched from Franck Verrot via http://github.com/ruby/ruby/pull/98
-	  and Andrew Horsman via http://github.com/ruby/ruby/pull/55
-
-Fri Feb 24 10:08:33 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/http.rb (Net::HTTP#transport_request):  Fix infinite loop
-	  upon EOFError or Errno::ECONNRESET where count is reset to 0.
-	* test/net/http/test_http.rb (class TestNetHTTPKeepAlive):  Test for
-	  above.
-
-Fri Feb 24 09:05:40 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* complex.c (Init_Complex):  Document Complex::I.  Patch by Sylvain
-	  Daubert.  [Feature #5623]
-
-Fri Feb 24 08:52:09 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_tokadd_string, parser_yylex): insert a backslash
-	  if the next character is non-ascii.  [ruby-dev:45278] [Bug #6069]
-
-Fri Feb 24 08:13:20 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/profiler.rb:  Add Profiler documentation by Gonzalo Rodriguez.
-	  [Bug #5816]
-
-Fri Feb 24 08:08:38 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/parser.c: set parser encoding based on the YAML input
-	  rather than user configuration.
-	* test/psych/test_encoding.rb: corresponding tests.
-	* test/psych/test_parser.rb: ditto
-	* test/psych/test_tainted.rb: ditto
-
-Fri Feb 24 08:02:52 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* hash.c (Init_Hash):  Add section on how objects are used as Hash keys
-	  and how to use custom classes as Hash keys.
-
-Fri Feb 24 07:36:11 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* object.c (rb_obj_eql):  Improve equality documentation by adding an
-	  example of equal? vs == and recommending eql? be aliased to == when
-	  overridden.
-
-Fri Feb 24 07:21:15 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* object.c (rb_obj_hash):  Added note that the hash value is not
-	  deterministic on Marc-Andre's suggestion.  Expanded description of
-	  the purpose of the hash method.  [Bug #6068]
-
-Thu Feb 23 23:01:21 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: unused macro removed.
-
-Thu Feb 23 22:26:53 2012  Tanaka Akira  <akr@fsij.org>
-
-	* test/test_curses.rb: new file.
-
-Thu Feb 23 19:57:56 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/rain.rb: trap SIGHUP, SIGINT, SIGQUIT and SIGTERM only.
-
-Thu Feb 23 19:56:48 2012  Tanaka Akira  <akr@fsij.org>
-
-	* signal.c (sig_trap): show signal name on error.
-
-Thu Feb 23 12:21:48 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: use DBM_SUFFIX only to detect header of
-	  Berkeley DB.
-
-Thu Feb 23 10:00:18 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* io.c (rb_io_f_sync):  Fix double-negative typo.  [ruby-trunk - #5837]
-
-Thu Feb 23 09:57:21 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* load.c (rb_f_require):  Add note to require for scope of items in the
-	  loaded file.  [ruby-trunk - #5910]
-
-Thu Feb 23 03:58:08 2012  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* lib/ostruct.rb (delete_field): Bug fix so previous value is
-	  returned. Patch by Nick Recobra [Bug #6063]
-
-Thu Feb 23 02:33:00 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_io_extract_modeenc): fail only if conflicting
-	  text/binary modes given explicitly.  [ruby-dev:45268][Bug #6055]
-
-Wed Feb 22 23:27:08 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/iconv/test_option.rb: enabled.  [ruby-core:42802][Bug #6061]
-
-Wed Feb 22 21:45:56 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/curses.c: use defined() to suppress a warning.
-
-Wed Feb 22 21:44:29 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: refactored.
-
-Wed Feb 22 20:42:28 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: try to distinguish curses_version is a
-	  function or variable.
-
-	* ext/curses/curses.c (Init_curses): refine Curses::VERSION.
-
-Wed Feb 22 19:47:03 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: show the chosen header and library.
-
-Wed Feb 22 19:22:31 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* reverted 34739 for test/date.
-
-Wed Feb 22 19:08:55 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: refactored.
-
-Wed Feb 22 18:44:41 2012  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb (setup_options): add option "--retry" as opposite
-	  for "--no-retry"
-
-Wed Feb 22 18:34:02 2012  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb (setup_options): add option "--show-skip" to
-	  cancel "--hide-skip" (-q)
-
-Wed Feb 22 17:36:22 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_io_s_foreach): argument check before making Enumerator.
-	  [ruby-dev:31525]
-
-Wed Feb 22 17:07:35 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_io_s_foreach): return enumerator including kerword
-	  arguments.  [ruby-dev:45267][Bug #6054]
-
-Wed Feb 22 12:15:16 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* configure.in: allow llvm-gcc because it work fine with r34278.
-
-Wed Feb 22 10:57:08 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* regparse.c (fetch_token): don't use // comment.
-
-Wed Feb 22 10:32:11 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/mkmf/test_framework.rb: try CoreFoundation framework, than
-	  Cocoa which is dependent on QuickTime SDK which has separated
-	  since Xcode 4.3.
-
-Wed Feb 22 10:18:05 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* common.mk (test-all, test-ruby): more dependencies.
-
-Wed Feb 22 06:48:55 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* file.c (rb_f_test):  Fix formatting of Kernel#test rdoc.
-
-Wed Feb 22 06:12:15 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: check DBM_SUFFIX for Mac OS X.
-	  Its ndbm.h doesn't include db.h.
-
-Wed Feb 22 06:02:42 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/dbm.c (fdbm_initialize): disable Berkeley DB error messages.
-
-	* ext/dbm/extconf.rb: check DBC type for above.
-
-	[ruby-dev:45269]
-
-Tue Feb 21 20:23:47 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (rb_any_hash): treat Qundef like as other special constants.
-
-	* hash.c (hash_foreach_iter): fix signature.
-
-Tue Feb 21 19:39:34 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/curses.c (Init_curses): use curses_version() for
-	  Curses::VERSION.
-
-Tue Feb 21 18:21:25 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c : remove gc_clear_mark_on_sweep_slots() and use
-	  rest_sweep() instead of it, because some dead objects might be
-	  marked in next the mark phase by false pointers.
-	  [ruby-core:42672]
-
-Tue Feb 21 16:08:17 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (rb_hash_proc): get wrapped pointer properly.  [Bug #6048]
-
-Tue Feb 21 14:41:10 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* template/ruby.pc.in: added rubylibprefix, {rubylib,vendor,site}dir
-	  and {ruby,vendor,site}archdir.  [ruby-core:42766][Feature #6052]
-
-Tue Feb 21 09:13:25 2012  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* proc.c (method_hash, proc_hash): Fix {Unbound}Method#hash
-	  [Bug #6048]. Isolate hash computation for proc
-
-	* internal.h: Declaration for above
-
-	* vm_method.c (rb_method_definition_hash): Computation for
-	  hash part of a method definition
-
-	* method.h: Declaration for above
-
-	* test/ruby/test_method.rb: Test for above
-
-Tue Feb 21 02:56:15 2012  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* enumerator.c (enumerator_rewind): update the documentation.
-	  fixed: #6053
-
-Mon Feb 20 23:38:35 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* enc/depend: ignore mktable.c because it's not encoding library.
-	  [ruby-core:42760] [Bug #6049]
-
-Mon Feb 20 21:40:53 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: fold too long lines.
-
-Mon Feb 20 21:16:48 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* lib/fileutils.rb: revert a line modified accidentally at r34669.
-	  This fixes mingw test errors in TestDir_M17N.
-	  [ruby-core:42728] [Feature #4970]
-
-Mon Feb 20 21:09:27 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/curses.c (Init_curses): define Curses::VERSION.
-
-Mon Feb 20 21:08:00 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/curses/extconf.rb: restore $libs and $defs for each
-	  header/library choice.
-
-Mon Feb 20 19:57:26 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: weaken header/library consistency check if db is
-	  "ndbm".  It seems several (possibly historical) distributions
-	  provide libndbm.  However the content of libndbm vary: Berkeley DB,
-	  GDBM or even 4.3BSD NDBM.  (Mandriva, Tru64 UNIX, OpenSuSE,
-	  SCO OpenServer, ...)
-	  "ndbm" is not searched automatically now (dblib doesn't contain it)
-	  but configure --with-dbm-type=ndbm choose libndbm and ndbm.h.
-
-Mon Feb 20 19:15:57 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: refine variable names.
-
-Mon Feb 20 15:50:33 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: check if -fstack-protector is really available.
-
-Sun Feb 19 23:43:38 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: show header and library found.
-
-Sun Feb 19 23:01:01 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/dbm.c (Init_dbm): refine DBM::VERSION definition.
-
-	* ext/dbm/extconf.rb: provide RUBYDBM_GDBM_HEADER macro.
-
-Sun Feb 19 17:07:27 2012  Tanaka Akira  <akr@fsij.org>
-
-	* test/dbm/test_dbm.rb (test_dbmfile_suffix): check pag and dir is
-	  empty for 4.3BSD ndbm.
-
-Sun Feb 19 03:00:30 2012  Tanaka Akira  <akr@fsij.org>
-
-	* test/dbm/test_dbm.rb (test_dbmfile_suffix): check magic numbers.
-
-Sun Feb 19 01:05:41 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: detect GDBM's ndbm.h by testing dbm_clearerr is
-	  an empty macro.
-
-Sun Feb 19 00:25:55 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: don't choose 'dbm' if _GDB_H_ is defined which
-	  is available since GDBM 1.9 because 'gdbm_compat' is appropriate
-	  choice since GDBM 1.8.1.
-
-Sat Feb 18 23:27:00 2012  Kenta Murata  <mrkn@mrkn.jp>
-
-	* random.c: remove a duplicated comment.
-
-Sat Feb 18 18:43:13 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb (dblib): prefer recent GDBM over older GDBM.
-	  (have_declared_libvar): new function to check a declared variable
-	  exists in a library.
-	  (have_undeclared_libvar): renamed from renamed from have_libvar.
-	  (headers.db_check2): check that GDBM version variable if GDBM header
-	  is chosen.
-
-	* ext/dbm/dbm.c (Init_dbm): use HAVE_DECLARED_LIBVAR_GDBM_VERSION and
-	  HAVE_UNDECLARED_LIBVAR_GDBM_VERSION macro.
-
-Sat Feb 18 13:53:01 2012  Tanaka Akira  <akr@fsij.org>
-
-	* test/dbm/test_dbm.rb (test_dbmfile_suffix): DBM::VERSION should
-	  be Berkeley DB if foo.db is created by DBM.open.
-
-Sat Feb 18 13:40:37 2012  Tanaka Akira  <akr@fsij.org>
-
-	* test/dbm/test_dbm.rb (test_dbmfile_suffix): test dbm file suffix.
-
-Sat Feb 18 12:50:59 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/dbm.c (DBM::VERSION): define it by detecting _GDBM_H_ or
-	  _DBM_IOERR.
-
-Sat Feb 18 07:52:45 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/enc-unicode.rb: don't use 1.9 feature on tools.
-
-Sat Feb 18 02:48:39 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/fileutils.rb: refactored FileUtil methods to use the
-	  `define_command` API.  Patch from 7rans <transfire@gmail.com>
-	* test/fileutils/test_dryrun.rb: corresponding test refactoring
-	* test/fileutils/test_nowrite.rb: ditto
-	* test/fileutils/test_verbose.rb: ditto
-
-Fri Feb 17 21:39:36 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: remove dbm.
-
-Fri Feb 17 21:18:39 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: refine header/library mismatch detection.
-	  check only for ndbm.h except libc.  check _GDBM_H_ for gdbm.
-	  check _DBM_IOERR for the original ndbm.
-
-Fri Feb 17 20:30:44 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: don't check libdbm.  It is not a ndbm
-	  implementation.  (libdbm in Version 7 Unix is database library
-	  for single database per process.)
-
-Fri Feb 17 15:38:53 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* Merge Onigmo-5.13.1. [ruby-dev:45057] [Feature #5820]
-	  https://github.com/k-takata/Onigmo
-	  cp reg{comp,enc,error,exec,parse,syntax}.c reg{enc,int,parse}.h
-	  cp oniguruma.h
-	  cp tool/enc-unicode.rb
-	  cp -r enc/
-
-Fri Feb 17 15:20:30 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enum.c (enum_each_slice): arrays to be yielded can be newly
-	  created in the block.
-
-	* enum.c: move work variables to objects not to let called blocks
-	  access stack area out of scope.  [Bug #5801]
-
-Fri Feb 17 12:35:55 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/merger.rb: remove borders from the commit message which is used
-	  when the commit doesn't change ChangeLog.
-
-Fri Feb 17 11:50:11 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* common.mk (btest, btest-ruby, test-sample test-knownbugs)
-	  (test-all, test-ruby): depend on prog.
-
-Fri Feb 17 09:56:22 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (create_header): log the content of header.
-
-Fri Feb 17 09:44:55 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/transcode-tblgen.rb (import_ucm): don't use \h because the
-	  script should work with ruby 1.8.
-
-	* tool/enc-unicode.rb: ditto.
-
-Fri Feb 17 07:33:29 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* enum.c (id_lshift): use constant ID.
-
-Fri Feb 17 07:30:53 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: refactored to split too long conditions.
-
-Fri Feb 17 00:23:25 2012  Tanaka Akira  <akr@fsij.org>
-
-	* test/dbm/test_dbm.rb: fix skip condition for libgdbm 1.8.0 or prior.
-	  reported by Bohuslav Kabrda.
-	  [ruby-core:42685] [ruby-trunk - Bug #6036]
-
-Fri Feb 17 00:04:21 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: check _DB_H_ macro unavailable except
-	  Berkeley DB library.
-
-Thu Feb 16 05:41:35 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* insns.def (splatarray): make new array if flag is set.
-
-	* compile.c (iseq_compile_each): make new array with
-	  splat. [ruby-core:21901][Feature #1125]
-
-Thu Feb 16 00:14:04 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* lib/abbrev.rb (Array#abbrev): add missing '"' in documentation.
-
-Wed Feb 15 22:20:19 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* cont.c (rb_fiber_reset_root_local_storage): add a new function to
-	  restore rb_thread_t::local_storage.
-
-	* cont.c (rb_obj_is_fiber): add a new function to tell finalizer to
-	  prevent fibers from destroy.
-
-	* gc.c (rb_objspace_call_finalizer): don't sweep fibers at finalizing
-	  objspace.
-
-	* internal.h (rb_fiber_reset_root_local_storage, rb_obj_is_fiber):
-	  add prototypes.
-
-	* vm.c (ruby_vm_destruct): reset main thread's local_storage before
-	  free main thread. rb_thread_t::local_storage is replaced by fiber's
-	  local storage when forked from fiber, and it should be already freed
-	  when the fiber was destroyed. [ruby-core:41456] [Bug #5700]
-
-	* test/ruby/test_fiber.rb (test_fork_from_fiber): add test for fork
-	  from fiber.
-
-Wed Feb 15 19:57:02 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/fiddle/closure.c (callback): deal with unsigned integers.
-	  [ruby-core:42458][Bug #5991][Bug #6022]
-
-	* ext/fiddle/conversions.c (value_to_generic, generic_to_value):
-	  ditto.
-
-	* ext/fiddle/closure.c (callback): same as r34506.
-
-Wed Feb 15 17:41:31 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (io_strsetbuf): call rb_str_modify to make str independent
-	  before calling rb_str_set_len for r34580.
-
-Wed Feb 15 12:30:10 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c (Init_zlib):  Added Zlib::TEXT and note that
-	  Zlib::ASCII is deprecated in zlib 1.2.3 and newer.
-
-Wed Feb 15 12:24:40 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c:  Move constant descriptions to constants.  Remove
-	  extra comment block at the top of Init_zlib().
-
-Wed Feb 15 12:30:46 2012  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* lib/ostruct.rb: Create getters and setters after dup.
-	  [Bug #6028] [rubyspecs:0380bcc]
-
-Wed Feb 15 10:59:52 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (HEAP_BITMAP_LIMIT): HEAP_BITMAP_LIMIT is computed on the
-	  basis of HEAP_SIZE because it must covers a whole heap block.
-	  [ruby-trunk - Bug #6006]
-
-Wed Feb 15 09:27:45 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c (Init_zlib):  Added Zlib::FIXED and Zlib::RLE
-	  strategies.
-	* NEWS:  Add note about the new Zlib constants.
-
-Wed Feb 15 09:11:36 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c:  Improve documentation.  [ruby-trunk - Bug #5948]
-
-Wed Feb 15 07:28:54 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* encoding.c (Init_Encoding):  Add IO example of internal and external
-	  encoding.  Fixed a typo in the force_encoding example.  [#5949]
-
-Wed Feb 15 06:58:21 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* encoding.c (Init_Encoding):  Add Encoding documentation.
-	  [ruby-trunk - Bug #5949]
-	* encoding.c (rb_set_default_external):  Fix typo in documentation.
-
-Tue Feb 14 20:22:11 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (CEILDIV): rename to a appropriate name.
-
-Tue Feb 14 18:07:20 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (assign_heap_slot): SEGV happens cause on 64-bit platform
-	  sometime there should be `objs-=2` instead of `objs--`.
-	  [Bug #6006]
-	  patched by Sokolov Yura. https://github.com/ruby/ruby/pull/92
-
-Tue Feb 14 16:00:30 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (io_setstrbuf): cut down the buffer if longer.
-
-Tue Feb 14 15:06:37 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/test/unit/assertions.rb (build_message): skip escaped
-	  question marks.
-
-Tue Feb 14 12:10:04 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* variable.c (autoload_const_set, autoload_require): fix
-	  signatures.
-
-Tue Feb 14 05:23:40 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* process.c (proc_wait):  Change typo "SystemError" to
-	  "SystemCallError".  [ruby-trunk - Bug #5962]
-	* process.c (proc_wait2):  ditto
-
-Tue Feb 14 05:18:24 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* enumerator.c:  Document use of Enumerator.new for creating a lazy
-	  enumeration for filtering/chaining.  [ruby-trunk - Feature #707]
-
-Mon Feb 13 23:01:50 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* vm_method.c (rb_method_boundp):
-	  obj.respond_to?(:a_protected_method) should return false because
-	  calling a protected method may cause NoMethodError if called
-	  from outside the class inheritance tree.  Kernel#respond_to? is
-	  mostly used to test if it is safe to call a method, so the false
-	  positive should be avoided. [ruby-dev:40461] [ruby-dev:41739]
-	  [ruby-dev:41837]
-
-Mon Feb 13 21:52:06 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (HEAP_OBJ_LIMIT, HEAP_BITMAP_LIMIT): HEAP_OBJ_LIMIT used
-	  `sizeof(struct heaps_slot)` while heap is currently allocated
-	  with `struct heaps_header`.
-	  HEAP_BITMAP_LIMIT were calculated from
-	  `HEAP_OBJ_LIMIT/sizeof(uintptr_t)` - one Byte for each object,
-	  not one Bit. [Bug #6006]
-	  patched by Sokolov Yura. https://github.com/ruby/ruby/pull/92
-
-Mon Feb 13 18:30:32 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (io_setstrbuf): defer resizing buffer string until data is
-	  read actually.
-
-Mon Feb 13 10:24:39 2012  Loren Segal  <lsegal@soen.ca>
-
-	* io.c (Init_IO): use directive hack to make ARGF documentable
-	  in other tools.  [ruby-core:42515][Bug #6007]
-
-Sun Feb 12 20:43:54 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (rb_event_hook_func_t): add argument names.
-
-Sun Feb 12 16:30:23 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* tool/merger.rb (#default_merge_branch): Add support for
-	  Subversion 1.7 which adopted a whole new working directory
-	  structure.
-
-Sun Feb 12 15:14:41 2012  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* benchmark/driver.rb: suppress unused/shadowing variable warnings.
-
-Sun Feb 12 03:14:40 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* vm_eval.c (check_funcall):  Call respond_to? with matching arity for
-	  legacy single-argument implementations.  [ruby-trunk - Bug #6000]
-
-Sat Feb 11 12:04:05 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* compile.c (defined_expr): guard the whole expression.
-	  [ruby-dev:45021][Bug#5786]
-
-Sat Feb 11 08:34:42 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c (rb_inflate_add_dictionary):  Added
-	  Zlib::Inflate#add_dictionary to allow users to pre-specify
-	  for using during #inflate.  [ruby-trunk - Feature #5937]
-
-Sat Feb 11 08:23:02 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c (do_inflate):  Inflate more data if buffered data
-	  exists.  Allows Zlib::Inflate#set_dictionary to work.
-	  [ruby-trunk - Bug #5929]
-
-Sat Feb 11 06:00:48 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* dir.c (fnmatch): The * needs to be escaped to avoid formatting in
-	  fnmatch comment.
-	  patched by @dalton. https://github.com/ruby/ruby/pull/91
-
-Fri Feb 10 03:41:31 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/parser.c: removed external encoding setter, allow parser
-	  to be reused.
-	* ext/psych/lib/psych/parser.rb: added external encoding setter.
-	* test/psych/test_parser.rb: test parser reuse
-
-Fri Feb 10 01:30:41 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/dl.h (ALIGN_OF): use offsetof().
-
-	* ext/dl/dl.h (DLALIGN): round up at once and get rid of overflow.
-
-Fri Feb 10 00:47:07 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/envutil.rb (assert_no_memory_leak): new assertion to
-	  check memory leak by invoking child ruby process and watch its
-	  memory size.
-
-Thu Feb  9 23:41:44 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* test/pathname/test_pathname.rb (test_binread): add assertion to
-	  check encoding.
-
-Thu Feb  9 16:48:19 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/dl.c (Init_dl): fix mangled document.
-
-Thu Feb  9 16:10:34 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/memory_status.rb (Memory::Win32): 64bit support.
-
-Thu Feb  9 16:08:55 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/dl/lib/value.rb (DL::ValueUtil.{unsigned_value,signed_value}):
-	  currently pack/unpack does not accept "q!" and "Q!".
-
-Thu Feb  9 16:01:29 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/fiddle/conversions.c (value_to_generic): src is not guaranteed as
-	  a Bignum if the type is LONG_LONG.  it may be a Fixnum if the value
-	  is small.
-
-Thu Feb  9 11:32:36 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/dl/lib/types.rb: Win64 support.
-
-Thu Feb  9 04:12:29 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/pathname/test_pathname.rb: not read but binread.
-	  patched by Benoit Daloze, [ruby-core:42440] [Bug #5984]
-
-Wed Feb  8 22:29:59 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (rb_str_modify_expand): fix memory leak.
-
-Wed Feb  8 14:06:59 2012  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/openssl/ossl_ssl.c: Add SSL constants and allow to unset SSL
-	  option to prevent BEAST attack. See [Bug #5353].
-
-	  In OpenSSL, OP_DONT_INSERT_EMPTY_FRAGMENTS is used to prevent
-	  TLS-CBC-IV vulnerability described at
-	  http://www.openssl.org/~bodo/tls-cbc.txt
-	  It's known issue of TLSv1/SSLv3 but it attracts lots of attention
-	  these days as BEAST attack. (CVE-2011-3389)
-
-	  Until now ossl sets OP_ALL at SSLContext allocation and call
-	  SSL_CTX_set_options at connection.  SSL_CTX_set_options updates the
-	  value by using |= so bits set by OP_ALL cannot be unset afterwards.
-
-	  This commit changes to call SSL_CTX_set_options only 1 time for each
-	  SSLContext. It sets the specified value if SSLContext#options= are
-	  called and sets OP_ALL if not.
-
-	  To help users to unset bits in OP_ALL, this commit also adds several
-	  constant to SSL such as
-	  OpenSSL::SSL::OP_DONT_INSERT_EMPTY_FRAGMENTS.  These constants were
-	  not exposed in Ruby because there's no way to unset bits in OP_ALL
-	  before.
-
-	  Following is an example to enable 0/n split for BEAST prevention.
-
-	    ctx.options = OP_ALL & ~OP_DONT_INSERT_EMPTY_FRAGMENTS
-
-	* test/openssl/test_ssl.rb: Test above option exists.
-
-Wed Feb 8 13:12:02 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_x509name.c: Use the numerical representation of
-	  unrecognized OIDs instead of the sn "UNDEF".
-
-	* test/openssl/test_x509name.rb: Add tests for the fixed behavior.
-
-	  Patch provided by Paul Kehrer, thank you!
-	  [ruby-core:41769] [Feature #5787]
-
-Wed Feb  8 09:49:58 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/merger.rb: don't abort, update first.
-
-Wed Feb 8 09:47:33 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_asn1.c: Call INT2NUM only once for GeneralString.
-	  Thanks to Mantas Mikulenas for noticing and providing a patch!
-	  [ruby-core:42358] [Bug #5972]
-
-Wed Feb 8 09:19:00 2012  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_cipher.c: Add warning about key as IV.
-
-Tue Feb  7 20:08:12 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* error.c (exc_inspect): Fix typo. patch from Trent Ogren
-	  via https://github.com/ruby/ruby/pull/90
-
-Tue Feb  7 19:37:35 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c: refactor packed entries using structs.
-
-Tue Feb  7 14:52:10 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c (st_update): table can be unpacked in the callback.
-
-	* st.c (st_foreach): should not yield same pair when checking
-	  after unpacking.
-
-Mon Feb  6 21:55:13 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* tool/merger.rb: abort if the working directory is dirty.
-
-	* tool/merger.rb: update the working directory after commit.
-
-Mon Feb  6 00:16:27 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* encoding.c (rb_enc_compatible): return ASCII-8BIT even if 2nd string
-	  is ascii only string. [ruby-core:42354] [Bug #5968]
-
-Fri Feb  3 07:16:47 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/webrick.rb:  Moved proxy rewriting to WEBrick::HTTPProxy.
-	* lib/webrick/httpproxy.rb:  Add examples of creating a proxy server
-	  and response rewriting using HTTPProxy.
-
-Fri Feb  3 06:53:22 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/ossl_x509store.c:  Add class documentation for
-	  OpenSSL::X509::Store
-
-Thu Feb  2 22:28:13 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* test/net/http/test_https_proxy.rb
-	  (HTTPSProxyTest#test_https_proxy_authentication):
-	  add workaround to avoid to hang up without openssl.
-	  see [ruby-dev:45021][Bug #5786]
-
-	* test/resolv/test_dns.rb (TestResolvDNS#test_query_ipv4_address):
-	  ditto.
-
-Thu Feb  2 21:48:18 2012  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/parsers/baseparser.rb: use meaningful names.
-
-Thu Feb  2 21:38:52 2012  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/parsers/baseparser.rb, test/rexml/test_namespace.rb:
-	  fix the default xml namespace URI validation.
-	  [ruby-dev:45169] [Bug #5956]
-	  Reported by Miho Hiramatsu. Thanks!!!
-
-Thu Feb  2 17:51:02 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (argf_next_argv): reset ARGF.next_p on ARGV.replace.
-	  r34409 breaks replacing ARGV.
-	  [ruby-dev:45160] [Bug #5952]
-
-Thu Feb  2 16:21:01 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/net/http/test_http.rb (TestNetHTTPKeepAlive#*): remove debug
-	  output.
-
-Thu Feb  2 01:24:34 2012  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* parse.y (debug_lines, coverage): set file path encoding for coverage
-	  result.  [ruby-dev:44950]
-
-Wed Feb  1 14:38:31 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/tempfile.rb (Tempfile#unlink, Tempfile::Remover#call): Just
-	  call File.unlink and ignore ENOENT because existence check
-	  before unlinking does not help in terms of race condition.
-
-	* lib/tempfile.rb (Tempfile#unlink, Tempfile::Remover#call): My
-	  comment about thread safeness is obsolete.
-
-Wed Feb  1 09:50:10 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* doc/re.rdoc (Repetition): fix typo.  reported by Ori Avtalion
-	  and patched by Zachary Scott.  [Bug #5947]
-
-Wed Feb  1 06:38:54 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (argf_close): skip stdin, which should be readable again.
-	  [ruby-dev:45160] [Bug #5952]
-
-	* io.c (argf_readlines): reinitialize after all read to be
-	  readable again.
-
-Tue Jan 31 21:27:43 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* configure.in (HEAP_ALIGN_LOG): HEAP_ALIGN_LOG should be page
-	  size in OpenBSD. [ruby-core:42158][Bug #5901]
-
-	* gc.c : avoid to redefine.
-
-Tue Jan 31 14:27:22 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/envutil.rb (EnvUtil.invoke_ruby): yield also child pid
-	  in block form.
-
-Mon Jan 30 19:08:19 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (vm_call0): should pass block to enumerators.  patched
-	  by Kazuki Tsujimoto.  [ruby-dev:44961][Bug #5731]
-
-	* vm_eval.c (method_missing), vm_insnhelper.c (vm_call_method):
-	  ditto.  patched by satoshi shiba.
-
-Mon Jan 30 12:31:05 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* file.c (append_fspath): need to set the encoding to result always.
-
-Mon Jan 30 10:38:37 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/irb/test_completion.rb: skip if cannot load irb/completion
-	  (maybe readline does not exist).
-
-Sun Jan 29 22:47:19 2012  Yutaka Kanemoto  <kanemoto@ruby-lang.org>
-
-	* tool/config.{guess,sub}: updated to automake-1.11.2.
-
-Sun Jan 29 12:17:56 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/readline/readline.c (readline_attempted_completion_function):
-	  respect encodings.  [Bug #5941]
-
-Sat Jan 28 09:33:33 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* win32/win32.c (rb_w32_read): fix an issue that $stdin.read doesn't
-	  terminate by CTRL-C on Windows.
-	  [ruby-dev:45149] [Bug #5812]
-
-Sat Jan 28 08:18:11 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/ruby/test_thread.rb
-	  (TestThreadGroup#test_thread_timer_and_interrupt): skip exit status
-	  assertion because we cannot get signal status on Windows.
-
-	* win32/win32.c (CreateChild): create process group to receive the
-	  signal by GenerateConsoleCtrlEvent().
-
-	* win32/win32.c (kill): use CTRL_BREAK_EVENT instead of CTRL_C_EVENT
-	  if a process group is specified. CTRL_C_EVENT signal cannot be
-	  generated for process groups for the specification.
-	  [ruby-dev:45149] [Bug #5812]
-
-Sat Jan 28 07:46:03 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* thread_win32.c (rb_w32_wait_events_blocking): use
-	  ruby_thread_from_native() instead of GET_THREAD() because
-	  GET_THREAD() doesn't always return the current thread and
-	  WaitForMultipleObjects() at rb_w32_read() doesn't return by
-	  Thread#kill. This fixes TestQueue#test_thr_kill failure on
-	  Windows.
-
-	* thread_win32.c (rb_w32_wait_events): use ruby_thread_from_native()
-	  instead of GET_THREAD() for consistency with the above change.
-
-	* thread_win32.c (rb_w32_sleep): ditto.
-
-	* thread_win32.c (rb_w32_Sleep): ditto.
-	  [ruby-dev:45149] [Bug #5812]
-
-Sat Jan 28 07:28:48 2012  Hiroshi Shirosaki  <h.shirosaki@gmail.com>
-
-	* test/zlib/test_zlib.rb (TestZlibGzipReader#test_reader_wrap): set
-	  binmode explicitly for fixing test error on Windows. This is consistent
-	  with r34243.
-	  [ruby-dev:45149] [Bug #5812]
-
-Sat Jan 28 05:53:34 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/irb/completion.rb (IRB::InputCompletor::CompletionProc):
-	  ignore non-string name modules.  [ruby-core:42244][Bug #5938]
-
-Fri Jan 27 16:31:45 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (HEAP_ALIGN, HEAP_ALIGN_MASK): DRY, let compiler calculate
-	  from HEAP_ALIGN_LOG.
-
-Thu Jan 26 11:03:37 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/matrix.rb:  Clean up extra whitespace in output documentation.
-
-Thu Jan 26 03:24:02 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/io/console/console.c (io_getch): default delegating method
-	  for StringIO.  https://github.com/nobu/io-console/issues/4
-
-	* ext/stringio/stringio.c: moved some methods to hidden modules.
-
-Wed Jan 25 13:27:42 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* file.c (rb_file_s_basename): ignore non-ascii extension in
-	  different encoding, which cannot match.
-
-	* file.c (rmext): no extension to strip if empty string.
-
-	* file.c (rb_enc_path_next, rb_enc_path_skip_prefix)
-	  (rb_enc_path_last_separator, rb_enc_path_end)
-	  (ruby_enc_find_basename, ruby_enc_find_extname): encoding-aware
-	  path handling functions.
-
-	* file.c (rb_home_dir, file_expand_path, rb_realpath_internal)
-	  (rb_file_s_basename, rb_file_dirname, rb_file_s_extname)
-	  (rb_file_join): should respect the encodings of arguments than
-	  file system encoding.  [ruby-dev:45145] [Bug #5919]
-
-	* dir.c (check_dirname, ruby_glob0): ditto.
-
-	* ext/pathname/pathname.c (path_sub_ext): ditto.
-
-Tue Jan 24 14:20:42 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm.c (rb_iter_break_value): new function to break a block with
-	  the value.  [ruby-dev:45132] [Feature #5895]
-
-Tue Jan 24 12:58:41 2012  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* object.c (rb_Hash): add Kernel#Hash conversion method like
-	  Array() or Float().  a patch from Run Paint Run Run.  Fix #3131
-
-Tue Jan 24 11:38:05 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/uri/common.rb (URI.encode_www_form_component): initialize on
-	  requiring to support JRuby, which runs parallel multithreads.
-	  [ruby-core:42222] [Bug #5925]
-
-	* lib/uri/common.rb (URI.decode_www_form_component): initialize on
-
-Mon Jan 23 20:33:11 2012  Jason Kay  <geniture@me.com>
-
-	* lib/net/http.rb (Net::HTTP#connect): Writing entire packet at
-	  once to avoid incomplete transmission.  Current code using
-	  writeline was causing sub-optimal conversing with a proxy due to
-	  the connect tunnel request headers being split over multiple
-	  packets. The modification I made allows the connect request to
-	  be written as one packet, avoiding problems and optimizing the
-	  conversation.
-
-	  https://github.com/ruby/ruby/pull/72
-	  [Feature #5460]
-
-Mon Jan 23 17:06:17 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/uri/mailto.rb (URI::MailTo.build): follow Array#to_s change of
-	  Ruby 1.9; use Array#join. [Bug #5840]
-
-Mon Jan 23 16:42:28 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (extract_binmode): raise an exception if binmode/textmode
-	  is specified with both vmode and opthash.
-	  [ruby-core:42199] [Bug #5918]
-
-Mon Jan 23 16:35:27 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (rb_io_extract_modeenc): set ASCII-8BIT if binmode is specified
-	  with opthash. [ruby-core:42197] [Bug #5917]
-
-Mon Jan 23 10:08:00 2012  Kenta Murata  <mrkn@cookpad.com>
-
-	* test/cgi/test_cgi_util.rb (test_cgi_escape_preserve_encoding):
-	  add a test for CGI::escape to preserve encoding.
-
-	* test/cgi/test_cgi_util.rb (test_cgi_unescape_preserve_encoding):
-	  add a test for CGI::unescape to preserve encoding.
-
-Mon Jan 23 00:45:34 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/rdoc-mode.el (rdoc-imenu-create-index): Add imenu support
-	  to rdoc-mode.
-
-	* misc/rdoc-mode.el (rdoc-mode): Fix regexp patterns containing
-	  "\s " where CR/LF is not supposed to match.
-
-Sun Jan 22 15:41:26 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (rb_intern3): split to registration check and new
-	  registration.
-
-	* parse.y (rb_intern_str): make interned string shared with the
-	  given string.
-
-	* parse.y (rb_intern3, rb_intern_str): check the coderange first.
-
-Sat Jan 21 22:21:07 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (FIXNUM_P): simple flag should be int.
-
-Sat Jan 21 21:51:19 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* encoding.c (rb_enc_compatible): fix segv on symbols.
-	  [ruby-core:42204] [Bug #5921]
-
-Sat Jan 21 11:43:45 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* dir.c (dir_chdir, check_dirname): get rid of optimization-out.
-
-Fri Jan 20 20:47:37 2012  Kenta Murata  <mrkn@cookpad.com>
-
-	* lib/cgi/util.rb (CGI.escape): support a string with invalid byte
-	  sequence.  [Bug #5913]
-
-	* test/cgi/test_cgi_util.rb
-	  (test_cgi_escape_with_invalid_byte_sequence): test for the above
-	  change.
-
-Fri Jan 20 17:37:37 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm.c (vm_exec): remove workaround for LLVM because r34278 fixes it.
-
-	* vm_insnhelper.c (vm_call_cfunc): ditto.
-
-Fri Jan 20 14:31:43 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/http.rb (Net::HTTP#transport_request): retry a idempotent
-	  request automatically. [ruby-dev:45030] [Bug #5790]
-	  [ruby-core:41821] [Bug #5813]
-
-	* lib/net/http.rb (Net::HTTP#keep_alive_timeout=): added to specify
-	  the second to reconnect the TCP connection on Keep-Alive.
-	  The default value is 2 second because current servers uses 2 sec.
-	  http://ftp-admin.blogspot.com/2009/09/keepalivetimeout2.html
-
-	* lib/net/http.rb (Net::HTTP#begin_transport): reconnect TCP
-	  connection on keep-alive timeout.
-
-Thu Jan 19 07:53:09 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_strptime.c: moved detector of leftover.
-
-Thu Jan 19 07:10:47 2012  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_parse.c: [ruby-core:42173].
-
-Wed Jan 18 18:11:02 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* misc/rdoc-mode.el (rdoc-mode): Add provide so that requiring
-	  this library succeeds.
-
-Wed Jan 18 18:06:45 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/curses/curses.c (cWindow, cMouseEvent): made typed data.
-
-Wed Jan 18 12:49:15 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/to_ruby.rb: Added support for loading
-	  subclasses of String with ivars
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: Added support for dumping
-	  subclasses of String with ivars
-	* test/psych/test_string.rb: corresponding tests
-
-Wed Jan 18 10:39:47 2012  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/to_ruby.rb: Added ability to load array
-	  subclasses with ivars.
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: Added ability to dump
-	  array subclasses with ivars.
-	* test/psych/test_array.rb: corresponding tests
-
-Tue Jan 17 17:18:41 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (SPT_TYPE): enable as SPT_REUSEARGV on Darwin.
-
-	* missing/setproctitle.c (ruby_init_setproctitle): changed prefix.
-
-Tue Jan 17 12:32:46 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (aligned_malloc, aligned_free): covered missing defined
-	  operators and fixes for cygwin.
-
-Tue Jan 17 10:54:46 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c (do_hash): it's the time to remove cast to unsigned int.
-
-Tue Jan 17 07:30:12 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* st.c (unpack_entries): Fix r34310: on unpacking, the position of
-	  a hash must be do_hash-ed value.
-
-	* st.c (add_packed_direct): ditto.
-
-Mon Jan 16 16:41:53 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/optparse.rb (Regexp): fix incorrect options when casting to
-	  a Regexp, and suppress encoding option warnings.
-	  https://github.com/ruby/ruby/pull/82
-
-Mon Jan 16 11:22:38 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (rb_chsize): no need to get the current file size.
-
-Mon Jan 16 00:41:33 2012  Sokolov Yura  <funny.falcon@gmail.com>
-
-	* st.c: st use function instead of macro.  In my current
-	  environment (Ubuntu 11.04 32bit gcc-4.5.2) it gives 4%
-	  performance improvement.
-
-	  https://github.com/ruby/ruby/pull/77
-
-Sun Jan 15 14:09:48 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* object.c (rb_inspect): raise the result is not compatible with
-	  the default external encoding. [ruby-core:42095] [Bug #5848]
-	  If the default external encoding is ASCII compatible, the encoding of
-	  inspected result must be compatible with it.
-	  If the default external encoding is ASCII incompatible,
-	  the result must be ASCII only.
-
-Sun Jan 15 13:21:50 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json/parser/parser.rl (json_string_unescape): workaround fix
-	  for over optimization of GCC 4.7. [ruby-core:42085] [Bug #5888]
-	  http://gcc.gnu.org/bugzilla/show_bug.cgi?id=51862
-
-Sat Jan 14 22:24:09 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/callback/mkcallback.rb (gencallback): suppress unused
-	  variables.
-
-Sat Jan 14 21:56:43 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* iseq.c (iseq_data_to_ary): check line info table boundary.  line
-	  number 0 means no line number info is needed.  [ruby-dev:45130]
-	  [Bug #5894]
-
-Sat Jan 14 18:24:13 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* error.c (exc_equal): clear rb_thread_t::errinfo when ignore
-	  an exception under rb_protect(). [ruby-core:41979] [Bug #5865]
-
-Sat Jan 14 12:02:55 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* sprintf.c (rb_enc_vsprintf): relaxed the restriction.  since the
-	  implementation deeply depends on plain char, so wchar_t based
-	  encodings are not supported.
-
-Sat Jan 14 12:00:20 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (exc_equal): ignore exceptions during implicit
-	  conversion.  [ruby-core:41979] [Bug #5865]
-
-Sat Jan 14 05:58:54 2012  Eric Hodel  <drbrain@segment7.net>
-
-	* io.c (rb_io_s_read):  Fix formatting of open_args comment.  Reported
-	  by Adam Prescott.
-
-Fri Jan 13 18:41:19 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* sprintf.c (rb_enc_vsprintf): can be used for ASCII compatible
-	  encodings only.
-
-Fri Jan 13 18:29:06 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread.c (rb_mutex_unlock_th): simplified.
-
-	* thread.c (rb_barrier_waiting): fix potential overflows.
-
-Fri Jan 13 17:23:38 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (load_unlock): update loading table at once.
-
-Fri Jan 13 16:44:45 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (exc_equal): try implicit conversion for delegator.
-	  [ruby-core:41979] [Bug #5865]
-
-Fri Jan 13 03:46:53 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/shellwords.rb (Shellwords#shellescape): shellescape() now
-	  stringifies the given object using to_s.
-
-	* lib/shellwords.rb (Shellwords#shelljoin): shelljoin() accepts
-	  non-string objects in the given array, each of which is
-	  stringified using to_s.
-
-	* lib/shellwords.rb: Fix rdoc markups.
-
-Fri Jan 13 03:38:36 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/shellwords.rb (Shellwords#shellsplit): Fix a bug where
-	  consecutive backslashes in double quotes are all removed except
-	  the one at the tail.
-
-Fri Jan 13 03:28:00 2012  Luis Lavena  <luislavena@gmail.com>
-
-	* ext/socket/extconf.rb (if ipv6): only define _WIN32_WINNT if was not
-	  previously defined. This solve warnings with multiple defines in
-	  command line with GCC 4.6.1
-
-Thu Jan 12 18:44:31 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb: fix r33904 and revert r33905.  initialize global
-	  variables with init_mkmf before initializing constants.
-	  [ruby-dev:45124] [Bug #5879]
-
-Thu Jan 12 13:51:00 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* cont.c (cont_restore_0): prevent optimizing out `sp'. sp is used for
-	  reserving a memory space with ALLOCA_N for restoring machine stack
-	  stored in cont->machine_stack, but clang optimized out it (and
-	  maybe #5851 is also caused by this).
-	  This affected TestContinuation#test_check_localvars.
-
-	* cont.c (cont_restore_1): revert workaround introduced in r32201.
-
-Thu Jan 12 02:14:43 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* object.c: Added examples for Object#is_a? and
-	  Object#instance_of? patched from Manoj Kumar.
-	  [Bug #5880] [ruby-core:42057]
-
-Thu Jan 12 00:57:48 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* lib/mkmf.rb: verbose-mode can use by RM, RMDIRS, etc.
-	  (e.g. make V=1 realclean)
-
-Wed Jan 11 23:40:21 2012  Naohisa Goto  <ngoto@gen-info.osaka-u.ac.jp>
-
-	* string.c (rb_str_concat): set array element after definition
-	  to fix compile error with Fujitsu C Compiler 5.6 on Solaris 10
-	  on Sparc.  [Bug #5878] [ruby-dev:45123]
-
-Wed Jan 11 22:52:51 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* gc.c (ruby_mimmalloc): don't set allocated size to header.
-	  ruby_mimmalloc() doesn't increment allocated_size/allocations and
-	  decrement them in ruby_xfree() cause inconsistency.
-
-	* gc.c (ruby_xfree): don't decrement allocated_size/allocations if
-	  allocated size record is 0.
-
-Wed Jan 11 22:36:43 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* test/readline/test_readline.rb (test_completion_proc_empty_result):
-	  ensure clearance of Readline's line_buffer after the test.
-
-Tue Jan 10 21:57:38 2012  Hiroshi Shirosaki <h.shirosaki@gmail.com>
-
-	* ext/dbm/dbm.c (Init_dbm): fix a build error on mswin32.
-	  use `extern __declspec(dllimport)` for dll link with VC.
-	  [ruby-core:41996] [Bug #5869]
-
-Tue Jan 10 15:31:55 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm.c (vm_exec): refix r34162; suppress warning and add description.
-
-Tue Jan 10 15:13:58 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/readline/readline.c (readline_attempted_completion_function):
-	  use rb_memerror().
-
-Tue Jan 10 12:49:42 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c: in fact, i686-linux doesn't need to define _XOPEN_SOURCE 600.
-
-Tue Jan 10 12:44:11 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c (ruby_mimmalloc): defined for objects need not rb_objspace,
-	  but should return pointer suitable for ruby_xfree;
-	  main vm and main thread.
-	  patched by Sokolov Yura. https://github.com/ruby/ruby/pull/79
-
-	* internal.h: ditto.
-
-	* vm.c (Init_BareVM): use ruby_mimmalloc.
-
-	* ext/dl/cfunc.c: #include <ruby/util.h>.
-
-	* ext/syslog/syslog.c: use xfree because it is allocated by
-	  ruby_strdup.
-
-Tue Jan 10 12:13:56 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* ext/readline/readline.c (readline_attempted_completion_function):
-	  fix compile error.
-
-Tue Jan 10 10:41:11 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/readline/readline.c (readline_attempted_completion_function):
-	  empty completion result does not mean memory error.
-
-Tue Jan 10 02:19:22 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* test/ruby/test_io.rb (test_autoclose_true_closed_by_finalizer,
-	  test_autoclose_true_closed_by_finalizer): skip if IO objects are
-	  not recycled yet. [ruby-dev:45098] [Bug #5850]
-
-Tue Jan 10 00:41:28 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* lib/tempfile.rb (Tempfile#_close): clear @tempfile and @data[1] even
-	  when exception is raised at @tempfile.close. [ruby-dev:45113]
-
-	* lib/tempfile.rb (Tempfile#unlink): fix a typo.
-
-Tue Jan 10 00:32:17 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* gc.c (run_finalizer): clear rb_thread_t::errinfo when ignore
-	  an exception under rb_protect(). [ruby-dev:45113]
-
-Mon Jan  9 23:37:43 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* ext/readline/readline.c (readline_attempted_completion_function):
-	  fix typos.
-
-Mon Jan  9 20:55:34 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c : don't embed struct heaps_slot to a heap block because it
-	  can causes copy-on-write of memory page on heap block when its
-	  free_next is rewritten.
-
-Mon Jan  9 20:26:33 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/pathname/pathname.c (path_entries): add document suggested by
-	  the thread [ruby-core:41959] [Bug #5859].
-
-Mon Jan  9 20:14:13 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/lib/socket.rb (family_addrinfo): don't require protocol
-	  equality.  For example, protocol 0 and IPPROTO_TCP is not problem
-	  for TCP.
-
-Mon Jan  9 20:08:52 2012  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/lib/socket.rb (family_addrinfo): return the given
-	  addrinfo object.
-	  Patch by Ippei Obayashi.  [ruby-dev:45095] [Bug #5845]
-
-Mon Jan  9 19:40:20 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/zlib/test_zlib.rb (TestZlibGzipWriter#test_writer_wrap): set
-	  binmode explicitly.
-
-Mon Jan  9 14:42:41 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c: free_slots is changed Singly linked list. clear
-	  free_slots before sweep.
-
-Mon Jan  9 07:46:17 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c: i686-linux needs to define _XOPEN_SOURCE 600 for posix_memalign.
-
-Mon Jan  9 04:24:59 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c (rb_objspace_free): global_List is allocated with xmalloc.
-	  patched by Sokolov Yura.  https://github.com/ruby/ruby/pull/78
-
-	* dln_find.c: remove useless replacement of free.
-
-	* ext/readline/readline.c (readline_attempted_completion_function):
-	  strings for readline must allocated with malloc.
-
-	* process.c (run_exec_dup2): use free; see also r20950.
-
-	* re.c (onig_new_with_source): use malloc for oniguruma.
-
-	* vm.c (ruby_vm_destruct): use free for VMs.
-
-	* vm.c (thread_free): use free for threads.
-
-Mon Jan  9 04:24:59 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* dln_find.c: remove useless replacement of free.
-
-	* ext/readline/readline.c (filename_completion_proc_call):
-	  matches should use xfree.
-
-	* ext/readline/readline.c (username_completion_proc_call): ditto.
-
-Mon Jan  9 01:12:35 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* numeric.c (rb_enc_uint_char): raise RangeError when added codepoint
-	  is invalid. [Feature #5855] [Bug #5863] [Bug #5864]
-
-	* string.c (rb_str_concat): ditto.
-
-	* string.c (rb_str_concat): set encoding as ASCII-8BIT when the string
-	  is US-ASCII and the argument is an integer greater than 127.
-
-	* regenc.c (onigenc_mb2_code_to_mbclen): rearrange error code.
-
-	* enc/euc_jp.c (code_to_mbclen): ditto.
-
-	* enc/shift_jis.c (code_to_mbclen): ditto.
-
-Sun Jan  8 20:31:45 2012  Narihiro Nakamura  <narihiro@netlab.jp>
-
-	* gc.c : consider header bytes which are used by malloc.
-
-Sun Jan  8 11:54:43 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (aligned_free): support MinGW. Patch by Hiroshi Shirosaki.
-
-Sun Jan  8 11:43:05 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (slot_sweep): add a assertion instead of a debug print.
-
-Sun Jan  8 01:18:19 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/-ext-/old_thread_select/test_old_thread_select.rb:
-	  avoid platform bug. [Bug #5858] [ruby-dev:45108]
-
-Sun Jan  8 00:46:34 2012  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* gc.c: get rid of implicit narrowing conversion.
-
-Sun Jan  8 00:10:10 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* configure.in: check posix_memalign(3) and memalign(3).
-
-	* gc.c (aligned_malloc): use configure's result instead of
-	  _POSIX_C_SOURCE and _XOPEN_SOURCE because they can't be used
-	  to check availability at least on FreeBSD.
-
-Sat Jan  7 22:25:50 2012  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c: use Bitmap Marking algorithm to avoid copy-on-write of
-	  memory pages. See [ruby-dev:45085] [Feature #5839]
-	  [ruby-core:41916].
-
-	* include/ruby/ruby.h : FL_MARK rename to FL_RESERVED1.
-
-	* node.h : ditto.
-
-	* debug.c : ditto.
-
-	* object.c (rb_obj_clone): FL_MARK move to a bitmap.
-
-	* class.c (rb_singleton_class_clone): ditto.
-
-Sat Jan  7 00:47:07 2012  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* configure.in: always define CANONICALIZATION_FOR_MATHN.
-	  [ruby-dev:45100] [Bug #5852]
-
-Fri Jan  6 23:11:20 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* include/ruby/version.h: RUBY_API_VERSION 2.0.0
-
-Fri Jan  6 12:24:11 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* object.c (rb_inspect): raises Encoding::CompatibilityError if the
-	  result is incompatible with the default external encoding.
-	  [ruby-core:41931] [Bug #5848]
-
-Thu Jan  5 15:26:15 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (check_valid_dir): strict checking of root.
-	  GetDriveType() succeeds with non root directory as the argument,
-	  even if MSDN says that the API needs the root directory.
-	  this patch fixes a failure of test/ruby/test_file_exhaustive.rb.
-
-Thu Jan  5 12:15:55 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* file.c (rb_file_join): separator is appended by array length - 1
-	  times. patched by Benoit Daloze [ruby-core:41901] [Bug #5841]
-
-Thu Jan  5 11:47:54 2012  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/uri/common.rb (URI::Parser#initialize_regexp):
-	  use \A \z instead of ^ $. [Bug #5843]
-
-Wed Jan  4 17:55:53 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* array.c (rb_ary_sample): add example for Array#sample
-	  based on patch from https://github.com/ruby/ruby/pull/74
-
-Wed Jan  4 14:24:33 2012  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* string.c (str_nth_len): count ascii-only run at the end.  this
-	  bug appears only when single-byte-optimization is disabled due
-	  to unknown coderange.  [ruby-core:41896] [Bug #5836]
-
-Wed Jan  4 11:32:07 2012  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (check_valid_dir): special case for a root directory.
-	  Reported by Masateru OKAMOTO at [Bug #5819].
-
-Wed Jan  4 00:19:54 2012  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/parsers/baseparser.rb: use private instead of _xxx
-	  method name. This is Ruby code not Python code.
-	  refs #5696
-
-Tue Jan  3 23:57:37 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* lib/rexml/parsers/baseparser.rb: rexml BaseParser uses
-	  instance_eval unnecessarily on listener add.
-	  patch from Charles Nutter. [Bug #5696] [ruby-core:41437]
-
-Tue Jan  3 20:44:13 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* README: add comment for Git user. patch from Arun Agrawal.
-	* README.ja: ditto.
-
-Tue Jan  3 15:58:22 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* thread.c: changed documentation for "thread-local" variables.
-	  patch from Julien Ammous.
-
-Tue Jan  3 15:50:12 2012  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* process.c: Fix typo. patch from Aviv Ben-Yosef.
-
-Tue Jan  3 13:43:37 2012  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* tool/merger.rb: allow r0123 style revision number.
-
-Tue Jan  3 11:17:55 2012  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* tool/merger.rb (#version_up): version.h date should be Japanese
-	  locale date.
-
-Mon Jan  2 22:08:00 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* tool/file2lastrev.rb (VCS::detect): Add support for Subversion
-	  1.7 which adopted a whole new working directory structure.
-
-	* tool/file2lastrev.rb (VCS::detect): Simply use .each instead of
-	  .sort.reverse_each which looks too arbitrary.  If you want SVN
-	  to be tried first, then you just have to register it first as it
-	  is right now.
-
-Mon Jan  2 20:53:36 2012  Tanaka Akira  <akr@fsij.org>
-
-	* lib/securerandom.rb (random_bytes): use IO#read instead of
-	  IO#readpartial to make the intent more clear.
-
-Mon Jan  2 15:26:39 2012  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* test/ruby/test_object.rb (test_send_with_block): add a normal case.
-
-Mon Jan  2 15:18:54 2012  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* test/ruby/test_object.rb (test_send_with_block): moved from
-	  bootstraptest/test_flow.rb.
-
-Mon Jan  2 15:10:11 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* lib/test/unit/parallel.rb: use pack("m0") instead of
-	  pack("m").gsub("\n","").
-	* lib/test/unit.rb (Test::Unit::Runner::Worker#run): ditto.
-
-Mon Jan  2 15:05:09 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* lib/test/unit.rb (Test::Unit::Runner::Worker#run): use
-	  File.basename with suffix instead of gsub.
-
-Mon Jan  2 14:55:28 2012  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* lib/test/unit.rb (Test::Unit::Runner#_run_parallel): find may
-	  return nil and nil can not dup.
-
-Sun Jan  1 12:23:10 2012  Akinori MUSHA  <knu@iDaemons.org>
-
-	* lib/shellwords.rb (Shellwords#shellescape): Drop the //n flag
-	  that only causes warnings with no real effect.  [Bug #5637]
-
-Sat Dec 31 06:28:37 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* thread.c (rb_barrier_waiting): save the number of waiting threads
-	  in RBASIC()->flags. [ruby-dev:45002] [Bug #5768]
-
-	* thread.c (rb_barrier_wait): increment and decrement around
-	  rb_mutex_lock, and use rb_barrier_waiting().
-
-	* thread.c (rb_barrier_release): use rb_barrier_waiting().
-
-	* thread.c (rb_barrier_destroy): ditto.
-
-Mon Dec 26 17:20:10 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm.c (vm_exec): add guard to prevent optimization for LLVM clang.
-
-Fri Dec 30 17:01:12 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* vm_eval.c (rb_f_send): fix obj.send() documentation issue.
-	 [Bug #5125] [ruby-core:38633]
-
-Thu Dec 29 22:36:16 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* lib/test/unit.rb (Test::Unit::Runner::Worker#_run_parallels): fix
-	  premature exit when all workers' status are :ready or :prepare.
-	  [ruby-dev:45061] [Bug #5822]
-
-Thu Dec 29 01:51:13 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* include/ruby/ruby.h: fix #error pragma. LLP64 platform is supported.
-
-	* include/ruby/st.h: ditto.
-
-Wed Dec 28 11:22:45 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/fileutils.rb (FileUtils::Entry_#entries): use utility method
-	  instead of typoed regexp.  [ruby-core:41829] [Bug #5817]
-
-Wed Dec 28 02:08:04 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* vm_insnhelper.c (unknown_keyword_error): add GC guard to prevent
-	  intermediate object from GC.
-
-Tue Dec 27 22:34:54 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb (Worker#close): "closing IO if IO is closed"
-	  should be "closing IO if IO isn't closed"
-
-Tue Dec 27 22:04:27 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* st.c (st_update): new function to lookup the given key and
-	  update the value.  [ruby-dev:44998]
-
-Tue Dec 27 21:17:33 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* node.h (rb_args_info): change pre_args_num and post_args_num as
-	  int, to match with rb_iseq_t.
-
-	* parse.y (new_args_gen): check overflow.
-
-Mon Dec 26 22:38:35 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* vm_insnhelper.c (unknown_keyword_error): make it kind a error
-	  message when unknown keyword is given.  It require more work.
-	  See [ruby-core:40518] and [ruby-core:40541] in detail.
-
-Mon Dec 26 22:31:07 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* vm_core.h (struct rb_iseq_struct), compile.c (iseq_set_arguments),
-	  iseq.c (rb_iseq_parameters), vm_insnhelper.c
-	  (vm_callee_setup_arg_complex): support Method#parameters for keyword
-	  arguments.  The provisional spec is what Benoit Daloze proposed.
-	  [ruby-core:40541]
-
-	* test/ruby/test_keyword.rb: add a test for above.
-
-Mon Dec 26 22:15:27 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* vm_core.h (struct rb_iseq_struct), compile.c (iseq_set_arguments,
-	  iseq_compile_each), vm_insnhelper.c (vm_callee_setup_arg_complex):
-	  implement keyword arguments.  See [ruby-core:40290]
-	  The feature is promised to be included in 2.0, but the detail spec
-	  is still under discussion; this commit is a springboard for further
-	  discussion.  Please try it and give us feedback.
-	  This commit includes fixes for some problems reported by Benoit
-	  Daloze <eregontp AT gmail.com> [ruby-core:40518] and Marc-Andre
-	  Lafortune <ruby-core-mailing-list AT marc-andre.ca>
-	  [ruby-core:41772].
-
-	* iseq.c (iseq_free, prepare_iseq_build): bookkeeping.
-
-	* test/ruby/test_keyword.rb: add tests for keyword arguments.
-
-	* test/ripper/dummyparser.rb (class DummyParser): temporal fix for
-	  ripper test.
-
-Mon Dec 26 22:00:17 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* node.h, node.c, parse.y: implement a parser part for keyword
-	  arguments.
-	  This is a preparation for keyword argument (see [ruby-core:40290]).
-
-	* gc.c (gc_mark_children): bookkeeping.
-
-Mon Dec 26 21:03:18 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* node.h, parse.y (new_args_gen), compile.c (iseq_set_arguments): use
-	  struct rb_args_info instead of NODEs.
-	  This is a preparation for keyword argument (see [ruby-core:40290]).
-
-	* node.c (dump_node), gc.c (gc_mark_children, obj_free): bookkeeping.
-
-Mon Dec 26 20:59:51 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* node.h, parse.y (lambda, f_larglist): remove NEW_LAMBDA hack.
-	  This is a preparation for keyword argument (see [ruby-core:40290]).
-
-Mon Dec 26 22:01:19 2011  Hiroshi Shirosaki <h.shirosaki@gmail.com>
-
-	* io.c (rb_sys_fail_path): move the definition.
-	  Move above for using it in set_binary_mode_with_seek_cur().
-
-	* io.c (set_binary_mode_with_seek_cur): fix improper seek cursor.
-	  Seeking file cursor with setting binary mode has possibility to
-	  cause infinite loop. Fixed the bug and refined error handling.
-	  Introduced at r34043.
-
-	  And cleanups as below.
-	  Remove unnecessary parentheses of `fptr`.
-	  Use return value of setmode().
-
-	* test/ruby/test_io_m17n.rb
-	  (TestIO_M17N#test_seek_with_setting_binmode): add a test for above.
-	  [ruby-core:41671] [Bug #5714]
-
-Mon Dec 26 17:01:14 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* common.mk (LIBRUBY_A): depends on main.o since r33774.
-	  [ruby-core:41786] [Bug #5796]
-
-Mon Dec 26 13:07:08 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io.rb (TestIO#test_autoclose): Tempfile.new doesn't
-	  accept the block argument.
-
-Mon Dec 26 13:06:52 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb: Avoid zombie processes on "--separate" option
-	  added at r34121.
-
-Mon Dec 26 04:01:23 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_cipher.c: Update and complete documentation.
-
-Sun Dec 25 23:16:11 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* test/testunit/test_parallel.rb (test_separate): Test for "--separate"
-	  option (r34121)
-
-Sun Dec 25 22:39:49 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb (_run_parallel):
-	  New option "--separate" for test/unit; when running tests with this
-	  option, a job process will be restarted after one test file has done.
-	  This means all test files will run with separated process.
-
-	* lib/test/unit/parallel.rb: Fix for above. Now parallel.rb puts
-	  "ready!" for first ready, "ready" for afters.
-
-Sun Dec 25 00:02:15 2011  Luis Lavena  <luislavena@gmail.com>
-
-	* configure.in: change --with-ntver to --with-winnt-ver to be more
-	  descriptive in the context. [ruby-core:41794]
-
-Sat Dec 24 23:25:15 2011  Luis Lavena  <luislavena@gmail.com>
-
-	* configure.in: add --with-ntver option to match win32/configure.bat
-	  functionality. Set 0x0501 as default. [ruby-core:35010]
-	  [ruby-core:35035]
-
-Sat Dec 24 12:38:53 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* proc.c (proc_call): get rid of optimization-out by clang.
-
-	* proc.c (rb_proc_call, rb_proc_call_with_block): ditto.
-
-Sat Dec 24 10:56:32 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/readline/readline.c (readline_readline): check if outstream
-	  is closed to get rid of a bug of readline 6.  [ruby-dev:45043]
-	  [Bug #5803]
-
-Sat Dec 24 06:59:49 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/readline/test_readline.rb (test_line_buffer__point): use
-	  lambda not to exit entire method by "return".  or "next" for
-	  proc.  [ruby-dev:45042] [Bug #5802]
-
-Sat Dec 24 01:20:39 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm_eval.c (send_internal): PASS_PASSED_BLOCK_TH must be placed
-	  just before calling rb_call0.
-
-	* bootstraptest/test_flow.rb: add a test for above.
-
-Sat Dec 24 00:55:16 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/tempfile.rb (Tempfile#initialize): warn if a block is given.
-
-Fri Dec 23 16:14:30 2011  TAKAO Kouji  <kouji@takao7.net>
-
-	* ext/readline/readline.c (readline_attempted_completion_function):
-	  in Readline module with GNU Readline 6 case, Readline module
-	  resets completion_append_character to " ", after it executes
-	  completion. So, Readline module stores
-	  completion_append_character, and Readline module always sets it
-	  after Readline module executes completion. [ruby-dev:43456]
-	  [Feature #4635]
-
-Fri Dec 23 15:59:05 2011  TAKAO Kouji  <kouji@takao7.net>
-
-	* ext/readline/readline.c (Init_readline): libedit check
-	  rl_getc_function only when rl_initialize() is called, and
-	  using_history() call rl_initialize(). This assignment should be
-	  placed before using_history(). [ruby-core:40641] [Bug #5539]
-
-Fri Dec 23 10:14:47 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/thread/test_queue.rb (test_thr_kill): show the number of loop
-	  run when the test failed.
-
-Fri Dec 23 09:23:48 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/test_pty.rb (test_pty_check_default): call PTY.check until
-	  "cat" command is finished.
-
-Fri Dec 23 06:03:00 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* common.mk: add "check succeeded" message.
-
-	* README, README.ja: follow above change.
-
-Fri Dec 23 06:00:39 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* ext/bigdecimal/bigdecimal.h: add satisfy cc-mode comment.
-	* util.c: ditto.
-
-Fri Dec 23 00:08:25 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/test_pty.rb (test_pty_check_default): "cat" may not terminated
-	  in the 0.1 second.
-
-Thu Dec 22 23:37:25 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/ruby/test_thread.rb (test_condvar_timed_wait): don't test the
-	  maximum sleep time.  Ruby is not a real-time system.
-
-Thu Dec 22 22:37:45 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* thread_pthread.c (ping_signal_thread_list): remove return value.
-	* thread_pthread.c (check_signal_thread_list): add a new function to
-	  check if signal thread list is empty.
-	* thread_pthread.c (thread_timer): check signal thread list after
-	  timer_thread_function(). main thread might be added into signal thread
-	  list during timer_thread_function().
-
-Thu Dec 22 00:40:24 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* ext/bigdecimal/bigdecimal.c (VpMult, VpCtoV, VpSqrt): remove assigned
-	  but unused variables.
-
-Wed Dec 21 18:28:22 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* common.mk (newline.c, miniprelude.c): revert r33949 because the change
-	  broke mswin build, and the changer said no reason about the change.
-	  [ruby-dev:45016] [Bug #5783]
-
-Wed Dec 21 12:35:24 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_s_allocate): follow
-	  Allocation Framework.  [Bug #5775]
-
-Wed Dec 21 02:25:36 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/emitter.c: fixing clang warnings. Thanks Joey!
-
-Wed Dec 21 01:06:00 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* ext/bigdecimal/README: Update redmine.ruby-lang.org to bugs.ruby-lang.org
-	* ext/socket/ancdata.c: ditto
-	* test/-ext-/wait_for_single_fd/test_wait_for_single_fd.rb: ditto
-	* test/syck/test_yaml.rb: ditto
-	* doc/ChangeLog-1.9.3: ditto
-
-Tue Dec 20 23:50:12 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* PStore content update perf optimization. Patch by Masaki Matsushita.
-	  See #5248.
-
-	* lib/pstore.rb (save_data):
-
-	  * Delete inadequate Marshal check.
-
-	  * Deferred file truncation: when writing the new content, truncate
-	    the saved file to the data size after writing the data, instead of
-	    truncating whole bytes before writing data.
-
-	  * Deferred MD5 calculation: when comparing MD5 hash to check the
-	    content modification, calculate MD5 hash of new data iif the
-	    content length is differ from the old one.
-
-	  * Compare content size with String#bytesize instead of String#size.
-
-Tue Dec 20 21:00:30 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: uses to_integer instead.
-	* test/date/test_switch_hitter.rb: added a test.
-
-Tue Dec 20 15:04:18 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* Make sure to clear $! when ignoring an exception
-
-	* ext/openssl/ossl.c (ossl_pem_passwd_cb0, ossl_verify_cb):
-	  pem_passwd_cb and verify_cb ignores the exception raised in a
-	  callback proc so it should clear $! for subsequent execution.
-
-	  That's said, both subsequent processes for pem_passwd_cb and
-	  verify_cb raises another exception before leaking $! to Ruby world.
-	  We cannot test this fix in Ruby land.
-
-	* test/openssl/test_pkey_rsa.rb
-	  (test_read_private_key_pem_pw_exception): Test for pem_passwd_cb +
-	  exception.
-
-Tue Dec 20 11:49:13 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/date/test_date_base.rb (test_jd): tests for
-	  [ruby-dev:45008].
-
-Tue Dec 20 10:20:48 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/date/date_core.c (wholenum): fix the type of the return value.
-
-Tue Dec 20 05:03:24 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* README.ja:  Update redmine.ruby-lang.org to bugs.ruby-lang.org
-	* README:  ditto
-	* common.mk:  ditto
-	* man/erb.1:  ditto
-	* man/irb.1:  ditto
-	* man/ri.1:  ditto
-	* man/ruby.1:  ditto
-	* sparc.c:  ditto
-	* tool/install-sh:  ditto
-
-Tue Dec 20 02:15:18 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c:  [ruby-dev:45008].
-
-Sun Dec 18 18:52:37 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* vm.c (vm_define_method): improve guard of iseq from GC.  Fix
-	  failure or segmentation fault in test_singleton_method(TestGc)
-	  on sparc Solaris10 compiled with Oracle Solaris Studio 12.2.
-	  [Bug #5762] [ruby-dev:45000] [Bug #4178]
-
-Sun Dec 18 14:34:31 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.c (Init_bigdecimal): does not follow
-	  allocation framework right now.  [ruby-core:41710] [Bug #5773]
-
-Sun Dec 18 12:42:48 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/to_ruby.rb: BigDecimals can be restored
-	  from YAML.
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: BigDecimals can be dumped
-	  to YAML.
-	* test/psych/test_numeric.rb: tests for BigDecimal serialization
-
-Sun Dec 18 12:03:13 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/scalar_scanner.rb: Strings that look like dates
-	  should be treated as strings and not dates.
-
-	* test/psych/test_scalar_scanner.rb: corresponding tests.
-
-Sun Dec 18 09:43:21 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* test/thread/test_queue.rb (test_thr_kill): extend timeout.
-	  this test takes a long time at slow machine.
-
-Sun Dec 18 09:36:51 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* test/ruby/envutil.rb (invoke_ruby): remove :timeout option before
-	  pass it to Kernel#spawn.
-
-Fri Dec 16 17:18:38 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* README, README.ja: 'make check' is preferable to 'make test'.
-
-Thu Dec 15 23:16:13 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* error.c (builtin_type_name): don't return pointer to the buffer of
-	  temporary String object.
-
-Thu Dec 15 17:56:58 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (argf_type): make typed data.
-
-Thu Dec 15 17:40:28 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_check_type): fix typo.
-
-Thu Dec 15 14:48:35 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/strscan/strscan.c: use typed data with
-	  onig_region_memsize().
-
-Thu Dec 15 14:33:33 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_check_typeddata): refine error message with
-	  including expected struct name.
-
-Thu Dec 15 13:15:51 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* regcomp.c (onig_region_memsize): implemented for memsize_of().
-
-	* ext/objspace/objspace.c (memsize_of): use it.
-
-Thu Dec 15 10:44:54 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_reject_bang, rb_ary_delete_if): update rdoc.
-	  documentation from Thomas Leitner <t_leitner AT gmx.at> in
-	  [ruby-core:41616].  [Bug #5752]
-
-Thu Dec 15 10:10:43 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/test_require.rb (test_race_exception): get rid of
-	  not-guaranteed timing issue.  [ruby-core:41655] [Bug #5754]
-
-Wed Dec 14 21:58:42 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io_m17n.rb
-	  (TestIO_M17N#test_{read_with_binmode_and_get[cs]}): only for Windows.
-
-Wed Dec 14 19:57:23 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* common.mk,Makefile.in,win32/Makefile.sub (ECHO1): move platform
-	  specific hack from common.mk to Makefile.in (and win32/Makefile.sub).
-	  [Bug #5711]
-
-	* lib/mkmf.rb: we can generate Makefile as we like.
-
-Wed Dec 14 19:22:33 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c, include/ruby/win32.h (rb_w32_fd_is_text): new function.
-
-	* win32/win32.c (init_stdhandle): set default mode of stdin as binmode.
-
-	* io.c (set_binary_mode_with_seek_cur): new function to replace
-	  SET_BINARY_MODE_WITH_SEEK_CUR macro.  now returns previous mode of the
-	  fd and take care of LF in rbuf.
-
-	* io.c (do_writeconv): set text mode when needed.
-
-	* io.c (io_read): need to change the mode of the IO to binmode
-	  temporally when the length for IO#read, because IO#read with length
-	  must behave so.
-
-	* test/ruby/test_io_m17n.rb (TestIO_M17N#test_{read_with_length,
-	  read_with_length_binmode,get[cs]_and_read_with_binmode,
-	  read_with_binmode_and_get[cs],read_write_with_binmode}): tests for
-	  above changes.
-
-	all patches are written by Hiroshi Shirosaki. [ruby-core:41496]
-	[Feature #5714]
-
-Wed Dec 14 15:28:31 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* transcode.c (str_encode): about the extension of :fallback
-	  option since 1.9.3.
-
-Wed Dec 14 12:19:59 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (load_unlock): release loading barrier and then remove it
-	  from loading_table if it is not in-use.  [Bug #5754]
-
-	* thread.c (rb_barrier_release, rb_barrier_destroy): return
-	  whether any other threads are waiting on it.
-
-Wed Dec 14 11:23:45 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* thread_pthread.c (ubf_select): call rb_thread_wakeup_timer_thread()
-	  only when it is not timer_thread. [Bug #5757] [ruby-dev:44985]
-	  patched by Tomoyuki Chikanaga.
-
-Wed Dec 14 10:20:08 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (load_lock): delete the loading barrier if it has been
-	  destroyed.
-
-	* thread.c (rb_barrier_wait): return nil for recursive lock
-	  instead of false, to distinguish it from destroyed barrier.
-
-Wed Dec 14 01:24:55 2011  okkez  <okkez000@gmail.com>
-
-	* thread_pthread.c (rb_thread_create_timer_thread): fix memory
-	  leak. [ruby-dev:44904] [Bug #5688]
-
-Wed Dec 14 00:01:15 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (primary): point method name line.  [ruby-core:40936]
-	  [Bug #5614]
-
-Tue Dec 13 23:43:48 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* error.c (name_err_mesg_to_str): clear rb_thread_t::errinfo when
-	  ignore exception under rb_protect(). [ruby-core:41612] [Bug #5755]
-
-	* test/ruby/test_exception.rb (test_exception_in_name_error_to_str):
-	  add a corresponding test.
-
-Tue Dec 13 16:13:29 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (load_unlock): all threads requiring one file should
-	  share same loading barrier, so it must be kept alive while those
-	  are waiting on it.  [ruby-core:41618] [Bug #5754]
-
-Tue Dec 13 07:30:14 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/webrick/httpresponse.rb (setup_header): 1xx responses
-	  are allowed to have Keep-Alive connections.
-
-	* test/webrick/test_httpresponse.rb: corresponding test.
-
-Tue Dec 13 07:13:28 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/webrick/httpresponse.rb (setup_header): 204 and 304 responses
-	  are allowed to have a Keep-Alive connection. [ruby-core:41581]
-
-	* test/webrick/test_httpresponse.rb: corresponding test.
-
-Tue Dec 13 06:29:39 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_magic_comment): should pass the proper value.
-	  [ruby-dev:44984][Bug #5753]
-
-Tue Dec 13 05:50:07 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_yield_setup_block_args): splat single
-	  argument if optional arguments are defined not only mandatory or
-	  post arguments.  [ruby-core:41557] [Bug #5730]
-
-Mon Dec 12 22:35:39 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* parse.y (stmt_or_begin): changed the error message for BEGIN not
-	  at toplevel.  [ruby-dev:44963] [Bug #5738]
-
-Mon Dec 12 17:29:01 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* README: Fixed SupportedPlatforms URL in the README.
-	  patched by eMxyzptlk. https://github.com/ruby/ruby/pull/62
-
-Mon Dec 12 17:26:51 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* load.c (rb_feature_p): lazy assigned load_path searched in
-	  loading_table were not expanded, but all features, pushed to
-	  loading table, are expanded.  a patch by Yura Sokolov
-	  <funny.falcon AT gmail.com> in [ruby-core:41545]. [Bug #5727]
-
-Mon Dec 12 15:41:03 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/stringio/stringio.c (strio_truncate): fix typo.  patched by
-	  Nick Howard <ndh AT baroquebobcat.com>.
-	  https://github.com/ruby/ruby/pull/65
-
-Sun Dec 11 12:19:17 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb: includes the sequence number of UID in a error
-	  message.  suggested by art lussos.
-	  [ruby-core:41413] [Feature #5692]
-
-Sun Dec 11 11:42:10 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* ext/syslog/syslog.c: fix a typo. [ruby-core:41585] [Bug #5740]
-
-Sun Dec 11 10:48:16 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (exit_initialize): deal with true and false as well as
-	  Kernel#exit.  [ruby-dev:44951] [Bug #5728]
-
-Sun Dec 11 10:37:47 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* object.c (rb_check_to_int): new function to convert a VALUE to
-	  an Integer if possible, but returns nil instead of raising an
-	  exception otherwise.
-
-Sun Dec 11 10:34:39 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* process.c (rb_exit_status_code): extract from rb_f_exit_bang and
-	  rb_f_exit.  assume 0 to be success in Kernel#exit! too.
-
-Fri Dec  9 19:24:31 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* enc/trans/iso-8859-16-tbl.rb: add ISO-8859-16 converter.
-
-	* enc/trans/single_byte.trans: ditto.
-
-Fri Dec  9 14:28:40 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* file.c (file_path_convert): don't convert it when the path string is
-	  ascii only. [ruby-core:41556] [Bug #5733]
-	  tests are contributed by nobu.
-
-Fri Dec  9 08:00:15 2011  Luis Lavena  <luislavena@gmail.com>
-
-	* include/ruby/win32.h: undef stat to silence mingw-w64 stat
-	  redefinition warnings (GCC 4.6.3).
-
-Thu Dec  8 23:38:24 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* variable.c (set_const_visibility): clear inline-cache when constant's
-	  visibility is modified. [ruby-dev:44929]
-
-	* test/ruby/test_module.rb (test_private_constants_clear_inlinecache):
-	  add test for it.
-
-Thu Dec  8 23:26:11 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/extmk.rb (extract_makefile): should sort after map, not before
-	  it.  in this case there is no difference, but we should write better
-	  code.  this bad smell was caught by nagachika.
-
-Thu Dec  8 22:31:13 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/extmk.rb (extract_makefile): need to sort the array of current
-	  srcs before comparing to the sorted old srcs.
-	  fixed the problem that the configuring stage of exts were always
-	  run, introduced at r33801.
-
-Thu Dec  8 13:26:24 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/rexml/test_order.rb (OrderTester#test_more_ordering): use
-	  Zlib::GzipReader.open instead of Zlib::GzipReader.new with File.new.
-	  fixed a test error on Windows introduced at r33946.
-
-Thu Dec  8 13:11:26 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_process.rb (TestProcess#test_sete[gu]id): silently
-	  skip if not implemented such functions (such as, on Windows).
-	  fixed test errors on Windows introduced at r33953.
-
-Thu Dec  8 12:57:50 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/socket/extconf.rb: forgotten to define HAVE_SOCKETPAIR for
-	  windows.
-	  fixed test errors on Windows introduced at r33947.
-
-Thu Dec  8 12:11:06 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_WERROR_FLAG): append all warning flags which
-	  are enabled to compile, so that printf format modifiers properly
-	  fail.  [ruby-core:41351] [Bug #5679]
-
-Thu Dec  8 07:20:15 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/re.rdoc:  Document difference between match and =~, options with
-	  Regexp.new and global variables.  Patch by Sylvain Daubert.
-	  [Ruby 1.9 - Bug #5709]
-
-Thu Dec  8 06:53:10 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* doc/re.rdoc:  Fix example code to match documentation.  Patch by
-	  Jarno Lamberg.  [Ruby 1.9 - Bug #5624]
-
-Wed Dec  7 19:04:22 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (rpath): fix typo in the help string.  a patch from
-	  Yuji Yamano <yyamano AT kt.rim.or.jp> in [ruby-list:48568].
-
-Wed Dec  7 18:55:56 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm.c (vm_set_top_stack, vm_set_eval_stack): check for stack
-	  overflow with stack_max before push new frame. [ruby-core:41520]
-	  [Bug #5720]
-
-	* vm.c (vm_set_main_stack): no stack overflow chances after
-	  vm_set_eval_stack().
-
-Wed Dec  7 09:58:15 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/bigdecimal/bigdecimal.c:  Document +@, -@, hash, INFINITY, Nan.
-	  Patch by Sylvain Daubert.  [Ruby 1.9 - Feature #5622]
-
-Wed Dec  7 09:48:00 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* io.c (Init_IO):  Mention io/console methods.  [Ruby 1.9 - Bug #5602]
-	* ext/io/console/console.c:  Mention that io/console must be required
-	  similar to lib/time.rb
-
-Wed Dec  7 08:04:31 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb (module Psych): parse and load methods take
-	  an optional file name that is used when raising Psych::SyntaxError
-	  exceptions
-	* ext/psych/lib/psych/syntax_error.rb (module Psych): allow nil file
-	  names and handle nil file names in the exception message
-	* test/psych/test_exception.rb (module Psych): Tests for changes.
-
-Tue Dec  6 18:26:33 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/dbm.c: use db_version() instead of DB_VERSION_STRING to
-	  detect runtime Berkeley DB version.
-	  use dpversion instead of _QDBM_VERSION to detect runtime QDBM
-	  version.
-	  [ruby-dev:44948]
-
-Tue Dec  6 12:30:41 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: detect gdbm_version in libgdbm.
-
-	* ext/dbm/dbm.c: make DBM::VERSION more informative for gdbm, qdbm and
-	  Berkeley DB 1.x.  [ruby-dev:44944]
-
-Tue Dec  6 07:26:37 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* range.c:  Improve documentation for Range.  Patch by Chris Zetter.
-	  [Ruby 1.9 - Bug #5656]
-
-Mon Dec  5 19:08:04 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* regparse.c (PFETCH_READY): separate gcc specific trick.
-
-Mon Dec  5 19:01:59 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* process.c (proc_seteuid_m): fix argument.
-
-	* test/ruby/test_process.rb (test_geteuid): fix typo.
-
-	* test/ruby/test_process.rb (test_getegid, test_set[eg]uid): add.
-
-Mon Dec  5 18:56:55 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bignum.c (big_rshift), compile.c (validate_label,
-	  iseq_build_from_ary_exception), cont.c (cont_capture), dir.c
-	  (dir_open_dir), gc.c (objspace_each_objects), io.c (pipe_open)
-	  (rb_io_advise), parse.y (parser_compile_string)
-	  (rb_parser_compile_file), proc.c (binding_free), process.c
-	  (rb_proc_exec_n, rb_seteuid_core, proc_setegid, rb_setegid_core)
-	  (p_uid_exchange, p_gid_exchange), regparse.c (strdup_with_null),
-	  signal.c (sig_dfl), vm.c (rb_iseq_eval, rb_iseq_eval_main),
-	  vm_insnhelper.c (vm_expandarray): suppress
-	  unused-but-set-variable warnings.
-
-	* class.c (rb_obj_methods), compile.c (iseq_compile_each),
-	  iseq.c(iseq_load, rb_iseq_parameters), pack.c (pack_pack),
-	  regcomp.c (is_not_included, update_string_node_case_fold),
-	  transcode.c (rb_econv_open0, make_replacement),
-	  vm_eval.c (raise_method_missing): remove unused variable.
-
-	* signal.c (reserved_signal_p): static.
-
-Mon Dec  5 14:27:23 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* include/ruby/{subst.h,win32.h}, ext/socket/rubysocket.h: revert
-	  r33876.  [ruby-core:41475] [Bug #5706]
-
-	* ext/socket/extconf.rb: the alternative hack for [Bug #5675].
-
-Mon Dec  5 10:18:45 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/zlib/zlib.c (rb_gzreader_initialize): revert a part of r33937.
-	  1st, to change the mode of an IO is very sensitive problem, so
-	  the maintainer of this library should judge it.
-	  2nd, usually Zlib::GzipReader.new is not called directly.  #initialize
-	  is called via .open, and in the method the I/O is opened in binary
-	  mode, so there is no problem without changing the mode in #initialize.
-
-Sun Dec  4 22:53:12 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/tempfile.rb: don't use lock directory.  [ruby-dev:39197]
-
-Sun Dec  4 22:34:43 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/tempfile.rb (Tempfile::MAX_TRY): remove unused constant.
-
-Sun Dec  4 12:11:28 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* lib/pp.rb: fix rdoc.
-
-Sun Dec  4 12:03:16 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/delegate.rb (Delegator#methods): Kernel#methods receives
-	  zero or one argument. [ruby-core:37118] [Bug #4882]
-
-Sun Dec  4 10:15:00 2011  Luis Lavena  <luislavena@gmail.com>
-
-	* ext/zlib/zlib.c (rb_gzreader_initialize): use binary mode by default
-	  under Windows. Patch by Hiroshi Shirosaki. [ruby-core:40706]
-	  [Feature #5562]
-
-	* include/ruby/encoding.h (void rb_econv_binmode): define NEWLINE
-	  decorator.
-
-	* io.c (rb_cloexec_fcntl_dupfd): Introduce NEED_READCONV and
-	  NEED_WRITECONV to replace universal newline decorator by CRLF only
-	  when required to improve file reading and writing under Windows.
-	  Patch by Hiroshi Shirosaki. [ruby-core:40706] [Feature #5562]
-	* io.c (do_writeconv): adjust binary mode if required.
-	* io.c (read_all, appendline, swallow, rb_io_getline_1): ditto.
-	* io.c (io_getc, rb_io_each_codepoint, rb_io_ungetc): ditto.
-	* io.c (rb_io_binmode, rb_io_ascii8bit_binmode): ditto.
-	* io.c (rb_io_extract_modeenc, rb_sysopen): ditto.
-	* io.c (pipe_open, prep_stdio, io_encoding_set): ditto.
-	* io.c (rb_io_s_pipe, copy_stream_body): ditto.
-
-	* test/ruby/test_io_m17n.rb (EOT): add test for pipe and stdin in
-	  binary mode.
-
-	* win32/win32.c (init_stdhandle): remove O_BINARY from stdhandle
-	  initialization.
-	* win32/win32.c (rb_w32_write): use FTEXT mode accordingly.
-
-Sat Dec  3 20:49:16 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* variable.c (set_const_visibility): print a warning when no argument
-	  is passwd to Module#private_constant.  [ruby-list:48558]
-
-	* vm_method.c (set_method_visibility): ditto for
-	  Module#private_class_method.
-
-Sat Dec  3 20:43:14 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* variable.c (set_const_visibility): Module#private_constant has
-	  changed the visibility of only the first argument.  Now it changes
-	  all of them.  [ruby-list:48558]
-
-	* test/ruby/test_module.rb: add a test for above.
-
-Sat Dec  3 07:17:29 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* Makefile.in (CFLAGS): append ARCH_FLAG.
-
-	* configure.in (ARCH_FLAG): exclude from CFLAGS.
-
-	* configure.in (UNIVERSAL_INTS): include short int.  fix for
-	  test/mkmf.
-
-Fri Dec  2 15:48:08 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.c (VpAllocReal): reduce extra frac.
-
-Fri Dec  2 15:41:24 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: check whether -pie or -Wl,-pie is valid as
-	  LDFLAGS.  [ruby-core:41438] [Bug#5697]
-
-	* configure.in: use $linker_flag for LDFLAGS option which is not
-	  limited to particular platforms.
-
-Thu Dec  1 23:21:58 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* thread_pthread.c (thread_timer): call prctl(PR_SET_NAME) only if
-	  PR_SET_NAME is available.
-
-Thu Dec  1 22:31:16 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (linux_get_maxfd): change local variable name.
-
-Thu Dec  1 16:59:24 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/socket/extconf.rb: add arguments for macro calls.
-	  [ruby-core:41370] [Bug#5681]
-
-Thu Dec  1 16:20:16 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (MakeMakefile#try_func): fix broken patch at r33834.
-
-Thu Dec  1 14:43:17 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.h (Real): suppress false warning from
-	  clang.  [ruby-core:41418] [Bug#5693]
-
-Thu Dec  1 10:31:55 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (LDFLAGS): -fstack-protector is always needed to
-	  link static library created with it.  [ruby-core:41387]
-	  [Bug#5686]
-
-Thu Dec  1 07:03:51 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: add sys/prctl.h test.
-	* thread_pthread.c (thread_timer): call prctl(PR_SET_NAME) to change
-	  thread name. It may help to debug.
-
-Wed Nov 30 23:35:45 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* variable.c (rb_path2class): don't raise NameError when the middle
-	  constant of the path is not defined but defined on toplevel.
-	  [ruby-core:41410] [Bug #5691]
-
-Wed Nov 30 20:02:02 2011  Martin Duerst  <duerst@it.aoyama.ac.jp>
-
-	* transcode.c: Simplified rb_econv_binmode, avoided a warning on cygwin.
-
-Wed Nov 30 08:57:07 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/mkmf.rb:  Use MakeMakefile's rm_f to avoid conflict with Rake or
-	  FileUtils.
-	* test/ruby/test_module.rb:  Hide MakeMakefile's inclusion in Object
-
-Wed Nov 30 09:12:43 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* lib/rdoc/encoding.rb (RDoc::Encoding.read_file): fixup newline chars
-	  on Windows.
-	  see https://github.com/rdoc/rdoc/issues/87
-
-	* test/rdoc/test_rdoc_markup_pre_process.rb
-	  (TestRDocMarkupPreProcess#test_include_file,
-	  TestRDocMarkupPreProcess#test_include_file_encoding_incompatible):
-	  follow above change.
-
-Wed Nov 30 09:09:37 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/parser.c (parse): parse method can take an option file
-	  name for use in exception messages.
-	* test/psych/test_parser.rb: corresponding tests.
-
-Tue Nov 29 09:07:59 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/mkmf.rb:  Fix indentations of constants at end of module.
-	  Document some constants.
-
-Tue Nov 29 09:58:23 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_write_error2): suppress unused variable warning.
-
-Tue Nov 29 07:45:26 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/mkmf.rb:  Wrap comments to 78 columns and clean up formatting.
-
-Tue Nov 29 05:54:18 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/mkmf.rb:  Wrap mkmf.rb in module MakeMakefile to clean up Object
-	  documentation.  [Ruby 1.9 - Feature #5658]
-	* ext/extmk.rb:  Use MakeMakefile::CONFIG instead of Object::CONFIG
-	* test/mkmf/base.rb:  ditto
-
-Tue Nov 29 00:08:57 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* common.mk (INSTRUBY_ARGS): added --mantype to apply mdoc2man.rb
-	  to man pages.  Fixes #5598.
-	  (do-install-nodoc, do-install-local, do-install-man,
-	  dont-install-nodoc, dont-install-local, dont-install-man):
-	  No longer needs --mantype.
-
-	  Reported by Rainer Orth <ro AT cebitec.uni-bielefeld.de>,
-	  patch by George Koehler <xkernigh AT netscape.net>.
-
-Mon Nov 28 22:26:31 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/rake/test_rake_directory_task.rb
-	  (TestRakeDirectoryTask#test_directory_win32): shouldn't create any
-	  file/directory on root directory.  create on @tempdir (= Dir.pwd).
-	  see https://github.com/jimweirich/rake/issues/91
-
-Mon Nov 28 12:57:29 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_write_error2): fwrite() returns ssize_t.
-
-Mon Nov 28 12:47:19 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* parse.y (nodetype, nodeline): static.  these functions are for
-	  debugging, and not intend to be public.
-
-Mon Nov 28 12:37:54 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* gc.c (initial_params): static.  it seems to be forgotten at r33501.
-
-Mon Nov 28 12:32:24 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* include/ruby/win32.h, win32/win32.c (GetCurrentThreadHandle): remove
-	  unused old API.
-
-Mon Nov 28 12:29:20 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/mkexports.rb (Exports#initialize): remove old symbol name.
-
-Mon Nov 28 12:15:28 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/mkexports.rb (Exports#read_substitution): need to read
-	  from subst.h too.  [Bug #5675]
-
-Mon Nov 28 11:46:35 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (rb_io_flush): release GVL during fsync() on Windows.
-
-Mon Nov 28 11:00:25 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* include/ruby/subst.h: typo of r33876.
-
-Mon Nov 28 10:36:00 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/subst.h: moved Windows specific substitutions from
-	  win32.h.
-
-	* ext/socket/rubysocket.h: include ruby/subst.h.  [Bug #5675]
-
-Mon Nov 28 10:20:58 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/{Makeilfe.sub,win32.c} (FILE_COUNT, FILE_READPTR): move the
-	  definitions from config.h to win32.c.  I dared to have left such
-	  macros, for other future compiler support.
-	  [ruby-core:41313] [Bug #5674]
-
-Mon Nov 28 09:28:30 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (rb_w32_uchmod): typo.  [Bug#5671] [ruby-dev:44898]
-
-	* test/ruby/test_file.rb (TestFile#test_chmod_m17n): test of above bug.
-
-Sun Nov 27 21:25:33 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: added -fno-strict-overflow. it suppress annoying
-	  -Wstrict-overflow warning.
-
-Sun Nov 27 20:58:02 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (rb_write_error2): get rid of warning on linux. fwrite
-	  of glibc is tagged __attribute__ ((__warn_unused_result__))
-	  if _FORTIFY_SOURCE != 0.
-	* vm_dump.c (rb_vm_bugreport): ditto.
-
-Sun Nov 27 19:09:02 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (stack_protector): disable on mingw.  [Bug#5676]
-
-	* Makefile.in (DLDFLAGS): also needs -fstack-protector.
-	  [Bug#5676]
-
-Sun Nov 27 14:13:33 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: add -fstack-protector into XLDFLAGS as well as
-	  XCFLAGS if stack-protector is used.
-
-Sun Nov 27 13:09:25 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: workaround to avoid MacOS X build error.
-	  Maybe autoconf 2.61 is slightly buggy. [ruby-core:41316]
-
-Sun Nov 27 04:57:11 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* configure.in (--no-undefined): r33840 breaks FreeBSD and DragonFly
-	  with gcc 4.4 or later. Their environ is in /usr/libexec/ld-elf.so.1,
-	  so it will be false negative.
-
-Sun Nov 27 04:55:45 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/http.rb (Net::HTTP::SSL_IVNAMES): rerefix 33701.
-	  SSL_ATTRIBUTES stores names for set_params, they are symbol.
-	  SSL_IVNAMES stores instance variable names.
-
-Sun Nov 27 00:16:07 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (copy_stream_body): use 0666 for permission argument for open.
-	  [ruby-core:40865]
-
-Sat Nov 26 23:01:38 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_engine.rb: remove side effect of generic engine
-	  load by explicitly loading software-based "openssl" engine for
-	  all tests.
-
-Sat Nov 26 20:41:48 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/http.rb (Net::HTTP.get_response): enable use_ssl
-	  if given URI object is https.
-	  patched by Mark Ferlatte [ruby-core:40665] [Bug #5545]
-
-	* lib/net/http.rb (Net::HTTP.post_form): ditto.
-
-Sat Nov 26 20:01:18 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/http.rb (Net::HTTP::SSL_ATTRIBUTES): refix 33701.
-	  store instance variable symbol names.
-
-Sat Nov 26 15:40:25 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* .travis.yml (script): should be ./configure
-
-Sat Nov 26 15:39:18 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* .travis.yml (before_script): wrong name, sorry.
-
-Sat Nov 26 15:31:34 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* .travis.yml (before-script): autoconf required.
-
-Sat Nov 26 15:24:05 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* .travis.yml: Travis enable.
-
-Sat Nov 26 10:47:50 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/extconf.rb: remove checks for available functions.
-	* ext/openssl/missing.h: ditto.
-	  Thanks, Tim Mooney for reporting this!
-	  [Bug #5432] [ruby-core:40088]
-
-Sat Nov 26 10:22:28 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_ssl.c: add comment on where to find implementation
-	  of OpenSSL::SSL::SSLSocket#session.
-
-Sat Nov 26 05:00:25 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (--no-undefined): RUBY_TRY_CFLAGS does nothing for
-	  linker flags.  use RUBY_TRY_LDFLAGS.
-
-Fri Nov 25 11:37:07 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (ioctl_narg_len, linux_iocparm_len): reinstantiate linux
-	  specific narg length calculation.
-	* test/ruby/test_io.rb (test_ioctl_linux2): add new test for old and
-	  unstructured ioctl.
-
-Fri Nov 25 10:39:14 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* Makefile.in (EXTLDFLAGS): export it.
-	* configure.in: add --no-undefined if --enable-shared is specified.
-	  Gentoo enabled this option long time. Also, export EXTLDFALGS.
-
-Fri Nov 25 08:48:35 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: turn on PIE if --enable-shared is not specified.
-
-Fri Nov 25 08:05:07 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: add -fstack-protector. It help to protect us from
-	  stack smashing attack.
-
-Fri Nov 25 08:03:28 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: add -D_FORTIFY_SOURCE=2. It provide some compile
-	  time and runtime check for security.
-
-Fri Nov 25 08:00:23 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* lib/mkmf.rb: get rid of warnings of mkmf.rb if -Wmissing-declarations
-	  and/or -Wold-style-definition warnings if specified.
-	  Patch by Nikolai Weibull. Thank you! [Bug #5459] [ruby-core:40200]
-
-Fri Nov 25 07:46:09 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: add -Wall always.
-
-Thu Nov 24 20:02:40 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/openssl/test_engine.rb: use IO#reopen to restore stderr.
-
-Thu Nov 24 19:59:56 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_io_reopen): re-initialize buffering mode for stdout and
-	  stderr.
-
-Thu Nov 24 11:12:48 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (rb_io_fsync,rb_io_fdatasync): release GVL during fsync().
-	  fsync() and fdatasync() may take a long time on slow disks and/or
-	  if there is much dirty data.
-	  Patch by Eric Wong. [Feature #5665] [ruby-core:41247]
-
-Thu Nov 24 10:05:02 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_engine.rb: Suppress output from 'openssl'
-	  engine's RC4 cipher.
-	  [Bug #5633] [ruby-core:41026]
-
-Thu Nov 24 08:05:02 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_pkey_dsa.c: remove redundant colon from error
-	  message.
-	* ext/openssl/ossl_ssl.c: ditto.
-	* ext/openssl/ossl_pkey_rsa: ditto.
-	  patched by Eric Hodel [Bug #5604] [ruby-core:40896]
-
-Wed Nov 23 20:03:43 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (ioctl_narg_len): don't use _IOC_SIZE macro on Linux.
-	  On Linux some constants for ioctl(2) doesn't include the size of
-	  its return value and 16bit value; for example FIONREAD 0x541B.
-	  Moreover the manual, ioctl_list(2),  says "Note  that  the  size
-	  bits  are  very unreliable: in lots of cases they are wrong,
-	  either because of buggy macros using sizeof(sizeof(struct)),
-	  or because of legacy values."
-	  So we shouldn't use it.
-
-Tue Nov 22 18:07:32 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (_pioinfo): need to declare _pioinfo() before using
-	  _osfhnd and other macros which uses _pioinfo() internally.
-
-Tue Nov 22 17:49:45 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (_pioinfo): make an inline function.
-
-Tue Nov 22 11:26:08 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-Tue Nov 22 11:33:58 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/win32.c (dupfd): argument of _osfhnd and so on should not
-	  have side effect.
-
-Tue Nov 22 11:26:08 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* bignum.c (rb_big_divide): refix of r33536. Don't change behavior of Bignum#/.
-	  [ruby-core:40429] [Bug #5490]
-
-Tue Nov 22 10:46:57 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* numeric.c (ruby_float_step): improve floating point calculations.
-	  [ruby-core:35753] [Bug #4576]
-
-	* numeric.c (ruby_float_step): correct the error of floating point
-	  numbers on the excluding case.
-	  patched by Masahiro Tanaka [ruby-core:39608]
-
-	* numeric.c (ruby_float_step): use the end value when the current
-	  value is greater than or equal to the end value.
-	  patched by Akira Tanaka [ruby-core:39612]
-
-Tue Nov 22 06:59:21 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/ruby/test_io.rb (test_fcntl_dupfd): there is no known platform
-	  which don't have F_DUPFD.  [ruby-dev:44874]
-
-Tue Nov 22 04:46:22 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: remove autoload from psych
-	* ext/psych/lib/psych/json.rb: ditto
-
-Tue Nov 22 00:44:59 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/ruby/test_io.rb (test_fcntl_dupfd): the argument of F_DUPFD is
-	  minimum file descriptor.
-
-Tue Nov 22 00:25:17 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (linux_get_maxfd): get rid of a warning.
-
-Mon Nov 21 23:39:14 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (linux_get_maxfd): new function to find maximum fd on Linux.
-	  (rb_close_before_exec): use linux_get_maxfd.
-
-Mon Nov 21 06:16:24 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* cont.c (fiber_switch): ignore fiber context switch
-	  because destination fiber is same as current fiber.
-	  With out this, it may segv on FreeBSD 9.
-	  patched by Koichi Sasada.
-
-Sun Nov 20 23:22:42 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/extmk.rb (extract_makefile, extmake): regenerate makefiles
-	  if globbed source file list is changed.
-
-	* lib/mkmf.rb (create_makefile): store ORIG_SRCS.
-
-Sun Nov 20 22:43:03 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* enc/unicode.c (PROPERTY_NAME_MAX_SIZE): +1.
-	  reported by Ken Takata. [ruby-dev:44894][Bug #5652]
-
-Sun Nov 20 11:01:28 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/set.rb (SortedSet.setup): remove old_init after initialize
-	  method is redefined.  The remove before redefinition makes the
-	  warning prevention fragile.  [ruby-dev:44892]
-
-Sun Nov 20 04:01:45 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* Makefile.in (enc/unicode/name2ctype.h): remove duplicated
-	  ifdefs.
-
-Sat Nov 19 19:31:47 2011  Tanaka Akira  <akr@fsij.org>
-
-	* time.c (TIME_COPY_GMT): copy vtm.utc_offset and vtm.zone too.
-	  patch by Tomoyuki Chikanaga.
-	  [ruby-dev:44827] [Bug #5586]
-
-Sat Nov 19 16:36:57 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/net/http/test_http.rb: remove temporally files in ensure clause.
-
-Sat Nov 19 08:18:41 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/net/http/test_http.rb: remove temporally files.
-
-Fri Nov 18 17:18:16 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/io/console/console.c (console_raw, console_set_raw)
-	  (console_getch): optional parameters.  [EXPERIMENTAL]
-
-Fri Nov 18 16:12:11 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/io/console/console.c (console_cooked, console_set_cooked):
-	  new methods to reset cooked mode.  [EXPERIMENTAL]
-
-Fri Nov 18 13:20:26 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/unit/assertions.rb (MINI_DIR): quick dirty hack to get rid of
-	  warnings when using assert/assert_respond_to.
-
-Fri Nov 18 13:03:38 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (rb_cloexec_open): set O_NOINHERIT instead of O_CLOEXEC if it is
-	  available (for Windows).
-
-	* win32/win32.c (fcntl): on F_DUPFD, determine the inheritance of the
-	  new handle by O_NOINHERIT flag of original fd.
-
-Fri Nov 18 08:00:41 2011  Ryan Davis  <ryan@lust.zenspider.com>
-
-	* lib/minitest/*: Imported minitest 2.8.1 (r6750)
-	* test/minitest/*: ditto
-	* configure.in: Improved gcc-llvm error message to help people migrate.
-
-Thu Nov 17 20:43:34 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: revert a part of the patch in [ruby-dev:41531].
-	  don't use db.h with other headers.  [ruby-dev:44884].
-
-Thu Nov 17 20:23:03 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* benchmark/bm_io_select[23].rb: use Process::RLIMIT_NOFILE only when
-	  it is defined.  if it is not defined, assume 64 as the max of fds.
-
-Thu Nov 17 10:36:46 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb (load_file): make sure opened yaml files are
-	  also closed. [ruby-core:41088]
-
-Wed Nov 16 18:13:52 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* Makefile.in (LIBRUBY_A): check if generated linked library is
-	  valid for extconf.
-
-Wed Nov 16 13:51:40 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* bignum.c (rb_big2ulong): need to calc in unsigned long, because
-	  the range of VALUE is larger than it on LLP64 platform, such as Win64.
-	  this change fixes the failures of test/-ext-/num2int.
-
-Wed Nov 16 12:02:47 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/webrick/test_cgi.rb (TestWEBrickCGI#start_cgi_server): there are
-	  no guarantee of existence of RbConfig::CONFIG['LIBPATHENV'].
-	  it only exists in Unix-like environments.
-
-	* test/webrick/test_filehandler.rb
-	  (WEBrick::TestFileHandler#test_script_disclosure): ditto.
-
-Wed Nov 16 11:34:20 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (argf_next_argv): wrong timing of setting ecflags.
-	  fixed the failure of TestArgf#test_textmode introduced at r33662.
-
-Wed Nov 16 10:45:00 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/-test-/num2int/num2int.c: remove an unnecessary and wrong decl
-	  of rb_stdout.  it's declared in ruby.h correctly.
-
-Wed Nov 16 10:26:41 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* bignum.c (rb_big2ull): add a cast to get rid of a VC++ warning.
-
-Wed Nov 16 09:39:27 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/minitest/unit.rb (assert_raises): experimental fix to run
-	  correctly on chkbuild over 64bit linux. call exception_details only
-	  when the detail is really needed to avoid create needless inspect
-	  under ulimit-ed environment.
-
-Wed Nov 16 06:34:30 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/ruby/test_thread.rb (test_condvar_timed_wait): use
-	  assert_operator.
-
-Tue Nov 15 21:56:25 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/ruby/test_sleep.rb (test_sleep_5sec): 0.1sec tolerance is too
-	  small for busy environment.
-
-Tue Nov 15 20:08:55 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c, thread.c, ext/pty/pty.c, ext/fiddle/closure.c: use
-	  __linux__ macro for consistency.
-
-Tue Nov 15 14:45:15 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/ruby.h(NUM2LONG, NUM2INT, NUM2SHORT, NUM2LL,
-	  INT2NUM, UINT2NUM, LONG2NUM, ULONG2NUM, NUM2CHR): wrap by
-	  macros.
-
-Tue Nov 15 13:38:14 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* include/ruby/defines.h (FLUSH_REGISTER_WINDOWS): move sparc asm code
-	  to a separate file sparc.c for preventing inlining optimization.
-	  Patched by Jurij Smakov. [Bug #5244] [ruby-core:40685]
-	* sparc.c (rb_sparc_flush_register_windows): ditto.
-	* configure.in: ditto.
-
-Tue Nov 15 13:11:35 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/ruby.h: get rid of gcc specific rb_long2int(),
-	  NUM2LONG(), NUM2INT(), NUM2SHORT(), NUM2LL(), INT2NUM(),
-	  UINT2NUM(), LONG2NUM(), ULONG2NUM() and NUM2CHR()
-	  implementation. Because 1) They don't make any better code
-	  at all. 2) Inline function have a better debugger supoort.
-
-Tue Nov 15 09:58:25 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/ruby/test_io.rb (TestIO#test_fcntl_dupfd): fix OpenBSD test
-	  failure. [ruby-dev:44872]
-
-Tue Nov 15 09:50:21 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* regcomp.c (print_indent_tree): fix double printing of ENCLOSE_OPTION
-	  children bug. patched by Suraj Kurapati. [ruby-core:40964]
-
-Tue Nov 15 01:53:48 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/ruby/test_io.rb (test_fcntl_dupfd): fix test error on
-	  SnowLeopard. Pointed out by CHIKANAGA Tomoyuki. [ruby-dev:44866]
-
-Mon Nov 14 22:06:02 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/openssl/ossl_pkey.c (ossl_pkey_new_from_file): set close-on-exec
-	  flag.
-
-	* ext/openssl/ossl_x509cert.c (rb_fd_fix_cloexec): ditto.
-
-Mon Nov 14 14:54:17 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* bignum.c (rb_big2ull): fix 32bit platform breakage. we must
-	  not assume sizeof(VALUE) == sizeof(LONG_LONG).
-	* test/-ext-/num2int/test_num2int.rb (class TestNum2int):
-	  fix false assumption on 32bit platform.
-
-Mon Nov 14 14:52:54 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* numeric.c (rb_fix2ushort): fix typo. use num rb_num2ushort()
-	  instead of num2uint().
-
-Sun Nov 13 10:31:03 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/ruby.h: add #ifdef comment.
-
-Sun Nov 13 10:28:18 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/ruby.h: add NUM2SHORT(), NUM2USHORT() macros.
-	* numeric.c: ditto.
-
-	* test/-ext-/num2int/test_num2int.rb: add testcases for NUM2SHORT().
-	* ext/-test-/num2int/num2int.c: ditto.
-
-Sun Nov 13 10:23:48 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* bignum.c (rb_big2ull): fix off-by-twice bug of NUM2ULL.
-	* test/-ext-/num2int/test_num2int.rb (class TestNum2int):
-	  fix a testcase too.
-
-Sun Nov 13 10:22:44 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/-ext-/num2int/test_num2int.rb (class TestNum2int):
-	  add FIXNUM tests.
-
-Sun Nov 13 09:57:29 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* numeric.c (check_uint): fix off-by-one bug of NUM2UINT.
-	* bignum.c (rb_big2ulong): fix off-by-one bug of NUM2ULONG.
-
-	* test/-ext-/num2int/test_num2int.rb: add a testcase for NUM2INT()
-	  NUM2UINT(), NUM2LONG(), NUM2ULONG(), NUM2LL and NUM2ULL().
-	* ext/-test-/num2int/depend: ditto.
-	* ext/-test-/num2int/extconf.rb: ditto.
-	* ext/-test-/num2int/num2int.c: ditto.
-
-Sun Nov 13 23:47:29 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dbm/extconf.rb: use convertible_int.
-
-Sun Nov 13 23:45:57 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (checking_for): should not modify the result.
-
-	* lib/mkmf.rb (have_struct_member): accept compiler options.
-
-	* lib/mkmf.rb (convertible_int): add restricted support of struct
-	  member, and TYPEOF_ macro.
-
-Sun Nov 13 23:21:24 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/gdbm/gdbm.c (fgdbm_reorganize): set close-on-exec flag after
-	  gdbm_reorganize().  gdbm_reorganize() opens a new database internally.
-
-Sun Nov 13 19:57:18 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: rollback for each headers for each libraries.
-
-Sun Nov 13 16:24:48 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: treat libc as a choice for a library which
-	  provide ndbm API.
-
-Sun Nov 13 15:40:43 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: duplicate $libs and $defs when save them.
-
-Sun Nov 13 12:43:48 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: rollback $libs and $defs when db detection is
-	  failed.  It fixes -lgdbm -lqdbm when the system has qdbm and gdbm
-	  without gdbm_compat.
-
-Sat Nov 12 21:14:51 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/webrick/test_cgi.rb (class TestWEBrickCGI): respect
-	  RbConfig::CONFIG["LIBPATHENV"]. [Bug #5135] [ruby-core:38653]
-	* test/webrick/test_filehandler.rb (class WEBrick): ditto.
-
-Sat Nov 12 20:57:29 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/ruby/test_io.rb (test_fcntl_dupfd): skip if Fcntl::DUPFD
-	  is not defined. Pointed out by CHIKANAGA Tomoyuki. Thanks.
-
-Sat Nov 12 17:26:10 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (do_ioctl, ioctl_narg_len, setup_narg, rb_ioctl): use
-	  ioctl_req_t.
-
-Sat Nov 12 17:01:49 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dbm/extconf.rb (headers.db_check): reduce duplicated code.
-
-Sat Nov 12 15:59:42 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: dbm_clearerr should be available in all ndbm
-	  implementation.  If it is not available, it is caused by
-	  header/library mismatch such that Berkeley DB header & gdbm library.
-
-	* ext/dbm/dbm.c (fdbm_store): use dbm_clearerr() unconditionally.
-	  gdbm 1.9 provides it as a real function instead of a empty macro.
-
-Sat Nov 12 13:35:33 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* bootstraptest/runner.rb: don't suppress SIGINT.
-	  [Feature #5612] [ruby-dev:44856]
-
-Sat Nov 12 11:20:36 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (fcntl_narg_len): introduce narg calculation for fcntl instead
-	  of hard coded 256.
-	* io.c (setup_narg): ditto.
-
-Sat Nov 12 11:19:35 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/ruby/test_io.rb (test_fcntl_dupfd): add another fcntl test.
-
-Sat Nov 12 11:18:17 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/ruby/test_io.rb (test_fcntl_lock_freebsd): add a testcase
-	  of fcntl lock for freebsd.
-
-Sat Nov 12 11:16:32 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (ioctl_narg_len): Linux doesn't have IOCPARM_LEN macro, but
-	  has _IOC_SIZE. support it.
-
-Sat Nov 12 11:13:18 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (rb_ioctl): don't expose our sanity check value to ruby script.
-	  It may change string value meaning if the value is string.
-	  (e.g. MacOS X has F_GETPATH ioctl)
-	* io.c (rb_fcntl): ditto.
-
-Sat Nov 12 11:06:02 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (ioctl_req_t): Type of req argument of ioctl() depend on platform.
-	  Moreover almost all linux ioctl can't be represented by 32bit integer
-	  (i.e. MSB is 1). We need wrap ioctl argument type.
-	  [Bug #5429] [ruby-dev:44589]
-	* io.c (struct ioctl_arg): ditto.
-	* io.c (rb_ioctl): ditto.
-	* test/ruby/test_io.rb (test_ioctl_linux): add a testcase for ioctl
-
-Sat Nov 12 11:00:42 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (struct io_cntl_arg): remove io_p member.
-	* io.c (nogvl_fcntl, do_fcntl, rb_fcntl): separated from ioctl functions.
-	* io.c (nogvl_io_cntl): remove fcntl depended logic.
-	* io.c (io_cntl): ditto.
-	* io.c (rb_io_ctl): ditto.
-	* io.c (rb_io_ioctl): ditto.
-
-Sat Nov 12 10:59:49 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (setup_narg): fix off by one bug.
-
-Sat Nov 12 10:56:43 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (+setup_narg): factor out length calculation logic.
-	* io.c (rb_io_ctl): ditto.
-
-Sat Nov 12 10:52:17 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (+ioctl_narg_len) new helper function.
-	* io.c (rb_io_ctl): don't use ioctl specific length check
-	  if caller is fcntl.
-
-Fri Nov 11 23:00:46 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: db_prefix is not required now.
-
-Fri Nov 11 21:13:30 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/gdbm/gdbm.c (fgdbm_initialize): use GDBM_CLOEXEC if available.
-
-Fri Nov 11 21:00:05 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: fix dbm_pagfno and dbm_dirfno detection with
-	  Berkeley DB.  Macro definitions needs arguments to detect correctly.
-	  SIZEOF_DSIZE needs -DDB_DBM_HSEARCH because db.h defines datum type
-	  only if DB_DBM_HSEARCH is defined.
-
-Fri Nov 11 18:41:57 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* process.c (proc_seteuid): separate an internal wrapper function
-	  from the method implementation.
-
-Fri Nov 11 17:21:15 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (have_library, find_library, have_func): allow
-	  arguments of function to be checked.
-
-Fri Nov 11 17:09:45 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_dump.c (HAVE_BACKTRACE): fallback to 0.
-
-	* vm_dump.c (rb_vm_bugreport): show "Other runtime information"
-	  header only when available.
-
-	* vm_dump.c (rb_vm_bugreport): get rid of modifying the content of
-	  VM directly.
-
-	* vm_dump.c (rb_vm_bugreport): check if vm is non-null.
-	  Pointed out by Ikegami Daisuke <ikegami.da@gmail.com>.
-	  Thank you.
-
-Fri Nov 11 12:36:37 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* io.c (pipe_open): Remove fflush(stdin). it's no effect.
-	  Pointed out by Ikegami Daisuke <ikegami.da@gmail.com>.
-	  Thank you.
-
-Fri Nov 11 07:33:30 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/http.rb (Net::HTTP::SSL_ATTRIBUTES):  Use symbol keys instead
-	  of string keys to avoid duplicating parameters in
-	  OpenSSL::SSL:SSLContext#set_params.
-
-Thu Nov 10 15:02:37 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (have_library, have_func, have_var, have_header):
-	  add compiler option parameter.
-
-Thu Nov 10 07:45:16 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/lib/openssl/ssl.rb (class OpenSSL::SSL::SSLContext):
-	  Document #set_params.
-
-Wed Nov  9 11:36:53 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (gvl_yield): don't prevent concurrent sched_yield().
-	  [Bug #5130] [ruby-core:38647]
-
-Wed Nov  9 23:20:22 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_update_max_fd): fstat(2) can fail with other than
-	  EBADF.  [ruby-dev:44837] [Bug #5593].  Cf.
-	  http://pubs.opengroup.org/onlinepubs/9699919799/functions/fstat.html
-
-	* io.c (rb_sysopen): max fd is updated in rb_sysopen_internal()
-	  already.
-
-Wed Nov  9 22:13:38 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_file.rb (TestFile#test_utime_with_minus_time_segv):
-	  fixed previous commit.
-
-Wed Nov  9 19:53:45 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_file.rb (TestFile#test_utime_with_minus_time_segv):
-	  add test for r33685.
-
-Wed Nov  9 19:00:44 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* test/ruby/test_fiber.rb: add tests for r33684 (Fiber#resume).
-
-Wed Nov  9 16:40:49 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (unixtime_to_filetime): should check the return value
-	  of localtime().  reported by snowjail at gmail.com.
-	  [ruby-dev:44838] [Bug #5596]
-
-Thu Nov  9 13:17:25 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* cont.c (rb_fiber_m_transfer, rb_fiber_resume): prohibit using
-	  "resume" after "transfer" method are used.  You should not mix
-	  "resume" fiber and "transfer" fiber.
-	  [Bug #5526]
-
-	* NEWS: add information about this change.
-
-Wed Nov  9 11:40:37 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* template/Doxyfile.tmpl (INCLUDE_PATH): add srcdir and include.
-	  [ruby-core:40843] [Bug #5597]
-
-Wed Nov  9 11:02:54 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* thread.c (do_select): fix cast, tv_sec is time_t.
-
-Wed Nov  9 10:32:20 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: should not use test -e for portability.
-	  [ruby-core:40841] [Bug #5594]
-
-Wed Nov  9 04:52:16 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/tree_builder.rb: dump complex numbers,
-	  rationals, etc with reference ids.
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: ditto
-	* ext/psych/lib/psych/visitors/to_ruby.rb: loading complex numbers,
-	  rationals, etc with reference ids.
-	* test/psych/test_object_references.rb: corresponding tests
-
-Tue Nov  8 23:34:37 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dbm/dbm.c (fdbm_fetch, fdbm_key, fdbm_delete, fdbm_store)
-	  (fdbm_has_key, fdbm_has_value): get rid of overflow.
-
-	* ext/gdbm/gdbm.c (rb_gdbm_fetch2, rb_gdbm_nextkey)
-	  (rb_gdbm_delete, fgdbm_store, fgdbm_has_key): ditto.
-
-	* ext/dbm/dbm.c (fdbm_delete_if): hide intermediate objects.
-
-	* ext/gdbm/gdbm.c (fgdbm_delete_if): ditto.
-
-	* ext/dbm/extconf.rb: check size of datum.dsize to get rid of
-	  overflow.
-
-Tue Nov  8 23:30:21 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* addr2line.c (PATH_MAX): define if not defined. [ruby-core:40840]
-
-Tue Nov  8 23:26:49 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/tk/tcltklib.c (rb_thread_critical): fix type.
-
-	* ext/tk/tcltklib.c (eventloop_sleep, lib_eventloop_core): int is
-	  enough for micro seconds.  may need to check overflow in the
-	  setter though.
-
-	* ext/tk/tcltklib.c (RSTRING_LENINT): check overflow if necessary.
-
-	* ext/tk/tcltklib.c (RbTk_ALLOC_N): wrapper for ckalloc() which
-	  takes an int.
-
-	* ext/tk/tcltklib.c (ip_ruby_cmd_receiver_get, tcltklib_compile_info):
-	  get rid overflow.
-
-	* ext/tk/tcltklib.c (tcltklib_compile_info): constified.
-
-Tue Nov  8 20:50:45 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/dbm/test_dbm.rb: split tests for read only database.
-
-	* test/gdbm/test_gdbm.rb: ditto.
-
-Tue Nov  8 18:59:07 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/pty/pty.c (MasterDevice): define only when used.
-	  (SlaveDevice): ditto.
-	  (deviceNo): ditto.
-
-Tue Nov  8 17:59:24 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/ruby.h (rb_long2int): define as a macro always, so
-	  that cpp conditionals can tell if it is provided.
-
-Tue Nov  8 17:30:50 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (cpp_command): remove multiple -arch flags since cpp
-	  cannot work.
-
-Tue Nov  8 14:50:55 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (io_fwrite): call rb_w32_write_console() only if FMODE_TTY is
-	  set.  this is the one of the reason of IO writing slowness of Windows
-	  in 1.9.3 or later.
-
-Tue Nov  8 11:01:04 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/pty/pty.c (get_device_once): FreeBSD 8 supported O_CLOEXEC flag
-	  for posix_openpt, but FreeBSD 9's posix_openpt doesn't support
-	  O_CLOEXEC and fails if specified.
-
-Tue Nov  8 02:36:45 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* include/ruby/encoding.h (ECONV_NEWLINE_DECORATOR_READ_MASK,
-	  ECONV_NEWLINE_DECORATOR_WRITE_MASK): new macro.
-
-	* io.c (rb_io_extract_modeenc, pipe_open, prep_stdio, argf_next_argv):
-	  set TEXTMODE_NEWLINE_DECORATOR_ON_WRITE for textmode on creating IO
-	  if the flag is available.
-
-	* io.c (make_writeconv): drop decorators for reading.
-
-	* io.c (make_readconv): drop decorators for writing.
-
-	* io.c (do_writeconv): existing writeconv is not the condition to raise
-	  ArgumentError.  should check textmode or not.
-
-	* test/ruby/test_io_m17n.rb
-	  (TestIO_M17N#test_{cr,lf,crlf}_decorator_on_stdout): test above
-	  changes.
-
-Mon Nov  7 22:03:47 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/gdbm/gdbm.c (fgdbm_initialize): set close-on-exec flag.
-
-Mon Nov  7 20:31:52 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/scalar_scanner.rb: make sure strings that look
-	  like base 60 numbers are serialized as quoted strings.
-	* test/psych/test_string.rb: test for change.
-
-Mon Nov  7 20:26:37 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* test/psych/test_yamlstore.rb: make test case inherit from MiniTest,
-	  load psych/helper so that psych is loaded.
-
-Mon Nov  7 20:18:29 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* test/psych/test_yamldbm.rb: Test case should inherit from MiniTest,
-	  load psych/helper so that psych and friends are loaded.
-
-Mon Nov  7 20:15:44 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/extconf.rb: check dbm_pagfno() and dbm_dirfno().
-
-	* ext/dbm/dbm.c: use above to set close-on-exec flag.
-
-Mon Nov  7 20:05:16 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (io_fflush): remove fsync().
-
-	* io.c (rb_io_flush, rb_io_rewind): fsync() here.
-
-	these changes reduces fsync() calls to improve performance.
-	first reported at [ruby-list:48515] by ak7 at mail.goo.ne.jp .
-	[Bug #5585]
-
-Mon Nov  7 19:43:10 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_close_before_exec): use F_MAXFD if available.
-	  F_MAXFD is available on NetBSD since NetBSD 2.0.
-
-Mon Nov  7 19:25:16 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io_m17n.rb
-	  (TestIO_M17N#test_default_stdout_stderr_mode): new test for
-	  r33627-33629.  see [backport #5565]
-
-Mon Nov  7 01:14:22 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* lib/debug.rb: add help for 'pp' and 'r[estart]'. patch
-	  from Sho Hashimoto. [Bug #5093] [ruby-dev:44222]
-
-Sun Nov  6 14:49:58 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/rubysocket.h (rsock_recvmsg): declared.
-
-	* ext/socket/ancdata.c (rsock_recvmsg): extracted from
-	  nogvl_recvmsg_func.
-	  (nogvl_recvmsg_func): use rsock_recvmsg.
-
-	* ext/socket/unixsocket.c (recvmsg_blocking): use rsock_recvmsg.
-
-Sun Nov  6 03:22:36 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_engine.rb: add test for engine cipher. RC4 is used
-	  because AES is not supported by the "openssl" engine currently.
-
-Sun Nov  6 00:11:52 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/test/unit.rb (Test::Unit::Options#non_options): options[:ruby]
-	  should be an array.  This fixes
-	  "./ruby test/runner.rb test/testunit/test_parallel.rb"
-	  [ruby-dev:44782]
-
-Sat Nov  5 20:30:30 2011  Martin Duerst  <duerst@it.aoyama.ac.jp>
-
-	* insns.def: Some fixes and tweaks to English explanations
-
-Sat Nov  5 19:11:50 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_cloexec_fcntl_dupfd): don't clear try_dupfd_cloexec if
-	  fcntl(F_DUPFD) failed as fcntl(F_DUPFD_CLOEXEC).
-
-Sat Nov  5 18:05:12 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_socketpair0): refactored.
-
-Sat Nov  5 17:55:52 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/init.c (rsock_socket0): don't clear try_sock_cloexec if
-	  SOCK_CLOEXEC is not a reason for EINVAL.
-
-Sat Nov  5 16:27:52 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* ext/pathname/lib/pathname.rb, ext/tk/lib/multi-tk.rb,
-	  ext/tk/sample/demos-en/widget, lib/benchmark.rb, lib/irb/cmd/fork.rb,
-	  lib/mkmf.rb, lib/net/ftp.rb, lib/net/smtp.rb, lib/open3.rb,
-	  lib/pstore.rb, lib/rexml/element.rb, lib/rexml/light/node.rb,
-	  lib/rinda/tuplespace.rb, lib/rss/maker/base.rb,
-	  lib/rss/maker/entry.rb, lib/scanf.rb, lib/set.rb, lib/shell.rb,
-	  lib/shell/command-processor.rb, lib/shell/process-controller.rb,
-	  lib/shell/system-command.rb, lib/uri/common.rb: remove unused block
-	  arguments to avoid creating Proc objects.
-
-Sat Nov  5 15:45:04 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/init.c (rsock_socket0): extract single socket() call with
-	  CLOEXEC handling from rsock_socket.
-
-Sat Nov  5 13:49:40 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* lib/pathname.rb (Pathname#find): return an enumerator if
-	  no block is given.
-
-	* test/pathname/test_pathname.rb: add tests for above.
-
-	[ruby-dev:44797] [Feature #5572]
-
-Sat Nov  5 11:18:12 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_socketpair0): don't clear
-	  try_sock_cloexec if SOCK_CLOEXEC is not a reason for EINVAL.
-
-Fri Nov  4 14:08:19 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/openssl/ossl_pkey_rsa.c (rsa_generate): [SECURITY] Set RSA
-	  exponent value correctly.  Awful bug.  This bug caused exponent of
-	  generated key to be always '1'.  By default, and regardless of e
-	  given as a parameter.
-
-	  !!! Keys generated by this code (trunk after 2011-09-01) must be
-	  re-generated !!! (ruby_1_9_3 is safe)
-
-	* test/openssl/test_pkey_rsa.rb: Add tests for default exponent and
-	  specifying exponent by a parameter.
-
-Fri Nov  4 01:31:25 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_engine.rb: add first tests for builtin "openssl"
-	  engine.
-
-Fri Nov  4 08:41:26 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/extconf.rb:
-	* ext/openssl/ossl_engine.c: add some missing OpenSSL engines.
-	  Thanks, Yui Naruse, for providing the patch!
-	  [Bug #5548] [ruby-core:40670]
-
-Fri Nov  4 04:54:10 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/configure.bat: disable delayed expansion of enironment variable.
-	  [Bug #5517] [ruby-core:40531]
-
-Fri Nov  4 03:45:22 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (make_writeconv): fixed typo of previous commit.
-
-Fri Nov  4 01:56:30 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (make_writeconv): unversal_newline converter is for reading.
-	  so, if the io is text mode and has ECONV_UNIVERSAL_NEWLINE_DECORATOR
-	  flag, use crlf_newline converter for writing.
-	  this change fixes the problem about the luck of CR up Kernel.p and
-	  Kernel.puts to stdout/stderr on Windows.
-
-Fri Nov  4 01:04:48 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/readline/readline.c (Init_readline): like r18313, libedit's
-	  replace_history_entry may use offset instead of which.
-	  so introduce history_replace_offset_func and initialize it.
-
-	* ext/readline/readline.c (hist_set): use history_replace_offset_func.
-
-Fri Nov  4 00:53:35 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/readline/readline.c (Init_readline): fix wrong condition.
-
-Thu Nov  3 23:53:04 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* encoding.c (rb_locale_charmap): ignore calling nl_langinfo_codeset()
-	  on Windows except cygwin. [experimental]
-
-Thu Nov  3 22:45:09 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_socketpair0): extracted from
-	  rsock_socketpair to set close-on-exec flag for each socketpair()
-	  call.
-
-Thu Nov  3 22:12:41 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* ext/socket/init.c (rsock_socket): set close-on-exec flag when
-	  SOCK_CLOEXEC is not available.
-
-Thu Nov  3 08:36:00 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_engine.rb: call Engine::cleanup on exit.
-	  Patch provided by Yui Naruse, thanks!
-	  [Bug #5547] [ruby-core:40669]
-
-Wed Nov  2 21:36:00 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* complex.c (nucomp_rationalize): fix function.  [ruby-core:40667]
-	  [Bug #5546]
-
-Wed Nov  2 08:16:45 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/webrick/utils.rb: fix fcntl call.
-
-	* lib/drb/unix.rb: ditto.
-
-Wed Nov  2 00:43:59 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/psych/test_yamldbm.rb: avoid platform dependency.
-	  patch by Naohisa Goto. [ruby-dev:44763] [Bug #5535]
-	* test/syck/test_yamldbm.rb: ditto.
-
-Wed Nov  2 00:14:15 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* test/ruby/test_marshal.rb: renamed methods duplicated with those
-	  of marshaltestlib.rb.
-
-Tue Nov  1 22:08:27 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: reject llvm-gcc.
-
-Tue Nov  1 21:39:00 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (rb_cloexec_pipe): remove workaround of r33587.
-	  The bug of NetBSD is fixed on Mon Oct 31 21:31:29 UTC 2011.
-	  http://gnats.netbsd.org/cgi-bin/query-pr-single.pl?number=45545
-
-Tue Nov  1 19:49:08 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_io_reopen): call rb_fd_fix_cloexec instead of
-	  rb_maygvl_fd_fix_cloexec.
-
-Tue Nov  1 19:00:30 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_io_reopen): call rb_maygvl_fd_fix_cloexec after freopen().
-
-Tue Nov  1 17:17:26 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* file.c (file_expand_path): reset coderange after expanding path.
-
-Tue Nov  1 14:55:29 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (nogvl_io_cntl): rb_cloexec_fcntl_dupfd's 2nd argument is int.
-
-	* process.c (move_fds_to_avoid_crash): ditto.
-
-Tue Nov  1 13:14:33 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vsnprintf.c (BSD_vfprintf): support 'll' prefix.
-
-	* vsnprintf.c (__sfeof): rename to avoid the collision with NetBSD's
-	  one.
-
-	* vsnprintf.c (__sferror): ditto.
-
-	* vsnprintf.c (__sclearerr): ditto.
-
-	* vsnprintf.c (__sfileno): ditto.
-
-Tue Nov  1 12:36:16 2011  Tanaka Akira  <akr@fsij.org>
-
-	* internal.h (rb_maygvl_fd_fix_cloexec): change the visibility for
-	  ext/socket.
-
-Tue Nov  1 12:00:53 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_maygvl_fd_fix_cloexec): renamed from fd_set_cloexec.
-
-	* internal.h (rb_maygvl_fd_fix_cloexec): declared.
-
-	* ext/socket/init.c (cloexec_accept): use rb_maygvl_fd_fix_cloexec.
-	  (rsock_s_accept_nonblock): use rb_update_max_fd.
-	  (rsock_s_accept): use rb_update_max_fd.
-
-Tue Nov  1 08:24:40 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/init.c (cloexec_accept): new function to use accept4 if
-	  available.
-	  (rsock_s_accept_nonblock): use cloexec_accept.
-	  (accept_blocking): ditto.
-
-	* ext/socket/extconf.rb: check accept4.
-
-Tue Nov  1 07:31:55 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ancdata.c (nogvl_recvmsg_func): use MSG_CMSG_CLOEXEC if
-	  available.
-
-	* ext/socket/unixsocket.c (recvmsg_blocking): ditto.
-
-Tue Nov  1 05:59:41 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_socketpair): use SOCK_CLOEXEC if
-	  available.
-
-Tue Nov  1 02:56:17 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ruby.c (load_file_internal): convert the encoding of load path if
-	  needed by platform.  calling open() was replaced by rb_cloexec_open()
-	  at r33549, but the function expected UTF-8 pathname on Windows.
-	  (open() expected "locale" pathname.)
-	  reported by taco via IRC.
-
-	* ruby.c (load_file): change the type of the 2nd parameter to pass its
-	  encoding to load_file_internal().
-
-	* ruby.c (process_options, rb_load_file): follow above change.
-	  NOTE: we should pass encoding information to rb_load_file().
-
-Mon Oct 31 23:49:38 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/socket.c (rsock_socketpair): extracted from
-	  rsock_sock_s_socketpair.
-
-Mon Oct 31 23:31:53 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/init.c (rsock_socket): use SOCK_CLOEXEC if available.
-
-Mon Oct 31 21:47:44 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (rb_cloexec_pipe): NetBSD 6.0 will support pipe2(2),
-	  but its return value is -1 or larger than 0.
-
-Mon Oct 31 22:04:54 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/dbm/dbm.c (fdbm_initialize): use O_CLOEXEC if available.
-
-Mon Oct 31 21:47:48 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_fd_fix_cloexec): renamed from
-	  rb_fd_set_cloexec.
-
-	* io.c: follow the above renaming.
-
-	* ext/pty/pty.c: ditto.
-
-	* ext/socket/init.c: ditto.
-
-	* ext/socket/socket.c: ditto.
-
-	* ext/socket/ancdata.c: ditto.
-
-	* ext/socket/unixsocket.c: ditto.
-
-Mon Oct 31 21:02:43 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb (Resolv::DNS): retry IO.select for premature wakeup.
-
-Mon Oct 31 20:14:22 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (fd_set_cloexec): clear CLOEXEC flag for standard file
-	  descriptors.
-	  (rb_cloexec_dup): use rb_cloexec_fcntl_dupfd.
-	  (rb_cloexec_fcntl_dupfd): use F_DUPFD_CLOEXEC if available.
-
-Mon Oct 31 19:14:11 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/resolv/test_dns.rb: don't check maximum slept time.
-	  ruby doesn't guarantee the maximum time because it is not a
-	  realtime application.
-
-Mon Oct 31 13:10:06 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (setfl): extract from fcntl().
-
-	* win32/win32.c (dupfd): new function to support F_DUPFD. based on a
-	  patch written by akr.
-
-	* win32/win32.c (fcntl): use above functions.
-
-	* include/ruby/win32.h (F_DUPFD): define. [experimental]
-
-	* include/ruby/win32.h (F_SETFL): change the value to correspond with
-	  other platforms.
-
-Mon Oct 31 12:37:50 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/pty/pty.c (get_device_once): use O_CLOEXEC for posix_openpt if
-	  available.
-
-Mon Oct 31 12:05:24 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_cloexec_dup2): check oldfd == newfd at first.
-	  pointed by KOSAKI Motohiro.  [ruby-dev:44713]
-
-Mon Oct 31 10:50:26 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* io.c (rb_cloexec_fcntl_dupfd): this function needs F_DUPFD.
-
-	* io.c (nogvl_io_cntl): use rb_cloexec_fcntl_dupfd() only if the
-	  platform has F_DUPFD.
-
-Mon Oct 31 00:50:00 2011  Luis Lavena  <luislavena@gmail.com>
-
-	* configure.in: check -fno-omit-frame-pointer acceptance and usage
-	  under MinGW. [ruby-core:39957] [Bug #5407]
-
-Mon Oct 31 00:16:11 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_cloexec_fcntl_dupfd): declared.
-
-	* io.c (rb_cloexec_fcntl_dupfd): new function.
-	  (nogvl_io_cntl): use rb_cloexec_fcntl_dupfd.
-
-	* process.c (move_fds_to_avoid_crash): use rb_cloexec_fcntl_dupfd.
-
-Sun Oct 30 22:46:46 2011  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: check pipe2.
-
-	* io.c (rb_cloexec_pipe): use pipe2 if available.
-
-Sun Oct 30 22:32:44 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ruby.c (fill_standard_fds): use fstat() instead of fcntl(F_GETFD)
-	  for MinGW.  reported by Luis Lavena.  [ruby-core:40526] [Bug #5516]
-
-Sun Oct 30 21:12:47 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_cloexec_pipe): declared.
-
-	* io.c (rb_cloexec_pipe): new function.
-	  (rb_pipe): use rb_cloexec_pipe.
-
-	* thread_pthread.c (rb_thread_create_timer_thread): use
-	  rb_cloexec_pipe.
-
-Sun Oct 30 20:06:07 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_cloexec_dup): refine control flow.
-	  (rb_cloexec_dup2): ditto.
-
-Sun Oct 30 18:45:50 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ruby.c (fill_standard_fds): new function to open closed standard
-	  file descriptors.
-	  (ruby_sysinit): call fill_standard_fds.
-
-Sun Oct 30 10:50:36 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/rbinstall.rb (install_recursive, bin-comm): split mere
-	  string not path name.  [ruby-core:40462] [Bug #5492]
-
-Sun Oct 30 10:47:20 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_cloexec_dup, rb_cloexec_dup2): CLOEXEC has been set if
-	  dup3 succeeded.
-
-Sun Oct 30 09:58:48 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_cloexec_dup): don't allocate standard file descriptors.
-
-Sun Oct 30 08:29:51 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_cloexec_dup2): don't set CLOEXEC for standard file
-	  descriptors.
-
-Sun Oct 30 07:47:10 2011  Tanaka Akira  <akr@fsij.org>
-
-	* configure.in: check dup3.
-
-	* io.c (rb_cloexec_dup2): use dup3 if available.
-
-Sat Oct 29 22:06:37 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_cloexec_dup2): declared.
-
-	* io.c (rb_cloexec_dup2): new function.
-	  (io_reopen): use rb_cloexec_dup2.
-
-Sat Oct 20 21:08:18 2011  Tajima Akio <artonx@yahoo.co.jp>
-
-	* win32/Makefile.sub (CONFIG_H): have stdint.h if VC2010.
-	  [Bug #5243]
-
-Sat Oct 29 20:59:08 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_cloexec_dup): use F_DUPFD_CLOEXEC if available.
-
-Sat Oct 29 20:00:26 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_cloexec_dup): declared.
-
-	* io.c (rb_cloexec_dup): new function.
-	  (ruby_dup): use rb_cloexec_dup.
-
-	* ext/pty/pty.c (pty_getpty): use rb_cloexec_dup.
-
-	* ext/openssl/ossl_bio.c (ossl_obj2bio): ditto.
-
-Sat Oct 29 16:11:34 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/sdbm/_sdbm.c (sdbm_prep): use O_CLOEXEC if available.
-
-Sat Oct 29 14:26:56 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_cloexec_open): use O_CLOEXEC if available.
-
-Sat Oct 29 12:57:15 2011  Tanaka Akira  <akr@fsij.org>
-
-	* process.c (ruby_setsid): use rb_cloexec_open.
-	  (rb_daemon): ditto.
-
-	* ruby.c (load_file_internal): ditto.
-
-	* file.c (rb_file_s_truncate): ditto.
-	  (file_load_ok): ditto.
-
-	* random.c (fill_random_seed): ditto.
-
-	* ext/pty/pty.c (chfunc): ditto.
-	  (get_device_once): ditto.
-
-	* ext/io/console/console.c (console_dev): ditto.
-
-Sat Oct 29 10:40:19 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_cloexec_open): declared.
-
-	* io.c (fd_set_cloexec): extracted from rb_fd_set_cloexec.
-	  (rb_cloexec_open): new function.
-	  (sysopen_func): use rb_cloexec_open.
-	  (rb_sysopen_internal): use rb_update_max_fd instead of
-	  rb_fd_set_cloexec.
-
-Sat Oct 29 09:05:07 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread_pthread.h: no Structured Exception Handling like macros.
-	  [ruby-core:40432] [Bug #5491]
-
-Fri Oct 28 22:05:34 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/sdbm/_sdbm.c: RCS $Id$ removed.
-
-Thu Oct 27 18:58:00 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* parse.y (parser_nextc): set encoding for the buffer of ripper.
-
-Fri Oct 28 06:06:08 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/sdbm/_sdbm.c (sdbm_prep): set FD_CLOEXEC flags for file
-	  descriptors.
-	  (fd_set_cloexec): new function.
-
-Fri Oct 28 03:01:27 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* vm_insnhelper.c (vm_call_cfunc): adding back useless hack.  For some
-	  reason, this fixes CFP errors on OS X 10.7.
-
-Fri Oct 28 00:09:31 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/sdbm/_sdbm.c (sdbm_prep): refactored for less nesting.
-
-Thu Oct 27 18:28:18 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_DEFINE_IF): revert r33534 partially to get
-	  rid of AS_ECHO which is not available in autoconf 2.61.
-	  [ruby-dev:44702]
-
-Thu Oct 27 16:10:46 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* bignum.c (rb_big_divide): raise ZeroDivisionError if divisor is
-	  zero, as well as Fixnum.  [ruby-core:40429] [Bug #5490]
-
-Thu Oct 27 14:56:22 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_FUNC_ATTRIBUTE): unset temporary variable.
-
-	* configure.in (RUBY_STACK_GROW_DIRECTION): substitute CPU name as
-	  shell variable name.  based on the patch by The Written Word Inc. at
-	  [ruby-core:40421].  [Bug #5488]
-
-Thu Oct 27 09:57:56 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* include/ruby/ruby.h (SIZE_MAX): define SIZE_MAX if not defined.
-	  patched by The Written Word Inc. [ruby-core:40422] [Bug #5489]
-
-Thu Oct 27 08:47:38 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/psych/parser.c: remove unused variable.
-
-Thu Oct 27 08:38:41 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/extconf.rb: add -Wall flag by default when compiler is
-	  GCC.
-
-Wed Oct 26 15:24:25 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* file.c (rb_file_join): honor input encodings than ASCII-8BIT.
-	  [ruby-core:40338] [Bug #5483]
-
-Tue Oct 25 21:52:31 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/defines.h: use "__sparc" instead of "sparc" and
-	  "__sparc__".
-
-	* dln.c: ditto.
-
-	  [ruby-dev:44694]
-
-Tue Oct 25 06:34:39 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* re.c (match_aref):  Use <code> around indexing examples to prevent
-	  hyperlinks.  [ruby-talk:389396]
-
-Mon Oct 24 23:55:31 2011  Tanaka Akira  <akr@fsij.org>
-
-	* complex.c: use "__sun" instead of "__sun__" to detect SunOS.
-
-	* math.c: ditto.
-
-	* hash.c: ditto.
-
-	* atomic.h: ditto.
-
-	* ext/io/wait/wait.c: ditto.
-
-	[ruby-dev:44693]
-
-Mon Oct 24 22:45:37 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c: use "__sun" instead of "sun" to detect SunOS.
-
-	* dln.c: ditto.
-
-	* cont.c: ditto.
-
-	* ext/sdbm/_sdbm.c: ditto.
-
-	[ruby-dev:44693]
-
-Mon Oct 24 22:38:08 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/pty/pty.c (get_device_once): delay rb_fd_set_cloexec() until
-	  grantpt() on Solaris.  grantpt() doesn't work with CLOEXEC on
-	  Solaris 10.
-	  reported by Naohisa GOTO.  [ruby-dev:44688] [Bug #5475]
-
-Mon Oct 24 08:18:14 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (copy_stream_fallback_body): check nil for EOF of read method.
-	  patch by Eric Wong.  [ruby-core:39134] [Bug #5237]
-
-Sun Oct 23 18:21:23 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* ext/tk/MANUAL_tcltklib.eng: fix typo.
-
-Sun Oct 23 18:03:31 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* numeric.c (rb_infinity, rb_nan): aggregated member initializers
-	  need braces.
-
-Sun Oct 23 16:43:43 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* ext/io/wait/wait.c: ioctl(2) is declared in unistd.h on Solaris.
-
-Sun Oct 23 16:33:35 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/tk/MANUAL_tcltklib.eng: fix typo. reported by Mimura-san.
-	  [ruby-dev:44683] [Bug #5471]
-
-Sun Oct 23 08:01:29 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_fd_set_cloexec): set close-on-exec flag only if F_GETFD is
-	  defined.  reported by Luis Lavena.  [ruby-core:40281] [Bug #5470]
-
-Sat Oct 22 19:48:50 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/openssl/test_ssl.rb (test_multibyte_read_write): start server
-	  for each length to avoid race condition.
-
-Sat Oct 22 18:49:24 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_fd_set_cloexec): declared.
-
-	* io.c (rb_fd_set_cloexec): new function.
-	  (ruby_dup): call rb_fd_set_cloexec to set close-on-exec flag.
-	  (rb_sysopen_internal): ditto.
-	  (rb_pipe): ditto.
-	  (io_reopen): ditto.
-	  (io_cntl): ditto.
-
-	* process.c (rb_f_exec): change the default :close_others option to
-	  true.
-	  (rb_f_system): ditto.
-	  (move_fds_to_avoid_crash): call rb_fd_set_cloexec to set
-	  close-on-exec flag.
-	  (ruby_setsid): ditto.
-	  (rb_daemon): ditto.
-
-	* thread_pthread.c (rb_thread_create_timer_thread): call
-	  rb_fd_set_cloexec to set close-on-exec flag.
-
-	* ruby.c (load_file_internal): ditto.
-
-	* file.c (rb_file_s_truncate): ditto.
-	  (file_load_ok): ditto.
-
-	* random.c (fill_random_seed): ditto.
-
-	* ext/pty/pty.c (chfunc): ditto.
-	  (get_device_once): ditto.
-
-	* ext/openssl/ossl_bio.c (ossl_obj2bio): ditto.
-
-	* ext/socket/init.c (rsock_socket): ditto.
-	  (rsock_s_accept_nonblock): ditto.
-	  (rsock_s_accept): ditto.
-
-	* ext/socket/socket.c (rsock_sock_s_socketpair): ditto.
-
-	* ext/socket/ancdata.c (discard_cmsg): ditto.
-	  (make_io_for_unix_rights): ditto.
-
-	* ext/socket/unixsocket.c (unix_recv_io): ditto.
-
-	* ext/io/console/console.c (console_dev): ditto.
-
-	[ruby-core:38140] [Feature #5041]
-
-Sat Oct 22 17:46:27 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb: fix a exception name in previous patch.
-
-Sat Oct 22 17:43:33 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/resolv.rb: make timeout configurable for DNS query.
-	  patch by Eric Wong.  [ruby-core:38533] [Feature #5100]
-
-Sat Oct 22 02:07:48 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* numeric.c (rb_infinity, rb_nan): use union to prevent bus error
-	  caused by misalignment.  [Bug #5469] [ruby-dev:44657]
-
-	* include/ruby/missing.h (INFINITY, NAN): ditto
-
-Fri Oct 21 22:02:17 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (initial_params): pack in a struct.
-
-	* gc.c (rb_gc_set_params): set parameters always.
-	  [ruby-dev:44648] [Bug #5467]
-
-Fri Oct 21 12:10:20 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* atomic.h: change Solaris checking macro because atomic_ops can work
-	  not only with Sun Studio but also with Fujitsu C Compiler.
-
-Fri Oct 21 02:11:00 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_ns_spki.c: Complete documentation.
-	* test/openssl/test_ns_spki.rb: Integrate SPKI#to_text.
-
-Thu Oct 20 22:47:28 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (socklist_insert, socklist_lookup, socklist_delete):
-	  new functions to wrap of st_insert(), st_lookup() and st_delete() to
-	  socklist.
-	  allocating socklist is deferred until it is really needed.
-
-	* win32/win32.c (exit_handler): delete socklist only if it is
-	  initialized.
-
-	* win32/win32.c (rb_w32_sysinit, StartSockets): refactoring: move
-	  initialization of select_mutex to StartSockets().
-
-	* win32/win32.c (exit_handler): refactoring: delete select_mutex only
-	  if winsock is used.
-
-Thu Oct 20 22:38:53 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_pkcs5.c: add note on timing attacks and general
-	  documentation.
-
-Thu Oct 20 21:19:15 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* vm_eval.c (check_funcall): set array elements one-by-one to fix
-	  compile error with Fujitsu C Compiler 5.6 on Solaris 10 on Sparc.
-	  [Bug #5464] [ruby-dev:44632]
-
-Thu Oct 20 13:09:35 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/defines.h (flush_register_windows): use software
-	  trap on Debian Sparc 32-bit userspace.  [Bug #5244]
-
-Thu Oct 20 12:28:22 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_pkcs5.rb: add RFC 6070 tests for PBKDF2 with
-	  HMAC-SHA1
-
-Thu Oct 20 11:42:23 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* util.c (mmprepare): fix for fragmental size.
-
-	* util.c (mmswap_, mmrot3_): portability improvement.
-
-Thu Oct 20 05:58:02 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/ossl_ns_spki.c (Init_ossl_ns_spki):  Stub documentation
-	  for Netscape SPKI.
-
-Thu Oct 20 05:13:39 2011  Ryan Davis  <ryand-ruby@zenspider.com>
-
-	* lib/minitest/*: Imported minitest 2.6.2 (r6712)
-	* test/minitest/*: ditto
-
-Thu Oct 20 06:55:32 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* lib/openssl/buffering.rb: Force multi-byte strings to be treated as
-	  binary data.
-	* test/openssl/test_ssl.rb: Add test for it.
-
-	Thanks to Niklas Baumstark for reporting the issue!
-
-	[Ruby 1.9 - Bug #5233] [ruby-core:39120]
-
-Wed Oct 19 17:06:54 2011  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* version.h (RUBY_VERSION): finally declare start of 2.0 work!
-
-Wed Oct 19 11:48:44 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* error.c (Init_Exception):  Document $! and $@.  Provide
-	  recommendations for creating exceptions for a library.
-
-Wed Oct 19 11:25:46 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* error.c (Init_Exception):  Add hierarchy of Exception subclasses.
-	  Based on patch by Sylvain Daubert.  [Ruby 1.9 - Bug #5438]
-
-Wed Oct 19 11:04:47 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* enum.c: Reformat block args to a single standard, { |args| ... }.
-	  Patch by b t.  [Ruby 1.9 - Bug #5393]
-
-Wed Oct 19 12:11:26 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_ssl.c: Remove set, but unused variables.
-	  ext/openssl/ossl_pkey.c: ditto
-
-	* ext/openssl/ossl_pkey_dh.c: Make functions passed to
-	  rb_thread_blocking_region return VALUE instead of void.
-	  ext/openssl/ossl_pkey_dsa.c: ditto
-	  ext/openssl/ossl_pkey_rsa.c: ditto
-
-Tue Oct 18 23:28:53 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (identhash): share with type_numhash.
-
-	* st.c (st_hashtype_num): rename from type_numhash.
-
-Tue Oct 18 23:07:30 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_core.h (ruby_current_thread): probeprofiler has been removed
-	  long ago.
-
-Tue Oct 18 23:05:49 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/ripper/eventids2.c (ripper_init_eventids2): separate
-	  initializations of IDs and objects.
-
-	* ext/ripper/tools/generate.rb (generate_eventids1): ditto.
-
-	* parse.y (Init_ripper, InitVM_ripper): fix inversed roles.
-
-Sun Oct 16 19:46:16 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/bigdecimal/bigdecimal.gemspec (files): fixed typo, and
-	  removed nonexistent file.
-
-	* ext/bigdecimal/bigdecimal.gemspec (homepage): added.
-
-	* ext/io/console/io-console.gemspec (homepage): ditto.
-
-Fri Oct 14 12:13:57 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/pty/pty.c (pty_check): should return nil until the child
-	  terminates or stops.  [ruby-dev:44600] [Bug #2642]
-
-Fri Oct 14 11:19:37 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* include/ruby/intern.h (rb_ary_rotate): export.
-
-Fri Oct 14 05:58:05 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* atomic.h (ATOMIC_INC, ATOMIC_DEC): return old values.
-	  [ruby-dev:44596] [Bug #5439]
-
-	* signal.c (ruby_atomic_exchange): no needs to define on the
-	  platforms where atomic.h is available.
-
-Thu Oct 13 19:29:40 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* atomic.h (ATOMIC_*): use atomic_ops(3C) when SunStudio on Solaris.
-	  [ruby-dev:44596] [Bug #5439]
-
-Thu Oct 13 18:13:04 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* atomic.h(ATOMIC_SET): add cast to void to prevent misuse.
-	  [ruby-dev:44596] [Bug #5439]
-
-Thu Oct 13 18:04:27 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (rb_gc_finalize_deferred, rb_objspace_call_finalizer):
-	  should use ATOMIC_EXCHANGE() to check the previous value.
-	  [ruby-dev:44596] [Bug #5439]
-
-Wed Oct 12 23:39:58 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* test/openssl/test_ssl.rb: Move duplicated tests for SSL::Session to
-	  test_ssl_session.rb
-
-Tue Oct 11 08:49:40 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* array.c (rb_ary_initialize):  Improve explanation of Array.new
-	  parameters.  Patch by Alvaro Pereyra Rabanal.  [Ruby 1.9 - Bug #5425]
-	* array.c (rb_ary_s_try_convert):  Fix typo (try => tries)
-	* array.c (rb_ary_rindex):  Add spacing for block.
-	* array.c (rb_ary_uniq_bang):  Describe block
-	* array.c (rb_ary_uniq):  ditto
-
-Tue Oct 11 07:55:38 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* array.c:  Add a description to Array, minor cleanups.  Patch by
-	  Andrea Singh.  [Ruby 1.9 - Bug #5412]
-
-Tue Oct 11 06:09:52 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/pp.rb:  Move PP documentation to top of class PP.  Patch by
-	  Sylvain Daubert.  [Ruby 1.9 - Bug #5430]
-
-Tue Oct 11 06:06:29 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/coverage/coverage.c (Init_coverage):  Change list format and
-	  describe Coverage.result output.  Patch by Sylvain Daubert.
-	  [Ruby 1.9 - Bug #5428]
-
-Tue Oct 11 05:53:23 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* object.c (Init_Object):  Add reference to BasicObject, brief
-	  explanation of constant lookup.  Based on patch by Alvaro Pereyra
-	  Rabanal.
-	  [Ruby 1.9 - Bug #5426]
-
-Sun Oct  9 11:06:52 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* test/psych/test_yamldbm.rb: don't run test if the system
-	  don't support yaml/dbm.
-
-	* test/syck/test_yamldbm.rb: ditto.
-
-Sat Oct  8 08:54:56 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* enum.c (group_by):  Improve group_by description.  Patch by b t.
-	  [#5411]
-
-Sat Oct  8 03:17:51 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/shell.rb:  Document some methods of Shell.  Patch by Carol
-	  Nichols.  [Ruby 1.9 - Bug #5417]
-
-Fri Oct  7 17:54:28 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/test/unit/assertions.rb (assert_send, assert_not_send):
-	  parenthesize non-empty arguments.
-
-Fri Oct  7 06:35:50 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* array.c:  Use + for arguments described in documentation to allow
-	  rdoc -C2 to work better.  Remove <code> from method references to
-	  allow cross-references in HTML documentation.
-
-Thu Oct  6 18:46:23 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* vm_eval.c (make_no_method_exception): fix typo.
-
-	* vm_insnhelper.c, vm_insnhelper.h: ditto.
-
-Thu Oct  6 16:29:30 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (make_no_method_execption): extract from
-	  raise_method_missing().
-
-	* vm_eval.c (send_internal): remove inadvertent symbol creation
-	  from public_send.  based on a patch by Jeremy Evans <code AT
-	  jeremyevans.net> in [ruby-core:38576]. [Feature #5112]
-
-	* vm_insnhelper.c (vm_call_method): remove inadvertent symbol
-	  creation from send and __send__, too.
-
-Thu Oct  6 14:59:11 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/time.rb:  Clean up Time documentation.  Patch by Jake Goulding.
-	  [Ruby 1.9 - Bug #5416]
-
-Thu Oct  6 10:00:54 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* enum.c (group_by):  Improve documentation based on patch by b t.
-
-Thu Oct  6 09:56:30 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* enum.c:  Clean up wording in Enumerable documentation.  Patch by b t.
-	  [Ruby 1.9 - Bug #5411]
-
-Thu Oct  6 09:17:18 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* time.c (Init_Time):  Remove editorial comments from Time
-	  documentation, fix link.
-
-Thu Oct  6 09:14:20 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* time.c (Init_Time):  Improve Time documentation.  Patch by Shane
-	  Emmons.  [Ruby 1.9 - Bug #5404]
-	* lib/time.rb:  Improve time.rb documentation including Time.strptime.
-	  Patch by Shane Emmons.  [Ruby 1.9 - Bug #5402]
-
-Thu Oct  6 08:54:05 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* random.c:  Improve documentation of Random.  Patch by Gregory
-	  Parkhurst.  [Ruby 1.9 - Bug #5410]
-
-Thu Oct  6 01:44:51 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* cont.c (cont_mark): mark original Thread object from saved_thread.
-	  [ruby-dev:44571] [Bug #5386]
-
-Wed Oct  5 16:33:04 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_call_cfunc): remove useless hack.
-
-Wed Oct  5 05:56:39 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* hash.c (Init_Hash):  Improve Hash documentation.  Patch by Alvaro
-	  Pereyra Rabanal.  [Ruby 1.9 - Bug #5405]
-
-Wed Oct  5 05:47:59 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* random.c (Init_Random):  Add a top-level comment for Random.  Patch
-	  by Brett Bim.  [Ruby 1.9 - Bug #5403]
-
-Wed Oct  5 02:50:27 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/syntax_error.rb: Add file, line, offset, and
-	  message attributes during parse failure.
-	* ext/psych/parser.c: Update parser to raise exception with correct
-	  values.
-	* test/psych/test_exception.rb: corresponding tests.
-
-Wed Oct  5 01:52:16 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/parser.c (parse): Use context_mark for indicating error
-	  line and column.
-
-Wed Oct  5 01:22:08 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/scalar_scanner.rb: use normal begin / rescue
-	  since postfix rescue cannot receive the exception class. Thanks
-	  nagachika!
-
-Tue Oct  4 21:10:08 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* class.c (class_alloc): allocate extra memory after containing
-	  object setup to get rid of rare-but-potential memory leak.
-
-	* gc.c (gc_mark_children): skip marking extended members if ptr is
-	  NULL.
-
-Tue Oct  4 16:17:50 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/time.rb (Time.strptime): use Time.at if d[:seconds] is set.
-	  Reported by Christopher Eberz. [ruby-core:39903] Bug #5399
-
-Tue Oct  4 11:44:10 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c (rb_gc_set_params): ruby_verbose can be Qnil, so use RTEST.
-
-Tue Oct  4 08:33:41 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/etc/etc.c:  Document Etc, Etc.sysconfdir, Etc.systmpdir.  Patch
-	  by mathew murphy.  [Ruby 1.9 - Bug #5396]
-
-Tue Oct  4 08:21:51 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/shellwords.rb:  Update toplevel comment with an example.  Patch
-	  by Samnang Chhun.  [Ruby 1.9 - Bug #5388]
-
-Tue Oct  4 08:15:50 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* proc.c (proc_call):  Update documentation to match argument handling
-	  of proc/Proc.new/lambda/->()
-
-Tue Oct  4 07:59:16 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* proc.c (proc_call):  Fix documentation of Proc#call vs Proc#===.
-	  [Ruby 1.9 - Bug #5349]
-
-Tue Oct  4 07:43:18 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* array.c (rb_ary_initialize):  Make Array.new description match
-	  call-seq.  Patch by Henry Maddocks.  [Ruby 1.9 - Bug #5344]
-
-Tue Oct  4 07:35:23 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* array.c (rb_ary_initialize):  Add output for examples.  Patch by
-	  Jonathan Mukai.  [Ruby 1.9 - Bug #5216]
-
-Tue Oct  4 07:30:50 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* array.c (rb_ary_s_create):  Add example results for Array::[].  Patch
-	  by Jonathan Mukai.  [Ruby 1.9 - Bug #5215]
-
-Tue Oct  4 07:15:17 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Update to RubyGems 1.8.11.  Move Deprecate into the
-	  Gem namespace.
-
-Tue Oct  4 06:43:47 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: update psych version.
-	* ext/psych/psych.gemspec: generate new gemspec for new version.
-
-Tue Oct  4 06:29:55 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: calling `yaml` rather than `to_yaml`.
-	* ext/psych/lib/psych/nodes/node.rb: Rename `to_yaml` to just `yaml`
-	  in order to avoid YAML::ENGINE switching from replacing this method.
-	* test/psych/helper.rb: fix tests for method name change.
-	* test/psych/test_document.rb: ditto
-	* test/psych/visitors/test_emitter.rb: ditto
-
-Tue Oct  4 06:20:19 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/scalar_scanner.rb: Match values against the
-	  floating point spec defined in YAML to avoid erroneous parses.
-	* test/psych/test_numeric.rb: corresponding test.
-
-Tue Oct  4 05:59:24 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/to_ruby.rb: ToRuby visitor can be
-	  constructed with a ScalarScanner.
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: ScalarScanner can be
-	  passed to the YAMLTree visitor.
-
-Tue Oct  4 05:47:23 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/to_ruby.rb: Define Regexp::NOENCODING
-	  for 1.9.2 backwards compatibility.
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: Fix Date string
-	  generation for 1.9.2 backwards compatibility.
-
-Mon Oct  3 23:56:39 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* gc.c (rb_gc_set_params): output GC parameter change messages only
-	  if -w/-v options are specified. these messages are output to stderr,
-	  not to stdout. [ruby-core:39795] [Bug #5380]
-
-	* test/ruby/test_gc.rb (test_gc_parameter): add test for it.
-
-Sun Oct  2 20:05:32 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c (rb_thread_mark), cont.c (cont_mark): revert r33369 and r33371
-	  that may cause SEGV in certain environments.
-
-Sun Oct  2 12:14:06 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/psych/test_yamldbm.rb: add test case.
-	* test/syck/test_yamldbm.rb: ditto.
-
-Sun Oct  2 11:28:09 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* lib/yaml/store.rb: make initialize method signature match the
-	  superclass signature.
-
-Sun Oct  2 10:44:01 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* io.c: fix documentation of ARGF.lineno=.
-
-Sat Oct  1 20:03:19 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (have_framework): try as Objective-C.
-	  https://twitter.com/nagachika/status/120294447660539904
-
-Sun Oct  2 08:43:25 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c (rb_thread_mark), cont.c (cont_mark): self pointer should not
-	  be marked by itself. Patch by Koichi Sasada.
-	  [ruby-dev:44567] [Bug #5386]
-
-Sun Oct  2 00:42:14 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c (rb_thread_mark): rb_thread_t needs self to be marked.
-	  [ruby-dev:44566] [Bug #5386]
-
-Sat Oct  1 09:48:53 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* gc.c (add_heap_slots, init_heap): reset heaps_inc zero when
-	  heap slots are expanded by environment variable RUBY_HEAP_MIN_SLOTS.
-	  [ruby-core:39777] [Bug #5380]
-
-	* test/ruby/test_gc.rb (test_gc_parameter): add test for it.
-
-	* test/ruby/envutil.rb (assert_normal_exit): add :child_env option to
-	  enable pass environment variables to child process.
-
-Thu Sep 29 13:17:51 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (ary_join_1): should not copy the encoding of non-string
-	  element after string element.  [ruby-core:39776] [Bug #5379]
-
-Thu Sep 29 11:53:56 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (slot_sweep, rb_gc_finalize_deferred)
-	  (rb_objspace_call_finalizer, rb_gc): run finalizers
-	  sequentially.  [ruby-dev:44562]
-
-Thu Sep 29 20:37:38 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/gdbm/gdbm.c (rb_gdbm_fatal): adjust argument type.
-
-Thu Sep 29 20:10:42 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (is_id_value, is_live_object): extract from id2ref().
-
-	* gc.c (run_finalizer): use object instead of object id.
-
-Thu Sep 29 20:07:36 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* use RB_TYPE_P which is optimized for constant types, instead of
-	  comparison with TYPE.
-
-Wed Sep 28 09:20:37 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (pthread_np.h): needs pthread.h to be included
-	  previously on OpenBSD.  a patch by George Koehler <xkernigh AT
-	  netscape.net> at [ruby-core:39752].  [Bug #5376]
-
-Wed Sep 28 04:41:35 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/psych/test_yamlstore.rb: use tmpdir for tmpfile.
-	* test/syck/test_yamlstore.rb: ditto.
-
-Wed Sep 28 04:10:46 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/bigdecimal/README: update report to.
-
-Tue Sep 28 04:05:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal_en.html: removed because this file isn't
-	  maintained now.
-
-	* ext/bigdecimal/bigdecimal_ja.html: ditto.
-
-Tue Sep 27 09:55:40 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c: make native_fd_select().
-	* thread.c (do_select): remove #ifdef _WIN32. Instead, use
-	  native_fd_select() always.
-
-Tue Sep 27 09:44:59 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread.c (do_select): remove cygwin specific hack. It's layer
-	  violation and too large hack.
-	* thread.c (cmp_tv, subtract_tv): removed.
-
-Tue Sep 27 03:50:19 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/rexml/test_sax.rb: add require 'rexml/document'.
-
-Tue Sep 27 03:32:27 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/psych/test_yamldbm.rb: fix #setup and #teardown.
-	  [Bug #5370] [ruby-core:39730]
-	* test/syck/test_yamldbm.rb: ditto.
-
-Mon Sep 26 11:27:38 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/webrick/httputils.rb: Add MIME Type definition of .js and .svg.
-	  patched by Hal Brodigan. [ruby-core:39704] [Bug #5365]
-
-Mon Sep 26 09:20:44 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: remove DJGPP support. It's not longer supported
-	  since ruby 1.9.0.
-
-Mon Sep 26 09:07:46 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* include/ruby/defines.h: remove NextStep, OpenStep, Rhapsody
-	  support. Last activity of their OSes are 7 years ago.
-	* configure.in: ditto.
-	* dir.c: ditto.
-	* ext/tk/extconf.rb: ditto.
-
-Mon Sep 26 09:02:49 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: remove a code for human68k. it's no longer
-	  supported since r19677.
-
-Sun Sep 25 23:43:32 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_asn1.c: fix int_ossl_asn1_decode0_cons when being
-	  fed arbitrary string values.
-	  Clearly distinguish between the cases "universal, infinite and
-	  not a SEQUENCE or SET" and "universal SEQUENCE or SET, possibly
-	  infinite". Raise error for universal tags that are not infinite.
-	* test/openssl/test_asn1.rb: add a test for this.
-
-	  Thanks to Hiroshi Yoshida for reporting this bug.
-	  [Bug #5363] [ruby-dev:44542]
-
-Sun Sep 25 20:57:18 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/syck/test/yamldbm.rb: add test for Syck::DBM.
-	* test/psych/test_yamldbm.rb: add test for Psych::DBM.
-	* test/psych/test_yamlstore.rb: add test for Psych::PStore.
-
-Sun Sep 25 20:54:10 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* lib/yaml/dbm/dbm.rb: fix #update, add #key for using instead #index.
-	  [Bug #5305][ruby-dev:44485]
-
-Sun Sep 25 16:54:33 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (require_enc): reject only loading from untrusted
-	  load paths.  [ruby-dev:44541] [Bug #5279]
-
-	* transcode.c (load_transcoder_entry): ditto.
-
-Sun Sep 25 16:45:05 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in: ignore all warnings from an arbitrary
-	  header in /usr/local/include.
-
-Sun Sep 25 03:43:03 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* enum.c (slice_before_i): use rb_attr_get to suppress wrong warning
-	  for internal instance variable slicebefore_initial_state.
-
-Fri Sep 23 14:20:14 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_asn1.c: remove unused variable.
-
-Fri Sep 23 13:46:59 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_ssl_session.rb: execute test_session_exts_read
-	  only for OpenSSL versions >= 0.9.8k. Thanks, Eric Wong, for
-	  reporting this.
-	  [Bug #4961] [ruby-core:37726]
-
-Fri Sep 23 11:59:08 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_ssl_session.rb: ensure server calls callbacks in
-	  test_ctx_server_session_cb. Thanks to Eric Wong for the patch.
-	  [Bug #5336] [ruby-core:39619]
-
-Thu Sep 22 02:53:19 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_call_cfunc): suppress a warning.  note that
-	  `volatile type *var' doesn't make var itself volatile.
-
-Thu Sep 22 01:52:48 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* thread_pthread.c (ubf_select): activate timer thread when interrupt
-	  blocking thread.
-	  A patch created by Koichi Sasada. [ruby-core:39634] [Bug #5343]
-	  to cover race condition, timer thread periodically send SIGVTARLM to
-	  threads in signal thread list. so you should activate timer thread
-	  when interrupt a thread.
-
-Wed Sep 21 16:55:26 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/io/wait/test_io_wait.rb (TestIOWait#setup): of course, the
-	  behavior of mingw is just same with mswin.
-
-Tue Sep 20 18:08:51 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_get_cvar_base): reduce duplicated checks and
-	  move a warning outside the loop.
-
-Mon Sep 19 18:55:51 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* lib/fileutils.rb (module FileUtils): improve performance of
-	  FileUtils.compare_stream. a patch by Masaki Matsushita.
-	  [Feature #5337] [ruby-core:39622]
-
-Mon Sep 19 18:42:58 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* test/-ext-/old_thread_select/test_old_thread_select.rb:
-	  select() with timeout may return early in old Linux kernels
-	  with 250 Hz tickrate and no dynticks, so skip everything older
-	  than 2.6.32 (which has long term support).
-	  And, Make the timing assertions consistently use assert_operator with
-	  timing difference in error message
-	  Patch by Eric Wong. [Bug #5335] [ruby-core:39618]
-
-Mon Sep 19 09:28:06 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* test/openssl/test_ssl.rb (class OpenSSL):  Test
-	  OpenSSL::SSL::SSLSocket#session and #session=.
-
-Mon Sep 19 07:54:17 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* object.c (rb_obj_clone): singleton class should be attached
-	  singleton object to.  a patch by Satoshi Shiba <shiba AT rvm.jp>
-	  at [ruby-dev:44460].  [Bug #5274]
-
-Sat Sep 17 23:34:10 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_data_type): inherit the core type in ripper so
-	  that checks in core would work.  [ruby-core:39591] [Bug #5331]
-
-Sat Sep 17 12:44:04 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* lib/find.rb (Find.find): add documentation that Find.find
-	  without block returns an enumerator.
-
-Thu Sep 15 11:39:43 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (mark_entry, mark_key, mark_keyvalue): adjust callback
-	  argument types.
-
-Thu Sep 15 01:44:10 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/tk/*: Change encoding from EUC-JP to UTF-8
-
-Wed Sep 14 11:43:37 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread.c (rb_fd_rcopy): added an argument guard.
-	  Patch by NAKAMURA Usaku. [Bug #5306] [ruby-core:39435]
-
-Tue Sep 13 20:21:49 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/pstore.rb, test/test_pstore.rb: suppress warnings with -v.
-
-	* lib/pstore.rb (PStore): always open in binary mode even if
-	  default encodings are set.  [Bug #5311] [ruby-core:39503]
-
-Tue Sep 13 05:37:15 2011  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* io.c (Init_IO): update BINARY comment.  it should not change the
-	  encoding of the result to ASCII-8BIT.  [ruby-talk:387719]
-
-Mon Sep 12 19:55:00 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread.c (rb_thread_select): fix to ignore an argument
-	  modification of rb_thread_fd_select().
-	  based on a patch by Eric Wong. [Bug #5306] [ruby-core:39435]
-	* thread.c (rb_fd_rcopy): New. for reverse fd copy.
-
-	* test/-ext-/old_thread_select/test_old_thread_select.rb
-	(test_old_select_false_positive): test for bug5306.
-
-	* ext/-test-/old_thread_select/old_thread_select.c (fdset2array):
-	  New. convert fdsets to array.
-	* ext/-test-/old_thread_select/old_thread_select.c (old_thread_select):
-	  return 'read', 'write', 'except' argument of rb_thread_select()
-	  to ruby script.
-
-Mon Sep 12 13:38:12 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* README.EXT, README.EXT.ja (2.2.2), parse.y (rb_check_id): add
-	  documents for rb_check_id().
-
-Mon Sep 12 12:53:39 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* lib/rake/file_list.rb (Rake::FileList#egrep): there is no need to
-	  open files in binary mode.
-	  see more details in https://github.com/jimweirich/rake/issues/74
-
-Mon Sep 12 12:42:36 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/test_exception.rb (TestException#test_exit_success_p):
-	  assert also the cases when exiting with true and false.
-
-	* lib/test/unit/assertions.rb (assert_send): make arguments in
-	  the default message clearer.
-
-Sun Sep 11 05:23:14 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* lib/matrix.rb: Deal with subclasses of Matrix [redmine #5307]
-
-Sat Sep 10 13:38:20 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* dir.c (dir_s_aref):
-	* dir.c (dir_entries): Two small documentation fixes.
-	  A patch from Aaron Lerch. [Bug #5302] [ruby-core:39404]
-
-Sat Sep 10 08:30:03 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* gc.c (GC_PROFILE_MORE_DETAIL, CALC_EXACT_MALLOC_SIZE):
-	  define macros only if they are not defined.
-	  fixes: [Ruby 1.9 - Feature #5291]
-
-Sat Sep 10 08:25:47 2011  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* parse.y (bv_decls): parse.y relies on $$ = $1 before action
-	  routines.  a patch from Michael Edgar.  [Bug #5303]
-	  [ruby-core:39429]
-
-Sat Sep 10 01:37:55 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* sample/drb/dhasenc.rb: coding cookie of Emacs is coding,
-	  not encoding.
-
-	* sample/mine.rb: ditto.
-
-Fri Sep  9 21:56:40 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_sqrt): Fix comment.
-	  BigDecimal#sqrt requires argument. Reported by Makoto Kishimoto.
-	  Thanks for your contribution. [Bug #5267] [ruby-dev:44452]
-
-Fri Sep  9 11:00:55 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* test/rubygems/test_gem_commands_help_command.rb: Add one
-	  `require` because if run test-all with test/unit parallel
-	  running, sometimes this test fails by some constants not found.
-	  The error reason is some worker doesn't require the file needed by
-	  this test. This issue is related to [ruby-core:36168].
-
-Fri Sep  9 10:22:03 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* thread.c (rb_thread_select): fix a typo to initialize efds
-	  properly.  [Bug #5299] [ruby-core:39380]
-
-Fri Sep  9 02:02:09 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* template/yarvarch.ja:
-	  Change encoding from Shift_JIS to UTF-8
-
-Thu Sep  9 01:14:00 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* sample/drb/README.rd.ja:
-	* sample/drb/dhasenc.rb:
-	* sample/mine.rb:
-	  Change encoding from EUC-JP to UTF-8
-
-Thu Sep  8 21:03:22 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/nkf/nkf-utf8/nkf.c: import nkf 2.1.2 (be9c280)
-	  Bump version number/release date only.
-
-Thu Sep  8 12:43:18 2011  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (Init_GC): defined GC::Profiler.raw_data. based on the
-	  patch by Eric Hodel. [ruby-core:37857] [Bug #4991]
-
-Thu Sep  8 09:02:53 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (id2ref): objects which are unmarked but not in sweep_slots
-	  are not dead.
-
-Thu Sep  8 07:44:25 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* transcode.c (rb_declare_transcoder, load_transcoder_entry): no
-	  longer need to limit the length of transcoder library name.
-
-Thu Sep  8 07:36:36 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/syck/lib/syck/types.rb: use toplevel Syck.
-	  for the case someone define Syck::Syck (or YAML::Syck).
-
-Thu Sep  8 07:33:12 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* gc.c (id2ref): unmarked object is already dead while lazy
-	  sweeping, and to it cannot come back since other objects
-	  referred from it might have been freed already.
-
-Wed Sep  8 03:48:00 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/readline/README.ja:
-	  Change encoding from EUC-JP to UTF-8
-
-Wed Sep  8 02:59:00 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* test/rexml/test_encoding.rb:
-	  Add require 'require 'rexml/document'
-
-Wed Sep  8 02:53:00 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* ext/nkf/nkf-utf8/nkf.c:
-	  Change encoding from ISO-2022 to UTF-8
-
-Wed Sep  7 23:41:24 2011  Kouhei Sutou  <kou@cozmixng.org>
-
-	* lib/rexml/parsers/baseparser.rb, test/rexml/test_comment.rb:
-	  allow a single hyphen in comment. [Bug #5278] [ruby-core:39289]
-	  Reported by Thomas Fritzsche. Thanks!!!
-
-Wed Sep  7 17:27:18 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/yaml.rb: explicitly specify ::Object to avoid the collision with
-	  Syck::Object.
-
-Tue Sep  6 21:06:49 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb (_run_suites): Now reports are written the
-	  following order: Skip, Failure, Error. [Feature #5282]
-
-	* test_sorting.rb: test for above.
-
-	* test4test_sorting.rb: Ditto.
-
-	* lib/test/unit.rb (run): Put RUBY_DESCRIPTION before quitting.
-	  [Feature #5282]
-
-Tue Sep  6 21:13:47 2011  Masaya Tarui  <tarui@ruby-lang.org>
-
-	* win32/Makefile.sub (INSNS): change command line option -Ks to -Ku
-	  for generate *.inc. because insns.def encoding has been changed SJIS
-	  to UTF-8. if $BASERUBY is 1.9, -Ks cause an error. [Feature #5128]
-	  (same as r33194)
-
-Tue Sep  6 15:55:24 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* transcode.c (load_transcoder_entry): concatenate paths directly.
-
-	* encoding.c (load_encoding): predefined encoding names are safe.
-	  [ruby-dev:44469] [Bug #5279]
-
-	* transcode.c (load_transcoder_entry): ditto.
-
-Tue Sep  6 12:07:10 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* transcode.c: enabled econv newline option.
-
-Tue Sep  6 06:44:57 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* numeric.c (dbl2ival): Fix Float#divmod and #round for 32 bit
-	  platform. part 1 of [bug #5276]
-
-Tue Sep  6 06:44:25 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* numeric.c (flo_round): Fix criteria for 32 bits platform
-	  part 2 of [bug #5276]
-
-Tue Sep  6 05:37:11 2011  Masatoshi SEKI  <m_seki@mva.biglobe.ne.jp>
-
-	* test/rinda/test_rinda.rb (test_core_03_notify): Fixed test failures
-	  [ruby-dev:44430] [Ruby 1.9 - Bug #372]
-
-Mon Sep  5 20:59:30 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* insns.def: change encoding pragma for emacs (shift_jis to utf-8).
-
-Mon Sep  5 19:32:15 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* Makefile.in (INSNS): change command line option -Ks to -Ku for
-	  generate *.inc. because insns.def encoding has been changed SJIS to
-	  UTF-8. if $BASERUBY is 1.9, -Ks cause an error. [Feature #5128]
-
-Mon Sep  5 18:10:56 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* transcode.c (rb_econv_binmode): newline decorators are
-	  exclusive.
-
-Mon Sep  5 15:03:37 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/rubygems/test_gem_security.rb
-	  (test_class_build_self_signed_cert): reset opt[:trust_dir] to apply
-	  temporary Gem.user_home.
-
-Mon Sep  5 10:04:35 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* README.ja, README.EXT.ja: resolve conflicts. [ruby-dev:44459]
-
-Mon Sep  5 05:13:22 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* numeric.c (flo_round): Make Float#round round big values [bug
-	  #5272]
-
-Mon Sep  5 04:28:25 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* numeric.c (int_round): Integer#round always returns an Integer [Bug
-	  #5271]
-
-Sun Sep  4 22:28:50 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (default_port, default_imap_port,
-	  default_tls_port, default_ssl_port, default_imaps_port):
-	  added methods for consistency with Net::POP.
-	  based on the patch by art lussos.  [ruby-core:38997] [Bug #5198]
-
-Sun Sep  4 21:19:19 2011  Ayumu AIZAWA  <ayumu.aizawa@gmail.com>
-
-	* Change encoding from EUC-JP to UTF-8. [Feature #5128]
-
-Sun Sep  4 00:47:39 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* test/ruby/test_fiber.rb (TestFiber#test_no_valid_cfp):
-	  add a test. Unlike TestThread#test_no_valid_cfp,
-	  this test succeeds even if win32ole is required (see r33153).
-
-Sun Sep  4 00:11:49 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* variable.c (rb_const_set): show the previous definition
-	  location.  [EXPERIMENTAL]
-
-Sat Sep  3 23:56:24 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (sizeof_struct_dirent_too_small): check if struct
-	  dirent.d_name is too small.
-
-	* configure.in (RUBY_MINGW32): take tool prefix from CC.
-
-Sat Sep  3 23:52:08 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (argf_next_argv): open in default text mode.
-	  [ruby-core:39234] [Bug #5268]
-
-Sat Sep  3 18:40:57 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* lib/thread.rb (SizedQueue#max=): raise ArgumentError if max is not
-	  positive number. patch by Masaki Matsushita.
-	  [ruby-dev:44449] [Bug #5259]
-
-	* test/thread/test_queue.rb (test_sized_queue_initialize,
-	  test_sized_queue_assign_max): add tests for it.
-
-Fri Sep  2 21:11:16 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (validate_enc_binmode, prep_stdio): default to text mode on
-	  dosish platforms.  [ruby-core:38822] [Bug #5164]
-
-	* transcode.c (rb_econv_prepare_options): keep default ecflags
-	  unchanged if no options.
-
-Fri Sep  2 14:36:47 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_search_const_defined_class): search
-	  ancestors only when global scope.  [ruby-core:39227] [Bug #5264]
-
-Fri Sep  2 09:58:08 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (parser_tokadd_string, parser_yylex): ignore a backslash
-	  which prefixes an non-ascii character, which has no escape
-	  syntax.  [ruby-core:39222] [Ruby 1.9 - Bug #5262]
-
-Fri Sep  2 04:05:25 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/visitors/yaml_tree.rb: emit strings tagged as
-	  ascii-8bit as binary in YAML.
-	* test/psych/test_string.rb: corresponding test.
-
-Fri Sep  2 01:07:14 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* numeric.c (flo_round): substitute machine dependent magic number.
-
-Thu Sep  1 17:31:22 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* insns.def (defineclass), vm_insnhelper.c (vm_get_cvar_base): see
-	  also inherited constants for classes without superclass and
-	  modules.  [ruby-core:37698] [Bug #3423]
-
-Thu Sep  1 16:18:44 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* Release GVL while OpenSSL's public key generation.
-
-	    t = Thread.new { print "."; sleep 0.1 }
-	    key = OpenSSL::PKey::RSA.new(2048)
-	    #=> Thread t works in parallel with public key generation if
-		OS/machine allows it.
-
-	  This works with OpenSSL >= 0.9.8. From this version, it has new
-	  public key generation function which allows us to interrupt the
-	  execution while pkey generation iterations.
-
-	* ext/openssl/extconf.rb: Check existence of OpenSSL's new public key
-	  generation function. (DH_generate_parameters_ex,
-	  DSA_generate_parameters_ex and RSA_generate_key_ex.
-
-	* ext/openssl/ossl_pkey.{h,c} (ossl_generate_cb_2,
-	  ossl_generate_cb_stop): Added new callback function for OpenSSL pkey
-	  generation which handles Thread interruption by Ruby.
-	  ossl_generate_cb_stop is the unblock function(ubf) for Ruby which
-	  sets a stop flag. New pkey generation callback ossl_generate_cb_2
-	  checks the stop flag at each iterations of OpenSSL and interrupts
-	  pkey generation when the flag is set.
-
-	* ext/openssl/ossl_pkey_dsa.c (dsa_generate): Call
-	  rb_thread_blocking_region with the above unblock function to release
-	  GVL while pkey generation.
-
-	* ext/openssl/ossl_pkey_rsa.c (rsa_generate): ditto.
-
-	* ext/openssl/ossl_pkey_dh.c (dh_generate): ditto.
-
-	* test/openssl/test_pkey_{dh,dsa,rsa}.rb: Test it.
-
-Thu Sep  1 14:06:54 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_thread.rb (TestThread#test_no_valid_cfp): skip when
-	  win32ole is required.  in such case, win32ole redefines
-	  Thread#initialize, and the block argument becomes to be not the top
-	  of the thread, then this testcase always fails.
-
-Thu Sep  1 10:20:50 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io_m17n.rb (TestIO_M17N#test_{default_mode_on_dosish,
-	  default_mode_on_unix,text_mode,binary_mode}): sorry for wrong test
-	  committed in r33144.  I'd misunderstood the spec of ruby's universal
-	  newline.
-
-Thu Sep  1 09:27:57 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* variable.c (rb_autoloading_value): Fix the order of definitions.
-	  It is used by autoload_defined_p.
-
-Wed Aug 31 17:28:23 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* variable.c (rb_autoload): There was a chance to run GC (from
-	  rb_str_new2()) before finishing autoload_data_i construction. It
-	  caused SEGV at rb_gc_mark() at autoload_i_mark.
-
-	* variable.c (rb_autoload_load): Move RB_GC_GUARD() to proper
-	  position based on suggestion by CHIKANAGA Tomoyuki at
-	  http://d.hatena.ne.jp/nagachika/20110826/ruby_trunk_changes_33070_33078
-
-	* variable.c (autoload_defined_p): Fix incompatible autoload behavior
-	  that causes Rails crash. Class definition instruction defined in
-	  'defineclass' in insns.def always invokes rb_autoload_load for a
-	  constant. It's invoked for every class definition regardless of
-	  existence of autoload definition. rb_autoload_load checks if a
-	  constant is defined as autoloaded, but new thread-safe autoload
-	  returned different value if the constant is under autoloading.
-
-Wed Aug 31 17:20:56 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* Re-apply r33078, thread-safe autoload which is reverted at r33093.
-
-Wed Aug 31 16:28:04 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_io_m17n.rb (TestIO_M17N#test_{default_mode_on_dosish,
-	  default_mode_on_unix,text_mode,binary_mode}): tests for [Bug #5164].
-
-Wed Aug 31 15:54:11 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json: Merge json gem v1.5.4 (3dab4c5a6a97fac03dac).
-
-Wed Aug 31 13:09:41 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* numeric.c (flo_round): Avoid overflow by optimizing for trivial
-	  cases [Bug #5227]
-
-Wed Aug 31 00:50:01 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (rb_w32_select_with_thread): and my typo. we all must
-	  be more careful.
-
-Wed Aug 31 00:48:38 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* thread.c (rb_thread_select): critical typo in r33117.
-
-Wed Aug 31 00:30:49 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/-ext-/old_thread_select/test_old_thread_select.rb
-	  (TestOldThreadSelect#test_old_select_read_timeout): if the machine
-	  is fast enough, the time used by code around IO.select may be smaller
-	  than Time implement threshold.
-
-Wed Aug 31 00:04:38 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* ext/-test-/old_thread_select/old_thread_select.c (old_thread_select):
-	  typo.
-
-	* test/-ext-/old_thread_select/test_old_thread_select.rb
-	  (TestOldThreadSelect#test_old_select_signal_safe): use SIGINT instead
-	  of SIGUSR1 because the former is general and the latter is platform
-	  dependent.
-
-Tue Aug 30 23:59:36 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c, include/ruby/intern.h (rb_w32_fd_copy): implement
-	  for rb_thread_select() in thread.c.  the use of rb_fd_copy() is
-	  introduced in r33117.
-	  [Bug #5251] [ruby-core:39195]
-
-	* thread.c (rb_thread_select): must call rb_fd_init() before using
-	  rb_fdset_t.  see the implementations of rb_fd_init()s if you want to
-	  know the reason.
-
-Tue Aug 30 22:34:45 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* test/dl/test_callback.rb (test_callback_with_string): prevents
-	  temporary string from GC.
-
-Tue Aug 30 22:25:38 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* vm_insnhelper.c (vm_call_cfunc): revert r33112.  RB_GC_GUARD macro
-	  protect a VALUE from GC.  It's not for general anti-optimizing
-	  purpose.
-
-Tue Aug 30 11:06:19 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/json: Merge json gem 1.5.4+ (2149f4185c598fb97db1).
-	  [Bug #5173] [ruby-core:38866]
-
-Tue Aug 30 09:57:50 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* lib/thread.rb (Queue#pop): fix a race against Thread.wakeup.
-	  Patch by Masaki Matsushita <glass.saga at gmail dot com>
-	  [Bug #5195] [ruby-dev:44400]
-
-Tue Aug 30 09:48:07 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* cont.c (fiber_entry): fix stack allocation failure on Debian
-	  GNU/kFreeBSD.
-	  Patch by Lucas Nussbaum <lucas at lucas-nussbaum dot net>.
-	  [Bug #5241] [ruby-core:39147]
-
-Tue Aug 30 09:28:01 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread.c (rb_thread_select): rewrite by using
-	  rb_thread_fd_select(). old one is EINTR unsafe.
-	  Patch by Eric Wong. [Bug #5229] [ruby-core:39102]
-
-	* test/-ext-/old_thread_select/test_old_thread_select.rb:
-	  a testcase for rb_thread_select().
-	* ext/-test-/old_thread_select/old_thread_select.c: ditto.
-	* ext/-test-/old_thread_select/depend: ditto.
-	* ext/-test-/old_thread_select/extconf.rb: ditto.
-
-Tue Aug 30 09:08:22 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: fix a build failure on GNU Hurd.
-	  Patch by Samuel Thibault <sthibault at debian dot org>. Thank you!
-	  [Bug #5250] [ruby-core:39185]
-
-Sun Aug 29 23:22:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* test/ruby/test_numeric.rb (test_num2long): modify a test against the
-	  change by r33108.
-
-Sun Aug 29 09:58:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* numeric.c (bit_coerce): A Fixnum and a Bignum are only permitted for
-	 bitwise arithmetic with a Fixnum.  #1792
-
-	* test/ruby/test_fixnum.rb: add tests for the above change.
-
-	* bignum.c (bit_coerce): A Fixnum and a Bignum are only permitted for
-	 bitwise arithmetic with a Bignum.  #1792
-
-	* test/ruby/test_bignum.rb: add tests for the above change.
-
-Sun Aug 28 15:38:17 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* ext/date/date_parse.c (date_zone_to_diff): keep a temporary string
-	  stored in variable while the contents buffer is being used.
-
-	* ext/date/date_parse.c (date_zone_to_diff): get rid of out of bounds
-	  memory read. [ruby-dev:44409] [Bug #5213]
-
-Sun Aug 28 05:29:50 2011  Ryan Davis  <ryand-ruby@zenspider.com>
-
-	* lib/minitest/*: Imported minitest 2.5.1 (r6596)
-	* test/minitest/*: ditto
-
-Sat Aug 27 20:46:05 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c (rb_vm_rewrite_dfp_in_errinfo): change return type
-	  to suppress a warning.
-
-	* vm_core.h: ditto.
-
-Sat Aug 27 19:04:06 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* internal.h (rb_strftime_timespec): moved from time.c and define only
-	  if ruby/encoding.h is included.
-
-	* internal.h (rb_strftime): ditto.
-
-Sat Aug 27 18:53:51 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* proc.c (proc_new): force to rewrite errinfo when calling Proc.new in ensure.
-	  [Bug #5234] [ruby-core:39125]
-	  This code will be removed after changing throw mechanism (see r33064).
-
-	* vm.c (rb_vm_rewrite_dfp_in_errinfo): new function.
-
-	* vm.c (vm_make_env_each): changed accordingly.
-
-	* vm_core.h: ditto.
-
-	* bootstraptest/test_flow.rb: add tests for above.
-
-Sat Aug 27 18:44:06 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* internal.h (rb_strftime_timespec): move to time.c because it depends
-	  encoding.h.
-
-Sat Aug 27 18:17:58 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* strftime.c (rb_strftime_with_timespec): get enc argument to specify
-	  the encoding of the format. On Windows (at least Japanese Windows),
-	  Time#strftime("%Z") includes non ASCII in locale encoding (CP932).
-	  So convert locale to default internal. [ruby-core:39092] [Bug #5226]
-
-	* strftime.c (rb_strftime): ditto.
-
-	* strftime.c (rb_strftime_timespec): ditto.
-
-	* internal.h (rb_strftime_timespec): follow above.
-
-	* time.c (rb_strftime_alloc): ditto.
-
-	* time.c (strftimev): ditto.
-
-	* time.c (time_strftime): ditto.
-
-	* time.c (time_to_s): the resulted string of Time#to_s is always
-	  ascii only, so this should be US-ASCII.
-
-	* time.c (time_asctime): ditto.
-
-Sat Aug 27 11:18:12 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* Revert r33078. It caused a Rails application NoMethodError.
-
-	  /home/nahi/git/emptyApp/ruby/1.9.1/gems/rack-mount-0.6.14/lib/rack/mount/utils.rb:157: warning: toplevel constant ScanError referenced by Regin::Parser::ScanError
-	  /home/nahi/git/emptyApp/ruby/1.9.1/gems/rack-mount-0.6.14/lib/rack/mount/vendor/regin/regin/parser.rb:17:in `parse_regexp': undefined method `scan_str' for #<Regin::Parser:0x00000002344548> (NoMethodError)
-
-Sat Aug 27 08:44:58 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rdoc:  Import RDoc 3.9.4.  Typo and grammar fixes by Luke Gruber.
-	  [Ruby 1.9 - Bug #5203]
-
-Sat Aug 27 07:53:34 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/open-uri.rb:  Fix indentation of OpenURI::OpenRead#open.  Use ++
-	  instead of `' for method arguments in open-uri.rb
-
-Sat Aug 27 07:22:07 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/pathname/lib/pathname.rb:  Fix typos and grammar mistakes.  Patch
-	  by Luke Gruber.  [#5203]
-	* ext/pty/lib/expect.rb:  ditto
-	* lib/mathn.rb:  ditto
-	* lib/net/http.rb:  ditto
-	* lib/open-uri.rb:  ditto
-	* lib/ostruct.rb:  ditto
-	* lib/tempfile.rb:  ditto
-	* lib/thread.rb:  ditto
-	* lib/weakref.rb:  ditto
-	* sample/webrick/httpproxy.rb:  ditto
-
-Sat Aug 27 04:03:18 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* iseq.c (iseq_data_to_ary): fix type of variable
-	  (long -> unsigned long) to suppress a warning.
-
-Sat Aug 27 04:02:11 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_core.h: add a decl. of rb_autoloading_value().
-
-Fri Aug 26 19:12:08 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* variable.c: Make autoload thread-safe. See #921.
-
-	  What's the problem?
-	    autoload is thread unsafe. When we define a constant to be
-	    autoloaded, we expect the constant construction is invariant. But
-	    current autoload implementation allows other threads to access the
-	    constant while the first thread is loading a file.
-
-	  What's happening inside?
-	    The current implementation uses Qundef as a marker of autoload in
-	    Constant table. Once the first thread find Qundef as a value at
-	    constant lookup, it starts loading a defined feature. Generally a
-	    loaded file overrides the Qundef in Constant table by module/class
-	    declaration at very beginning lines of the file, so other threads
-	    can see the new Module/Class object before feature loading is
-	    finished. It breaks invariant construction.
-
-	  How to solve?
-	    To ensure invariant constant construction, we need to override
-	    Qundef with defined Object after the feature loading. For keeping
-	    Qundef in Constant table, I expanded autoload_data struct in
-	    Module to have a slot for keeping the defined object while feature
-	    loading. And changed Module's constant lookup/update logic a
-	    little so that the slot is only visible from the thread which
-	    invokes feature loading. (== the first thread which accessed the
-	    autoload constant)
-
-	  Evaluation?
-	    All test passes (bootstrap test, test-all and RubySpec) and added
-	    8 tests for threading behavior. Extra logics are executed only
-	    when Qundef is found, so no perf drop should happen except
-	    autoloading.
-
-	* variable.c (rb_autoload): Prepare new autoload_data struct.
-
-	* variable.c (rb_autoload_load): Load feature and update Constant
-	  table after feature loading is finished.
-
-	* variable.c (rb_const_get_0): When the fetched constant is under
-	  autoloading, it returns the object only for the thread which starts
-	  autoloading.
-
-	* variable.c (rb_const_defined_0): Ditto.
-
-	* variable.c (rb_const_set): When the specified constant is under
-	  autoloading, it sets the object only for the thread which starts
-	  autoloading. Otherwise, simply overrides Qundef with constant
-	  override warning.
-
-	* vm_insnhelper.c (vm_get_ev_const): Apply same change as
-	  rb_const_get_0 in variable.c.
-
-	* test/ruby/test_autoload.rb: Added tests for threading behavior.
-
-Fri Aug 26 10:10:37 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Update to RubyGems 1.8.10.  Fixes security issue in
-	  creating ruby-format gemspecs.  Fixes Gem.dir not being at the front
-	  of Gem.path to fix uninstall and cleanup commands.  Fixes gem
-	  uninstall stopping on the first missing gem.
-
-Fri Aug 26 08:21:10 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* time.c (strftimev): Make Time#to_s default to US-ASCII encoding but
-	  respect Encoding.default_internal. [ruby-core:39092]
-	* test/ruby/test_time.rb (class TestTime): Corresponding test.
-
-Thu Aug 25 09:43:16 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/lib/openssl/bn.rb:  Hide copyright info from RDoc.
-	* ext/openssl/lib/openssl/digest.rb:  ditto
-	* ext/openssl/lib/openssl/x509.rb:  ditto
-	* ext/openssl/lib/openssl/cipher.rb:  ditto
-
-Thu Aug 25 09:25:48 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/openssl/ossl_digest.c:  Document OpenSSL::Digest::digest and add
-	  an example to OpenSSL::Digest.  Patch by Sylvain Daubert.
-	  [Ruby 1.9 - Bug #5166]
-	* ext/openssl/lib/openssl/digest.rb (module OpenSSL):  ditto
-
-Thu Aug 25 08:19:43 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* vm.c (vm_make_env_each): work around to solve Bug #2729.
-	  fixes: Bug #2729
-	  a patch from Kazuki Tsujimoto <kazuki@callcc.net>
-	  This problem is caused by changing dfp (dynamic env pointer)
-	  from saved dfp.  Saved dfp is pointed env in VM stack.  However,
-	  the dfp can be moved because VM copies env from VM stack to
-	  the heap.  At this copying, dfp was also changed.  To solve this
-	  problem, I'll try to change throw mechanism (not save target dfp,
-	  but save target cfp).
-
-	* bootstraptest/test_flow.rb: add a test for above.
-
-Thu Aug 25 07:57:33 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* numeric.c (int_round): Fix Integer#round [ruby-core:39096]
-
-Thu Aug 25 07:00:00 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* vm_insnhelper.h, vm_insnhelper.c, vm.c, vm_method.c, insns.def:
-	  Manage a redefinition of special methods for each classes.
-	  A patch from Joel Gouly <joel.gouly@gmail.com>.  Thanks!
-
-Thu Aug 25 06:51:08 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: Fixing psych version number.
-	* ext/psych/psych.gemspec: updating the gemspec.
-
-Thu Aug 25 06:11:35 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/nodes/node.rb: default `to_yaml` encoding to be
-	  UTF-8.
-	* test/psych/test_encoding.rb: test yaml dump encoding.
-
-Thu Aug 25 01:24:33 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* test/fileutils/test_fileutils.rb (test_chmod_symbol_mode): Solaris
-	  seems to behave the same as FreeBSD.
-
-Thu Aug 25 01:11:36 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* test/ruby/test_rubyoptions.rb (test_script_from_stdin): slave pty
-	  should be manipulated because master pty may not be a tty on some
-	  environment (e.g. Solaris). [Bug:#5222] [ruby-dev:44420]
-
-Wed Aug 24 15:13:56 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* iseq.h, iseq.c, compile.c: Change the line number data structure
-	  to solve an issue reported at [ruby-dev:44413] [Ruby 1.9 - Bug #5217].
-	  Before this fix, each instruction has an information including
-	  line number (iseq::iseq_insn_info_table).  Instead of this data
-	  structure, recording only line number changing places
-	  (iseq::iseq_line_info_table).
-	  The order of entries in iseq_line_info_table is ascending order of
-	  iseq_line_info_table_entry::position.  You can get a line number
-	  by an iseq and a program counter with this data structure.
-	  This fix reduces memory consumption of iseq (bytecode).
-	  On my measurement, a rails application consumes 21.8MB for
-	  iseq with this fix on the 32bit CPU.  Without this fix, it
-	  consumes 24.7MB for iseq [ruby-dev:44415].
-
-	* proc.c: ditto.
-
-	* vm_insnhelper.c: ditto.
-
-	* vm_method.c: ditto.
-
-	* vm.c (rb_vm_get_sourceline): change to use rb_iseq_line_no().
-
-Wed Aug 24 09:49:10 2011  Koichi Sasada  <ko1@atdot.net>
-
-	* insns.def (defined): fix to checking class variable.
-	  A patch by Magnus Holm <judofyr@gmail.com>.  Thanks!
-
-	* test/ruby/test_variable.rb: add a test for above.
-
-Wed Aug 24 08:53:06 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rdoc:  Update to RDoc 3.9.3.  Fixes RDoc with `ruby -Ku`.  Allows
-	  HTTPS image paths to be turned into <img> tags.  Prevents special
-	  markup inside <tt> from being processed.
-
-Wed Aug 24 07:57:43 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Update to RubyGems 1.8.9.  Fixes uninstalling multiple
-	  gems and gem cleanup.
-
-Wed Aug 24 06:45:20 2011  Ryan Davis  <ryand-ruby@zenspider.com>
-
-	* lib/minitest/*: Imported minitest 2.5.0 (r6557)
-	* test/minitest/*: ditto
-
-Wed Aug 24 00:38:22 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* thread.c (update_coverage): skip coverage count up if the current
-	  line is out of the way.  rb_sourceline() is unreliable when source
-	  code is big.  [ruby-dev:44413]
-
-	* test/coverage/test_coverage.rb: add a test for above.
-
-Tue Aug 23 15:23:56 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* load.c (rb_f_require):  Improve documentation of Kernel#require.
-	  [Ruby 1.9 - Bug #5210]
-
-Tue Aug 23 11:27:26 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/zlib/zlib.c (gzfile_read_header): Ensure that each section of
-	  gzip header is readable to avoid SEGV.
-
-	* test/zlib/test_zlib.rb (test_corrupted_header): Test it.
-
-Mon Aug 22 23:43:33 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* sprintf.c (rb_str_format): add RB_GC_GUARD to prevent temporary
-	  strings from GC.
-
-Sun Aug 21 17:49:53 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* iseq.c (iseq_s_disasm): remove variable which is no longer used
-	  since r33013.
-
-Sun Aug 21 14:20:58 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* configure.in: use LD_LIBRARY_PATH_64 on 64-bit Solaris.
-
-Sat Aug 20 13:19:52 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* iseq.c (iseq_s_disasm): fix a bug that may cause SEGV.
-
-	* test/ruby/test_method.rb (test_body): add a test for the above change.
-
-Sat Aug 20 10:43:24 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/stringio/stringio.c (strio_read): return new string if nil
-	  is explicitly given as a buffer ([Bug #5207]), otherwise set the
-	  encoding.  also removed dead code.
-
-Fri Aug 19 14:25:51 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* process.c (proc_spawn_v, proc_spawn): should not wait the
-	  spawned process.
-
-	* process.c (proc_spawn_v): fix missing argument, and try with
-	  /bin/sh only if failed with ENOEXEC.
-
-Fri Aug 19 14:12:57 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (idle): raises a Net::IMAP::Error when the
-	  connection is closed.  based on the patch by Hugo Barauna.
-	  [Bug #5190] [ruby-core:38930]
-
-Fri Aug 19 13:18:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* configure.in: defines _DARWIN_UNLIMITED_SELECT if the target_os
-	  is darwin.
-
-Fri Aug 19 13:14:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* thread.c: add a description for the behavior of select(2) on
-	  Mac OS X 10.7 (Lion).
-
-Fri Aug 19 11:28:58 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/net/imap.rb (msg_att): accepts extra space before ')'.
-	  based on the patch by art lussos.  [Bug #5163] [ruby-core:38820]
-
-Wed Aug 17 23:01:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal.c (cannot_be_coerced_into_BigDecimal):
-	  remove duplication.
-
-Wed Aug 17 15:27:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal.c (cannot_be_coerced_into_BigDecimal):
-	  add a new function for raising error when an object cannot coerce
-	  into BigDecimal.  [Bug #5172]
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimalValueWithPrec): use
-	  cannot_be_coerced_into_BigDecimal function.
-
-	* ext/bigdecimal/bigdecimal.c (BigMath_s_exp): ditto.
-
-	* ext/bigdecimal/bigdecimal.c (BigMath_s_log): ditto.
-
-	* test/bigdecimal/test_bigdecimal.rb: test for the above changes.
-
-	* test/bigdecimal/testbase.rb (under_gc_stress): add a new utility
-	  method to run tests under the condition of GC.stress = true.
-
-Wed Aug 17 10:16:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* rational.c (nurat_coerce): Rational#coerce should converts itself
-	  into Complex if the argument is a Complex with non-zero imaginary
-	  part.  [Bug #5020] [ruby-dev:44088]
-
-	* test/ruby/test_rational.rb (test_coerce): test for the above change.
-
-Wed Aug 17 06:33:19 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_x509cert.c: Add class documentation for
-	  OpenSSL::X509::Certificate.
-
-Wed Aug 17 04:54:25 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_pkey.c: corrected docs, OpenSSL::PKey::DH does
-	  *not* support #sign/verify.
-
-Tue Aug 16 18:56:54 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm.c (ruby_threadptr_data_type): rename to hide.
-	  [ruby-core:38972]
-
-Tue Aug 16 18:52:08 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* win32/mkexports.rb (Exports::Mswin#each_export): exclude Init_
-	  and _threadptr_ functions, as well as mingw.
-
-Tue Aug 16 09:31:44 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/dl:  Add documentation.  Patch by Vincent Batts.
-	  [Ruby 1.9 - Bug #5192]
-
-Tue Aug 16 08:48:26 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/.document (fiddle):  Remove duplicate entry
-	* ext/fiddle:  Complete documentation of Fiddle.  Patch by Vincent
-	  Batts.  [#5192]
-
-Tue Aug 16 08:00:15 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/socket:  Make Socket documentation appear.  Add documentation for
-	  Socket, TCPServer, SOCKSSocket.  Patch by Sylvain Daubert.
-	  [Ruby 1.9 - Feature #5182]
-
-Mon Aug 15 09:58:55 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_ssl.c: Support disabling OpenSSL compression.
-
-	* test/openssl/test_ssl.rb: Add a test for it.
-	  Thanks to Eric Wong for the patch.
-	  [Ruby 1.9 - Feature #5183] [ruby-core:38911]
-
-Sun Aug 14 05:57:01 2011  Tanaka Akira  <akr@fsij.org>
-
-	* test/socket/test_socket.rb (test_connect_timeout): added a test
-	  based on a patch by Eric Wong.  [ruby-core:38910]
-
-Sat Aug 13 22:17:27 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/mkconfig.rb: do not make the entries related to sitedir and
-	  verdordir if disabled by --without options.  [ruby-core:38922]
-	  [Bug #5187]
-
-Sat Aug 13 17:03:22 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: [ruby-core:38861]
-
-Sat Aug 13 09:39:07 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* test/date/test_*.rb: added tests.
-
-Sat Aug 13 09:36:19 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* ext/date/date_parse.c (parse_ddd_cb): fix r32896. RB_GC_GUARD
-	  insertion position was mistaken. [ruby-dev:44337] [Bug #5152]
-
-Sat Aug 13 09:26:24 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/core_ext.rb: Make Kernel#y private.
-	  [ruby-core:38913]
-
-	* test/psych/test_yaml.rb: corresponding test.
-
-Sat Aug 13 09:05:16 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c (date_strftime_alloc): followed the change
-	  of r32885.
-
-	* doc/NEWS-1.9.3: followed the above change.
-
-Sat Aug 13 08:55:38 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych/scalar_scanner.rb: Only consider strings
-	  with fewer than 2 dots to be numbers. [ruby-core:38915]
-
-Sat Aug 13 08:47:20 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: [ruby-core:38855].
-
-Sat Aug 13 03:41:37 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/uri/common.rb:  Fix documentation of URI::Parser.new.  Patch by
-	  Steve Klabnik.  [Ruby 1.9 - Bug #5177]
-
-Sat Aug 13 02:19:57 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/digest/digest.c:  Add documentation for the Digest module.  Patch
-	  by Sylvain Daubert.  [Ruby 1.9 - Bug #5167]
-
-Sat Aug 13 01:56:11 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rake:  Update to Rake 0.9.2.2.  Prevent pollution of toplevel
-	  namespace by Commands.  Remove unused variable and debugging
-	  statement in tests.
-
-Fri Aug 12 11:39:35 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: Describe "no" configure option for site_ruby
-	  and vendor_ruby. Patch by Vit Ondruch. [Bug #5187][ruby-core:38921]
-
-Fri Aug 12 09:00:24 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Import RubyGems 1.8.8.  Fixes encoding of YAML gemspec
-	  from gems.  Github Issue #149
-
-Fri Aug 12 08:17:46 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ipsocket.c (init_inetsock_internal): use SOMAXCONN for
-	  listen backlog.
-
-	* ext/socket/unixsocket.c (rsock_init_unixsock): ditto.
-
-	* ext/socket/lib/socket.rb (Addrinfo#listen): ditto.
-	  (Socket.tcp_server_sockets_port0): ditto.
-
-	* ext/socket/mkconstants.rb: define SOMAXCONN as 5 if not available.
-
-	[ruby-core:38493]
-
-Fri Aug 12 03:24:35 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rdoc:  Import RDoc 3.9.2.  Fixes TIDYLINK for HTML output.
-
-Thu Aug 11 15:37:42 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* variable.c (autoload_delete): An autoload entry is still in a
-	  RCLASS_IV_TBL, not in a RCLASS_CONST_TBL, so take back the table
-	  changed in r29600. And an autoload entry keeps not a
-	  rb_const_entry_t but a NODE so remove rb_const_entry_t thing added
-	  in r29602.
-
-Thu Aug 11 15:07:36 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (link_command): use LIBRUBYARG in rbconfig for
-	  unbundled extensions.  [ruby-core:38802] [Bug #5147]
-
-	* lib/mkmf.rb (init_mkmf): revert r32902.  [ruby-core:38903]
-
-Wed Aug 10 23:03:55 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/lib/socket.rb: fix argument check in the previous commit.
-
-Wed Aug 10 22:12:28 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/lib/socket.rb (Socket.tcp): add :connect_timeout option.
-	  (Addrinfo#connect_from): add :timeout option.
-	  (Addrinfo#connect): ditto.
-	  (Addrinfo#connect_to): ditto.
-	  [ruby-core:38538]
-
-Wed Aug 10 21:27:19 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/net/pop.rb: fix typo in document.
-
-	* lib/net/http.rb: ditto.
-
-	* lib/net/imap.rb: ditto.
-
-Wed Aug 10 19:30:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* complex.c (nucomp_rationalize): calls rationalize of real part if
-	  imaginary part is exactly zero.  The patch is made by Marc-Andre
-	  Lafortune.  fixes [Bug #5178] [ruby-core:38885]
-
-	* test/ruby/test_complex.rb (test_rationalize): add a test for the
-	  above change.
-
-	* complex.c (nucomp_to_r): fix RDoc comment.  The patch is made by
-	  Marc-Andre Lafortune.
-
-Wed Aug 10 14:11:07 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (init_mkmf): set $LIBRUBYARG regardless of shared
-	  option.  [ruby-core:38802] [Bug #5147]
-
-Wed Aug 10 02:53:27 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/net/http.rb: come back autoload. OpenSSL constant is used
-	  some places, so it leads mistakes like HTTP.start.
-
-Tue Aug  9 22:57:45 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* ext/date/date_parse.c (date_zone_to_diff): add RB_GC_GUARD.
-	  [ruby-dev:44337] [Bug #5152]
-
-	* ext/date/data_parse.c (parse_ddd_cb): ditto.
-
-Tue Aug  9 14:25:47 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* ext/fiddle/conversions.c (generic_to_value): ffi_arg and ffi_sarg
-	  should be used to handle shorter return value. fix [Bug #3861]
-	  [ruby-core:32504]
-
-	* ext/fiddle/closure.c (callback): ditto
-
-	* ext/fiddle/conversions.h (fiddle_generic): ditto
-
-	* ext/fiddle/conversions.c (value_to_generic): char, short and int
-	  are strictly distinguished on big-endian CPU, e.g. sparc64.
-
-Tue Aug  9 11:21:08 2011  Narihiro Nakamura  <authornari@gmail.com>
-
-	* gc.c (gc_lazy_sweep): if sweep target slots are not found, we
-	  try heap_increment() because it might be able to expand the
-	  heap. [Bug #5127] [ruby-dev:44285]
-
-	* gc.c (gc_clear_mark_on_sweep_slots): if a sweeping was
-	  interrupted, we expand the heap if at all possible.
-
-Tue Aug  9 12:20:33 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* test/fiddle/helper.rb (libc_so, libm_so): Solaris support added.
-	  [ruby-core:38853] [Bug #5168]
-
-	* test/dl/test_base.rb (libc_so, libm_so): on Solaris, remove libc
-	  and libm version numbers for detecting default libc and libm.
-
-Tue Aug  9 09:18:04 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/zlib/zlib.c (gzfile_wrap):  Document encoding options.
-
-	* ext/zlib/zlib.c (rb_gzwriter_s_open): ditto
-
-	* ext/zlib/zlib.c (rb_gzreader_s_open): ditto
-
-Sun Aug  7 23:31:32 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* time.c (rb_strftime_alloc): raise ERANGE if width is too large.
-	  Patch by Nobuyoshi Nakada. [Bug #4457] [ruby-dev:43285]
-
-	* test/ruby/test_time.rb (class TestTime): add a test for the
-	  above change.
-
-Sun Aug  7 22:51:45 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* ext/openssl/ossl_asn1.c (decode_eoc): remove unused variables.
-	  Patch by Eric Wong. [Feature #5157] [ruby-core:38798]
-
-	* ext/openssl/ossl_asn1.c (ossl_asn1_decode): ditto.
-
-	* ext/openssl/ossl_pkey.c (ossl_pkey_new_from_data): ditto.
-
-Sun Aug  7 22:37:08 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* configure.in: add -Wunused-variable to default CFLAGS.
-	  Patch by Eric Wong. [Feature #5157] [ruby-core:38798]
-
-Sun Aug  7 15:37:35 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/digest/sha2/sha2ossl.c: use original SHA384_Final on DragonFly.
-
-Sun Aug  7 14:08:16 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* ext/objspace/objspace.c: fix typos in a document.
-
-Sun Aug  7 07:14:57 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* cont.c (HAVE_GETCONTEXT): see getcontext(3) because DragonFly BSD
-	  x64 port doesn't have it.
-
-Sun Aug  7 00:42:55 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/tk/lib/tk/wm.rb (Tk::Wm.command): Add the missing receiver
-	  before calling epath. patched by flori
-	  https://github.com/flori/ruby/commit/aa9474d32e5f2c57f8b0e2e0c528a03f06a4d433
-
-Sat Aug  6 07:06:34 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* marshal.c (w_object):  Fix exception message when _dump_data is not
-	  defined on a T_DATA object.
-
-Fri Aug  5 22:16:20 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* numeric.c (rb_infinity, rb_nan): use WORDS_BIGENDIAN to get endian.
-	  fix [Bug #5160] [ruby-dev:44356]
-
-Fri Aug  5 17:14:11 2011  Akinori MUSHA  <knu@iDaemons.org>
-
-	* test/test_syslog.rb (TestSyslog#test_log): Do not be too
-	  specific about the log line format.  Fixes #5081.
-
-Fri Aug  5 15:57:10 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* complex.c (f_signbit): fix compile error in gcc4 on Solaris with
-	  CFLAGS="-std=gnu99".  [ruby-dev:44355] fix [Bug #5159]
-
-	* math.c: ditto.
-
-Fri Aug  5 15:55:33 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/ruby/test_object.rb: tests that respond_to? returns false.
-
-Fri Aug  5 13:32:43 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* lib/xmlrpc/client.rb, lib/xmlrpc/server.rb: should use
-	  String#bytesize instead of String#size.
-
-Fri Aug  5 12:18:20 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* vm_eval.c (check_funcall): try respond_to? first if redefined.
-	  [Bug #5158]
-
-Fri Aug  5 09:48:22 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Import RubyGems 1.8.7:
-	  Added missing require for `gem uninstall --format-executable`.
-
-	  The correct name of the executable being uninstalled is now displayed
-	  with --format-executable.
-
-	  Fixed `gem unpack uninstalled_gem` default version picker.
-
-	  RubyGems no longer claims a nonexistent gem can be uninstalled.
-
-	  `gem which` no longer claims directories are requirable files.
-
-	  `gem cleanup` continues cleaning up gems if one can't be uninstalled
-	  due to permissions.  Issue #82.
-
-	  Gem repository directories are no longer created world-writable.
-	  Patch by Sakuro OZAWA.  [Ruby 1.9 - Bug #4930]
-
-Fri Aug  5 07:00:31 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* test/io/console/test_io_console.rb (test_noctty): daemon() on
-	  Fedora Rawhide seems not to detach the controlling terminal,
-	  when the argument noclose is non-zero.  ref: [Bug #5135]
-
-Thu Aug  4 23:48:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* thread_pthread.c (native_cond_signal): retry to call pthread_cond_signal
-	  and pthread_cond_broadcast if they return EAGAIN in
-	  native_cond_signal and native_cond_broadcast, respectively.
-	  It is for the pthread implementation of Mac OS X 10.7 (Lion).
-	  fixes #5155.  [ruby-dev:44342].
-
-	* thread_pthread.c (native_cond_broadcast): ditto.
-
-	* thread_pthread.c (struct cached_thread_entry): stop using
-	  pthread_cond_t and its functions directly.
-
-	* thread_pthread.c (register_cached_thread_and_wait): ditto.
-
-	* thread_pthread.c (use_cached_thread): ditto.
-
-Thu Aug  4 20:29:41 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* configure.in: when Solaris cc, use $(CC) to link shared libs.
-
-Thu Aug  4 20:19:11 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* error.c (report_bug): use a small message buffer instead of BUFSIZ.
-	  It is needed for avoiding nested SIGSEGV on Linux.
-	  Note: BUFSIZ is not proper buffer size. It's unrelated with maximum
-	  filename length. :-/
-	  [Bug #5139] [ruby-dev:44315]
-
-Thu Aug  4 16:08:45 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* tool/rbinstall.rb (gem): install all gemspecs under lib and ext.
-
-	* tool/rbinstall.rb (Gem::Specification): may not be defined when
-	  cross-compiling and BASERUBY is 1.8.
-
-Thu Aug  4 11:30:36 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* include/ruby/missing.h: define __syscall on OpenBSD as r32702.
-
-Thu Aug  4 03:02:54 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* tool/rbinstall.rb: use rubygems to load gemspecs, copy actual
-	  gemspecs on install rather than generate fake ones for all gems.
-
-Thu Aug  4 02:45:10 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* configure.in: set CXX variable to the C++ compiler that matches the
-	  C compiler specified by CC variable (e.g. use g++-4.2 for gcc-4.2).
-
-Thu Aug  4 02:21:10 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* lib/mkmf.rb (link_command): use static library only for bundled
-	  extensions.  [Bug #5147]
-
-Thu Aug  4 02:02:10 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/psych.gemspec: installing psych as a gem.
-
-Wed Aug  3 16:01:35 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* util.c, include/ruby/util.h (ruby_add_suffix): remove the function.
-	  [Bug #5153] [ruby-core:38736]
-
-	* io.c (argf_next_argv): remove the call of above function.
-
-	* ext/-test-/add_suffix, test/-ext-/test_add_suffix.rb: remove the test
-	  extension module because this is only for testing ruby_add_suffix().
-
-	* LEGAL: remove the mention about a part of util.c, because now we
-	  removed the part.
-
-	* io.c (argf_next_argv): now the new filename is not guaranteed to
-	  use, so should check the return value of rename(2).
-
-	* test/ruby/test_argf.rb (TestArgf#test_inplace_rename_impossible):
-	  now we expect same result with other platforms on no_safe_rename
-	  platforms (=Windows).
-
-Wed Aug  3 09:18:08 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* test/xmlrpc/webrick_testing.rb (WEBrick_Testing#start_server):
-	  Like r32795, bind address should be specified.
-
-Wed Aug  3 07:46:30 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* encoding.c (enc_find): mistakenly remained !.  [Bug #5150]
-
-Wed Aug  3 00:11:08 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/prettyprint.rb: update document.  [ruby-core:36776]
-
-Tue Aug  2 22:04:46 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* gc.c (init_heap): allocate sigaltstack after heaps are allocated.
-	  [ruby-dev:44315] [Bug #5139]
-
-	* vm.c (thread_free): use free because objspace is not ready.
-
-	* vm.c (th_init): use malloc because objspace is not ready.
-
-Tue Aug  2 20:10:16 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* test/testunit/test_parallel.rb: pass "--ruby" option to
-	  test/testunit/tests_for_parallel/runner.rb. [Bug #5132] [ruby-dev:44303]
-
-Tue Aug  2 15:53:37 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* encoding.c (str_to_encoding): rename from to_encoding and
-	  use str_to_encindex.
-
-	* encoding.c (str_to_encindex): split from to_encoding.
-
-	* encoding.c (rb_to_encoding): use str_to_encoding.
-
-	* encoding.c (rb_obj_encoding): don't bypass rb_encoding*.
-	  If it uses rb_encoding*, it bypass encindex. If it uses encindex,
-	  it doesn't bypass.
-
-	* encoding.c (enc_find): add shortcut for encoding object, use
-	  str_to_encindex, and avoid bypass rb_encoding*.
-
-Tue Aug  2 12:03:16 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* hash.c (recursive_hash): hash value of emptied hash should be
-	  equal to an empty hash.  [ruby-core:38650]
-
-Tue Aug  2 11:42:15 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (rb_enc_symname2_p): :! is valid symbol.  [Bug #5136]
-
-Tue Aug  2 07:33:29 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* test/net/http/test_http.rb (TestNetHTTP_version_1_1_methods#test_timeout_during_HTTP_session):
-	  If you connect to localhost, you should listen localhost.
-
-	* test/net/http/test_https.rb (TestNetHTTPS#test_timeout_during_SSL_handshake):
-	  ditto.
-
-Tue Aug  2 06:18:15 2011  Luis Lavena  <luislavena@gmail.com>
-
-	* lib/rubygems/installer.rb (class Gem): Correct path check on Windows
-	  Possible fix for [Ruby 1.9 - Bug #5111]
-	* test/rubygems/test_gem_installer.rb (load Gem): ditto
-
-Mon Aug  1 20:12:03 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/ruby/test_process.rb (TestProcess#windows?): new method.
-
-	* test/ruby/test_process.rb (TestProcess#*): use above method.
-
-	* test/ruby/test_process.rb (TestProcess#test_execopts_redirect):
-	  windows doesn't support FD_CLOEXEC.
-
-Mon Aug  1 15:45:23 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* test/rake/test_rake_functional.rb:  Don't assume the binary name of
-	  ruby is "ruby".  [Ruby 1.9 - Bug #5114]
-	* test/rake/helper.rb:  ditto
-
-Mon Aug  1 15:31:14 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* test/io/console/test_io_console.rb (TestIO_Console#test_sync):
-	  Skip when PTY allocation failed (that's not our fault).
-
-Mon Aug  1 15:04:12 2011  URABE Shyouhei  <shyouhei@ruby-lang.org>
-
-	* test/xmlrpc/test_webrick_server.rb (Test_Webrick#setup_http_server):
-	  XMLRPC::Client.new3(), when called without host: argument, tries
-	  to  connect to  a host  where "localhost"  resolves to.   On the
-	  other  hand  a  WEBrick::HTTPServer.new(), when  called  without
-	  BindAddress:  argument, tries  to listen  all the  address where
-	  getaddrinfo(AF_UNSPEC) resolves to.   This is a mismatch because
-	  "localhost" might not resolve to one of those listening sockets.
-	  We  would  better explicitly  specify  "localhost"  here and  if
-	  failed, just skip the whole test.
-
-Mon Aug  1 14:24:56 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rdoc.rb:  Import RDoc 3.9.1.  Fixes bugs in the RDoc::Markup
-	  parser.
-
-Mon Aug  1 12:00:35 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* insns.def (concatstrings): don't use initial ASCII-8BIT string.
-	  [ruby-core:38635] [Bug #5126]
-
-Sun Jul 31 22:57:16 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* enc/Makefile.in (ECHO1): Same as the recent fix in common.mk.
-	  ":" in a make variable replacement cause a syntax error with
-	  /usr/ccs/bin/make on Solaris.  Uses $(NULLCMD) instead.
-
-Sun Jul 31 21:16:02 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* complex.c (f_signbit): gcc4 on Solaris DOES have signbit but does
-	  not have it on header.
-
-	* math.c: ditto.
-
-Sun Jul 31 21:09:04 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* common.mk (node_name.inc): Use $(Q) for consistency.
-
-	* Makefile.in (INSNS): ditto.
-
-Sun Jul 31 21:19:51 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* lib/mkmf.rb (configuration:ECHO1): Same as the recent fix in
-	  common.mk.
-	  ":" in a make variable replacement cause a syntax error with
-	  /usr/ccs/bin/make on Solaris.  Uses $(NULLCMD) instead.
-
-Sun Jul 31 20:39:12 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* common.mk (ECHO1): nmake does not allow parenthesis in make variable
-	  replacement.
-
-Sun Jul 31 23:06:57 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c (check_env): print debug messages to stderr.
-	[Feature #4871] [ruby-dev:43743]
-
-Sun Jul 31 22:50:23 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c (vm_make_env_each): don't save prev env value.
-	It is no longer used. [Feature #4871] [ruby-dev:43743]
-
-	* vm.c (check_env): changed accordingly.
-
-Sun Jul 31 20:21:36 2011  "Yuki Sonoda (Yugui)"  <yugui@yugui.jp>
-
-	* common.mk (ECHO1): ":" in a make variable replacement cause a syntax
-	  error with /usr/ccs/bin/make on Solaris.  Uses $(NULLCMD) instead.
-
-	* configure.in (NULLCMD): new check.
-
-	* Makefile.in (NULLCMD): Reflects checking in configure.
-
-	* win32/Makefile.sub (NULLCMD): new assignment.
-
-Sun Jul 31 18:58:59 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_pipe): pipe on cygwin can succeed half but fail
-	  half.
-
-Sun Jul 31 11:31:07 2011  Kazuki Tsujimoto  <kazuki@callcc.net>
-
-	* vm.c: check if cfp is valid. [Bug #5083] [ruby-dev:44208]
-
-Sun Jul 31 09:18:28 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rdoc:  Update to RDoc 3.9.  Fixed `ri []`, stopdoc creating an
-	  object reference, nodoc for class aliases, verbatim === lines.
-
-Sun Jul 31 01:29:08 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* io.c (rb_io_each_byte): remove unused variable e.
-
-Sat Jul 31 01:23:45 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* test/bigdecimal/test_bigdecimal.rb (test_version): removed.
-
-Sat Jul 30 23:19:09 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* defs/default_gems: separate from tool/rbinstall.rb.
-
-Sat Jul 30 23:14:44 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* io.c (rb_io_each_byte): rbuf can be refreshed during yield.
-	  [Bug #5119]
-
-Sat Jul 30 22:35:50 2011  Naohisa Goto  <ngotogenome@gmail.com>
-
-	* strftime.c (NEEDS): avoid SEGV due to integer overflow in
-	  sparc-solaris2.10 and i686-linux.  fix [Bug #4456] [ruby-dev:43284]
-
-Sat Jul 30 17:26:26 2011  Masaki Suketa <masaki.suketa@nifty.ne.jp>
-
-	* test/win32ole/test_win32ole_variant.rb: use skip method to skip the test.
-
-	* test/win32ole/test_win32ole_variant_outarg.rb: ditto.
-
-Sat Jul 30 14:27:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/bigdecimal.c (BigDecimal_version): version 1.1.0.
-
-	* ext/bigdecimal/bigdecimal.gemspec: turn into a default gem.
-
-	* tool/rbinstall.rb: ditto.
-
-Sat Jul 30 11:21:55 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* vm_core.h (ALT_STACK_SIZE): use MINSIGSTKSZ*2 instead of SIGSTKSZ*2.
-	  [ruby-core:38607]
-
-Sat Jul 30 10:39:14 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* vm.c (th_init): preallocate alternative stack.
-	  NoMemoryError is better than rb_bug, of course.
-	  Patch by Eric Wong. [ruby-core:38572][ruby-core:38594].
-
-	* signal.c (rb_register_sigaltstack): ditto.
-
-	* vm_core.h: moved ALT_STACK_SIZE definition from signal.c.
-	* vm.c (thread_free): use xfree() instead of free().
-
-Sat Jul 30 07:20:49 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/lib/socket.rb (udp_server_sockets): unused variable
-	  removed.
-	  patch by Jeremy Evans.  [ruby-core:38600]
-
-Fri Jul 29 23:56:32 2011  Tanaka Akira  <akr@fsij.org>
-
-	* lib/securerandom.rb: call OpenSSL::Random.seed at the
-	  SecureRandom.random_bytes call.
-	  based on the patch by Masahiro Tomita.  [ruby-dev:44270]
-
-Fri Jul 29 23:53:48 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* array.c (rb_ary_set_len): new function to set array length.
-
-	* vm_eval.c (method_missing): set the length of argv array, to mark
-	  arguments.
-
-	* vm_eval.c (rb_apply): get rid of too large alloca.
-
-Fri Jul 29 20:48:39 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb: fix typos.
-
-Fri Jul 29 20:28:56 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb: use whitespaces as a separator.
-
-Fri Jul 29 18:59:07 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/mkconstants.rb: add documents for constants.
-	  patch by Eric Hodel.  [ruby-core:37853] [Bug #4989]
-
-Fri Jul 29 16:00:43 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* configure.in (enable_pthread): use -pthread on OpenBSD without
-	  explicit option. patched by Jeremy Evans. [ruby-core:38572]
-
-Thu Jul 28 23:36:28 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* ext/fiddle/closure.c (callback): use rb_ary_tmp_new() instead of
-	  xmalloc() to allocate an array for arguments of callback procedure,
-	  to prevent arguments from being swept by GC. [ruby-core:38546]
-	  [Bug #4929]
-
-Thu Jul 28 22:36:06 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/openssl/ossl_cipher.c (ossl_cipher_initialize): Avoid possible
-	  SEGV from AES encryption/decryption. Processing data by
-	  Cipher#update without initializing key (meaningless usage of Cipher
-	  object since we don't offer a way to export a key) could cause SEGV.
-
-	  In OpenSSL, the EVP which has EVP_CIPH_RAND_KEY flag (such as DES3)
-	  allows uninitialized key, but other EVPs (such as AES) does not
-	  allow it. Calling EVP_CipherUpdate() without initializing key causes
-	  SEGV so we set the data filled with "\0" as the key by default. See
-	  #2768.
-
-	* test/openssl/test_cipher.rb: test it.
-
-Thu Jul 28 14:25:08 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* lib/rubygems/user_interaction.rb (Gem::StreamUI#tty?): typo.
-
-Thu Jul 28 12:32:53 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/callback/mkcallback.rb (gencallback): use PTR2NUM.
-
-	* ext/dl/cptr.c (rb_dlptr_aref, rb_dlptr_aset): check NULL pointer
-	  dereference.
-
-	* ext/dl/cptr.c (rb_dlptr_s_to_ptr): use rb_check_funcall.
-
-	* ext/dl/cptr.c (rb_dlptr_s_to_ptr): fix wrapping condition.
-
-Thu Jul 28 04:53:31 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/delegate.rb:  Move file-level documentation to the appropriate
-	  classes.
-
-Thu Jul 28 02:15:04 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* ext/dl/cfunc.c (dlcfunc_mark), ext/dl/cptr.c (dlptr_mark):
-	  workaround to mark wrapped object.  this is not a true fix,
-	  because [Bug #4929] is caused by the interface design of DL.
-
-Thu Jul 28 00:28:15 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/fileutils/test_fileutils.rb: add OpenBSD case.
-	  patched by Jeremy Evans [ruby-core:38530] see #5097
-
-	* test/ruby/test_process.rb: ditto.
-
-Wed Jul 27 22:46:59 2011  CHIKANAGA Tomoyuki  <nagachika00@gmail.com>
-
-	* test/rinda/test_rinda.rb (test_remote_array_and_hash):
-	  add local variables to protect objects from GC. [ruby-dev:44253]
-	  [Bug #5104]
-
-Wed Jul 27 17:55:54 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* include/ruby/missing.h: define __syscall if the platform has
-	  __syscall in the library but doesn't define it in headers
-	  for example Mac OS X.
-
-Wed Jul 27 15:39:14 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* object.c:  Add usage documentation for BasicObject.  Based on patch
-	  by Thomas Sawyer.  [Ruby 1.9 - Bug #5067]
-
-Wed Jul 27 12:24:17 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/uninstaller.rb:  Add missing require and update
-	  messaging to avoid confusion with uninstall --format-executable.
-	  [Ruby 1.9 - Bug #4062]
-
-Wed Jul 27 09:34:24 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems:  Update to RubyGems 1.8.6.1.
-
-Wed Jul 27 09:27:59 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_pkcs12.rb: Add test and intermediate certificates.
-	  [ Ruby 1.9 - Feature #3793 ] [ruby-core:32088]
-
-Wed Jul 27 01:05:32 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* eval_error.c (rb_print_undef_str): new function to raise
-	  NameError for undefined method.
-
-	* load.c (rb_mod_autoload_p), object.c (rb_mod_const_get),
-	  variable.c (rb_f_untrace_var, set_const_visibility), vm_method.c
-	  (rb_mod_{remove,undef,alias}_method, set_method_visibility):
-	  remove inadvertent symbol creation.  based on the first patch by
-	  Jeremy Evans at [ruby-core:38447].  [Feature #5089]
-
-	* vm_method.c (obj_respond_to): fix the respond_to_missing? override
-	  case.  based on the patch by Jeremy Evans at [ruby-core:38417].
-	  [Feature #5072]
-
-	* parse.y (rb_check_id): make the given name a symbol or a string.
-	  based on the second patch by Jeremy Evans at [ruby-core:38447]
-
-Wed Jul 27 00:50:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/lib/bigdecimal/util.rb (Rational#to_d):
-	  zero or negative precision is error.  fixes #5098.
-	  [ruby-dev:44210]
-
-	* test/bigdecimal/test_bigdecimal_util.rb: add test for the above
-	  change.
-
-Wed Jul 27 00:48:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/lib/bigdecimal/util.rb (Float#to_d): modified for
-	  specifying precision.  fixes #5098.  [ruby-dev:44210]
-
-	* test/bigdecimal/test_bigdecimal_util.rb: add test for the above
-	  change.
-
-Wed Jul 27 00:45:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/lib/bigdecimal/util.rb (Integer#to_d): added
-	  for symmetry to BigDecimal() function with an Integer.
-	  fixes #5098.  [ruby-dev:44210]
-
-	* test/bigdecimal/test_bigdecimal_util.rb: add test for the above
-	  change.
-
-Wed Jul 27 00:30:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* ext/bigdecimal/lib/bigdecimal/util.rb (BigDecimal#to_d): added
-	  for adapting other Numeric subclasses.  [ruby-dev:44245]
-
-	* test/bigdecimal/test_bigdecimal_util.rb: test for the above change.
-
-Wed Jul 27 00:27:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* bigdecimal/bigdecimal.c (VpDup) a new function for duplicating
-	  a BigDecimal.
-
-	* bigdecimal/bigdecimal.c (BigDecimal_new): support generating a new
-	  BigDecimal from another BigDecimal using BigDecimal global function
-	  or constructor.  [ruby-dev:44245]
-
-Tue Jul 26 23:33:24 2011  Igor Zubkov  <igor.zubkov@gmail.com>
-
-	* array.c: Fix typo. https://github.com/ruby/ruby/pull/36
-
-Mon Jul 25 23:51:01 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* proc.c: pre-allocate the unlinked_method_entry_list_entry struct to
-	  avoid memory allocation during GC.  based on a patch from Eric Wong.
-	  [ruby-core:38498]
-
-Mon Jul 25 23:39:33 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* test/rake/test_rake_directory_task.rb (TestRakeDirectoryTask#
-	  test_directory_win32): fixed wrong test.
-
-Mon Jul 25 22:36:11 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* proc.c (struct METHOD), gc.c (gc_marks), vm_method.c
-	  (rb_gc_mark_unlinked_live_method_entries): fix SEGV bug.
-	  rb_method_entry_t was free'd even when the method is still on the
-	  stack if it is BMETHOD (i.e., Method#call).  This is because
-	  rb_method_entry_t is embedded in struct METHOD.  This commit
-	  separates them and marks the live method entries.
-	  See [ruby-core:38449] in detail.  fix [Bug #5047] [ruby-core:38171]
-
-Mon Jul 25 22:14:37 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* lib/xmlrpc/client.rb: Fix possible HTTP header formatting failure by
-	  'Basic' header. Long username caused the base64 String truncation in
-	  HTTP header which is not allowed. See #5046.
-
-	* test/xmlrpc/test_webrick_server.rb: test it.
-
-Mon Jul 25 15:04:33 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/openssl/lib/openssl.rb: End of transition period introduced by
-	  [ruby-dev:38018]. From the next version of 1.9.3, you should use
-	    require "openssl"
-	  instead of
-	    require "openssl/ssl"
-	  and
-	    require "openssl/x509"
-
-Mon Jul 25 13:46:38 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/openssl/lib/openssl/x509.rb: Cosmetic change: move definition
-	  introduced in r30152 to x509-internal.rb.
-
-Mon Jul 25 13:09:42 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/openssl/ossl_ssl.c (ossl_ssl_shutdown): Avoid randomly generated
-	  SSLError from SSLSocket just after invoking SSLSocket#close.
-	  OpenSSL's SSL_shutdown could try to send alert packet and it might
-	  set SSLerr(global error stack) as the result. It causes the next
-	  SSL read/write operation to fail by unrelated reason.
-
-	  By design, we're ignoring any error at SSL_shutdown() so we clear
-	  global error stack after SSL_shutdown is called. See #5039.
-
-Sun Jul 24 20:29:53 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: refine the recvmsg test.
-
-Sun Jul 24 20:02:31 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: fix the recvmsg test.
-
-Sun Jul 24 08:42:51 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/extconf.rb: test recvmsg allocates file descriptors for
-	  fd passing even with MSG_PEEK.
-
-	* ext/socket/ancdata.c: use the above test result.
-
-Sun Jul 24 01:04:50 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/rubygems/specification.rb:  Restore behavior of
-	  Gem::Specification#loaded.  [Ruby 1.9 - Bug #5032]
-
-Sun Jul 24 00:05:00 2011  Jeremy Evans  <merch-redmine@jeremyevans.net>
-
-	* error.c (rb_name_error_str): new function to raise NameError
-	  with the name string but not ID.
-
-	* object.c, proc.c, variable.c: more removal of inadvertent symbol
-	  creation.  [Feature #5079]
-
-Sat Jul 23 21:14:00 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* lib/cmath.rb (cbrt): should return a real number if possible.
-
-Sat Jul 23 20:12:52 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* test/rake/test_rake_functional.rb (setup): Use __FILE__ for the base
-	  directory. Current directory is not the top source directory when
-	  the building process runs on other than there.
-
-	* test/rake/test_rake_rake_test_loader.rb: ditto.
-
-	* test/rake/test_rake_task_argument_parsing.rb
-	  (test_terminal_width_using_hardcoded_80): hardcoded 80 is used
-	  when app.unix? is false.
-
-Sat Jul 23 20:11:50 2011  Tadayoshi Funaba  <tadf@dotrb.org>
-
-	* ext/date/date_core.c: an issue that is same as  [ruby-dev:44071].
-	* ext/date/date_strftime.c: identical to [ruby-dev:44112].
-
-Sat Jul 23 19:12:53 2011  Masaki Suketa <masaki.suketa@nifty.ne.jp>
-
-	* test/win32ole/test_err_in_callback.rb (test_err_in_callback):
-	  skip test if ADODB.connection is not available.
-
-Sat Jul 23 15:37:04 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* parse.y (rb_enc_symname_type): :$a!, @a! and so on are not
-	  valid symbols, so they should be inspected with quotes.
-
-Sat Jul 23 17:06:25 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_update_max_fd): validate fd.
-
-	* ext/socket/rubysocket.h (rsock_discard_cmsg_resource): add
-	  msg_peek_p argument for the declaration.
-
-	* ext/socket/ancdata.c (discard_cmsg): add msg_peek_p argument.
-	  assume FreeBSD, NetBSD and MacOS X doesn't generate passed fd
-	  when MSG_PEEK.
-	  (rsock_discard_cmsg_resource): add msg_peek_p argument.
-	  (bsock_recvmsg_internal): call rsock_discard_cmsg_resource with
-	  msg_peek_p argument.
-
-	* ext/socket/unixsocket.c (unix_recv_io): call
-	  rsock_discard_cmsg_resource with msg_peek_p argument.
-
-Sat Jul 23 14:38:28 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* test/rake*: Remove dependencies on flexmock and session gems.
-	  [Ruby 1.9 - Bug #4987]
-
-Sat Jul 23 12:19:04 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (rb_check_id): take care of attrset ID created
-	  implicitly by local ID.  [Bug #5084]
-
-	* parse.y (rb_check_id): conversion condition was inverse.
-	  [Bug #5084]
-
-Fri Jul 22 21:46:54 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* vm_insnhelper.c (vm_call_cfunc): added volatile for a workaround
-	  of cfp consistency error problem on OS X 10.7 (Lion). It's
-	  suspected llvm optimization bug.
-	  [Bug #5074] [ruby-dev:44185]
-
-Fri Jul 22 21:18:20 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/uri/generic.rb (WFKV_): unroll the loop of regexp.
-
-	* lib/uri/generic.rb (URI.decode_www_form_component): ditto.
-
-Fri Jul 22 21:06:39 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* object.c (rb_mod_{const,cvar}_defined, rb_obj_ivar_defined):
-	  avoid inadvertent symbol creation in reflection methods.  based
-	  on a patch by Jeremy Evans at [ruby-core:38367].  [Feature #5072]
-
-	* vm_method.c (rb_mod_method_defined)
-	  (rb_mod_{public,private,protected}_method_defined)
-	  (obj_respond_to): ditto.
-
-	* parse.y (rb_check_id): new function returns already interned ID
-	  or 0.
-
-Fri Jul 22 20:44:49 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (rb_is_global_id, rb_is_attrset_id): add missing
-	  predicates.
-
-Fri Jul 22 20:24:38 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* test/ruby/test_object.rb (TestObject#test_respond_to_missing):
-	  2nd argument of respond_to_missing? is not optional.
-
-Fri Jul 22 19:05:47 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* parse.y (rb_enc_symname2_p): get rid of potential out-of-bound
-	  access.
-
-Fri Jul 22 13:55:59 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* lib/net/http.rb:  Net::HTTP#finish is used to manually close
-	  connections.  [Ruby 1.9 - Bug #5045]
-
-Fri Jul 22 13:51:29 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* ext/readline/readline.c:  Add examples for Readline.completion_proc=.
-	  [Ruby 1.9 - Bug #5057]
-
-Fri Jul 22 13:03:12 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_hmac.c: Revert checking return type of
-	  HMAC_Init_ex as it is not compatible with OpenSSL < 1.0.0.
-
-Fri Jul 22 12:10:21 2011  Eric Hodel  <drbrain@segment7.net>
-
-	* tool/rbinstall.rb (default gems):  Install executables into the fake
-	  gem dir for Gem.bin_path.  [#4485]
-
-Fri Jul 22 11:20:20 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_digest.c: Check return value of EVP_DigestInit_ex.
-	* ext/openssl/ossl_hmac.c: Check return value of HMAC_Init_ex.
-	  Thanks, Jared Jennings, for the patch.
-	  [ Ruby 1.9 - Bug #4944 ] [ruby-core:37670]
-
-Fri Jul 22 09:09:43 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* ext/openssl/ossl_engine.c: Avoid double free of ENGINE reference.
-	* test/openssl/test_engine.rb: Add a test for it.
-	  Thanks to Ippei Obayashi for providing the patch.
-	  [ Ruby 1.9 - Bug #5062 ] [ruby-dev:44173]
-
-Fri Jul 22 06:37:13 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* lib/csv.rb: Do not modify CSV.generate's argument [ruby-core:38356]
-
-Thu Jul 21 20:59:59 2011  Tanaka Akira  <akr@fsij.org>
-
-	* ext/socket/ancdata.c (discard_cmsg): workaround for MacOS X Lion.
-
-Thu Jul 21 20:02:11 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* thread.c (set_trace_func, thread_set_trace_func_m): reset tracing
-	  state when set_trace_func hook is removed.  This is workaround patch
-	  to force to reset tracing state that is broken by continuation call.
-	  a patch from James M. Lawrence.  [Feature #4347] [ruby-core:34998]
-
-	* test/ruby/test_continuation.rb (class TestContinuation): add a test
-	  for above.  a patch from James M. Lawrence.
-
-Thu Jul 21 19:27:19 2011  Yusuke Endoh  <mame@tsg.ne.jp>
-
-	* node.c (dump_node): add today's knowledge.  "init arguments (m)" and
-	  "init arguments (p)" of compile.c indicates a Ruby code that
-	  evaluates multiple assignments that is in method or block
-	  parameters:  def foo((m1,m2), (m3,m4), *r, (p1,p2), (p3,p4)); end
-	  The former (init arguments (m)) evaluates the multiple assignments
-	  before rest argument, that are (m1,m2) and (m3,m4).  The letter
-	  (init arguments (p)) does ones after rest argument, that are
-	  (p1,p2) and (p3, p4).
-
-Thu Jul 21 18:11:07 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* enum.c (enum_inject): remove empty line to notify rdoc
-	  Enumerable#reduce is alias. patched by milki@github.
-	  https://github.com/ruby/ruby/pull/26
-
-Thu Jul 21 17:30:21 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* array.c (rb_ary_delete_at_m): use simple array literal in rdoc.
-	  patched by samuel tonini. [ruby-core:38310] [Bug #5066]
-
-Thu Jul 21 17:14:21 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* lib/webrick/httprequest.rb (WEBrick::HTTPRequest#each):
-	  Allow HTTP/0.9 request which doesn't has any header or body.
-	  patched by Felix Jodoin. [ruby-core:38040] [Bug #5022]
-
-Wed Jul 20 23:02:18 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* io.c (rb_update_max_fd): remove parentheses. they are not in
-	  macro.
-
-Wed Jul 20 22:22:23 2011  Tanaka Akira  <akr@fsij.org>
-
-	* include/ruby/intern.h (rb_update_max_fd): declaration moved from
-	  internal.h.
-
-	* file.c: ditto.
-
-	* io.c: call rb_update_max_fd for each new fds.
-
-	* process.c: ditto.
-
-	* random.c: ditto.
-
-	* ruby.c: ditto.
-
-	* ext/io/console/console.c: ditto.
-
-	* ext/openssl/ossl_bio.c: ditto.
-
-	* ext/pty/pty.c: ditto.
-
-	* ext/socket/init.c: ditto.
-
-	* ext/socket/socket.c: ditto.
-
-	* ext/socket/ancdata.c: ditto.
-
-	* ext/socket/unixsocket.c: ditto.
-
-Wed Jul 20 15:16:22 2011  NARUSE, Yui  <naruse@ruby-lang.org>
-
-	* ext/dl/handle.c (dlhandle_sym): clear previous error with dlerror()
-	  before calling dlsym(). [ruby-dev:44091] [Bug #5021]
-
-Wed Jul 20 07:16:26 2011  Kazuhiro NISHIYAMA  <zn@mbf.nifty.com>
-
-	* NEWS: mention Kernel#warn.  [ruby-core:38119] [Feature #5029]
-
-Tue Jul 19 16:40:45 2011  TAKANO Mitsuhiro (takano32)  <tak@no32.tk>
-
-	* cont.c (cont_save_thread): fix missing semicolon.
-
-Tue Jul 19 16:25:15 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (UPDATE_MAXFD): removed.
-
-Tue Jul 19 16:07:45 2011  Tanaka Akira  <akr@fsij.org>
-
-	* io.c (rb_update_max_fd): new function.
-
-	* internal.h (rb_update_max_fd): declare rb_update_max_fd.
-
-	* thread_pthread.c (rb_thread_create_timer_thread): update max fd when
-	  timer thread pipe is created.
-
-Mon Jul 18 13:36:47 2011  Aaron Patterson <aaron@tenderlovemaking.com>
-
-	* ext/psych/lib/psych.rb: define a new BadAlias error class.
-
-	* ext/psych/lib/psych/visitors/to_ruby.rb: raise an exception when
-	  deserializing an alias that does not exist.
-
-	* test/psych/test_merge_keys.rb: corresponding test.
-
-Mon Jul 18 00:00:46 2011  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* ext/curses/curses.c: added the new class Curses::Pad, which
-	  supports scrolling.  patch by Eric Hodel.  [Feature #4896]
-	  [ruby-core:37206]
-
-Sun Jul 17 16:26:40 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_check_trusted): new function to check an object is
-	  trusted.
-
-	* struct.c (rb_struct_modify), time.c (time_modify): check by the
-	  above function to show proper class names.  [Bug #5036]
-
-Sun Jul 17 15:30:04 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* error.c (rb_warn_m): accept multiple args in like puts.  rdoc
-	  patch by Erik Price at [ruby-core:38119].  [Feature #5029]
-
-Sun Jul 17 07:56:31 2011  Martin Bosslet  <Martin.Bosslet@googlemail.com>
-
-	* test/openssl/test_ssl_session.rb: add PEM SSL session without TLS
-	  extensions. Use this as the default for the tests to ensure
-	  compatibility with OpenSSL 0.9.7.
-	  [ Ruby 1.9 - Bug #4961 ] [ruby-core:37726]
-
-Sat Jul 16 17:29:20 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* configure.in (RUBY_UNIVERSAL_ARCH): restore arch flag.
-	  Bug #4977
-
-Sat Jul 16 06:27:51 2011  Marc-Andre Lafortune  <ruby-core@marc-andre.ca>
-
-	* lib/uri/common.rb (module): Remove optional parser argument to
-	  Kernel#URI
-	  [ruby-core:38061]
-
-	* lib/uri/generic.rb (module): ditto
-
-Sat Jul 16 03:19:45 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c (is_socket, is_console): add prototypes to fix compile
-	  problem with gcc introduced at r32549.
-	  reported by Jon Forums. [Bug #5030] [ruby-core:38079]
-
-Sat Jul 16 00:55:38 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* time.c (time_dup): used rb_obj_class() instead of CLASS_OF().
-	  The patch is made by Kazuki Tsujimoto. [Bug #5012] [ruby-dev:44071]
-
-	* test/ruby/test_time.rb (TestTime#test_getlocal_dont_share_eigenclass):
-	  added a new test for eigenclass of time object.
-
-Fri Jul 15 19:11:00 2011  Kenta Murata  <mrkn@mrkn.jp>
-
-	* bignum.c (bigsub_int): add RB_GC_GUARD.  This patch is made by
-	  Makoto Kishimoto.  fixes #4223 [ruby-dev:42907]
-
-	* bignum.c (bigadd_int): ditto.
-
-Fri Jul 15 14:27:53 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/win32.c, include/ruby/win32.h (rb_w32_io_cancelable_p): renamed
-	  from rb_w32_has_cancel_io().  now it takes a parameter as fd to check
-	  the fd is console or not, because we cannot cancel console input even
-	  if we have cancel_io function.
-
-	* io.c (WAIT_FD_IN_WIN32): call above function instead of the old one,
-	  so now we can kill the thread which calls STDIN.gets.
-	  the problem was reported by ko1 via IRC.
-
-Fri Jul 15 09:10:41 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/digest/sha2/sha2.c (SHA256_Update, SHA512_Update): avoid Bus
-	  Error caused by unalignment access on Sparc-Solaris (and possibly on
-	  other similar environment.) This patch just do memcpy always instead
-	  of checking architecture. I see no perf drop on my 64bit env. For
-	  more details, see #4320.
-
-	* test/digest/test_digest.rb: add test for unalignment access.
-
-Fri Jul 15 01:51:25 2011  Nobuyoshi Nakada  <nobu@ruby-lang.org>
-
-	* regint.h (PLATFORM_UNALIGNED_WORD_ACCESS): Power PC does not
-	  allow unaligned word access.
-
-	* st.c (UNALIGNED_WORD_ACCESS): x86_64 allows unaligned word
-	  access as well as i386.
-
-Thu Jul 14 12:19:34 2011  Hiroshi Nakamura  <nahi@ruby-lang.org>
-
-	* ext/openssl/ossl.c (ossl_verify_cb): trap the exception from
-	  verify callback of SSLContext and X509Store and make the
-	  verification fail normally. Raising exception directly from callback
-	  causes orphan resources in OpenSSL stack. Patched by Ippei Obayashi.
-	  See #4445.
-
-	* test/openssl/test_ssl.rb
-	  (test_exception_in_verify_callback_is_ignored): test it.
-
-Tue Jul 12 23:41:49 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* NEWS: add a description of Signal.trap change.
-
-Tue Jul 12 20:02:35 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* signal.c (reserved_signal_p): reverted a part of r32523.
-	  chikanaga noticed trap(:CHLD) has some realworld usecase.
-	* test/ruby/test_signal.rb (TestSignal#test_reserved_signal):
-	  ditto.
-
-Tue Jul 12 17:12:45 2011  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* vm_method.c (rb_add_method): should not call method_added hook
-	  for undef operation. [Bug #5015]
-
-Tue Jul 12 16:58:44 2011  Shota Fukumori  <sorah@tubusu.net>
-
-	* lib/test/unit.rb(Test::Unit::Options#process_args): Fix bug.
-	  Fix process_args didn't return `@option` after r30939.
-
-Tue Jul 12 14:07:46 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* signal.c (install_sighandler): fixed a race.
-
-Tue Jul 12 13:49:32 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* signal.c (sig_trap): don't permit to change a signal handler which
-	  the interpreter reserved.
-	* signal.c (reserved_signal_p): ditto.
-	  [Bug #2616] [ruby-core:27625]
-
-	* test/ruby/test_signal.rb (TestSignal#test_reserved_signal):
-	  added a test for reserved signal.
-
-Tue Jul 12 11:58:28 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* win32/setup.mak: support x86-amd64 cross compile environment.
-
-Mon Jul 11 23:22:28 2011  Yutaka Kanemoto  <kanemoto@ruby-lang.org>
-
-	* time.c: can't compile time.c on AIX due to missing declaration for
-	  ffs(). It is declared in strings.h on AIX.
-
-Mon Jul 11 15:54:24 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* process.c: removed signal() macro. It's no longer used.
-
-Mon Jul 11 15:02:24 2011  NAKAMURA Usaku  <usa@ruby-lang.org>
-
-	* numeric.c (rb_num2ull): use FIX2LONG instead of FIX2ULONG. see
-	  rb_num2ulong(). fixed the problem of ObjectSpace._id2ref of IL32LLP64
-	  platforms, introduced at r32433.
-
-Mon Jul 11 05:38:05 2011  Yutaka Kanemoto  <kanemoto@ruby-lang.org>
-
-	* thread_pthread.c (get_stack): need to adjust stack addr for
-	  [Bug #1813] on AIX.
-
-Mon Jul 11 01:16:27 2011  KOSAKI Motohiro  <kosaki.motohiro@gmail.com>
-
-	* thread_pthread.c (rb_thread_create_timer_thread): removed
-	  rb_disable_interrupt()/rb_enable_interrupt().
-	* vm_core.h: ditto.
-	* process.c (static void before_exec): ditto.
-	* process.c (static void after_exec): ditto.
-	  [Bug #4765] [ruby-dev:43571]
-
-	* eval_intern.h: removed rb_trap_restore_mask().
-	* vm_eval.c (rb_throw_obj): ditto.
-	* eval.c (setup_exception): ditto.
-
-	* signal.c: removed trap_last_mask.
-	* signal.c (trap_restore_mask): removed.
-	* signal.c (init_sigchld): comment clarification why signal block
-	  is needed. and removed trap_last_mask operation.
-	* signal.c (trap_ensure): removed trap_last_mask operation.
-
-	* signal.c (rb_disable_interrupt, rb_enable_interrupt): made
-	  static and removed sigdelset(SIGVTALRM) and sigdelset(SIGSEGV).
-
-	* process.c (rb_syswait): removed implicit signal handler change.
-
-Sun Jul 10 23:49:12 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* docs/NEWS-1.9.3: moved from NEWS.
-
-	* docs/ChangeLog-1.9.3: merged ChangeLog for 1.9.3.
-
-	* NEWS: NEWS for 1.9.4 that describes changes since 1.9.3
-
-	* ChangeLog: new ChangeLog for 1.9.4.
-
-Sun Jul 10 23:30:52 2011  Yuki Sonoda (Yugui)  <yugui@yugui.jp>
-
-	* version.h (RUBY_VERSION): ruby_1_9_3 branch was forked.
-
-For the changes before 1.9.3, see doc/ChangeLog-1.9.3
-For the changes before 1.8.0, see doc/ChangeLog-1.8.0
-
-Local variables:
-coding: us-ascii
-add-log-time-format: (lambda ()
-  (let* ((time (current-time))
-	 (system-time-locale "C")
-	 (diff (+ (cadr time) 32400))
-	 (lo (% diff 65536))
-	 (hi (+ (car time) (/ diff 65536))))
-  (format-time-string "%a %b %e %H:%M:%S %Y" (list hi lo) t)))
-indent-tabs-mode: t
-tab-width: 8
-change-log-indent-text: 2
-end:
-vim: tabstop=8 shiftwidth=2
diff --git a/GPL b/GPL
index 5b6e7c66c2..d159169d10 100644
--- a/GPL
+++ b/GPL
@@ -1,12 +1,12 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
 
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-                       59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  Everyone is permitted to copy and distribute verbatim copies
  of this license document, but changing it is not allowed.
 
-			    Preamble
+                            Preamble
 
   The licenses for most software are designed to take away your
 freedom to share and change it.  By contrast, the GNU General Public
@@ -15,7 +15,7 @@ software--to make sure the software is free for all its users.  This
 General Public License applies to most of the Free Software
 Foundation's software and to any other program whose authors commit to
 using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
+the GNU Lesser General Public License instead.)  You can apply it to
 your programs, too.
 
   When we speak of free software, we are referring to freedom, not
@@ -55,8 +55,8 @@ patent must be licensed for everyone's free use or not licensed at all.
 
   The precise terms and conditions for copying, distribution and
 modification follow.
-
-		    GNU GENERAL PUBLIC LICENSE
+
+                    GNU GENERAL PUBLIC LICENSE
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
 
   0. This License applies to any program or other work which contains
@@ -110,7 +110,7 @@ above, provided that you also meet all of these conditions:
     License.  (Exception: if the Program itself is interactive but
     does not normally print such an announcement, your work based on
     the Program is not required to print an announcement.)
-
+
 These requirements apply to the modified work as a whole.  If
 identifiable sections of that work are not derived from the Program,
 and can be reasonably considered independent and separate works in
@@ -168,7 +168,7 @@ access to copy from a designated place, then offering equivalent
 access to copy the source code from the same place counts as
 distribution of the source code, even though third parties are not
 compelled to copy the source along with the object code.
-
+
   4. You may not copy, modify, sublicense, or distribute the Program
 except as expressly provided under this License.  Any attempt
 otherwise to copy, modify, sublicense or distribute the Program is
@@ -225,7 +225,7 @@ impose that choice.
 
 This section is intended to make thoroughly clear what is believed to
 be a consequence of the rest of this License.
-
+
   8. If the distribution and/or use of the Program is restricted in
 certain countries either by patents or by copyrighted interfaces, the
 original copyright holder who places the Program under this License
@@ -255,7 +255,7 @@ make exceptions for this.  Our decision will be guided by the two goals
 of preserving the free status of all derivatives of our free software and
 of promoting the sharing and reuse of software generally.
 
-			    NO WARRANTY
+                            NO WARRANTY
 
   11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
 FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
@@ -277,9 +277,9 @@ YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
 PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGES.
 
-		     END OF TERMS AND CONDITIONS
-
-	    How to Apply These Terms to Your New Programs
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
 
   If you develop a new program, and you want it to be of the greatest
 possible use to the public, the best way to achieve this is to make it
@@ -303,10 +303,9 @@ the "copyright" line and a pointer to where the full notice is found.
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     GNU General Public License for more details.
 
-    You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 Also add information on how to contact you by electronic and paper mail.
 
@@ -336,5 +335,5 @@ necessary.  Here is a sample; alter the names:
 This General Public License does not permit incorporating your program into
 proprietary programs.  If your program is a subroutine library, you may
 consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
+library.  If this is what you want to do, use the GNU Lesser General
 Public License instead of this License.
diff --git a/KNOWNBUGS.rb b/KNOWNBUGS.rb
index 5c0e4d5156..35a8e75876 100644
--- a/KNOWNBUGS.rb
+++ b/KNOWNBUGS.rb
@@ -1,16 +1,7 @@
 #
-# This test file concludes tests which point out known bugs.
+# IMPORTANT: Always keep the first 7 lines (comments),
+# even if this file is otherwise empty.
+#
+# This test file includes tests which point out known bugs.
 # So all tests will cause failure.
 #
-
-assert_normal_exit %q{
-  open("tst-remove-load.rb", "w") {|f|
-    f << <<-'End'
-      module Kernel
-        remove_method :load
-      end
-      raise
-    End
-  }
-  load "tst-remove-load.rb"
-}, '[ruby-dev:40234] [ruby-core:27959]', :timeout => 1
diff --git a/LEGAL b/LEGAL
index 65706459cd..0423d57ac9 100644
--- a/LEGAL
+++ b/LEGAL
@@ -1,85 +1,331 @@
-LEGAL NOTICE INFORMATION
-------------------------
+# -*- rdoc -*-
+
+= LEGAL NOTICE INFORMATION
+--------------------------
 
 All the files in this distribution are covered under either the Ruby's
 license (see the file COPYING) or public-domain except some files
 mentioned below.
 
-include/ruby/oniguruma.h:
-regcomp.c:
-regenc.[ch]:
-regerror.c:
-regexec.c:
-regint.h:
-regparse.[ch]:
-enc/ascii.c
-enc/big5.c
-enc/cp949.c
-enc/emacs_mule.c
-enc/encdb.c
-enc/euc_jp.c
-enc/euc_kr.c
-enc/euc_tw.c
-enc/gb18030.c
-enc/gb2312.c
-enc/gbk.c
-enc/iso_8859_1.c
-enc/iso_8859_10.c
-enc/iso_8859_11.c
-enc/iso_8859_13.c
-enc/iso_8859_14.c
-enc/iso_8859_15.c
-enc/iso_8859_16.c
-enc/iso_8859_2.c
-enc/iso_8859_3.c
-enc/iso_8859_4.c
-enc/iso_8859_5.c
-enc/iso_8859_6.c
-enc/iso_8859_7.c
-enc/iso_8859_8.c
-enc/iso_8859_9.c
-enc/koi8_r.c
-enc/koi8_u.c
-enc/shift_jis.c
-enc/unicode.c
-enc/us_ascii.c
-enc/utf_16be.c
-enc/utf_16le.c
-enc/utf_32be.c
-enc/utf_32le.c
-enc/utf_8.c
-enc/windows_1251.c
-
-Oniguruma  ----   (C) K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
-
-http://www.geocities.jp/kosako3/oniguruma/
-http://www.ruby-lang.org/cgi-bin/cvsweb.cgi/oniguruma/
-http://www.freebsd.org/cgi/cvsweb.cgi/ports/devel/oniguruma/
-
-   When this software is partly used or it is distributed with Ruby, 
-   this of Ruby follows the license of Ruby.
-
-configure:
+[addr2line.c]
+
+  A part of this file is from FreeBSD.
+
+  >>>
+    Copyright (c) 1986, 1988, 1991, 1993::
+    The Regents of the University of California.  All rights reserved.
+
+    (c) UNIX System Laboratories, Inc.
+
+    All or some portions of this file are derived from material licensed
+    to the University of California by American Telephone and Telegraph
+    Co. or Unix System Laboratories, Inc. and are reproduced herein with
+    the permission of UNIX System Laboratories, Inc.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+    4. Neither the name of the University nor the names of its contributors
+       may be used to endorse or promote products derived from this software
+       without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+	@(#)subr_prf.c	8.3 (Berkeley) 1/21/94
+
+
+[ccan/build_assert/build_assert.h]
+[ccan/check_type/check_type.h]
+[ccan/container_of/container_of.h]
+[ccan/str/str.h]
+
+  These files are licensed under the {CC0}[https://creativecommons.org/choose/zero/].
+
+[ccan/list/list.h]
+
+  This file is licensed under the {MIT License}[rdoc-label:label-MIT+License].
+
+[coroutine]
+
+  Unless otherwise specified, these files are licensed under the
+  {MIT License}[rdoc-label:label-MIT+License].
+
+[include/ruby/onigmo.h]
+[include/ruby/oniguruma.h]
+[regcomp.c]
+[regenc.c]
+[regenc.h]
+[regerror.c]
+[regexec.c]
+[regint.h]
+[regparse.c]
+[regparse.h]
+[enc/ascii.c]
+[enc/big5.c]
+[enc/cp949.c]
+[enc/emacs_mule.c]
+[enc/encdb.c]
+[enc/euc_jp.c]
+[enc/euc_kr.c]
+[enc/euc_tw.c]
+[enc/gb18030.c]
+[enc/gb2312.c]
+[enc/gbk.c]
+[enc/iso_8859_1.c]
+[enc/iso_8859_10.c]
+[enc/iso_8859_11.c]
+[enc/iso_8859_13.c]
+[enc/iso_8859_14.c]
+[enc/iso_8859_15.c]
+[enc/iso_8859_16.c]
+[enc/iso_8859_2.c]
+[enc/iso_8859_3.c]
+[enc/iso_8859_4.c]
+[enc/iso_8859_5.c]
+[enc/iso_8859_6.c]
+[enc/iso_8859_7.c]
+[enc/iso_8859_8.c]
+[enc/iso_8859_9.c]
+[enc/koi8_r.c]
+[enc/koi8_u.c]
+[enc/shift_jis.c]
+[enc/unicode.c]
+[enc/us_ascii.c]
+[enc/utf_16be.c]
+[enc/utf_16le.c]
+[enc/utf_32be.c]
+[enc/utf_32le.c]
+[enc/utf_8.c]
+[enc/windows_1251.c]
+[enc/windows_31j.c]
+
+  Onigmo (Oniguruma-mod) LICENSE
+
+  >>>
+    Copyright (c) 2002-2009::  K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
+    Copyright (c) 2011-2014::  K.Takata  <kentkt AT csc DOT jp>
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+  Oniguruma LICENSE
+
+  >>>
+    Copyright (c) 2002-2009::  K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+  * https://github.com/k-takata/Onigmo/
+  * https://github.com/kkos/oniguruma
+  * https://svnweb.freebsd.org/ports/head/devel/oniguruma/
+
+    When this software is partly used or it is distributed with Ruby,
+    this of Ruby follows the license of Ruby.
+
+[enc/windows_1250.c]
+[enc/windows_1252.c]
+
+  >>>
+    Copyright (c) 2006-2007::  Byte      <byte AT mail DOT kna DOT ru>
+                               K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+[enc/cesu_8.c]
+[enc/windows_1253.c]
+[enc/windows_1254.c]
+[enc/windows_1257.c]
+
+  >>>
+    Copyright (c) 2002-2007::  K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+[enc/trans/GB/GB12345%UCS.src]
+[enc/trans/GB/UCS%GB12345.src]
+[enc/trans/GB/GB2312%UCS.src]
+[enc/trans/GB/UCS%GB2312.src]
+
+  These files have this explanatory texts.
+
+  >>>
+    This mapping data was created from files provided by Unicode, Inc.
+    (The Unicode Consortium). The files were used to create a product supporting
+    Unicode, as explicitly permitted in the files' copyright notices.
+    Please note that Unicode, Inc. never made any claims as to fitness of these
+    files for any particular purpose, and has ceased to publish the files many
+    years ago.
+
+[enc/trans/JIS/JISX0201-KANA%UCS.src]
+[enc/trans/JIS/JISX0208\@1990%UCS.src]
+[enc/trans/JIS/JISX0212%UCS.src]
+[enc/trans/JIS/UCS%JISX0201-KANA.src]
+[enc/trans/JIS/UCS%JISX0208@1990.src]
+[enc/trans/JIS/UCS%JISX0212.src]
+
+  These files are copyrighted as the following.
+
+  >>>
+    © 2015 Unicode®, Inc.
+
+    For terms of use, see http://www.unicode.org/terms_of_use.html
+
+[enc/trans/JIS/JISX0213-1%UCS@BMP.src]
+[enc/trans/JIS/JISX0213-1%UCS@SIP.src]
+[enc/trans/JIS/JISX0213-2%UCS@BMP.src]
+[enc/trans/JIS/JISX0213-2%UCS@SIP.src]
+
+  These files are copyrighted as the following.
+
+  >>>
+    Copyright (C) 2001:: earthian@tama.or.jp, All Rights Reserved.
+    Copyright (C) 2001:: I'O, All Rights Reserved.
+    Copyright (C) 2006:: Project X0213, All Rights Reserved.
+    You can use, modify, distribute this table freely.
+
+[enc/trans/JIS/UCS@BMP%JISX0213-1.src]
+[enc/trans/JIS/UCS@BMP%JISX0213-2.src]
+[enc/trans/JIS/UCS@SIP%JISX0213-1.src]
+[enc/trans/JIS/UCS@SIP%JISX0213-2.src]
+
+  These files are copyrighted as the following.
+
+  >>>
+    Copyright (C) 2001:: earthian@tama.or.jp, All Rights Reserved.
+    Copyright (C) 2001:: I'O, All Rights Reserved.
+    You can use, modify, distribute this table freely.
+
+[enc/trans/ucm/glibc-BIG5-2.3.3.ucm]
+[enc/trans/ucm/glibc-BIG5HKSCS-2.3.3.ucm]
+
+  >>>
+    Copyright (C) 2001-2005:: International Business Machines
+                              Corporation and others.  All Rights Reserved.
+
+[enc/trans/ucm/windows-950-2000.ucm]
+[enc/trans/ucm/windows-950_hkscs-2001.ucm]
+
+  >>>
+    Copyright (C) 2001-2002:: International Business Machines
+                              Corporation and others.  All Rights Reserved.
+
+
+[configure]
 
   This file is free software.
 
-    Copyright (C) 1992, 93, 94, 95, 96 Free Software Foundation, Inc.
+  >>>
+    Copyright (C) 1992-1996, 1998-2012:: Free Software Foundation, Inc.
 
     This configure script is free software; the Free Software Foundation
     gives unlimited permission to copy, distribute and modify it.
 
-tool/config.guess:
-tool/config.sub:
+[tool/config.guess]
+[tool/config.sub]
 
   As long as you distribute these files with the file configure, they
   are covered under the Ruby's license.
 
-      Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999
-      Free Software Foundation, Inc.
+  >>>
+    Copyright 1992-2018:: Free Software Foundation, Inc.
 
     This file is free software; you can redistribute it and/or modify it
     under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
+    the Free Software Foundation; either version 3 of the License, or
     (at your option) any later version.
 
     This program is distributed in the hope that it will be useful, but
@@ -88,54 +334,85 @@ tool/config.sub:
     General Public License for more details.
 
     You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+    along with this program; if not, see <https://www.gnu.org/licenses/>.
 
     As a special exception to the GNU General Public License, if you
     distribute this file as part of a program that contains a
     configuration script generated by Autoconf, you may include it under
-    the same distribution terms that you use for the rest of that program.
-
-parse.c:
-
-  This file is licensed under the GPL, but is incorporated into Ruby and 
+    the same distribution terms that you use for the rest of that
+    program.  This Exception is an additional permission under section 7
+    of the GNU General Public License, version 3 ("GPLv3").
+
+[tool/lib/test/*]
+[tool/lib/core_assertions.rb]
+
+  Some of methods on these files are based on MiniTest 4. MiniTest 4 is
+  distributed under the MIT License.
+
+  >>>
+    Copyright (c) Ryan Davis, seattle.rb
+
+    Permission is hereby granted, free of charge, to any person obtaining
+    a copy of this software and associated documentation files (the
+    'Software'), to deal in the Software without restriction, including
+    without limitation the rights to use, copy, modify, merge, publish,
+    distribute, sublicense, and/or sell copies of the Software, and to
+    permit persons to whom the Software is furnished to do so, subject to
+    the following conditions:
+
+    The above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+    EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+    IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+    CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+    TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+[parse.c]
+[parse.h]
+
+  These files are licensed under the GPL, but are incorporated into Ruby and
   redistributed under the terms of the Ruby license, as permitted by the
   exception to the GPL below.
 
-     Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
-     Free Software Foundation, Inc.
+  >>>
+    Copyright (C) 1984, 1989-1990, 2000-2015, 2018:: Free Software Foundation, Inc.
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
 
-     This program is free software; you can redistribute it and/or modify
-     it under the terms of the GNU General Public License as published by
-     the Free Software Foundation; either version 2, or (at your option)
-     any later version.
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
 
-     This program is distributed in the hope that it will be useful,
-     but WITHOUT ANY WARRANTY; without even the implied warranty of
-     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-     GNU General Public License for more details.
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
 
-     You should have received a copy of the GNU General Public License
-     along with this program; if not, write to the Free Software
-     Foundation, Inc., 51 Franklin Street, Fifth Floor,
-     Boston, MA 02110-1301, USA.  */
+    As a special exception, you may create a larger work that contains
+    part or all of the Bison parser skeleton and distribute that work
+    under terms of your choice, so long as that work isn't itself a
+    parser generator using the skeleton or a modified version thereof
+    as a parser skeleton.  Alternatively, if you modify or redistribute
+    the parser skeleton itself, you may (at your option) remove this
+    special exception, which will cause the skeleton and the resulting
+    Bison output files to be licensed under the GNU General Public
+    License without this special exception.
 
-  /* As a special exception, you may create a larger work that contains
-     part or all of the Bison parser skeleton and distribute that work
-     under terms of your choice, so long as that work isn't itself a
-     parser generator using the skeleton or a modified version thereof
-     as a parser skeleton.  Alternatively, if you modify or redistribute
-     the parser skeleton itself, you may (at your option) remove this
-     special exception, which will cause the skeleton and the resulting
-     Bison output files to be licensed under the GNU General Public
-     License without this special exception.
+    This special exception was added by the Free Software Foundation in
+    version 2.2 of Bison.
 
-     This special exception was added by the Free Software Foundation in
-     version 2.2 of Bison.  */
+[missing/dtoa.c]
 
-util.c (partly):
+  This file is under these licenses.
 
-    Copyright (c) 1991, 2000, 2001 by Lucent Technologies.
+  >>>
+    Copyright (c) 1991, 2000, 2001:: by Lucent Technologies.
 
     Permission to use, copy, modify, and distribute this software for any
     purpose without fee is hereby granted, provided that this entire notice
@@ -148,71 +425,74 @@ util.c (partly):
     REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
     OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
 
-win32/win32.[ch]:
+  >>>
+    Copyright (c) 2004-2008:: David Schultz <das@FreeBSD.ORG>
+                              All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+[win32/win32.c]
+[include/ruby/win32.h]
 
   You can apply the Artistic License to these files. (or GPL,
   alternatively)
 
-    Copyright (c) 1993, Intergraph Corporation
+  >>>
+    Copyright (c) 1993:: Intergraph Corporation
 
     You may distribute under the terms of either the GNU General Public
     License or the Artistic License, as specified in the perl README file.
 
-util.c (partly):
-
-   Copyright (c) 2004-2008 David Schultz <das@FreeBSD.ORG>
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-   1. Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-   2. Redistributions in binary form must reproduce the above copyright
-      notice, this list of conditions and the following disclaimer in the
-      documentation and/or other materials provided with the distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
-   ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-   ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
-   FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-   OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-   HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-   LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-   OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-   SUCH DAMAGE.
-
-random.c
+[missing/mt19937.c]
 
   This file is under the new-style BSD license.
 
-    A C-program for MT19937, with initialization improved 2002/2/10.
+  >>>
+    A C-program for MT19937, with initialization improved 2002/2/10.::
     Coded by Takuji Nishimura and Makoto Matsumoto.
+
     This is a faster version by taking Shawn Cokus's optimization,
     Matthe Bellew's simplification, Isaku Wada's real version.
 
-    Before using, initialize the state by using init_genrand(seed) 
+    Before using, initialize the state by using init_genrand(seed)
     or init_by_array(init_key, key_length).
 
-    Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-    All rights reserved.                          
+    Copyright (C) 1997 - 2002:: Makoto Matsumoto and Takuji Nishimura,
+                                All rights reserved.
 
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions
     are met:
 
-      1. Redistributions of source code must retain the above copyright
-	 notice, this list of conditions and the following disclaimer.
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
 
-      2. Redistributions in binary form must reproduce the above copyright
-	 notice, this list of conditions and the following disclaimer in the
-	 documentation and/or other materials provided with the distribution.
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
 
-      3. The names of its contributors may not be used to endorse or promote 
-	 products derived from this software without specific prior written 
-	 permission.
+    3. The names of its contributors may not be used to endorse or promote
+       products derived from this software without specific prior written
+       permission.
 
     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
     "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
@@ -231,16 +511,15 @@ random.c
     http://www.math.keio.ac.jp/matumoto/emt.html
     email: matumoto@math.keio.ac.jp
 
-vsnprintf.c:
+  The Wayback Machine url: http://web.archive.org/web/19990429082237/http://www.math.keio.ac.jp/matumoto/emt.html
 
-  This file is under the old-style BSD license.  Note that the
-  paragraph 3 below is now null and void.
+[missing/procstat_vm.c]
 
-    Copyright (c) 1990, 1993
-         The Regents of the University of California.  All rights reserved.
+  This file is under the new-style BSD license.
 
-    This code is derived from software contributed to Berkeley by
-    Chris Torek.
+  >>>
+    Copyright (c) 2007:: Robert N. M. Watson
+                         All rights reserved.
 
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions
@@ -250,14 +529,11 @@ vsnprintf.c:
     2. Redistributions in binary form must reproduce the above copyright
        notice, this list of conditions and the following disclaimer in the
        documentation and/or other materials provided with the distribution.
-    3. Neither the name of the University nor the names of its contributors
-       may be used to endorse or promote products derived from this software
-       without specific prior written permission.
 
-    THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
     ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-    ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
     FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
@@ -266,146 +542,100 @@ vsnprintf.c:
     OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     SUCH DAMAGE.
 
-    IMPORTANT NOTE:
-    --------------
-    From ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
-    paragraph 3 above is now null and void.
-
-st.[ch]:
-missing/alloca.c:
-missing/dup2.c:
-missing/erf.c:
-missing/finite.c:
-missing/hypot.c:
-missing/isinf.c:
-missing/isnan.c:
-missing/lgamma_r.c:
-missing/memcmp.c:
-missing/memmove.c:
-missing/strchr.c:
-missing/strstr.c:
-missing/strtol.c:
-missing/tgamma.c:
-ext/digest/sha1/sha1.[ch]:
+    $FreeBSD: head/usr.bin/procstat/procstat_vm.c 261780 2014-02-11 21:57:37Z jhb $
+
+[vsnprintf.c]
+
+  This file is under the {old-style BSD license}[rdoc-label:label-Old-style+BSD+license].
+
+  >>>
+    Copyright (c) 1990, 1993::
+    The Regents of the University of California.  All rights reserved.
+
+    This code is derived from software contributed to Berkeley by
+    Chris Torek.
+
+[st.c]
+[strftime.c]
+[include/ruby/st.h]
+[missing/acosh.c]
+[missing/alloca.c]
+[missing/erf.c]
+[missing/hypot.c]
+[missing/lgamma_r.c]
+[missing/memcmp.c]
+[missing/memmove.c]
+[missing/strchr.c]
+[missing/strerror.c]
+[missing/strstr.c]
+[missing/tgamma.c]
+[ext/date/date_strftime.c]
+[ext/digest/sha1/sha1.c]
+[ext/digest/sha1/sha1.h]
 
   These files are all under public domain.
 
-missing/crypt.c:
+[missing/crypt.c]
 
-  This file is under the old-style BSD license.  Note that the
-  paragraph 3 below is now null and void.
+  This file is under the {old-style BSD license}[rdoc-label:label-Old-style+BSD+license].
 
-    Copyright (c) 1989, 1993
-    	The Regents of the University of California.  All rights reserved.
+  >>>
+    Copyright (c) 1989, 1993::
+    The Regents of the University of California.  All rights reserved.
 
     This code is derived from software contributed to Berkeley by
     Tom Truscott.
 
-    Redistribution and use in source and binary forms, with or without
-    modification, are permitted provided that the following conditions
-    are met:
-    1. Redistributions of source code must retain the above copyright
-       notice, this list of conditions and the following disclaimer.
-    2. Redistributions in binary form must reproduce the above copyright
-       notice, this list of conditions and the following disclaimer in the
-       documentation and/or other materials provided with the distribution.
-    3. Neither the name of the University nor the names of its contributors
-       may be used to endorse or promote products derived from this software
-       without specific prior written permission.
-
-    THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
-    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-    ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
-    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-    SUCH DAMAGE.
+[missing/setproctitle.c]
 
-missing/setproctitle.c
+  This file is under the {old-style BSD license}[rdoc-label:label-Old-style+BSD+license].
 
-  This file is under the old-style BSD license.  Note that the
-  paragraph 3 below is now null and void.
+  >>>
+    Copyright 2003:: Damien Miller
+    Copyright (c) 1983, 1995-1997:: Eric P. Allman
+    Copyright (c) 1988, 1993::
+    The Regents of the University of California.  All rights reserved.
 
-    Copyright 2003 Damien Miller
-    Copyright (c) 1983, 1995-1997 Eric P. Allman
-    Copyright (c) 1988, 1993
-    	The Regents of the University of California.  All rights reserved.
+[missing/strlcat.c]
+[missing/strlcpy.c]
 
-    Redistribution and use in source and binary forms, with or without
-    modification, are permitted provided that the following conditions
-    are met:
-    1. Redistributions of source code must retain the above copyright
-       notice, this list of conditions and the following disclaimer.
-    2. Redistributions in binary form must reproduce the above copyright
-       notice, this list of conditions and the following disclaimer in the
-       documentation and/or other materials provided with the distribution.
-    3. Neither the name of the University nor the names of its contributors
-       may be used to endorse or promote products derived from this software
-       without specific prior written permission.
+  These files are under an ISC-style license.
 
-    THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
-    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-    ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
-    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-    SUCH DAMAGE.
+  >>>
+    Copyright (c) 1998, 2015:: Todd C. Miller <Todd.Miller@courtesan.com>
 
-missing/strlcat.c
-missing/strlcpy.c
+    Permission to use, copy, modify, and distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
 
-  These files are under the new-style BSD license.
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 
-   Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-   1. Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-   2. Redistributions in binary form must reproduce the above copyright
-      notice, this list of conditions and the following disclaimer in the
-      documentation and/or other materials provided with the distribution.
-   3. The name of the author may not be used to endorse or promote products
-      derived from this software without specific prior written permission.
-
-   THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
-   INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
-   AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
-   THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
-   OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
-   WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
-   OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
-   ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-missing/langinfo.c
+[missing/langinfo.c]
 
   This file is from http://www.cl.cam.ac.uk/~mgk25/ucs/langinfo.c.
   Ruby uses a modified version. The file contains the following
   author/copyright notice:
 
-  Markus.Kuhn@cl.cam.ac.uk -- 2002-03-11
-  Permission to use, copy, modify, and distribute this software
-  for any purpose and without fee is hereby granted. The author
-  disclaims all warranties with regard to this software.
+  >>>
+    Markus.Kuhn@cl.cam.ac.uk -- 2002-03-11::
+    Permission to use, copy, modify, and distribute this software
+    for any purpose and without fee is hereby granted. The author
+    disclaims all warranties with regard to this software.
 
-ext/digest/md5/md5.[ch]:
+[ext/digest/md5/md5.c]
+[ext/digest/md5/md5.h]
 
   These files are under the following license.  Ruby uses modified
   versions of them.
 
-    Copyright (C) 1999, 2000 Aladdin Enterprises.  All rights reserved.
+  >>>
+    Copyright (C) 1999, 2000:: Aladdin Enterprises.  All rights reserved.
 
     This software is provided 'as-is', without any express or implied
     warranty.  In no event will the authors be held liable for any damages
@@ -426,23 +656,27 @@ ext/digest/md5/md5.[ch]:
     L. Peter Deutsch
     ghost@aladdin.com
 
-ext/digest/rmd160/rmd160.[ch]:
+[ext/digest/rmd160/rmd160.c]
+[ext/digest/rmd160/rmd160.h]
 
   These files have the following copyright information, and by the
   author we are allowed to use it under the new-style BSD license.
 
-    AUTHOR:   Antoon Bosselaers, ESAT-COSIC
+  >>>
+    AUTHOR::  Antoon Bosselaers, ESAT-COSIC
               (Arranged for libc by Todd C. Miller)
-    DATE:     1 March 1996
+    DATE::    1 March 1996
 
-    Copyright (c) Katholieke Universiteit Leuven
+    Copyright (c):: Katholieke Universiteit Leuven
     1996, All Rights Reserved
 
-ext/digest/sha2/sha2.[ch]:
+[ext/digest/sha2/sha2.c]
+[ext/digest/sha2/sha2.h]
 
   These files are under the new-style BSD license.
 
-    Copyright 2000 Aaron D. Gifford.  All rights reserved.
+  >>>
+    Copyright 2000:: Aaron D. Gifford.  All rights reserved.
 
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions
@@ -468,29 +702,123 @@ ext/digest/sha2/sha2.[ch]:
     OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     SUCH DAMAGE.
 
-ext/nkf/nkf-utf8/config.h:
-ext/nkf/nkf-utf8/nkf.c:
-ext/nkf/nkf-utf8/utf8tbl.c:
+[ext/json/generator/generator.c]
+
+  The file contains the following copyright notice.
+
+  >>>
+    Copyright 2001-2004:: Unicode, Inc.
+
+    Disclaimer::
+
+      This source code is provided as is by Unicode, Inc. No claims are
+      made as to fitness for any particular purpose. No warranties of any
+      kind are expressed or implied. The recipient agrees to determine
+      applicability of information provided. If this file has been
+      purchased on magnetic or optical media from Unicode, Inc., the
+      sole remedy for any claim will be exchange of defective media
+      within 90 days of receipt.
+
+    Limitations on Rights to Redistribute This Code::
+
+      Unicode, Inc. hereby grants the right to freely use the information
+      supplied in this file in the creation of products supporting the
+      Unicode Standard, and to make copies of this file in any form
+      for internal or external distribution as long as this notice
+      remains attached.
+
+[ext/nkf/nkf-utf8/config.h]
+[ext/nkf/nkf-utf8/nkf.c]
+[ext/nkf/nkf-utf8/utf8tbl.c]
 
   These files are under the following license.  So to speak, it is
   copyrighted semi-public-domain software.
 
-    Copyright (C) 1987, Fujitsu LTD. (Itaru ICHIKAWA)
-       Everyone is permitted to do anything on this program 
-       including copying, modifying, improving,
-       as long as you don't try to pretend that you wrote it.
-       i.e., the above copyright notice has to appear in all copies.
-       Binary distribution requires original version messages.
-       You don't have to ask before copying, redistribution or publishing.
-       THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE.
+  >>>
+    Copyright (C) 1987:: Fujitsu LTD. (Itaru ICHIKAWA)
+
+    Everyone is permitted to do anything on this program
+    including copying, modifying, improving,
+    as long as you don't try to pretend that you wrote it.
+    i.e., the above copyright notice has to appear in all copies.
+    Binary distribution requires original version messages.
+    You don't have to ask before copying, redistribution or publishing.
+    THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE.
+
+[ext/psych]
+[test/psych]
+
+  The files under these directories are under the following license, except for
+  ext/psych/yaml.
+
+  >>>
+    Copyright 2009:: Aaron Patterson, et al.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy of
+    this software and associated documentation files (the 'Software'), to deal in
+    the Software without restriction, including without limitation the rights to
+    use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+    of the Software, and to permit persons to whom the Software is furnished to do
+    so, subject to the following conditions:
 
-ext/socket/addrinfo.h:
-ext/socket/getaddrinfo.c:
-ext/socket/getnameinfo.c:
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+
+[ext/psych/yaml]
+
+  The files under this directory are under the following license.
+
+  >>>
+    Copyright (c) 2006:: Kirill Simonov
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy of
+    this software and associated documentation files (the "Software"), to deal in
+    the Software without restriction, including without limitation the rights to
+    use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+    of the Software, and to permit persons to whom the Software is furnished to do
+    so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+
+[ext/pty/pty.c]
+
+  >>>
+    C) Copyright 1998:: by Akinori Ito.
+
+    This software may be redistributed freely for this purpose, in full
+    or in part, provided that this entire copyright notice is included
+    on any copies of this software and applications and derivations thereof.
+
+    This software is provided on an "as is" basis, without warranty of any
+    kind, either expressed or implied, as to any matter including, but not
+    limited to warranty of fitness of purpose, or merchantability, or
+    results obtained from use of this software.
+
+[ext/socket/addrinfo.h]
+[ext/socket/getaddrinfo.c]
+[ext/socket/getnameinfo.c]
 
   These files are under the new-style BSD license.
 
-    Copyright (C) 1995, 1996, 1997, 1998, and 1999 WIDE Project.
+  >>>
+    Copyright (C) 1995, 1996, 1997, 1998, and 1999:: WIDE Project.
     All rights reserved.
 
     Redistribution and use in source and binary forms, with or without
@@ -517,17 +845,275 @@ ext/socket/getnameinfo.c:
     OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     SUCH DAMAGE.
 
-ext/win32ole/win32ole.c:
+[ext/win32ole/win32ole.c]
 
   You can apply the Artistic License to this file. (or GPL,
   alternatively)
 
-    (c) 1995 Microsoft Corporation. All rights reserved.
+  >>>
+    (c) 1995:: Microsoft Corporation. All rights reserved.
     Developed by ActiveWare Internet Corp., http://www.ActiveWare.com
 
-    Other modifications Copyright (c) 1997, 1998 by Gurusamy Sarathy
+    Other modifications Copyright (c) 1997, 1998:: by Gurusamy Sarathy
     <gsar@umich.edu> and Jan Dubois <jan.dubois@ibm.net>
- 
+
     You may distribute under the terms of either the GNU General Public
     License or the Artistic License, as specified in the README file
     of the Perl distribution.
+
+  The Wayback Machine url: http://web.archive.org/web/19970607104352/http://www.activeware.com:80/
+
+[lib/rdoc/generator/template/darkfish/css/fonts.css]
+
+  This file is licensed under the {SIL Open Font License}[http://scripts.sil.org/OFL].
+
+[spec/mspec]
+[spec/ruby]
+
+  The files under these directories are under the following license.
+
+  >>>
+    Copyright (c) 2008:: Engine Yard, Inc. All rights reserved.
+
+    Permission is hereby granted, free of charge, to any person
+    obtaining a copy of this software and associated documentation
+    files (the "Software"), to deal in the Software without
+    restriction, including without limitation the rights to use,
+    copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the
+    Software is furnished to do so, subject to the following
+    conditions:
+
+    The above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+    EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+    OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+    NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+    WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+    FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+    OTHER DEALINGS IN THE SOFTWARE.
+
+[lib/rubygems.rb]
+[lib/rubygems]
+[test/rubygems]
+
+  RubyGems is under the following license.
+
+  >>>
+    RubyGems is copyrighted free software by Chad Fowler, Rich Kilmer, Jim
+    Weirich and others.  You can redistribute it and/or modify it under
+    either the terms of the {MIT license}[rdoc-label:label-MIT+License], or the conditions
+    below:
+
+    1. You may make and give away verbatim copies of the source form of the
+       software without restriction, provided that you duplicate all of the
+       original copyright notices and associated disclaimers.
+
+    2. You may modify your copy of the software in any way, provided that
+       you do at least ONE of the following:
+
+       a. place your modifications in the Public Domain or otherwise
+          make them Freely Available, such as by posting said
+          modifications to Usenet or an equivalent medium, or by allowing
+          the author to include your modifications in the software.
+
+       b. use the modified software only within your corporation or
+          organization.
+
+       c. give non-standard executables non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d. make other distribution arrangements with the author.
+
+    3. You may distribute the software in object code or executable
+       form, provided that you do at least ONE of the following:
+
+       a. distribute the executables and library files of the software,
+          together with instructions (in the manual page or equivalent)
+          on where to get the original distribution.
+
+       b. accompany the distribution with the machine-readable source of
+          the software.
+
+       c. give non-standard executables non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d. make other distribution arrangements with the author.
+
+    4. You may modify and include the part of the software into any other
+       software (possibly commercial).
+
+    5. The scripts and library files supplied as input to or produced as
+       output from the software do not automatically fall under the
+       copyright of the software, but belong to whomever generated them,
+       and may be sold commercially, and may be aggregated with this
+       software.
+
+    6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
+       IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+       WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+       PURPOSE.
+
+[lib/bundler]
+[lib/bundler.rb]
+[spec/bundler]
+
+  Bundler is under the following license.
+
+  >>>
+    Portions copyright (c) 2010:: Andre Arko
+    Portions copyright (c) 2009:: Engine Yard
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/thor]
+
+  Thor is under the following license.
+
+  >>>
+    Copyright (c) 2008 Yehuda Katz, Eric Hodel, et al.
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/rubygems/resolver/molinillo]
+
+  molinillo is under the following license.
+
+  >>>
+    Copyright (c) 2014 Samuel E. Giddins segiddins@segiddins.me
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/pub_grub]
+
+  pub_grub is under the following license.
+
+  >>>
+    Copyright (c) 2018 John Hawthorn
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/connection_pool]
+
+  connection_pool is under the following license.
+
+  >>>
+    Copyright (c) 2011 Mike Perham
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/bundler/vendor/net-http-persistent]
+
+  net-http-persistent is under the following license.
+
+  >>>
+    Copyright (c) Eric Hodel, Aaron Patterson
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/did_you_mean]
+[lib/did_you_mean.rb]
+[test/did_you_mean]
+
+  did_you_mean is under the following license.
+
+  >>>
+    Copyright (c) 2014-2016 Yuki Nishijima
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[lib/error_highlight]
+[lib/error_highlight.rb]
+[test/error_highlight]
+
+  error_highlight is under the following license.
+
+  >>>
+    Copyright (c) 2021 Yusuke Endoh
+
+    {MIT License}[rdoc-label:label-MIT+License]
+
+[benchmark/so_ackermann.rb]
+[benchmark/so_array.rb]
+[benchmark/so_binary_trees.rb]
+[benchmark/so_concatenate.rb]
+[benchmark/so_count_words.yml]
+[benchmark/so_exception.rb]
+[benchmark/so_fannkuch.rb]
+[benchmark/so_fasta.rb]
+[benchmark/so_k_nucleotide.yml]
+[benchmark/so_lists.rb]
+[benchmark/so_mandelbrot.rb]
+[benchmark/so_matrix.rb]
+[benchmark/so_meteor_contest.rb]
+[benchmark/so_nbody.rb]
+[benchmark/so_nested_loop.rb]
+[benchmark/so_nsieve.rb]
+[benchmark/so_nsieve_bits.rb]
+[benchmark/so_object.rb]
+[benchmark/so_partial_sums.rb]
+[benchmark/so_pidigits.rb]
+[benchmark/so_random.rb]
+[benchmark/so_reverse_complement.yml]
+[benchmark/so_sieve.rb]
+[benchmark/so_spectralnorm.rb]
+
+  These files are very old copy of then-called "The Great Computer Language
+  Shootout".  LEGAL SITUATION OF THESE FILES ARE UNCLEAR because the original
+  site has been lost.  Upstream diverged to delete several benchmarks listed
+  above.
+
+== MIT License
+>>>
+      Permission is hereby granted, free of charge, to any person obtaining
+      a copy of this software and associated documentation files (the
+      "Software"), to deal in the Software without restriction, including
+      without limitation the rights to use, copy, modify, merge, publish,
+      distribute, sublicense, and/or sell copies of the Software, and to
+      permit persons to whom the Software is furnished to do so, subject to
+      the following conditions:
+
+      The above copyright notice and this permission notice shall be
+      included in all copies or substantial portions of the Software.
+
+      THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+      EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+      MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+      NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+      LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+      OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+      WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+== Old-style BSD license
+>>>
+      Redistribution and use in source and binary forms, with or without
+      modification, are permitted provided that the following conditions
+      are met:
+      1. Redistributions of source code must retain the above copyright
+         notice, this list of conditions and the following disclaimer.
+      2. Redistributions in binary form must reproduce the above copyright
+         notice, this list of conditions and the following disclaimer in the
+         documentation and/or other materials provided with the distribution.
+      3. Neither the name of the University nor the names of its contributors
+         may be used to endorse or promote products derived from this software
+         without specific prior written permission.
+
+      THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+      ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+      IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+      ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+      FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+      DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+      OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+      HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+      LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+      OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+      SUCH DAMAGE.
+
+      IMPORTANT NOTE::
+
+      From ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
+      paragraph 3 above is now null and void.
diff --git a/Makefile.in b/Makefile.in
deleted file mode 100644
index 65a51851c2..0000000000
--- a/Makefile.in
+++ /dev/null
@@ -1,398 +0,0 @@
-SHELL = /bin/sh
-NULLCMD = @NULLCMD@
-n=$(NULLCMD)
-ECHO1 = $(V:1=@$n)
-RUNCMD = $(SHELL)
-CHDIR = @CHDIR@
-exec = exec
-NULL = /dev/null
-
-#### Start of system configuration section. ####
-
-srcdir = @srcdir@
-top_srcdir = $(srcdir)
-hdrdir = $(srcdir)/include
-PLATFORM_DIR = @PLATFORM_DIR@
-
-CC = @CC@
-CPP = @CPP@
-YACC = bison
-PURIFY =
-AUTOCONF = autoconf
-@SET_MAKE@
-MKFILES = @MAKEFILES@
-BASERUBY = @BASERUBY@
-TEST_RUNNABLE = @TEST_RUNNABLE@
-DOXYGEN = @DOXYGEN@
-
-prefix = @prefix@
-exec_prefix = @exec_prefix@
-bindir = @bindir@
-sbindir = @sbindir@
-libdir = @libdir@
-libexecdir = @libexecdir@
-datarootdir = @datarootdir@
-datadir = @datadir@
-arch = @arch@
-sitearch = @sitearch@
-sitedir = @sitedir@
-ruby_version = @ruby_version@
-
-TESTUI = console
-TESTS =
-INSTALLDOC = @INSTALLDOC@
-DOCTARGETS = @RDOCTARGET@ @CAPITARGET@
-
-EXTOUT = @EXTOUT@
-arch_hdrdir = $(EXTOUT)/include/$(arch)
-VPATH = $(arch_hdrdir)/ruby:$(hdrdir)/ruby:$(srcdir):$(srcdir)/enc:$(srcdir)/missing
-
-empty =
-OUTFLAG = @OUTFLAG@$(empty)
-COUTFLAG = @COUTFLAG@$(empty)
-ARCH_FLAG = @ARCH_FLAG@
-CFLAGS = @CFLAGS@ $(ARCH_FLAG)
-cflags = @cflags@
-optflags = @optflags@
-debugflags = @debugflags@
-warnflags = @warnflags@
-INCFLAGS = -I. -I$(arch_hdrdir) -I$(hdrdir) -I$(srcdir)
-XCFLAGS = @XCFLAGS@
-CPPFLAGS = @CPPFLAGS@ $(INCFLAGS)
-LDFLAGS = @STATIC@ $(CFLAGS) @LDFLAGS@
-EXTLDFLAGS = @EXTLDFLAGS@
-XLDFLAGS = @XLDFLAGS@ $(EXTLDFLAGS)
-EXTLIBS =
-LIBS = @LIBS@ $(EXTLIBS)
-MISSING = @LIBOBJS@ @ALLOCA@
-LDSHARED = @LIBRUBY_LDSHARED@
-DLDFLAGS = @LIBRUBY_DLDFLAGS@ $(XLDFLAGS) $(ARCH_FLAG)
-SOLIBS = @SOLIBS@
-MAINLIBS = @MAINLIBS@
-ARCHMINIOBJS = @MINIOBJS@
-BUILTIN_ENCOBJS = @BUILTIN_ENCOBJS@
-BUILTIN_TRANSSRCS = @BUILTIN_TRANSSRCS@
-BUILTIN_TRANSOBJS = @BUILTIN_TRANSOBJS@
-
-RUBY_BASE_NAME=@RUBY_BASE_NAME@
-RUBY_PROGRAM_VERSION=@RUBY_PROGRAM_VERSION@
-RUBY_INSTALL_NAME=@RUBY_INSTALL_NAME@
-RUBY_SO_NAME=@RUBY_SO_NAME@
-RUBY_RELEASE_DATE=@RUBY_RELEASE_DATE@
-EXEEXT = @EXEEXT@
-PROGRAM=$(RUBY_INSTALL_NAME)$(EXEEXT)
-RUBY = $(RUBY_INSTALL_NAME)
-MINIRUBY = @MINIRUBY@\
-	$(MINIRUBYOPT)
-RUNRUBY = @RUNRUBY@ $(RUNRUBYOPT) -- $(RUN_OPTS)
-XRUBY = @XRUBY@
-INSTALL = @INSTALL@
-INSTALL_DATA = @INSTALL_DATA@
-INSTALL_SCRIPT = @INSTALL_SCRIPT@
-INSTALL_PROGRAM = @INSTALL_PROGRAM@
-XRUBY_LIBDIR = @XRUBY_LIBDIR@
-XRUBY_RUBYLIBDIR = @XRUBY_RUBYLIBDIR@
-XRUBY_RUBYHDRDIR = @XRUBY_RUBYHDRDIR@
-
-DEFAULT_PRELUDES = $(@USE_RUBYGEMS@_GEM_PRELUDE)
-
-#### End of system configuration section. ####
-
-MAJOR=	@MAJOR@
-MINOR=	@MINOR@
-TEENY=	@TEENY@
-
-LIBRUBY_A     = @LIBRUBY_A@
-LIBRUBY_SO    = @LIBRUBY_SO@
-LIBRUBY_ALIASES= @LIBRUBY_ALIASES@
-LIBRUBY	      = @LIBRUBY@
-LIBRUBYARG    = @LIBRUBYARG@
-LIBRUBYARG_STATIC = @LIBRUBYARG_STATIC@
-LIBRUBYARG_SHARED = @LIBRUBYARG_SHARED@
-
-THREAD_MODEL  = @THREAD_MODEL@
-
-PREP          = @PREP@
-ARCHFILE      = @ARCHFILE@
-SETUP         =
-EXTSTATIC     = @EXTSTATIC@
-SET_LC_MESSAGES = env LC_MESSAGES=C
-
-MAKEDIRS      = @MKDIR_P@
-CP            = cp
-MV            = mv
-RM            = rm -f
-RMDIR         = @RMDIR@
-RMDIRS        = @RMDIRS@
-RMALL         = @RMALL@
-NM            = @NM@
-AR            = @AR@
-ARFLAGS       = rcu
-RANLIB        = @RANLIB@
-AS            = @AS@
-ASFLAGS       = @ASFLAGS@ $(INCFLAGS)
-IFCHANGE      = $(srcdir)/tool/ifchange
-SET_LC_MESSAGES = env LC_MESSAGES=C
-OBJDUMP       = @OBJDUMP@
-OBJCOPY       = @OBJCOPY@
-VCS           = @VCS@
-VCSUP         = @VCSUP@
-
-OBJEXT        = @OBJEXT@
-ASMEXT        = S
-DLEXT         = @DLEXT@
-MANTYPE	      = @MANTYPE@
-SYMBOL_PREFIX = @SYMBOL_PREFIX@
-
-INSTALLED_LIST= .installed.list
-
-MKMAIN_CMD    = mkmain.sh
-
-NEWLINE_C     = newline.c
-MINIPRELUDE_C = miniprelude.c
-
-SRC_FILE      = $<
-
-MESSAGE_BEGIN = @for line in
-MESSAGE_END = ; do echo "$$line"; done
-
-configure_args = @configure_args@
-#### End of variables
-
-all:
-
-.DEFAULT: all
-
-# Prevent GNU make v3 from overflowing arg limit on SysV.
-.NOEXPORT:
-
-miniruby$(EXEEXT):
-		@-if test -f $@; then $(MV) -f $@ $@.old; $(RM) $@.old; fi
-		$(ECHO) linking $@
-		$(Q) $(PURIFY) $(CC) $(LDFLAGS) $(XLDFLAGS) $(MAINLIBS) $(NORMALMAINOBJ) $(MINIOBJS) $(COMMONOBJS) $(DMYEXT) $(LIBS) $(OUTFLAG)$@
-
-$(PROGRAM):
-		@$(RM) $@
-		$(ECHO) linking $@
-		$(Q) $(PURIFY) $(CC) $(LDFLAGS) $(XLDFLAGS) $(MAINLIBS) $(MAINOBJ) $(EXTOBJS) $(LIBRUBYARG) $(LIBS) $(OUTFLAG)$@
-
-# We must `rm' the library each time this rule is invoked because "updating" a
-# MAB library on Apple/NeXT (see --enable-fat-binary in configure) is not
-# supported.
-$(LIBRUBY_A):
-		@$(RM) $@
-		$(ECHO) linking static-library $@
-		$(Q) $(AR) $(ARFLAGS) $@ $(OBJS) $(DMYEXT)
-		@-$(RANLIB) $@ 2> /dev/null || true
-		@$(PURIFY) $(CC) $(XLDFLAGS) $(MAINOBJ) $(LIBRUBY_A) $(MAINLIBS) $(EXTLIBS) $(LIBS) $(OUTFLAG)conftest$(EXEEXT) $(LDFLAGS)
-		@$(RM) conftest$(EXEEXT)
-
-$(LIBRUBY_SO):
-		@-$(PRE_LIBRUBY_UPDATE)
-		$(ECHO) linking shared-library $@
-		$(Q) $(LDSHARED) $(DLDFLAGS) $(OBJS) $(DLDOBJS) $(SOLIBS) $(OUTFLAG)$@
-		-$(Q) $(OBJCOPY) -w -L '$(SYMBOL_PREFIX)Init_*' -L '$(SYMBOL_PREFIX)*_threadptr_*' $@
-		@-$(MINIRUBY) -e 'ARGV.each{|link| File.delete link if File.exist? link; \
-						  File.symlink "$(LIBRUBY_SO)", link}' \
-				$(LIBRUBY_ALIASES) || true
-
-fake: $(arch)-fake.rb
-$(arch)-fake.rb: config.status $(srcdir)/template/fake.rb.in
-		@./config.status --file=$@:$(srcdir)/template/fake.rb.in
-		@chmod +x $@
-
-ruby_pc = @ruby_pc@
-$(ruby_pc):
-		@./config.status --file=$@:$(srcdir)/template/ruby.pc.in
-
-install-cross: $(arch)-fake.rb $(RBCONFIG) rbconfig.rb $(arch_hdrdir)/ruby/config.h \
-	$(LIBRUBY_A) $(LIBRUBY_SO) $(ARCHFILE)
-	$(ECHO) installing cross-compiling stuff
-	$(Q) $(MAKEDIRS) $(XRUBY_RUBYLIBDIR)/$(arch) $(XRUBY_RUBYHDRDIR)/$(arch)/ruby
-	$(Q) sed '/^\$$:\.unshift/q' $(arch)-fake.rb > fake.rb
-	$(Q) $(BASERUBY) -p \
-	-e '~/^\s*CONFIG\["LDFLAGS"\]/ and' \
-	-e '$$_[/(?=\s*"$$)/] = %q[ #{(CONFIG["LIBPATHFLAG"]%File.dirname(__FILE__)).strip}]' \
-	rbconfig.rb > fake-rbconfig.rb
-	$(INSTALL_SCRIPT) fake.rb $(XRUBY_RUBYLIBDIR)/$(arch)/fake.rb
-	$(INSTALL_SCRIPT) fake-rbconfig.rb $(XRUBY_RUBYLIBDIR)/$(arch)/rbconfig.rb
-	@$(RM) fake.rb fake-rbconfig.rb
-	$(INSTALL_DATA) $(arch_hdrdir)/ruby/config.h $(XRUBY_RUBYHDRDIR)/$(arch)/ruby
-	$(INSTALL_DATA) $(top_srcdir)/include/ruby/win32.h $(XRUBY_RUBYHDRDIR)/ruby
-	$(INSTALL_DATA) $(LIBRUBY) $(LIBRUBY_A) $(XRUBY_RUBYLIBDIR)/$(arch)
-	$(INSTALL_PROGRAM) $(LIBRUBY_SO) $(XRUBY_RUBYLIBDIR)/$(arch)
-
-Makefile:	$(srcdir)/Makefile.in $(srcdir)/enc/Makefile.in
-
-$(MKFILES): config.status
-		MAKE=$(MAKE) $(SHELL) ./config.status
-		@{ \
-		    echo "all:; -@rm -f conftest.mk"; \
-		    echo "conftest.mk: .force; @echo AUTO_REMAKE"; \
-		    echo ".force:"; \
-		} > conftest.mk || exit 1; \
-		$(MAKE) -f conftest.mk | grep '^AUTO_REMAKE$$' >/dev/null 2>&1 || \
-		{ echo "Makefile updated, restart."; exit 1; }
-
-uncommon.mk: $(srcdir)/common.mk
-		sed 's/{\$$([^(){}]*)[^{}]*}//g' $< > $@
-
-.PHONY: reconfig
-reconfig-args = $(srcdir)/configure $(configure_args)
-config.status-args = ./config.status --recheck
-reconfig-exec-0 = exec 3>&1; exit `exec 4>&1; { "$$@" 3>&- 4>&-; echo $$? 1>&4; } | fgrep -v '(cached)' 1>&3`
-reconfig-exec-1 = set -x; "$$@"
-
-reconfig config.status:	$(srcdir)/configure $(srcdir)/enc/Makefile.in \
-			$(srcdir)/version.h $(srcdir)/include/ruby/version.h
-	@PWD= MINIRUBY="$(MINIRUBY)"; export MINIRUBY; \
-	set $(SHELL) $($@-args); $(reconfig-exec-$(V))
-
-$(srcdir)/configure: $(srcdir)/configure.in
-	$(CHDIR) $(srcdir) && exec $(AUTOCONF)
-
-incs: id.h
-
-# Things which should be considered:
-# * with gperf v.s. without gperf
-# * committers may have various versions of gperf
-# * ./configure v.s. ../ruby/configure
-# * GNU make v.s. HP-UX make	# HP-UX make invokes the action if lex.c and keywords has same mtime.
-# * svn checkout generate a file with mtime as current time
-# * ext4 and XFS has a mtime with fractional part
-lex.c: defs/keywords
-	@\
-	if cmp -s $(srcdir)/defs/lex.c.src $?; then \
-	  [ $(Q) ] && echo copying $@ || set -x; \
-	  $(CP) $(srcdir)/lex.c.blt $@; \
-	else \
-	  [ $(Q) ] && echo generating $@ || set -x; \
-	  gperf -C -p -j1 -i 1 -g -o -t -N rb_reserved_word -k1,3,$$ $? > $@.tmp && \
-	  $(MV) $@.tmp $@ && \
-	  $(CP) $? $(srcdir)/defs/lex.c.src && \
-	  $(CP) $@ $(srcdir)/lex.c.blt; \
-	fi
-
-NAME2CTYPE_OPTIONS = -7 -c -j1 -i1 -t -C -P -T -H uniname2ctype_hash -Q uniname2ctype_pool -N uniname2ctype_p
-
-enc/unicode/name2ctype.h: enc/unicode/name2ctype.kwd
-	$(MAKEDIRS) $(@D)
-	@set +e; \
-	if cmp -s $(?:.kwd=.src) $?; then \
-	  set -x; \
-	  $(CP) $(?:.kwd=.h.blt) $@; \
-	else \
-	  trap '$(RM) $@-1.h $@-2.h' 0 && \
-	  set -x; \
-	  sed '/^#ifdef USE_UNICODE_PROPERTIES/,/^#endif/d' $? | gperf $(NAME2CTYPE_OPTIONS) > $@-1.h && \
-	  sed -e '/^#ifdef USE_UNICODE_PROPERTIES/,/^#endif/{' -e '/^#/d' -e '}' $? | gperf $(NAME2CTYPE_OPTIONS) > $@-2.h && \
-	  diff -DUSE_UNICODE_PROPERTIES $@-1.h $@-2.h > $@.tmp || :; \
-	  $(MV) $@.tmp $@ && \
-	  $(CP) $? $(?:.kwd=.src) && \
-	  $(CP) $@ $(?:.kwd=.h.blt); \
-	fi
-
-.c.@OBJEXT@:
-	@$(ECHO) compiling $<
-	$(Q) $(CC) $(CFLAGS) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -c $<
-
-.s.@OBJEXT@:
-	@$(ECHO) assembling $<
-	$(Q) $(AS) $(ASFLAGS) -o $@ $<
-
-.c.S:
-	@$(ECHO) translating $<
-	$(Q) $(CC) $(CFLAGS) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -S $<
-
-.c.i:
-	@$(ECHO) preprocessing $<
-	$(Q) $(CPP) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -E $< > $@
-
-clean-local::
-	$(Q)$(RM) ext/extinit.c ext/extinit.$(OBJEXT) ext/ripper/y.output
-	-$(Q)$(RM) $(pkgconfig_DATA)
-
-distclean-local::
-	$(Q)$(RM) ext/config.cache $(RBCONFIG) Doxyfile
-	-$(Q)$(RM) run.gdb
-	-$(Q)$(RM) $(INSTALLED_LIST) $(arch_hdrdir)/ruby/config.h
-	-$(Q)$(RMDIRS) $(arch_hdrdir)/ruby 2> /dev/null || true
-
-clean-ext distclean-ext realclean-ext::
-	@cd ext 2>/dev/null || exit 0; set dummy `echo "${EXTS}" | tr , ' '`; shift; \
-	test "$$#" = 0 && set .; \
-	set dummy `\
-	    find "$$@" -name Makefile -print | sed 's:^\./::;s:/Makefile$$:~:' | sort | sed 's:~$$::'; \
-	`; shift; \
-	cd ..; \
-	for dir do \
-	    echo $(@:-ext=)ing "$$dir"; \
-	    (cd "ext/$$dir" && exec $(MAKE) $(MFLAGS) $(@:-ext=)) && \
-	    case "$@" in \
-	    *distclean-ext*|*realclean-ext*) \
-		$(RMDIRS) "ext/$$dir" 2> /dev/null || true;; \
-	    esac; \
-	done
-
-distclean-ext realclean-ext::
-	-$(Q)$(RMDIR) ext 2> /dev/null || true
-
-clean-extout:
-	-$(Q)$(RMDIRS) $(EXTOUT) 2> /dev/null || true
-
-clean-enc distclean-enc realclean-enc:
-	@test -f "$(ENC_MK)" || exit 0; \
-	echo $(@:-enc=ing) encodings; \
-	exec $(MAKE) -f $(ENC_MK) $(MFLAGS) $(@:-enc=)
-
-clean-rdoc distclean-rdoc realclean-rdoc:
-	@echo $(@:-rdoc=ing) rdoc
-	$(Q)$(RMALL) $(RDOCOUT)
-clean-capi distclean-capi realclean-capi:
-	@echo $(@:-capi=ing) capi
-	$(Q)$(RMALL) $(CAPIOUT)
-
-clean-platform:
-	@$(RM) $(PLATFORM_D)
-	-$(Q) $(RMDIR) $(PLATFORM_DIR) 2> /dev/null || true
-
-ext/extinit.$(OBJEXT): ext/extinit.c $(SETUP)
-	$(ECHO) compiling $@
-	$(Q) $(CC) $(CFLAGS) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -c ext/extinit.c
-
-up::
-	@$(CHDIR) "$(srcdir)" && LC_TIME=C exec $(VCSUP)
-
-update-mspec:
-	@$(CHDIR) $(srcdir); \
-	if [ -d spec/mspec ]; then \
-	  cd spec/mspec; \
-	  echo updating mspec ...; \
-	  exec git pull; \
-	else \
-	  echo retrieving mspec ...; \
-	  exec git clone $(MSPEC_GIT_URL) spec/mspec; \
-	fi
-
-update-rubyspec: update-mspec
-	@$(CHDIR) $(srcdir); \
-	if [ -d spec/rubyspec ]; then \
-	  cd spec/rubyspec; \
-	  echo updating rubyspec ...; \
-	  exec git pull; \
-	else \
-	  echo retrieving rubyspec ...; \
-	  exec git clone $(RUBYSPEC_GIT_URL) spec/rubyspec; \
-	fi
-
-test-rubyspec-precheck:
-	@if [ ! -d $(srcdir)/spec/rubyspec ]; then echo No rubyspec here.  make update-rubyspec first.; exit 1; fi
-
-INSNS	= opt_sc.inc optinsn.inc optunifs.inc insns.inc insns_info.inc \
-	  vmtc.inc vm.inc
-
-$(INSNS): $(srcdir)/insns.def vm_opts.h \
-	  $(srcdir)/defs/opt_operand.def $(srcdir)/defs/opt_insn_unif.def \
-	  $(srcdir)/tool/instruction.rb $(srcdir)/tool/insns2vm.rb
-	$(ECHO) generating $@
-	$(Q) $(BASERUBY) -Ku $(srcdir)/tool/insns2vm.rb $(INSNS2VMOPT) $@
diff --git a/NEWS b/NEWS
deleted file mode 100644
index e390b9f09a..0000000000
--- a/NEWS
+++ /dev/null
@@ -1,117 +0,0 @@
-# -*- rd -*-
-= NEWS
-
-This document is a list of user visible feature changes made between
-releases except for bug fixes.
-
-Note that each entry is kept so brief that no reason behind or
-reference information is supplied with.  For a full list of changes
-with all sufficient information, see the ChangeLog file.
-
-== Changes since the 1.9.3 release
-
-=== C API updates
-* NUM2SHORT() and NUM2USHORT() added. They are similar to NUM2INT, but short.
-
-=== Library updates (outstanding ones only)
-
-* builtin classes
-
-  * Enumerable
-    * added method:
-      * added Enumerable#lazy method for lazy enumeration.
-
-  * Hash
-    * extended method:
-      * Hash#default_proc= can be passed nil to clear the default proc.
-
-  * Kernel
-    * added method:
-      * added Kernel#Hash conversion method like Array() or Float().
-    * extended method:
-      * Kernel#warn accepts multiple args in like puts.
-    * incompatible changes:
-      * system() and exec() closes non-standard file descriptors
-        (The default of :close_others option is changed to true by default.)
-      * respond_to? against a protected method now returns false unless
-        the second argument is true.
-
-  * LoadError
-    * added method:
-      * added LoadError#path method to return the file name that could not be
-        loaded.
-
-  * Signal
-    * incompatible changes:
-      * Signal.trap raises ArgumentError when :SEGV, :BUS, :ILL, :FPE, :VTALRM
-        are specified.
-
-  * Time
-    * change return value:
-      * Time#to_s returned encoding defaults to US-ASCII but automatically
-        transcodes to Encoding.default_internal if it is set.
-
-  * Fiber
-    * incompatible changes:
-      * Fiber#resume cannot resume a fiber which invokes "Fiber#transfer".
-
-* net/imap
-  * new methods:
-    * Net::IMAP.default_port
-    * Net::IMAP.default_imap_port
-    * Net::IMAP.default_tls_port
-    * Net::IMAP.default_ssl_port
-    * Net::IMAP.default_imaps_port
-
-* pathname
-  * extended method:
-    * Pathname#find returns an enumerator if no block is given.
-
-* resolv
-  * new methods:
-    * Resolv::DNS#timeouts=
-    * Resolv::DNS::Config#timeouts=
-
-* shellwords
-    * Shellwords#shellescape() now stringifies the given object using to_s.
-    * Shellwords#shelljoin() accepts non-string objects in the given
-      array, each of which is stringified using to_s.
-
-* lib/tmpdir.rb
-  * incompatible changes:
-    * Dir.mktmpdir uses FileUtils.remove_entry instead of
-      FileUtils.remove_entry_secure.  This means that applications should not
-      change the permission of the created temporary directory to make
-      accessible from other users.
-
-* zlib
-  * Added support for the new deflate strategies Zlib::RLE and Zlib::FIXED.
-
-* openssl
-  * Consistently raise an error when trying to encode nil values. All instances
-    of OpenSSL::ASN1::Primitive now raise TypeError when calling to_der on an
-    instance whose value is nil. All instances of OpenSSL::ASN1::Constructive
-    raise NoMethodError in the same case. Constructing such values is still
-    permitted.
-
-=== Language changes
-=== Compatibility issues (excluding feature bug fixes)
-
-  * Signal.trap
-
-    See above.
-
-  * Merge Onigmo.
-    https://github.com/k-takata/Onigmo
-
-  * The :close_others option is true by default for system() and exec().
-    Also, the close-on-exec flag is set by default for all new file descriptors.
-    This means file descriptors doesn't inherit to spawned process unless
-    explicitly requested such as system(..., fd=>fd).
-
-  * Kernel#respond_to? against a protected method now returns false
-    unless the second argument is true.
-
-  * Dir.mktmpdir in lib/tmpdir.rb
-
-    See above.
diff --git a/NEWS.md b/NEWS.md
new file mode 100644
index 0000000000..f6c3c6fc97
--- /dev/null
+++ b/NEWS.md
@@ -0,0 +1,820 @@
+# NEWS for Ruby 3.2.0
+
+This document is a list of user-visible feature changes
+since the **3.1.0** release, except for bug fixes.
+
+Note that each entry is kept to a minimum, see links for details.
+
+## Language changes
+
+* Anonymous rest and keyword rest arguments can now be passed as
+  arguments, instead of just used in method parameters.
+  [[Feature #18351]]
+
+    ```ruby
+    def foo(*)
+      bar(*)
+    end
+    def baz(**)
+      quux(**)
+    end
+    ```
+
+* A proc that accepts a single positional argument and keywords will
+  no longer autosplat. [[Bug #18633]]
+
+    ```ruby
+    proc{|a, **k| a}.call([1, 2])
+    # Ruby 3.1 and before
+    # => 1
+    # Ruby 3.2 and after
+    # => [1, 2]
+    ```
+
+* Constant assignment evaluation order for constants set on explicit
+  objects has been made consistent with single attribute assignment
+  evaluation order. With this code:
+
+    ```ruby
+    foo::BAR = baz
+    ```
+
+    `foo` is now called before `baz`. Similarly, for multiple assignments
+    to constants,  left-to-right evaluation order is used. With this
+    code:
+
+    ```ruby
+    foo1::BAR1, foo2::BAR2 = baz1, baz2
+    ```
+
+    The following evaluation order is now used:
+
+    1. `foo1`
+    2. `foo2`
+    3. `baz1`
+    4. `baz2`
+
+    [[Bug #15928]]
+
+* "Find pattern" is no longer experimental.
+  [[Feature #18585]]
+
+* Methods taking a rest parameter (like `*args`) and wishing to delegate keyword
+  arguments through `foo(*args)` must now be marked with `ruby2_keywords`
+  (if not already the case). In other words, all methods wishing to delegate
+  keyword arguments through `*args` must now be marked with `ruby2_keywords`,
+  with no exception. This will make it easier to transition to other ways of
+  delegation once a library can require Ruby 3+. Previously, the `ruby2_keywords`
+  flag was kept if the receiving method took `*args`, but this was a bug and an
+  inconsistency. A good technique to find the potentially-missing `ruby2_keywords`
+  is to run the test suite, for where it fails find the last method which must
+  receive keyword arguments, use `puts nil, caller, nil` there, and check each
+  method/block on the call chain which must delegate keywords is correctly marked
+  as `ruby2_keywords`. [[Bug #18625]] [[Bug #16466]]
+
+    ```ruby
+    def target(**kw)
+    end
+
+    # Accidentally worked without ruby2_keywords in Ruby 2.7-3.1, ruby2_keywords
+    # needed in 3.2+. Just like (*args, **kwargs) or (...) would be needed on
+    # both #foo and #bar when migrating away from ruby2_keywords.
+    ruby2_keywords def bar(*args)
+      target(*args)
+    end
+
+    ruby2_keywords def foo(*args)
+      bar(*args)
+    end
+
+    foo(k: 1)
+    ```
+
+## Core classes updates
+
+Note: We're only listing outstanding class updates.
+
+* Fiber
+
+    * Introduce Fiber.[] and Fiber.[]= for inheritable fiber storage.
+      Introduce Fiber#storage and Fiber#storage= (experimental) for
+      getting and resetting the current storage.  Introduce
+      `Fiber.new(storage:)` for setting the storage when creating a
+      fiber. [[Feature #19078]]
+
+        Existing Thread and Fiber local variables can be tricky to use.
+        Thread-local variables are shared between all fibers, making it
+        hard to isolate, while Fiber-local variables can be hard to
+        share.  It is often desirable to define unit of execution
+        ("execution context") such that some state is shared between all
+        fibers and threads created in that context.  This is what Fiber
+        storage provides.
+
+        ```ruby
+        def log(message)
+          puts "#{Fiber[:request_id]}: #{message}"
+        end
+
+        def handle_requests
+          while request = read_request
+            Fiber.schedule do
+              Fiber[:request_id] = SecureRandom.uuid
+
+              request.messages.each do |message|
+                Fiber.schedule do
+                  log("Handling #{message}") # Log includes inherited request_id.
+                end
+              end
+            end
+          end
+        end
+        ```
+
+        You should generally consider Fiber storage for any state which
+        you want to be shared implicitly between all fibers and threads
+        created in a given context, e.g. a connection pool, a request
+        id, a logger level, environment variables, configuration, etc.
+
+* Fiber::Scheduler
+
+    * Introduce `Fiber::Scheduler#io_select` for non-blocking IO.select.
+      [[Feature #19060]]
+
+* IO
+
+    * Introduce IO#timeout= and IO#timeout which can cause
+      IO::TimeoutError to be raised if a blocking operation exceeds the
+      specified timeout. [[Feature #18630]]
+
+        ```ruby
+        STDIN.timeout = 1
+        STDIN.read # => Blocking operation timed out! (IO::TimeoutError)
+        ```
+
+    * Introduce `IO.new(..., path:)` and promote `File#path` to `IO#path`.
+      [[Feature #19036]]
+
+* Class
+
+    * Class#attached_object, which returns the object for which
+      the receiver is the singleton class. Raises TypeError if the
+      receiver is not a singleton class.
+      [[Feature #12084]]
+
+        ```ruby
+        class Foo; end
+
+        Foo.singleton_class.attached_object        #=> Foo
+        Foo.new.singleton_class.attached_object    #=> #<Foo:0x000000010491a370>
+        Foo.attached_object                        #=> TypeError: `Foo' is not a singleton class
+        nil.singleton_class.attached_object        #=> TypeError: `NilClass' is not a singleton class
+        ```
+
+* Data
+
+    * New core class to represent simple immutable value object. The class is
+      similar to Struct and partially shares an implementation, but has more
+      lean and strict API. [[Feature #16122]]
+
+        ```ruby
+        Measure = Data.define(:amount, :unit)
+        distance = Measure.new(100, 'km')            #=> #<data Measure amount=100, unit="km">
+        weight = Measure.new(amount: 50, unit: 'kg') #=> #<data Measure amount=50, unit="kg">
+        weight.with(amount: 40)                      #=> #<data Measure amount=40, unit="kg">
+        weight.amount                                #=> 50
+        weight.amount = 40                           #=> NoMethodError: undefined method `amount='
+        ```
+
+* Encoding
+
+    * Encoding#replicate has been deprecated and will be removed in 3.3. [[Feature #18949]]
+    * The dummy `Encoding::UTF_16` and `Encoding::UTF_32` encodings no longer
+      try to dynamically guess the endian based on a byte order mark.
+      Use `Encoding::UTF_16BE`/`UTF_16LE` and `Encoding::UTF_32BE`/`UTF_32LE` instead.
+      This change speeds up getting the encoding of a String. [[Feature #18949]]
+    * Limit maximum encoding set size by 256.
+      If exceeding maximum size, `EncodingError` will be raised. [[Feature #18949]]
+
+* Enumerator
+
+    * Enumerator.product has been added.  Enumerator::Product is the implementation. [[Feature #18685]]
+
+* Exception
+
+    * Exception#detailed_message has been added.
+      The default error printer calls this method on the Exception object
+      instead of #message. [[Feature #18564]]
+
+* Hash
+
+    * Hash#shift now always returns nil if the hash is
+      empty, instead of returning the default value or
+      calling the default proc. [[Bug #16908]]
+
+* Integer
+
+    * Integer#ceildiv has been added. [[Feature #18809]]
+
+* Kernel
+
+    * Kernel#binding raises RuntimeError if called from a non-Ruby frame
+      (such as a method defined in C). [[Bug #18487]]
+
+* MatchData
+
+    * MatchData#byteoffset has been added. [[Feature #13110]]
+    * MatchData#deconstruct has been added. [[Feature #18821]]
+    * MatchData#deconstruct_keys has been added. [[Feature #18821]]
+
+* Module
+
+    * Module.used_refinements has been added. [[Feature #14332]]
+    * Module#refinements has been added. [[Feature #12737]]
+    * Module#const_added has been added. [[Feature #17881]]
+    * Module#undefined_instance_methods has been added. [[Feature #12655]]
+
+* Proc
+
+    * Proc#dup returns an instance of subclass. [[Bug #17545]]
+    * Proc#parameters now accepts lambda keyword. [[Feature #15357]]
+
+* Process
+    * Added `RLIMIT_NPTS` constant to FreeBSD platform
+
+* Regexp
+
+    * The cache-based optimization is introduced.
+      Many (but not all) Regexp matching is now in linear time, which
+      will prevent regular expression denial of service (ReDoS)
+      vulnerability. [[Feature #19104]]
+
+    * Regexp.linear_time? is introduced. [[Feature #19194]]
+
+    * Regexp.new now supports passing the regexp flags not only as an Integer,
+      but also as a String.  Unknown flags raise ArgumentError.
+      Otherwise, anything other than `true`, `false`, `nil` or Integer will be warned.
+      [[Feature #18788]]
+
+    * Regexp.timeout= has been added. Also, Regexp.new new supports timeout keyword.
+      See [[Feature #17837]]
+
+* Refinement
+
+    * Refinement#refined_class has been added. [[Feature #12737]]
+
+* RubyVM::AbstractSyntaxTree
+
+    * Add `error_tolerant` option for `parse`, `parse_file` and `of`. [[Feature #19013]]
+      With this option
+
+        1. SyntaxError is suppressed
+        2. AST is returned for invalid input
+        3. `end` is complemented when a parser reaches to the end of input but `end` is insufficient
+        4. `end` is treated as keyword based on indent
+
+        ```ruby
+        # Without error_tolerant option
+        root = RubyVM::AbstractSyntaxTree.parse(<<~RUBY)
+        def m
+          a = 10
+          if
+        end
+        RUBY
+        # => <internal:ast>:33:in `parse': syntax error, unexpected `end' (SyntaxError)
+
+        # With error_tolerant option
+        root = RubyVM::AbstractSyntaxTree.parse(<<~RUBY, error_tolerant: true)
+        def m
+          a = 10
+          if
+        end
+        RUBY
+        p root # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-4:3>
+
+        # `end` is treated as keyword based on indent
+        root = RubyVM::AbstractSyntaxTree.parse(<<~RUBY, error_tolerant: true)
+        module Z
+          class Foo
+            foo.
+          end
+
+          def bar
+          end
+        end
+        RUBY
+        p root.children[-1].children[-1].children[-1].children[-2..-1]
+        # => [#<RubyVM::AbstractSyntaxTree::Node:CLASS@2:2-4:5>, #<RubyVM::AbstractSyntaxTree::Node:DEFN@6:2-7:5>]
+        ```
+
+    * Add `keep_tokens` option for `parse`, `parse_file` and `of`. Add `#tokens` and `#all_tokens`
+      for RubyVM::AbstractSyntaxTree::Node [[Feature #19070]]
+
+        ```ruby
+        root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2", keep_tokens: true)
+        root.tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+        root.tokens.map{_1[2]}.join # => "x = 1 + 2"
+        ```
+
+* Set
+
+    * Set is now available as a built-in class without the need for `require "set"`. [[Feature #16989]]
+      It is currently autoloaded via the Set constant or a call to Enumerable#to_set.
+
+* String
+
+    * String#byteindex and String#byterindex have been added. [[Feature #13110]]
+    * Update Unicode to Version 15.0.0 and Emoji Version 15.0. [[Feature #18639]]
+      (also applies to Regexp)
+    * String#bytesplice has been added.  [[Feature #18598]]
+    * String#dedup has been added as an alias to String#-@.  [[Feature #18595]]
+
+* Struct
+
+    * A Struct class can also be initialized with keyword arguments
+      without `keyword_init: true` on Struct.new [[Feature #16806]]
+
+        ```ruby
+        Post = Struct.new(:id, :name)
+        Post.new(1, "hello") #=> #<struct Post id=1, name="hello">
+        # From Ruby 3.2, the following code also works without keyword_init: true.
+        Post.new(id: 1, name: "hello") #=> #<struct Post id=1, name="hello">
+        ```
+
+* Thread
+
+    * Thread.each_caller_location is added. [[Feature #16663]]
+
+* Thread::Queue
+
+    * Thread::Queue#pop(timeout: sec) is added. [[Feature #18774]]
+
+* Thread::SizedQueue
+
+    * Thread::SizedQueue#pop(timeout: sec) is added. [[Feature #18774]]
+    * Thread::SizedQueue#push(timeout: sec) is added. [[Feature #18944]]
+
+* Time
+
+    * Time#deconstruct_keys is added, allowing to use Time instances
+      in pattern-matching expressions [[Feature #19071]]
+
+    * Time.new now can parse a string like generated by Time#inspect
+      and return a Time instance based on the given argument.
+      [[Feature #18033]]
+
+* SyntaxError
+    * SyntaxError#path has been added.  [[Feature #19138]]
+
+* TracePoint
+
+    * TracePoint#binding now returns `nil` for `c_call`/`c_return` TracePoints.
+      [[Bug #18487]]
+    * TracePoint#enable `target_thread` keyword argument now defaults to the
+      current thread if a block is given and `target` and `target_line` keyword
+      arguments are not passed. [[Bug #16889]]
+
+* UnboundMethod
+
+    * `UnboundMethod#==` returns `true` if the actual method is same. For example,
+      `String.instance_method(:object_id) == Array.instance_method(:object_id)`
+      returns `true`. [[Feature #18798]]
+
+    * `UnboundMethod#inspect` does not show the receiver of `instance_method`.
+      For example `String.instance_method(:object_id).inspect` returns
+      `"#<UnboundMethod: Kernel#object_id()>"`
+      (was `"#<UnboundMethod: String(Kernel)#object_id()>"`).
+
+* GC
+
+    * Expose `need_major_gc` via `GC.latest_gc_info`. [GH-6791]
+
+* ObjectSpace
+
+    * `ObjectSpace.dump_all` dump shapes as well. [GH-6868]
+
+## Stdlib updates
+
+* Bundler
+
+    * Bundler now uses [PubGrub] resolver instead of [Molinillo] for performance improvement.
+    * Add --ext=rust support to bundle gem for creating simple gems with Rust extensions.
+      [[GH-rubygems-6149]]
+    * Make cloning git repos faster [[GH-rubygems-4475]]
+
+* RubyGems
+
+    * Add mswin support for cargo builder. [[GH-rubygems-6167]]
+
+* CGI
+
+    * `CGI.escapeURIComponent` and `CGI.unescapeURIComponent` are added.
+      [[Feature #18822]]
+
+* Coverage
+
+    * `Coverage.setup` now accepts `eval: true`. By this, `eval` and related methods are
+      able to generate code coverage. [[Feature #19008]]
+
+    * `Coverage.supported?(mode)` enables detection of what coverage modes are
+      supported. [[Feature #19026]]
+
+* Date
+
+    * Added `Date#deconstruct_keys` and `DateTime#deconstruct_keys` same as [[Feature #19071]]
+
+* ERB
+
+    * `ERB::Util.html_escape` is made faster than `CGI.escapeHTML`.
+        * It no longer allocates a String object when no character needs to be escaped.
+        * It skips calling `#to_s` method when an argument is already a String.
+        * `ERB::Escape.html_escape` is added as an alias to `ERB::Util.html_escape`,
+          which has not been monkey-patched by Rails.
+    * `ERB::Util.url_encode` is made faster using `CGI.escapeURIComponent`.
+    * `-S` option is removed from `erb` command.
+
+* FileUtils
+
+    * Add FileUtils.ln_sr method and `relative:` option to FileUtils.ln_s.
+      [[Feature #18925]]
+
+* IRB
+
+    * debug.gem integration commands have been added: `debug`, `break`, `catch`,
+      `next`, `delete`, `step`, `continue`, `finish`, `backtrace`, `info`
+        * They work even if you don't have `gem "debug"` in your Gemfile.
+        * See also: [What's new in Ruby 3.2's IRB?](https://st0012.dev/whats-new-in-ruby-3-2-irb)
+    * More Pry-like commands and features have been added.
+        * `edit` and `show_cmds` (like Pry's `help`) are added.
+        * `ls` takes `-g` or `-G` option to filter out outputs.
+        * `show_source` is aliased from `$` and accepts unquoted inputs.
+        * `whereami` is aliased from `@`.
+
+* Net::Protocol
+
+    * Improve `Net::BufferedIO` performance. [[GH-net-protocol-14]]
+
+* Pathname
+
+    * Added `Pathname#lutime`. [[GH-pathname-20]]
+
+* Socket
+
+    * Added the following constants for supported platforms.
+        * `SO_INCOMING_CPU`
+        * `SO_INCOMING_NAPI_ID`
+        * `SO_RTABLE`
+        * `SO_SETFIB`
+        * `SO_USER_COOKIE`
+        * `TCP_KEEPALIVE`
+        * `TCP_CONNECTION_INFO`
+
+* SyntaxSuggest
+
+    * The feature of `syntax_suggest` formerly `dead_end` is integrated in Ruby.
+      [[Feature #18159]]
+
+* UNIXSocket
+
+    * Add support for UNIXSocket on Windows. Emulate anonymous sockets. Add
+      support for File.socket? and File::Stat#socket? where possible.
+      [[Feature #19135]]
+
+*   The following default gems are updated.
+
+    * RubyGems 3.4.1
+    * abbrev 0.1.1
+    * benchmark 0.2.1
+    * bigdecimal 3.1.3
+    * bundler 2.4.1
+    * cgi 0.3.6
+    * csv 3.2.6
+    * date 3.3.3
+    * delegate 0.3.0
+    * did_you_mean 1.6.3
+    * digest 3.1.1
+    * drb 2.1.1
+    * english 0.7.2
+    * erb 4.0.2
+    * error_highlight 0.5.1
+    * etc 1.4.2
+    * fcntl 1.0.2
+    * fiddle 1.1.1
+    * fileutils 1.7.0
+    * forwardable 1.3.3
+    * getoptlong 0.2.0
+    * io-console 0.6.0
+    * io-nonblock 0.2.0
+    * io-wait 0.3.0
+    * ipaddr 1.2.5
+    * irb 1.6.2
+    * json 2.6.3
+    * logger 1.5.3
+    * mutex_m 0.1.2
+    * net-http 0.4.0
+    * net-protocol 0.2.1
+    * nkf 0.1.2
+    * open-uri 0.3.0
+    * open3 0.1.2
+    * openssl 3.1.0
+    * optparse 0.3.1
+    * ostruct 0.5.5
+    * pathname 0.2.1
+    * pp 0.4.0
+    * pstore 0.1.2
+    * psych 5.0.1
+    * racc 1.6.2
+    * rdoc 6.5.0
+    * readline-ext 0.1.5
+    * reline 0.3.2
+    * resolv 0.2.2
+    * resolv-replace 0.1.1
+    * securerandom 0.2.2
+    * set 1.0.3
+    * stringio 3.0.4
+    * strscan 3.0.5
+    * syntax_suggest 1.0.2
+    * syslog 0.1.1
+    * tempfile 0.1.3
+    * time 0.2.1
+    * timeout 0.3.1
+    * tmpdir 0.1.3
+    * tsort 0.1.1
+    * un 0.2.1
+    * uri 0.12.0
+    * weakref 0.1.2
+    * win32ole 1.8.9
+    * yaml 0.2.1
+    * zlib 3.0.0
+
+*   The following bundled gems are updated.
+
+    * minitest 5.16.3
+    * power_assert 2.0.3
+    * test-unit 3.5.7
+    * net-ftp 0.2.0
+    * net-imap 0.3.4
+    * net-pop 0.1.2
+    * net-smtp 0.3.3
+    * rbs 2.8.2
+    * typeprof 0.21.3
+    * debug 1.7.1
+
+See GitHub releases like [GitHub Releases of Logger](https://github.com/ruby/logger/releases) or changelog for details of the default gems or bundled gems.
+
+## Supported platforms
+
+* WebAssembly/WASI is added. See [wasm/README.md] and [ruby.wasm] for more details. [[Feature #18462]]
+
+## Compatibility issues
+
+* `String#to_c` currently treat a sequence of underscores as an end of Complex
+  string. [[Bug #19087]]
+
+* Now `ENV.clone` raises `TypeError` as well as `ENV.dup` [[Bug #17767]]
+
+### Removed constants
+
+The following deprecated constants are removed.
+
+* `Fixnum` and `Bignum` [[Feature #12005]]
+* `Random::DEFAULT` [[Feature #17351]]
+* `Struct::Group`
+* `Struct::Passwd`
+
+### Removed methods
+
+The following deprecated methods are removed.
+
+* `Dir.exists?` [[Feature #17391]]
+* `File.exists?` [[Feature #17391]]
+* `Kernel#=~` [[Feature #15231]]
+* `Kernel#taint`, `Kernel#untaint`, `Kernel#tainted?`
+  [[Feature #16131]]
+* `Kernel#trust`, `Kernel#untrust`, `Kernel#untrusted?`
+  [[Feature #16131]]
+* `Method#public?`, `Method#private?`, `Method#protected?`,
+  `UnboundMethod#public?`, `UnboundMethod#private?`, `UnboundMethod#protected?`
+  [[Bug #18729]] [[Bug #18751]] [[Bug #18435]]
+
+### Source code incompatibility of extension libraries
+
+* Extension libraries provide PRNG, subclasses of Random, need updates.
+  See [PRNG update] below for more information. [[Bug #19100]]
+
+### Error printer
+
+* Ruby no longer escapes control characters and backslashes in an
+  error message. [[Feature #18367]]
+
+### Constant lookup when defining a class/module
+
+* When defining a class/module directly under the Object class by class/module
+  statement, if there is already a class/module defined by `Module#include`
+  with the same name, the statement was handled as "open class" in Ruby 3.1 or before.
+  Since Ruby 3.2, a new class is defined instead. [[Feature #18832]]
+
+## Stdlib compatibility issues
+
+* Psych no longer bundles libyaml sources.
+  And also Fiddle no longer bundles libffi sources.
+  Users need to install the libyaml/libffi library themselves via the package
+  manager like apt, yum, brew, etc.
+
+    Psych and fiddle supported the static build with specific version of libyaml
+    and libffi sources. You can build psych with libyaml-0.2.5 like this.
+
+    ```bash
+    $ ./configure --with-libyaml-source-dir=/path/to/libyaml-0.2.5
+    ```
+
+    And you can build fiddle with libffi-3.4.4 like this.
+
+    ```bash
+    $ ./configure --with-libffi-source-dir=/path/to/libffi-3.4.4
+    ```
+
+    [[Feature #18571]]
+
+* Check cookie name/path/domain characters in `CGI::Cookie`. [[CVE-2021-33621]]
+
+* `URI.parse` return empty string in host instead of nil. [[sec-156615]]
+
+## C API updates
+
+### Updated C APIs
+
+The following APIs are updated.
+
+* PRNG update
+
+    `rb_random_interface_t` in ruby/random.h updated and versioned.
+    Extension libraries which use this interface and built for older
+    versions need to rebuild with adding `init_int32` function.
+
+### Added C APIs
+
+* `VALUE rb_hash_new_capa(long capa)` was added to created hashes with the desired capacity.
+* `rb_internal_thread_add_event_hook` and `rb_internal_thread_add_event_hook` were added to instrument threads scheduling.
+  The following events are available:
+    * `RUBY_INTERNAL_THREAD_EVENT_STARTED`
+    * `RUBY_INTERNAL_THREAD_EVENT_READY`
+    * `RUBY_INTERNAL_THREAD_EVENT_RESUMED`
+    * `RUBY_INTERNAL_THREAD_EVENT_SUSPENDED`
+    * `RUBY_INTERNAL_THREAD_EVENT_EXITED`
+* `rb_debug_inspector_current_depth` and `rb_debug_inspector_frame_depth` are added for debuggers.
+
+### Removed C APIs
+
+The following deprecated APIs are removed.
+
+* `rb_cData` variable.
+* "taintedness" and "trustedness" functions. [[Feature #16131]]
+
+## Implementation improvements
+
+* Fixed several race conditions in Kernel#autoload. [[Bug #18782]]
+* Cache invalidation for expressions referencing constants is now
+  more fine-grained. `RubyVM.stat(:global_constant_state)` was
+  removed because it was closely tied to the previous caching scheme
+  where setting any constant invalidates all caches in the system.
+  New keys, `:constant_cache_invalidations` and `:constant_cache_misses`,
+  were introduced to help with use cases for `:global_constant_state`.
+  [[Feature #18589]]
+* The cache-based optimization for Regexp matching is introduced.
+  [[Feature #19104]]
+* [Variable Width Allocation](https://shopify.engineering/ruby-variable-width-allocation)
+  is now enabled by default. [[Feature #18239]]
+* Added a new instance variable caching mechanism, called object shapes, which
+  improves inline cache hits for most objects and allows us to generate very
+  efficient JIT code. Objects whose instance variables are defined in a
+  consistent order will see the most performance benefits.
+  [[Feature #18776]]
+* Speed up marking instruction sequences by using a bitmap to find "markable"
+  objects.  This change results in faster major collections.
+  [[Feature #18875]]
+
+## JIT
+
+### YJIT
+
+* YJIT is no longer experimental
+    * Has been tested on production workloads for over a year and proven to be quite stable.
+* YJIT now supports both x86-64 and arm64/aarch64 CPUs on Linux, MacOS, BSD and other UNIX platforms.
+    * This release brings support for Mac M1/M2, AWS Graviton and Raspberry Pi 4.
+* Building YJIT now requires Rust 1.58.0+. [[Feature #18481]]
+    * In order to ensure that CRuby is built with YJIT, please install `rustc` >= 1.58.0
+      before running `./configure`
+    * Please reach out to the YJIT team should you run into any issues.
+* Physical memory for JIT code is lazily allocated. Unlike Ruby 3.1,
+  the RSS of a Ruby process is minimized because virtual memory pages
+  allocated by `--yjit-exec-mem-size` will not be mapped to physical
+  memory pages until actually utilized by JIT code.
+* Introduce Code GC that frees all code pages when the memory consumption
+  by JIT code reaches `--yjit-exec-mem-size`.
+    * `RubyVM::YJIT.runtime_stats` returns Code GC metrics in addition to
+      existing `inline_code_size` and `outlined_code_size` keys:
+      `code_gc_count`, `live_page_count`, `freed_page_count`, and `freed_code_size`.
+* Most of the statistics produced by `RubyVM::YJIT.runtime_stats` are now available in release builds.
+    * Simply run ruby with `--yjit-stats` to compute and dump stats (incurs some run-time overhead).
+* YJIT is now optimized to take advantage of object shapes. [[Feature #18776]]
+* Take advantage of finer-grained constant invalidation to invalidate less code when defining new constants. [[Feature #18589]]
+* The default `--yjit-exec-mem-size` is changed to 64 (MiB).
+* The default `--yjit-call-threshold` is changed to 30.
+
+### MJIT
+
+* The MJIT compiler is re-implemented in Ruby as `ruby_vm/mjit/compiler`.
+* MJIT compiler is executed under a forked Ruby process instead of
+  doing it in a native thread called MJIT worker. [[Feature #18968]]
+    * As a result, Microsoft Visual Studio (MSWIN) is no longer supported.
+* MinGW is no longer supported. [[Feature #18824]]
+* Rename `--mjit-min-calls` to `--mjit-call-threshold`.
+* Change default `--mjit-max-cache` back from 10000 to 100.
+
+[Feature #12005]:     https://bugs.ruby-lang.org/issues/12005
+[Feature #12084]:     https://bugs.ruby-lang.org/issues/12084
+[Feature #12655]:     https://bugs.ruby-lang.org/issues/12655
+[Feature #12737]:     https://bugs.ruby-lang.org/issues/12737
+[Feature #13110]:     https://bugs.ruby-lang.org/issues/13110
+[Feature #14332]:     https://bugs.ruby-lang.org/issues/14332
+[Feature #15231]:     https://bugs.ruby-lang.org/issues/15231
+[Feature #15357]:     https://bugs.ruby-lang.org/issues/15357
+[Bug #15928]:         https://bugs.ruby-lang.org/issues/15928
+[Feature #16122]:     https://bugs.ruby-lang.org/issues/16122
+[Feature #16131]:     https://bugs.ruby-lang.org/issues/16131
+[Bug #16466]:         https://bugs.ruby-lang.org/issues/16466
+[Feature #16663]:     https://bugs.ruby-lang.org/issues/16663
+[Feature #16806]:     https://bugs.ruby-lang.org/issues/16806
+[Bug #16889]:         https://bugs.ruby-lang.org/issues/16889
+[Bug #16908]:         https://bugs.ruby-lang.org/issues/16908
+[Feature #16989]:     https://bugs.ruby-lang.org/issues/16989
+[Feature #17351]:     https://bugs.ruby-lang.org/issues/17351
+[Feature #17391]:     https://bugs.ruby-lang.org/issues/17391
+[Bug #17545]:         https://bugs.ruby-lang.org/issues/17545
+[Bug #17767]:         https://bugs.ruby-lang.org/issues/17767
+[Feature #17837]:     https://bugs.ruby-lang.org/issues/17837
+[Feature #17881]:     https://bugs.ruby-lang.org/issues/17881
+[Feature #18033]:     https://bugs.ruby-lang.org/issues/18033
+[Feature #18159]:     https://bugs.ruby-lang.org/issues/18159
+[Feature #18239]:     https://bugs.ruby-lang.org/issues/18239#note-17
+[Feature #18351]:     https://bugs.ruby-lang.org/issues/18351
+[Feature #18367]:     https://bugs.ruby-lang.org/issues/18367
+[Bug #18435]:         https://bugs.ruby-lang.org/issues/18435
+[Feature #18462]:     https://bugs.ruby-lang.org/issues/18462
+[Feature #18481]:     https://bugs.ruby-lang.org/issues/18481
+[Bug #18487]:         https://bugs.ruby-lang.org/issues/18487
+[Feature #18564]:     https://bugs.ruby-lang.org/issues/18564
+[Feature #18571]:     https://bugs.ruby-lang.org/issues/18571
+[Feature #18585]:     https://bugs.ruby-lang.org/issues/18585
+[Feature #18589]:     https://bugs.ruby-lang.org/issues/18589
+[Feature #18595]:     https://bugs.ruby-lang.org/issues/18595
+[Feature #18598]:     https://bugs.ruby-lang.org/issues/18598
+[Bug #18625]:         https://bugs.ruby-lang.org/issues/18625
+[Feature #18630]:     https://bugs.ruby-lang.org/issues/18630
+[Bug #18633]:         https://bugs.ruby-lang.org/issues/18633
+[Feature #18639]:     https://bugs.ruby-lang.org/issues/18639
+[Feature #18685]:     https://bugs.ruby-lang.org/issues/18685
+[Bug #18729]:         https://bugs.ruby-lang.org/issues/18729
+[Bug #18751]:         https://bugs.ruby-lang.org/issues/18751
+[Feature #18774]:     https://bugs.ruby-lang.org/issues/18774
+[Feature #18776]:     https://bugs.ruby-lang.org/issues/18776
+[Bug #18782]:         https://bugs.ruby-lang.org/issues/18782
+[Feature #18788]:     https://bugs.ruby-lang.org/issues/18788
+[Feature #18798]:     https://bugs.ruby-lang.org/issues/18798
+[Feature #18809]:     https://bugs.ruby-lang.org/issues/18809
+[Feature #18821]:     https://bugs.ruby-lang.org/issues/18821
+[Feature #18822]:     https://bugs.ruby-lang.org/issues/18822
+[Feature #18824]:     https://bugs.ruby-lang.org/issues/18824
+[Feature #18832]:     https://bugs.ruby-lang.org/issues/18832
+[Feature #18875]:     https://bugs.ruby-lang.org/issues/18875
+[Feature #18925]:     https://bugs.ruby-lang.org/issues/18925
+[Feature #18944]:     https://bugs.ruby-lang.org/issues/18944
+[Feature #18949]:     https://bugs.ruby-lang.org/issues/18949
+[Feature #18968]:     https://bugs.ruby-lang.org/issues/18968
+[Feature #19008]:     https://bugs.ruby-lang.org/issues/19008
+[Feature #19013]:     https://bugs.ruby-lang.org/issues/19013
+[Feature #19026]:     https://bugs.ruby-lang.org/issues/19026
+[Feature #19036]:     https://bugs.ruby-lang.org/issues/19036
+[Feature #19060]:     https://bugs.ruby-lang.org/issues/19060
+[Feature #19070]:     https://bugs.ruby-lang.org/issues/19070
+[Feature #19071]:     https://bugs.ruby-lang.org/issues/19071
+[Feature #19078]:     https://bugs.ruby-lang.org/issues/19078
+[Bug #19087]:         https://bugs.ruby-lang.org/issues/19087
+[Bug #19100]:         https://bugs.ruby-lang.org/issues/19100
+[Feature #19104]:     https://bugs.ruby-lang.org/issues/19104
+[Feature #19135]:     https://bugs.ruby-lang.org/issues/19135
+[Feature #19138]:     https://bugs.ruby-lang.org/issues/19138
+[Feature #19194]:     https://bugs.ruby-lang.org/issues/19194
+[Molinillo]:          https://github.com/CocoaPods/Molinillo
+[PubGrub]:            https://github.com/jhawthorn/pub_grub
+[GH-net-protocol-14]: https://github.com/ruby/net-protocol/pull/14
+[GH-pathname-20]:     https://github.com/ruby/pathname/pull/20
+[GH-6791]:            https://github.com/ruby/ruby/pull/6791
+[GH-6868]:            https://github.com/ruby/ruby/pull/6868
+[GH-rubygems-4475]:   https://github.com/rubygems/rubygems/pull/4475
+[GH-rubygems-6149]:   https://github.com/rubygems/rubygems/pull/6149
+[GH-rubygems-6167]:   https://github.com/rubygems/rubygems/pull/6167
+[sec-156615]:         https://hackerone.com/reports/156615
+[CVE-2021-33621]:     https://www.ruby-lang.org/en/news/2022/11/22/http-response-splitting-in-cgi-cve-2021-33621/
+[wasm/README.md]:     https://github.com/ruby/ruby/blob/master/wasm/README.md
+[ruby.wasm]:          https://github.com/ruby/ruby.wasm
diff --git a/README b/README
deleted file mode 100644
index d4296a9809..0000000000
--- a/README
+++ /dev/null
@@ -1,147 +0,0 @@
-* What's Ruby
-
-Ruby is the interpreted scripting language for quick and
-easy object-oriented programming.  It has many features to
-process text files and to do system management tasks (as in
-Perl).  It is simple, straight-forward, and extensible.
-
-
-* Features of Ruby
-
-  + Simple Syntax
-  + *Normal* Object-Oriented features(ex. class, method calls)
-  + *Advanced* Object-Oriented features(ex. Mix-in, Singleton-method)
-  + Operator Overloading
-  + Exception Handling
-  + Iterators and Closures
-  + Garbage Collection
-  + Dynamic Loading of Object files(on some architecture)
-  + Highly Portable (works on many Unix-like/POSIX compatible platforms
-    as well as Windows, Mac OS X, BeOS etc.)
-    cf. http://bugs.ruby-lang.org/projects/ruby-trunk/wiki/SupportedPlatforms
-
-
-* How to get Ruby
-
-The Ruby distribution files can be found in the following FTP site:
-
-  ftp://ftp.ruby-lang.org/pub/ruby/
-
-The trunk of the Ruby source tree can be checked out with the
-following command:
-
-  $ svn co http://svn.ruby-lang.org/repos/ruby/trunk/ ruby
-
-Or if you are using git then use following command:
-
-  $ git clone git://github.com/ruby/ruby.git
-
-There are some other branches under development.  Try the following
-command and see the list of branches:
-
-  $ svn ls http://svn.ruby-lang.org/repos/ruby/branches/
-
-Or if you are using git then use following command:
-
-  $ git ls-remote git://github.com/ruby/ruby.git
-
-* Ruby home-page
-
-The URL of the Ruby home-page is:
-
-   http://www.ruby-lang.org/
-
-
-* Mailing list
-
-There is a mailing list to talk about Ruby.
-To subscribe this list, please send the following phrase
-
-	subscribe YourFirstName YourFamilyName
-e.g.
-        subscribe Joseph Smith
-
-in the mail body (not subject) to the address <ruby-talk-ctl@ruby-lang.org>.
-
-
-* How to compile and install
-
-This is what you need to do to compile and install Ruby:
-
-  1. If ./configure does not exist or is older than configure.in,
-     run autoconf to (re)generate configure.
-
-  2. Run ./configure, which will generate config.h and Makefile.
-
-     Some C compiler flags may be added by default depending on your
-     environment.  Specify optflags=.. and warnflags=.. as necessary
-     to override them.
-
-  3. Edit defines.h if you need.  Usually this step will not be needed.
-
-  4. Remove comment mark(#) before the module names from ext/Setup (or
-     add module names if not present), if you want to link modules
-     statically.
-
-     If you don't want to compile non static extension modules
-     (probably on architectures which does not allow dynamic loading),
-     remove comment mark from the line "#option nodynamic" in
-     ext/Setup.
-
-  5. Run make.
-
-  6. Optionally, run 'make check' to check whether the compiled Ruby
-     interpreter works well.  If you see the message "check succeeded",
-     your ruby works as it should (hopefully).
-
-  7. Run 'make install'
-
-     This command will create following directories and install files
-     onto them.
-
-       * ${DESTDIR}${prefix}/bin
-       * ${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib
-       * ${DESTDIR}${prefix}/lib/ruby
-       * ${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib/ruby/site_ruby
-       * ${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib/ruby/vendor_ruby
-       * ${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib/ruby/gems/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/share/man/man1
-       * ${DESTDIR}${prefix}/share/ri/${MAJOR}.${MINOR}.${TEENY}/system
-
-     If Ruby's API version is `x.y.z', the ((|${MAJOR}|)) is `x', the
-     ((|${MINOR}|)) is `y', and the ((|${TEENY}|)) is `z'.
-
-     NOTE: teeny of the API version may be different from one of
-     Ruby's program version
-
-     You may have to be a super user to install ruby.
-
-If you fail to compile ruby, please send the detailed error report with
-the error log and machine/OS type, to help others.
-
-
-* Copying
-
-See the file COPYING.
-
-
-* The Author
-
-Feel free to send comments and bug reports to the author.  Here is the
-author's latest mail address:
-
-  matz@netlab.jp
-
--------------------------------------------------------
-created at: Thu Aug  3 11:57:36 JST 1995
-Local variables:
-mode: indented-text
-end:
diff --git a/README.EXT b/README.EXT
index ad45255bca..48b8d964c4 100644
--- a/README.EXT
+++ b/README.EXT
@@ -1,1511 +1 @@
-.\" README.EXT -  -*- Text -*- created at: Mon Aug  7 16:45:54 JST 1995
-
-This document explains how to make extension libraries for Ruby.
-
-1. Basic knowledge
-
-In C, variables have types and data do not have types.  In contrast,
-Ruby variables do not have a static type, and data themselves have
-types, so data will need to be converted between the languages.
-
-Data in Ruby are represented by the C type `VALUE'.  Each VALUE data
-has its data-type.
-
-To retrieve C data from a VALUE, you need to:
-
- (1) Identify the VALUE's data type
- (2) Convert the VALUE into C data
-
-Converting to the wrong data type may cause serious problems.
-
-
-1.1 Data-types
-
-The Ruby interpreter has the following data types:
-
-	T_NIL		nil
-	T_OBJECT	ordinary object
-	T_CLASS		class
-	T_MODULE	module
-	T_FLOAT		floating point number
-	T_STRING	string
-	T_REGEXP	regular expression
-	T_ARRAY		array
-	T_HASH		associative array
-	T_STRUCT	(Ruby) structure
-	T_BIGNUM	multi precision integer
-	T_FIXNUM	Fixnum(31bit or 63bit integer)
-	T_COMPLEX       complex number
-	T_RATIONAL      rational number
-	T_FILE		IO
-	T_TRUE		true
-	T_FALSE		false
-	T_DATA		data
-	T_SYMBOL        symbol
-
-In addition, there are several other types used internally:
-
-	T_ICLASS
-	T_MATCH
-	T_UNDEF
-	T_NODE
-	T_ZOMBIE
-
-Most of the types are represented by C structures.
-
-1.2 Check Data Type of the VALUE
-
-The macro TYPE() defined in ruby.h shows the data type of the VALUE.
-TYPE() returns the constant number T_XXXX described above.  To handle
-data types, your code will look something like this:
-
-  switch (TYPE(obj)) {
-    case T_FIXNUM:
-      /* process Fixnum */
-      break;
-    case T_STRING:
-      /* process String */
-      break;
-    case T_ARRAY:
-      /* process Array */
-      break;
-    default:
-      /* raise exception */
-      rb_raise(rb_eTypeError, "not valid value");
-      break;
-  }
-
-There is the data-type check function
-
-  void Check_Type(VALUE value, int type)
-
-which raises an exception if the VALUE does not have the type
-specified.
-
-There are also faster check macros for fixnums and nil.
-
-  FIXNUM_P(obj)
-  NIL_P(obj)
-
-1.3 Convert VALUE into C data
-
-The data for type T_NIL, T_FALSE, T_TRUE are nil, false, true
-respectively.  They are singletons for the data type.
-The equivalent C constants are: Qnil, Qfalse, Qtrue.
-Note that Qfalse is false in C also (i.e. 0), but not Qnil.
-
-The T_FIXNUM data is a 31bit or 63bit length fixed integer.
-This size is depend on the size of long: if long is 32bit then
-T_FIXNUM is 31bit, if long is 64bit then T_FIXNUM is 63bit.
-T_FIXNUM can be converted to a C integer by using the
-FIX2INT() macro or FIX2LONG().  Though you have to check that the
-data is really FIXNUM before using them, they are faster.  FIX2LONG()
-never raises exceptions, but FIX2INT() raises RangeError if the
-result is bigger or smaller than the size of int.
-There are also NUM2INT() and NUM2LONG() which converts any Ruby
-numbers into C integers.  These macros includes a type check,
-so an exception will be raised if the conversion failed.  NUM2DBL()
-can be used to retrieve the double float value in the same way.
-
-You can use the macros
-StringValue() and StringValuePtr() to get a char* from a VALUE.
-StringValue(var) replaces var's value with the result of "var.to_str()".
-StringValuePtr(var) does same replacement and returns char*
-representation of var.  These macros will skip the replacement if var
-is a String.  Notice that the macros take only the lvalue as their
-argument, to change the value of var in place.
-
-You can also use the macro named StringValueCStr(). This is just
-like StringValuePtr(), but always add nul character at the end of
-the result. If the result contains nul character, this macro causes
-the ArgumentError exception.
-StringValuePtr() doesn't guarantee the existence of a nul at the end
-of the result, and the result may contain nul.
-
-Other data types have corresponding C structures, e.g. struct RArray
-for T_ARRAY etc. The VALUE of the type which has the corresponding
-structure can be cast to retrieve the pointer to the struct.  The
-casting macro will be of the form RXXXX for each data type; for
-instance, RARRAY(obj).  See "ruby.h".
-
-There are some accessing macros for structure members, for example
-`RSTRING_LEN(str)' to get the size of the Ruby String object.  The
-allocated region can be accessed by `RSTRING_PTR(str)'.  For arrays,
-use `RARRAY_LEN(ary)' and `RARRAY_PTR(ary)' respectively.
-
-Notice: Do not change the value of the structure directly, unless you
-are responsible for the result.  This ends up being the cause of
-interesting bugs.
-
-1.4 Convert C data into VALUE
-
-To convert C data to Ruby values:
-
-  * FIXNUM
-
-    left shift 1 bit, and turn on LSB.
-
-  * Other pointer values
-
-    cast to VALUE.
-
-You can determine whether a VALUE is pointer or not by checking its LSB.
-
-Notice Ruby does not allow arbitrary pointer values to be a VALUE.  They
-should be pointers to the structures which Ruby knows about.  The known
-structures are defined in <ruby.h>.
-
-To convert C numbers to Ruby values, use these macros.
-
-  INT2FIX()	for integers within 31bits.
-  INT2NUM()	for arbitrary sized integer.
-
-INT2NUM() converts an integer into a Bignum if it is out of the FIXNUM
-range, but is a bit slower.
-
-1.5 Manipulating Ruby data
-
-As I already mentioned, it is not recommended to modify an object's
-internal structure.  To manipulate objects, use the functions supplied
-by the Ruby interpreter. Some (not all) of the useful functions are
-listed below:
-
- String functions
-
-  rb_str_new(const char *ptr, long len)
-
-    Creates a new Ruby string.
-
-  rb_str_new2(const char *ptr)
-  rb_str_new_cstr(const char *ptr)
-
-    Creates a new Ruby string from a C string.  This is equivalent to
-    rb_str_new(ptr, strlen(ptr)).
-
-  rb_tainted_str_new(const char *ptr, long len)
-
-    Creates a new tainted Ruby string.  Strings from external data
-    sources should be tainted.
-
-  rb_tainted_str_new2(const char *ptr)
-  rb_tainted_str_new_cstr(const char *ptr)
-
-    Creates a new tainted Ruby string from a C string.
-
-  rb_sprintf(const char *format, ...)
-  rb_vsprintf(const char *format, va_list ap)
-
-    Creates a new Ruby string with printf(3) format.
-
-  rb_str_cat(VALUE str, const char *ptr, long len)
-
-    Appends len bytes of data from ptr to the Ruby string.
-
-  rb_str_cat2(VALUE str, const char* ptr)
-
-    Appends C string ptr to Ruby string str.  This function is
-    equivalent to rb_str_cat(str, ptr, strlen(ptr)).
-
-  rb_str_catf(VALUE str, const char* format, ...)
-  rb_str_vcatf(VALUE str, const char* format, va_list ap)
-
-    Appends C string format and successive arguments to Ruby string
-    str according to a printf-like format.  These functions are
-    equivalent to rb_str_cat2(str, rb_sprintf(format, ...)) and
-    rb_str_cat2(str, rb_vsprintf(format, ap)), respectively.
-
-  rb_enc_str_new(const char *ptr, long len, rb_encoding *enc)
-
-    Creates a new Ruby string with the specified encoding.
-
-  rb_usascii_str_new(const char *ptr, long len)
-  rb_usascii_str_new_cstr(const char *ptr)
-
-    Creates a new Ruby string with encoding US-ASCII.
-
-  rb_str_resize(VALUE str, long len)
-
-    Resizes Ruby string to len bytes.  If str is not modifiable, this
-    function raises an exception.  The length of str must be set in
-    advance.  If len is less than the old length the content beyond
-    len bytes is discarded, else if len is greater than the old length
-    the content beyond the old length bytes will not be preserved but
-    will be garbage.  Note that RSTRING_PTR(str) may change by calling
-    this function.
-
-  rb_str_set_len(VALUE str, long len)
-
-    Sets the length of Ruby string.  If str is not modifiable, this
-    function raises an exception.  This function preserves the content
-    upto len bytes, regardless RSTRING_LEN(str).  len must not exceed
-    the capacity of str.
-
- Array functions
-
-  rb_ary_new()
-
-    Creates an array with no elements.
-
-  rb_ary_new2(long len)
-
-    Creates an array with no elements, allocating internal buffer
-    for len elements.
-
-  rb_ary_new3(long n, ...)
-
-    Creates an n-element array from the arguments.
-
-  rb_ary_new4(long n, VALUE *elts)
-
-    Creates an n-element array from a C array.
-
-  rb_ary_to_ary(VALUE obj)
-
-    Converts the object into an array.
-    Equivalent to Object#to_ary.
-
- There are many functions to operate an array.
- They may dump core if other types are given.
-
-  rb_ary_aref(argc, VALUE *argv, VALUE ary)
-
-    Equivaelent to Array#[].
-
-  rb_ary_entry(VALUE ary, long offset)
-
-    ary[offset]
-
-  rb_ary_subseq(VALUE ary, long beg, long len)
-
-    ary[beg, len]
-
-  rb_ary_push(VALUE ary, VALUE val)
-  rb_ary_pop(VALUE ary)
-  rb_ary_shift(VALUE ary)
-  rb_ary_unshift(VALUE ary, VALUE val)
-
-  rb_ary_cat(VALUE ary, const VALUE *ptr, long len)
-
-    Appends len elements of objects from ptr to the array.
-
-2. Extending Ruby with C
-
-2.1 Adding new features to Ruby
-
-You can add new features (classes, methods, etc.) to the Ruby
-interpreter.  Ruby provides APIs for defining the following things:
-
- * Classes, Modules
- * Methods, Singleton Methods
- * Constants
-
-2.1.1 Class/module definition
-
-To define a class or module, use the functions below:
-
-  VALUE rb_define_class(const char *name, VALUE super)
-  VALUE rb_define_module(const char *name)
-
-These functions return the newly created class or module.  You may
-want to save this reference into a variable to use later.
-
-To define nested classes or modules, use the functions below:
-
-  VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
-  VALUE rb_define_module_under(VALUE outer, const char *name)
-
-2.1.2 Method/singleton method definition
-
-To define methods or singleton methods, use these functions:
-
-  void rb_define_method(VALUE klass, const char *name,
-		        VALUE (*func)(), int argc)
-
-  void rb_define_singleton_method(VALUE object, const char *name,
-			          VALUE (*func)(), int argc)
-
-The `argc' represents the number of the arguments to the C function,
-which must be less than 17.  But I doubt you'll need that many.
-
-If `argc' is negative, it specifies the calling sequence, not number of
-the arguments.
-
-If argc is -1, the function will be called as:
-
-  VALUE func(int argc, VALUE *argv, VALUE obj)
-
-where argc is the actual number of arguments, argv is the C array of
-the arguments, and obj is the receiver.
-
-If argc is -2, the arguments are passed in a Ruby array. The function
-will be called like:
-
-  VALUE func(VALUE obj, VALUE args)
-
-where obj is the receiver, and args is the Ruby array containing
-actual arguments.
-
-There are some more functions to define methods. One takes an ID
-as the name of method to be defined. See 2.2.2 for IDs.
-
-  void rb_define_method_id(VALUE klass, ID name,
-                           VALUE (*func)(ANYARGS), int argc)
-
-There are two functions to define private/protected methods:
-
-  void rb_define_private_method(VALUE klass, const char *name,
-			        VALUE (*func)(), int argc)
-  void rb_define_protected_method(VALUE klass, const char *name,
-			          VALUE (*func)(), int argc)
-
-At last, rb_define_module_function defines a module functions,
-which are private AND singleton methods of the module.
-For example, sqrt is the module function defined in Math module.
-It can be called in the following way:
-
-  Math.sqrt(4)
-
-or
-
-  include Math
-  sqrt(4)
-
-To define module functions, use:
-
-  void rb_define_module_function(VALUE module, const char *name,
-				 VALUE (*func)(), int argc)
-
-In addition, function-like methods, which are private methods defined
-in the Kernel module, can be defined using:
-
-  void rb_define_global_function(const char *name, VALUE (*func)(), int argc)
-
-To define an alias for the method,
-
-  void rb_define_alias(VALUE module, const char* new, const char* old);
-
-To define a reader/writer for an attribute,
-
-  void rb_define_attr(VALUE klass, const char *name, int read, int write)
-
-To define and undefine the `allocate' class method,
-
-  void rb_define_alloc_func(VALUE klass, VALUE (*func)(VALUE klass));
-  void rb_undef_alloc_func(VALUE klass);
-
-func has to take the klass as the argument and return a newly
-allocated instance.  This instance should be as empty as possible,
-without any expensive (including external) resources.
-
-2.1.3 Constant definition
-
-We have 2 functions to define constants:
-
-  void rb_define_const(VALUE klass, const char *name, VALUE val)
-  void rb_define_global_const(const char *name, VALUE val)
-
-The former is to define a constant under specified class/module.  The
-latter is to define a global constant.
-
-2.2 Use Ruby features from C
-
-There are several ways to invoke Ruby's features from C code.
-
-2.2.1 Evaluate Ruby Programs in a String
-
-The easiest way to use Ruby's functionality from a C program is to
-evaluate the string as Ruby program.  This function will do the job:
-
-  VALUE rb_eval_string(const char *str)
-
-Evaluation is done under the current context, thus current local variables
-of the innermost method (which is defined by Ruby) can be accessed.
-
-Note that the evaluation can raise an exception. There is a safer
-function:
-
-  VALUE rb_eval_string_protect(const char *str, int *state)
-
-It returns nil when an error occur. Moreover, *state is zero if str was
-successfully evaluated, or nonzero otherwise.
-
-
-2.2.2 ID or Symbol
-
-You can invoke methods directly, without parsing the string.  First I
-need to explain about ID.  ID is the integer number to represent
-Ruby's identifiers such as variable names.  The Ruby data type
-corresponding to ID is Symbol.  It can be accessed from Ruby in the
-form:
-
- :Identifier
-or
- :"any kind of string"
-
-You can get the ID value from a string within C code by using
-
-  rb_intern(const char *name)
-  rb_intern_str(VALUE name)
-
-You can retrieve ID from Ruby object (Symbol or String) given as an
-argument by using
-
-  rb_to_id(VALUE symbol)
-  rb_check_id(volatile VALUE *name)
-
-These functions try to convert the argument to a String if it was not
-a Symbol nor a String.  The latter function stores the converted
-result into *name, and returns 0 if the string is not a known symbol.
-After this function returned a non-zero value, *name is always a
-Symbol or a String, otherwise it is a String if the result is 0.
-
-You can convert C ID to Ruby Symbol by using
-
-  VALUE ID2SYM(ID id)
-
-and to convert Ruby Symbol object to ID, use
-
-  ID SYM2ID(VALUE symbol)
-
-2.2.3 Invoke Ruby method from C
-
-To invoke methods directly, you can use the function below
-
-  VALUE rb_funcall(VALUE recv, ID mid, int argc, ...)
-
-This function invokes a method on the recv, with the method name
-specified by the symbol mid.
-
-2.2.4 Accessing the variables and constants
-
-You can access class variables and instance variables using access
-functions.  Also, global variables can be shared between both
-environments.  There's no way to access Ruby's local variables.
-
-The functions to access/modify instance variables are below:
-
-  VALUE rb_ivar_get(VALUE obj, ID id)
-  VALUE rb_ivar_set(VALUE obj, ID id, VALUE val)
-
-id must be the symbol, which can be retrieved by rb_intern().
-
-To access the constants of the class/module:
-
-  VALUE rb_const_get(VALUE obj, ID id)
-
-See 2.1.3 for defining new constant.
-
-3. Information sharing between Ruby and C
-
-3.1 Ruby constants that C can be accessed from C
-
-As stated in section 1.3,
-the following Ruby constants can be referred from C.
-
-  Qtrue
-  Qfalse
-
-Boolean values.  Qfalse is false in C also (i.e. 0).
-
-  Qnil
-
-Ruby nil in C scope.
-
-3.2 Global variables shared between C and Ruby
-
-Information can be shared between the two environments using shared global
-variables.  To define them, you can use functions listed below:
-
-  void rb_define_variable(const char *name, VALUE *var)
-
-This function defines the variable which is shared by both environments.
-The value of the global variable pointed to by `var' can be accessed
-through Ruby's global variable named `name'.
-
-You can define read-only (from Ruby, of course) variables using the
-function below.
-
-  void rb_define_readonly_variable(const char *name, VALUE *var)
-
-You can defined hooked variables.  The accessor functions (getter and
-setter) are called on access to the hooked variables.
-
-  void rb_define_hooked_variable(const char *name, VALUE *var,
-				 VALUE (*getter)(), void (*setter)())
-
-If you need to supply either setter or getter, just supply 0 for the
-hook you don't need.  If both hooks are 0, rb_define_hooked_variable()
-works just like rb_define_variable().
-
-The prototypes of the getter and setter functions are as follows:
-
-  VALUE (*getter)(ID id, VALUE *var);
-  void (*setter)(VALUE val, ID id, VALUE *var);
-
-
-Also you can define a Ruby global variable without a corresponding C
-variable.  The value of the variable will be set/get only by hooks.
-
-  void rb_define_virtual_variable(const char *name,
-				  VALUE (*getter)(), void (*setter)())
-
-The prototypes of the getter and setter functions are as follows:
-
-  VALUE (*getter)(ID id);
-  void (*setter)(VALUE val, ID id);
-
-
-3.3 Encapsulate C data into a Ruby object
-
-To wrap and objectify a C pointer as a Ruby object (so called
-DATA), use Data_Wrap_Struct().
-
-  Data_Wrap_Struct(klass, mark, free, ptr)
-
-Data_Wrap_Struct() returns a created DATA object.  The klass argument
-is the class for the DATA object.  The mark argument is the function
-to mark Ruby objects pointed by this data.  The free argument is the
-function to free the pointer allocation.  If this is -1, the pointer
-will be just freed.  The functions mark and free will be called from
-garbage collector.
-
-These mark / free functions are invoked during GC execution.  No
-object allocations are allowed during it, so do not allocate ruby
-objects inside them.
-
-You can allocate and wrap the structure in one step.
-
-  Data_Make_Struct(klass, type, mark, free, sval)
-
-This macro returns an allocated Data object, wrapping the pointer to
-the structure, which is also allocated.  This macro works like:
-
-  (sval = ALLOC(type), Data_Wrap_Struct(klass, mark, free, sval))
-
-Arguments klass, mark, and free work like their counterparts in
-Data_Wrap_Struct().  A pointer to the allocated structure will be
-assigned to sval, which should be a pointer of the type specified.
-
-To retrieve the C pointer from the Data object, use the macro
-Data_Get_Struct().
-
-  Data_Get_Struct(obj, type, sval)
-
-A pointer to the structure will be assigned to the variable sval.
-
-See the example below for details.
-
-4. Example - Creating dbm extension
-
-OK, here's the example of making an extension library.  This is the
-extension to access DBMs.  The full source is included in the ext/
-directory in the Ruby's source tree.
-
-(1) make the directory
-
-  % mkdir ext/dbm
-
-Make a directory for the extension library under ext directory.
-
-(2) design the library
-
-You need to design the library features, before making it.
-
-(3) write C code.
-
-You need to write C code for your extension library.  If your library
-has only one source file, choosing ``LIBRARY.c'' as a file name is
-preferred.  On the other hand, in case your library has multiple source
-files, avoid choosing ``LIBRARY.c'' for a file name.  It may conflict
-with an intermediate file ``LIBRARY.o'' on some platforms.
-Note that some functions in mkmf library described below generate
-a file ``conftest.c'' for checking with compilation.  You shouldn't
-choose ``conftest.c'' as a name of a source file.
-
-Ruby will execute the initializing function named ``Init_LIBRARY'' in
-the library.  For example, ``Init_dbm()'' will be executed when loading
-the library.
-
-Here's the example of an initializing function.
-
---
-void
-Init_dbm(void)
-{
-    /* define DBM class */
-    cDBM = rb_define_class("DBM", rb_cObject);
-    /* DBM includes Enumerate module */
-    rb_include_module(cDBM, rb_mEnumerable);
-
-    /* DBM has class method open(): arguments are received as C array */
-    rb_define_singleton_method(cDBM, "open", fdbm_s_open, -1);
-
-    /* DBM instance method close(): no args */
-    rb_define_method(cDBM, "close", fdbm_close, 0);
-    /* DBM instance method []: 1 argument */
-    rb_define_method(cDBM, "[]", fdbm_fetch, 1);
-		:
-
-    /* ID for a instance variable to store DBM data */
-    id_dbm = rb_intern("dbm");
-}
---
-
-The dbm extension wraps the dbm struct in the C environment using
-Data_Make_Struct.
-
---
-struct dbmdata {
-    int  di_size;
-    DBM *di_dbm;
-};
-
-
-obj = Data_Make_Struct(klass, struct dbmdata, 0, free_dbm, dbmp);
---
-
-This code wraps the dbmdata structure into a Ruby object.  We avoid
-wrapping DBM* directly, because we want to cache size information.
-
-To retrieve the dbmdata structure from a Ruby object, we define the
-following macro:
-
---
-#define GetDBM(obj, dbmp) {\
-    Data_Get_Struct(obj, struct dbmdata, dbmp);\
-    if (dbmp->di_dbm == 0) closed_dbm();\
-}
---
-
-This sort of complicated macro does the retrieving and close checking for
-the DBM.
-
-There are three kinds of way to receive method arguments.  First,
-methods with a fixed number of arguments receive arguments like this:
-
---
-static VALUE
-fdbm_delete(VALUE obj, VALUE keystr)
-{
-	:
-}
---
-
-The first argument of the C function is the self, the rest are the
-arguments to the method.
-
-Second, methods with an arbitrary number of arguments receive
-arguments like this:
-
---
-static VALUE
-fdbm_s_open(int argc, VALUE *argv, VALUE klass)
-{
-	:
-    if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) {
-	mode = 0666;		/* default value */
-    }
-	:
-}
---
-
-The first argument is the number of method arguments, the second
-argument is the C array of the method arguments, and the third
-argument is the receiver of the method.
-
-You can use the function rb_scan_args() to check and retrieve the
-arguments.  The third argument is a string that specifies how to
-capture method arguments and assign them to the following VALUE
-references.
-
-
-The following is an example of a method that takes arguments by Ruby's
-array:
-
---
-static VALUE
-thread_initialize(VALUE thread, VALUE args)
-{
-	:
-}
---
-
-The first argument is the receiver, the second one is the Ruby array
-which contains the arguments to the method.
-
-** Notice
-
-GC should know about global variables which refer to Ruby's objects, but
-are not exported to the Ruby world.  You need to protect them by
-
-  void rb_global_variable(VALUE *var)
-
-(4) prepare extconf.rb
-
-If the file named extconf.rb exists, it will be executed to generate
-Makefile.
-
-extconf.rb is the file for checking compilation conditions etc.  You
-need to put
-
-  require 'mkmf'
-
-at the top of the file.  You can use the functions below to check
-various conditions.
-
-  have_macro(macro[, headers[, opt]]): check whether macro is defined
-  have_library(lib[, func[, headers[, opt]]]): check whether library containing function exists
-  find_library(lib[, func, *paths]): find library from paths
-  have_func(func[, headers[, opt]): check whether function exists
-  have_var(var[, headers[, opt]]): check whether variable exists
-  have_header(header[, preheaders[, opt]]): check whether header file exists
-  find_header(header, *paths): find header from paths
-  have_framework(fw): check whether framework exists (for MacOS X)
-  have_struct_member(type, member[, headers]): check whether struct has member
-  have_type(type[, headers[, opt]]): check whether type exists
-  find_type(type, opt, *headers): check whether type exists in headers
-  have_const(const[, headers[, opt]]): check whether constant is defined
-  check_sizeof(type[, headers[, opts]]): check size of type
-  check_signedness(type[, headers[, opts]]): check signedness of type
-  convertible_int(type[, headers[, opts]]): find convertible integer type
-  find_executable(bin[, path]): find excutable file path
-  create_header(header): generate configured header
-  create_makefile(target): generate Makefile
-
-The value of the variables below will affect the Makefile.
-
-  $CFLAGS: included in CFLAGS make variable (such as -O)
-  $CPPFLAGS: included in CPPFLAGS make variable (such as -I, -D)
-  $LDFLAGS: included in LDFLAGS make variable (such as -L)
-  $objs: list of object file names
-
-Normally, the object files list is automatically generated by searching
-source files, but you must define them explicitly if any sources will
-be generated while building.
-
-If a compilation condition is not fulfilled, you should not call
-``create_makefile''.  The Makefile will not be generated, compilation will
-not be done.
-
-(5) prepare depend (optional)
-
-If the file named depend exists, Makefile will include that file to
-check dependencies.  You can make this file by invoking
-
-  % gcc -MM *.c > depend
-
-It's harmless.  Prepare it.
-
-(6) generate Makefile
-
-Try generating the Makefile by:
-
-  ruby extconf.rb
-
-If the library should be installed under vendor_ruby directory
-instead of site_ruby directory, use --vendor option as follows.
-
-  ruby extconf.rb --vendor
-
-You don't need this step if you put the extension library under the ext
-directory of the ruby source tree.  In that case, compilation of the
-interpreter will do this step for you.
-
-(7) make
-
-Type
-
-  make
-
-to compile your extension.  You don't need this step either if you have
-put the extension library under the ext directory of the ruby source tree.
-
-(8) debug
-
-You may need to rb_debug the extension.  Extensions can be linked
-statically by adding the directory name in the ext/Setup file so that
-you can inspect the extension with the debugger.
-
-(9) done, now you have the extension library
-
-You can do anything you want with your library.  The author of Ruby
-will not claim any restrictions on your code depending on the Ruby API.
-Feel free to use, modify, distribute or sell your program.
-
-Appendix A. Ruby source files overview
-
-ruby language core
-
-  class.c         : classes and modules
-  error.c         : exception classes and exception mechanism
-  gc.c            : memory management
-  load.c          : library loading
-  object.c        : objects
-  variable.c      : variables and constants
-
-ruby syntax parser
-  parse.y
-    -> parse.c    : automatically generated
-  keywords        : reserved keywords
-    -> lex.c      : automatically generated
-
-ruby evaluator (a.k.a. YARV)
-  compile.c
-  eval.c
-  eval_error.c
-  eval_jump.c
-  eval_safe.c
-  insns.def           : definition of VM instructions
-  iseq.c              : implementation of VM::ISeq
-  thread.c            : thread management and context swiching
-  thread_win32.c      : thread implementation
-  thread_pthread.c    : ditto
-  vm.c
-  vm_dump.c
-  vm_eval.c
-  vm_exec.c
-  vm_insnhelper.c
-  vm_method.c
-
-  opt_insns_unif.def  : instruction unification
-  opt_operand.def     : definitions for optimization
-
-    -> insn*.inc      : automatically generated
-    -> opt*.inc       : automatically generated
-    -> vm.inc         : automatically generated
-
-regular expression engine (oniguruma)
-  regex.c
-  regcomp.c
-  regenc.c
-  regerror.c
-  regexec.c
-  regparse.c
-  regsyntax.c
-
-utility functions
-
-  debug.c       : debug symbols for C debuggger
-  dln.c         : dynamic loading
-  st.c          : general purpose hash table
-  strftime.c    : formatting times
-  util.c        : misc utilities
-
-ruby interpreter implementation
-
-  dmyext.c
-  dmydln.c
-  dmyencoding.c
-  id.c
-  inits.c
-  main.c
-  ruby.c
-  version.c
-
-  gem_prelude.rb
-  prelude.rb
-
-
-class library
-
-  array.c       : Array
-  bignum.c      : Bignum
-  compar.c      : Comparable
-  complex.c     : Complex
-  cont.c        : Fiber, Continuation
-  dir.c         : Dir
-  enum.c        : Enumerable
-  enumerator.c  : Enumerator
-  file.c        : File
-  hash.c        : Hash
-  io.c          : IO
-  marshal.c     : Marshal
-  math.c        : Math
-  numeric.c     : Numeric, Integer, Fixnum, Float
-  pack.c        : Array#pack, String#unpack
-  proc.c        : Binding, Proc
-  process.c     : Process
-  random.c      : random number
-  range.c       : Range
-  rational.c    : Rational
-  re.c          : Regexp, MatchData
-  signal.c      : Signal
-  sprintf.c     :
-  string.c      : String
-  struct.c      : Struct
-  time.c        : Time
-
-  defs/known_errors.def  : Errno::* exception classes
-    -> known_errors.inc  : automatically generated
-
-multilingualization
-  encoding.c    : Encoding
-  transcode.c   : Encoding::Converter
-  enc/*.c       : encoding classes
-  enc/trans/*   : codepoint mapping tables
-
-goruby interpreter implementation
-
-  goruby.c
-  golf_prelude.rb     : goruby specific libraries.
-    -> golf_prelude.c : automatically generated
-
-
-Appendix B. Ruby extension API reference
-
-** Types
-
- VALUE
-
-The type for the Ruby object.  Actual structures are defined in ruby.h,
-such as struct RString, etc.  To refer the values in structures, use
-casting macros like RSTRING(obj).
-
-** Variables and constants
-
- Qnil
-
-const: nil object
-
- Qtrue
-
-const: true object(default true value)
-
- Qfalse
-
-const: false object
-
-** C pointer wrapping
-
- Data_Wrap_Struct(VALUE klass, void (*mark)(), void (*free)(), void *sval)
-
-Wrap a C pointer into a Ruby object.  If object has references to other
-Ruby objects, they should be marked by using the mark function during
-the GC process.  Otherwise, mark should be 0.  When this object is no
-longer referred by anywhere, the pointer will be discarded by free
-function.
-
- Data_Make_Struct(klass, type, mark, free, sval)
-
-This macro allocates memory using malloc(), assigns it to the variable
-sval, and returns the DATA encapsulating the pointer to memory region.
-
- Data_Get_Struct(data, type, sval)
-
-This macro retrieves the pointer value from DATA, and assigns it to
-the variable sval.
-
-** Checking data types
-
-TYPE(value)
-FIXNUM_P(value)
-NIL_P(value)
-void Check_Type(VALUE value, int type)
-void Check_SafeStr(VALUE value)
-
-** Data type conversion
-
-FIX2INT(value), INT2FIX(i)
-FIX2LONG(value), LONG2FIX(l)
-NUM2INT(value), INT2NUM(i)
-NUM2UINT(value), UINT2NUM(ui)
-NUM2LONG(value), LONG2NUM(l)
-NUM2ULONG(value), ULONG2NUM(ul)
-NUM2LL(value), LL2NUM(ll)
-NUM2ULL(value), ULL2NUM(ull)
-NUM2OFFT(value), OFFT2NUM(off)
-NUM2SIZET(value), SIZET2NUM(size)
-NUM2SSIZET(value), SSIZET2NUM(ssize)
-NUM2DBL(value)
-rb_float_new(f)
-StringValue(value)
-StringValuePtr(value)
-StringValueCStr(value)
-rb_str_new2(s)
-
-** defining class/module
-
- VALUE rb_define_class(const char *name, VALUE super)
-
-Defines a new Ruby class as a subclass of super.
-
- VALUE rb_define_class_under(VALUE module, const char *name, VALUE super)
-
-Creates a new Ruby class as a subclass of super, under the module's
-namespace.
-
- VALUE rb_define_module(const char *name)
-
-Defines a new Ruby module.
-
- VALUE rb_define_module_under(VALUE module, const char *name)
-
-Defines a new Ruby module under the module's namespace.
-
- void rb_include_module(VALUE klass, VALUE module)
-
-Includes module into class.  If class already includes it, just
-ignored.
-
- void rb_extend_object(VALUE object, VALUE module)
-
-Extend the object with the module's attributes.
-
-** Defining Global Variables
-
- void rb_define_variable(const char *name, VALUE *var)
-
-Defines a global variable which is shared between C and Ruby.  If name
-contains a character which is not allowed to be part of the symbol,
-it can't be seen from Ruby programs.
-
- void rb_define_readonly_variable(const char *name, VALUE *var)
-
-Defines a read-only global variable.  Works just like
-rb_define_variable(), except the defined variable is read-only.
-
- void rb_define_virtual_variable(const char *name,
-				 VALUE (*getter)(), VALUE (*setter)())
-
-Defines a virtual variable, whose behavior is defined by a pair of C
-functions.  The getter function is called when the variable is
-referenced.  The setter function is called when the variable is set to a
-value.  The prototype for getter/setter functions are:
-
-	VALUE getter(ID id)
-	void setter(VALUE val, ID id)
-
-The getter function must return the value for the access.
-
- void rb_define_hooked_variable(const char *name, VALUE *var,
-				VALUE (*getter)(), VALUE (*setter)())
-
-Defines hooked variable.  It's a virtual variable with a C variable.
-The getter is called as
-
-	VALUE getter(ID id, VALUE *var)
-
-returning a new value.  The setter is called as
-
-	void setter(VALUE val, ID id, VALUE *var)
-
-GC requires C global variables which hold Ruby values to be marked.
-
- void rb_global_variable(VALUE *var)
-
-Tells GC to protect these variables.
-
-** Constant Definition
-
- void rb_define_const(VALUE klass, const char *name, VALUE val)
-
-Defines a new constant under the class/module.
-
- void rb_define_global_const(const char *name, VALUE val)
-
-Defines a global constant.  This is just the same as
-
-     rb_define_const(cKernal, name, val)
-
-** Method Definition
-
- rb_define_method(VALUE klass, const char *name, VALUE (*func)(), int argc)
-
-Defines a method for the class.  func is the function pointer.  argc
-is the number of arguments.  if argc is -1, the function will receive
-3 arguments: argc, argv, and self.  if argc is -2, the function will
-receive 2 arguments, self and args, where args is a Ruby array of
-the method arguments.
-
- rb_define_private_method(VALUE klass, const char *name, VALUE (*func)(), int argc)
-
-Defines a private method for the class.  Arguments are same as
-rb_define_method().
-
- rb_define_singleton_method(VALUE klass, const char *name, VALUE (*func)(), int argc)
-
-Defines a singleton method.  Arguments are same as rb_define_method().
-
- rb_scan_args(int argc, VALUE *argv, const char *fmt, ...)
-
-Retrieve argument from argc and argv to given VALUE references
-according to the format string.  The format can be described in ABNF
-as follows:
-
---
-scan-arg-spec  := param-arg-spec [option-hash-arg-spec] [block-arg-spec]
-
-param-arg-spec := pre-arg-spec [post-arg-spec] / post-arg-spec / pre-opt-post-arg-spec
-pre-arg-spec   := num-of-leading-mandatory-args [num-of-optional-args]
-post-arg-spec  := sym-for-variable-length-args [num-of-trailing-mandatory-args]
-pre-opt-post-arg-spec := num-of-leading-mandatory-args num-of-optional-args num-of-trailing-mandatory-args
-option-hash-arg-spec := sym-for-option-hash-arg
-block-arg-spec := sym-for-block-arg
-
-num-of-leading-mandatory-args  := DIGIT ; The number of leading
-                                        ; mandatory arguments
-num-of-optional-args           := DIGIT ; The number of optional
-                                        ; arguments
-sym-for-variable-length-args   := "*"   ; Indicates that variable
-                                        ; length arguments are
-                                        ; captured as a ruby array
-num-of-trailing-mandatory-args := DIGIT ; The number of trailing
-                                        ; mandatory arguments
-sym-for-option-hash-arg        := ":"   ; Indicates that an option
-                                        ; hash is captured if the last
-                                        ; argument is a hash or can be
-                                        ; converted to a hash with
-                                        ; #to_hash.  When the last
-                                        ; argument is nil, it is
-                                        ; captured if it is not
-                                        ; ambiguous to take it as
-                                        ; empty option hash; i.e. '*'
-                                        ; is not specified and
-                                        ; arguments are given more
-                                        ; than sufficient.
-sym-for-block-arg              := "&"   ; Indicates that an iterator
-                                        ; block should be captured if
-                                        ; given
---
-
-For example, "12" means that the method requires at least one
-argument, and at most receives three (1+2) arguments.  So, the format
-string must be followed by three variable references, which are to be
-assigned to captured arguments.  For omitted arguments, variables are
-set to Qnil.  NULL can be put in place of a variable reference, which
-means the corresponding captured argument(s) should be just dropped.
-
-The number of given arguments, excluding an option hash or iterator
-block, is returned.
-
-** Invoking Ruby method
-
- VALUE rb_funcall(VALUE recv, ID mid, int narg, ...)
-
-Invokes a method.  To retrieve mid from a method name, use rb_intern().
-
- VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv)
-
-Invokes a method, passing arguments by an array of values.
-
- VALUE rb_eval_string(const char *str)
-
-Compiles and executes the string as a Ruby program.
-
- ID rb_intern(const char *name)
-
-Returns ID corresponding to the name.
-
- char *rb_id2name(ID id)
-
-Returns the name corresponding ID.
-
- char *rb_class2name(VALUE klass)
-
-Returns the name of the class.
-
- int rb_respond_to(VALUE object, ID id)
-
-Returns true if the object responds to the message specified by id.
-
-** Instance Variables
-
- VALUE rb_iv_get(VALUE obj, const char *name)
-
-Retrieve the value of the instance variable.  If the name is not
-prefixed by `@', that variable shall be inaccessible from Ruby.
-
- VALUE rb_iv_set(VALUE obj, const char *name, VALUE val)
-
-Sets the value of the instance variable.
-
-** Control Structure
-
- VALUE rb_block_call(VALUE recv, ID mid, int argc, VALUE * argv,
-		     VALUE (*func) (ANYARGS), VALUE data2)
-
-Calls a method on the recv, with the method name specified by the
-symbol mid, with argc arguments in argv, supplying func as the
-block. When func is called as the block, it will receive the value
-from yield as the first argument, and data2 as the second argument.
-When yielded with multiple values (in C, rb_yield_values(),
-rb_yield_values2() and rb_yield_splat()), data2 is packed as an Array,
-whereas yielded values can be gotten via argc/argv of the third/fourth
-arguments.
-
- [OBSOLETE] VALUE rb_iterate(VALUE (*func1)(), void *arg1, VALUE (*func2)(), void *arg2)
-
-Calls the function func1, supplying func2 as the block.  func1 will be
-called with the argument arg1.  func2 receives the value from yield as
-the first argument, arg2 as the second argument.
-
-When rb_iterate is used in 1.9, func1 has to call some Ruby-level method.
-This function is obsolete since 1.9; use rb_block_call instead.
-
- VALUE rb_yield(VALUE val)
-
-Evaluates the block with value val.
-
- VALUE rb_rescue(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2)
-
-Calls the function func1, with arg1 as the argument.  If an exception
-occurs during func1, it calls func2 with arg2 as the argument.  The
-return value of rb_rescue() is the return value from func1 if no
-exception occurs, from func2 otherwise.
-
- VALUE rb_ensure(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2)
-
-Calls the function func1 with arg1 as the argument, then calls func2
-with arg2 if execution terminated.  The return value from
-rb_ensure() is that of func1 when no exception occured.
-
- VALUE rb_protect(VALUE (*func) (VALUE), VALUE arg, int *state)
-
-Calls the function func with arg as the argument.  If no exception
-occured during func, it returns the result of func and *state is zero.
-Otherwise, it returns Qnil and sets *state to nonzero.  If state is
-NULL, it is not set in both cases.
-You have to clear the error info with rb_set_errinfo(Qnil) when
-ignoring the caught exception.
-
- void rb_jump_tag(int state)
-
-Continues the exception caught by rb_protect() and rb_eval_string_protect().
-state must be the returned value from those functions.  This function
-never return to the caller.
-
- void rb_iter_break()
-
-Exits from the current innermost block.  This function never return to
-the caller.
-
- void rb_iter_break_value(VALUE value)
-
-Exits from the current innermost block with the value.  The block will
-return the given argument value.  This function never return to the
-caller.
-
-** Exceptions and Errors
-
- void rb_warn(const char *fmt, ...)
-
-Prints a warning message according to a printf-like format.
-
- void rb_warning(const char *fmt, ...)
-
-Prints a warning message according to a printf-like format, if
-$VERBOSE is true.
-
-void rb_raise(rb_eRuntimeError, const char *fmt, ...)
-
-Raises RuntimeError.  The fmt is a format string just like printf().
-
- void rb_raise(VALUE exception, const char *fmt, ...)
-
-Raises a class exception.  The fmt is a format string just like printf().
-
- void rb_fatal(const char *fmt, ...)
-
-Raises a fatal error, terminates the interpreter.  No exception handling
-will be done for fatal errors, but ensure blocks will be executed.
-
- void rb_bug(const char *fmt, ...)
-
-Terminates the interpreter immediately.  This function should be
-called under the situation caused by the bug in the interpreter.  No
-exception handling nor ensure execution will be done.
-
-** Initialize and Start the Interpreter
-
-The embedding API functions are below (not needed for extension libraries):
-
- void ruby_init()
-
-Initializes the interpreter.
-
- void ruby_options(int argc, char **argv)
-
-Process command line arguments for the interpreter.
-
- void ruby_run()
-
-Starts execution of the interpreter.
-
- void ruby_script(char *name)
-
-Specifies the name of the script ($0).
-
-** Hooks for the Interpreter Events
-
- void rb_add_event_hook(rb_event_hook_func_t func, rb_event_flag_t events, VALUE data)
-
-Adds a hook function for the specified interpreter events.
-events should be Or'ed value of:
-
-	RUBY_EVENT_LINE
-	RUBY_EVENT_CLASS
-	RUBY_EVENT_END
-	RUBY_EVENT_CALL
-	RUBY_EVENT_RETURN
-	RUBY_EVENT_C_CALL
-	RUBY_EVENT_C_RETURN
-	RUBY_EVENT_RAISE
-	RUBY_EVENT_ALL
-
-The definition of rb_event_hook_func_t is below:
-
- typedef void (*rb_event_hook_func_t)(rb_event_t event, VALUE data,
- 				      VALUE self, ID id, VALUE klass)
-
-The third argument `data' to rb_add_event_hook() is passed to the hook
-function as the second argument, which was the pointer to the current
-NODE in 1.8.  See RB_EVENT_HOOKS_HAVE_CALLBACK_DATA below.
-
- int rb_remove_event_hook(rb_event_hook_func_t func)
-
-Removes the specified hook function.
-
-** Macros for the Compatibilities
-
-Some macros to check API compatibilities are available by default.
-
- NORETURN_STYLE_NEW
-
-Means that NORETURN macro is functional style instead of prefix.
-
- HAVE_RB_DEFINE_ALLOC_FUNC
-
-Means that function rb_define_alloc_func() is provided, that means the
-allocation framework is used.  This is same as the result of
-have_func("rb_define_alloc_func", "ruby.h").
-
- HAVE_RB_REG_NEW_STR
-
-Means that function rb_reg_new_str() is provided, that creates Regexp
-object from String object.  This is same as the result of
-have_func("rb_reg_new_str", "ruby.h").
-
- HAVE_RB_IO_T
-
-Means that type rb_io_t is provided.
-
- USE_SYMBOL_AS_METHOD_NAME
-
-Means that Symbols will be returned as method names, e.g.,
-Module#methods, #singleton_methods and so on.
-
- HAVE_RUBY_*_H
-
-Defined in ruby.h and means correspoinding header is available.  For
-instance, when HAVE_RUBY_ST_H is defined you should use ruby/st.h not
-mere st.h.
-
- RB_EVENT_HOOKS_HAVE_CALLBACK_DATA
-
-Means that rb_add_event_hook() takes the third argument `data', to be
-passed to the given event hook function.
-
-Appendix C. Functions Available in extconf.rb
-
-These functions are available in extconf.rb:
-
- have_macro(macro, headers, opt)
-
-Checks whether macro is defined with header.  Returns true if the macro
-is defined.
-
- have_library(lib, func, opt)
-
-Checks whether the library exists, containing the specified function.
-Returns true if the library exists.
-
- find_library(lib, func, path...)
-
-Checks whether a library which contains the specified function exists in
-path.  Returns true if the library exists.
-
- have_func(func, headers, opt)
-
-Checks whether func exists with header.  Returns true if the function
-exists.  To check functions in an additional library, you need to
-check that library first using have_library().
-The func shall be either mere function name or function name with
-arguments.
-Example:
-    have_func("LONG2NUM(0)")
-
- have_var(var, header, opt)
-
-Checks whether var exists with header.  Returns true if the variable
-exists.  To check variables in an additional library, you need to
-check that library first using have_library().
-
- have_header(header, preheaders, opt)
-
-Checks whether header exists.  Returns true if the header file exists.
-
- find_header(header, path...)
-
-Checks whether header exists in path.  Returns true if the header file
-exists.
-
- have_struct_member(type, member, headers, opt)
-
-Checks whether type has member with header.  Returns true if the type
-is defined and has the member.
-
- have_type(type, headers, opt)
-
-Checks whether type is defined with header.  Returns true if the type
-is defined.
-
- check_sizeof(type, header)
-
-Checks the size of type in char with header.  Returns the size if the
-type is defined, otherwise nil.
-
- create_makefile(target)
-
-Generates the Makefile for the extension library.  If you don't invoke
-this method, the compilation will not be done.
-
- find_executable(bin, path)
-
-Finds command in path, which is File::PATH_SEPARATOR-separated list of
-directories.  If path is nil or omitted, environment variable PATH
-will be used.  Returns the path name of the command if it is found,
-otherwise nil.
-
- with_config(withval[, default=nil])
-
-Parses the command line options and returns the value specified by
---with-<withval>.
-
- enable_config(config, *defaults)
- disable_config(config, *defaults)
-
-Parses the command line options for boolean.  Returns true if
---enable-<config> is given, or false if --disable-<config> is given.
-Otherwise, yields defaults to the given block and returns the result
-if it is called with a block, or returns defaults.
-
- dir_config(target[, default_dir])
- dir_config(target[, default_include, default_lib])
-
-Parses the command line options and adds the directories specified by
---with-<target>-dir, --with-<target>-include, and/or --with-<target>-lib
-to $CFLAGS and/or $LDFLAGS.  --with-<target>-dir=/path is equivalent to
---with-<target>-include=/path/include --with-<target>-lib=/path/lib.
-Returns an array of the added directories ([include_dir, lib_dir]).
-
- pkg_config(pkg)
-
-Obtains the information for pkg by pkg-config command.  The actual
-command name can be overridden by --with-pkg-config command line
-option.
-
-/*
- * Local variables:
- * fill-column: 70
- * end:
- */
+Moved to doc/extension.rdoc
diff --git a/README.EXT.ja b/README.EXT.ja
index 6b0cb11757..f884ecbb0e 100644
--- a/README.EXT.ja
+++ b/README.EXT.ja
@@ -1,1594 +1 @@
-.\" README.EXT.ja -  -*- Text -*- created at: Mon Aug  7 16:45:54 JST 1995
-
-Rubyの拡張ライブラリの作り方を説明します．
-
-1．基礎知識
-
-Cの変数には型があり，データには型がありません．ですから，た
-とえばポインタをintの変数に代入すると，その値は整数として取
-り扱われます．逆にRubyの変数には型がなく，データに型がありま
-す．この違いのため，CとRubyは相互に変換しなければ，お互いの
-データをアクセスできません．
-
-RubyのデータはVALUEというCの型で表現されます．VALUE型のデー
-タはそのデータタイプを自分で知っています．このデータタイプと
-いうのはデータ(オブジェクト)の実際の構造を意味していて，Ruby
-のクラスとはまた違ったものです．
-
-VALUEからCにとって意味のあるデータを取り出すためには
-
- (1) VALUEのデータタイプを知る
- (2) VALUEをCのデータに変換する
-
-の両方が必要です．(1)を忘れると間違ったデータの変換が行われ
-て，最悪プログラムがcore dumpします．
-
-1.1 データタイプ
-
-Rubyにはユーザが使う可能性のある以下のタイプがあります．
-
-	T_NIL		nil
-	T_OBJECT	通常のオブジェクト
-	T_CLASS		クラス
-	T_MODULE	モジュール
-	T_FLOAT		浮動小数点数
-	T_STRING	文字列
-	T_REGEXP	正規表現
-	T_ARRAY		配列
-	T_HASH		連想配列
-	T_STRUCT	(Rubyの)構造体
-	T_BIGNUM	多倍長整数
-	T_FIXNUM	Fixnum(31bitまたは63bit長整数)
-	T_COMPLEX	複素数
-	T_RATIONAL	有理数
-	T_FILE		入出力
-	T_TRUE		真
-	T_FALSE		偽
-	T_DATA		データ
-	T_SYMBOL	シンボル
-
-その他に内部で利用されている以下のタイプがあります．
-
-	T_ICLASS
-	T_MATCH
-	T_UNDEF
-	T_NODE
-	T_ZOMBIE
-
-ほとんどのタイプはCの構造体で実装されています．
-
-1.2 VALUEのデータタイプをチェックする
-
-ruby.hではTYPE()というマクロが定義されていて，VALUEのデータ
-タイプを知ることが出来ます．TYPE()マクロは上で紹介したT_XXXX
-の形式の定数を返します．VALUEのデータタイプに応じて処理する
-場合には，TYPE()の値で分岐することになります．
-
-  switch (TYPE(obj)) {
-    case T_FIXNUM:
-      /* FIXNUMの処理 */
-      break;
-    case T_STRING:
-      /* 文字列の処理 */
-      break;
-    case T_ARRAY:
-      /* 配列の処理 */
-      break;
-    default:
-      /* 例外を発生させる */
-      rb_raise(rb_eTypeError, "not valid value");
-      break;
-  }
-
-それとデータタイプをチェックして，正しくなければ例外を発生す
-る関数が用意されています．
-
-  void Check_Type(VALUE value, int type)
-
-この関数はvalueがtypeで無ければ，例外を発生させます．引数と
-して与えられたVALUEのデータタイプが正しいかどうかチェックす
-るためには，この関数を使います．
-
-FIXNUMとNILに関してはより高速な判別マクロが用意されています．
-
-  FIXNUM_P(obj)
-  NIL_P(obj)
-
-1.3 VALUEをCのデータに変換する
-
-データタイプがT_NIL，T_FALSE，T_TRUEである時，データはそれぞ
-れnil，false，trueです．このデータタイプのオブジェクトはひと
-つずつしか存在しません．
-
-データタイプがT_FIXNUMの時，これは31bitまたは63bitのサイズを
-持つ整数です．longのサイズが32bitのプラットフォームであれば
-31bitに，longのサイズが64bitのプラットフォームであれば63bit
-になります. FIXNUM を C の整数に変換するためにはマクロ
-「FIX2INT()」または「FIX2LONG()」を使います．これらのマクロ
-を使用する際には事前にデータタイプがFIXNUMであることを確認す
-る必要がありますが，比較的高速に変換を行うことができます．ま
-た，「FIX2LONG()」は例外を発生しませんが，「FIX2INT()」は変
-換結果がintのサイズに収まらない場合には例外を発生します．
-それから，FIXNUMに限らずRubyのデータを整数に変換する
-「NUM2INT()」および「NUM2LONG()」というマクロがあります．こ
-れらのマクロはマクロはデータタイプのチェック無しで使えます
-(整数に変換できない場合には例外が発生する)．同様にチェック無
-で使える変換マクロはdoubleを取り出す「NUM2DBL()」があります．
-
-char* を取り出す場合， StringValue() と StringValuePtr()
-を使います．
-StringValue(var) は var が String
-であれば何もせず，そうでなければ var を var.to_str() の結果
-に置き換えるマクロ，StringValuePtr(var) は同様に var を
-String に置き換えてから var のバイト列表現に対する char* を
-返すマクロです．var の内容を直接置き換える処理が入るので，
-var は lvalue である必要があります．
-また，StringValuePtr() に類似した StringValueCStr() というマ
-クロもあります．StringValueCStr(var) は var を String に置き
-換えてから var の文字列表現に対する char* を返します．返され
-る文字列の末尾には nul 文字が付加されます．なお，途中に nul
-文字が含まれる場合は ArgumentError が発生します．
-一方，StringValuePtr() では，末尾に nul 文字がある保証はなく，
-途中に nul 文字が含まれている可能性もあります．
-
-それ以外のデータタイプは対応するCの構造体があります．対応す
-る構造体のあるVALUEはそのままキャスト(型変換)すれば構造体の
-ポインタに変換できます．
-
-構造体は「struct RXxxxx」という名前でruby.hで定義されていま
-す．例えば文字列は「struct RString」です．実際に使う可能性が
-あるのは文字列と配列くらいだと思います．
-
-ruby.hでは構造体へキャストするマクロも「RXXXXX()」(全部大文
-字にしたもの)という名前で提供されています(例: RSTRING())．
-
-構造体からデータを取り出すマクロが提供されています．文字列
-strの長さを得るためには「RSTRING_LEN(str)」とし，文字列strを
-char*として得るためには「RSTRING_PTR(str)」とします．配列の
-場合には，それぞれ「RARRAY_LEN(ary)」，「RARRAY_PTR(ary)」と
-なります．
-
-Rubyの構造体を直接アクセスする時に気をつけなければならないこ
-とは，配列や文字列の構造体の中身は参照するだけで，直接変更し
-ないことです．直接変更した場合，オブジェクトの内容の整合性が
-とれなくなって，思わぬバグの原因になります．
-
-1.4 CのデータをVALUEに変換する
-
-VALUEの実際の構造は
-
-  * FIXNUMの場合
-
-    1bit左シフトして，LSBを立てる．
-
-  * その他のポインタの場合
-
-    そのままVALUEにキャストする．
-
-となっています．よって，LSBをチェックすればVALUEがFIXNUMかど
-うかわかるわけです(ポインタのLSBが立っていないことを仮定して
-いる)．
-
-ですから，FIXNUM以外のRubyのオブジェクトの構造体は単にVALUE
-にキャストするだけでVALUEに変換出来ます．ただし，任意の構造
-体がVALUEにキャスト出来るわけではありません．キャストするの
-はRubyの知っている構造体(ruby.hで定義されているstruct RXxxx
-のもの)だけです．
-
-FIXNUMに関しては変換マクロを経由する必要があります．Cの整数
-からVALUEに変換するマクロは以下のものがあります．必要に応じ
-て使い分けてください．
-
-  INT2FIX()	もとの整数が31bitまたは63bit以内に収まる自信
-		がある時
-  INT2NUM()	任意の整数からVALUEへ
-
-INT2NUM()は整数がFIXNUMの範囲に収まらない場合，Bignumに変換
-してくれます(が，少し遅い)．
-
-1.5 Rubyのデータを操作する
-
-先程も述べた通り，Rubyの構造体をアクセスする時に内容の更新を
-行うことは勧められません．で，Rubyのデータを操作する時には
-Rubyが用意している関数を用いてください．
-
-ここではもっとも使われるであろう文字列と配列の生成/操作を行
-い関数をあげます(全部ではないです)．
-
- 文字列に対する関数
-
-  rb_str_new(const char *ptr, long len)
-
-    新しいRubyの文字列を生成する．
-
-  rb_str_new2(const char *ptr)
-  rb_str_new_cstr(const char *ptr)
-
-    Cの文字列からRubyの文字列を生成する．この関数の機能は
-    rb_str_new(ptr, strlen(ptr))と同等である．
-
-  rb_tainted_str_new(const char *ptr, long len)
-
-    汚染マークが付加された新しいRubyの文字列を生成する．外部
-    からのデータに基づく文字列には汚染マークが付加されるべき
-    である．
-
-  rb_tainted_str_new2(const char *ptr)
-  rb_tainted_str_new_cstr(const char *ptr)
-
-    Cの文字列から汚染マークが付加されたRubyの文字列を生成する．
-
-  rb_sprintf(const char *format, ...)
-  rb_vsprintf(const char *format, va_list ap)
-
-    Cの文字列formatと続く引数をprintf(3)のフォーマットにしたがって
-    整形し，Rubyの文字列を生成する．
-
-  rb_str_cat(VALUE str, const char *ptr, long len)
-
-    Rubyの文字列strにlenバイトの文字列ptrを追加する．
-
-  rb_str_cat2(VALUE str, const char* ptr)
-
-    Rubyの文字列strにCの文字列ptrを追加する．この関数の機能は
-    rb_str_cat(str, ptr, strlen(ptr))と同等である．
-
-  rb_str_catf(VALUE str, const char* format, ...)
-  rb_str_vcatf(VALUE str, const char* format, va_list ap)
-
-    Cの文字列formatと続く引数をprintf(3)のフォーマットにしたがって
-    整形し，Rubyの文字列strに追加する．この関数の機能は，それぞれ
-    rb_str_cat2(str, rb_sprintf(format, ...)) や
-    rb_str_cat2(str, rb_vsprintf(format, ap)) と同等である．
-
-  rb_enc_str_new(const char *ptr, long len, rb_encoding *enc)
-
-    指定されたエンコーディングでRubyの文字列を生成する.
-
-  rb_usascii_str_new(const char *ptr, long len)
-  rb_usascii_str_new_cstr(const char *ptr)
-
-    エンコーディングがUS-ASCIIのRubyの文字列を生成する.
-
-  rb_str_resize(VALUE str, long len)
-
-    Rubyの文字列のサイズをlenバイトに変更する．strの長さは前
-    以てセットされていなければならない．lenが元の長さよりも短
-    い時は，lenバイトを越えた部分の内容は捨てられる．lenが元
-    の長さよりも長い時は，元の長さを越えた部分の内容は保存さ
-    れないでゴミになるだろう．この関数の呼び出しによって
-    RSTRING_PTR(str)が変更されるかもしれないことに注意．
-
-  rb_str_set_len(VALUE str, long len)
-
-    Rubyの文字列のサイズをlenバイトにセットする．strが変更可
-    能でなければ例外が発生する．RSTRING_LEN(str)とは無関係に，
-    lenバイトまでの内容は保存される．lenはstrの容量を越えてい
-    てはならない．
-
-
- 配列に対する関数
-
-  rb_ary_new()
-
-    要素が0の配列を生成する．
-
-  rb_ary_new2(long len)
-
-    要素が0の配列を生成する．len要素分の領域をあらかじめ割り
-    当てておく．
-
-  rb_ary_new3(long n, ...)
-
-    引数で指定したn要素を含む配列を生成する．
-
-  rb_ary_new4(long n, VALUE *elts)
-
-    配列で与えたn要素の配列を生成する．
-
-  rb_ary_to_ary(VALUE obj)
-
-    オブジェクトを配列に変換する.
-    Object#to_aryと同等である.
-
- 他にも配列を操作する関数が多数ある. これらは
- 引数aryに配列を渡さなければならない. さもないと
- コアを吐く.
-
-  rb_ary_aref(argc, VALUE *argv, VALUE ary)
-
-    Array#[]と同等.
-
-  rb_ary_entry(VALUE ary, long offset)
-
-    ary[offset]
-
-  rb_ary_subseq(VALUE ary, long beg, long len)
-
-    ary[beg, len]
-
-  rb_ary_push(VALUE ary, VALUE val)
-  rb_ary_pop(VALUE ary)
-  rb_ary_shift(VALUE ary)
-  rb_ary_unshift(VALUE ary, VALUE val)
-
-  rb_ary_cat(VALUE ary, const VALUE *ptr, long len)
-
-    配列aryにptrからlen個のオブジェクトを追加する．
-
-2．Rubyの機能を使う
-
-原理的にRubyで書けることはCでも書けます．RubyそのものがCで記
-述されているんですから，当然といえば当然なんですけど．ここで
-はRubyの拡張に使うことが多いだろうと予測される機能を中心に紹
-介します．
-
-2.1 Rubyに機能を追加する
-
-Rubyで提供されている関数を使えばRubyインタプリタに新しい機能
-を追加することができます．Rubyでは以下の機能を追加する関数が
-提供されています．
-
- * クラス，モジュール
- * メソッド，特異メソッドなど
- * 定数
-
-では順に紹介します．
-
-2.1.1 クラス/モジュール定義
-
-クラスやモジュールを定義するためには，以下の関数を使います．
-
-  VALUE rb_define_class(const char *name, VALUE super)
-  VALUE rb_define_module(const char *name)
-
-これらの関数は新しく定義されたクラスやモジュールを返します．
-メソッドや定数の定義にこれらの値が必要なので，ほとんどの場合
-は戻り値を変数に格納しておく必要があるでしょう．
-
-クラスやモジュールを他のクラスの内部にネストして定義する時に
-は以下の関数を使います．
-
-  VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
-  VALUE rb_define_module_under(VALUE outer, const char *name)
-
-2.1.2 メソッド/特異メソッド定義
-
-メソッドや特異メソッドを定義するには以下の関数を使います．
-
-  void rb_define_method(VALUE klass, const char *name,
-		        VALUE (*func)(), int argc)
-
-  void rb_define_singleton_method(VALUE object, const char *name,
-			          VALUE (*func)(), int argc)
-
-
-念のため説明すると「特異メソッド」とは，その特定のオブジェク
-トに対してだけ有効なメソッドです．RubyではよくSmalltalkにお
-けるクラスメソッドとして，クラスに対する特異メソッドが使われ
-ます．
-
-これらの関数の argcという引数はCの関数へ渡される引数の数(と
-形式)を決めます．argcが0以上の時は関数に引き渡す引数の数を意
-味します．16個以上の引数は使えません(が，要りませんよね，そ
-んなに)．実際の関数には先頭の引数としてselfが与えられますの
-で，指定した数より1多い引数を持つことになります．
-
-argcが負の時は引数の数ではなく，形式を指定したことになります．
-argcが-1の時は引数を配列に入れて渡されます．argcが-2の時は引
-数はRubyの配列として渡されます．
-
-メソッドを定義する関数はまだいくつかあります. ひとつはメソッド
-名としてIDを取ります. IDについては2.2.2を参照.
-
-  void rb_define_method_id(VALUE klass, ID name,
-                           VALUE (*func)(ANYARGS), int argc)
-
-private/protectedなメソッドを定義するふたつの関数があります.
-
-  void rb_define_private_method(VALUE klass, const char *name,
-				VALUE (*func)(), int argc)
-  void rb_define_protected_method(VALUE klass, const char *name,
-			          VALUE (*func)(), int argc)
-
-privateメソッドとは関数形式でしか呼び出すことの出来ないメソッ
-ドです．
-
-最後に， rb_define_module関数はモジュール関数を定義します．
-モジュール関数とはモジュールの特異メソッドであり，同時に
-privateメソッドでもあるものです．例をあげるとMathモジュール
-のsqrt()などがあげられます．このメソッドは
-
-  Math.sqrt(4)
-
-という形式でも
-
-  include Math
-  sqrt(4)
-
-という形式でも使えます．モジュール関数を定義する関数は以下の
-通りです．
-
-  void rb_define_module_function(VALUE module, const char *name,
-		                 VALUE (*func)(), int argc)
-
-関数的メソッド(Kernelモジュールのprivate method)を定義するた
-めの関数は以下の通りです．
-
-  void rb_define_global_function(const char *name, VALUE (*func)(), int argc)
-
-
-メソッドの別名を定義するための関数は以下の通りです．
-
-  void rb_define_alias(VALUE module, const char* new, const char* old);
-
-属性の取得・設定メソッドを定義するには
-
-  void rb_define_attr(VALUE klass, const char *name, int read, int write)
-
-クラスメソッドallocateを定義したり削除したりするための関数は
-以下の通りです．
-
-  void rb_define_alloc_func(VALUE klass, VALUE (*func)(VALUE klass));
-  void rb_undef_alloc_func(VALUE klass);
-
-funcはクラスを引数として受け取って，新しく割り当てられたイン
-スタンスを返さなくてはなりません．このインスタンスは，外部リ
-ソースなどを含まない，できるだけ「空」のままにしておいたほう
-がよいでしょう．
-
-2.1.3 定数定義
-
-拡張ライブラリが必要な定数はあらかじめ定義しておいた方が良い
-でしょう．定数を定義する関数は二つあります．
-
-  void rb_define_const(VALUE klass, const char *name, VALUE val)
-  void rb_define_global_const(const char *name, VALUE val)
-
-前者は特定のクラス/モジュールに属する定数を定義するもの，後
-者はグローバルな定数を定義するものです．
-
-2.2 Rubyの機能をCから呼び出す
-
-既に『1.5 Rubyのデータを操作する』で一部紹介したような関数を
-使えば，Rubyの機能を実現している関数を直接呼び出すことが出来
-ます．
-
-# このような関数の一覧表はいまのところありません．ソースを見
-# るしかないですね．
-
-それ以外にもRubyの機能を呼び出す方法はいくつかあります．
-
-2.2.1 Rubyのプログラムをevalする
-
-CからRubyの機能を呼び出すもっとも簡単な方法として，文字列で
-与えられたRubyのプログラムを評価する以下の関数があります．
-
-  VALUE rb_eval_string(const char *str)
-
-この評価は現在の環境で行われます．つまり，現在のローカル変数
-などを受け継ぎます．
-
-評価は例外を発生するかもしれないことに注意しましょう. より安全
-な関数もあります.
-
-  VALUE rb_eval_string_protect(const char *str, int *state)
-
-この関数はエラーが発生するとnilを返します．そして，成功時には
-*stateはゼロに，さもなくば非ゼロになります．
-
-
-2.2.2 IDまたはシンボル
-
-Cから文字列を経由せずにRubyのメソッドを呼び出すこともできま
-す．その前に，Rubyインタプリタ内でメソッドや変数名を指定する
-時に使われているIDについて説明しておきましょう．
-
-IDとは変数名，メソッド名を表す整数です．Rubyの中では
-
- :識別子
-または
- :"任意の文字列"
-
-でアクセスできます．Cからこの整数を得るためには関数
-
-  rb_intern(const char *name)
-  rb_intern_str(VALUE name)
-
-を使います．Rubyから引数として与えられたシンボル(または文字
-列)をIDに変換するには以下の関数を使います．
-
-  rb_to_id(VALUE symbol)
-  rb_check_id(volatile VALUE *name)
-
-もし引数がシンボルでも文字列でもなければ、to_strメソッドで文
-字列に変換しようとします．後者の関数はその変換結果を*nameに保
-存し,その名前が既知のシンボルでない場合は0を返します．この関
-数が0以外を返した場合は*nameは常にシンボルか文字列であり、0を
-返した場合は常に文字列です．
-
-2.2.3 CからRubyのメソッドを呼び出す
-
-Cから文字列を経由せずにRubyのメソッドを呼び出すためには以下
-の関数を使います．
-
-  VALUE rb_funcall(VALUE recv, ID mid, int argc, ...)
-
-この関数はオブジェクトrecvのmidで指定されるメソッドを呼び出
-します．その他に引数の指定の仕方が違う以下の関数もあります．
-
-  VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv)
-  VALUE rb_apply(VALUE recv, ID mid, VALUE args)
-
-applyには引数としてRubyの配列を与えます．
-
-2.2.4 変数/定数を参照/更新する
-
-Cから関数を使って参照・更新できるのは，定数，インスタンス変
-数です．大域変数は一部のものはCの大域変数としてアクセスでき
-ます．ローカル変数を参照する方法は公開していません．
-
-オブジェクトのインスタンス変数を参照・更新する関数は以下の通
-りです．
-
-  VALUE rb_ivar_get(VALUE obj, ID id)
-  VALUE rb_ivar_set(VALUE obj, ID id, VALUE val)
-
-idはrb_intern()で得られるものを使ってください．
-
-定数を参照するには以下の関数を使ってください．
-
-  VALUE rb_const_get(VALUE obj, ID id)
-
-定数を新しく定義するためには『2.1.3 定数定義』で紹介さ
-れている関数を使ってください．
-
-3．RubyとCとの情報共有
-
-C言語とRubyの間で情報を共有する方法について解説します．
-
-3.1 Cから参照できるRubyの定数
-
-以下のRubyの定数はCのレベルから参照できます．
-
-  Qtrue
-  Qfalse
-
-    真偽値．QfalseはC言語でも偽とみなされます(つまり0)．
-
-  Qnil
-
-    C言語から見た「nil」．
-
-3.2 CとRubyで共有される大域変数
-
-CとRubyで大域変数を使って情報を共有できます．共有できる大域
-変数にはいくつかの種類があります．そのなかでもっとも良く使わ
-れると思われるのはrb_define_variable()です．
-
-  void rb_define_variable(const char *name, VALUE *var)
-
-この関数はRubyとCとで共有する大域変数を定義します．変数名が
-`$'で始まらない時には自動的に追加されます．この変数の値を変
-更すると自動的にRubyの対応する変数の値も変わります．
-
-またRuby側からは更新できない変数もあります．このread onlyの
-変数は以下の関数で定義します．
-
-  void rb_define_readonly_variable(const char *name, VALUE *var)
-
-これら変数の他にhookをつけた大域変数を定義できます．hook付き
-の大域変数は以下の関数を用いて定義します．hook付き大域変数の
-値の参照や設定はhookで行う必要があります．
-
-  void rb_define_hooked_variable(const char *name, VALUE *var,
-				 VALUE (*getter)(), void (*setter)())
-
-この関数はCの関数によってhookのつけられた大域変数を定義しま
-す．変数が参照された時には関数getterが，変数に値がセットされ
-た時には関数setterが呼ばれる．hookを指定しない場合はgetterや
-setterに0を指定します．
-# getterもsetterも0ならばrb_define_variable()と同じになる．
-
-getterとsetterの仕様は次の通りです．
-
-  VALUE (*getter)(ID id, VALUE *var);
-  void (*setter)(VALUE val, ID id, VALUE *var);
-
-
-それから，対応するCの変数を持たないRubyの大域変数を定義する
-こともできます. その変数の値はフック関数のみによって取得・設定
-されます.
-
-  void rb_define_virtual_variable(const char *name,
-				  VALUE (*getter)(), void (*setter)())
-
-この関数によって定義されたRubyの大域変数が参照された時には
-getterが，変数に値がセットされた時にはsetterが呼ばれます．
-
-getterとsetterの仕様は以下の通りです．
-
-  (*getter)(ID id);
-  (*setter)(VALUE val, ID id);
-
-3.3 CのデータをRubyオブジェクトにする
-
-Cの世界で定義されたデータ(構造体)をRubyのオブジェクトとして
-取り扱いたい場合がありえます．このような場合には，Dataという
-RubyオブジェクトにCの構造体(へのポインタ)をくるむことでRuby
-オブジェクトとして取り扱えるようになります．
-
-Dataオブジェクトを生成して構造体をRubyオブジェクトにカプセル
-化するためには，以下のマクロを使います．
-
-  Data_Wrap_Struct(klass, mark, free, ptr)
-
-このマクロの戻り値は生成されたDataオブジェクトです．
-
-klassはこのDataオブジェクトのクラスです．ptrはカプセル化する
-Cの構造体へのポインタです．markはこの構造体がRubyのオブジェ
-クトへの参照がある時に使う関数です．そのような参照を含まない
-時には0を指定します．
-
-# そのような参照は勧められません．
-
-freeはこの構造体がもう不要になった時に呼ばれる関数です．この
-関数がガーベージコレクタから呼ばれます．これが-1の場合は，単
-純に開放されます．
-
-markおよびfree関数はGC実行中に呼び出されます.
-なお, GC実行中はRubyオブジェクトのアロケーションは禁止されま
-す. よって, markおよびfree関数でRubyオブジェクトのアロケーシ
-ョンは行わないでください.
-
-Cの構造体の割当とDataオブジェクトの生成を同時に行うマクロと
-して以下のものが提供されています．
-
-  Data_Make_Struct(klass, type, mark, free, sval)
-
-このマクロの戻り値は生成されたDataオブジェクトです．
-
-klass, mark, freeはData_Wrap_Structと同じ働きをします．type
-は割り当てるC構造体の型です．割り当てられた構造体は変数sval
-に代入されます．この変数の型は (type*) である必要があります．
-
-Dataオブジェクトからポインタを取り出すのは以下のマクロを用い
-ます．
-
-  Data_Get_Struct(obj, type, sval)
-
-Cの構造体へのポインタは変数svalに代入されます．
-
-これらのDataの使い方はちょっと分かりにくいので，後で説明する
-例題を参照してください．
-
-4．例題 - dbmパッケージを作る
-
-ここまでの説明でとりあえず拡張ライブラリは作れるはずです．
-Rubyのextディレクトリにすでに含まれているdbmライブラリを例に
-して段階的に説明します．
-
-(1) ディレクトリを作る
-
-  % mkdir ext/dbm
-
-Ruby 1.1からは任意のディレクトリでダイナミックライブラリを作
-ることができるようになりました．Rubyに静的にリンクする場合に
-はRubyを展開したディレクトリの下，extディレクトリの中に拡張
-ライブラリ用のディレクトリを作る必要があります．名前は適当に
-選んで構いません．
-
-(2) 設計する
-
-まあ，当然なんですけど，どういう機能を実現するかどうかまず設
-計する必要があります．どんなクラスをつくるか，そのクラスには
-どんなメソッドがあるか，クラスが提供する定数などについて設計
-します．
-
-(3) Cコードを書く
-
-拡張ライブラリ本体となるC言語のソースを書きます．C言語のソー
-スがひとつの時には「ライブラリ名.c」を選ぶと良いでしょう．C
-言語のソースが複数の場合には逆に「ライブラリ名.c」というファ
-イル名は避ける必要があります．オブジェクトファイルとモジュー
-ル生成時に中間的に生成される「ライブラリ名.o」というファイル
-とが衝突するからです．また，後述する mkmf ライブラリのいくつ
-かの関数がコンパイルを要するテストのために「conftest.c」とい
-うファイル名を使用することに注意してください．ソースファイル
-名として「conftest.c」を使用してはなりません．
-
-Rubyは拡張ライブラリをロードする時に「Init_ライブラリ名」と
-いう関数を自動的に実行します．dbmライブラリの場合「Init_dbm」
-です．この関数の中でクラス，モジュール，メソッド，定数などの
-定義を行います．dbm.cから一部引用します．
-
---
-void
-Init_dbm(void)
-{
-    /* DBMクラスを定義する */
-    cDBM = rb_define_class("DBM", rb_cObject);
-    /* DBMはEnumerateモジュールをインクルードする */
-    rb_include_module(cDBM, rb_mEnumerable);
-
-    /* DBMクラスのクラスメソッドopen(): 引数はCの配列で受ける */
-    rb_define_singleton_method(cDBM, "open", fdbm_s_open, -1);
-
-    /* DBMクラスのメソッドclose(): 引数はなし */
-    rb_define_method(cDBM, "close", fdbm_close, 0);
-    /* DBMクラスのメソッド[]: 引数は1個 */
-    rb_define_method(cDBM, "[]", fdbm_fetch, 1);
-		:
-
-    /* DBMデータを格納するインスタンス変数名のためのID */
-    id_dbm = rb_intern("dbm");
-}
---
-
-DBMライブラリはdbmのデータと対応するオブジェクトになるはずで
-すから，Cの世界のdbmをRubyの世界に取り込む必要があります．
-
-
-dbm.cではData_Make_Structを以下のように使っています．
-
---
-struct dbmdata {
-    int  di_size;
-    DBM *di_dbm;
-};
-
-
-obj = Data_Make_Struct(klass, struct dbmdata, 0, free_dbm, dbmp);
---
-
-ここではdbmstruct構造体へのポインタをDataにカプセル化してい
-ます．DBM*を直接カプセル化しないのはclose()した時の処理を考
-えてのことです．
-
-Dataオブジェクトからdbmstruct構造体のポインタを取り出すため
-に以下のマクロを使っています．
-
---
-#define GetDBM(obj, dbmp) {\
-    Data_Get_Struct(obj, struct dbmdata, dbmp);\
-    if (dbmp->di_dbm == 0) closed_dbm();\
-}
---
-
-ちょっと複雑なマクロですが，要するにdbmdata構造体のポインタ
-の取り出しと，closeされているかどうかのチェックをまとめてい
-るだけです．
-
-DBMクラスにはたくさんメソッドがありますが，分類すると3種類の
-引数の受け方があります．ひとつは引数の数が固定のもので，例と
-してはdeleteメソッドがあります．deleteメソッドを実装している
-fdbm_delete()はこのようになっています．
-
---
-static VALUE
-fdbm_delete(VALUE obj, VALUE keystr)
-{
-	:
-}
---
-
-引数の数が固定のタイプは第1引数がself，第2引数以降がメソッド
-の引数となります．
-
-引数の数が不定のものはCの配列で受けるものとRubyの配列で受け
-るものとがあります．dbmライブラリの中で，Cの配列で受けるもの
-はDBMのクラスメソッドであるopen()です．これを実装している関
-数fdbm_s_open()はこうなっています．
-
---
-static VALUE
-fdbm_s_open(int argc, VALUE *argv, VALUE klass)
-{
-	:
-    if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) {
-	mode = 0666;		/* default value */
-    }
-	:
-}
---
-
-このタイプの関数は第1引数が与えられた引数の数，第2引数が与え
-られた引数の入っている配列になります．selfは第3引数として与
-えられます．
-
-この配列で与えられた引数を解析するための関数がopen()でも使わ
-れているrb_scan_args()です．第3引数に指定したフォーマットに従
-い，第4変数以降に指定したVALUEへの参照に値を代入してくれま
-す．
-
-
-引数をRubyの配列として受け取るメソッドの例には
-Thread#initializeがあります．実装はこうです．
-
---
-static VALUE
-thread_initialize(VALUE thread, VALUE args)
-{
-	:
-}
---
-
-第1引数はself，第2引数はRubyの配列です．
-
-** 注意事項
-
-Rubyと共有はしないがRubyのオブジェクトを格納する可能性のある
-Cの大域変数は以下の関数を使ってRubyインタプリタに変数の存在
-を教えてあげてください．でないとGCでトラブルを起こします．
-
-  void rb_global_variable(VALUE *var)
-
-(4) extconf.rbを用意する
-
-Makefileを作る場合の雛型になるextconf.rbというファイルを作り
-ます．extconf.rbはライブラリのコンパイルに必要な条件のチェッ
-クなどを行うことが目的です．まず，
-
-  require 'mkmf'
-
-をextconf.rbの先頭に置きます．extconf.rbの中では以下のRuby関
-数を使うことが出来ます．
-
-  have_library(lib, func): ライブラリの存在チェック
-  have_func(func, header): 関数の存在チェック
-  have_header(header): ヘッダファイルの存在チェック
-  create_makefile(target): Makefileの生成
-
-以下の変数を使うことができます．
-
-  $CFLAGS: コンパイル時に追加的に指定するフラグ(-Oなど)
-  $CPPFLAGS: プリプロセッサに追加的に指定するフラグ(-Iや-Dなど)
-  $LDFLAGS: リンク時に追加的に指定するフラグ(-Lなど)
-  $objs: リンクされるオブジェクトファイル名のリスト
-
-オブジェクトファイルのリストは，通常はソースファイルを検索し
-て自動的に生成されますが，makeの途中でソースを生成するような
-場合は明示的に指定する必要があります．
-
-ライブラリをコンパイルする条件が揃わず，そのライブラリをコン
-パイルしない時にはcreate_makefileを呼ばなければMakefileは生
-成されず，コンパイルも行われません．
-
-(5) dependを用意する
-
-もし，ディレクトリにdependというファイルが存在すれば，
-Makefileが依存関係をチェックしてくれます．
-
-  % gcc -MM *.c > depend
-
-などで作ることが出来ます．あって損は無いでしょう．
-
-(6) Makefileを生成する
-
-Makefileを実際に生成するためには
-
-  ruby extconf.rb
-
-とします．extconf.rbに require 'mkmf' の行がない場合にはエラー
-になりますので，引数を追加して
-
-  ruby -r mkmf extconf.rb
-
-としてください．
-
-site_ruby ディレクトリでなく，
-vendor_ruby ディレクトリにインストールする場合には
-以下のように --vendor オプションを加えてください．
-
-  ruby extconf.rb --vendor
-
-ディレクトリをext以下に用意した場合にはRuby全体のmakeの時に
-自動的にMakefileが生成されますので，このステップは不要です．
-
-(7) makeする
-
-動的リンクライブラリを生成する場合にはその場でmakeしてくださ
-い．必要であれば make install でインストールされます．
-
-ext以下にディレクトリを用意した場合は，Rubyのディレクトリで
-makeを実行するとMakefileを生成からmake，必要によってはそのモ
-ジュールのRubyへのリンクまで自動的に実行してくれます．
-extconf.rbを書き換えるなどしてMakefileの再生成が必要な時はま
-たRubyディレクトリでmakeしてください．
-
-拡張ライブラリはmake installでRubyライブラリのディレクトリの
-下にコピーされます．もし拡張ライブラリと協調して使うRubyで記
-述されたプログラムがあり，Rubyライブラリに置きたい場合には，
-拡張ライブラリ用のディレクトリの下に lib というディレクトリ
-を作り，そこに 拡張子 .rb のファイルを置いておけば同時にイン
-ストールされます．
-
-(8) デバッグ
-
-まあ，デバッグしないと動かないでしょうね．ext/Setupにディレ
-クトリ名を書くと静的にリンクするのでデバッガが使えるようにな
-ります．その分コンパイルが遅くなりますけど．
-
-(9) できあがり
-
-後はこっそり使うなり，広く公開するなり，売るなり，ご自由にお
-使いください．Rubyの作者は拡張ライブラリに関して一切の権利を
-主張しません．
-
-Appendix A. Rubyのソースコードの分類
-
-Rubyのソースはいくつかに分類することが出来ます．このうちクラ
-スライブラリの部分は基本的に拡張ライブラリと同じ作り方になっ
-ています．これらのソースは今までの説明でほとんど理解できると
-思います．
-
-Ruby言語のコア
-
-  class.c         : クラスとモジュール
-  error.c         : 例外クラスと例外機構
-  gc.c            : 記憶領域管理
-  load.c          : ライブラリのロード
-  object.c        : オブジェクト
-  variable.c      : 変数と定数
-
-Rubyの構文解析器
-  parse.y         : 字句解析器と構文定義
-    -> parse.c    : 自動生成
-  keywords        : 予約語
-    -> lex.c      : 自動生成
-
-Rubyの評価器 (通称YARV)
-  compile.c
-  eval.c
-  eval_error.c
-  eval_jump.c
-  eval_safe.c
-  insns.def           : 仮想機械語の定義
-  iseq.c              : VM::ISeqの実装
-  thread.c            : スレッド管理とコンテキスト切り替え
-  thread_win32.c      : スレッド実装
-  thread_pthread.c    : 同上
-  vm.c
-  vm_dump.c
-  vm_eval.c
-  vm_exec.c
-  vm_insnhelper.c
-  vm_method.c
-
-  opt_insns_unif.def  : 命令融合
-  opt_operand.def     : 最適化のための定義
-
-    -> insn*.inc      : 自動生成
-    -> opt*.inc       : 自動生成
-    -> vm.inc         : 自動生成
-
-正規表現エンジン (鬼車)
-  regex.c
-  regcomp.c
-  regenc.c
-  regerror.c
-  regexec.c
-  regparse.c
-  regsyntax.c
-
-ユーティリティ関数
-
-  debug.c       : Cデバッガ用のデバッグシンボル
-  dln.c         : 動的ローディング
-  st.c          : 汎用ハッシュ表
-  strftime.c    : 時刻整形
-  util.c        : その他のユーティリティ
-
-Rubyコマンドの実装
-
-  dmyext.c
-  dmydln.c
-  dmyencoding.c
-  id.c
-  inits.c
-  main.c
-  ruby.c
-  version.c
-
-  gem_prelude.rb
-  prelude.rb
-
-クラスライブラリ
-
-  array.c       : Array
-  bignum.c      : Bignum
-  compar.c      : Comparable
-  complex.c     : Complex
-  cont.c        : Fiber, Continuation
-  dir.c         : Dir
-  enum.c        : Enumerable
-  enumerator.c  : Enumerator
-  file.c        : File
-  hash.c        : Hash
-  io.c          : IO
-  marshal.c     : Marshal
-  math.c        : Math
-  numeric.c     : Numeric, Integer, Fixnum, Float
-  pack.c        : Array#pack, String#unpack
-  proc.c        : Binding, Proc
-  process.c     : Process
-  random.c      : 乱数
-  range.c       : Range
-  rational.c    : Rational
-  re.c          : Regexp, MatchData
-  signal.c      : Signal
-  sprintf.c     :
-  string.c      : String
-  struct.c      : Struct
-  time.c        : Time
-
-  defs/known_errors.def  : 例外クラス Errno::*
-    -> known_errors.inc  : 自動生成
-
-多言語化
-  encoding.c    : Encoding
-  transcode.c   : Encoding::Converter
-  enc/*.c       : エンコーディングクラス群
-  enc/trans/*   : コードポイント対応表
-
-gorubyコマンドの実装
-
-  goruby.c
-  golf_prelude.rb      : goruby固有のライブラリ
-    -> golf_prelude.c  : 自動生成
-
-
-Appendix B. 拡張用関数リファレンス
-
-C言語からRubyの機能を利用するAPIは以下の通りである．
-
-** 型
-
-VALUE
-
-  Rubyオブジェクトを表現する型．必要に応じてキャストして用いる．
-  組み込み型を表現するCの型はruby.hに記述してあるRで始まる構造
-  体である．VALUE型をこれらにキャストするためにRで始まる構造体
-  名を全て大文字にした名前のマクロが用意されている．
-
-** 変数・定数
-
-Qnil
-
-  定数: nilオブジェクト
-
-Qtrue
-
-  定数: trueオブジェクト(真のデフォルト値)
-
-Qfalse
-
-  定数: falseオブジェクト
-
-** Cデータのカプセル化
-
-Data_Wrap_Struct(VALUE klass, void (*mark)(), void (*free)(), void *sval)
-
-  Cの任意のポインタをカプセル化したRubyオブジェクトを返す．こ
-  のポインタがRubyからアクセスされなくなった時，freeで指定した
-  関数が呼ばれる．また，このポインタの指すデータが他のRubyオブ
-  ジェクトを指している場合，markに指定する関数でマークする必要
-  がある．
-
-Data_Make_Struct(klass, type, mark, free, sval)
-
-  type型のメモリをmallocし，変数svalに代入した後，それをカプセ
-  ル化したデータを返すマクロ．
-
-Data_Get_Struct(data, type, sval)
-
-  dataからtype型のポインタを取り出し変数svalに代入するマクロ．
-
-** 型チェック
-
-TYPE(value)
-FIXNUM_P(value)
-NIL_P(value)
-void Check_Type(VALUE value, int type)
-void Check_SafeStr(VALUE value)
-
-** 型変換
-
-FIX2INT(value), INT2FIX(i)
-FIX2LONG(value), LONG2FIX(l)
-NUM2INT(value), INT2NUM(i)
-NUM2UINT(value), UINT2NUM(ui)
-NUM2LONG(value), LONG2NUM(l)
-NUM2ULONG(value), ULONG2NUM(ul)
-NUM2LL(value), LL2NUM(ll)
-NUM2ULL(value), ULL2NUM(ull)
-NUM2OFFT(value), OFFT2NUM(off)
-NUM2SIZET(value), SIZET2NUM(size)
-NUM2SSIZET(value), SSIZET2NUM(ssize)
-NUM2DBL(value)
-rb_float_new(f)
-StringValue(value)
-StringValuePtr(value)
-StringValueCStr(value)
-rb_str_new2(s)
-
-** クラス/モジュール定義
-
-VALUE rb_define_class(const char *name, VALUE super)
-
-  superのサブクラスとして新しいRubyクラスを定義する．
-
-VALUE rb_define_class_under(VALUE module, const char *name, VALUE super)
-
-  superのサブクラスとして新しいRubyクラスを定義し，moduleの
-  定数として定義する．
-
-VALUE rb_define_module(const char *name)
-
-  新しいRubyモジュールを定義する．
-
-VALUE rb_define_module_under(VALUE module, const char *name)
-
-  新しいRubyモジュールを定義し，moduleの定数として定義する．
-
-void rb_include_module(VALUE klass, VALUE module)
-
-  モジュールをインクルードする．classがすでにmoduleをインク
-  ルードしている時には何もしない(多重インクルードの禁止)．
-
-void rb_extend_object(VALUE object, VALUE module)
-
-  オブジェクトをモジュール(で定義されているメソッド)で拡張する．
-
-** 大域変数定義
-
-void rb_define_variable(const char *name, VALUE *var)
-
-  RubyとCとで共有するグローバル変数を定義する．変数名が`$'で
-  始まらない時には自動的に追加される．nameとしてRubyの識別子
-  として許されない文字(例えば` ')を含む場合にはRubyプログラ
-  ムからは見えなくなる．
-
-void rb_define_readonly_variable(const char *name, VALUE *var)
-
-  RubyとCとで共有するread onlyのグローバル変数を定義する．
-  read onlyであること以外はrb_define_variable()と同じ．
-
-void rb_define_virtual_variable(const char *name,
-				VALUE (*getter)(), void (*setter)())
-
-  関数によって実現されるRuby変数を定義する．変数が参照された
-  時にはgetterが，変数に値がセットされた時にはsetterが呼ばれ
-  る．
-
-void rb_define_hooked_variable(const char *name, VALUE *var,
-			       VALUE (*getter)(), void (*setter)())
-
-  関数によってhookのつけられたグローバル変数を定義する．変数
-  が参照された時にはgetterが，関数に値がセットされた時には
-  setterが呼ばれる．getterやsetterに0を指定した時にはhookを
-  指定しないのと同じ事になる．
-
-void rb_global_variable(VALUE *var)
-
-  GCのため，Rubyプログラムからはアクセスされないが, Rubyオブ
-  ジェクトを含む大域変数をマークする．
-
-** 定数
-
-void rb_define_const(VALUE klass, const char *name, VALUE val)
-
-  定数を定義する．
-
-void rb_define_global_const(const char *name, VALUE val)
-
-  大域定数を定義する．
-
-     rb_define_const(rb_cObject, name, val)
-
-  と同じ意味．
-
-** メソッド定義
-
-rb_define_method(VALUE klass, const char *name, VALUE (*func)(), int argc)
-
-  メソッドを定義する．argcはselfを除く引数の数．argcが-1の時,
-  関数には引数の数(selfを含まない)を第1引数, 引数の配列を第2
-  引数とする形式で与えられる(第3引数はself)．argcが-2の時,
-  第1引数がself, 第2引数がargs(argsは引数を含むRubyの配列)と
-  いう形式で与えられる．
-
-rb_define_private_method(VALUE klass, const char *name, VALUE (*func)(), int argc)
-
-  privateメソッドを定義する．引数はrb_define_method()と同じ．
-
-rb_define_singleton_method(VALUE klass, const char *name, VALUE (*func)(), int argc)
-
-  特異メソッドを定義する．引数はrb_define_method()と同じ．
-
-rb_scan_args(int argc, VALUE *argv, const char *fmt, ...)
-
-  argc, argv形式で与えられた指定されたフォーマットに従って引
-  数を分解し，続くVALUEへの参照にセットします．このフォーマッ
-  トは，ABNFで記述すると以下の通りです．
-
---
-scan-arg-spec  := param-arg-spec [option-hash-arg-spec] [block-arg-spec]
-
-param-arg-spec := pre-arg-spec [post-arg-spec] / post-arg-spec / pre-opt-post-arg-spec
-pre-arg-spec   := num-of-leading-mandatory-args [num-of-optional-args]
-post-arg-spec  := sym-for-variable-length-args [num-of-trailing-mandatory-args]
-pre-opt-post-arg-spec := num-of-leading-mandatory-args num-of-optional-args num-of-trailing-mandatory-args
-option-hash-arg-spec := sym-for-option-hash-arg
-block-arg-spec := sym-for-block-arg
-
-num-of-leading-mandatory-args  := DIGIT ; 先頭に置かれる省略不能な引数の数
-num-of-optional-args           := DIGIT ; 続いて置かれる省略可能な引数の数
-sym-for-variable-length-args   := "*"   ; 続いて置かれる可変長引数を
-                                        ; Rubyの配列で取得するための指定
-num-of-trailing-mandatory-args := DIGIT ; 終端に置かれる省略不能な引数の数
-sym-for-option-hash-arg        := ":"   ; オプションハッシュを取得する
-                                        ; ための指定; 省略不能な引数の
-                                        ; 数よりも多くの引数が指定され，
-                                        ; 最後の引数がハッシュ（または
-                                        ; #to_hashで変換可能）の場合に
-                                        ; 取得される．最後の引数がnilの
-                                        ; 場合，可変長引数指定がなく，
-                                        ; 省略不能引数の数よりも多くの
-                                        ; 引数が指定された場合に取得される
-sym-for-block-arg              := "&"   ; イテレータブロックを取得するための
-                                        ; 指定
---
-
-  フォーマットが"12"の場合，引数は最低1つで，3つ(1+2)まで許さ
-  れるという意味になります．従って，フォーマット文字列に続い
-  て3つのVALUEへの参照を置く必要があります．それらには取得した
-  変数がセットされます．変数への参照の代わりにNULLを指定する
-  こともでき，その場合は取得した引数の値は捨てられます．なお，
-  省略可能引数が省略された時の変数の値はnil(C言語のレベルでは
-  Qnil)になります．
-
-  返り値は与えられた引数の数です．オプションハッシュおよびイ
-  テレータブロックは数えません．
-
-** Rubyメソッド呼び出し
-
-VALUE rb_funcall(VALUE recv, ID mid, int narg, ...)
-
-  メソッド呼び出し．文字列からmidを得るためにはrb_intern()を
-  使う．
-
-VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv)
-
-  メソッド呼び出し．引数をargc, argv形式で渡す．
-
-VALUE rb_eval_string(const char *str)
-
-  文字列をRubyスクリプトとしてコンパイル・実行する．
-
-ID rb_intern(const char *name)
-
-  文字列に対応するIDを返す．
-
-char *rb_id2name(ID id)
-
-  IDに対応する文字列を返す(デバッグ用)．
-
-char *rb_class2name(VALUE klass)
-
-  クラスの名前を返す(デバッグ用)．クラスが名前を持たない時に
-  は, 祖先を遡って名前を持つクラスの名前を返す．
-
-int rb_respond_to(VALUE obj, ID id)
-
-  objがidで示されるメソッドを持つかどうかを返す．
-
-** インスタンス変数
-
-VALUE rb_iv_get(VALUE obj, const char *name)
-
-  objのインスタンス変数の値を得る．`@'で始まらないインスタン
-  ス変数は Rubyプログラムからアクセスできない「隠れた」イン
-  スタンス変数になる．定数は大文字の名前を持つクラス(または
-  モジュール)のインスタンス変数として実装されている．
-
-VALUE rb_iv_set(VALUE obj, const char *name, VALUE val)
-
-  objのインスタンス変数をvalにセットする．
-
-** 制御構造
-
-VALUE rb_block_call(VALUE obj, ID mid, int argc, VALUE * argv,
-		    VALUE (*func) (ANYARGS), VALUE data2)
-
-  funcをブロックとして設定し，objをレシーバ，argcとargvを引数
-  としてmidメソッドを呼び出す．funcは第一引数にyieldされた値，
-  第二引数にdata2を受け取る．複数の値がyieldされた場合(Cでは
-  rb_yield_values()とrb_yield_values2(), rb_yield_splat())，
-  data2はArrayとしてパックされている．第三, 第四引数のargcと
-  argvによってyieldされた値を取り出すことができる．
-
-[OBSOLETE] VALUE rb_iterate(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2)
-
-  func2をブロックとして設定し, func1をイテレータとして呼ぶ．
-  func1には arg1が引数として渡され, func2には第1引数にイテレー
-  タから与えられた値, 第2引数にarg2が渡される．
-
-  1.9でrb_iterateを使う場合は, func1の中でRubyレベルのメソッド
-  を呼び出さなければならない.
-  1.9でobsoleteとなった. 代わりにrb_block_callが用意された.
-
-VALUE rb_yield(VALUE val)
-
-  valを値としてイテレータブロックを呼び出す．
-
-VALUE rb_rescue(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2)
-
-  関数func1をarg1を引数に呼び出す．func1の実行中に例外が発生
-  した時には func2をarg2を引数として呼ぶ．戻り値は例外が発生
-  しなかった時はfunc1の戻り値, 例外が発生した時にはfunc2の戻
-  り値である．
-
-VALUE rb_ensure(VALUE (*func1)(), VALUE arg1, VALUE (*func2)(), VALUE arg2)
-
-  関数func1をarg1を引数として実行し, 実行終了後(たとえ例外が
-  発生しても) func2をarg2を引数として実行する．戻り値はfunc1
-  の戻り値である(例外が発生した時は戻らない)．
-
-VALUE rb_protect(VALUE (*func) (VALUE), VALUE arg, int *state)
-
-  関数funcをargを引数として実行し, 例外が発生しなければその戻
-  り値を返す．例外が発生した場合は, *stateに非0をセットして
-  Qnilを返す．
-  rb_jump_tag()を呼ばずに捕捉した例外を無視する場合には，
-  rb_set_errinfo(Qnil)でエラー情報をクリアしなければならない．
-
-void rb_jump_tag(int state)
-
-  rb_protect()やrb_eval_string_protect()で捕捉された例外を再
-  送する．stateはそれらの関数から返された値でなければならない．
-  この関数は直接の呼び出し元に戻らない．
-
-void rb_iter_break()
-
-  現在の最も内側のブロックを終了する．この関数は直接の呼び出
-  し元に戻らない．
-
-void rb_iter_break_value(VALUE value)
-
-  現在の最も内側のブロックをvalueで終了する．ブロックは引数で
-  与えられたvalueを返す．この関数は直接の呼び出し元に戻らない．
-
-** 例外・エラー
-
-void rb_warning(const char *fmt, ...)
-
-  rb_verbose時に標準エラー出力に警告情報を表示する．引数は
-  printf()と同じ．
-
-void rb_raise(rb_eRuntimeError, const char *fmt, ...)
-
-  RuntimeError例外を発生させる．引数はprintf()と同じ．
-
-void rb_raise(VALUE exception, const char *fmt, ...)
-
-  exceptionで指定した例外を発生させる．fmt以下の引数は
-  printf()と同じ．
-
-void rb_fatal(const char *fmt, ...)
-
-  致命的例外を発生させる．通常の例外処理は行なわれず, インター
-  プリタが終了する(ただしensureで指定されたコードは終了前に
-  実行される)．
-
-void rb_bug(const char *fmt, ...)
-
-  インタープリタなどプログラムのバグでしか発生するはずのない
-  状況の時呼ぶ．インタープリタはコアダンプし直ちに終了する．
-  例外処理は一切行なわれない．
-
-** Rubyの初期化・実行
-
-Rubyをアプリケーションに埋め込む場合には以下のインタフェース
-を使う．通常の拡張ライブラリには必要ない．
-
-void ruby_init()
-
-  Rubyインタプリタの初期化を行なう．
-
-void ruby_options(int argc, char **argv)
-
-  Rubyインタプリタのコマンドライン引数の処理を行なう．
-
-void ruby_run()
-
-  Rubyインタプリタを実行する．
-
-void ruby_script(char *name)
-
-  Rubyのスクリプト名($0)を設定する．
-
-** インタプリタのイベントのフック
-
- void rb_add_event_hook(rb_event_hook_func_t func, rb_event_flag_t events, VALUE data)
-
-指定されたインタプリタのイベントに対するフック関数を追加します．
-eventsは以下の値のorでなければなりません:
-
-	RUBY_EVENT_LINE
-	RUBY_EVENT_CLASS
-	RUBY_EVENT_END
-	RUBY_EVENT_CALL
-	RUBY_EVENT_RETURN
-	RUBY_EVENT_C_CALL
-	RUBY_EVENT_C_RETURN
-	RUBY_EVENT_RAISE
-	RUBY_EVENT_ALL
-
-rb_event_hook_func_tの定義は以下の通りです:
-
- typedef void (*rb_event_hook_func_t)(rb_event_t event, VALUE data,
- 				      VALUE self, ID id, VALUE klass)
-
-rb_add_event_hook() の第3引数 data は，フック関数の第2引数と
-して渡されます．これは1.8では現在のNODEへのポインタでした．以
-下の RB_EVENT_HOOKS_HAVE_CALLBACK_DATA も参照してください．
-
- int rb_remove_event_hook(rb_event_hook_func_t func)
-
-指定されたフック関数を削除します．
-
-** 互換性のためのマクロ
-
-APIの互換性をチェックするために以下のマクロがデフォルトで定義されています．
-
-NORETURN_STYLE_NEW
-
-  NORETURN マクロが関数型マクロとして定義されていることを意味する．
-
-HAVE_RB_DEFINE_ALLOC_FUNC
-
-  rb_define_alloc_func() 関数が提供されていること，つまり
-  allocation framework が使われることを意味する．
-  have_func("rb_define_alloc_func", "ruby.h")
-  の結果と同じ．
-
-HAVE_RB_REG_NEW_STR
-
-  StringオブジェクトからRegexpオブジェクトを作る
-  rb_reg_new_str() 関数が提供されていることを意味する．
-  have_func("rb_reg_new_str", "ruby.h").
-  の結果と同じ．
-
-HAVE_RB_IO_T
-
-  rb_io_t 型が提供されていることを意味する．
-
-USE_SYMBOL_AS_METHOD_NAME
-
-  メソッド名を返すメソッド，Module#methods, #singleton_methods
-  などがSymbolを返すことを意味する．
-
-HAVE_RUBY_*_H
-
-  ruby.h で定義されている．対応するヘッダが提供されていること
-  を意味する．たとえば，HAVE_RUBY_ST_H が定義されている場合は
-  単なる st.h ではなく ruby/st.h を使用する．
-
-RB_EVENT_HOOKS_HAVE_CALLBACK_DATA
-
-  rb_add_event_hook() がフック関数に渡す data を第3引数として
-  受け取ることを意味する．
-
-Appendix C. extconf.rbで使える関数たち
-
-extconf.rbの中では利用可能なコンパイル条件チェックの関数は以
-下の通りである．
-
-have_macro(macro, headers)
-
-  ヘッダファイルheaderをインクルードしてマクロmacroが定義さ
-  れているかどうかチェックする．マクロが定義されている時true
-  を返す．
-
-have_library(lib, func)
-
-  関数funcを定義しているライブラリlibの存在をチェックする．
-  ライブラリが存在する時，trueを返す．
-
-find_library(lib, func, path...)
-
-  関数funcを定義しているライブラリlibの存在を -Lpath を追加
-  しながらチェックする．ライブラリが見付かった時，trueを返す．
-
-have_func(func, header)
-
-  ヘッダファイルheaderをインクルードして関数funcの存在をチェ
-  ックする．funcが標準ではリンクされないライブラリ内のもので
-  ある時には先にhave_libraryでそのライブラリをチェックしてお
-  く事．関数が存在する時trueを返す．
-
-have_var(var, header)
-
-  ヘッダファイルheaderをインクルードして変数varの存在をチェッ
-  クする．varが標準ではリンクされないライブラリ内のものであ
-  る時には先にhave_libraryでそのライブラリをチェックしておく
-  事．変数が存在する時trueを返す．
-
-have_header(header)
-
-  ヘッダファイルの存在をチェックする．ヘッダファイルが存在す
-  る時trueを返す．
-
-find_header(header, path...)
-
-  ヘッダファイルheaderの存在を -Ipath を追加しながらチェック
-  する．ヘッダファイルが見付かった時，trueを返す．
-
-have_struct_member(type, member, header)
-
-  ヘッダファイルheaderをインクルードして型typeにメンバmember
-  が存在するかをチェックする．typeが定義されていて，memberを
-  持つする時trueを返す．
-
-have_type(type, header, opt)
-
-  ヘッダファイルheaderをインクルードして型typeが存在するかを
-  チェックする．typeが定義されている時trueを返す．
-
-check_sizeof(type, header)
-
-  ヘッダファイルheaderをインクルードして型typeのchar単位サイ
-  ズを調べる．typeが定義されている時そのサイズを返す．定義さ
-  れていないときはnilを返す．
-
-create_makefile(target)
-
-  拡張ライブラリ用のMakefileを生成する．この関数を呼ばなけれ
-  ばそのライブラリはコンパイルされない．targetはモジュール名
-  を表す．
-
-find_executable(command, path)
-
-  コマンドcommandをFile::PATH_SEPARATORで区切られたパス名の
-  リストpathから探す．pathがnilまたは省略された場合は，環境
-  変数PATHの値を使用する．実行可能なコマンドが見つかった場合
-  はパスを含むファイル名，見つからなかった場合はnilを返す．
-
-with_config(withval[, default=nil])
-
-  コマンドライン上の--with-<withval>で指定されたオプション値
-  を得る．
-
-enable_config(config, *defaults)
-disable_config(config, *defaults)
-
-  コマンドライン上の--enable-<config>または
-  --disable-<config>で指定された真偽値を得る．
-  --enable-<config>が指定されていた場合はtrue，
-  --disable-<config>が指定されていた場合はfalseを返す．
-  どちらも指定されていない場合は，ブロックつきで呼び出されて
-  いる場合は*defaultsをyieldした結果，ブロックなしなら
-  *defaultsを返す．
-
-dir_config(target[, default_dir])
-dir_config(target[, default_include, default_lib])
-
-  コマンドライン上の--with-<target>-dir, --with-<target>-include,
-  --with-<target>-libのいずれかで指定されるディレクトリを
-  $CFLAGS や $LDFLAGS に追加する．--with-<target>-dir=/pathは
-  --with-<target>-include=/path/include --with-<target>-lib=/path/lib
-  と等価である．追加された include ディレクトリと lib ディレ
-  クトリの配列を返す． ([include_dir, lib_dir])
-
-pkg_config(pkg)
-
-  pkg-configコマンドからパッケージpkgの情報を得る．
-  pkg-configの実際のコマンド名は，--with-pkg-configコマンド
-  ラインオプションで指定可能．
-
-/*
- * Local variables:
- * fill-column: 60
- * end:
- */
+doc/extension.ja.rdocに移動しました
diff --git a/README.ja b/README.ja
deleted file mode 100644
index 2702bf9aef..0000000000
--- a/README.ja
+++ /dev/null
@@ -1,191 +0,0 @@
-* Rubyとは
-
-Rubyはシンプルかつ強力なオブジェクト指向スクリプト言語です．
-Rubyは最初から純粋なオブジェクト指向言語として設計されていま
-すから，オブジェクト指向プログラミングを手軽に行う事が出来ま
-す．もちろん通常の手続き型のプログラミングも可能です．
-
-Rubyはテキスト処理関係の能力などに優れ，Perlと同じくらい強力
-です．さらにシンプルな文法と，例外処理やイテレータなどの機構
-によって，より分かりやすいプログラミングが出来ます．
-
-
-* Rubyの特長
-
-  + シンプルな文法
-  + 普通のオブジェクト指向機能(クラス，メソッドコールなど)
-  + 特殊なオブジェクト指向機能(Mixin, 特異メソッドなど)
-  + 演算子オーバーロード
-  + 例外処理機能
-  + イテレータとクロージャ
-  + ガーベージコレクタ
-  + ダイナミックローディング (アーキテクチャによる)
-  + 移植性が高い．多くのUnix-like/POSIX互換プラットフォーム上で
-    動くだけでなく，Windows， Mac OS X，BeOSなどの上でも動く
-    cf. http://bugs.ruby-lang.org/projects/ruby-trunk/wiki/SupportedPlatformsJa
-
-* 入手法
-
-** FTPで
-
-以下の場所においてあります．
-
-  ftp://ftp.ruby-lang.org/pub/ruby/
-
-** Subversionで
-
-開発先端のソースコードは次のコマンドで取得できます．
-
-  $ svn co http://svn.ruby-lang.org/repos/ruby/trunk/ ruby
-
-他に開発中のブランチの一覧は次のコマンドで見られます．
-
-  $ svn ls http://svn.ruby-lang.org/repos/ruby/branches/
-
-** Gitで
-
-SubversionのミラーをGitHubに公開しています．
-以下のコマンドでリポジトリを取得できます．
-
-  $ git clone git://github.com/ruby/ruby.git
-
-* ホームページ
-
-RubyのホームページのURLは
-
-   http://www.ruby-lang.org/
-
-です．
-
-
-* メーリングリスト
-
-Rubyのメーリングリストがあります。参加希望の方は
-
-   ruby-list-ctl@ruby-lang.org
-
-まで本文に
-
-   subscribe YourFirstName YourFamilyName
-
-と書いて送って下さい。
-
-Ruby開発者向けメーリングリストもあります。こちらではrubyのバ
-グ、将来の仕様拡張など実装上の問題について議論されています。
-参加希望の方は
-
-   ruby-dev-ctl@ruby-lang.org
-
-までruby-listと同様の方法でメールしてください。
-
-Ruby拡張モジュールについて話し合うruby-extメーリングリストと
-数学関係の話題について話し合うruby-mathメーリングリストと
-英語で話し合うruby-talkメーリングリストもあります。参加方法
-はどれも同じです。
-
-
-* コンパイル・インストール
-
-以下の手順で行ってください．
-
-  1. もしconfigureファイルが見つからない、もしくは
-     configure.inより古いようなら、autoconfを実行して
-     新しくconfigureを生成する
-
-  2. configureを実行してMakefileなどを生成する
-
-     環境によってはデフォルトのCコンパイラ用オプションが付き
-     ます．configureオプションで optflags=.. warnflags=.. 等
-     で上書きできます．
-
-  3. (必要ならば)defines.hを編集する
-
-     多分，必要無いと思います．
-
-  4. (必要ならば)ext/Setupに静的にリンクする拡張モジュールを
-     指定する
-
-     ext/Setupに記述したモジュールは静的にリンクされます．
-
-     ダイナミックローディングをサポートしていないアーキテク
-     チャではSetupの1行目の「option nodynamic」という行のコ
-     メントを外す必要があります．また，このアーキテクチャで
-     拡張モジュールを利用するためには，あらかじめ静的にリン
-     クしておく必要があります．
-
-  5. makeを実行してコンパイルする
-
-  6. make checkでテストを行う．
-
-     「check succeeded」と表示されれば成功です．ただしテスト
-     に成功しても完璧だと保証されている訳ではありません．
-
-  7. make install
-
-     以下のディレクトリを作って，そこにファイルをインストー
-     ルします．
-
-       * ${DESTDIR}${prefix}/bin
-       * ${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib
-       * ${DESTDIR}${prefix}/lib/ruby
-       * ${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib/ruby/site_ruby
-       * ${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib/ruby/vendor_ruby
-       * ${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}
-       * ${DESTDIR}${prefix}/lib/ruby/gems/${MAJOR}.${MINOR}.${TEENY}
-       * ${DESTDIR}${prefix}/share/man/man1
-       * ${DESTDIR}${prefix}/share/ri/${MAJOR}.${MINOR}.${TEENY}/system
-
-     RubyのAPIバージョンが`x.y.z'であれば，((|${MAJOR}|))は
-     `x'で，((|${MINOR}|))は`y'，((|${TEENY}|))は`z'です．
-
-     注意: APIバージョンのteenyは，Rubyプログラムのバージョ
-     ンとは異なることがあります．
-
-     rootで作業する必要があるかもしれません．
-
-もし，コンパイル時にエラーが発生した場合にはエラーのログとマ
-シン，OSの種類を含むできるだけ詳しいレポートを作者に送ってく
-ださると他の方のためにもなります．
-
-
-* 移植
-
-UNIXであればconfigureがほとんどの差異を吸収してくれるはずで
-すが，思わぬ見落としがあった場合(あるに違いない)，作者にその
-ことをレポートすれば，解決できるかも知れません．
-
-アーキテクチャにもっとも依存するのはGC部です．RubyのGCは対象
-のアーキテクチャがsetjmp()またはgetcontext()によって全てのレ
-ジスタをjmp_bufやucontext_tに格納することと，jmp_bufや
-ucontext_tとスタックが32bitアラインメントされていることを仮定
-しています．特に前者が成立しない場合の対応は非常に困難でしょ
-う．後者の解決は比較的簡単で，gc.cでスタックをマークしている
-部分にアラインメントのバイト数だけずらしてマークするコードを
-追加するだけで済みます．「defined(__mc68000__)」で括られてい
-る部分を参考にしてください．
-
-レジスタウィンドウを持つCPUでは，レジスタウィンドウをスタッ
-クにフラッシュするアセンブラコードを追加する必要があるかも知
-れません．
-
-
-* 配布条件
-
-COPYING.jaファイルを参照してください。
-
-
-* 著者
-
-コメント，バグレポートその他は matz@netlab.jp まで．
--------------------------------------------------------
-created at: Thu Aug  3 11:57:36 JST 1995
-Local variables:
-mode: indented-text
-end:
diff --git a/README.ja.md b/README.ja.md
new file mode 100644
index 0000000000..93c0131690
--- /dev/null
+++ b/README.ja.md
@@ -0,0 +1,182 @@
+[![Actions Status: MinGW](https://github.com/ruby/ruby/workflows/MinGW/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MinGW")
+[![Actions Status: MJIT](https://github.com/ruby/ruby/workflows/MJIT/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MJIT")
+[![Actions Status: Ubuntu](https://github.com/ruby/ruby/workflows/Ubuntu/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Ubuntu")
+[![Actions Status: Windows](https://github.com/ruby/ruby/workflows/Windows/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Windows")
+[![AppVeyor status](https://ci.appveyor.com/api/projects/status/0sy8rrxut4o0k960/branch/master?svg=true)](https://ci.appveyor.com/project/ruby/ruby/branch/master)
+[![Travis Status](https://app.travis-ci.com/ruby/ruby.svg?branch=master)](https://app.travis-ci.com/ruby/ruby)
+
+# Rubyとは
+
+Rubyはシンプルかつ強力なオブジェクト指向スクリプト言語です． Rubyは純粋なオブジェクト指向言語として設計されているので，
+オブジェクト指向プログラミングを手軽に行う事が出来ます．もちろん普通の手続き型のプログラミングも可能です．
+
+Rubyはテキスト処理関係の能力などに優れ，Perlと同じくらい強力です．さらにシンプルな文法と，
+例外処理やイテレータなどの機構によって，より分かりやすいプログラミングが出来ます．
+
+## Rubyの特長
+
+*   シンプルな文法
+*   普通のオブジェクト指向機能(クラス，メソッドコールなど)
+*   特殊なオブジェクト指向機能(Mixin，特異メソッドなど)
+*   演算子オーバーロード
+*   例外処理機能
+*   イテレータとクロージャ
+*   ガーベージコレクタ
+*   ダイナミックローディング (アーキテクチャによる)
+*   移植性が高い．多くのUnix-like/POSIX互換プラットフォーム上で動くだけでなく，Windows， macOS，
+    Haikuなどの上でも動く cf.
+    https://github.com/ruby/ruby/blob/master/doc/contributing.rdoc#platform-maintainers
+
+
+## 入手法
+
+サードパーティーツールを使った方法を含むRubyのインストール方法の一覧は
+
+https://www.ruby-lang.org/ja/downloads/
+
+を参照してください．
+
+### Git
+
+ミラーをGitHubに公開しています． 以下のコマンドでリポジトリを取得できます．
+
+    $ git clone https://github.com/ruby/ruby.git
+
+他のブランチの一覧は次のコマンドで見られます．
+
+    $ git ls-remote https://github.com/ruby/ruby.git
+
+Rubyリポジトリの本来のmasterは https://git.ruby-lang.org/ruby.git にあります．
+コミッタはこちらを使います．
+
+### Subversion
+
+古いRubyのバージョンのソースコードは次のコマンドでも取得できます．
+
+    $ svn co https://svn.ruby-lang.org/repos/ruby/branches/ruby_2_6/ ruby
+
+他のブランチの一覧は次のコマンドで見られます．
+
+    $ svn ls https://svn.ruby-lang.org/repos/ruby/branches/
+
+
+## ホームページ
+
+RubyのホームページのURLは
+
+https://www.ruby-lang.org/
+
+です．
+
+## メーリングリスト
+
+Rubyのメーリングリストがあります．参加希望の方は [ruby-list-request@ruby-lang.org] まで本文に
+
+    subscribe
+
+と書いて送って下さい．
+
+Ruby開発者向けメーリングリストもあります．こちらではrubyのバグ，将来の仕様拡張など実装上の問題について議論されています．
+参加希望の方は [ruby-dev-request@ruby-lang.org] までruby-listと同様の方法でメールしてください．
+
+Ruby拡張モジュールについて話し合うruby-extメーリングリストと数学関係の話題について話し合うruby-mathメーリングリストと
+英語でrubyについて話し合うruby-talkメーリングリストもあります．参加方法はどれも同じです．
+
+[ruby-list-request@ruby-lang.org]: mailto:ruby-list-request@ruby-lang.org?subject=Join%20Ruby%20Mailing%20List&body=subscribe
+[ruby-dev-request@ruby-lang.org]: mailto:ruby-dev-request@ruby-lang.org?subject=Join%20Ruby%20Mailing%20List&body=subscribe
+
+## コンパイル・インストール
+
+以下の手順で行ってください．
+
+1.  (Gitリポジトリから取得したソースをビルドする場合) `./autogen.sh` を実行して新しく `configure` を生成する
+
+2.  `configure` を実行して `Makefile` などを生成する
+
+    環境によってはデフォルトのCコンパイラ用オプションが付きます． `configure` オプションで `optflags=..`
+    `warnflags=..` 等で上書きできます．
+
+3.  (必要ならば)`include/ruby/defines.h` を編集する
+
+    多分，必要無いと思います．
+
+4.  (必要ならば)`ext/Setup` に静的にリンクする拡張モジュールを指定する
+
+    `ext/Setup` に記述したモジュールは静的にリンクされます．
+
+    ダイナミックローディングをサポートしていないアーキテクチャでは `Setup` の1行目の「`option nodynamic`」という行のコ
+    メントを外す必要があります．
+    また，このアーキテクチャで拡張モジュールを利用するためには，あらかじめ静的にリンクをしておく必要があります．
+
+5.  `make` を実行してコンパイルする
+
+6.  `make check`でテストを行う．
+
+    「`check succeeded`」と表示されれば成功です．ただしテストに成功しても完璧だと保証されている訳ではありません．
+
+7.  `make install`
+
+    以下のディレクトリを作って，そこにファイルをインストー ルします．
+
+    *   `${DESTDIR}${prefix}/bin`
+    *   `${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/include/ruby-${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib`
+    *   `${DESTDIR}${prefix}/lib/ruby`
+    *   `${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/lib/ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib/ruby/site_ruby`
+    *   `${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/lib/ruby/site_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib/ruby/vendor_ruby`
+    *   `${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/lib/ruby/vendor_ruby/${MAJOR}.${MINOR}.${TEENY}/${PLATFORM}`
+    *   `${DESTDIR}${prefix}/lib/ruby/gems/${MAJOR}.${MINOR}.${TEENY}`
+    *   `${DESTDIR}${prefix}/share/man/man1`
+    *   `${DESTDIR}${prefix}/share/ri/${MAJOR}.${MINOR}.${TEENY}/system`
+
+
+    RubyのAPIバージョンが'*x.y.z*'であれば，`${MAJOR}`は
+    '*x*'で，`${MINOR}`は'*y*'，`${TEENY}`は'*z*'です．
+
+    **注意**: APIバージョンの `teeny` は，Rubyプログラムのバージョンとは異なることがあります．
+
+    `root` で作業する必要があるかもしれません．
+
+
+もし，コンパイル時にエラーが発生した場合にはエラーのログとマシン，OSの種類を含むできるだけ詳しいレポートを作者に送って下さると他の方のためにもなります．
+
+## 移植
+
+UNIXであれば `configure` がほとんどの差異を吸収してくれるはずですが，思わぬ見落としがあった場合(ある事が多い)，作者にその
+ことを報告すれば，解決できる可能性があります．
+
+アーキテクチャにもっとも依存するのはGC部です．RubyのGCは対象
+のアーキテクチャが`setjmp()`または`getcontext()`によって全てのレジスタを `jmp_buf` や `ucontext_t`
+に格納することと， `jmp_buf` や `ucontext_t` とスタックが32bitアラインメントされていることを仮定
+しています．特に前者が成立しない場合の対応は非常に困難でしょう． 後者の解決は比較的簡単で， `gc.c` でスタックをマークしている
+部分にアラインメントのバイト数だけずらしてマークするコードを追加するだけで済みます．`defined(__mc68000__)`で括られてい
+る部分を参考にしてください．
+
+レジスタウィンドウを持つCPUでは，レジスタウィンドウをスタックにフラッシュするアセンブラコードを追加する必要があるかもしれません．
+
+## 配布条件
+
+[COPYING.ja](COPYING.ja) ファイルを参照してください．
+
+## フィードバック
+
+Rubyに関する質問は [Ruby-Talk]（英語）や [Ruby-List]（日本語）や，
+[stackoverflow] などのWebサイトに投稿してください．
+
+バグ報告は https://bugs.ruby-lang.org で受け付けています．
+
+[Ruby-Talk]: https://www.ruby-lang.org/en/community/mailing-lists
+[Ruby-List]: https://www.ruby-lang.org/ja/community/mailing-lists
+[stackoverflow]: https://ja.stackoverflow.com/
+
+## 著者
+
+Rubyのオリジナル版は，1995年にまつもとゆきひろ氏によって設計・開発されました．
+
+<mailto:matz@ruby-lang.org>
diff --git a/README.md b/README.md
new file mode 100644
index 0000000000..c445448c71
--- /dev/null
+++ b/README.md
@@ -0,0 +1,91 @@
+[![Actions Status: MinGW](https://github.com/ruby/ruby/workflows/MinGW/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MinGW")
+[![Actions Status: MJIT](https://github.com/ruby/ruby/workflows/MJIT/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MJIT")
+[![Actions Status: Ubuntu](https://github.com/ruby/ruby/workflows/Ubuntu/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Ubuntu")
+[![Actions Status: Windows](https://github.com/ruby/ruby/workflows/Windows/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"Windows")
+[![AppVeyor status](https://ci.appveyor.com/api/projects/status/0sy8rrxut4o0k960/branch/master?svg=true)](https://ci.appveyor.com/project/ruby/ruby/branch/master)
+[![Travis Status](https://app.travis-ci.com/ruby/ruby.svg?branch=master)](https://app.travis-ci.com/ruby/ruby)
+
+# What is Ruby?
+
+Ruby is an interpreted object-oriented programming language often
+used for web development. It also offers many scripting features
+to process plain text and serialized files, or manage system tasks.
+It is simple, straightforward, and extensible.
+
+## Features of Ruby
+
+* Simple Syntax
+* **Normal** Object-oriented Features (e.g. class, method calls)
+* **Advanced** Object-oriented Features (e.g. mix-in, singleton-method)
+* Operator Overloading
+* Exception Handling
+* Iterators and Closures
+* Garbage Collection
+* Dynamic Loading of Object Files (on some architectures)
+* Highly Portable (works on many Unix-like/POSIX compatible platforms as
+  well as Windows, macOS, etc.) cf.
+  https://github.com/ruby/ruby/blob/master/doc/maintainers.rdoc#label-Platform+Maintainers
+
+## How to get Ruby with Git
+
+For a complete list of ways to install Ruby, including using third-party tools
+like rvm, see:
+
+https://www.ruby-lang.org/en/downloads/
+
+The mirror of the Ruby source tree can be checked out with the following command:
+
+    $ git clone https://github.com/ruby/ruby.git
+
+There are some other branches under development. Try the following command
+to see the list of branches:
+
+    $ git ls-remote https://github.com/ruby/ruby.git
+
+You may also want to use https://git.ruby-lang.org/ruby.git (actual master of Ruby source)
+if you are a committer.
+
+## How to build
+
+see [Building Ruby](doc/contributing/building_ruby.md)
+
+## Ruby home page
+
+https://www.ruby-lang.org/
+
+## Documentation
+
+- [English](https://docs.ruby-lang.org/en/master/index.html)
+- [Japanese](https://docs.ruby-lang.org/ja/master/index.html)
+
+## Mailing list
+
+There is a mailing list to discuss Ruby. To subscribe to this list, please
+send the following phrase:
+
+    subscribe
+
+in the mail body (not subject) to the address [ruby-talk-request@ruby-lang.org].
+
+[ruby-talk-request@ruby-lang.org]: mailto:ruby-talk-request@ruby-lang.org?subject=Join%20Ruby%20Mailing%20List&body=subscribe
+
+## Copying
+
+See the file [COPYING](rdoc-ref:COPYING).
+
+## Feedback
+
+Questions about the Ruby language can be asked on the [Ruby-Talk](https://www.ruby-lang.org/en/community/mailing-lists) mailing list
+or on websites like https://stackoverflow.com.
+
+Bugs should be reported at https://bugs.ruby-lang.org. Read ["Reporting Issues"](https://docs.ruby-lang.org/en/master/contributing/reporting_issues_md.html) for more information.
+
+## Contributing
+
+See ["Contributing to Ruby"](https://docs.ruby-lang.org/en/master/contributing_md.html), which includes setup and build instructions.
+
+## The Author
+
+Ruby was originally designed and developed by Yukihiro Matsumoto (Matz) in 1995.
+
+<matz@ruby-lang.org>
diff --git a/aclocal.m4 b/aclocal.m4
new file mode 100644
index 0000000000..e69de29bb2
--- /dev/null
+++ b/aclocal.m4
diff --git a/addr2line.c b/addr2line.c
index 9c7f9a1f80..e5f25293e2 100644
--- a/addr2line.c
+++ b/addr2line.c
@@ -1,6 +1,6 @@
 /**********************************************************************
 
-  addr2line.h -
+  addr2line.c -
 
   $Author$
 
@@ -8,22 +8,31 @@
 
 **********************************************************************/
 
-#include "ruby/config.h"
+#if defined(__clang__)
+#pragma clang diagnostic ignored "-Wgnu-empty-initializer"
+#pragma clang diagnostic ignored "-Wgcc-compat"
+#endif
+
+#include "ruby/internal/config.h"
+#include "ruby/defines.h"
+#include "ruby/missing.h"
 #include "addr2line.h"
 
 #include <stdio.h>
 #include <errno.h>
 
-#ifdef USE_ELF
-
-#ifdef __OpenBSD__
-#include <elf_abi.h>
-#else
-#include <elf.h>
+#ifdef HAVE_LIBPROC_H
+#include <libproc.h>
 #endif
+
+#include "ruby/internal/stdbool.h"
+
+#if defined(USE_ELF) || defined(HAVE_MACH_O_LOADER_H)
+
 #include <fcntl.h>
 #include <limits.h>
 #include <stdio.h>
+#include <stdint.h>
 #include <stdlib.h>
 #include <string.h>
 #include <sys/mman.h>
@@ -31,15 +40,72 @@
 #include <sys/stat.h>
 #include <unistd.h>
 
-#if defined(HAVE_ALLOCA_H)
-#include <alloca.h>
+/* Make alloca work the best possible way.  */
+#ifdef __GNUC__
+# ifndef alloca
+#  define alloca __builtin_alloca
+# endif
+#else
+# ifdef HAVE_ALLOCA_H
+#  include <alloca.h>
+# else
+#  ifdef _AIX
+#pragma alloca
+#  else
+#   ifndef alloca		/* predefined by HP cc +Olibcalls */
+void *alloca();
+#   endif
+#  endif /* AIX */
+# endif	/* HAVE_ALLOCA_H */
+#endif /* __GNUC__ */
+
+#ifdef HAVE_DLADDR
+# include <dlfcn.h>
+#endif
+
+#ifdef HAVE_MACH_O_LOADER_H
+# include <crt_externs.h>
+# include <mach-o/fat.h>
+# include <mach-o/loader.h>
+# include <mach-o/nlist.h>
+# include <mach-o/stab.h>
 #endif
 
-#ifdef HAVE_DL_ITERATE_PHDR
-# ifndef _GNU_SOURCE
-#  define _GNU_SOURCE
+#ifdef USE_ELF
+# ifdef __OpenBSD__
+#  include <elf_abi.h>
+# else
+#  include <elf.h>
 # endif
-# include <link.h>
+
+#ifndef ElfW
+# if SIZEOF_VOIDP == 8
+#  define ElfW(x) Elf64##_##x
+# else
+#  define ElfW(x) Elf32##_##x
+# endif
+#endif
+#ifndef ELF_ST_TYPE
+# if SIZEOF_VOIDP == 8
+#  define ELF_ST_TYPE ELF64_ST_TYPE
+# else
+#  define ELF_ST_TYPE ELF32_ST_TYPE
+# endif
+#endif
+#endif
+
+#ifdef SHF_COMPRESSED
+# if defined(ELFCOMPRESS_ZLIB) && defined(HAVE_LIBZ)
+   /* FreeBSD 11.0 lacks ELFCOMPRESS_ZLIB */
+#  include <zlib.h>
+#  define SUPPORT_COMPRESSED_DEBUG_LINE
+# endif
+#else /* compatibility with glibc < 2.22 */
+# define SHF_COMPRESSED 0
+#endif
+
+#ifndef PATH_MAX
+#define PATH_MAX 4096
 #endif
 
 #define DW_LNS_copy                     0x01
@@ -61,38 +127,83 @@
 #define DW_LNE_define_file              0x03
 #define DW_LNE_set_discriminator        0x04  /* DWARF4 */
 
-#ifndef ElfW
-# if SIZEOF_VOIDP == 8
-#  define ElfW(x) Elf64##_##x
-# else
-#  define ElfW(x) Elf32##_##x
-# endif
-#endif
-#ifndef PATH_MAX
-#define PATH_MAX 4096
-#endif
+PRINTF_ARGS(static int kprintf(const char *fmt, ...), 1, 2);
 
-typedef struct {
+typedef struct line_info {
     const char *dirname;
     const char *filename;
+    const char *path; /* object path */
     int line;
 
-    int fd;
-    void *mapped;
-    size_t mapped_size;
-    unsigned long base_addr;
+    uintptr_t base_addr;
+    uintptr_t saddr;
+    const char *sname; /* function name */
+
+    struct line_info *next;
 } line_info_t;
 
+struct dwarf_section {
+    char *ptr;
+    size_t size;
+    uint64_t flags;
+};
+
+typedef struct obj_info {
+    const char *path; /* object path */
+    char *mapped;
+    size_t mapped_size;
+    void *uncompressed;
+    uintptr_t base_addr;
+    uintptr_t vmaddr;
+    struct dwarf_section debug_abbrev;
+    struct dwarf_section debug_info;
+    struct dwarf_section debug_line;
+    struct dwarf_section debug_ranges;
+    struct dwarf_section debug_str_offsets;
+    struct dwarf_section debug_addr;
+    struct dwarf_section debug_rnglists;
+    struct dwarf_section debug_str;
+    struct dwarf_section debug_line_str;
+    struct obj_info *next;
+} obj_info_t;
+
+#define DWARF_SECTION_COUNT 9
+
+static struct dwarf_section *
+obj_dwarf_section_at(obj_info_t *obj, int n)
+{
+    struct dwarf_section *ary[] = {
+        &obj->debug_abbrev,
+        &obj->debug_info,
+        &obj->debug_line,
+        &obj->debug_ranges,
+        &obj->debug_str_offsets,
+        &obj->debug_addr,
+        &obj->debug_rnglists,
+        &obj->debug_str,
+        &obj->debug_line_str
+    };
+    if (n < 0 || DWARF_SECTION_COUNT <= n) {
+        abort();
+    }
+    return ary[n];
+}
+
+struct debug_section_definition {
+    const char *name;
+    struct dwarf_section *dwarf;
+};
+
 /* Avoid consuming stack as this module may be used from signal handler */
-static char binary_filename[PATH_MAX];
+static char binary_filename[PATH_MAX + 1];
 
 static unsigned long
-uleb128(char **p)
+uleb128(const char **p)
 {
     unsigned long r = 0;
     int s = 0;
     for (;;) {
-	unsigned char b = *(unsigned char *)(*p)++;
+	unsigned char b = (unsigned char)*(*p)++;
 	if (b < 0x80) {
 	    r += (unsigned long)b << s;
 	    break;
@@ -104,12 +215,12 @@ uleb128(char **p)
 }
 
 static long
-sleb128(char **p)
+sleb128(const char **p)
 {
     long r = 0;
     int s = 0;
     for (;;) {
-	unsigned char b = *(unsigned char *)(*p)++;
+	unsigned char b = (unsigned char)*(*p)++;
 	if (b < 0x80) {
 	    if (b & 0x40) {
 		r -= (0x80 - b) << s;
@@ -126,7 +237,7 @@ sleb128(char **p)
 }
 
 static const char *
-get_nth_dirname(unsigned long dir, char *p)
+get_nth_dirname(unsigned long dir, const char *p)
 {
     if (!dir--) {
 	return "";
@@ -135,7 +246,7 @@ get_nth_dirname(unsigned long dir, char *p)
 	while (*p) p++;
 	p++;
 	if (!*p) {
-	    fprintf(stderr, "Unexpected directory number %lu in %s\n",
+	    kprintf("Unexpected directory number %lu in %s\n",
 		    dir, binary_filename);
 	    return "";
 	}
@@ -143,155 +254,191 @@ get_nth_dirname(unsigned long dir, char *p)
     return p;
 }
 
+static const char *parse_ver5_debug_line_header(const char *p, int idx, uint8_t format, obj_info_t *obj, const char **out_path, uint64_t *out_directory_index);
+
 static void
-fill_filename(int file, char *include_directories, char *filenames,
-	      line_info_t *line)
+fill_filename(int file, uint8_t format, uint16_t version, const char *include_directories, const char *filenames, line_info_t *line, obj_info_t *obj)
 {
     int i;
-    char *p = filenames;
-    char *filename;
+    const char *p = filenames;
+    const char *filename;
     unsigned long dir;
-    for (i = 1; i <= file; i++) {
-	filename = p;
-	if (!*p) {
-	    /* Need to output binary file name? */
-	    fprintf(stderr, "Unexpected file number %d in %s\n",
-		    file, binary_filename);
-	    return;
-	}
-	while (*p) p++;
-	p++;
-	dir = uleb128(&p);
-	/* last modified. */
-	uleb128(&p);
-	/* size of the file. */
-	uleb128(&p);
-
-	if (i == file) {
-	    line->filename = filename;
-	    line->dirname = get_nth_dirname(dir, include_directories);
-	}
-    }
-}
-
-static int
-get_path_from_symbol(const char *symbol, const char **p, size_t *len)
-{
-    if (symbol[0] == '0') {
-	/* libexecinfo */
-	*p   = strchr(symbol, '/');
-	if (*p == NULL) return 0;
-	*len = strlen(*p);
+    if (version >= 5) {
+        const char *path;
+        uint64_t directory_index = -1;
+        parse_ver5_debug_line_header(filenames, file, format, obj, &path, &directory_index);
+        line->filename = path;
+        parse_ver5_debug_line_header(include_directories, (int)directory_index, format, obj, &path, NULL);
+        line->dirname = path;
     }
     else {
-	/* glibc */
-	const char *q;
-	*p   = symbol;
-	q   = strchr(symbol, '(');
-	if (q == NULL) return 0;
-	*len = q - symbol;
+        for (i = 1; i <= file; i++) {
+            filename = p;
+            if (!*p) {
+                /* Need to output binary file name? */
+                kprintf("Unexpected file number %d in %s at %tx\n",
+                        file, binary_filename, filenames - obj->mapped);
+                return;
+            }
+            while (*p) p++;
+            p++;
+            dir = uleb128(&p);
+            /* last modified. */
+            uleb128(&p);
+            /* size of the file. */
+            uleb128(&p);
+
+            if (i == file) {
+                line->filename = filename;
+                line->dirname = get_nth_dirname(dir, include_directories);
+            }
+        }
     }
-    return 1;
 }
 
 static void
-fill_line(int num_traces, void **traces,
-	  unsigned long addr, int file, int line,
-	  char *include_directories, char *filenames, line_info_t *lines)
+fill_line(int num_traces, void **traces, uintptr_t addr, int file, int line,
+	  uint8_t format, uint16_t version, const char *include_directories, const char *filenames,
+	  obj_info_t *obj, line_info_t *lines, int offset)
 {
     int i;
-    for (i = 0; i < num_traces; i++) {
-	unsigned long a = (unsigned long)traces[i] - lines[i].base_addr;
+    addr += obj->base_addr - obj->vmaddr;
+    for (i = offset; i < num_traces; i++) {
+	uintptr_t a = (uintptr_t)traces[i];
 	/* We assume one line code doesn't result >100 bytes of native code.
        We may want more reliable way eventually... */
 	if (addr < a && a < addr + 100) {
-	    fill_filename(file, include_directories, filenames, &lines[i]);
+	    fill_filename(file, format, version, include_directories, filenames, &lines[i], obj);
 	    lines[i].line = line;
 	}
     }
 }
 
-static void
-parse_debug_line_cu(int num_traces, void **traces,
-		    char **debug_line, line_info_t *lines)
+struct LineNumberProgramHeader {
+    uint64_t unit_length;
+    uint16_t version;
+    uint8_t format; /* 4 or 8 */
+    uint64_t header_length;
+    uint8_t minimum_instruction_length;
+    uint8_t maximum_operations_per_instruction;
+    uint8_t default_is_stmt;
+    int8_t line_base;
+    uint8_t line_range;
+    uint8_t opcode_base;
+    /* uint8_t standard_opcode_lengths[opcode_base-1]; */
+    const char *include_directories;
+    const char *filenames;
+    const char *cu_start;
+    const char *cu_end;
+};
+
+static int
+parse_debug_line_header(obj_info_t *obj, const char **pp, struct LineNumberProgramHeader *header)
 {
-    char *p, *cu_end, *cu_start, *include_directories, *filenames;
-    unsigned long unit_length;
-    int default_is_stmt, line_base;
-    unsigned int header_length, minimum_instruction_length, line_range,
-		 opcode_base;
-    unsigned char *standard_opcode_lengths;
+    const char *p = *pp;
+    header->unit_length = *(uint32_t *)p;
+    p += sizeof(uint32_t);
+
+    header->format = 4;
+    if (header->unit_length == 0xffffffff) {
+	header->unit_length = *(uint64_t *)p;
+	p += sizeof(uint64_t);
+        header->format = 8;
+    }
 
-    /* The registers. */
-    unsigned long addr = 0;
-    unsigned int file = 1;
-    unsigned int line = 1;
-    unsigned int column = 0;
-    int is_stmt;
-    int basic_block = 0;
-    int end_sequence = 0;
-    int prologue_end = 0;
-    int epilogue_begin = 0;
-    unsigned int isa = 0;
+    header->cu_end = p + header->unit_length;
 
-    p = *debug_line;
+    header->version = *(uint16_t *)p;
+    p += sizeof(uint16_t);
+    if (header->version > 5) return -1;
 
-    unit_length = *(unsigned int *)p;
-    p += sizeof(unsigned int);
-    if (unit_length == 0xffffffff) {
-	unit_length = *(unsigned long *)p;
-	p += sizeof(unsigned long);
+    if (header->version >= 5) {
+        /* address_size = *(uint8_t *)p++; */
+        /* segment_selector_size = *(uint8_t *)p++; */
+        p += 2;
     }
 
-    cu_end = p + unit_length;
+    header->header_length = header->format == 4 ? *(uint32_t *)p : *(uint64_t *)p;
+    p += header->format;
+    header->cu_start = p + header->header_length;
 
-    /*dwarf_version = *(unsigned short *)p;*/
-    p += 2;
+    header->minimum_instruction_length = *(uint8_t *)p++;
 
-    header_length = *(unsigned int *)p;
-    p += sizeof(unsigned int);
-
-    cu_start = p + header_length;
-
-    minimum_instruction_length = *(unsigned char *)p;
-    p++;
+    if (header->version >= 4) {
+        /* maximum_operations_per_instruction = *(uint8_t *)p; */
+        if (*p != 1) return -1; /* For non-VLIW architectures, this field is 1 */
+        p++;
+    }
 
-    is_stmt = default_is_stmt = *(unsigned char *)p;
-    p++;
+    header->default_is_stmt = *(uint8_t *)p++;
+    header->line_base = *(int8_t *)p++;
+    header->line_range = *(uint8_t *)p++;
+    header->opcode_base = *(uint8_t *)p++;
+    /* header->standard_opcode_lengths = (uint8_t *)p - 1; */
+    p += header->opcode_base - 1;
+
+    if (header->version >= 5) {
+        header->include_directories = p;
+        p = parse_ver5_debug_line_header(p, -1, header->format, obj, NULL, NULL);
+        header->filenames = p;
+    }
+    else {
+        header->include_directories = p;
 
-    line_base = *(char *)p;
-    p++;
+        /* temporary measure for compress-debug-sections */
+        if (p >= header->cu_end) return -1;
 
-    line_range = *(unsigned char *)p;
-    p++;
+        /* skip include directories */
+        while (*p) {
+            p = memchr(p, '\0', header->cu_end - p);
+            if (!p) return -1;
+            p++;
+        }
+        p++;
 
-    opcode_base = *(unsigned char *)p;
-    p++;
+        header->filenames = p;
+    }
 
-    standard_opcode_lengths = (unsigned char *)p - 1;
-    p += opcode_base - 1;
+    *pp = header->cu_start;
 
-    include_directories = p;
+    return 0;
+}
 
-    /* skip include directories */
-    while (*p) {
-	while (*p) p++;
-	p++;
-    }
-    p++;
+static int
+parse_debug_line_cu(int num_traces, void **traces, const char **debug_line,
+		obj_info_t *obj, line_info_t *lines, int offset)
+{
+    const char *p = (const char *)*debug_line;
+    struct LineNumberProgramHeader header;
 
-    filenames = p;
+    /* The registers. */
+    unsigned long addr = 0;
+    unsigned int file = 1;
+    unsigned int line = 1;
+    /* unsigned int column = 0; */
+    int is_stmt;
+    /* int basic_block = 0; */
+    /* int end_sequence = 0; */
+    /* int prologue_end = 0; */
+    /* int epilogue_begin = 0; */
+    /* unsigned int isa = 0; */
 
-    p = cu_start;
+    if (parse_debug_line_header(obj, &p, &header))
+        return -1;
+    is_stmt = header.default_is_stmt;
 
 #define FILL_LINE()						    \
     do {							    \
 	fill_line(num_traces, traces, addr, file, line,		    \
-		  include_directories, filenames, lines);	    \
-	basic_block = prologue_end = epilogue_begin = 0;	    \
+                  header.format,                                    \
+                  header.version,                                   \
+                  header.include_directories,                       \
+                  header.filenames,                                 \
+		  obj, lines, offset);				    \
+	/*basic_block = prologue_end = epilogue_begin = 0;*/	    \
     } while (0)
 
-    while (p < cu_end) {
+    while (p < header.cu_end) {
 	unsigned long a;
 	unsigned char op = *p++;
 	switch (op) {
@@ -299,7 +446,7 @@ parse_debug_line_cu(int num_traces, void **traces,
 	    FILL_LINE();
 	    break;
 	case DW_LNS_advance_pc:
-	    a = uleb128(&p);
+	    a = uleb128(&p) * header.minimum_instruction_length;
 	    addr += a;
 	    break;
 	case DW_LNS_advance_line: {
@@ -311,53 +458,54 @@ parse_debug_line_cu(int num_traces, void **traces,
 	    file = (unsigned int)uleb128(&p);
 	    break;
 	case DW_LNS_set_column:
-	    column = (unsigned int)uleb128(&p);
+	    /*column = (unsigned int)*/(void)uleb128(&p);
 	    break;
 	case DW_LNS_negate_stmt:
 	    is_stmt = !is_stmt;
 	    break;
 	case DW_LNS_set_basic_block:
-	    basic_block = 1;
+	    /*basic_block = 1; */
 	    break;
 	case DW_LNS_const_add_pc:
-	    a = ((255 - opcode_base) / line_range) *
-		minimum_instruction_length;
+	    a = ((255UL - header.opcode_base) / header.line_range) *
+		header.minimum_instruction_length;
 	    addr += a;
 	    break;
 	case DW_LNS_fixed_advance_pc:
-	    a = *(unsigned char *)p++;
+	    a = *(uint16_t *)p;
+	    p += sizeof(uint16_t);
 	    addr += a;
 	    break;
 	case DW_LNS_set_prologue_end:
-	    prologue_end = 1;
+	    /* prologue_end = 1; */
 	    break;
 	case DW_LNS_set_epilogue_begin:
-	    epilogue_begin = 1;
+	    /* epilogue_begin = 1; */
 	    break;
 	case DW_LNS_set_isa:
-	    isa = (unsigned int)uleb128(&p);
+	    /* isa = (unsigned int)*/(void)uleb128(&p);
 	    break;
 	case 0:
-	    a = *(unsigned char *)p++;
+	    a = uleb128(&p);
 	    op = *p++;
 	    switch (op) {
 	    case DW_LNE_end_sequence:
-		end_sequence = 1;
+		/* end_sequence = 1; */
 		FILL_LINE();
 		addr = 0;
 		file = 1;
 		line = 1;
-		column = 0;
-		is_stmt = default_is_stmt;
-		end_sequence = 0;
-		isa = 0;
+		/* column = 0; */
+		is_stmt = header.default_is_stmt;
+		/* end_sequence = 0; */
+		/* isa = 0; */
 		break;
 	    case DW_LNE_set_address:
 		addr = *(unsigned long *)p;
 		p += sizeof(unsigned long);
 		break;
 	    case DW_LNE_define_file:
-		fprintf(stderr, "Unsupported operation in %s\n",
+		kprintf("Unsupported operation in %s\n",
 			binary_filename);
 		break;
 	    case DW_LNE_set_discriminator:
@@ -365,53 +513,79 @@ parse_debug_line_cu(int num_traces, void **traces,
 		uleb128(&p);
 		break;
 	    default:
-		fprintf(stderr, "Unknown extended opcode: %d in %s\n",
+		kprintf("Unknown extended opcode: %d in %s\n",
 			op, binary_filename);
 	    }
 	    break;
 	default: {
-	    unsigned long addr_incr;
-	    unsigned long line_incr;
-	    a = op - opcode_base;
-	    addr_incr = (a / line_range) * minimum_instruction_length;
-	    line_incr = line_base + (a % line_range);
-	    addr += (unsigned int)addr_incr;
-	    line += (unsigned int)line_incr;
+            uint8_t adjusted_opcode = op - header.opcode_base;
+            uint8_t operation_advance = adjusted_opcode / header.line_range;
+            /* NOTE: this code doesn't support VLIW */
+            addr += operation_advance * header.minimum_instruction_length;
+            line += header.line_base + (adjusted_opcode % header.line_range);
 	    FILL_LINE();
 	}
 	}
     }
-    *debug_line = p;
+    *debug_line = (char *)p;
+    return 0;
 }
 
-static void
+static int
 parse_debug_line(int num_traces, void **traces,
-		 char *debug_line, unsigned long size, line_info_t *lines)
+		 const char *debug_line, unsigned long size,
+		 obj_info_t *obj, line_info_t *lines, int offset)
 {
-    char *debug_line_end = debug_line + size;
+    const char *debug_line_end = debug_line + size;
     while (debug_line < debug_line_end) {
-	parse_debug_line_cu(num_traces, traces, &debug_line, lines);
+	if (parse_debug_line_cu(num_traces, traces, &debug_line, obj, lines, offset))
+	    return -1;
     }
     if (debug_line != debug_line_end) {
-	fprintf(stderr, "Unexpected size of .debug_line in %s\n",
+	kprintf("Unexpected size of .debug_line in %s\n",
 		binary_filename);
     }
+    return 0;
 }
 
 /* read file and fill lines */
+static uintptr_t
+fill_lines(int num_traces, void **traces, int check_debuglink,
+	   obj_info_t **objp, line_info_t *lines, int offset);
+
 static void
-fill_lines(int num_traces, void **traces, char **syms, int check_debuglink,
-	   line_info_t *current_line, line_info_t *lines);
+append_obj(obj_info_t **objp)
+{
+    obj_info_t *newobj = calloc(1, sizeof(obj_info_t));
+    if (*objp) (*objp)->next = newobj;
+    *objp = newobj;
+}
 
+#ifdef USE_ELF
+/* Ideally we should check 4 paths to follow gnu_debuglink:
+ *
+ *   - /usr/lib/debug/.build-id/ab/cdef1234.debug
+ *   - /usr/bin/ruby.debug
+ *   - /usr/bin/.debug/ruby.debug
+ *   - /usr/lib/debug/usr/bin/ruby.debug.
+ *
+ * but we handle only two cases for now as the two formats are
+ * used by some linux distributions.
+ *
+ * See GDB's info for detail.
+ * https://sourceware.org/gdb/onlinedocs/gdb/Separate-Debug-Files.html
+ */
+
+// check the path pattern of "/usr/lib/debug/usr/bin/ruby.debug"
 static void
-follow_debuglink(char *debuglink, int num_traces, void **traces, char **syms,
-		 line_info_t *current_line, line_info_t *lines)
+follow_debuglink(const char *debuglink, int num_traces, void **traces,
+		 obj_info_t **objp, line_info_t *lines, int offset)
 {
-    /* Ideally we should check 4 paths to follow gnu_debuglink,
-       but we handle only one case for now as this format is used
-       by some linux distributions. See GDB's info for detail. */
     static const char global_debug_dir[] = "/usr/lib/debug";
-    char *p, *subdir;
+    const size_t global_debug_dir_len = sizeof(global_debug_dir) - 1;
+    char *p;
+    obj_info_t *o1 = *objp, *o2;
+    size_t len;
 
     p = strrchr(binary_filename, '/');
     if (!p) {
@@ -419,197 +593,2493 @@ follow_debuglink(char *debuglink, int num_traces, void **traces, char **syms,
     }
     p[1] = '\0';
 
-    subdir = (char *)alloca(strlen(binary_filename) + 1);
-    strcpy(subdir, binary_filename);
-    strcpy(binary_filename, global_debug_dir);
-    strncat(binary_filename, subdir,
-	    PATH_MAX - strlen(binary_filename) - 1);
-    strncat(binary_filename, debuglink,
-	    PATH_MAX - strlen(binary_filename) - 1);
+    len = strlen(binary_filename);
+    if (len >= PATH_MAX - global_debug_dir_len)
+	len = PATH_MAX - global_debug_dir_len - 1;
+    memmove(binary_filename + global_debug_dir_len, binary_filename, len);
+    memcpy(binary_filename, global_debug_dir, global_debug_dir_len);
+    len += global_debug_dir_len;
+    strlcpy(binary_filename + len, debuglink, PATH_MAX - len);
+
+    append_obj(objp);
+    o2 = *objp;
+    o2->base_addr = o1->base_addr;
+    o2->path = o1->path;
+    fill_lines(num_traces, traces, 0, objp, lines, offset);
+}
+
+// check the path pattern of "/usr/lib/debug/.build-id/ab/cdef1234.debug"
+static void
+follow_debuglink_build_id(const char *build_id, size_t build_id_size, int num_traces, void **traces,
+                          obj_info_t **objp, line_info_t *lines, int offset)
+{
+    static const char global_debug_dir[] = "/usr/lib/debug/.build-id/";
+    const size_t global_debug_dir_len = sizeof(global_debug_dir) - 1;
+    char *p;
+    obj_info_t *o1 = *objp, *o2;
+    size_t i;
+
+    if (PATH_MAX < global_debug_dir_len + 1 + build_id_size * 2 + 6) return;
+
+    memcpy(binary_filename, global_debug_dir, global_debug_dir_len);
+    p = binary_filename + global_debug_dir_len;
+    for (i = 0; i < build_id_size; i++) {
+        static const char tbl[] = "0123456789abcdef";
+        unsigned char n = build_id[i];
+        *p++ = tbl[n / 16];
+        *p++ = tbl[n % 16];
+        if (i == 0) *p++ = '/';
+    }
+    strcpy(p, ".debug");
 
-    munmap(current_line->mapped, current_line->mapped_size);
-    close(current_line->fd);
-    fill_lines(num_traces, traces, syms, 0, current_line, lines);
+    append_obj(objp);
+    o2 = *objp;
+    o2->base_addr = o1->base_addr;
+    o2->path = o1->path;
+    fill_lines(num_traces, traces, 0, objp, lines, offset);
+}
+#endif
+
+enum
+{
+    DW_TAG_compile_unit = 0x11,
+    DW_TAG_inlined_subroutine = 0x1d,
+    DW_TAG_subprogram = 0x2e,
+};
+
+/* Attributes encodings */
+enum
+{
+    DW_AT_sibling = 0x01,
+    DW_AT_location = 0x02,
+    DW_AT_name = 0x03,
+    /* Reserved 0x04 */
+    /* Reserved 0x05 */
+    /* Reserved 0x06 */
+    /* Reserved 0x07 */
+    /* Reserved 0x08 */
+    DW_AT_ordering = 0x09,
+    /* Reserved 0x0a */
+    DW_AT_byte_size = 0x0b,
+    /* Reserved 0x0c */
+    DW_AT_bit_size = 0x0d,
+    /* Reserved 0x0e */
+    /* Reserved 0x0f */
+    DW_AT_stmt_list = 0x10,
+    DW_AT_low_pc = 0x11,
+    DW_AT_high_pc = 0x12,
+    DW_AT_language = 0x13,
+    /* Reserved 0x14 */
+    DW_AT_discr = 0x15,
+    DW_AT_discr_value = 0x16,
+    DW_AT_visibility = 0x17,
+    DW_AT_import = 0x18,
+    DW_AT_string_length = 0x19,
+    DW_AT_common_reference = 0x1a,
+    DW_AT_comp_dir = 0x1b,
+    DW_AT_const_value = 0x1c,
+    DW_AT_containing_type = 0x1d,
+    DW_AT_default_value = 0x1e,
+    /* Reserved 0x1f */
+    DW_AT_inline = 0x20,
+    DW_AT_is_optional = 0x21,
+    DW_AT_lower_bound = 0x22,
+    /* Reserved 0x23 */
+    /* Reserved 0x24 */
+    DW_AT_producer = 0x25,
+    /* Reserved 0x26 */
+    DW_AT_prototyped = 0x27,
+    /* Reserved 0x28 */
+    /* Reserved 0x29 */
+    DW_AT_return_addr = 0x2a,
+    /* Reserved 0x2b */
+    DW_AT_start_scope = 0x2c,
+    /* Reserved 0x2d */
+    DW_AT_bit_stride = 0x2e,
+    DW_AT_upper_bound = 0x2f,
+    /* Reserved 0x30 */
+    DW_AT_abstract_origin = 0x31,
+    DW_AT_accessibility = 0x32,
+    DW_AT_address_class = 0x33,
+    DW_AT_artificial = 0x34,
+    DW_AT_base_types = 0x35,
+    DW_AT_calling_convention = 0x36,
+    DW_AT_count = 0x37,
+    DW_AT_data_member_location = 0x38,
+    DW_AT_decl_column = 0x39,
+    DW_AT_decl_file = 0x3a,
+    DW_AT_decl_line = 0x3b,
+    DW_AT_declaration = 0x3c,
+    DW_AT_discr_list = 0x3d,
+    DW_AT_encoding = 0x3e,
+    DW_AT_external = 0x3f,
+    DW_AT_frame_base = 0x40,
+    DW_AT_friend = 0x41,
+    DW_AT_identifier_case = 0x42,
+    /* Reserved 0x43 */
+    DW_AT_namelist_item = 0x44,
+    DW_AT_priority = 0x45,
+    DW_AT_segment = 0x46,
+    DW_AT_specification = 0x47,
+    DW_AT_static_link = 0x48,
+    DW_AT_type = 0x49,
+    DW_AT_use_location = 0x4a,
+    DW_AT_variable_parameter = 0x4b,
+    DW_AT_virtuality = 0x4c,
+    DW_AT_vtable_elem_location = 0x4d,
+    DW_AT_allocated = 0x4e,
+    DW_AT_associated = 0x4f,
+    DW_AT_data_location = 0x50,
+    DW_AT_byte_stride = 0x51,
+    DW_AT_entry_pc = 0x52,
+    DW_AT_use_UTF8 = 0x53,
+    DW_AT_extension = 0x54,
+    DW_AT_ranges = 0x55,
+    DW_AT_trampoline = 0x56,
+    DW_AT_call_column = 0x57,
+    DW_AT_call_file = 0x58,
+    DW_AT_call_line = 0x59,
+    DW_AT_description = 0x5a,
+    DW_AT_binary_scale = 0x5b,
+    DW_AT_decimal_scale = 0x5c,
+    DW_AT_small = 0x5d,
+    DW_AT_decimal_sign = 0x5e,
+    DW_AT_digit_count = 0x5f,
+    DW_AT_picture_string = 0x60,
+    DW_AT_mutable = 0x61,
+    DW_AT_threads_scaled = 0x62,
+    DW_AT_explicit = 0x63,
+    DW_AT_object_pointer = 0x64,
+    DW_AT_endianity = 0x65,
+    DW_AT_elemental = 0x66,
+    DW_AT_pure = 0x67,
+    DW_AT_recursive = 0x68,
+    DW_AT_signature = 0x69,
+    DW_AT_main_subprogram = 0x6a,
+    DW_AT_data_bit_offset = 0x6b,
+    DW_AT_const_expr = 0x6c,
+    DW_AT_enum_class = 0x6d,
+    DW_AT_linkage_name = 0x6e,
+    DW_AT_string_length_bit_size = 0x6f,
+    DW_AT_string_length_byte_size = 0x70,
+    DW_AT_rank = 0x71,
+    DW_AT_str_offsets_base = 0x72,
+    DW_AT_addr_base = 0x73,
+    DW_AT_rnglists_base = 0x74,
+    /* Reserved 0x75 */
+    DW_AT_dwo_name = 0x76,
+    DW_AT_reference = 0x77,
+    DW_AT_rvalue_reference = 0x78,
+    DW_AT_macros = 0x79,
+    DW_AT_call_all_calls = 0x7a,
+    DW_AT_call_all_source_calls = 0x7b,
+    DW_AT_call_all_tail_calls = 0x7c,
+    DW_AT_call_return_pc = 0x7d,
+    DW_AT_call_value = 0x7e,
+    DW_AT_call_origin = 0x7f,
+    DW_AT_call_parameter = 0x80,
+    DW_AT_call_pc = 0x81,
+    DW_AT_call_tail_call = 0x82,
+    DW_AT_call_target = 0x83,
+    DW_AT_call_target_clobbered = 0x84,
+    DW_AT_call_data_location = 0x85,
+    DW_AT_call_data_value = 0x86,
+    DW_AT_noreturn = 0x87,
+    DW_AT_alignment = 0x88,
+    DW_AT_export_symbols = 0x89,
+    DW_AT_deleted = 0x8a,
+    DW_AT_defaulted = 0x8b,
+    DW_AT_loclists_base = 0x8c,
+    DW_AT_lo_user = 0x2000,
+    DW_AT_hi_user = 0x3fff
+};
+
+/* Attribute form encodings */
+enum
+{
+    DW_FORM_addr = 0x01,
+    /* Reserved 0x02 */
+    DW_FORM_block2 = 0x03,
+    DW_FORM_block4 = 0x04,
+    DW_FORM_data2 = 0x05,
+    DW_FORM_data4 = 0x06,
+    DW_FORM_data8 = 0x07,
+    DW_FORM_string = 0x08,
+    DW_FORM_block = 0x09,
+    DW_FORM_block1 = 0x0a,
+    DW_FORM_data1 = 0x0b,
+    DW_FORM_flag = 0x0c,
+    DW_FORM_sdata = 0x0d,
+    DW_FORM_strp = 0x0e,
+    DW_FORM_udata = 0x0f,
+    DW_FORM_ref_addr = 0x10,
+    DW_FORM_ref1 = 0x11,
+    DW_FORM_ref2 = 0x12,
+    DW_FORM_ref4 = 0x13,
+    DW_FORM_ref8 = 0x14,
+    DW_FORM_ref_udata = 0x15,
+    DW_FORM_indirect = 0x16,
+    DW_FORM_sec_offset = 0x17,
+    DW_FORM_exprloc = 0x18,
+    DW_FORM_flag_present = 0x19,
+    DW_FORM_strx = 0x1a,
+    DW_FORM_addrx = 0x1b,
+    DW_FORM_ref_sup4 = 0x1c,
+    DW_FORM_strp_sup = 0x1d,
+    DW_FORM_data16 = 0x1e,
+    DW_FORM_line_strp = 0x1f,
+    DW_FORM_ref_sig8 = 0x20,
+    DW_FORM_implicit_const = 0x21,
+    DW_FORM_loclistx = 0x22,
+    DW_FORM_rnglistx = 0x23,
+    DW_FORM_ref_sup8 = 0x24,
+    DW_FORM_strx1 = 0x25,
+    DW_FORM_strx2 = 0x26,
+    DW_FORM_strx3 = 0x27,
+    DW_FORM_strx4 = 0x28,
+    DW_FORM_addrx1 = 0x29,
+    DW_FORM_addrx2 = 0x2a,
+    DW_FORM_addrx3 = 0x2b,
+    DW_FORM_addrx4 = 0x2c
+};
+
+/* Range list entry encodings */
+enum {
+    DW_RLE_end_of_list = 0x00,
+    DW_RLE_base_addressx = 0x01,
+    DW_RLE_startx_endx = 0x02,
+    DW_RLE_startx_length = 0x03,
+    DW_RLE_offset_pair = 0x04,
+    DW_RLE_base_address = 0x05,
+    DW_RLE_start_end = 0x06,
+    DW_RLE_start_length = 0x07
+};
+
+enum {
+    VAL_none = 0,
+    VAL_cstr = 1,
+    VAL_data = 2,
+    VAL_uint = 3,
+    VAL_int = 4,
+    VAL_addr = 5
+};
+
+# define ABBREV_TABLE_SIZE 256
+typedef struct {
+    obj_info_t *obj;
+    const char *file;
+    uint8_t current_version;
+    const char *current_cu;
+    uint64_t current_low_pc;
+    uint64_t current_str_offsets_base;
+    uint64_t current_addr_base;
+    uint64_t current_rnglists_base;
+    const char *debug_line_cu_end;
+    uint8_t debug_line_format;
+    uint16_t debug_line_version;
+    const char *debug_line_files;
+    const char *debug_line_directories;
+    const char *p;
+    const char *cu_end;
+    const char *pend;
+    const char *q0;
+    const char *q;
+    int format; // 4 or 8
+    uint8_t address_size;
+    int level;
+    const char *abbrev_table[ABBREV_TABLE_SIZE];
+} DebugInfoReader;
+
+typedef struct {
+    ptrdiff_t pos;
+    int tag;
+    int has_children;
+} DIE;
+
+typedef struct {
+    union {
+        const char *ptr;
+        uint64_t uint64;
+        int64_t int64;
+        uint64_t addr_idx;
+    } as;
+    uint64_t off;
+    uint64_t at;
+    uint64_t form;
+    size_t size;
+    int type;
+} DebugInfoValue;
+
+#if defined(WORDS_BIGENDIAN)
+#define MERGE_2INTS(a,b,sz) (((uint64_t)(a)<<sz)|(b))
+#else
+#define MERGE_2INTS(a,b,sz) (((uint64_t)(b)<<sz)|(a))
+#endif
+
+static uint16_t
+get_uint16(const uint8_t *p)
+{
+    return (uint16_t)MERGE_2INTS(p[0],p[1],8);
+}
+
+static uint32_t
+get_uint32(const uint8_t *p)
+{
+    return (uint32_t)MERGE_2INTS(get_uint16(p),get_uint16(p+2),16);
+}
+
+static uint64_t
+get_uint64(const uint8_t *p)
+{
+    return MERGE_2INTS(get_uint32(p),get_uint32(p+4),32);
+}
+
+static uint8_t
+read_uint8(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 1);
+    return (uint8_t)*p;
+}
+
+static uint16_t
+read_uint16(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 2);
+    return get_uint16((const uint8_t *)p);
+}
+
+static uint32_t
+read_uint24(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 3);
+    return ((uint8_t)*p << 16) | get_uint16((const uint8_t *)p+1);
+}
+
+static uint32_t
+read_uint32(const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = (p + 4);
+    return get_uint32((const uint8_t *)p);
+}
+
+static uint64_t
+read_uint64(const char **ptr)
+{
+    const unsigned char *p = (const unsigned char *)*ptr;
+    *ptr = (char *)(p + 8);
+    return get_uint64(p);
+}
+
+static uintptr_t
+read_uintptr(const char **ptr)
+{
+    const unsigned char *p = (const unsigned char *)*ptr;
+    *ptr = (char *)(p + SIZEOF_VOIDP);
+#if SIZEOF_VOIDP == 8
+    return get_uint64(p);
+#else
+    return get_uint32(p);
+#endif
+}
+
+static uint64_t
+read_uint(DebugInfoReader *reader)
+{
+    if (reader->format == 4) {
+        return read_uint32(&reader->p);
+    } else { /* 64 bit */
+        return read_uint64(&reader->p);
+    }
+}
+
+static uint64_t
+read_uleb128(DebugInfoReader *reader)
+{
+    return uleb128(&reader->p);
+}
+
+static int64_t
+read_sleb128(DebugInfoReader *reader)
+{
+    return sleb128(&reader->p);
 }
 
-/* read file and fill lines */
 static void
-fill_lines(int num_traces, void **traces, char **syms, int check_debuglink,
-	   line_info_t *current_line, line_info_t *lines)
+debug_info_reader_init(DebugInfoReader *reader, obj_info_t *obj)
 {
-    int i;
+    reader->file = obj->mapped;
+    reader->obj = obj;
+    reader->p = obj->debug_info.ptr;
+    reader->pend = obj->debug_info.ptr + obj->debug_info.size;
+    reader->debug_line_cu_end = obj->debug_line.ptr;
+    reader->current_low_pc = 0;
+    reader->current_str_offsets_base = 0;
+    reader->current_addr_base = 0;
+    reader->current_rnglists_base = 0;
+}
+
+static void
+di_skip_die_attributes(const char **p)
+{
+    for (;;) {
+        uint64_t at = uleb128(p);
+        uint64_t form = uleb128(p);
+        if (!at && !form) break;
+        switch (form) {
+          default:
+            break;
+          case DW_FORM_implicit_const:
+            sleb128(p);
+            break;
+        }
+    }
+}
+
+static void
+di_read_debug_abbrev_cu(DebugInfoReader *reader)
+{
+    uint64_t prev = 0;
+    const char *p = reader->q0;
+    for (;;) {
+        uint64_t abbrev_number = uleb128(&p);
+        if (abbrev_number <= prev) break;
+        if (abbrev_number < ABBREV_TABLE_SIZE) {
+            reader->abbrev_table[abbrev_number] = p;
+        }
+        prev = abbrev_number;
+        uleb128(&p); /* tag */
+        p++; /* has_children */
+        di_skip_die_attributes(&p);
+    }
+}
+
+static int
+di_read_debug_line_cu(DebugInfoReader *reader)
+{
+    const char *p;
+    struct LineNumberProgramHeader header;
+
+    p = (const char *)reader->debug_line_cu_end;
+    if (parse_debug_line_header(reader->obj, &p, &header))
+        return -1;
+
+    reader->debug_line_cu_end = (char *)header.cu_end;
+    reader->debug_line_format = header.format;
+    reader->debug_line_version = header.version;
+    reader->debug_line_directories = (char *)header.include_directories;
+    reader->debug_line_files = (char *)header.filenames;
+
+    return 0;
+}
+
+static void
+set_addr_idx_value(DebugInfoValue *v, uint64_t n)
+{
+    v->as.addr_idx = n;
+    v->type = VAL_addr;
+}
+
+static void
+set_uint_value(DebugInfoValue *v, uint64_t n)
+{
+    v->as.uint64 = n;
+    v->type = VAL_uint;
+}
+
+static void
+set_int_value(DebugInfoValue *v, int64_t n)
+{
+    v->as.int64 = n;
+    v->type = VAL_int;
+}
+
+static void
+set_cstr_value(DebugInfoValue *v, const char *s)
+{
+    v->as.ptr = s;
+    v->off = 0;
+    v->type = VAL_cstr;
+}
+
+static void
+set_cstrp_value(DebugInfoValue *v, const char *s, uint64_t off)
+{
+    v->as.ptr = s;
+    v->off = off;
+    v->type = VAL_cstr;
+}
+
+static void
+set_data_value(DebugInfoValue *v, const char *s)
+{
+    v->as.ptr = s;
+    v->type = VAL_data;
+}
+
+static const char *
+get_cstr_value(DebugInfoValue *v)
+{
+    if (v->as.ptr) {
+        return v->as.ptr + v->off;
+    } else {
+        return NULL;
+    }
+}
+
+static const char *
+resolve_strx(DebugInfoReader *reader, uint64_t idx)
+{
+    const char *p = reader->obj->debug_str_offsets.ptr + reader->current_str_offsets_base;
+    uint64_t off;
+    if (reader->format == 4) {
+        off = ((uint32_t *)p)[idx];
+    }
+    else {
+        off = ((uint64_t *)p)[idx];
+    }
+    return reader->obj->debug_str.ptr + off;
+}
+
+static void
+debug_info_reader_read_addr_value(DebugInfoReader *reader, DebugInfoValue *v)
+{
+    if (reader->address_size == 4) {
+        set_uint_value(v, read_uint32(&reader->p));
+    } else if (reader->address_size == 8) {
+        set_uint_value(v, read_uint64(&reader->p));
+    } else {
+        fprintf(stderr,"unknown address_size:%d", reader->address_size);
+        abort();
+    }
+}
+
+static void
+debug_info_reader_read_value(DebugInfoReader *reader, uint64_t form, DebugInfoValue *v)
+{
+    switch (form) {
+      case DW_FORM_addr:
+        debug_info_reader_read_addr_value(reader, v);
+        break;
+      case DW_FORM_block2:
+        v->size = read_uint16(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_block4:
+        v->size = read_uint32(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_data2:
+        set_uint_value(v, read_uint16(&reader->p));
+        break;
+      case DW_FORM_data4:
+        set_uint_value(v, read_uint32(&reader->p));
+        break;
+      case DW_FORM_data8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_string:
+        v->size = strlen(reader->p);
+        set_cstr_value(v, reader->p);
+        reader->p += v->size + 1;
+        break;
+      case DW_FORM_block:
+        v->size = uleb128(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_block1:
+        v->size = read_uint8(&reader->p);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_data1:
+        set_uint_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_flag:
+        set_uint_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_sdata:
+        set_int_value(v, read_sleb128(reader));
+        break;
+      case DW_FORM_strp:
+        set_cstrp_value(v, reader->obj->debug_str.ptr, read_uint(reader));
+        break;
+      case DW_FORM_udata:
+        set_uint_value(v, read_uleb128(reader));
+        break;
+      case DW_FORM_ref_addr:
+        if (reader->current_version <= 2) {
+            // DWARF Version 2 specifies that references have
+            // the same size as an address on the target system
+            debug_info_reader_read_addr_value(reader, v);
+        } else {
+            if (reader->format == 4) {
+                set_uint_value(v, read_uint32(&reader->p));
+            } else if (reader->format == 8) {
+                set_uint_value(v, read_uint64(&reader->p));
+            } else {
+                fprintf(stderr,"unknown format:%d", reader->format);
+                abort();
+            }
+        }
+        break;
+      case DW_FORM_ref1:
+        set_uint_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_ref2:
+        set_uint_value(v, read_uint16(&reader->p));
+        break;
+      case DW_FORM_ref4:
+        set_uint_value(v, read_uint32(&reader->p));
+        break;
+      case DW_FORM_ref8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_ref_udata:
+        set_uint_value(v, uleb128(&reader->p));
+        break;
+      case DW_FORM_indirect:
+        /* TODO: read the referred value */
+        set_uint_value(v, uleb128(&reader->p));
+        break;
+      case DW_FORM_sec_offset:
+        set_uint_value(v, read_uint(reader)); /* offset */
+        /* addrptr: debug_addr */
+        /* lineptr: debug_line */
+        /* loclist: debug_loclists */
+        /* loclistptr: debug_loclists */
+        /* macptr: debug_macro */
+        /* rnglist: debug_rnglists */
+        /* rnglistptr: debug_rnglists */
+        /* stroffsetsptr: debug_str_offsets */
+        break;
+      case DW_FORM_exprloc:
+        v->size = (size_t)read_uleb128(reader);
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_flag_present:
+        set_uint_value(v, 1);
+        break;
+      case DW_FORM_strx:
+        set_cstr_value(v, resolve_strx(reader, uleb128(&reader->p)));
+        break;
+      case DW_FORM_addrx:
+        set_addr_idx_value(v, uleb128(&reader->p));
+        break;
+      case DW_FORM_ref_sup4:
+        set_uint_value(v, read_uint32(&reader->p));
+        break;
+      case DW_FORM_strp_sup:
+        set_uint_value(v, read_uint(reader));
+        /* *p = reader->sup_file + reader->sup_str->sh_offset + ret; */
+        break;
+      case DW_FORM_data16:
+        v->size = 16;
+        set_data_value(v, reader->p);
+        reader->p += v->size;
+        break;
+      case DW_FORM_line_strp:
+        set_cstrp_value(v, reader->obj->debug_line_str.ptr, read_uint(reader));
+        break;
+      case DW_FORM_ref_sig8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_implicit_const:
+        set_int_value(v, sleb128(&reader->q));
+        break;
+      case DW_FORM_loclistx:
+        set_uint_value(v, read_uleb128(reader));
+        break;
+      case DW_FORM_rnglistx:
+        set_uint_value(v, read_uleb128(reader));
+        break;
+      case DW_FORM_ref_sup8:
+        set_uint_value(v, read_uint64(&reader->p));
+        break;
+      case DW_FORM_strx1:
+        set_cstr_value(v, resolve_strx(reader, read_uint8(&reader->p)));
+        break;
+      case DW_FORM_strx2:
+        set_cstr_value(v, resolve_strx(reader, read_uint16(&reader->p)));
+        break;
+      case DW_FORM_strx3:
+        set_cstr_value(v, resolve_strx(reader, read_uint24(&reader->p)));
+        break;
+      case DW_FORM_strx4:
+        set_cstr_value(v, resolve_strx(reader, read_uint32(&reader->p)));
+        break;
+      case DW_FORM_addrx1:
+        set_addr_idx_value(v, read_uint8(&reader->p));
+        break;
+      case DW_FORM_addrx2:
+        set_addr_idx_value(v, read_uint16(&reader->p));
+        break;
+      case DW_FORM_addrx3:
+        set_addr_idx_value(v, read_uint24(&reader->p));
+        break;
+      case DW_FORM_addrx4:
+        set_addr_idx_value(v, read_uint32(&reader->p));
+        break;
+      case 0:
+        goto fail;
+        break;
+    }
+    return;
+
+  fail:
+    fprintf(stderr, "%d: unsupported form: %#"PRIx64"\n", __LINE__, form);
+    exit(1);
+}
+
+/* find abbrev in current compilation unit */
+static const char *
+di_find_abbrev(DebugInfoReader *reader, uint64_t abbrev_number)
+{
+    const char *p;
+    if (abbrev_number < ABBREV_TABLE_SIZE) {
+        return reader->abbrev_table[abbrev_number];
+    }
+    p = reader->abbrev_table[ABBREV_TABLE_SIZE-1];
+    /* skip 255th record */
+    uleb128(&p); /* tag */
+    p++; /* has_children */
+    di_skip_die_attributes(&p);
+    for (uint64_t n = uleb128(&p); abbrev_number != n; n = uleb128(&p)) {
+        if (n == 0) {
+            fprintf(stderr,"%d: Abbrev Number %"PRId64" not found\n",__LINE__, abbrev_number);
+            exit(1);
+        }
+        uleb128(&p); /* tag */
+        p++; /* has_children */
+        di_skip_die_attributes(&p);
+    }
+    return p;
+}
+
+#if 0
+static void
+hexdump0(const unsigned char *p, size_t n)
+{
+    size_t i;
+    fprintf(stderr, "     0  1  2  3  4  5  6  7  8  9  A  B  C  D  E  F\n");
+    for (i=0; i < n; i++){
+        switch (i & 15) {
+          case 0:
+            fprintf(stderr, "%02" PRIdSIZE ": %02X ", i/16, p[i]);
+            break;
+          case 15:
+            fprintf(stderr, "%02X\n", p[i]);
+            break;
+          default:
+            fprintf(stderr, "%02X ", p[i]);
+            break;
+        }
+    }
+    if ((i & 15) != 15) {
+        fprintf(stderr, "\n");
+    }
+}
+#define hexdump(p,n) hexdump0((const unsigned char *)p, n)
+
+static void
+div_inspect(DebugInfoValue *v)
+{
+    switch (v->type) {
+      case VAL_uint:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:%"PRIx64"\n",__LINE__,v->type,v->size,v->as.uint64);
+        break;
+      case VAL_int:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:%"PRId64"\n",__LINE__,v->type,v->size,(int64_t)v->as.uint64);
+        break;
+      case VAL_cstr:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:'%s'\n",__LINE__,v->type,v->size,v->as.ptr);
+        break;
+      case VAL_data:
+        fprintf(stderr,"%d: type:%d size:%" PRIxSIZE " v:\n",__LINE__,v->type,v->size);
+        hexdump(v->as.ptr, 16);
+        break;
+    }
+}
+#endif
+
+static DIE *
+di_read_die(DebugInfoReader *reader, DIE *die)
+{
+    uint64_t abbrev_number = uleb128(&reader->p);
+    if (abbrev_number == 0) {
+        reader->level--;
+        return NULL;
+    }
+
+    reader->q = di_find_abbrev(reader, abbrev_number);
+
+    die->pos = reader->p - reader->obj->debug_info.ptr - 1;
+    die->tag = (int)uleb128(&reader->q); /* tag */
+    die->has_children = *reader->q++; /* has_children */
+    if (die->has_children) {
+        reader->level++;
+    }
+    return die;
+}
+
+static DebugInfoValue *
+di_read_record(DebugInfoReader *reader, DebugInfoValue *vp)
+{
+    uint64_t at = uleb128(&reader->q);
+    uint64_t form = uleb128(&reader->q);
+    if (!at || !form) return NULL;
+    vp->at = at;
+    vp->form = form;
+    debug_info_reader_read_value(reader, form, vp);
+    return vp;
+}
+
+static void
+di_skip_records(DebugInfoReader *reader)
+{
+    for (;;) {
+        DebugInfoValue v = {{}};
+        uint64_t at = uleb128(&reader->q);
+        uint64_t form = uleb128(&reader->q);
+        if (!at || !form) return;
+        debug_info_reader_read_value(reader, form, &v);
+    }
+}
+
+typedef struct addr_header {
+    const char *ptr;
+    uint64_t unit_length;
+    uint8_t format;
+    uint8_t address_size;
+    /* uint8_t segment_selector_size; */
+} addr_header_t;
+
+static void
+addr_header_init(obj_info_t *obj, addr_header_t *header) {
+    const char *p = obj->debug_addr.ptr;
+
+    header->ptr = p;
+
+    if (!p) return;
+
+    header->unit_length = *(uint32_t *)p;
+    p += sizeof(uint32_t);
+
+    header->format = 4;
+    if (header->unit_length == 0xffffffff) {
+        header->unit_length = *(uint64_t *)p;
+        p += sizeof(uint64_t);
+        header->format = 8;
+    }
+
+    p += 2; /* version */
+    header->address_size = *p++;
+    p++; /* segment_selector_size */
+}
+
+static uint64_t
+read_addr(addr_header_t *header, uint64_t addr_base, uint64_t idx) {
+    if (header->address_size == 4) {
+        return ((uint32_t*)(header->ptr + addr_base))[idx];
+    }
+    else {
+        return ((uint64_t*)(header->ptr + addr_base))[idx];
+    }
+}
+
+typedef struct rnglists_header {
+    uint64_t unit_length;
+    uint8_t format;
+    uint8_t address_size;
+    uint32_t offset_entry_count;
+} rnglists_header_t;
+
+static void
+rnglists_header_init(obj_info_t *obj, rnglists_header_t *header) {
+    const char *p = obj->debug_rnglists.ptr;
+
+    if (!p) return;
+
+    header->unit_length = *(uint32_t *)p;
+    p += sizeof(uint32_t);
+
+    header->format = 4;
+    if (header->unit_length == 0xffffffff) {
+        header->unit_length = *(uint64_t *)p;
+        p += sizeof(uint64_t);
+        header->format = 8;
+    }
+
+    p += 2; /* version */
+    header->address_size = *p++;
+    p++; /* segment_selector_size */
+    header->offset_entry_count = *(uint32_t *)p;
+}
+
+typedef struct {
+    uint64_t low_pc;
+    uint64_t high_pc;
+    uint64_t ranges;
+    bool low_pc_set;
+    bool high_pc_set;
+    bool ranges_set;
+} ranges_t;
+
+static void
+ranges_set(ranges_t *ptr, DebugInfoValue *v, addr_header_t *addr_header, uint64_t addr_base)
+{
+    uint64_t n = 0;
+    if (v->type == VAL_uint) {
+        n = v->as.uint64;
+    }
+    else if (v->type == VAL_addr) {
+        n = read_addr(addr_header, addr_base, v->as.addr_idx);
+    }
+    switch (v->at) {
+      case DW_AT_low_pc:
+        ptr->low_pc = n;
+        ptr->low_pc_set = true;
+        break;
+      case DW_AT_high_pc:
+        if (v->form == DW_FORM_addr) {
+            ptr->high_pc = n;
+        }
+        else {
+            ptr->high_pc = ptr->low_pc + n;
+        }
+        ptr->high_pc_set = true;
+        break;
+      case DW_AT_ranges:
+        ptr->ranges = n;
+        ptr->ranges_set = true;
+        break;
+    }
+}
+
+static uint64_t
+read_dw_form_addr(DebugInfoReader *reader, const char **ptr)
+{
+    const char *p = *ptr;
+    *ptr = p + reader->address_size;
+    if (reader->address_size == 4) {
+        return read_uint32(&p);
+    } else if (reader->address_size == 8) {
+        return read_uint64(&p);
+    } else {
+        fprintf(stderr,"unknown address_size:%d", reader->address_size);
+        abort();
+    }
+}
+
+static uintptr_t
+ranges_include(DebugInfoReader *reader, ranges_t *ptr, uint64_t addr, rnglists_header_t *rnglists_header)
+{
+    if (ptr->high_pc_set) {
+        if (ptr->ranges_set || !ptr->low_pc_set) {
+            exit(1);
+        }
+        if (ptr->low_pc <= addr && addr <= ptr->high_pc) {
+            return (uintptr_t)ptr->low_pc;
+        }
+    }
+    else if (ptr->ranges_set) {
+        /* TODO: support base address selection entry */
+        const char *p;
+        uint64_t base = ptr->low_pc_set ? ptr->low_pc : reader->current_low_pc;
+        bool base_valid = true;
+        if (reader->current_version >= 5) {
+            if (rnglists_header->offset_entry_count == 0) {
+                // DW_FORM_sec_offset
+                p = reader->obj->debug_rnglists.ptr + ptr->ranges + reader->current_rnglists_base;
+            }
+            else {
+                // DW_FORM_rnglistx
+                const char *offset_array = reader->obj->debug_rnglists.ptr + reader->current_rnglists_base;
+                if (rnglists_header->format == 4) {
+                    p = offset_array + ((uint32_t *)offset_array)[ptr->ranges];
+                }
+                else {
+                    p = offset_array + ((uint64_t *)offset_array)[ptr->ranges];
+                }
+            }
+            for (;;) {
+                uint8_t rle = read_uint8(&p);
+                uintptr_t from = 0, to = 0;
+                if (rle == DW_RLE_end_of_list) break;
+                switch (rle) {
+                  case DW_RLE_base_addressx:
+                    uleb128(&p);
+                    base_valid = false; /* not supported yet */
+                    break;
+                  case DW_RLE_startx_endx:
+                    uleb128(&p);
+                    uleb128(&p);
+                    break;
+                  case DW_RLE_startx_length:
+                    uleb128(&p);
+                    uleb128(&p);
+                    break;
+                  case DW_RLE_offset_pair:
+                    if (!base_valid) break;
+                    from = (uintptr_t)base + uleb128(&p);
+                    to = (uintptr_t)base + uleb128(&p);
+                    break;
+                  case DW_RLE_base_address:
+                    base = read_dw_form_addr(reader, &p);
+                    base_valid = true;
+                    break;
+                  case DW_RLE_start_end:
+                    from = (uintptr_t)read_dw_form_addr(reader, &p);
+                    to = (uintptr_t)read_dw_form_addr(reader, &p);
+                    break;
+                  case DW_RLE_start_length:
+                    from = (uintptr_t)read_dw_form_addr(reader, &p);
+                    to = from + uleb128(&p);
+                    break;
+                }
+                if (from <= addr && addr < to) {
+                    return from;
+                }
+            }
+            return false;
+        }
+        p = reader->obj->debug_ranges.ptr + ptr->ranges;
+        for (;;) {
+            uintptr_t from = read_uintptr(&p);
+            uintptr_t to = read_uintptr(&p);
+            if (!from && !to) break;
+            if (from == UINTPTR_MAX) {
+                /* base address selection entry */
+                base = to;
+            }
+            else if (base + from <= addr && addr < base + to) {
+                return (uintptr_t)base + from;
+            }
+        }
+    }
+    else if (ptr->low_pc_set) {
+        if (ptr->low_pc == addr) {
+            return (uintptr_t)ptr->low_pc;
+        }
+    }
+    return false;
+}
+
+#if 0
+static void
+ranges_inspect(DebugInfoReader *reader, ranges_t *ptr)
+{
+    if (ptr->high_pc_set) {
+        if (ptr->ranges_set || !ptr->low_pc_set) {
+            fprintf(stderr,"low_pc_set:%d high_pc_set:%d ranges_set:%d\n",ptr->low_pc_set,ptr->high_pc_set,ptr->ranges_set);
+            exit(1);
+        }
+        fprintf(stderr,"low_pc:%"PRIx64" high_pc:%"PRIx64"\n",ptr->low_pc,ptr->high_pc);
+    }
+    else if (ptr->ranges_set) {
+        char *p = reader->obj->debug_ranges.ptr + ptr->ranges;
+        fprintf(stderr,"low_pc:%"PRIx64" ranges:%"PRIx64" %lx ",ptr->low_pc,ptr->ranges, p-reader->obj->mapped);
+        for (;;) {
+            uintptr_t from = read_uintptr(&p);
+            uintptr_t to = read_uintptr(&p);
+            if (!from && !to) break;
+            fprintf(stderr,"%"PRIx64"-%"PRIx64" ",ptr->low_pc+from,ptr->low_pc+to);
+        }
+        fprintf(stderr,"\n");
+    }
+    else if (ptr->low_pc_set) {
+        fprintf(stderr,"low_pc:%"PRIx64"\n",ptr->low_pc);
+    }
+    else {
+        fprintf(stderr,"empty\n");
+    }
+}
+#endif
+
+static int
+di_read_cu(DebugInfoReader *reader)
+{
+    uint64_t unit_length;
+    uint16_t version;
+    uint64_t debug_abbrev_offset;
+    reader->format = 4;
+    reader->current_cu = reader->p;
+    unit_length = read_uint32(&reader->p);
+    if (unit_length == 0xffffffff) {
+        unit_length = read_uint64(&reader->p);
+        reader->format = 8;
+    }
+    reader->cu_end = reader->p + unit_length;
+    version = read_uint16(&reader->p);
+    reader->current_version = version;
+    if (version > 5) {
+        return -1;
+    }
+    else if (version == 5) {
+        /* unit_type = */ read_uint8(&reader->p);
+        reader->address_size = read_uint8(&reader->p);
+        debug_abbrev_offset = read_uint(reader);
+    }
+    else {
+        debug_abbrev_offset = read_uint(reader);
+        reader->address_size = read_uint8(&reader->p);
+    }
+    reader->q0 = reader->obj->debug_abbrev.ptr + debug_abbrev_offset;
+
+    reader->level = 0;
+    di_read_debug_abbrev_cu(reader);
+    if (di_read_debug_line_cu(reader)) return -1;
+
+#if defined(__GNUC__) && !defined(__clang__) && !defined(__INTEL_COMPILER_BUILD_DATE)
+    /* Though DWARF specifies "the applicable base address defaults to the base
+       address of the compilation unit", but GCC seems to use zero as default */
+#else
+    do {
+        DIE die;
+
+        if (!di_read_die(reader, &die)) continue;
+
+        if (die.tag != DW_TAG_compile_unit) {
+            di_skip_records(reader);
+            break;
+        }
+
+        reader->current_str_offsets_base = 0;
+        reader->current_addr_base = 0;
+        reader->current_rnglists_base = 0;
+
+        DebugInfoValue low_pc = {{}};
+        /* enumerate abbrev */
+        for (;;) {
+            DebugInfoValue v = {{}};
+            if (!di_read_record(reader, &v)) break;
+            switch (v.at) {
+              case DW_AT_low_pc:
+                // clang may output DW_AT_addr_base after DW_AT_low_pc.
+                // We need to resolve the DW_FORM_addr* after DW_AT_addr_base is parsed.
+                low_pc = v;
+                break;
+              case DW_AT_str_offsets_base:
+                reader->current_str_offsets_base = v.as.uint64;
+                break;
+              case DW_AT_addr_base:
+                reader->current_addr_base = v.as.uint64;
+                break;
+              case DW_AT_rnglists_base:
+                reader->current_rnglists_base = v.as.uint64;
+                break;
+            }
+        }
+        // Resolve the DW_FORM_addr of DW_AT_low_pc
+        switch (low_pc.type) {
+            case VAL_uint:
+                reader->current_low_pc = low_pc.as.uint64;
+                break;
+            case VAL_addr:
+                {
+                    addr_header_t header;
+                    addr_header_init(reader->obj, &header);
+                    reader->current_low_pc = read_addr(&header, reader->current_addr_base, low_pc.as.addr_idx);
+                }
+                break;
+        }
+    } while (0);
+#endif
+    return 0;
+}
+
+static void
+read_abstract_origin(DebugInfoReader *reader, uint64_t form, uint64_t abstract_origin, line_info_t *line)
+{
+    const char *p = reader->p;
+    const char *q = reader->q;
+    int level = reader->level;
+    DIE die;
+
+    switch (form) {
+      case DW_FORM_ref1:
+      case DW_FORM_ref2:
+      case DW_FORM_ref4:
+      case DW_FORM_ref8:
+      case DW_FORM_ref_udata:
+        reader->p = reader->current_cu + abstract_origin;
+        break;
+      case DW_FORM_ref_addr:
+        goto finish; /* not supported yet */
+      case DW_FORM_ref_sig8:
+        goto finish; /* not supported yet */
+      case DW_FORM_ref_sup4:
+      case DW_FORM_ref_sup8:
+        goto finish; /* not supported yet */
+      default:
+        goto finish;
+    }
+    if (!di_read_die(reader, &die)) goto finish;
+
+    /* enumerate abbrev */
+    for (;;) {
+        DebugInfoValue v = {{}};
+        if (!di_read_record(reader, &v)) break;
+        switch (v.at) {
+          case DW_AT_name:
+            line->sname = get_cstr_value(&v);
+            break;
+        }
+    }
+
+  finish:
+    reader->p = p;
+    reader->q = q;
+    reader->level = level;
+}
+
+static void
+debug_info_read(DebugInfoReader *reader, int num_traces, void **traces,
+         line_info_t *lines, int offset) {
+
+    addr_header_t addr_header = {};
+    addr_header_init(reader->obj, &addr_header);
+
+    rnglists_header_t rnglists_header = {};
+    rnglists_header_init(reader->obj, &rnglists_header);
+
+    while (reader->p < reader->cu_end) {
+        DIE die;
+        ranges_t ranges = {};
+        line_info_t line = {};
+
+        if (!di_read_die(reader, &die)) continue;
+        /* fprintf(stderr,"%d:%tx: <%d>\n",__LINE__,die.pos,reader->level,die.tag); */
+
+        if (die.tag != DW_TAG_subprogram && die.tag != DW_TAG_inlined_subroutine) {
+          skip_die:
+            di_skip_records(reader);
+            continue;
+        }
+
+        /* enumerate abbrev */
+        for (;;) {
+            DebugInfoValue v = {{}};
+            /* ptrdiff_t pos = reader->p - reader->p0; */
+            if (!di_read_record(reader, &v)) break;
+            /* fprintf(stderr,"\n%d:%tx: AT:%lx FORM:%lx\n",__LINE__,pos,v.at,v.form); */
+            /* div_inspect(&v); */
+            switch (v.at) {
+              case DW_AT_name:
+                line.sname = get_cstr_value(&v);
+                break;
+              case DW_AT_call_file:
+                fill_filename((int)v.as.uint64, reader->debug_line_format, reader->debug_line_version, reader->debug_line_directories, reader->debug_line_files, &line, reader->obj);
+                break;
+              case DW_AT_call_line:
+                line.line = (int)v.as.uint64;
+                break;
+              case DW_AT_low_pc:
+              case DW_AT_high_pc:
+              case DW_AT_ranges:
+                ranges_set(&ranges, &v, &addr_header, reader->current_addr_base);
+                break;
+              case DW_AT_declaration:
+                goto skip_die;
+              case DW_AT_inline:
+                /* 1 or 3 */
+                break; /* goto skip_die; */
+              case DW_AT_abstract_origin:
+                read_abstract_origin(reader, v.form, v.as.uint64, &line);
+                break; /* goto skip_die; */
+            }
+        }
+        /* ranges_inspect(reader, &ranges); */
+        /* fprintf(stderr,"%d:%tx: %x ",__LINE__,diepos,die.tag); */
+        for (int i=offset; i < num_traces; i++) {
+            uintptr_t addr = (uintptr_t)traces[i];
+            uintptr_t offset = addr - reader->obj->base_addr + reader->obj->vmaddr;
+            uintptr_t saddr = ranges_include(reader, &ranges, offset, &rnglists_header);
+            if (saddr) {
+                /* fprintf(stdout, "%d:%tx: %d %lx->%lx %x %s: %s/%s %d %s %s %s\n",__LINE__,die.pos, i,addr,offset, die.tag,line.sname,line.dirname,line.filename,line.line,reader->obj->path,line.sname,lines[i].sname); */
+                if (lines[i].sname) {
+                    line_info_t *lp = malloc(sizeof(line_info_t));
+                    memcpy(lp, &lines[i], sizeof(line_info_t));
+                    lines[i].next = lp;
+                    lp->dirname = line.dirname;
+                    lp->filename = line.filename;
+                    lp->line = line.line;
+                    lp->saddr = 0;
+                }
+                lines[i].path = reader->obj->path;
+                lines[i].base_addr = line.base_addr;
+                lines[i].sname = line.sname;
+                lines[i].saddr = saddr + reader->obj->base_addr - reader->obj->vmaddr;
+            }
+        }
+    }
+}
+
+// This function parses the following attributes of Line Number Program Header in DWARF 5:
+//
+// * directory_entry_format_count
+// * directory_entry_format
+// * directories_count
+// * directories
+//
+// or
+//
+// * file_name_entry_format_count
+// * file_name_entry_format
+// * file_names_count
+// * file_names
+//
+// It records DW_LNCT_path and DW_LNCT_directory_index at the index "idx".
+static const char *
+parse_ver5_debug_line_header(const char *p, int idx, uint8_t format, obj_info_t *obj, const char **out_path, uint64_t *out_directory_index) {
+    int i, j;
+    int entry_format_count = *(uint8_t *)p++;
+    const char *entry_format = p;
+
+    /* skip the part of entry_format */
+    for (i = 0; i < entry_format_count * 2; i++) uleb128(&p);
+
+    int entry_count = (int)uleb128(&p);
+
+    DebugInfoReader reader;
+    debug_info_reader_init(&reader, obj);
+    reader.format = format;
+    reader.p = p;
+    for (j = 0; j < entry_count; j++) {
+        const char *format = entry_format;
+        for (i = 0; i < entry_format_count; i++) {
+            DebugInfoValue v = {{}};
+            unsigned long dw_lnct = uleb128(&format);
+            unsigned long dw_form = uleb128(&format);
+            debug_info_reader_read_value(&reader, dw_form, &v);
+            if (dw_lnct == 1 /* DW_LNCT_path */ && v.type == VAL_cstr && out_path)
+                *out_path = v.as.ptr + v.off;
+            if (dw_lnct == 2 /* DW_LNCT_directory_index */ && v.type == VAL_uint && out_directory_index)
+                *out_directory_index = v.as.uint64;
+        }
+        if (j == idx) return 0;
+    }
+
+    return reader.p;
+}
+
+#ifdef USE_ELF
+static unsigned long
+uncompress_debug_section(ElfW(Shdr) *shdr, char *file, char **ptr)
+{
+    *ptr = NULL;
+#ifdef SUPPORT_COMPRESSED_DEBUG_LINE
+    ElfW(Chdr) *chdr = (ElfW(Chdr) *)(file + shdr->sh_offset);
+    unsigned long destsize = chdr->ch_size;
+    int ret = 0;
+
+    if (chdr->ch_type != ELFCOMPRESS_ZLIB) {
+	/* unsupported compression type */
+	return 0;
+    }
+
+    *ptr = malloc(destsize);
+    if (!*ptr) return 0;
+    ret = uncompress((Bytef *)*ptr, &destsize,
+	    (const Bytef*)chdr + sizeof(ElfW(Chdr)),
+            shdr->sh_size - sizeof(ElfW(Chdr)));
+    if (ret != Z_OK) goto fail;
+    return destsize;
+
+fail:
+    free(*ptr);
+    *ptr = NULL;
+#endif
+    return 0;
+}
+
+/* read file and fill lines */
+static uintptr_t
+fill_lines(int num_traces, void **traces, int check_debuglink,
+	   obj_info_t **objp, line_info_t *lines, int offset)
+{
+    int i, j;
     char *shstr;
-    char *section_name;
     ElfW(Ehdr) *ehdr;
     ElfW(Shdr) *shdr, *shstr_shdr;
-    ElfW(Shdr) *debug_line_shdr = NULL, *gnu_debuglink_shdr = NULL;
+    ElfW(Shdr) *gnu_debuglink_shdr = NULL;
+    ElfW(Shdr) *note_gnu_build_id = NULL;
     int fd;
     off_t filesize;
     char *file;
+    ElfW(Shdr) *symtab_shdr = NULL, *strtab_shdr = NULL;
+    ElfW(Shdr) *dynsym_shdr = NULL, *dynstr_shdr = NULL;
+    obj_info_t *obj = *objp;
+    uintptr_t dladdr_fbase = 0;
 
     fd = open(binary_filename, O_RDONLY);
     if (fd < 0) {
-	return;
+	goto fail;
     }
     filesize = lseek(fd, 0, SEEK_END);
     if (filesize < 0) {
 	int e = errno;
 	close(fd);
-	fprintf(stderr, "lseek: %s\n", strerror(e));
-	return;
+	kprintf("lseek: %s\n", strerror(e));
+	goto fail;
     }
+#if SIZEOF_OFF_T > SIZEOF_SIZE_T
+    if (filesize > (off_t)SIZE_MAX) {
+	close(fd);
+	kprintf("Too large file %s\n", binary_filename);
+	goto fail;
+    }
+#endif
     lseek(fd, 0, SEEK_SET);
     /* async-signal unsafe */
-    file = (char *)mmap(NULL, filesize, PROT_READ, MAP_SHARED, fd, 0);
+    file = (char *)mmap(NULL, (size_t)filesize, PROT_READ, MAP_SHARED, fd, 0);
     if (file == MAP_FAILED) {
 	int e = errno;
 	close(fd);
-	fprintf(stderr, "mmap: %s\n", strerror(e));
-	return;
+	kprintf("mmap: %s\n", strerror(e));
+	goto fail;
     }
+    close(fd);
 
-    current_line->fd = fd;
-    current_line->mapped = file;
-    current_line->mapped_size = filesize;
-
-    for (i = 0; i < num_traces; i++) {
-	const char *path;
-	size_t len;
-	if (get_path_from_symbol(syms[i], &path, &len) &&
-		!strncmp(path, binary_filename, len)) {
-	    lines[i].line = -1;
-	}
+    ehdr = (ElfW(Ehdr) *)file;
+    if (memcmp(ehdr->e_ident, "\177ELF", 4) != 0) {
+	/*
+	 * Huh? Maybe filename was overridden by setproctitle() and
+	 * it match non-elf file.
+	 */
+	goto fail;
     }
+    obj->mapped = file;
+    obj->mapped_size = (size_t)filesize;
 
-    ehdr = (ElfW(Ehdr) *)file;
     shdr = (ElfW(Shdr) *)(file + ehdr->e_shoff);
 
     shstr_shdr = shdr + ehdr->e_shstrndx;
     shstr = file + shstr_shdr->sh_offset;
 
     for (i = 0; i < ehdr->e_shnum; i++) {
-	section_name = shstr + shdr[i].sh_name;
-	if (!strcmp(section_name, ".debug_line")) {
-	    debug_line_shdr = shdr + i;
+        char *section_name = shstr + shdr[i].sh_name;
+	switch (shdr[i].sh_type) {
+	  case SHT_STRTAB:
+	    if (!strcmp(section_name, ".strtab")) {
+		strtab_shdr = shdr + i;
+	    }
+	    else if (!strcmp(section_name, ".dynstr")) {
+		dynstr_shdr = shdr + i;
+	    }
+	    break;
+	  case SHT_SYMTAB:
+	    /* if (!strcmp(section_name, ".symtab")) */
+	    symtab_shdr = shdr + i;
+	    break;
+	  case SHT_DYNSYM:
+	    /* if (!strcmp(section_name, ".dynsym")) */
+	    dynsym_shdr = shdr + i;
+	    break;
+          case SHT_NOTE:
+            if (!strcmp(section_name, ".note.gnu.build-id")) {
+                note_gnu_build_id = shdr + i;
+            }
+            break;
+	  case SHT_PROGBITS:
+	    if (!strcmp(section_name, ".gnu_debuglink")) {
+		gnu_debuglink_shdr = shdr + i;
+	    }
+            else {
+                const char *debug_section_names[] = {
+                    ".debug_abbrev",
+                    ".debug_info",
+                    ".debug_line",
+                    ".debug_ranges",
+                    ".debug_str_offsets",
+                    ".debug_addr",
+                    ".debug_rnglists",
+                    ".debug_str",
+                    ".debug_line_str"
+                };
+
+                for (j=0; j < DWARF_SECTION_COUNT; j++) {
+                    struct dwarf_section *s = obj_dwarf_section_at(obj, j);
+
+                    if (strcmp(section_name, debug_section_names[j]) != 0)
+                        continue;
+
+                    s->ptr = file + shdr[i].sh_offset;
+                    s->size = shdr[i].sh_size;
+                    s->flags = shdr[i].sh_flags;
+                    if (s->flags & SHF_COMPRESSED) {
+                        s->size = uncompress_debug_section(&shdr[i], file, &s->ptr);
+                        if (!s->size) goto fail;
+                    }
+                    break;
+                }
+            }
 	    break;
-	} else if (!strcmp(section_name, ".gnu_debuglink")) {
-	    gnu_debuglink_shdr = shdr + i;
 	}
     }
 
-    if (!debug_line_shdr) {
+    if (offset == -1) {
+	/* main executable */
+	offset = 0;
+	if (dynsym_shdr && dynstr_shdr) {
+	    char *strtab = file + dynstr_shdr->sh_offset;
+	    ElfW(Sym) *symtab = (ElfW(Sym) *)(file + dynsym_shdr->sh_offset);
+	    int symtab_count = (int)(dynsym_shdr->sh_size / sizeof(ElfW(Sym)));
+            void *handle = dlopen(NULL, RTLD_NOW|RTLD_LOCAL);
+            if (handle) {
+                for (j = 0; j < symtab_count; j++) {
+                    ElfW(Sym) *sym = &symtab[j];
+                    Dl_info info;
+                    void *s;
+                    if (ELF_ST_TYPE(sym->st_info) != STT_FUNC || sym->st_size == 0) continue;
+                    s = dlsym(handle, strtab + sym->st_name);
+                    if (s && dladdr(s, &info)) {
+                        obj->base_addr = dladdr_fbase;
+                        dladdr_fbase = (uintptr_t)info.dli_fbase;
+                        break;
+                    }
+                }
+                dlclose(handle);
+            }
+	    if (ehdr->e_type == ET_EXEC) {
+		obj->base_addr = 0;
+	    }
+	    else {
+		/* PIE (position-independent executable) */
+		obj->base_addr = dladdr_fbase;
+	    }
+	}
+    }
+
+    if (obj->debug_info.ptr && obj->debug_abbrev.ptr) {
+        DebugInfoReader reader;
+        debug_info_reader_init(&reader, obj);
+        i = 0;
+        while (reader.p < reader.pend) {
+            /* fprintf(stderr, "%d:%tx: CU[%d]\n", __LINE__, reader.p - reader.obj->debug_info.ptr, i++); */
+            if (di_read_cu(&reader)) goto use_symtab;
+            debug_info_read(&reader, num_traces, traces, lines, offset);
+        }
+    }
+    else {
+        /* This file doesn't have dwarf, use symtab or dynsym */
+use_symtab:
+        if (!symtab_shdr) {
+            /* This file doesn't have symtab, use dynsym instead */
+            symtab_shdr = dynsym_shdr;
+            strtab_shdr = dynstr_shdr;
+        }
+
+        if (symtab_shdr && strtab_shdr) {
+            char *strtab = file + strtab_shdr->sh_offset;
+            ElfW(Sym) *symtab = (ElfW(Sym) *)(file + symtab_shdr->sh_offset);
+            int symtab_count = (int)(symtab_shdr->sh_size / sizeof(ElfW(Sym)));
+            for (j = 0; j < symtab_count; j++) {
+                ElfW(Sym) *sym = &symtab[j];
+                uintptr_t saddr = (uintptr_t)sym->st_value + obj->base_addr;
+                if (ELF_ST_TYPE(sym->st_info) != STT_FUNC) continue;
+                for (i = offset; i < num_traces; i++) {
+                    uintptr_t d = (uintptr_t)traces[i] - saddr;
+                    if (lines[i].line > 0 || d > (uintptr_t)sym->st_size)
+                        continue;
+                    /* fill symbol name and addr from .symtab */
+                    if (!lines[i].sname) lines[i].sname = strtab + sym->st_name;
+                    lines[i].saddr = saddr;
+                    lines[i].path  = obj->path;
+                    lines[i].base_addr = obj->base_addr;
+                }
+            }
+        }
+    }
+
+    if (!obj->debug_line.ptr) {
 	/* This file doesn't have .debug_line section,
 	   let's check .gnu_debuglink section instead. */
 	if (gnu_debuglink_shdr && check_debuglink) {
 	    follow_debuglink(file + gnu_debuglink_shdr->sh_offset,
-			     num_traces, traces, syms,
-			     current_line, lines);
+			     num_traces, traces,
+			     objp, lines, offset);
 	}
-	return;
+        if (note_gnu_build_id && check_debuglink) {
+            ElfW(Nhdr) *nhdr = (ElfW(Nhdr)*) (file + note_gnu_build_id->sh_offset);
+            const char *build_id = (char *)(nhdr + 1) + nhdr->n_namesz;
+            follow_debuglink_build_id(build_id, nhdr->n_descsz,
+			       num_traces, traces,
+			       objp, lines, offset);
+        }
+	goto finish;
     }
 
-    parse_debug_line(num_traces, traces,
-		     file + debug_line_shdr->sh_offset,
-		     debug_line_shdr->sh_size,
-		     lines);
+    if (parse_debug_line(num_traces, traces,
+            obj->debug_line.ptr,
+            obj->debug_line.size,
+            obj, lines, offset) == -1)
+        goto fail;
+
+finish:
+    return dladdr_fbase;
+fail:
+    return (uintptr_t)-1;
 }
+#else /* Mach-O */
+/* read file and fill lines */
+static uintptr_t
+fill_lines(int num_traces, void **traces, int check_debuglink,
+        obj_info_t **objp, line_info_t *lines, int offset)
+{
+# ifdef __LP64__
+#  define LP(x) x##_64
+# else
+#  define LP(x) x
+# endif
+    int fd;
+    off_t filesize;
+    char *file, *p = NULL;
+    obj_info_t *obj = *objp;
+    struct LP(mach_header) *header;
+    uintptr_t dladdr_fbase = 0;
+
+    {
+        char *s = binary_filename;
+        char *base = strrchr(binary_filename, '/')+1;
+        size_t max = PATH_MAX;
+        size_t size = strlen(binary_filename);
+        size_t basesize = size - (base - binary_filename);
+        s += size;
+        max -= size;
+        p = s;
+        size = strlcpy(s, ".dSYM/Contents/Resources/DWARF/", max);
+        if (size == 0) goto fail;
+        s += size;
+        max -= size;
+        if (max <= basesize) goto fail;
+        memcpy(s, base, basesize);
+        s[basesize] = 0;
+
+        fd = open(binary_filename, O_RDONLY);
+        if (fd < 0) {
+            *p = 0; /* binary_filename becomes original file name */
+            fd = open(binary_filename, O_RDONLY);
+            if (fd < 0) {
+                goto fail;
+            }
+        }
+    }
 
-#ifdef HAVE_DL_ITERATE_PHDR
+    filesize = lseek(fd, 0, SEEK_END);
+    if (filesize < 0) {
+        int e = errno;
+        close(fd);
+        kprintf("lseek: %s\n", strerror(e));
+        goto fail;
+    }
+#if SIZEOF_OFF_T > SIZEOF_SIZE_T
+    if (filesize > (off_t)SIZE_MAX) {
+        close(fd);
+        kprintf("Too large file %s\n", binary_filename);
+        goto fail;
+    }
+#endif
+    lseek(fd, 0, SEEK_SET);
+    /* async-signal unsafe */
+    file = (char *)mmap(NULL, (size_t)filesize, PROT_READ, MAP_SHARED, fd, 0);
+    if (file == MAP_FAILED) {
+        int e = errno;
+        close(fd);
+        kprintf("mmap: %s\n", strerror(e));
+        goto fail;
+    }
+    close(fd);
 
-typedef struct {
-    int num_traces;
-    char **syms;
-    line_info_t *lines;
-} fill_base_addr_state_t;
+    obj->mapped = file;
+    obj->mapped_size = (size_t)filesize;
 
-static int
-fill_base_addr(struct dl_phdr_info *info, size_t size, void *data)
+    header = (struct LP(mach_header) *)file;
+    if (header->magic == LP(MH_MAGIC)) {
+        /* non universal binary */
+        p = file;
+    }
+    else if (header->magic == FAT_CIGAM) {
+        struct LP(mach_header) *mhp = _NSGetMachExecuteHeader();
+        struct fat_header *fat = (struct fat_header *)file;
+        char *q = file + sizeof(*fat);
+        uint32_t nfat_arch = __builtin_bswap32(fat->nfat_arch);
+        /* fprintf(stderr,"%d: fat:%s %d\n",__LINE__, binary_filename,nfat_arch); */
+        for (uint32_t i = 0; i < nfat_arch; i++) {
+            struct fat_arch *arch = (struct fat_arch *)q;
+            cpu_type_t cputype = __builtin_bswap32(arch->cputype);
+            cpu_subtype_t cpusubtype = __builtin_bswap32(arch->cpusubtype);
+            uint32_t offset = __builtin_bswap32(arch->offset);
+            /* fprintf(stderr,"%d: fat %d %x/%x %x/%x\n",__LINE__, i, mhp->cputype,mhp->cpusubtype, cputype,cpusubtype); */
+            if (mhp->cputype == cputype &&
+                    (cpu_subtype_t)(mhp->cpusubtype & ~CPU_SUBTYPE_MASK) == cpusubtype) {
+                p = file + offset;
+                file = p;
+                header = (struct LP(mach_header) *)p;
+                if (header->magic == LP(MH_MAGIC)) {
+                    goto found_mach_header;
+                }
+                break;
+            }
+            q += sizeof(*arch);
+        }
+        kprintf("'%s' is not a Mach-O universal binary file!\n",binary_filename);
+        close(fd);
+        goto fail;
+    }
+    else {
+        kprintf("'%s' is not a "
+# ifdef __LP64__
+                "64"
+# else
+                "32"
+# endif
+                "-bit Mach-O file!\n",binary_filename);
+        close(fd);
+        goto fail;
+    }
+found_mach_header:
+    p += sizeof(*header);
+
+    for (uint32_t i = 0; i < (uint32_t)header->ncmds; i++) {
+        struct load_command *lcmd = (struct load_command *)p;
+        switch (lcmd->cmd) {
+          case LP(LC_SEGMENT):
+            {
+                static const char *debug_section_names[] = {
+                    "__debug_abbrev",
+                    "__debug_info",
+                    "__debug_line",
+                    "__debug_ranges",
+                    "__debug_str_offsets",
+                    "__debug_addr",
+                    "__debug_rnglists",
+                    "__debug_str",
+                    "__debug_line_str",
+                };
+                struct LP(segment_command) *scmd = (struct LP(segment_command) *)lcmd;
+                if (strcmp(scmd->segname, "__TEXT") == 0) {
+                    obj->vmaddr = scmd->vmaddr;
+                }
+                else if (strcmp(scmd->segname, "__DWARF") == 0) {
+                    p += sizeof(struct LP(segment_command));
+                    for (uint64_t i = 0; i < scmd->nsects; i++) {
+                        struct LP(section) *sect = (struct LP(section) *)p;
+                        p += sizeof(struct LP(section));
+                        for (int j=0; j < DWARF_SECTION_COUNT; j++) {
+                            struct dwarf_section *s = obj_dwarf_section_at(obj, j);
+
+                            if (strcmp(sect->sectname, debug_section_names[j]) != 0)
+                                continue;
+
+                            s->ptr = file + sect->offset;
+                            s->size = sect->size;
+                            s->flags = sect->flags;
+                            if (s->flags & SHF_COMPRESSED) {
+                                goto fail;
+                            }
+                            break;
+                        }
+                    }
+                }
+            }
+            break;
+
+          case LC_SYMTAB:
+            {
+                struct symtab_command *cmd = (struct symtab_command *)lcmd;
+                struct LP(nlist) *nl = (struct LP(nlist) *)(file + cmd->symoff);
+                char *strtab = file + cmd->stroff, *sname = 0;
+                uint32_t j;
+                uintptr_t saddr = 0;
+                /* kprintf("[%2d]: %x/symtab %p\n", i, cmd->cmd, (void *)p); */
+                for (j = 0; j < cmd->nsyms; j++) {
+                    uintptr_t symsize, d;
+                    struct LP(nlist) *e = &nl[j];
+                        /* kprintf("[%2d][%4d]: %02x/%x/%x: %s %llx\n", i, j, e->n_type,e->n_sect,e->n_desc,strtab+e->n_un.n_strx,e->n_value); */
+                    if (e->n_type != N_FUN) continue;
+                    if (e->n_sect) {
+                        saddr = (uintptr_t)e->n_value + obj->base_addr - obj->vmaddr;
+                        sname = strtab + e->n_un.n_strx;
+                        /* kprintf("[%2d][%4d]: %02x/%x/%x: %s %llx\n", i, j, e->n_type,e->n_sect,e->n_desc,strtab+e->n_un.n_strx,e->n_value); */
+                        continue;
+                    }
+                    for (int k = offset; k < num_traces; k++) {
+                        d = (uintptr_t)traces[k] - saddr;
+                        symsize = e->n_value;
+                        /* kprintf("%lx %lx %lx\n",saddr,symsize,traces[k]); */
+                        if (lines[k].line > 0 || d > (uintptr_t)symsize)
+                            continue;
+                        /* fill symbol name and addr from .symtab */
+                        if (!lines[k].sname) lines[k].sname = sname;
+                        lines[k].saddr = saddr;
+                        lines[k].path  = obj->path;
+                        lines[k].base_addr = obj->base_addr;
+                    }
+                }
+            }
+        }
+        p += lcmd->cmdsize;
+    }
+
+    if (obj->debug_info.ptr && obj->debug_abbrev.ptr) {
+        DebugInfoReader reader;
+        debug_info_reader_init(&reader, obj);
+        while (reader.p < reader.pend) {
+            if (di_read_cu(&reader)) goto fail;
+            debug_info_read(&reader, num_traces, traces, lines, offset);
+        }
+    }
+
+    if (parse_debug_line(num_traces, traces,
+            obj->debug_line.ptr,
+            obj->debug_line.size,
+            obj, lines, offset) == -1)
+        goto fail;
+
+    return dladdr_fbase;
+fail:
+    return (uintptr_t)-1;
+}
+#endif
+
+#define HAVE_MAIN_EXE_PATH
+#if defined(__FreeBSD__) || defined(__DragonFly__)
+# include <sys/sysctl.h>
+#endif
+/* ssize_t main_exe_path(void)
+ *
+ * store the path of the main executable to `binary_filename`,
+ * and returns strlen(binary_filename).
+ * it is NUL terminated.
+ */
+#if defined(__linux__) || defined(__NetBSD__)
+static ssize_t
+main_exe_path(void)
 {
-    int i;
-    fill_base_addr_state_t *st = (fill_base_addr_state_t *)data;
-    for (i = 0; i < st->num_traces; i++) {
-	const char *path;
-	size_t len;
-	size_t name_len = strlen(info->dlpi_name);
-
-	if (get_path_from_symbol(st->syms[i], &path, &len) &&
-		(len == name_len || (len > name_len && path[len-name_len-1] == '/')) &&
-		!strncmp(path+len-name_len, info->dlpi_name, name_len)) {
-	    st->lines[i].base_addr = info->dlpi_addr;
-	}
+# if defined(__linux__)
+#  define PROC_SELF_EXE "/proc/self/exe"
+# elif defined(__NetBSD__)
+#  define PROC_SELF_EXE "/proc/curproc/exe"
+# endif
+    ssize_t len = readlink(PROC_SELF_EXE, binary_filename, PATH_MAX);
+    if (len < 0) return 0;
+    binary_filename[len] = 0;
+    return len;
+}
+#elif defined(__FreeBSD__) || defined(__DragonFly__)
+static ssize_t
+main_exe_path(void)
+{
+    int mib[4] = {CTL_KERN, KERN_PROC, KERN_PROC_PATHNAME, -1};
+    size_t len = PATH_MAX;
+    int err = sysctl(mib, 4, binary_filename, &len, NULL, 0);
+    if (err) {
+	kprintf("Can't get the path of ruby");
+	return -1;
     }
-    return 0;
+    len--; /* sysctl sets strlen+1 */
+    return len;
 }
+#elif defined(HAVE_LIBPROC_H)
+static ssize_t
+main_exe_path(void)
+{
+    int len = proc_pidpath(getpid(), binary_filename, PATH_MAX);
+    if (len == 0) return 0;
+    binary_filename[len] = 0;
+    return len;
+}
+#else
+#undef HAVE_MAIN_EXE_PATH
+#endif
 
-#endif /* HAVE_DL_ITERATE_PHDR */
+static void
+print_line0(line_info_t *line, void *address)
+{
+    uintptr_t addr = (uintptr_t)address;
+    uintptr_t d = addr - line->saddr;
+    if (!address) {
+        /* inlined */
+        if (line->dirname && line->dirname[0]) {
+            kprintf("%s(%s) %s/%s:%d\n", line->path, line->sname, line->dirname, line->filename, line->line);
+        }
+        else {
+            kprintf("%s(%s) %s:%d\n", line->path, line->sname, line->filename, line->line);
+        }
+    }
+    else if (!line->path) {
+        kprintf("[0x%"PRIxPTR"]\n", addr);
+    }
+    else if (!line->sname) {
+        kprintf("%s(0x%"PRIxPTR") [0x%"PRIxPTR"]\n", line->path, addr-line->base_addr, addr);
+    }
+    else if (!line->saddr) {
+        kprintf("%s(%s) [0x%"PRIxPTR"]\n", line->path, line->sname, addr);
+    }
+    else if (line->line <= 0) {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"]\n", line->path, line->sname,
+                d, addr);
+    }
+    else if (!line->filename) {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"] ???:%d\n", line->path, line->sname,
+                d, addr, line->line);
+    }
+    else if (line->dirname && line->dirname[0]) {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"] %s/%s:%d\n", line->path, line->sname,
+                d, addr, line->dirname, line->filename, line->line);
+    }
+    else {
+        kprintf("%s(%s+0x%"PRIxPTR") [0x%"PRIxPTR"] %s:%d\n", line->path, line->sname,
+                d, addr, line->filename, line->line);
+    }
+}
+
+static void
+print_line(line_info_t *line, void *address)
+{
+    print_line0(line, address);
+    if (line->next) {
+        print_line(line->next, NULL);
+    }
+}
 
 void
-rb_dump_backtrace_with_lines(int num_traces, void **trace, char **syms)
+rb_dump_backtrace_with_lines(int num_traces, void **traces)
 {
     int i;
     /* async-signal unsafe */
-    line_info_t *lines = (line_info_t *)calloc(num_traces,
-					       sizeof(line_info_t));
-
-    /* Note that line info of shared objects might not be shown
-       if we don't have dl_iterate_phdr */
-#ifdef HAVE_DL_ITERATE_PHDR
-    fill_base_addr_state_t fill_base_addr_state;
-
-    fill_base_addr_state.num_traces = num_traces;
-    fill_base_addr_state.syms = syms;
-    fill_base_addr_state.lines = lines;
-    /* maybe async-signal unsafe */
-    dl_iterate_phdr(fill_base_addr, &fill_base_addr_state);
-#endif /* HAVE_DL_ITERATE_PHDR */
-
-    for (i = 0; i < num_traces; i++) {
-	const char *path;
-	size_t len;
-	if (lines[i].line) {
-	    continue;
-	}
-
-	if (!get_path_from_symbol(syms[i], &path, &len)) {
-	    continue;
+    line_info_t *lines = (line_info_t *)calloc(num_traces, sizeof(line_info_t));
+    obj_info_t *obj = NULL;
+    /* 2 is NULL + main executable */
+    void **dladdr_fbases = (void **)calloc(num_traces+2, sizeof(void *));
+
+#ifdef HAVE_MAIN_EXE_PATH
+    char *main_path = NULL; /* used on printing backtrace */
+    ssize_t len;
+    if ((len = main_exe_path()) > 0) {
+	main_path = (char *)alloca(len + 1);
+	if (main_path) {
+	    uintptr_t addr;
+	    memcpy(main_path, binary_filename, len+1);
+	    append_obj(&obj);
+	    obj->path = main_path;
+	    addr = fill_lines(num_traces, traces, 1, &obj, lines, -1);
+	    if (addr != (uintptr_t)-1) {
+		dladdr_fbases[0] = (void *)addr;
+	    }
 	}
-
-	strncpy(binary_filename, path, len);
-	binary_filename[len] = '\0';
-
-	fill_lines(num_traces, trace, syms, 1, &lines[i], lines);
     }
+#endif
 
-    /* fprintf may not be async-signal safe */
+    /* fill source lines by reading dwarf */
     for (i = 0; i < num_traces; i++) {
-	line_info_t *line = &lines[i];
-
-	if (line->line > 0) {
-	    fprintf(stderr, "%s ", syms[i]);
-	    if (line->filename) {
-		if (line->dirname && line->dirname[0]) {
-		    fprintf(stderr, "%s/", line->dirname);
+	Dl_info info;
+	if (lines[i].line) continue;
+	if (dladdr(traces[i], &info)) {
+	    const char *path;
+	    void **p;
+
+	    /* skip symbols which is in already checked objects */
+	    /* if the binary is strip-ed, this may effect */
+	    for (p=dladdr_fbases; *p; p++) {
+		if (*p == info.dli_fbase) {
+		    if (info.dli_fname) lines[i].path = info.dli_fname;
+		    if (info.dli_sname) lines[i].sname = info.dli_sname;
+		    goto next_line;
 		}
-		fprintf(stderr, "%s", line->filename);
-	    } else {
-		fprintf(stderr, "???");
 	    }
-	    fprintf(stderr, ":%d\n", line->line);
-	} else {
-	    fprintf(stderr, "%s\n", syms[i]);
+	    *p = info.dli_fbase;
+
+	    append_obj(&obj);
+	    obj->base_addr = (uintptr_t)info.dli_fbase;
+	    path = info.dli_fname;
+	    obj->path = path;
+	    if (path) lines[i].path = path;
+            if (info.dli_sname) {
+                lines[i].sname = info.dli_sname;
+                lines[i].saddr = (uintptr_t)info.dli_saddr;
+            }
+	    strlcpy(binary_filename, path, PATH_MAX);
+	    if (fill_lines(num_traces, traces, 1, &obj, lines, i) == (uintptr_t)-1)
+		break;
 	}
+next_line:
+	continue;
     }
 
+    /* output */
     for (i = 0; i < num_traces; i++) {
-	line_info_t *line = &lines[i];
-	if (line->fd) {
-	    munmap(line->mapped, line->mapped_size);
-	    close(line->fd);
+        print_line(&lines[i], traces[i]);
+
+	/* FreeBSD's backtrace may show _start and so on */
+	if (lines[i].sname && strcmp("main", lines[i].sname) == 0)
+	    break;
+    }
+
+    /* free */
+    while (obj) {
+	obj_info_t *o = obj;
+        for (i=0; i < DWARF_SECTION_COUNT; i++) {
+            struct dwarf_section *s = obj_dwarf_section_at(obj, i);
+            if (s->flags & SHF_COMPRESSED) {
+                free(s->ptr);
+            }
+        }
+	if (obj->mapped_size) {
+	    munmap(obj->mapped, obj->mapped_size);
 	}
+	obj = o->next;
+	free(o);
+    }
+    for (i = 0; i < num_traces; i++) {
+        line_info_t *line = lines[i].next;
+        while (line) {
+            line_info_t *l = line;
+            line = line->next;
+            free(l);
+        }
     }
     free(lines);
+    free(dladdr_fbases);
+}
+
+/* From FreeBSD's lib/libstand/printf.c */
+/*-
+ * Copyright (c) 1986, 1988, 1991, 1993
+ *	The Regents of the University of California.  All rights reserved.
+ * (c) UNIX System Laboratories, Inc.
+ * All or some portions of this file are derived from material licensed
+ * to the University of California by American Telephone and Telegraph
+ * Co. or Unix System Laboratories, Inc. and are reproduced herein with
+ * the permission of UNIX System Laboratories, Inc.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 4. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ *	@(#)subr_prf.c	8.3 (Berkeley) 1/21/94
+ */
+
+#include <stdarg.h>
+#define MAXNBUF (sizeof(intmax_t) * CHAR_BIT + 1)
+static inline int toupper(int c) { return ('A' <= c && c <= 'Z') ? (c&0x5f) : c; }
+#define    hex2ascii(hex)  (hex2ascii_data[hex])
+static const char hex2ascii_data[] = "0123456789abcdefghijklmnopqrstuvwxyz";
+static inline int imax(int a, int b) { return (a > b ? a : b); }
+static int kvprintf(char const *fmt, void (*func)(int), void *arg, int radix, va_list ap);
+
+static void putce(int c)
+{
+    char s[1];
+    ssize_t ret;
+
+    s[0] = (char)c;
+    ret = write(2, s, 1);
+    (void)ret;
+}
+
+static int
+kprintf(const char *fmt, ...)
+{
+	va_list ap;
+	int retval;
+
+	va_start(ap, fmt);
+	retval = kvprintf(fmt, putce, NULL, 10, ap);
+	va_end(ap);
+	return retval;
 }
 
+/*
+ * Put a NUL-terminated ASCII number (base <= 36) in a buffer in reverse
+ * order; return an optional length and a pointer to the last character
+ * written in the buffer (i.e., the first character of the string).
+ * The buffer pointed to by `nbuf' must have length >= MAXNBUF.
+ */
+static char *
+ksprintn(char *nbuf, uintmax_t num, int base, int *lenp, int upper)
+{
+	char *p, c;
+
+	p = nbuf;
+	*p = '\0';
+	do {
+		c = hex2ascii(num % base);
+		*++p = upper ? toupper(c) : c;
+	} while (num /= base);
+	if (lenp)
+		*lenp = (int)(p - nbuf);
+	return (p);
+}
+
+/*
+ * Scaled down version of printf(3).
+ *
+ * Two additional formats:
+ *
+ * The format %b is supported to decode error registers.
+ * Its usage is:
+ *
+ *	printf("reg=%b\n", regval, "<base><arg>*");
+ *
+ * where <base> is the output base expressed as a control character, e.g.
+ * \10 gives octal; \20 gives hex.  Each arg is a sequence of characters,
+ * the first of which gives the bit number to be inspected (origin 1), and
+ * the next characters (up to a control character, i.e. a character <= 32),
+ * give the name of the register.  Thus:
+ *
+ *	kvprintf("reg=%b\n", 3, "\10\2BITTWO\1BITONE\n");
+ *
+ * would produce output:
+ *
+ *	reg=3<BITTWO,BITONE>
+ *
+ * XXX:  %D  -- Hexdump, takes pointer and separator string:
+ *		("%6D", ptr, ":")   -> XX:XX:XX:XX:XX:XX
+ *		("%*D", len, ptr, " " -> XX XX XX XX ...
+ */
+static int
+kvprintf(char const *fmt, void (*func)(int), void *arg, int radix, va_list ap)
+{
+#define PCHAR(c) {int cc=(c); if (func) (*func)(cc); else *d++ = cc; retval++; }
+	char nbuf[MAXNBUF];
+	char *d;
+	const char *p, *percent, *q;
+	unsigned char *up;
+	int ch, n;
+	uintmax_t num;
+	int base, lflag, qflag, tmp, width, ladjust, sharpflag, neg, sign, dot;
+	int cflag, hflag, jflag, tflag, zflag;
+	int dwidth, upper;
+	char padc;
+	int stop = 0, retval = 0;
+
+	num = 0;
+	if (!func)
+		d = (char *) arg;
+	else
+		d = NULL;
+
+	if (fmt == NULL)
+		fmt = "(fmt null)\n";
+
+	if (radix < 2 || radix > 36)
+		radix = 10;
+
+	for (;;) {
+		padc = ' ';
+		width = 0;
+		while ((ch = (unsigned char)*fmt++) != '%' || stop) {
+			if (ch == '\0')
+				return (retval);
+			PCHAR(ch);
+		}
+		percent = fmt - 1;
+		qflag = 0; lflag = 0; ladjust = 0; sharpflag = 0; neg = 0;
+		sign = 0; dot = 0; dwidth = 0; upper = 0;
+		cflag = 0; hflag = 0; jflag = 0; tflag = 0; zflag = 0;
+reswitch:	switch (ch = (unsigned char)*fmt++) {
+		case '.':
+			dot = 1;
+			goto reswitch;
+		case '#':
+			sharpflag = 1;
+			goto reswitch;
+		case '+':
+			sign = 1;
+			goto reswitch;
+		case '-':
+			ladjust = 1;
+			goto reswitch;
+		case '%':
+			PCHAR(ch);
+			break;
+		case '*':
+			if (!dot) {
+				width = va_arg(ap, int);
+				if (width < 0) {
+					ladjust = !ladjust;
+					width = -width;
+				}
+			} else {
+				dwidth = va_arg(ap, int);
+			}
+			goto reswitch;
+		case '0':
+			if (!dot) {
+				padc = '0';
+				goto reswitch;
+			}
+		case '1': case '2': case '3': case '4':
+		case '5': case '6': case '7': case '8': case '9':
+				for (n = 0;; ++fmt) {
+					n = n * 10 + ch - '0';
+					ch = *fmt;
+					if (ch < '0' || ch > '9')
+						break;
+				}
+			if (dot)
+				dwidth = n;
+			else
+				width = n;
+			goto reswitch;
+		case 'b':
+			num = (unsigned int)va_arg(ap, int);
+			p = va_arg(ap, char *);
+			for (q = ksprintn(nbuf, num, *p++, NULL, 0); *q;)
+				PCHAR(*q--);
+
+			if (num == 0)
+				break;
+
+			for (tmp = 0; *p;) {
+				n = *p++;
+				if (num & (1 << (n - 1))) {
+					PCHAR(tmp ? ',' : '<');
+					for (; (n = *p) > ' '; ++p)
+						PCHAR(n);
+					tmp = 1;
+				} else
+					for (; *p > ' '; ++p)
+						continue;
+			}
+			if (tmp)
+				PCHAR('>');
+			break;
+		case 'c':
+			PCHAR(va_arg(ap, int));
+			break;
+		case 'D':
+			up = va_arg(ap, unsigned char *);
+			p = va_arg(ap, char *);
+			if (!width)
+				width = 16;
+			while(width--) {
+				PCHAR(hex2ascii(*up >> 4));
+				PCHAR(hex2ascii(*up & 0x0f));
+				up++;
+				if (width)
+					for (q=p;*q;q++)
+						PCHAR(*q);
+			}
+			break;
+		case 'd':
+		case 'i':
+			base = 10;
+			sign = 1;
+			goto handle_sign;
+		case 'h':
+			if (hflag) {
+				hflag = 0;
+				cflag = 1;
+			} else
+				hflag = 1;
+			goto reswitch;
+		case 'j':
+			jflag = 1;
+			goto reswitch;
+		case 'l':
+			if (lflag) {
+				lflag = 0;
+				qflag = 1;
+			} else
+				lflag = 1;
+			goto reswitch;
+		case 'n':
+			if (jflag)
+				*(va_arg(ap, intmax_t *)) = retval;
+			else if (qflag)
+				*(va_arg(ap, int64_t *)) = retval;
+			else if (lflag)
+				*(va_arg(ap, long *)) = retval;
+			else if (zflag)
+				*(va_arg(ap, size_t *)) = retval;
+			else if (hflag)
+				*(va_arg(ap, short *)) = retval;
+			else if (cflag)
+				*(va_arg(ap, char *)) = retval;
+			else
+				*(va_arg(ap, int *)) = retval;
+			break;
+		case 'o':
+			base = 8;
+			goto handle_nosign;
+		case 'p':
+			base = 16;
+			sharpflag = (width == 0);
+			sign = 0;
+			num = (uintptr_t)va_arg(ap, void *);
+			goto number;
+		case 'q':
+			qflag = 1;
+			goto reswitch;
+		case 'r':
+			base = radix;
+			if (sign)
+				goto handle_sign;
+			goto handle_nosign;
+		case 's':
+			p = va_arg(ap, char *);
+			if (p == NULL)
+				p = "(null)";
+			if (!dot)
+				n = (int)strlen (p);
+			else
+				for (n = 0; n < dwidth && p[n]; n++)
+					continue;
+
+			width -= n;
+
+			if (!ladjust && width > 0)
+				while (width--)
+					PCHAR(padc);
+			while (n--)
+				PCHAR(*p++);
+			if (ladjust && width > 0)
+				while (width--)
+					PCHAR(padc);
+			break;
+		case 't':
+			tflag = 1;
+			goto reswitch;
+		case 'u':
+			base = 10;
+			goto handle_nosign;
+		case 'X':
+			upper = 1;
+		case 'x':
+			base = 16;
+			goto handle_nosign;
+		case 'y':
+			base = 16;
+			sign = 1;
+			goto handle_sign;
+		case 'z':
+			zflag = 1;
+			goto reswitch;
+handle_nosign:
+			sign = 0;
+			if (jflag)
+				num = va_arg(ap, uintmax_t);
+			else if (qflag)
+				num = va_arg(ap, uint64_t);
+			else if (tflag)
+				num = va_arg(ap, ptrdiff_t);
+			else if (lflag)
+				num = va_arg(ap, unsigned long);
+			else if (zflag)
+				num = va_arg(ap, size_t);
+			else if (hflag)
+				num = (unsigned short)va_arg(ap, int);
+			else if (cflag)
+				num = (unsigned char)va_arg(ap, int);
+			else
+				num = va_arg(ap, unsigned int);
+			goto number;
+handle_sign:
+			if (jflag)
+				num = va_arg(ap, intmax_t);
+			else if (qflag)
+				num = va_arg(ap, int64_t);
+			else if (tflag)
+				num = va_arg(ap, ptrdiff_t);
+			else if (lflag)
+				num = va_arg(ap, long);
+			else if (zflag)
+				num = va_arg(ap, ssize_t);
+			else if (hflag)
+				num = (short)va_arg(ap, int);
+			else if (cflag)
+				num = (char)va_arg(ap, int);
+			else
+				num = va_arg(ap, int);
+number:
+			if (sign && (intmax_t)num < 0) {
+				neg = 1;
+				num = -(intmax_t)num;
+			}
+			p = ksprintn(nbuf, num, base, &n, upper);
+			tmp = 0;
+			if (sharpflag && num != 0) {
+				if (base == 8)
+					tmp++;
+				else if (base == 16)
+					tmp += 2;
+			}
+			if (neg)
+				tmp++;
+
+			if (!ladjust && padc == '0')
+				dwidth = width - tmp;
+			width -= tmp + imax(dwidth, n);
+			dwidth -= n;
+			if (!ladjust)
+				while (width-- > 0)
+					PCHAR(' ');
+			if (neg)
+				PCHAR('-');
+			if (sharpflag && num != 0) {
+				if (base == 8) {
+					PCHAR('0');
+				} else if (base == 16) {
+					PCHAR('0');
+					PCHAR('x');
+				}
+			}
+			while (dwidth-- > 0)
+				PCHAR('0');
+
+			while (*p)
+				PCHAR(*p--);
+
+			if (ladjust)
+				while (width-- > 0)
+					PCHAR(' ');
+
+			break;
+		default:
+			while (percent < fmt)
+				PCHAR(*percent++);
+			/*
+			 * Since we ignore an formatting argument it is no
+			 * longer safe to obey the remaining formatting
+			 * arguments as the arguments will no longer match
+			 * the format specs.
+			 */
+			stop = 1;
+			break;
+		}
+	}
+#undef PCHAR
+}
 #else /* defined(USE_ELF) */
 #error not supported
 #endif
diff --git a/addr2line.h b/addr2line.h
index 3782d89e07..f09b665800 100644
--- a/addr2line.h
+++ b/addr2line.h
@@ -1,3 +1,5 @@
+#ifndef RUBY_ADDR2LINE_H
+#define RUBY_ADDR2LINE_H
 /**********************************************************************
 
   addr2line.h -
@@ -8,13 +10,10 @@
 
 **********************************************************************/
 
-#ifndef RUBY_ADDR2LINE_H
-#define RUBY_ADDR2LINE_H
-
-#ifdef USE_ELF
+#if (defined(USE_ELF) || defined(HAVE_MACH_O_LOADER_H))
 
 void
-rb_dump_backtrace_with_lines(int num_traces, void **traces, char **syms);
+rb_dump_backtrace_with_lines(int num_traces, void **traces);
 
 #endif /* USE_ELF */
 
diff --git a/array.c b/array.c
index 59572ecaad..b76e9a64a3 100644
--- a/array.c
+++ b/array.c
@@ -11,69 +11,107 @@
 
 **********************************************************************/
 
-#include "ruby/ruby.h"
-#include "ruby/util.h"
-#include "ruby/st.h"
-#include "ruby/encoding.h"
+#include "debug_counter.h"
+#include "id.h"
 #include "internal.h"
+#include "internal/array.h"
+#include "internal/compar.h"
+#include "internal/enum.h"
+#include "internal/gc.h"
+#include "internal/hash.h"
+#include "internal/numeric.h"
+#include "internal/object.h"
+#include "internal/proc.h"
+#include "internal/rational.h"
+#include "internal/vm.h"
+#include "probes.h"
+#include "ruby/encoding.h"
+#include "ruby/st.h"
+#include "ruby/util.h"
+#include "transient_heap.h"
+#include "builtin.h"
 
-#ifndef ARRAY_DEBUG
+#if !ARRAY_DEBUG
+# undef NDEBUG
 # define NDEBUG
 #endif
-#include <assert.h>
-
-#define numberof(array) (int)(sizeof(array) / sizeof((array)[0]))
+#include "ruby_assert.h"
 
 VALUE rb_cArray;
 
-static ID id_cmp;
+/* Flags of RArray
+ *
+ * 1:   RARRAY_EMBED_FLAG
+ *          The array is embedded (its contents follow the header, rather than
+ *          being on a separately allocated buffer).
+ * 2:   RARRAY_SHARED_FLAG (equal to ELTS_SHARED)
+ *          The array is shared. The buffer this array points to is owned by
+ *          another array (the shared root).
+ * if USE_RVARGC
+ * 3-9: RARRAY_EMBED_LEN
+ *          The length of the array when RARRAY_EMBED_FLAG is set.
+ * else
+ * 3-4: RARRAY_EMBED_LEN
+ *          The length of the array when RARRAY_EMBED_FLAG is set.
+ * endif
+ * 12:  RARRAY_SHARED_ROOT_FLAG
+ *          The array is a shared root that does reference counting. The buffer
+ *          this array points to is owned by this array but may be pointed to
+ *          by other arrays.
+ *          Note: Frozen arrays may be a shared root without this flag being
+ *                set. Frozen arrays do not have reference counting because
+ *                they cannot be modified. Not updating the reference count
+ *                improves copy-on-write performance. Their reference count is
+ *                assumed to be infinity.
+ * 13:  RARRAY_TRANSIENT_FLAG
+ *          The buffer of the array is allocated on the transient heap.
+ * 14:  RARRAY_PTR_IN_USE_FLAG
+ *          The buffer of the array is in use. This is only used during
+ *          debugging.
+ */
+
+/* for OPTIMIZED_CMP: */
+#define id_cmp idCmp
 
 #define ARY_DEFAULT_SIZE 16
 #define ARY_MAX_SIZE (LONG_MAX / (int)sizeof(VALUE))
+#define SMALL_ARRAY_LEN 16
 
-void
-rb_mem_clear(register VALUE *mem, register long size)
+RBIMPL_ATTR_MAYBE_UNUSED()
+static int
+should_be_T_ARRAY(VALUE ary)
 {
-    while (size--) {
-	*mem++ = Qnil;
-    }
+    return RB_TYPE_P(ary, T_ARRAY);
 }
 
-static inline void
-memfill(register VALUE *mem, register long size, register VALUE val)
-{
-    while (size--) {
-	*mem++ = val;
-    }
-}
-
-# define ARY_SHARED_P(ary) \
-    (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \
-     FL_TEST((ary),ELTS_SHARED)!=0)
-# define ARY_EMBED_P(ary) \
-    (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \
-     FL_TEST((ary), RARRAY_EMBED_FLAG)!=0)
-
 #define ARY_HEAP_PTR(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr)
 #define ARY_HEAP_LEN(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len)
+#define ARY_HEAP_CAPA(a) (assert(!ARY_EMBED_P(a)), assert(!ARY_SHARED_ROOT_P(a)), \
+                          RARRAY(a)->as.heap.aux.capa)
+
 #define ARY_EMBED_PTR(a) (assert(ARY_EMBED_P(a)), RARRAY(a)->as.ary)
 #define ARY_EMBED_LEN(a) \
     (assert(ARY_EMBED_P(a)), \
      (long)((RBASIC(a)->flags >> RARRAY_EMBED_LEN_SHIFT) & \
-	 (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
+         (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
+#define ARY_HEAP_SIZE(a) (assert(!ARY_EMBED_P(a)), assert(ARY_OWNS_HEAP_P(a)), ARY_CAPA(a) * sizeof(VALUE))
+
+#define ARY_OWNS_HEAP_P(a) (assert(should_be_T_ARRAY((VALUE)(a))), \
+                            !FL_TEST_RAW((a), RARRAY_SHARED_FLAG|RARRAY_EMBED_FLAG))
 
-#define ARY_OWNS_HEAP_P(a) (!FL_TEST((a), ELTS_SHARED|RARRAY_EMBED_FLAG))
 #define FL_SET_EMBED(a) do { \
     assert(!ARY_SHARED_P(a)); \
-    assert(!OBJ_FROZEN(a)); \
     FL_SET((a), RARRAY_EMBED_FLAG); \
+    RARY_TRANSIENT_UNSET(a); \
+    ary_verify(a); \
 } while (0)
+
 #define FL_UNSET_EMBED(ary) FL_UNSET((ary), RARRAY_EMBED_FLAG|RARRAY_EMBED_LEN_MASK)
 #define FL_SET_SHARED(ary) do { \
     assert(!ARY_EMBED_P(ary)); \
-    FL_SET((ary), ELTS_SHARED); \
+    FL_SET((ary), RARRAY_SHARED_FLAG); \
 } while (0)
-#define FL_UNSET_SHARED(ary) FL_UNSET((ary), ELTS_SHARED)
+#define FL_UNSET_SHARED(ary) FL_UNSET((ary), RARRAY_SHARED_FLAG)
 
 #define ARY_SET_PTR(ary, p) do { \
     assert(!ARY_EMBED_P(ary)); \
@@ -83,7 +121,6 @@ memfill(register VALUE *mem, register long size, register VALUE val)
 #define ARY_SET_EMBED_LEN(ary, n) do { \
     long tmp_n = (n); \
     assert(ARY_EMBED_P(ary)); \
-    assert(!OBJ_FROZEN(ary)); \
     RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK; \
     RBASIC(ary)->flags |= (tmp_n) << RARRAY_EMBED_LEN_SHIFT; \
 } while (0)
@@ -115,8 +152,8 @@ memfill(register VALUE *mem, register long size, register VALUE val)
     } \
 } while (0)
 
-#define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? RARRAY_EMBED_LEN_MAX : \
-		       ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : RARRAY(ary)->as.heap.aux.capa)
+#define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? ary_embed_capa(ary) : \
+                       ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : ARY_HEAP_CAPA(ary))
 #define ARY_SET_CAPA(ary, n) do { \
     assert(!ARY_EMBED_P(ary)); \
     assert(!ARY_SHARED_P(ary)); \
@@ -124,57 +161,424 @@ memfill(register VALUE *mem, register long size, register VALUE val)
     RARRAY(ary)->as.heap.aux.capa = (n); \
 } while (0)
 
-#define ARY_SHARED(ary) (assert(ARY_SHARED_P(ary)), RARRAY(ary)->as.heap.aux.shared)
 #define ARY_SET_SHARED(ary, value) do { \
-    assert(!ARY_EMBED_P(ary)); \
-    assert(ARY_SHARED_P(ary)); \
-    assert(ARY_SHARED_ROOT_P(value)); \
-    RARRAY(ary)->as.heap.aux.shared = (value); \
+    const VALUE _ary_ = (ary); \
+    const VALUE _value_ = (value); \
+    assert(!ARY_EMBED_P(_ary_)); \
+    assert(ARY_SHARED_P(_ary_)); \
+    assert(!OBJ_FROZEN(_ary_)); \
+    assert(ARY_SHARED_ROOT_P(_value_) || OBJ_FROZEN(_value_)); \
+    RB_OBJ_WRITE(_ary_, &RARRAY(_ary_)->as.heap.aux.shared_root, _value_); \
 } while (0)
-#define RARRAY_SHARED_ROOT_FLAG FL_USER5
-#define ARY_SHARED_ROOT_P(ary) (FL_TEST((ary), RARRAY_SHARED_ROOT_FLAG))
-#define ARY_SHARED_NUM(ary) \
-    (assert(ARY_SHARED_ROOT_P(ary)), RARRAY(ary)->as.heap.aux.capa)
-#define ARY_SET_SHARED_NUM(ary, value) do { \
+
+#define ARY_SHARED_ROOT_OCCUPIED(ary) (!OBJ_FROZEN(ary) && ARY_SHARED_ROOT_REFCNT(ary) == 1)
+#define ARY_SET_SHARED_ROOT_REFCNT(ary, value) do { \
     assert(ARY_SHARED_ROOT_P(ary)); \
+    assert(!OBJ_FROZEN(ary)); \
+    assert((value) >= 0); \
     RARRAY(ary)->as.heap.aux.capa = (value); \
 } while (0)
 #define FL_SET_SHARED_ROOT(ary) do { \
+    assert(!OBJ_FROZEN(ary)); \
     assert(!ARY_EMBED_P(ary)); \
+    assert(!RARRAY_TRANSIENT_P(ary)); \
     FL_SET((ary), RARRAY_SHARED_ROOT_FLAG); \
 } while (0)
 
+static inline void
+ARY_SET(VALUE a, long i, VALUE v)
+{
+    assert(!ARY_SHARED_P(a));
+    assert(!OBJ_FROZEN(a));
+
+    RARRAY_ASET(a, i, v);
+}
+#undef RARRAY_ASET
+
+static long
+ary_embed_capa(VALUE ary)
+{
+#if USE_RVARGC
+    size_t size = rb_gc_obj_slot_size(ary) - offsetof(struct RArray, as.ary);
+    assert(size % sizeof(VALUE) == 0);
+    return size / sizeof(VALUE);
+#else
+    return RARRAY_EMBED_LEN_MAX;
+#endif
+}
+
+static size_t
+ary_embed_size(long capa)
+{
+    return offsetof(struct RArray, as.ary) + (sizeof(VALUE) * capa);
+}
+
+static bool
+ary_embeddable_p(long capa)
+{
+#if USE_RVARGC
+    return rb_gc_size_allocatable_p(ary_embed_size(capa));
+#else
+    return capa <= RARRAY_EMBED_LEN_MAX;
+#endif
+}
+
+bool
+rb_ary_embeddable_p(VALUE ary)
+{
+    /* An array cannot be turned embeddable when the array is:
+     *  - Shared root: other objects may point to the buffer of this array
+     *    so we cannot make it embedded.
+     *  - Frozen: this array may also be a shared root without the shared root
+     *    flag.
+     *  - Shared: we don't want to re-embed an array that points to a shared
+     *    root (to save memory).
+     */
+    return !(ARY_SHARED_ROOT_P(ary) || OBJ_FROZEN(ary) || ARY_SHARED_P(ary));
+}
+
+size_t
+rb_ary_size_as_embedded(VALUE ary)
+{
+    size_t real_size;
+
+    if (ARY_EMBED_P(ary)) {
+        real_size = ary_embed_size(ARY_EMBED_LEN(ary));
+    }
+    else if (rb_ary_embeddable_p(ary)) {
+        real_size = ary_embed_size(ARY_HEAP_CAPA(ary));
+    }
+    else {
+        real_size = sizeof(struct RArray);
+    }
+    return real_size;
+}
+
+
+#if ARRAY_DEBUG
+#define ary_verify(ary) ary_verify_(ary, __FILE__, __LINE__)
+
+static VALUE
+ary_verify_(VALUE ary, const char *file, int line)
+{
+    assert(RB_TYPE_P(ary, T_ARRAY));
+
+    if (ARY_SHARED_P(ary)) {
+        VALUE root = ARY_SHARED_ROOT(ary);
+        const VALUE *ptr = ARY_HEAP_PTR(ary);
+        const VALUE *root_ptr = RARRAY_CONST_PTR_TRANSIENT(root);
+        long len = ARY_HEAP_LEN(ary), root_len = RARRAY_LEN(root);
+        assert(ARY_SHARED_ROOT_P(root) || OBJ_FROZEN(root));
+        assert(root_ptr <= ptr && ptr + len <= root_ptr + root_len);
+        ary_verify(root);
+    }
+    else if (ARY_EMBED_P(ary)) {
+        assert(!RARRAY_TRANSIENT_P(ary));
+        assert(!ARY_SHARED_P(ary));
+        assert(RARRAY_LEN(ary) <= ary_embed_capa(ary));
+    }
+    else {
+#if 1
+        const VALUE *ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
+        long i, len = RARRAY_LEN(ary);
+        volatile VALUE v;
+        if (len > 1) len = 1; /* check only HEAD */
+        for (i=0; i<len; i++) {
+            v = ptr[i]; /* access check */
+        }
+        v = v;
+#endif
+    }
+
+#if USE_TRANSIENT_HEAP
+    if (RARRAY_TRANSIENT_P(ary)) {
+        assert(rb_transient_heap_managed_ptr_p(RARRAY_CONST_PTR_TRANSIENT(ary)));
+    }
+#endif
+
+    rb_transient_heap_verify();
+
+    return ary;
+}
+
+void
+rb_ary_verify(VALUE ary)
+{
+    ary_verify(ary);
+}
+#else
+#define ary_verify(ary) ((void)0)
+#endif
+
+VALUE *
+rb_ary_ptr_use_start(VALUE ary)
+{
+#if ARRAY_DEBUG
+    FL_SET_RAW(ary, RARRAY_PTR_IN_USE_FLAG);
+#endif
+    return (VALUE *)RARRAY_CONST_PTR_TRANSIENT(ary);
+}
+
+void
+rb_ary_ptr_use_end(VALUE ary)
+{
+#if ARRAY_DEBUG
+    FL_UNSET_RAW(ary, RARRAY_PTR_IN_USE_FLAG);
+#endif
+}
+
+void
+rb_mem_clear(VALUE *mem, long size)
+{
+    while (size--) {
+        *mem++ = Qnil;
+    }
+}
+
+static void
+ary_mem_clear(VALUE ary, long beg, long size)
+{
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        rb_mem_clear(ptr + beg, size);
+    });
+}
+
+static inline void
+memfill(register VALUE *mem, register long size, register VALUE val)
+{
+    while (size--) {
+        *mem++ = val;
+    }
+}
+
+static void
+ary_memfill(VALUE ary, long beg, long size, VALUE val)
+{
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        memfill(ptr + beg, size, val);
+        RB_OBJ_WRITTEN(ary, Qundef, val);
+    });
+}
+
+static void
+ary_memcpy0(VALUE ary, long beg, long argc, const VALUE *argv, VALUE buff_owner_ary)
+{
+    assert(!ARY_SHARED_P(buff_owner_ary));
+
+    if (argc > (int)(128/sizeof(VALUE)) /* is magic number (cache line size) */) {
+        rb_gc_writebarrier_remember(buff_owner_ary);
+        RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+            MEMCPY(ptr+beg, argv, VALUE, argc);
+        });
+    }
+    else {
+        int i;
+        RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+            for (i=0; i<argc; i++) {
+                RB_OBJ_WRITE(buff_owner_ary, &ptr[i+beg], argv[i]);
+            }
+        });
+    }
+}
+
+static void
+ary_memcpy(VALUE ary, long beg, long argc, const VALUE *argv)
+{
+    ary_memcpy0(ary, beg, argc, argv, ary);
+}
+
+static VALUE *
+ary_heap_alloc(VALUE ary, size_t capa)
+{
+    VALUE *ptr = rb_transient_heap_alloc(ary, sizeof(VALUE) * capa);
+
+    if (ptr != NULL) {
+        RARY_TRANSIENT_SET(ary);
+    }
+    else {
+        RARY_TRANSIENT_UNSET(ary);
+        ptr = ALLOC_N(VALUE, capa);
+    }
+
+    return ptr;
+}
+
+static void
+ary_heap_free_ptr(VALUE ary, const VALUE *ptr, long size)
+{
+    if (RARRAY_TRANSIENT_P(ary)) {
+        /* ignore it */
+    }
+    else {
+        ruby_sized_xfree((void *)ptr, size);
+    }
+}
+
+static void
+ary_heap_free(VALUE ary)
+{
+    if (RARRAY_TRANSIENT_P(ary)) {
+        RARY_TRANSIENT_UNSET(ary);
+    }
+    else {
+        ary_heap_free_ptr(ary, ARY_HEAP_PTR(ary), ARY_HEAP_SIZE(ary));
+    }
+}
+
+static size_t
+ary_heap_realloc(VALUE ary, size_t new_capa)
+{
+    size_t alloc_capa = new_capa;
+    size_t old_capa = ARY_HEAP_CAPA(ary);
+
+    if (RARRAY_TRANSIENT_P(ary)) {
+        if (new_capa <= old_capa) {
+            /* do nothing */
+            alloc_capa = old_capa;
+        }
+        else {
+            VALUE *new_ptr = rb_transient_heap_alloc(ary, sizeof(VALUE) * new_capa);
+
+            if (new_ptr == NULL) {
+                new_ptr = ALLOC_N(VALUE, new_capa);
+                RARY_TRANSIENT_UNSET(ary);
+            }
+
+            MEMCPY(new_ptr, ARY_HEAP_PTR(ary), VALUE, old_capa);
+            ARY_SET_PTR(ary, new_ptr);
+        }
+    }
+    else {
+        SIZED_REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, new_capa, old_capa);
+    }
+    ary_verify(ary);
+
+    return alloc_capa;
+}
+
+#if USE_TRANSIENT_HEAP
+static inline void
+rb_ary_transient_heap_evacuate_(VALUE ary, int transient, int promote)
+{
+    if (transient) {
+        assert(!ARY_SHARED_ROOT_P(ary));
+
+        VALUE *new_ptr;
+        const VALUE *old_ptr = ARY_HEAP_PTR(ary);
+        long capa = ARY_HEAP_CAPA(ary);
+
+        assert(ARY_OWNS_HEAP_P(ary));
+        assert(RARRAY_TRANSIENT_P(ary));
+        assert(!ARY_PTR_USING_P(ary));
+
+        if (promote) {
+            new_ptr = ALLOC_N(VALUE, capa);
+            RARY_TRANSIENT_UNSET(ary);
+        }
+        else {
+            new_ptr = ary_heap_alloc(ary, capa);
+        }
+
+        MEMCPY(new_ptr, old_ptr, VALUE, capa);
+        /* do not use ARY_SET_PTR() because they assert !frozen */
+        RARRAY(ary)->as.heap.ptr = new_ptr;
+    }
+
+    ary_verify(ary);
+}
+
+void
+rb_ary_transient_heap_evacuate(VALUE ary, int promote)
+{
+    rb_ary_transient_heap_evacuate_(ary, RARRAY_TRANSIENT_P(ary), promote);
+}
+
+void
+rb_ary_detransient(VALUE ary)
+{
+    assert(RARRAY_TRANSIENT_P(ary));
+    rb_ary_transient_heap_evacuate_(ary, TRUE, TRUE);
+}
+#else
+void
+rb_ary_detransient(VALUE ary)
+{
+    /* do nothing */
+}
+#endif
+
+void
+rb_ary_make_embedded(VALUE ary)
+{
+    assert(rb_ary_embeddable_p(ary));
+    if (!ARY_EMBED_P(ary)) {
+        const VALUE *buf = ARY_HEAP_PTR(ary);
+        long len = ARY_HEAP_LEN(ary);
+        bool was_transient = RARRAY_TRANSIENT_P(ary);
+
+        // FL_SET_EMBED also unsets the transient flag
+        FL_SET_EMBED(ary);
+        ARY_SET_EMBED_LEN(ary, len);
+
+        MEMCPY((void *)ARY_EMBED_PTR(ary), (void *)buf, VALUE, len);
+
+        if (!was_transient) {
+            ary_heap_free_ptr(ary, buf, len * sizeof(VALUE));
+        }
+    }
+}
+
 static void
 ary_resize_capa(VALUE ary, long capacity)
 {
     assert(RARRAY_LEN(ary) <= capacity);
     assert(!OBJ_FROZEN(ary));
     assert(!ARY_SHARED_P(ary));
-    if (capacity > RARRAY_EMBED_LEN_MAX) {
+
+    if (capacity > ary_embed_capa(ary)) {
+        size_t new_capa = capacity;
         if (ARY_EMBED_P(ary)) {
             long len = ARY_EMBED_LEN(ary);
-            VALUE *ptr = ALLOC_N(VALUE, (capacity));
+            VALUE *ptr = ary_heap_alloc(ary, capacity);
+
             MEMCPY(ptr, ARY_EMBED_PTR(ary), VALUE, len);
             FL_UNSET_EMBED(ary);
             ARY_SET_PTR(ary, ptr);
             ARY_SET_HEAP_LEN(ary, len);
         }
         else {
-            REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, (capacity));
+            new_capa = ary_heap_realloc(ary, capacity);
         }
-        ARY_SET_CAPA(ary, (capacity));
+        ARY_SET_CAPA(ary, new_capa);
     }
     else {
         if (!ARY_EMBED_P(ary)) {
-            long len = RARRAY_LEN(ary);
-            VALUE *ptr = RARRAY_PTR(ary);
+            long len = ARY_HEAP_LEN(ary);
+            long old_capa = ARY_HEAP_CAPA(ary);
+            const VALUE *ptr = ARY_HEAP_PTR(ary);
+
             if (len > capacity) len = capacity;
-            MEMCPY(RARRAY(ary)->as.ary, ptr, VALUE, len);
+            MEMCPY((VALUE *)RARRAY(ary)->as.ary, ptr, VALUE, len);
+            ary_heap_free_ptr(ary, ptr, old_capa);
+
             FL_SET_EMBED(ary);
             ARY_SET_LEN(ary, len);
-            xfree(ptr);
         }
     }
+
+    ary_verify(ary);
+}
+
+static inline void
+ary_shrink_capa(VALUE ary)
+{
+    long capacity = ARY_HEAP_LEN(ary);
+    long old_capa = ARY_HEAP_CAPA(ary);
+    assert(!ARY_SHARED_P(ary));
+    assert(old_capa >= capacity);
+    if (old_capa > capacity) ary_heap_realloc(ary, capacity);
+
+    ary_verify(ary);
 }
 
 static void
@@ -183,145 +587,268 @@ ary_double_capa(VALUE ary, long min)
     long new_capa = ARY_CAPA(ary) / 2;
 
     if (new_capa < ARY_DEFAULT_SIZE) {
-	new_capa = ARY_DEFAULT_SIZE;
+        new_capa = ARY_DEFAULT_SIZE;
     }
     if (new_capa >= ARY_MAX_SIZE - min) {
-	new_capa = (ARY_MAX_SIZE - min) / 2;
+        new_capa = (ARY_MAX_SIZE - min) / 2;
     }
     new_capa += min;
     ary_resize_capa(ary, new_capa);
+
+    ary_verify(ary);
 }
 
 static void
-rb_ary_decrement_share(VALUE shared)
+rb_ary_decrement_share(VALUE shared_root)
 {
-    if (shared) {
-	long num = ARY_SHARED_NUM(shared) - 1;
-	if (num == 0) {
-	    rb_ary_free(shared);
-	    rb_gc_force_recycle(shared);
-	}
-	else if (num > 0) {
-	    ARY_SET_SHARED_NUM(shared, num);
-	}
+    if (!OBJ_FROZEN(shared_root)) {
+        long num = ARY_SHARED_ROOT_REFCNT(shared_root);
+        ARY_SET_SHARED_ROOT_REFCNT(shared_root, num - 1);
     }
 }
 
 static void
 rb_ary_unshare(VALUE ary)
 {
-    VALUE shared = RARRAY(ary)->as.heap.aux.shared;
-    rb_ary_decrement_share(shared);
+    VALUE shared_root = ARY_SHARED_ROOT(ary);
+    rb_ary_decrement_share(shared_root);
     FL_UNSET_SHARED(ary);
 }
 
-static inline void
-rb_ary_unshare_safe(VALUE ary)
+static void
+rb_ary_reset(VALUE ary)
 {
-    if (ARY_SHARED_P(ary) && !ARY_EMBED_P(ary)) {
-	rb_ary_unshare(ary);
+    if (ARY_OWNS_HEAP_P(ary)) {
+        ary_heap_free(ary);
     }
+    else if (ARY_SHARED_P(ary)) {
+        rb_ary_unshare(ary);
+    }
+
+    FL_SET_EMBED(ary);
+    ARY_SET_EMBED_LEN(ary, 0);
 }
 
 static VALUE
-rb_ary_increment_share(VALUE shared)
+rb_ary_increment_share(VALUE shared_root)
 {
-    long num = ARY_SHARED_NUM(shared);
-    if (num >= 0) {
-	ARY_SET_SHARED_NUM(shared, num + 1);
+    if (!OBJ_FROZEN(shared_root)) {
+        long num = ARY_SHARED_ROOT_REFCNT(shared_root);
+        assert(num >= 0);
+        ARY_SET_SHARED_ROOT_REFCNT(shared_root, num + 1);
     }
-    return shared;
+    return shared_root;
 }
 
 static void
-rb_ary_set_shared(VALUE ary, VALUE shared)
+rb_ary_set_shared(VALUE ary, VALUE shared_root)
 {
-    rb_ary_increment_share(shared);
+    rb_ary_increment_share(shared_root);
     FL_SET_SHARED(ary);
-    ARY_SET_SHARED(ary, shared);
+    RB_DEBUG_COUNTER_INC(obj_ary_shared_create);
+    ARY_SET_SHARED(ary, shared_root);
 }
 
 static inline void
 rb_ary_modify_check(VALUE ary)
 {
     rb_check_frozen(ary);
-    if (!OBJ_UNTRUSTED(ary) && rb_safe_level() >= 4)
-	rb_raise(rb_eSecurityError, "Insecure: can't modify array");
+    ary_verify(ary);
 }
 
 void
-rb_ary_modify(VALUE ary)
+rb_ary_cancel_sharing(VALUE ary)
 {
-    rb_ary_modify_check(ary);
     if (ARY_SHARED_P(ary)) {
-        long len = RARRAY_LEN(ary);
-        if (len <= RARRAY_EMBED_LEN_MAX) {
-            VALUE *ptr = ARY_HEAP_PTR(ary);
-            VALUE shared = ARY_SHARED(ary);
+        long shared_len, len = RARRAY_LEN(ary);
+        VALUE shared_root = ARY_SHARED_ROOT(ary);
+
+        ary_verify(shared_root);
+
+        if (len <= ary_embed_capa(ary)) {
+            const VALUE *ptr = ARY_HEAP_PTR(ary);
             FL_UNSET_SHARED(ary);
             FL_SET_EMBED(ary);
-            MEMCPY(ARY_EMBED_PTR(ary), ptr, VALUE, len);
-            rb_ary_decrement_share(shared);
+            MEMCPY((VALUE *)ARY_EMBED_PTR(ary), ptr, VALUE, len);
+            rb_ary_decrement_share(shared_root);
             ARY_SET_EMBED_LEN(ary, len);
         }
+        else if (ARY_SHARED_ROOT_OCCUPIED(shared_root) && len > ((shared_len = RARRAY_LEN(shared_root))>>1)) {
+            long shift = RARRAY_CONST_PTR_TRANSIENT(ary) - RARRAY_CONST_PTR_TRANSIENT(shared_root);
+            FL_UNSET_SHARED(ary);
+            ARY_SET_PTR(ary, RARRAY_CONST_PTR_TRANSIENT(shared_root));
+            ARY_SET_CAPA(ary, shared_len);
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+                MEMMOVE(ptr, ptr+shift, VALUE, len);
+            });
+            FL_SET_EMBED(shared_root);
+            rb_ary_decrement_share(shared_root);
+        }
         else {
-            VALUE *ptr = ALLOC_N(VALUE, len);
-            MEMCPY(ptr, RARRAY_PTR(ary), VALUE, len);
+            VALUE *ptr = ary_heap_alloc(ary, len);
+            MEMCPY(ptr, ARY_HEAP_PTR(ary), VALUE, len);
             rb_ary_unshare(ary);
             ARY_SET_CAPA(ary, len);
             ARY_SET_PTR(ary, ptr);
         }
+
+        rb_gc_writebarrier_remember(ary);
     }
+    ary_verify(ary);
 }
 
-VALUE
-rb_ary_freeze(VALUE ary)
+void
+rb_ary_modify(VALUE ary)
 {
-    return rb_obj_freeze(ary);
+    rb_ary_modify_check(ary);
+    rb_ary_cancel_sharing(ary);
+}
+
+static VALUE
+ary_ensure_room_for_push(VALUE ary, long add_len)
+{
+    long old_len = RARRAY_LEN(ary);
+    long new_len = old_len + add_len;
+    long capa;
+
+    if (old_len > ARY_MAX_SIZE - add_len) {
+        rb_raise(rb_eIndexError, "index %ld too big", new_len);
+    }
+    if (ARY_SHARED_P(ary)) {
+        if (new_len > ary_embed_capa(ary)) {
+            VALUE shared_root = ARY_SHARED_ROOT(ary);
+            if (ARY_SHARED_ROOT_OCCUPIED(shared_root)) {
+                if (ARY_HEAP_PTR(ary) - RARRAY_CONST_PTR_TRANSIENT(shared_root) + new_len <= RARRAY_LEN(shared_root)) {
+                    rb_ary_modify_check(ary);
+
+                    ary_verify(ary);
+                    ary_verify(shared_root);
+                    return shared_root;
+                }
+                else {
+                    /* if array is shared, then it is likely it participate in push/shift pattern */
+                    rb_ary_modify(ary);
+                    capa = ARY_CAPA(ary);
+                    if (new_len > capa - (capa >> 6)) {
+                        ary_double_capa(ary, new_len);
+                    }
+                    ary_verify(ary);
+                    return ary;
+                }
+            }
+        }
+        ary_verify(ary);
+        rb_ary_modify(ary);
+    }
+    else {
+        rb_ary_modify_check(ary);
+    }
+    capa = ARY_CAPA(ary);
+    if (new_len > capa) {
+        ary_double_capa(ary, new_len);
+    }
+
+    ary_verify(ary);
+    return ary;
 }
 
 /*
  *  call-seq:
- *     ary.frozen?  -> true or false
+ *    array.freeze -> self
+ *
+ *  Freezes +self+; returns +self+:
  *
- *  Return <code>true</code> if this array is frozen (or temporarily frozen
- *  while being sorted).
+ *    a = []
+ *    a.frozen? # => false
+ *    a.freeze
+ *    a.frozen? # => true
+ *
+ *  An attempt to modify a frozen \Array raises FrozenError.
  */
 
-static VALUE
-rb_ary_frozen_p(VALUE ary)
+VALUE
+rb_ary_freeze(VALUE ary)
+{
+    return rb_obj_freeze(ary);
+}
+
+/* This can be used to take a snapshot of an array (with
+   e.g. rb_ary_replace) and check later whether the array has been
+   modified from the snapshot.  The snapshot is cheap, though if
+   something does modify the array it will pay the cost of copying
+   it.  If Array#pop or Array#shift has been called, the array will
+   be still shared with the snapshot, but the array length will
+   differ. */
+VALUE
+rb_ary_shared_with_p(VALUE ary1, VALUE ary2)
 {
-    if (OBJ_FROZEN(ary)) return Qtrue;
+    if (!ARY_EMBED_P(ary1) && ARY_SHARED_P(ary1) &&
+            !ARY_EMBED_P(ary2) && ARY_SHARED_P(ary2) &&
+            ARY_SHARED_ROOT(ary1) == ARY_SHARED_ROOT(ary2) &&
+            ARY_HEAP_LEN(ary1) == ARY_HEAP_LEN(ary2)) {
+        return Qtrue;
+    }
     return Qfalse;
 }
 
 static VALUE
-ary_alloc(VALUE klass)
+ary_alloc_embed(VALUE klass, long capa)
 {
-    NEWOBJ(ary, struct RArray);
-    OBJSETUP(ary, klass, T_ARRAY);
-    FL_SET_EMBED((VALUE)ary);
-    ARY_SET_EMBED_LEN((VALUE)ary, 0);
+    size_t size = ary_embed_size(capa);
+    assert(rb_gc_size_allocatable_p(size));
+#if !USE_RVARGC
+    assert(size <= sizeof(struct RArray));
+#endif
+    RVARGC_NEWOBJ_OF(ary, struct RArray, klass,
+                     T_ARRAY | RARRAY_EMBED_FLAG | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                     size);
+    /* Created array is:
+     *   FL_SET_EMBED((VALUE)ary);
+     *   ARY_SET_EMBED_LEN((VALUE)ary, 0);
+     */
+    return (VALUE)ary;
+}
 
+static VALUE
+ary_alloc_heap(VALUE klass)
+{
+    RVARGC_NEWOBJ_OF(ary, struct RArray, klass,
+                     T_ARRAY | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                     sizeof(struct RArray));
     return (VALUE)ary;
 }
 
 static VALUE
+empty_ary_alloc(VALUE klass)
+{
+    RUBY_DTRACE_CREATE_HOOK(ARRAY, 0);
+    return ary_alloc_embed(klass, 0);
+}
+
+static VALUE
 ary_new(VALUE klass, long capa)
 {
-    VALUE ary;
+    VALUE ary,*ptr;
 
     if (capa < 0) {
-	rb_raise(rb_eArgError, "negative array size (or size too big)");
+        rb_raise(rb_eArgError, "negative array size (or size too big)");
     }
     if (capa > ARY_MAX_SIZE) {
-	rb_raise(rb_eArgError, "array size too big");
+        rb_raise(rb_eArgError, "array size too big");
+    }
+
+    RUBY_DTRACE_CREATE_HOOK(ARRAY, capa);
+
+    if (ary_embeddable_p(capa)) {
+        ary = ary_alloc_embed(klass, capa);
     }
-    ary = ary_alloc(klass);
-    if (capa > RARRAY_EMBED_LEN_MAX) {
-        FL_UNSET_EMBED(ary);
-        ARY_SET_PTR(ary, ALLOC_N(VALUE, capa));
+    else {
+        ary = ary_alloc_heap(klass);
         ARY_SET_CAPA(ary, capa);
+        assert(!ARY_EMBED_P(ary));
+
+        ptr = ary_heap_alloc(ary, capa);
+        ARY_SET_PTR(ary, ptr);
         ARY_SET_HEAP_LEN(ary, 0);
     }
 
@@ -329,22 +856,19 @@ ary_new(VALUE klass, long capa)
 }
 
 VALUE
-rb_ary_new2(long capa)
+rb_ary_new_capa(long capa)
 {
     return ary_new(rb_cArray, capa);
 }
 
-
 VALUE
 rb_ary_new(void)
 {
-    return rb_ary_new2(RARRAY_EMBED_LEN_MAX);
+    return rb_ary_new_capa(0);
 }
 
-#include <stdarg.h>
-
 VALUE
-rb_ary_new3(long n, ...)
+(rb_ary_new_from_args)(long n, ...)
 {
     va_list ar;
     VALUE ary;
@@ -354,7 +878,7 @@ rb_ary_new3(long n, ...)
 
     va_start(ar, n);
     for (i=0; i<n; i++) {
-	RARRAY_PTR(ary)[i] = va_arg(ar, VALUE);
+        ARY_SET(ary, i, va_arg(ar, VALUE));
     }
     va_end(ar);
 
@@ -362,31 +886,141 @@ rb_ary_new3(long n, ...)
     return ary;
 }
 
+MJIT_FUNC_EXPORTED VALUE
+rb_ary_tmp_new_from_values(VALUE klass, long n, const VALUE *elts)
+{
+    VALUE ary;
+
+    ary = ary_new(klass, n);
+    if (n > 0 && elts) {
+        ary_memcpy(ary, 0, n, elts);
+        ARY_SET_LEN(ary, n);
+    }
+
+    return ary;
+}
+
 VALUE
-rb_ary_new4(long n, const VALUE *elts)
+rb_ary_new_from_values(long n, const VALUE *elts)
+{
+    return rb_ary_tmp_new_from_values(rb_cArray, n, elts);
+}
+
+static VALUE
+ec_ary_alloc_embed(rb_execution_context_t *ec, VALUE klass, long capa)
+{
+    size_t size = ary_embed_size(capa);
+    assert(rb_gc_size_allocatable_p(size));
+#if !USE_RVARGC
+    assert(size <= sizeof(struct RArray));
+#endif
+    RB_RVARGC_EC_NEWOBJ_OF(ec, ary, struct RArray, klass,
+                           T_ARRAY | RARRAY_EMBED_FLAG | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                           size);
+    /* Created array is:
+     *   FL_SET_EMBED((VALUE)ary);
+     *   ARY_SET_EMBED_LEN((VALUE)ary, 0);
+     */
+    return (VALUE)ary;
+}
+
+static VALUE
+ec_ary_alloc_heap(rb_execution_context_t *ec, VALUE klass)
+{
+    RB_RVARGC_EC_NEWOBJ_OF(ec, ary, struct RArray, klass,
+                           T_ARRAY | (RGENGC_WB_PROTECTED_ARRAY ? FL_WB_PROTECTED : 0),
+                           sizeof(struct RArray));
+    return (VALUE)ary;
+}
+
+static VALUE
+ec_ary_new(rb_execution_context_t *ec, VALUE klass, long capa)
+{
+    VALUE ary,*ptr;
+
+    if (capa < 0) {
+        rb_raise(rb_eArgError, "negative array size (or size too big)");
+    }
+    if (capa > ARY_MAX_SIZE) {
+        rb_raise(rb_eArgError, "array size too big");
+    }
+
+    RUBY_DTRACE_CREATE_HOOK(ARRAY, capa);
+
+    if (ary_embeddable_p(capa)) {
+        ary = ec_ary_alloc_embed(ec, klass, capa);
+    }
+    else {
+        ary = ec_ary_alloc_heap(ec, klass);
+        ARY_SET_CAPA(ary, capa);
+        assert(!ARY_EMBED_P(ary));
+
+        ptr = ary_heap_alloc(ary, capa);
+        ARY_SET_PTR(ary, ptr);
+        ARY_SET_HEAP_LEN(ary, 0);
+    }
+
+    return ary;
+}
+
+VALUE
+rb_ec_ary_new_from_values(rb_execution_context_t *ec, long n, const VALUE *elts)
 {
     VALUE ary;
 
-    ary = rb_ary_new2(n);
+    ary = ec_ary_new(ec, rb_cArray, n);
     if (n > 0 && elts) {
-	MEMCPY(RARRAY_PTR(ary), elts, VALUE, n);
-	ARY_SET_LEN(ary, n);
+        ary_memcpy(ary, 0, n, elts);
+        ARY_SET_LEN(ary, n);
     }
 
     return ary;
 }
 
 VALUE
-rb_ary_tmp_new(long capa)
+rb_ary_hidden_new(long capa)
+{
+    VALUE ary = ary_new(0, capa);
+    rb_ary_transient_heap_evacuate(ary, TRUE);
+    return ary;
+}
+
+VALUE
+rb_ary_hidden_new_fill(long capa)
 {
-    return ary_new(0, capa);
+    VALUE ary = rb_ary_hidden_new(capa);
+    ary_memfill(ary, 0, capa, Qnil);
+    ARY_SET_LEN(ary, capa);
+    return ary;
 }
 
 void
 rb_ary_free(VALUE ary)
 {
     if (ARY_OWNS_HEAP_P(ary)) {
-	xfree(ARY_HEAP_PTR(ary));
+        if (USE_DEBUG_COUNTER &&
+            !ARY_SHARED_ROOT_P(ary) &&
+            ARY_HEAP_CAPA(ary) > RARRAY_LEN(ary)) {
+            RB_DEBUG_COUNTER_INC(obj_ary_extracapa);
+        }
+
+        if (RARRAY_TRANSIENT_P(ary)) {
+            RB_DEBUG_COUNTER_INC(obj_ary_transient);
+        }
+        else {
+            RB_DEBUG_COUNTER_INC(obj_ary_ptr);
+            ary_heap_free(ary);
+        }
+    }
+    else {
+        RB_DEBUG_COUNTER_INC(obj_ary_embed);
+    }
+
+    if (ARY_SHARED_P(ary)) {
+        RB_DEBUG_COUNTER_INC(obj_ary_shared);
+    }
+    if (ARY_SHARED_ROOT_P(ary) && ARY_SHARED_ROOT_OCCUPIED(ary)) {
+        RB_DEBUG_COUNTER_INC(obj_ary_shared_root_occupied);
     }
 }
 
@@ -394,61 +1028,83 @@ RUBY_FUNC_EXPORTED size_t
 rb_ary_memsize(VALUE ary)
 {
     if (ARY_OWNS_HEAP_P(ary)) {
-	return RARRAY(ary)->as.heap.aux.capa * sizeof(VALUE);
+        return ARY_CAPA(ary) * sizeof(VALUE);
     }
     else {
-	return 0;
+        return 0;
     }
 }
 
-static inline void
-ary_discard(VALUE ary)
-{
-    rb_ary_free(ary);
-    RBASIC(ary)->flags |= RARRAY_EMBED_FLAG;
-    RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK;
-}
-
 static VALUE
 ary_make_shared(VALUE ary)
 {
-    assert(!ARY_EMBED_P(ary));
+    assert(USE_RVARGC || !ARY_EMBED_P(ary));
+    ary_verify(ary);
+
     if (ARY_SHARED_P(ary)) {
-	return ARY_SHARED(ary);
+        return ARY_SHARED_ROOT(ary);
     }
     else if (ARY_SHARED_ROOT_P(ary)) {
-	return ary;
+        return ary;
     }
     else if (OBJ_FROZEN(ary)) {
-	ary_resize_capa(ary, ARY_HEAP_LEN(ary));
-	FL_SET_SHARED_ROOT(ary);
-	ARY_SET_SHARED_NUM(ary, 1);
-	return ary;
+        if (!ARY_EMBED_P(ary)) {
+            rb_ary_transient_heap_evacuate(ary, TRUE);
+            ary_shrink_capa(ary);
+        }
+        return ary;
     }
     else {
-	NEWOBJ(shared, struct RArray);
-	OBJSETUP(shared, 0, T_ARRAY);
-        FL_UNSET_EMBED(shared);
+        rb_ary_transient_heap_evacuate(ary, TRUE);
+
+        long capa = ARY_CAPA(ary);
+        long len = RARRAY_LEN(ary);
+
+        /* Shared roots cannot be embedded because the reference count
+         * (refcnt) is stored in as.heap.aux.capa. */
+        VALUE shared = ary_alloc_heap(0);
+        FL_SET_SHARED_ROOT(shared);
+
+        if (ARY_EMBED_P(ary)) {
+            /* Cannot use ary_heap_alloc because we don't want to allocate
+             * on the transient heap. */
+            VALUE *ptr = ALLOC_N(VALUE, capa);
+            ARY_SET_PTR(shared, ptr);
+            ary_memcpy(shared, 0, len, RARRAY_PTR(ary));
+
+            FL_UNSET_EMBED(ary);
+            ARY_SET_HEAP_LEN(ary, len);
+            ARY_SET_PTR(ary, ptr);
+        }
+        else {
+            ARY_SET_PTR(shared, RARRAY_PTR(ary));
+        }
+
+        ARY_SET_LEN(shared, capa);
+        ary_mem_clear(shared, len, capa - len);
+        ARY_SET_SHARED_ROOT_REFCNT(shared, 1);
+        FL_SET_SHARED(ary);
+        RB_DEBUG_COUNTER_INC(obj_ary_shared_create);
+        ARY_SET_SHARED(ary, shared);
+
+        ary_verify(shared);
+        ary_verify(ary);
 
-        ARY_SET_LEN((VALUE)shared, RARRAY_LEN(ary));
-        ARY_SET_PTR((VALUE)shared, RARRAY_PTR(ary));
-	FL_SET_SHARED_ROOT(shared);
-	ARY_SET_SHARED_NUM((VALUE)shared, 1);
-	FL_SET_SHARED(ary);
-	ARY_SET_SHARED(ary, (VALUE)shared);
-	OBJ_FREEZE(shared);
-	return (VALUE)shared;
+        return shared;
     }
 }
 
-
 static VALUE
 ary_make_substitution(VALUE ary)
 {
-    if (RARRAY_LEN(ary) <= RARRAY_EMBED_LEN_MAX) {
-        VALUE subst = rb_ary_new2(RARRAY_LEN(ary));
-        MEMCPY(ARY_EMBED_PTR(subst), RARRAY_PTR(ary), VALUE, RARRAY_LEN(ary));
-        ARY_SET_EMBED_LEN(subst, RARRAY_LEN(ary));
+    long len = RARRAY_LEN(ary);
+
+    if (ary_embeddable_p(len)) {
+        VALUE subst = rb_ary_new_capa(len);
+        assert(ARY_EMBED_P(subst));
+
+        ary_memcpy(subst, 0, len, RARRAY_CONST_PTR_TRANSIENT(ary));
+        ARY_SET_EMBED_LEN(subst, len);
         return subst;
     }
     else {
@@ -462,35 +1118,43 @@ rb_assoc_new(VALUE car, VALUE cdr)
     return rb_ary_new3(2, car, cdr);
 }
 
-static VALUE
-to_ary(VALUE ary)
+VALUE
+rb_to_array_type(VALUE ary)
 {
-    return rb_convert_type(ary, T_ARRAY, "Array", "to_ary");
+    return rb_convert_type_with_id(ary, T_ARRAY, "Array", idTo_ary);
 }
+#define to_ary rb_to_array_type
 
 VALUE
 rb_check_array_type(VALUE ary)
 {
-    return rb_check_convert_type(ary, T_ARRAY, "Array", "to_ary");
+    return rb_check_convert_type_with_id(ary, T_ARRAY, "Array", idTo_ary);
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_check_to_array(VALUE ary)
+{
+    return rb_check_convert_type_with_id(ary, T_ARRAY, "Array", idTo_a);
+}
+
+VALUE
+rb_to_array(VALUE ary)
+{
+    return rb_convert_type_with_id(ary, T_ARRAY, "Array", idTo_a);
 }
 
 /*
  *  call-seq:
- *     Array.try_convert(obj) -> array or nil
+ *    Array.try_convert(object) -> object, new_array, or nil
  *
- *  Tries to convert +obj+ into an array, using +to_ary+ method.  Returns the
- *  converted array or +nil+ if +obj+ cannot be converted for any reason.
- *  This method can be used to check if an argument is an array.
+ *  If +object+ is an \Array object, returns +object+.
  *
- *     Array.try_convert([1])   #=> [1]
- *     Array.try_convert("1")   #=> nil
+ *  Otherwise if +object+ responds to <tt>:to_ary</tt>,
+ *  calls <tt>object.to_ary</tt> and returns the result.
  *
- *     if tmp = Array.try_convert(arg)
- *       # the argument is an array
- *     elsif tmp = String.try_convert(arg)
- *       # the argument is a string
- *     end
+ *  Returns +nil+ if +object+ does not respond to <tt>:to_ary</tt>
  *
+ *  Raises an exception unless <tt>object.to_ary</tt> returns an \Array object.
  */
 
 static VALUE
@@ -499,60 +1163,76 @@ rb_ary_s_try_convert(VALUE dummy, VALUE ary)
     return rb_check_array_type(ary);
 }
 
+/* :nodoc: */
+static VALUE
+rb_ary_s_new(int argc, VALUE *argv, VALUE klass)
+{
+    VALUE ary;
+
+    if (klass == rb_cArray) {
+        long size = 0;
+        if (argc > 0 && FIXNUM_P(argv[0])) {
+            size = FIX2LONG(argv[0]);
+            if (size < 0) size = 0;
+        }
+
+        ary = ary_new(klass, size);
+
+        rb_obj_call_init_kw(ary, argc, argv, RB_PASS_CALLED_KEYWORDS);
+    }
+    else {
+        ary = rb_class_new_instance_pass_kw(argc, argv, klass);
+    }
+
+    return ary;
+}
+
 /*
  *  call-seq:
- *     Array.new(size=0, obj=nil)
- *     Array.new(array)
- *     Array.new(size) {|index| block }
- *
- *  Returns a new array.
- *
- *  In the first form, if no arguments are sent, the new array will be empty.
- *  When a +size+ and an optional +obj+ are sent, an array is created with
- *  +size+ copies of +obj+.  Take notice that all elements will reference the
- *  same object +obj+.
- *
- *  The second form creates a copy of the array passed as a parameter (the
- *  array is generated by calling to_ary on the parameter).
+ *    Array.new -> new_empty_array
+ *    Array.new(array) -> new_array
+ *    Array.new(size) -> new_array
+ *    Array.new(size, default_value) -> new_array
+ *    Array.new(size) {|index| ... } -> new_array
  *
- *    first_array = ["Matz", "Guido"]
+ *  Returns a new \Array.
  *
- *    second_array = Array.new(first_array) #=> ["Matz", "Guido"]
+ *  With no block and no arguments, returns a new empty \Array object.
  *
- *    first_array.equal? second_array       #=> false
+ *  With no block and a single \Array argument +array+,
+ *  returns a new \Array formed from +array+:
  *
- *  In the last form, an array of the given size is created.  Each element in
- *  this array is created by passing the element's index to the given block
- *  and storing the return value.
+ *    a = Array.new([:foo, 'bar', 2])
+ *    a.class # => Array
+ *    a # => [:foo, "bar", 2]
  *
- *    Array.new(3){ |index| index ** 2 }
- *    # => [0, 1, 4]
+ *  With no block and a single \Integer argument +size+,
+ *  returns a new \Array of the given size
+ *  whose elements are all +nil+:
  *
- *  == Common gotchas
+ *    a = Array.new(3)
+ *    a # => [nil, nil, nil]
  *
- *  When sending the second parameter, the same object will be used as the
- *  value for all the array elements:
+ *  With no block and arguments +size+ and +default_value+,
+ *  returns an \Array of the given size;
+ *  each element is that same +default_value+:
  *
- *     a = Array.new(2, Hash.new)
- *     # => [{}, {}]
+ *    a = Array.new(3, 'x')
+ *    a # => ['x', 'x', 'x']
  *
- *     a[0]['cat'] = 'feline'
- *     a # => [{"cat"=>"feline"}, {"cat"=>"feline"}]
+ *  With a block and argument +size+,
+ *  returns an \Array of the given size;
+ *  the block is called with each successive integer +index+;
+ *  the element for that +index+ is the return value from the block:
  *
- *     a[1]['cat'] = 'Felix'
- *     a # => [{"cat"=>"Felix"}, {"cat"=>"Felix"}]
+ *    a = Array.new(3) {|index| "Element #{index}" }
+ *    a # => ["Element 0", "Element 1", "Element 2"]
  *
- *  Since all the Array elements store the same hash, changes to one of them
- *  will affect them all.
- *
- *  If multiple copies are what you want, you should use the block
- *  version which uses the result of that block each time an element
- *  of the array needs to be initialized:
- *
- *     a = Array.new(2) { Hash.new }
- *     a[0]['cat'] = 'feline'
- *     a # => [{"cat"=>"feline"}, {}]
+ *  Raises ArgumentError if +size+ is negative.
  *
+ *  With a block and no argument,
+ *  or a single argument +0+,
+ *  ignores the block and returns a new empty \Array.
  */
 
 static VALUE
@@ -563,49 +1243,48 @@ rb_ary_initialize(int argc, VALUE *argv, VALUE ary)
 
     rb_ary_modify(ary);
     if (argc == 0) {
-	if (ARY_OWNS_HEAP_P(ary) && RARRAY_PTR(ary)) {
-	    xfree(RARRAY_PTR(ary));
-	}
-        rb_ary_unshare_safe(ary);
-        FL_SET_EMBED(ary);
-	ARY_SET_EMBED_LEN(ary, 0);
-	if (rb_block_given_p()) {
-	    rb_warning("given block not used");
-	}
-	return ary;
+        rb_ary_reset(ary);
+        assert(ARY_EMBED_P(ary));
+        assert(ARY_EMBED_LEN(ary) == 0);
+        if (rb_block_given_p()) {
+            rb_warning("given block not used");
+        }
+        return ary;
     }
     rb_scan_args(argc, argv, "02", &size, &val);
     if (argc == 1 && !FIXNUM_P(size)) {
-	val = rb_check_array_type(size);
-	if (!NIL_P(val)) {
-	    rb_ary_replace(ary, val);
-	    return ary;
-	}
+        val = rb_check_array_type(size);
+        if (!NIL_P(val)) {
+            rb_ary_replace(ary, val);
+            return ary;
+        }
     }
 
     len = NUM2LONG(size);
+    /* NUM2LONG() may call size.to_int, ary can be frozen, modified, etc */
     if (len < 0) {
-	rb_raise(rb_eArgError, "negative array size");
+        rb_raise(rb_eArgError, "negative array size");
     }
     if (len > ARY_MAX_SIZE) {
-	rb_raise(rb_eArgError, "array size too big");
+        rb_raise(rb_eArgError, "array size too big");
     }
+    /* recheck after argument conversion */
     rb_ary_modify(ary);
     ary_resize_capa(ary, len);
     if (rb_block_given_p()) {
-	long i;
+        long i;
 
-	if (argc == 2) {
-	    rb_warn("block supersedes default value argument");
-	}
-	for (i=0; i<len; i++) {
-	    rb_ary_store(ary, i, rb_yield(LONG2NUM(i)));
-	    ARY_SET_LEN(ary, i + 1);
-	}
+        if (argc == 2) {
+            rb_warn("block supersedes default value argument");
+        }
+        for (i=0; i<len; i++) {
+            rb_ary_store(ary, i, rb_yield(LONG2NUM(i)));
+            ARY_SET_LEN(ary, i + 1);
+        }
     }
     else {
-	memfill(RARRAY_PTR(ary), len, val);
-	ARY_SET_LEN(ary, len);
+        ary_memfill(ary, 0, len, val);
+        ARY_SET_LEN(ary, len);
     }
     return ary;
 }
@@ -613,7 +1292,7 @@ rb_ary_initialize(int argc, VALUE *argv, VALUE ary)
 /*
  * Returns a new array populated with the given objects.
  *
- *   Array.[]( 1, 'a', /^A/ ) # => [1, "a", /^A/]
+ *   Array.[]( 1, 'a', /^A/)  # => [1, "a", /^A/]
  *   Array[ 1, 'a', /^A/ ]    # => [1, "a", /^A/]
  *   [ 1, 'a', /^A/ ]         # => [1, "a", /^A/]
  */
@@ -623,7 +1302,7 @@ rb_ary_s_create(int argc, VALUE *argv, VALUE klass)
 {
     VALUE ary = ary_new(klass, argc);
     if (argc > 0 && argv) {
-        MEMCPY(RARRAY_PTR(ary), argv, VALUE, argc);
+        ary_memcpy(ary, 0, argc, argv);
         ARY_SET_LEN(ary, argc);
     }
 
@@ -633,30 +1312,31 @@ rb_ary_s_create(int argc, VALUE *argv, VALUE klass)
 void
 rb_ary_store(VALUE ary, long idx, VALUE val)
 {
+    long len = RARRAY_LEN(ary);
+
     if (idx < 0) {
-	idx += RARRAY_LEN(ary);
-	if (idx < 0) {
-	    rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
-		     idx - RARRAY_LEN(ary), -RARRAY_LEN(ary));
-	}
+        idx += len;
+        if (idx < 0) {
+            rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
+                     idx - len, -len);
+        }
     }
     else if (idx >= ARY_MAX_SIZE) {
-	rb_raise(rb_eIndexError, "index %ld too big", idx);
+        rb_raise(rb_eIndexError, "index %ld too big", idx);
     }
 
     rb_ary_modify(ary);
     if (idx >= ARY_CAPA(ary)) {
-	ary_double_capa(ary, idx);
+        ary_double_capa(ary, idx);
     }
-    if (idx > RARRAY_LEN(ary)) {
-	rb_mem_clear(RARRAY_PTR(ary) + RARRAY_LEN(ary),
-		     idx-RARRAY_LEN(ary) + 1);
+    if (idx > len) {
+        ary_mem_clear(ary, len, idx - len + 1);
     }
 
-    if (idx >= RARRAY_LEN(ary)) {
-	ARY_SET_LEN(ary, idx + 1);
+    if (idx >= len) {
+        ARY_SET_LEN(ary, idx + 1);
     }
-    RARRAY_PTR(ary)[idx] = val;
+    ARY_SET(ary, idx, val);
 }
 
 static VALUE
@@ -666,31 +1346,87 @@ ary_make_partial(VALUE ary, VALUE klass, long offset, long len)
     assert(len >= 0);
     assert(offset+len <= RARRAY_LEN(ary));
 
-    if (len <= RARRAY_EMBED_LEN_MAX) {
-        VALUE result = ary_alloc(klass);
-        MEMCPY(ARY_EMBED_PTR(result), RARRAY_PTR(ary) + offset, VALUE, len);
+    const size_t rarray_embed_capa_max = (sizeof(struct RArray) - offsetof(struct RArray, as.ary)) / sizeof(VALUE);
+
+    if ((size_t)len <= rarray_embed_capa_max && ary_embeddable_p(len)) {
+        VALUE result = ary_alloc_embed(klass, len);
+        ary_memcpy(result, 0, len, RARRAY_CONST_PTR_TRANSIENT(ary) + offset);
         ARY_SET_EMBED_LEN(result, len);
         return result;
     }
     else {
-        VALUE shared, result = ary_alloc(klass);
-        FL_UNSET_EMBED(result);
+        VALUE shared = ary_make_shared(ary);
 
-        shared = ary_make_shared(ary);
-        ARY_SET_PTR(result, RARRAY_PTR(ary));
+        VALUE result = ary_alloc_heap(klass);
+        assert(!ARY_EMBED_P(result));
+
+        ARY_SET_PTR(result, RARRAY_CONST_PTR_TRANSIENT(ary));
         ARY_SET_LEN(result, RARRAY_LEN(ary));
         rb_ary_set_shared(result, shared);
 
         ARY_INCREASE_PTR(result, offset);
         ARY_SET_LEN(result, len);
+
+        ary_verify(shared);
+        ary_verify(result);
+        return result;
+    }
+}
+
+static VALUE
+ary_make_partial_step(VALUE ary, VALUE klass, long offset, long len, long step)
+{
+    assert(offset >= 0);
+    assert(len >= 0);
+    assert(offset+len <= RARRAY_LEN(ary));
+    assert(step != 0);
+
+    const VALUE *values = RARRAY_CONST_PTR_TRANSIENT(ary);
+    const long orig_len = len;
+
+    if (step > 0 && step >= len) {
+        VALUE result = ary_new(klass, 1);
+        VALUE *ptr = (VALUE *)ARY_EMBED_PTR(result);
+        RB_OBJ_WRITE(result, ptr, values[offset]);
+        ARY_SET_EMBED_LEN(result, 1);
         return result;
     }
+    else if (step < 0 && step < -len) {
+        step = -len;
+    }
+
+    long ustep = (step < 0) ? -step : step;
+    len = roomof(len, ustep);
+
+    long i;
+    long j = offset + ((step > 0) ? 0 : (orig_len - 1));
+
+    VALUE result = ary_new(klass, len);
+    if (ARY_EMBED_P(result)) {
+        VALUE *ptr = (VALUE *)ARY_EMBED_PTR(result);
+        for (i = 0; i < len; ++i) {
+            RB_OBJ_WRITE(result, ptr+i, values[j]);
+            j += step;
+        }
+        ARY_SET_EMBED_LEN(result, len);
+    }
+    else {
+        RARRAY_PTR_USE_TRANSIENT(result, ptr, {
+            for (i = 0; i < len; ++i) {
+                RB_OBJ_WRITE(result, ptr+i, values[j]);
+                j += step;
+            }
+        });
+        ARY_SET_LEN(result, len);
+    }
+
+    return result;
 }
 
 static VALUE
 ary_make_shared_copy(VALUE ary)
 {
-    return ary_make_partial(ary, rb_obj_class(ary), 0, RARRAY_LEN(ary));
+    return ary_make_partial(ary, rb_cArray, 0, RARRAY_LEN(ary));
 }
 
 enum ary_take_pos_flags
@@ -700,85 +1436,92 @@ enum ary_take_pos_flags
 };
 
 static VALUE
-ary_take_first_or_last(int argc, VALUE *argv, VALUE ary, enum ary_take_pos_flags last)
+ary_take_first_or_last(int argc, const VALUE *argv, VALUE ary, enum ary_take_pos_flags last)
 {
-    VALUE nv;
     long n;
+    long len;
     long offset = 0;
 
-    rb_scan_args(argc, argv, "1", &nv);
-    n = NUM2LONG(nv);
-    if (n > RARRAY_LEN(ary)) {
-	n = RARRAY_LEN(ary);
+    argc = rb_check_arity(argc, 0, 1);
+    /* the case optional argument is omitted should be handled in
+     * callers of this function.  if another arity case is added,
+     * this arity check needs to rewrite. */
+    RUBY_ASSERT_ALWAYS(argc == 1);
+
+    n = NUM2LONG(argv[0]);
+    len = RARRAY_LEN(ary);
+    if (n > len) {
+        n = len;
     }
     else if (n < 0) {
-	rb_raise(rb_eArgError, "negative array size");
+        rb_raise(rb_eArgError, "negative array size");
     }
     if (last) {
-	offset = RARRAY_LEN(ary) - n;
+        offset = len - n;
     }
     return ary_make_partial(ary, rb_cArray, offset, n);
 }
 
-static VALUE rb_ary_push_1(VALUE ary, VALUE item);
-
 /*
  *  call-seq:
- *     ary << obj            -> ary
+ *    array << object -> self
  *
- *  Append---Pushes the given object on to the end of this array. This
- *  expression returns the array itself, so several appends
- *  may be chained together.
+ *  Appends +object+ to +self+; returns +self+:
  *
- *     [ 1, 2 ] << "c" << "d" << [ 3, 4 ]
- *             #=>  [ 1, 2, "c", "d", [ 3, 4 ] ]
+ *    a = [:foo, 'bar', 2]
+ *    a << :baz # => [:foo, "bar", 2, :baz]
+ *
+ *  Appends +object+ as one element, even if it is another \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a << [3, 4]
+ *    a1 # => [:foo, "bar", 2, [3, 4]]
  *
  */
 
 VALUE
 rb_ary_push(VALUE ary, VALUE item)
 {
-    rb_ary_modify(ary);
-    return rb_ary_push_1(ary, item);
-}
-
-static VALUE
-rb_ary_push_1(VALUE ary, VALUE item)
-{
-    long idx = RARRAY_LEN(ary);
-
-    if (idx >= ARY_CAPA(ary)) {
-	ary_double_capa(ary, idx);
-    }
-    RARRAY_PTR(ary)[idx] = item;
+    long idx = RARRAY_LEN((ary_verify(ary), ary));
+    VALUE target_ary = ary_ensure_room_for_push(ary, 1);
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        RB_OBJ_WRITE(target_ary, &ptr[idx], item);
+    });
     ARY_SET_LEN(ary, idx + 1);
+    ary_verify(ary);
     return ary;
 }
 
 VALUE
-rb_ary_cat(VALUE ary, const VALUE *ptr, long len)
+rb_ary_cat(VALUE ary, const VALUE *argv, long len)
 {
-    long oldlen;
-
-    rb_ary_modify(ary);
-    oldlen = RARRAY_LEN(ary);
-    ary_resize_capa(ary, oldlen + len);
-    MEMCPY(RARRAY_PTR(ary) + oldlen, ptr, VALUE, len);
+    long oldlen = RARRAY_LEN(ary);
+    VALUE target_ary = ary_ensure_room_for_push(ary, len);
+    ary_memcpy0(ary, oldlen, len, argv, target_ary);
     ARY_SET_LEN(ary, oldlen + len);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.push(obj, ... )   -> ary
+ *    array.push(*objects) -> self
  *
- *  Append---Pushes the given object(s) on to the end of this array. This
- *  expression returns the array itself, so several appends
- *  may be chained together.
+ *  Appends trailing elements.
  *
- *     a = [ "a", "b", "c" ]
- *     a.push("d", "e", "f")
- *             #=> ["a", "b", "c", "d", "e", "f"]
+ *  Appends each argument in +objects+ to +self+;  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.push(:baz, :bat) # => [:foo, "bar", 2, :baz, :bat]
+ *
+ *  Appends each argument as one element, even if it is another \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.push([:baz, :bat], [:bam, :bad])
+ *    a1 # => [:foo, "bar", 2, [:baz, :bat], [:bam, :bad]]
+ *
+ *  Array#append is an alias for Array#push.
+ *
+ *  Related: #pop, #shift, #unshift.
  */
 
 static VALUE
@@ -792,33 +1535,49 @@ rb_ary_pop(VALUE ary)
 {
     long n;
     rb_ary_modify_check(ary);
-    if (RARRAY_LEN(ary) == 0) return Qnil;
+    n = RARRAY_LEN(ary);
+    if (n == 0) return Qnil;
     if (ARY_OWNS_HEAP_P(ary) &&
-	RARRAY_LEN(ary) * 3 < ARY_CAPA(ary) &&
-	ARY_CAPA(ary) > ARY_DEFAULT_SIZE)
+        n * 3 < ARY_CAPA(ary) &&
+        ARY_CAPA(ary) > ARY_DEFAULT_SIZE)
     {
-	ary_resize_capa(ary, RARRAY_LEN(ary) * 2);
+        ary_resize_capa(ary, n * 2);
     }
-    n = RARRAY_LEN(ary)-1;
+    --n;
     ARY_SET_LEN(ary, n);
-    return RARRAY_PTR(ary)[n];
+    ary_verify(ary);
+    return RARRAY_AREF(ary, n);
 }
 
 /*
  *  call-seq:
- *     ary.pop    -> obj or nil
- *     ary.pop(n) -> new_ary
+ *    array.pop -> object or nil
+ *    array.pop(n) -> new_array
+ *
+ *  Removes and returns trailing elements.
+ *
+ *  When no argument is given and +self+ is not empty,
+ *  removes and returns the last element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.pop # => 2
+ *    a # => [:foo, "bar"]
+ *
+ *  Returns +nil+ if the array is empty.
  *
- *  Removes the last element from +self+ and returns it, or
- *  <code>nil</code> if the array is empty.
+ *  When a non-negative \Integer argument +n+ is given and is in range,
  *
- *  If a number +n+ is given, returns an array of the last n elements
- *  (or less) just like <code>array.slice!(-n, n)</code> does.
+ *  removes and returns the last +n+ elements in a new \Array:
+ *    a = [:foo, 'bar', 2]
+ *    a.pop(2) # => ["bar", 2]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.pop     #=> "d"
- *     a.pop(2)  #=> ["b", "c"]
- *     a         #=> ["a"]
+ *  If +n+ is positive and out of range,
+ *  removes and returns all elements:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.pop(50) # => [:foo, "bar", 2]
+ *
+ *  Related: #push, #shift, #unshift.
  */
 
 static VALUE
@@ -827,12 +1586,13 @@ rb_ary_pop_m(int argc, VALUE *argv, VALUE ary)
     VALUE result;
 
     if (argc == 0) {
-	return rb_ary_pop(ary);
+        return rb_ary_pop(ary);
     }
 
     rb_ary_modify_check(ary);
     result = ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST);
     ARY_INCREASE_LEN(ary, -RARRAY_LEN(result));
+    ary_verify(ary);
     return result;
 }
 
@@ -840,49 +1600,51 @@ VALUE
 rb_ary_shift(VALUE ary)
 {
     VALUE top;
+    long len = RARRAY_LEN(ary);
 
-    rb_ary_modify_check(ary);
-    if (RARRAY_LEN(ary) == 0) return Qnil;
-    top = RARRAY_PTR(ary)[0];
-    if (!ARY_SHARED_P(ary)) {
-	if (RARRAY_LEN(ary) < ARY_DEFAULT_SIZE) {
-	    MEMMOVE(RARRAY_PTR(ary), RARRAY_PTR(ary)+1, VALUE, RARRAY_LEN(ary)-1);
-            ARY_INCREASE_LEN(ary, -1);
-	    return top;
-	}
-        assert(!ARY_EMBED_P(ary)); /* ARY_EMBED_LEN_MAX < ARY_DEFAULT_SIZE */
-
-	RARRAY_PTR(ary)[0] = Qnil;
-	ary_make_shared(ary);
-    }
-    else if (ARY_SHARED_NUM(ARY_SHARED(ary)) == 1) {
-	RARRAY_PTR(ary)[0] = Qnil;
+    if (len == 0) {
+        rb_ary_modify_check(ary);
+        return Qnil;
     }
-    ARY_INCREASE_PTR(ary, 1);		/* shift ptr */
-    ARY_INCREASE_LEN(ary, -1);
+
+    top = RARRAY_AREF(ary, 0);
+
+    rb_ary_behead(ary, 1);
 
     return top;
 }
 
 /*
  *  call-seq:
- *     ary.shift    -> obj or nil
- *     ary.shift(n) -> new_ary
+ *     array.shift -> object or nil
+ *     array.shift(n) -> new_array
+ *
+ *  Removes and returns leading elements.
+ *
+ *  When no argument is given, removes and returns the first element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.shift # => :foo
+ *    a # => ['bar', 2]
+ *
+ *  Returns +nil+ if +self+ is empty.
+ *
+ *  When positive \Integer argument +n+ is given, removes the first +n+ elements;
+ *  returns those elements in a new \Array:
  *
- *  Returns the first element of +self+ and removes it (shifting all
- *  other elements down by one). Returns <code>nil</code> if the array
- *  is empty.
+ *    a = [:foo, 'bar', 2]
+ *    a.shift(2) # => [:foo, 'bar']
+ *    a # => [2]
  *
- *  If a number +n+ is given, returns an array of the first n elements
- *  (or less) just like <code>array.slice!(0, n)</code> does.
+ *  If +n+ is as large as or larger than <tt>self.length</tt>,
+ *  removes all elements; returns those elements in a new \Array:
  *
- *     args = [ "-m", "-q", "filename" ]
- *     args.shift     #=> "-m"
- *     args           #=> ["-q", "filename"]
+ *    a = [:foo, 'bar', 2]
+ *    a.shift(3) # => [:foo, 'bar', 2]
  *
- *     args = [ "-m", "-q", "filename" ]
- *     args.shift(2)  #=> ["-m", "-q"]
- *     args           #=> ["filename"]
+ *  If +n+ is zero, returns a new empty \Array; +self+ is unmodified.
+ *
+ *  Related: #push, #pop, #unshift.
  */
 
 static VALUE
@@ -892,54 +1654,163 @@ rb_ary_shift_m(int argc, VALUE *argv, VALUE ary)
     long n;
 
     if (argc == 0) {
-	return rb_ary_shift(ary);
+        return rb_ary_shift(ary);
     }
 
     rb_ary_modify_check(ary);
     result = ary_take_first_or_last(argc, argv, ary, ARY_TAKE_FIRST);
     n = RARRAY_LEN(result);
-    if (ARY_SHARED_P(ary)) {
-	if (ARY_SHARED_NUM(ARY_SHARED(ary)) == 1) {
-	    rb_mem_clear(RARRAY_PTR(ary), n);
-	}
-        ARY_INCREASE_PTR(ary, n);
+    rb_ary_behead(ary,n);
+
+    return result;
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_ary_behead(VALUE ary, long n)
+{
+    if (n <= 0) {
+        return ary;
     }
-    else {
-	MEMMOVE(RARRAY_PTR(ary), RARRAY_PTR(ary)+n, VALUE, RARRAY_LEN(ary)-n);
+
+    rb_ary_modify_check(ary);
+
+    if (!ARY_SHARED_P(ary)) {
+        if (ARY_EMBED_P(ary) || RARRAY_LEN(ary) < ARY_DEFAULT_SIZE) {
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+                MEMMOVE(ptr, ptr + n, VALUE, RARRAY_LEN(ary) - n);
+            }); /* WB: no new reference */
+            ARY_INCREASE_LEN(ary, -n);
+            ary_verify(ary);
+            return ary;
+        }
+
+        ary_mem_clear(ary, 0, n);
+        ary_make_shared(ary);
     }
+    else if (ARY_SHARED_ROOT_OCCUPIED(ARY_SHARED_ROOT(ary))) {
+        ary_mem_clear(ary, 0, n);
+    }
+
+    ARY_INCREASE_PTR(ary, n);
     ARY_INCREASE_LEN(ary, -n);
+    ary_verify(ary);
 
-    return result;
+    return ary;
+}
+
+static VALUE
+make_room_for_unshift(VALUE ary, const VALUE *head, VALUE *sharedp, int argc, long capa, long len)
+{
+    if (head - sharedp < argc) {
+        long room = capa - len - argc;
+
+        room -= room >> 4;
+        MEMMOVE((VALUE *)sharedp + argc + room, head, VALUE, len);
+        head = sharedp + argc + room;
+    }
+    ARY_SET_PTR(ary, head - argc);
+    assert(ARY_SHARED_ROOT_OCCUPIED(ARY_SHARED_ROOT(ary)));
+
+    ary_verify(ary);
+    return ARY_SHARED_ROOT(ary);
+}
+
+static VALUE
+ary_modify_for_unshift(VALUE ary, int argc)
+{
+    long len = RARRAY_LEN(ary);
+    long new_len = len + argc;
+    long capa;
+    const VALUE *head, *sharedp;
+
+    rb_ary_modify(ary);
+    capa = ARY_CAPA(ary);
+    if (capa - (capa >> 6) <= new_len) {
+        ary_double_capa(ary, new_len);
+    }
+
+    /* use shared array for big "queues" */
+    if (new_len > ARY_DEFAULT_SIZE * 4 && !ARY_EMBED_P(ary)) {
+        ary_verify(ary);
+
+        /* make a room for unshifted items */
+        capa = ARY_CAPA(ary);
+        ary_make_shared(ary);
+
+        head = sharedp = RARRAY_CONST_PTR_TRANSIENT(ary);
+        return make_room_for_unshift(ary, head, (void *)sharedp, argc, capa, len);
+    }
+    else {
+        /* sliding items */
+        RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+            MEMMOVE(ptr + argc, ptr, VALUE, len);
+        });
+
+        ary_verify(ary);
+        return ary;
+    }
+}
+
+static VALUE
+ary_ensure_room_for_unshift(VALUE ary, int argc)
+{
+    long len = RARRAY_LEN(ary);
+    long new_len = len + argc;
+
+    if (len > ARY_MAX_SIZE - argc) {
+        rb_raise(rb_eIndexError, "index %ld too big", new_len);
+    }
+    else if (! ARY_SHARED_P(ary)) {
+        return ary_modify_for_unshift(ary, argc);
+    }
+    else {
+        VALUE shared_root = ARY_SHARED_ROOT(ary);
+        long capa = RARRAY_LEN(shared_root);
+
+        if (! ARY_SHARED_ROOT_OCCUPIED(shared_root)) {
+            return ary_modify_for_unshift(ary, argc);
+        }
+        else if (new_len > capa) {
+            return ary_modify_for_unshift(ary, argc);
+        }
+        else {
+            const VALUE * head = RARRAY_CONST_PTR_TRANSIENT(ary);
+            void *sharedp = (void *)RARRAY_CONST_PTR_TRANSIENT(shared_root);
+
+            rb_ary_modify_check(ary);
+            return make_room_for_unshift(ary, head, sharedp, argc, capa, len);
+        }
+    }
 }
 
 /*
  *  call-seq:
- *     ary.unshift(obj, ...)  -> ary
+ *    array.unshift(*objects) -> self
  *
- *  Prepends objects to the front of +self+,
- *  moving other elements upwards.
+ *  Prepends the given +objects+ to +self+:
  *
- *     a = [ "b", "c", "d" ]
- *     a.unshift("a")   #=> ["a", "b", "c", "d"]
- *     a.unshift(1, 2)  #=> [ 1, 2, "a", "b", "c", "d"]
+ *    a = [:foo, 'bar', 2]
+ *    a.unshift(:bam, :bat) # => [:bam, :bat, :foo, "bar", 2]
+ *
+ *  Array#prepend is an alias for Array#unshift.
+ *
+ *  Related: #push, #pop, #shift.
  */
 
 static VALUE
 rb_ary_unshift_m(int argc, VALUE *argv, VALUE ary)
 {
-    long len;
+    long len = RARRAY_LEN(ary);
+    VALUE target_ary;
 
-    rb_ary_modify(ary);
-    if (argc == 0) return ary;
-    if (ARY_CAPA(ary) <= (len = RARRAY_LEN(ary)) + argc) {
-	ary_double_capa(ary, len + argc);
+    if (argc == 0) {
+        rb_ary_modify_check(ary);
+        return ary;
     }
 
-    /* sliding items */
-    MEMMOVE(RARRAY_PTR(ary) + argc, RARRAY_PTR(ary), VALUE, len);
-    MEMCPY(RARRAY_PTR(ary), argv, VALUE, argc);
-    ARY_INCREASE_LEN(ary, argc);
-
+    target_ary = ary_ensure_room_for_unshift(ary, argc);
+    ary_memcpy0(ary, 0, argc, argv, target_ary);
+    ARY_SET_LEN(ary, len + argc);
     return ary;
 }
 
@@ -953,119 +1824,210 @@ rb_ary_unshift(VALUE ary, VALUE item)
 static inline VALUE
 rb_ary_elt(VALUE ary, long offset)
 {
-    if (RARRAY_LEN(ary) == 0) return Qnil;
-    if (offset < 0 || RARRAY_LEN(ary) <= offset) {
-	return Qnil;
+    long len = RARRAY_LEN(ary);
+    if (len == 0) return Qnil;
+    if (offset < 0 || len <= offset) {
+        return Qnil;
     }
-    return RARRAY_PTR(ary)[offset];
+    return RARRAY_AREF(ary, offset);
 }
 
 VALUE
 rb_ary_entry(VALUE ary, long offset)
 {
-    if (offset < 0) {
-	offset += RARRAY_LEN(ary);
-    }
-    return rb_ary_elt(ary, offset);
+    return rb_ary_entry_internal(ary, offset);
 }
 
 VALUE
-rb_ary_subseq(VALUE ary, long beg, long len)
+rb_ary_subseq_step(VALUE ary, long beg, long len, long step)
 {
     VALUE klass;
+    long alen = RARRAY_LEN(ary);
 
-    if (beg > RARRAY_LEN(ary)) return Qnil;
+    if (beg > alen) return Qnil;
     if (beg < 0 || len < 0) return Qnil;
 
-    if (RARRAY_LEN(ary) < len || RARRAY_LEN(ary) < beg + len) {
-	len = RARRAY_LEN(ary) - beg;
+    if (alen < len || alen < beg + len) {
+        len = alen - beg;
     }
-    klass = rb_obj_class(ary);
+    klass = rb_cArray;
     if (len == 0) return ary_new(klass, 0);
+    if (step == 0)
+        rb_raise(rb_eArgError, "slice step cannot be zero");
+    if (step == 1)
+        return ary_make_partial(ary, klass, beg, len);
+    else
+        return ary_make_partial_step(ary, klass, beg, len, step);
+}
 
-    return ary_make_partial(ary, klass, beg, len);
+VALUE
+rb_ary_subseq(VALUE ary, long beg, long len)
+{
+    return rb_ary_subseq_step(ary, beg, len, 1);
 }
 
+static VALUE rb_ary_aref2(VALUE ary, VALUE b, VALUE e);
+
 /*
  *  call-seq:
- *     ary[index]                -> obj     or nil
- *     ary[start, length]        -> new_ary or nil
- *     ary[range]                -> new_ary or nil
- *     ary.slice(index)          -> obj     or nil
- *     ary.slice(start, length)  -> new_ary or nil
- *     ary.slice(range)          -> new_ary or nil
- *
- *  Element Reference---Returns the element at +index+,
- *  or returns a subarray starting at +start+ and
- *  continuing for +length+ elements, or returns a subarray
- *  specified by +range+.
- *  Negative indices count backward from the end of the
- *  array (-1 is the last element). Returns +nil+ if the index
- *  (or starting index) are out of range.
- *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a[2] +  a[0] + a[1]    #=> "cab"
- *     a[6]                   #=> nil
- *     a[1, 2]                #=> [ "b", "c" ]
- *     a[1..3]                #=> [ "b", "c", "d" ]
- *     a[4..7]                #=> [ "e" ]
- *     a[6..10]               #=> nil
- *     a[-3, 3]               #=> [ "c", "d", "e" ]
- *     # special cases
- *     a[5]                   #=> nil
- *     a[5, 1]                #=> []
- *     a[5..10]               #=> []
+ *    array[index] -> object or nil
+ *    array[start, length] -> object or nil
+ *    array[range] -> object or nil
+ *    array[aseq] -> object or nil
+ *    array.slice(index) -> object or nil
+ *    array.slice(start, length) -> object or nil
+ *    array.slice(range) -> object or nil
+ *    array.slice(aseq) -> object or nil
  *
+ *  Returns elements from +self+; does not modify +self+.
+ *
+ *  When a single \Integer argument +index+ is given, returns the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0] # => :foo
+ *    a[2] # => 2
+ *    a # => [:foo, "bar", 2]
+ *
+ *  If +index+ is negative, counts relative to the end of +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-1] # => 2
+ *    a[-2] # => "bar"
+ *
+ *  If +index+ is out of range, returns +nil+.
+ *
+ *  When two \Integer arguments +start+ and +length+ are given,
+ *  returns a new \Array of size +length+ containing successive elements beginning at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 2] # => [:foo, "bar"]
+ *    a[1, 2] # => ["bar", 2]
+ *
+ *  If <tt>start + length</tt> is greater than <tt>self.length</tt>,
+ *  returns all elements from offset +start+ to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 4] # => [:foo, "bar", 2]
+ *    a[1, 3] # => ["bar", 2]
+ *    a[2, 2] # => [2]
+ *
+ *  If <tt>start == self.size</tt> and <tt>length >= 0</tt>,
+ *  returns a new empty \Array.
+ *
+ *  If +length+ is negative, returns +nil+.
+ *
+ *  When a single \Range argument +range+ is given,
+ *  treats <tt>range.min</tt> as +start+ above
+ *  and <tt>range.size</tt> as +length+ above:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0..1] # => [:foo, "bar"]
+ *    a[1..2] # => ["bar", 2]
+ *
+ *  Special case: If <tt>range.start == a.size</tt>, returns a new empty \Array.
+ *
+ *  If <tt>range.end</tt> is negative, calculates the end index from the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0..-1] # => [:foo, "bar", 2]
+ *    a[0..-2] # => [:foo, "bar"]
+ *    a[0..-3] # => [:foo]
+ *
+ *  If <tt>range.start</tt> is negative, calculates the start index from the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-1..2] # => [2]
+ *    a[-2..2] # => ["bar", 2]
+ *    a[-3..2] # => [:foo, "bar", 2]
+ *
+ *  If <tt>range.start</tt> is larger than the array size, returns +nil+.
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[4..1] # => nil
+ *    a[4..0] # => nil
+ *    a[4..-1] # => nil
+ *
+ *  When a single Enumerator::ArithmeticSequence argument +aseq+ is given,
+ *  returns an \Array of elements corresponding to the indexes produced by
+ *  the sequence.
+ *
+ *    a = ['--', 'data1', '--', 'data2', '--', 'data3']
+ *    a[(1..).step(2)] # => ["data1", "data2", "data3"]
+ *
+ *  Unlike slicing with range, if the start or the end of the arithmetic sequence
+ *  is larger than array size, throws RangeError.
+ *
+ *    a = ['--', 'data1', '--', 'data2', '--', 'data3']
+ *    a[(1..11).step(2)]
+ *    # RangeError (((1..11).step(2)) out of range)
+ *    a[(7..).step(2)]
+ *    # RangeError (((7..).step(2)) out of range)
+ *
+ *  If given a single argument, and its type is not one of the listed, tries to
+ *  convert it to Integer, and raises if it is impossible:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    # Raises TypeError (no implicit conversion of Symbol into Integer):
+ *    a[:foo]
+ *
+ *  Array#slice is an alias for Array#[].
  */
 
 VALUE
-rb_ary_aref(int argc, VALUE *argv, VALUE ary)
+rb_ary_aref(int argc, const VALUE *argv, VALUE ary)
 {
-    VALUE arg;
-    long beg, len;
-
+    rb_check_arity(argc, 1, 2);
     if (argc == 2) {
-	beg = NUM2LONG(argv[0]);
-	len = NUM2LONG(argv[1]);
-	if (beg < 0) {
-	    beg += RARRAY_LEN(ary);
-	}
-	return rb_ary_subseq(ary, beg, len);
+        return rb_ary_aref2(ary, argv[0], argv[1]);
     }
-    if (argc != 1) {
-	rb_scan_args(argc, argv, "11", 0, 0);
+    return rb_ary_aref1(ary, argv[0]);
+}
+
+static VALUE
+rb_ary_aref2(VALUE ary, VALUE b, VALUE e)
+{
+    long beg = NUM2LONG(b);
+    long len = NUM2LONG(e);
+    if (beg < 0) {
+        beg += RARRAY_LEN(ary);
     }
-    arg = argv[0];
+    return rb_ary_subseq(ary, beg, len);
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_ary_aref1(VALUE ary, VALUE arg)
+{
+    long beg, len, step;
+
     /* special case - speeding up */
     if (FIXNUM_P(arg)) {
-	return rb_ary_entry(ary, FIX2LONG(arg));
+        return rb_ary_entry(ary, FIX2LONG(arg));
     }
-    /* check if idx is Range */
-    switch (rb_range_beg_len(arg, &beg, &len, RARRAY_LEN(ary), 0)) {
+    /* check if idx is Range or ArithmeticSequence */
+    switch (rb_arithmetic_sequence_beg_len_step(arg, &beg, &len, &step, RARRAY_LEN(ary), 0)) {
       case Qfalse:
-	break;
+        break;
       case Qnil:
-	return Qnil;
+        return Qnil;
       default:
-	return rb_ary_subseq(ary, beg, len);
+        return rb_ary_subseq_step(ary, beg, len, step);
     }
+
     return rb_ary_entry(ary, NUM2LONG(arg));
 }
 
 /*
  *  call-seq:
- *     ary.at(index)   ->   obj  or nil
+ *    array.at(index) -> object
  *
- *  Returns the element at +index+. A
- *  negative index counts from the end of +self+.  Returns +nil+
- *  if the index is out of range. See also <code>Array#[]</code>.
+ *  Returns the element at \Integer offset +index+; does not modify +self+.
+ *    a = [:foo, 'bar', 2]
+ *    a.at(0) # => :foo
+ *    a.at(2) # => 2
  *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a.at(0)     #=> "a"
- *     a.at(-1)    #=> "e"
  */
 
-static VALUE
+VALUE
 rb_ary_at(VALUE ary, VALUE pos)
 {
     return rb_ary_entry(ary, NUM2LONG(pos));
@@ -1073,80 +2035,131 @@ rb_ary_at(VALUE ary, VALUE pos)
 
 /*
  *  call-seq:
- *     ary.first     ->   obj or nil
- *     ary.first(n)  ->   new_ary
+ *    array.first -> object or nil
+ *    array.first(n) -> new_array
+ *
+ *  Returns elements from +self+; does not modify +self+.
+ *
+ *  When no argument is given, returns the first element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.first # => :foo
+ *    a # => [:foo, "bar", 2]
+ *
+ *  If +self+ is empty, returns +nil+.
+ *
+ *  When non-negative \Integer argument +n+ is given,
+ *  returns the first +n+ elements in a new \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.first(2) # => [:foo, "bar"]
+ *
+ *  If <tt>n >= array.size</tt>, returns all elements:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.first(50) # => [:foo, "bar", 2]
+ *
+ *  If <tt>n == 0</tt> returns an new empty \Array:
  *
- *  Returns the first element, or the first +n+ elements, of the array.
- *  If the array is empty, the first form returns <code>nil</code>, and the
- *  second form returns an empty array.
+ *    a = [:foo, 'bar', 2]
+ *    a.first(0) # []
  *
- *     a = [ "q", "r", "s", "t" ]
- *     a.first     #=> "q"
- *     a.first(2)  #=> ["q", "r"]
+ *  Related: #last.
  */
-
 static VALUE
 rb_ary_first(int argc, VALUE *argv, VALUE ary)
 {
     if (argc == 0) {
-	if (RARRAY_LEN(ary) == 0) return Qnil;
-	return RARRAY_PTR(ary)[0];
+        if (RARRAY_LEN(ary) == 0) return Qnil;
+        return RARRAY_AREF(ary, 0);
     }
     else {
-	return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_FIRST);
+        return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_FIRST);
     }
 }
 
 /*
  *  call-seq:
- *     ary.last     ->  obj or nil
- *     ary.last(n)  ->  new_ary
+ *    array.last  -> object or nil
+ *    array.last(n) -> new_array
+ *
+ *  Returns elements from +self+; +self+ is not modified.
+ *
+ *  When no argument is given, returns the last element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.last # => 2
+ *    a # => [:foo, "bar", 2]
+ *
+ *  If +self+ is empty, returns +nil+.
+ *
+ *  When non-negative \Integer argument +n+ is given,
+ *  returns the last +n+ elements in a new \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.last(2) # => ["bar", 2]
+ *
+ *  If <tt>n >= array.size</tt>, returns all elements:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.last(50) # => [:foo, "bar", 2]
  *
- *  Returns the last element(s) of +self+. If the array is empty,
- *  the first form returns <code>nil</code>.
+ *  If <tt>n == 0</tt>, returns an new empty \Array:
  *
- *     a = [ "w", "x", "y", "z" ]
- *     a.last     #=> "z"
- *     a.last(2)  #=> ["y", "z"]
+ *    a = [:foo, 'bar', 2]
+ *    a.last(0) # []
+ *
+ *  Related: #first.
  */
 
 VALUE
-rb_ary_last(int argc, VALUE *argv, VALUE ary)
+rb_ary_last(int argc, const VALUE *argv, VALUE ary)
 {
     if (argc == 0) {
-	if (RARRAY_LEN(ary) == 0) return Qnil;
-	return RARRAY_PTR(ary)[RARRAY_LEN(ary)-1];
+        long len = RARRAY_LEN(ary);
+        if (len == 0) return Qnil;
+        return RARRAY_AREF(ary, len-1);
     }
     else {
-	return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST);
+        return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST);
     }
 }
 
 /*
  *  call-seq:
- *     ary.fetch(index)                    -> obj
- *     ary.fetch(index, default )          -> obj
- *     ary.fetch(index) {|index| block }   -> obj
- *
- *  Tries to return the element at position +index+. If the index lies outside
- *  the array, the first form throws an IndexError exception, the second form
- *  returns +default+, and the third form returns the value of invoking the
- *  block, passing in the index. Negative values of +index+ count from the end
- *  of the array.
- *
- *  Tries to return the element at position +index+, but throws an IndexError
- *  exception if the referenced index lies outside of the array bounds.  This
- *  error can be prevented by supplying a second argument, which will act as a
- *  +default+ value.  Alternatively, if the second argument is a block it will
- *  only be executed when an invalid index is referenced.  Negative values of
- *  +index+ count from the end of the array.
- *
- *     a = [ 11, 22, 33, 44 ]
- *     a.fetch(1)               #=> 22
- *     a.fetch(-1)              #=> 44
- *     a.fetch(4, 'cat')        #=> "cat"
- *     a.fetch(100) { |i| puts "#{i} is out of bounds" }
- *                              #=> "100 is out of bounds"
+ *    array.fetch(index) -> element
+ *    array.fetch(index, default_value) -> element
+ *    array.fetch(index) {|index| ... } -> element
+ *
+ *  Returns the element at offset  +index+.
+ *
+ *  With the single \Integer argument +index+,
+ *  returns the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1) # => "bar"
+ *
+ *  If +index+ is negative, counts from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(-1) # => 2
+ *    a.fetch(-2) # => "bar"
+ *
+ *  With arguments +index+ and +default_value+,
+ *  returns the element at offset +index+ if index is in range,
+ *  otherwise returns +default_value+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1, nil) # => "bar"
+ *
+ *  With argument +index+ and a block,
+ *  returns the element at offset +index+ if index is in range
+ *  (and the block is not called); otherwise calls the block with index and returns its return value:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1) {|index| raise 'Cannot happen' } # => "bar"
+ *    a.fetch(50) {|index| "Value for #{index}" } # => "Value for 50"
+ *
  */
 
 static VALUE
@@ -1159,44 +2172,60 @@ rb_ary_fetch(int argc, VALUE *argv, VALUE ary)
     rb_scan_args(argc, argv, "11", &pos, &ifnone);
     block_given = rb_block_given_p();
     if (block_given && argc == 2) {
-	rb_warn("block supersedes default value argument");
+        rb_warn("block supersedes default value argument");
     }
     idx = NUM2LONG(pos);
 
     if (idx < 0) {
-	idx +=  RARRAY_LEN(ary);
+        idx +=  RARRAY_LEN(ary);
     }
     if (idx < 0 || RARRAY_LEN(ary) <= idx) {
-	if (block_given) return rb_yield(pos);
-	if (argc == 1) {
-	    rb_raise(rb_eIndexError, "index %ld outside of array bounds: %ld...%ld",
-			idx - (idx < 0 ? RARRAY_LEN(ary) : 0), -RARRAY_LEN(ary), RARRAY_LEN(ary));
-	}
-	return ifnone;
+        if (block_given) return rb_yield(pos);
+        if (argc == 1) {
+            rb_raise(rb_eIndexError, "index %ld outside of array bounds: %ld...%ld",
+                        idx - (idx < 0 ? RARRAY_LEN(ary) : 0), -RARRAY_LEN(ary), RARRAY_LEN(ary));
+        }
+        return ifnone;
     }
-    return RARRAY_PTR(ary)[idx];
+    return RARRAY_AREF(ary, idx);
 }
 
 /*
  *  call-seq:
- *     ary.index(obj)           ->  int or nil
- *     ary.index {|item| block} ->  int or nil
- *     ary.index                ->  an_enumerator
+ *    array.index(object) -> integer or nil
+ *    array.index {|element| ... } -> integer or nil
+ *    array.index -> new_enumerator
+ *
+ *  Returns the index of a specified element.
+ *
+ *  When argument +object+ is given but no block,
+ *  returns the index of the first element +element+
+ *  for which <tt>object == element</tt>:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.index('bar') # => 1
+ *
+ *  Returns +nil+ if no such element found.
  *
- *  Returns the index of the first object in +self+ such that the object is
- *  <code>==</code> to +obj+. If a block is given instead of an
- *  argument, returns index of first object for which <em>block</em> is true.
- *  Returns <code>nil</code> if no match is found.
- *  See also <code>Array#rindex</code>.
+ *  When both argument +object+ and a block are given,
+ *  calls the block with each successive element;
+ *  returns the index of the first element for which the block returns a truthy value:
  *
- *  If neither block nor argument is given, an enumerator is returned instead.
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.index {|element| element == 'bar' } # => 1
  *
- *     a = [ "a", "b", "c" ]
- *     a.index("b")        #=> 1
- *     a.index("z")        #=> nil
- *     a.index{|x|x=="b"}  #=> 1
+ *  Returns +nil+ if the block never returns a truthy value.
  *
- *  This is an alias of <code>#find_index</code>.
+ *  When neither an argument nor a block is given, returns a new Enumerator:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    e = a.index
+ *    e # => #<Enumerator: [:foo, "bar", 2]:index>
+ *    e.each {|element| element == 'bar' } # => 1
+ *
+ *  Array#find_index is an alias for Array#index.
+ *
+ *  Related: #rindex.
  */
 
 static VALUE
@@ -1206,71 +2235,89 @@ rb_ary_index(int argc, VALUE *argv, VALUE ary)
     long i;
 
     if (argc == 0) {
-	RETURN_ENUMERATOR(ary, 0, 0);
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    if (RTEST(rb_yield(RARRAY_PTR(ary)[i]))) {
-		return LONG2NUM(i);
-	    }
-	}
-	return Qnil;
-    }
-    rb_scan_args(argc, argv, "1", &val);
+        RETURN_ENUMERATOR(ary, 0, 0);
+        for (i=0; i<RARRAY_LEN(ary); i++) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
+                return LONG2NUM(i);
+            }
+        }
+        return Qnil;
+    }
+    rb_check_arity(argc, 0, 1);
+    val = argv[0];
     if (rb_block_given_p())
-	rb_warn("given block not used");
+        rb_warn("given block not used");
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	if (rb_equal(RARRAY_PTR(ary)[i], val))
-	    return LONG2NUM(i);
+        VALUE e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, val)) {
+            return LONG2NUM(i);
+        }
     }
     return Qnil;
 }
 
 /*
  *  call-seq:
- *     ary.rindex(obj)           ->  int or nil
- *     ary.rindex {|item| block} ->  int or nil
- *     ary.rindex                ->  an_enumerator
- *
- *  Returns the index of the last object in +self+
- *  <code>==</code> to +obj+. If a block is given instead of an
- *  argument, returns index of first object for which <em>block</em> is
- *  true, starting from the last object.
- *  Returns <code>nil</code> if no match is found.
- *  See also Array#index.
- *
- *  If neither block nor argument is given, an enumerator is returned instead.
- *
- *     a = [ "a", "b", "b", "b", "c" ]
- *     a.rindex("b")             #=> 3
- *     a.rindex("z")             #=> nil
- *     a.rindex { |x| x == "b" } #=> 3
+ *    array.rindex(object) -> integer or nil
+ *    array.rindex {|element| ... } -> integer or nil
+ *    array.rindex -> new_enumerator
+ *
+ *  Returns the index of the last element for which <tt>object == element</tt>.
+ *
+ *  When argument +object+ is given but no block, returns the index of the last such element found:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rindex('bar') # => 3
+ *
+ *  Returns +nil+ if no such object found.
+ *
+ *  When a block is given but no argument, calls the block with each successive element;
+ *  returns the index of the last element for which the block returns a truthy value:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rindex {|element| element == 'bar' } # => 3
+ *
+ *  Returns +nil+ if the block never returns a truthy value.
+ *
+ *  When neither an argument nor a block is given, returns a new \Enumerator:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    e = a.rindex
+ *    e # => #<Enumerator: [:foo, "bar", 2, "bar"]:rindex>
+ *    e.each {|element| element == 'bar' } # => 3
+ *
+ *  Related: #index.
  */
 
 static VALUE
 rb_ary_rindex(int argc, VALUE *argv, VALUE ary)
 {
     VALUE val;
-    long i = RARRAY_LEN(ary);
+    long i = RARRAY_LEN(ary), len;
 
     if (argc == 0) {
-	RETURN_ENUMERATOR(ary, 0, 0);
-	while (i--) {
-	    if (RTEST(rb_yield(RARRAY_PTR(ary)[i])))
-		return LONG2NUM(i);
-	    if (i > RARRAY_LEN(ary)) {
-		i = RARRAY_LEN(ary);
-	    }
-	}
-	return Qnil;
-    }
-    rb_scan_args(argc, argv, "1", &val);
+        RETURN_ENUMERATOR(ary, 0, 0);
+        while (i--) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i))))
+                return LONG2NUM(i);
+            if (i > (len = RARRAY_LEN(ary))) {
+                i = len;
+            }
+        }
+        return Qnil;
+    }
+    rb_check_arity(argc, 0, 1);
+    val = argv[0];
     if (rb_block_given_p())
-	rb_warn("given block not used");
+        rb_warn("given block not used");
     while (i--) {
-	if (rb_equal(RARRAY_PTR(ary)[i], val))
-	    return LONG2NUM(i);
-	if (i > RARRAY_LEN(ary)) {
-	    i = RARRAY_LEN(ary);
-	}
+        VALUE e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, val)) {
+            return LONG2NUM(i);
+        }
+        if (i > RARRAY_LEN(ary)) {
+            break;
+        }
     }
     return Qnil;
 }
@@ -1285,60 +2332,72 @@ rb_ary_to_ary(VALUE obj)
 }
 
 static void
-rb_ary_splice(VALUE ary, long beg, long len, VALUE rpl)
+rb_ary_splice(VALUE ary, long beg, long len, const VALUE *rptr, long rlen)
 {
-    long rlen;
+    long olen;
+    long rofs;
 
     if (len < 0) rb_raise(rb_eIndexError, "negative length (%ld)", len);
+    olen = RARRAY_LEN(ary);
     if (beg < 0) {
-	beg += RARRAY_LEN(ary);
-	if (beg < 0) {
-	    rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
-		     beg - RARRAY_LEN(ary), -RARRAY_LEN(ary));
-	}
+        beg += olen;
+        if (beg < 0) {
+            rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
+                     beg - olen, -olen);
+        }
     }
-    if (RARRAY_LEN(ary) < len || RARRAY_LEN(ary) < beg + len) {
-	len = RARRAY_LEN(ary) - beg;
+    if (olen < len || olen < beg + len) {
+        len = olen - beg;
     }
 
-    if (rpl == Qundef) {
-	rlen = 0;
-    }
-    else {
-	rpl = rb_ary_to_ary(rpl);
-	rlen = RARRAY_LEN(rpl);
+    {
+        const VALUE *optr = RARRAY_CONST_PTR_TRANSIENT(ary);
+        rofs = (rptr >= optr && rptr < optr + olen) ? rptr - optr : -1;
     }
-    rb_ary_modify(ary);
-    if (beg >= RARRAY_LEN(ary)) {
-	if (beg > ARY_MAX_SIZE - rlen) {
-	    rb_raise(rb_eIndexError, "index %ld too big", beg);
-	}
-	len = beg + rlen;
-	if (len >= ARY_CAPA(ary)) {
-	    ary_double_capa(ary, len);
-	}
-	rb_mem_clear(RARRAY_PTR(ary) + RARRAY_LEN(ary), beg - RARRAY_LEN(ary));
-	if (rlen > 0) {
-	    MEMCPY(RARRAY_PTR(ary) + beg, RARRAY_PTR(rpl), VALUE, rlen);
-	}
-	ARY_SET_LEN(ary, len);
+
+    if (beg >= olen) {
+        VALUE target_ary;
+        if (beg > ARY_MAX_SIZE - rlen) {
+            rb_raise(rb_eIndexError, "index %ld too big", beg);
+        }
+        target_ary = ary_ensure_room_for_push(ary, rlen-len); /* len is 0 or negative */
+        len = beg + rlen;
+        ary_mem_clear(ary, olen, beg - olen);
+        if (rlen > 0) {
+            if (rofs != -1) rptr = RARRAY_CONST_PTR_TRANSIENT(ary) + rofs;
+            ary_memcpy0(ary, beg, rlen, rptr, target_ary);
+        }
+        ARY_SET_LEN(ary, len);
     }
     else {
-	long alen;
+        long alen;
 
-	alen = RARRAY_LEN(ary) + rlen - len;
-	if (alen >= ARY_CAPA(ary)) {
-	    ary_double_capa(ary, alen);
-	}
+        if (olen - len > ARY_MAX_SIZE - rlen) {
+            rb_raise(rb_eIndexError, "index %ld too big", olen + rlen - len);
+        }
+        rb_ary_modify(ary);
+        alen = olen + rlen - len;
+        if (alen >= ARY_CAPA(ary)) {
+            ary_double_capa(ary, alen);
+        }
 
-	if (len != rlen) {
-	    MEMMOVE(RARRAY_PTR(ary) + beg + rlen, RARRAY_PTR(ary) + beg + len,
-		    VALUE, RARRAY_LEN(ary) - (beg + len));
-	    ARY_SET_LEN(ary, alen);
-	}
-	if (rlen > 0) {
-	    MEMMOVE(RARRAY_PTR(ary) + beg, RARRAY_PTR(rpl), VALUE, rlen);
-	}
+        if (len != rlen) {
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr,
+                                     MEMMOVE(ptr + beg + rlen, ptr + beg + len,
+                                             VALUE, olen - (beg + len)));
+            ARY_SET_LEN(ary, alen);
+        }
+        if (rlen > 0) {
+            if (rofs != -1) rptr = RARRAY_CONST_PTR_TRANSIENT(ary) + rofs;
+            /* give up wb-protected ary */
+            RB_OBJ_WB_UNPROTECT_FOR(ARRAY, ary);
+
+            /* do not use RARRAY_PTR() because it can causes GC.
+             * ary can contain T_NONE object because it is not cleared.
+             */
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr,
+                                     MEMMOVE(ptr + beg, rptr, VALUE, rlen));
+        }
     }
 }
 
@@ -1349,22 +2408,14 @@ rb_ary_set_len(VALUE ary, long len)
 
     rb_ary_modify_check(ary);
     if (ARY_SHARED_P(ary)) {
-	rb_raise(rb_eRuntimeError, "can't set length of shared ");
+        rb_raise(rb_eRuntimeError, "can't set length of shared ");
     }
     if (len > (capa = (long)ARY_CAPA(ary))) {
-	rb_bug("probable buffer overflow: %ld for %ld", len, capa);
+        rb_bug("probable buffer overflow: %ld for %ld", len, capa);
     }
     ARY_SET_LEN(ary, len);
 }
 
-/*!
- * expands or shrinks \a ary to \a len elements.
- * expanded region will be filled with Qnil.
- * \param ary  an array
- * \param len  new size
- * \return     \a ary
- * \post       the size of \a ary is \a len.
- */
 VALUE
 rb_ary_resize(VALUE ary, long len)
 {
@@ -1374,61 +2425,170 @@ rb_ary_resize(VALUE ary, long len)
     olen = RARRAY_LEN(ary);
     if (len == olen) return ary;
     if (len > ARY_MAX_SIZE) {
-	rb_raise(rb_eIndexError, "index %ld too big", len);
+        rb_raise(rb_eIndexError, "index %ld too big", len);
     }
     if (len > olen) {
-	if (len >= ARY_CAPA(ary)) {
-	    ary_double_capa(ary, len);
-	}
-	rb_mem_clear(RARRAY_PTR(ary) + olen, len - olen);
+        if (len >= ARY_CAPA(ary)) {
+            ary_double_capa(ary, len);
+        }
+        ary_mem_clear(ary, olen, len - olen);
         ARY_SET_LEN(ary, len);
     }
     else if (ARY_EMBED_P(ary)) {
         ARY_SET_EMBED_LEN(ary, len);
     }
-    else if (len <= RARRAY_EMBED_LEN_MAX) {
-	VALUE tmp[RARRAY_EMBED_LEN_MAX];
-	MEMCPY(tmp, ARY_HEAP_PTR(ary), VALUE, len);
-	ary_discard(ary);
-	MEMCPY(ARY_EMBED_PTR(ary), tmp, VALUE, len);
+    else if (len <= ary_embed_capa(ary)) {
+        const VALUE *ptr = ARY_HEAP_PTR(ary);
+        long ptr_capa = ARY_HEAP_SIZE(ary);
+        bool is_malloc_ptr = !ARY_SHARED_P(ary) && !RARRAY_TRANSIENT_P(ary);
+
+        FL_UNSET(ary, RARRAY_TRANSIENT_FLAG);
+        FL_SET_EMBED(ary);
+
+        MEMCPY((VALUE *)ARY_EMBED_PTR(ary), ptr, VALUE, len); /* WB: no new reference */
         ARY_SET_EMBED_LEN(ary, len);
+
+        if (is_malloc_ptr) ruby_sized_xfree((void *)ptr, ptr_capa);
     }
     else {
-	if (olen > len + ARY_DEFAULT_SIZE) {
-	    REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, len);
-	    ARY_SET_CAPA(ary, len);
-	}
-	ARY_SET_HEAP_LEN(ary, len);
+        if (olen > len + ARY_DEFAULT_SIZE) {
+            size_t new_capa = ary_heap_realloc(ary, len);
+            ARY_SET_CAPA(ary, new_capa);
+        }
+        ARY_SET_HEAP_LEN(ary, len);
     }
+    ary_verify(ary);
     return ary;
 }
 
+static VALUE
+ary_aset_by_rb_ary_store(VALUE ary, long key, VALUE val)
+{
+    rb_ary_store(ary, key, val);
+    return val;
+}
+
+static VALUE
+ary_aset_by_rb_ary_splice(VALUE ary, long beg, long len, VALUE val)
+{
+    VALUE rpl = rb_ary_to_ary(val);
+    rb_ary_splice(ary, beg, len, RARRAY_CONST_PTR_TRANSIENT(rpl), RARRAY_LEN(rpl));
+    RB_GC_GUARD(rpl);
+    return val;
+}
+
 /*
  *  call-seq:
- *     ary[index]         = obj                      ->  obj
- *     ary[start, length] = obj or other_ary or nil  ->  obj or other_ary or nil
- *     ary[range]         = obj or other_ary or nil  ->  obj or other_ary or nil
- *
- *  Element Assignment---Sets the element at +index+,
- *  or replaces a subarray starting at +start+ and
- *  continuing for +length+ elements, or replaces a subarray
- *  specified by +range+.  If indices are greater than
- *  the current capacity of the array, the array grows
- *  automatically. A negative indices will count backward
- *  from the end of the array. Inserts elements if +length+ is
- *  zero. An IndexError is raised if a negative index points
- *  past the beginning of the array. See also
- *  Array#push, and Array#unshift.
- *
- *     a = Array.new
- *     a[4] = "4";                 #=> [nil, nil, nil, nil, "4"]
- *     a[0, 3] = [ 'a', 'b', 'c' ] #=> ["a", "b", "c", nil, "4"]
- *     a[1..2] = [ 1, 2 ]          #=> ["a", 1, 2, nil, "4"]
- *     a[0, 2] = "?"               #=> ["?", 2, nil, "4"]
- *     a[0..2] = "A"               #=> ["A", "4"]
- *     a[-1]   = "Z"               #=> ["A", "Z"]
- *     a[1..-1] = nil              #=> ["A", nil]
- *     a[1..-1] = []               #=> ["A"]
+ *    array[index] = object -> object
+ *    array[start, length] = object -> object
+ *    array[range] = object -> object
+ *
+ *  Assigns elements in +self+; returns the given +object+.
+ *
+ *  When \Integer argument +index+ is given, assigns +object+ to an element in +self+.
+ *
+ *  If +index+ is non-negative, assigns +object+ the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0] = 'foo' # => "foo"
+ *    a # => ["foo", "bar", 2]
+ *
+ *  If +index+ is greater than <tt>self.length</tt>, extends the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[7] = 'foo' # => "foo"
+ *    a # => [:foo, "bar", 2, nil, nil, nil, nil, "foo"]
+ *
+ *  If +index+ is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-1] = 'two' # => "two"
+ *    a # => [:foo, "bar", "two"]
+ *
+ *  When \Integer arguments +start+ and +length+ are given and +object+ is not an \Array,
+ *  removes <tt>length - 1</tt> elements beginning at offset +start+,
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 2] = 'foo' # => "foo"
+ *    a # => ["foo", 2]
+ *
+ *  If +start+ is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-2, 2] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
+ *  If +start+ is non-negative and outside the array (<tt> >= self.size</tt>),
+ *  extends the array with +nil+, assigns +object+ at offset +start+,
+ *  and ignores +length+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[6, 50] = 'foo' # => "foo"
+ *    a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
+ *
+ *  If +length+ is zero, shifts elements at and following offset +start+
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1, 0] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", "bar", 2]
+ *
+ *  If +length+ is too large for the existing array, does not extend the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1, 5] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
+ *  When \Range argument +range+ is given and +object+ is an \Array,
+ *  removes <tt>length - 1</tt> elements beginning at offset +start+,
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0..1] = 'foo' # => "foo"
+ *    a # => ["foo", 2]
+ *
+ *  if <tt>range.begin</tt> is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[-2..2] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
+ *  If the array length is less than <tt>range.begin</tt>,
+ *  assigns +object+ at offset <tt>range.begin</tt>, and ignores +length+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[6..50] = 'foo' # => "foo"
+ *    a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
+ *
+ *  If <tt>range.end</tt> is zero, shifts elements at and following offset +start+
+ *  and assigns +object+ at offset +start+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1..0] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", "bar", 2]
+ *
+ *  If <tt>range.end</tt> is negative, assigns +object+ at offset +start+,
+ *  retains <tt>range.end.abs -1</tt> elements past that, and removes those beyond:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1..-1] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *    a = [:foo, 'bar', 2]
+ *    a[1..-2] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", 2]
+ *    a = [:foo, 'bar', 2]
+ *    a[1..-3] = 'foo' # => "foo"
+ *    a # => [:foo, "foo", "bar", 2]
+ *    a = [:foo, 'bar', 2]
+ *
+ *  If <tt>range.end</tt> is too large for the existing array,
+ *  replaces array elements, but does not extend the array with +nil+ values:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[1..5] = 'foo' # => "foo"
+ *    a # => [:foo, "foo"]
+ *
  */
 
 static VALUE
@@ -1436,41 +2596,60 @@ rb_ary_aset(int argc, VALUE *argv, VALUE ary)
 {
     long offset, beg, len;
 
+    rb_check_arity(argc, 2, 3);
+    rb_ary_modify_check(ary);
     if (argc == 3) {
-	rb_ary_modify_check(ary);
-	beg = NUM2LONG(argv[0]);
-	len = NUM2LONG(argv[1]);
-	rb_ary_splice(ary, beg, len, argv[2]);
-	return argv[2];
+        beg = NUM2LONG(argv[0]);
+        len = NUM2LONG(argv[1]);
+        return ary_aset_by_rb_ary_splice(ary, beg, len, argv[2]);
     }
-    rb_check_arity(argc, 2, 2);
-    rb_ary_modify_check(ary);
     if (FIXNUM_P(argv[0])) {
-	offset = FIX2LONG(argv[0]);
-	goto fixnum;
+        offset = FIX2LONG(argv[0]);
+        return ary_aset_by_rb_ary_store(ary, offset, argv[1]);
     }
     if (rb_range_beg_len(argv[0], &beg, &len, RARRAY_LEN(ary), 1)) {
-	/* check if idx is Range */
-	rb_ary_splice(ary, beg, len, argv[1]);
-	return argv[1];
+        /* check if idx is Range */
+        return ary_aset_by_rb_ary_splice(ary, beg, len, argv[1]);
     }
 
     offset = NUM2LONG(argv[0]);
-fixnum:
-    rb_ary_store(ary, offset, argv[1]);
-    return argv[1];
+    return ary_aset_by_rb_ary_store(ary, offset, argv[1]);
 }
 
 /*
  *  call-seq:
- *     ary.insert(index, obj...)  -> ary
+ *    array.insert(index, *objects) -> self
+ *
+ *  Inserts given +objects+ before or after the element at \Integer index +offset+;
+ *  returns +self+.
+ *
+ *  When +index+ is non-negative, inserts all given +objects+
+ *  before the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(1, :bat, :bam) # => [:foo, :bat, :bam, "bar", 2]
+ *
+ *  Extends the array if +index+ is beyond the array (<tt>index >= self.size</tt>):
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(5, :bat, :bam)
+ *    a # => [:foo, "bar", 2, nil, nil, :bat, :bam]
+ *
+ *  Does nothing if no objects given:
  *
- *  Inserts the given values before the element with the given index
- *  (which may be negative).
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(1)
+ *    a.insert(50)
+ *    a.insert(-50)
+ *    a # => [:foo, "bar", 2]
+ *
+ *  When +index+ is negative, inserts all given +objects+
+ *  _after_ the element at offset <tt>index+self.size</tt>:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.insert(-2, :bat, :bam)
+ *    a # => [:foo, "bar", :bat, :bam, 2]
  *
- *     a = %w{ a b c d }
- *     a.insert(2, 99)         #=> ["a", "b", 99, "c", "d"]
- *     a.insert(-2, 1, 2, 3)   #=> ["a", "b", 99, "c", 1, 2, 3, "d"]
  */
 
 static VALUE
@@ -1480,93 +2659,189 @@ rb_ary_insert(int argc, VALUE *argv, VALUE ary)
 
     rb_check_arity(argc, 1, UNLIMITED_ARGUMENTS);
     rb_ary_modify_check(ary);
-    if (argc == 1) return ary;
     pos = NUM2LONG(argv[0]);
+    if (argc == 1) return ary;
     if (pos == -1) {
-	pos = RARRAY_LEN(ary);
+        pos = RARRAY_LEN(ary);
     }
-    if (pos < 0) {
-	pos++;
+    else if (pos < 0) {
+        long minpos = -RARRAY_LEN(ary) - 1;
+        if (pos < minpos) {
+            rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
+                     pos, minpos);
+        }
+        pos++;
     }
-    rb_ary_splice(ary, pos, 0, rb_ary_new4(argc - 1, argv + 1));
+    rb_ary_splice(ary, pos, 0, argv + 1, argc - 1);
     return ary;
 }
 
+static VALUE
+rb_ary_length(VALUE ary);
+
+static VALUE
+ary_enum_length(VALUE ary, VALUE args, VALUE eobj)
+{
+    return rb_ary_length(ary);
+}
+
 /*
  *  call-seq:
- *     ary.each {|item| block }   -> ary
- *     ary.each                   -> an_enumerator
+ *    array.each {|element| ... } -> self
+ *    array.each -> Enumerator
+ *
+ *  Iterates over array elements.
+ *
+ *  When a block given, passes each successive array element to the block;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.each {|element|  puts "#{element.class} #{element}" }
+ *
+ *  Output:
+ *
+ *    Symbol foo
+ *    String bar
+ *    Integer 2
  *
- *  Calls +block+ once for each element in +self+, passing that
- *  element as a parameter.
+ *  Allows the array to be modified during iteration:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    a = [:foo, 'bar', 2]
+ *    a.each {|element| puts element; a.clear if element.to_s.start_with?('b') }
  *
- *     a = [ "a", "b", "c" ]
- *     a.each {|x| print x, " -- " }
+ *  Output:
  *
- *  produces:
+ *    foo
+ *    bar
  *
- *     a -- b -- c --
+ *  When no block given, returns a new \Enumerator:
+ *    a = [:foo, 'bar', 2]
+ *
+ *    e = a.each
+ *    e # => #<Enumerator: [:foo, "bar", 2]:each>
+ *    a1 = e.each {|element|  puts "#{element.class} #{element}" }
+ *
+ *  Output:
+ *
+ *    Symbol foo
+ *    String bar
+ *    Integer 2
+ *
+ *  Related: #each_index, #reverse_each.
  */
 
 VALUE
-rb_ary_each(VALUE array)
+rb_ary_each(VALUE ary)
 {
     long i;
-    volatile VALUE ary = array;
-
-    RETURN_ENUMERATOR(ary, 0, 0);
+    ary_verify(ary);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	rb_yield(RARRAY_PTR(ary)[i]);
+        rb_yield(RARRAY_AREF(ary, i));
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.each_index {|index| block }  -> ary
- *     ary.each_index                   -> an_enumerator
+ *    array.each_index {|index| ... } -> self
+ *    array.each_index -> Enumerator
+ *
+ *  Iterates over array indexes.
+ *
+ *  When a block given, passes each successive array index to the block;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.each_index {|index|  puts "#{index} #{a[index]}" }
  *
- *  Same as Array#each, but passes the index of the element instead of the
- *  element itself.
+ *  Output:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    0 foo
+ *    1 bar
+ *    2 2
  *
+ *  Allows the array to be modified during iteration:
  *
- *     a = [ "a", "b", "c" ]
- *     a.each_index {|x| print x, " -- " }
+ *    a = [:foo, 'bar', 2]
+ *    a.each_index {|index| puts index; a.clear if index > 0 }
  *
- *  produces:
+ *  Output:
  *
- *     0 -- 1 -- 2 --
+ *    0
+ *    1
+ *
+ *  When no block given, returns a new \Enumerator:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    e = a.each_index
+ *    e # => #<Enumerator: [:foo, "bar", 2]:each_index>
+ *    a1 = e.each {|index|  puts "#{index} #{a[index]}"}
+ *
+ *  Output:
+ *
+ *    0 foo
+ *    1 bar
+ *    2 2
+ *
+ *  Related: #each, #reverse_each.
  */
 
 static VALUE
 rb_ary_each_index(VALUE ary)
 {
     long i;
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
 
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	rb_yield(LONG2NUM(i));
+        rb_yield(LONG2NUM(i));
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.reverse_each {|item| block }   -> ary
- *     ary.reverse_each                   -> an_enumerator
+ *    array.reverse_each {|element| ... } -> self
+ *    array.reverse_each -> Enumerator
+ *
+ *  Iterates backwards over array elements.
+ *
+ *  When a block given, passes, in reverse order, each element to the block;
+ *  returns +self+:
  *
- *  Same as Array#each, but traverses +self+ in reverse order.
+ *    a = [:foo, 'bar', 2]
+ *    a.reverse_each {|element|  puts "#{element.class} #{element}" }
  *
- *     a = [ "a", "b", "c" ]
- *     a.reverse_each {|x| print x, " " }
+ *  Output:
  *
- *  produces:
+ *    Integer 2
+ *    String bar
+ *    Symbol foo
  *
- *     c b a
+ *  Allows the array to be modified during iteration:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.reverse_each {|element| puts element; a.clear if element.to_s.start_with?('b') }
+ *
+ *  Output:
+ *
+ *    2
+ *    bar
+ *
+ *  When no block given, returns a new \Enumerator:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    e = a.reverse_each
+ *    e # => #<Enumerator: [:foo, "bar", 2]:reverse_each>
+ *    a1 = e.each {|element|  puts "#{element.class} #{element}" }
+ *
+ *  Output:
+ *
+ *    Integer 2
+ *    String bar
+ *    Symbol foo
+ *
+ *  Related: #each, #each_index.
  */
 
 static VALUE
@@ -1574,24 +2849,24 @@ rb_ary_reverse_each(VALUE ary)
 {
     long len;
 
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     len = RARRAY_LEN(ary);
     while (len--) {
-	rb_yield(RARRAY_PTR(ary)[len]);
-	if (RARRAY_LEN(ary) < len) {
-	    len = RARRAY_LEN(ary);
-	}
+        long nlen;
+        rb_yield(RARRAY_AREF(ary, len));
+        nlen = RARRAY_LEN(ary);
+        if (nlen < len) {
+            len = nlen;
+        }
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.length -> int
- *
- *  Returns the number of elements in +self+. May be zero.
+ *    array.length -> an_integer
  *
- *     [ 1, 2, 3, 4, 5 ].length   #=> 5
+ *  Returns the count of elements in +self+.
  */
 
 static VALUE
@@ -1603,34 +2878,35 @@ rb_ary_length(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.empty?   -> true or false
+ *    array.empty?  -> true or false
  *
- *  Returns <code>true</code> if +self+ contains no elements.
- *
- *     [].empty?   #=> true
+ *  Returns +true+ if the count of elements in +self+ is zero,
+ *  +false+ otherwise.
  */
 
 static VALUE
 rb_ary_empty_p(VALUE ary)
 {
-    if (RARRAY_LEN(ary) == 0)
-	return Qtrue;
-    return Qfalse;
+    return RBOOL(RARRAY_LEN(ary) == 0);
 }
 
 VALUE
 rb_ary_dup(VALUE ary)
 {
-    VALUE dup = rb_ary_new2(RARRAY_LEN(ary));
-    MEMCPY(RARRAY_PTR(dup), RARRAY_PTR(ary), VALUE, RARRAY_LEN(ary));
-    ARY_SET_LEN(dup, RARRAY_LEN(ary));
+    long len = RARRAY_LEN(ary);
+    VALUE dup = rb_ary_new2(len);
+    ary_memcpy(dup, 0, len, RARRAY_CONST_PTR_TRANSIENT(ary));
+    ARY_SET_LEN(dup, len);
+
+    ary_verify(ary);
+    ary_verify(dup);
     return dup;
 }
 
 VALUE
 rb_ary_resurrect(VALUE ary)
 {
-    return rb_ary_new4(RARRAY_LEN(ary), RARRAY_PTR(ary));
+    return ary_make_partial(ary, rb_cArray, 0, RARRAY_LEN(ary));
 }
 
 extern VALUE rb_output_fs;
@@ -1647,28 +2923,56 @@ recursive_join(VALUE obj, VALUE argp, int recur)
     int *first = (int *)arg[3];
 
     if (recur) {
-	rb_raise(rb_eArgError, "recursive array join");
+        rb_raise(rb_eArgError, "recursive array join");
     }
     else {
-	ary_join_1(obj, ary, sep, 0, result, first);
+        ary_join_1(obj, ary, sep, 0, result, first);
     }
     return Qnil;
 }
 
-static void
+static long
 ary_join_0(VALUE ary, VALUE sep, long max, VALUE result)
 {
     long i;
     VALUE val;
 
-    if (max > 0) rb_enc_copy(result, RARRAY_PTR(ary)[0]);
+    if (max > 0) rb_enc_copy(result, RARRAY_AREF(ary, 0));
     for (i=0; i<max; i++) {
-	val = RARRAY_PTR(ary)[i];
-	if (i > 0 && !NIL_P(sep))
-	    rb_str_buf_append(result, sep);
-	rb_str_buf_append(result, val);
-	if (OBJ_TAINTED(val)) OBJ_TAINT(result);
-	if (OBJ_UNTRUSTED(val)) OBJ_TAINT(result);
+        val = RARRAY_AREF(ary, i);
+        if (!RB_TYPE_P(val, T_STRING)) break;
+        if (i > 0 && !NIL_P(sep))
+            rb_str_buf_append(result, sep);
+        rb_str_buf_append(result, val);
+    }
+    return i;
+}
+
+static void
+ary_join_1_str(VALUE dst, VALUE src, int *first)
+{
+    rb_str_buf_append(dst, src);
+    if (*first) {
+        rb_enc_copy(dst, src);
+        *first = FALSE;
+    }
+}
+
+static void
+ary_join_1_ary(VALUE obj, VALUE ary, VALUE sep, VALUE result, VALUE val, int *first)
+{
+    if (val == ary) {
+        rb_raise(rb_eArgError, "recursive array join");
+    }
+    else {
+        VALUE args[4];
+
+        *first = FALSE;
+        args[0] = val;
+        args[1] = sep;
+        args[2] = result;
+        args[3] = (VALUE)first;
+        rb_exec_recursive(recursive_join, obj, (VALUE)args);
     }
 }
 
@@ -1678,51 +2982,25 @@ ary_join_1(VALUE obj, VALUE ary, VALUE sep, long i, VALUE result, int *first)
     VALUE val, tmp;
 
     for (; i<RARRAY_LEN(ary); i++) {
-	if (i > 0 && !NIL_P(sep))
-	    rb_str_buf_append(result, sep);
-
-	val = RARRAY_PTR(ary)[i];
-	switch (TYPE(val)) {
-	  case T_STRING:
-	  str_join:
-	    rb_str_buf_append(result, val);
-	    *first = FALSE;
-	    break;
-	  case T_ARRAY:
-	    obj = val;
-	  ary_join:
-	    if (val == ary) {
-		rb_raise(rb_eArgError, "recursive array join");
-	    }
-	    else {
-		VALUE args[4];
-
-		args[0] = val;
-		args[1] = sep;
-		args[2] = result;
-		args[3] = (VALUE)first;
-		rb_exec_recursive(recursive_join, obj, (VALUE)args);
-	    }
-	    break;
-	  default:
-	    tmp = rb_check_string_type(val);
-	    if (!NIL_P(tmp)) {
-		val = tmp;
-		goto str_join;
-	    }
-	    tmp = rb_check_convert_type(val, T_ARRAY, "Array", "to_ary");
-	    if (!NIL_P(tmp)) {
-		obj = val;
-		val = tmp;
-		goto ary_join;
-	    }
-	    val = rb_obj_as_string(val);
-	    if (*first) {
-		rb_enc_copy(result, val);
-		*first = FALSE;
-	    }
-	    goto str_join;
-	}
+        if (i > 0 && !NIL_P(sep))
+            rb_str_buf_append(result, sep);
+
+        val = RARRAY_AREF(ary, i);
+        if (RB_TYPE_P(val, T_STRING)) {
+            ary_join_1_str(result, val, first);
+        }
+        else if (RB_TYPE_P(val, T_ARRAY)) {
+            ary_join_1_ary(val, ary, sep, result, val, first);
+        }
+        else if (!NIL_P(tmp = rb_check_string_type(val))) {
+            ary_join_1_str(result, tmp, first);
+        }
+        else if (!NIL_P(tmp = rb_check_array_type(val))) {
+            ary_join_1_ary(val, ary, sep, result, tmp, first);
+        }
+        else {
+            ary_join_1_str(result, rb_obj_as_string(val), first);
+        }
     }
 }
 
@@ -1730,40 +3008,36 @@ VALUE
 rb_ary_join(VALUE ary, VALUE sep)
 {
     long len = 1, i;
-    int taint = FALSE;
-    int untrust = FALSE;
     VALUE val, tmp, result;
 
     if (RARRAY_LEN(ary) == 0) return rb_usascii_str_new(0, 0);
-    if (OBJ_TAINTED(ary) || OBJ_TAINTED(sep)) taint = TRUE;
-    if (OBJ_UNTRUSTED(ary) || OBJ_UNTRUSTED(sep)) untrust = TRUE;
 
     if (!NIL_P(sep)) {
-	StringValue(sep);
-	len += RSTRING_LEN(sep) * (RARRAY_LEN(ary) - 1);
+        StringValue(sep);
+        len += RSTRING_LEN(sep) * (RARRAY_LEN(ary) - 1);
     }
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	val = RARRAY_PTR(ary)[i];
-	tmp = rb_check_string_type(val);
-
-	if (NIL_P(tmp) || tmp != val) {
-	    int first;
-	    result = rb_str_buf_new(len + (RARRAY_LEN(ary)-i)*10);
-	    rb_enc_associate(result, rb_usascii_encoding());
-	    if (taint) OBJ_TAINT(result);
-	    if (untrust) OBJ_UNTRUST(result);
-	    ary_join_0(ary, sep, i, result);
-	    first = i == 0;
-	    ary_join_1(ary, ary, sep, i, result, &first);
-	    return result;
-	}
-
-	len += RSTRING_LEN(tmp);
-    }
-
-    result = rb_str_buf_new(len);
-    if (taint) OBJ_TAINT(result);
-    if (untrust) OBJ_UNTRUST(result);
+        val = RARRAY_AREF(ary, i);
+        tmp = rb_check_string_type(val);
+
+        if (NIL_P(tmp) || tmp != val) {
+            int first;
+            long n = RARRAY_LEN(ary);
+            if (i > n) i = n;
+            result = rb_str_buf_new(len + (n-i)*10);
+            rb_enc_associate(result, rb_usascii_encoding());
+            i = ary_join_0(ary, sep, i, result);
+            first = i == 0;
+            ary_join_1(ary, ary, sep, i, result, &first);
+            return result;
+        }
+
+        len += RSTRING_LEN(tmp);
+    }
+
+    result = rb_str_new(0, len);
+    rb_str_set_len(result, 0);
+
     ary_join_0(ary, sep, RARRAY_LEN(ary), result);
 
     return result;
@@ -1771,22 +3045,43 @@ rb_ary_join(VALUE ary, VALUE sep)
 
 /*
  *  call-seq:
- *     ary.join(sep=$,)    -> str
+ *    array.join ->new_string
+ *    array.join(separator = $,) -> new_string
+ *
+ *  Returns the new \String formed by joining the array elements after conversion.
+ *  For each element +element+:
+ *
+ *  - Uses <tt>element.to_s</tt> if +element+ is not a <tt>kind_of?(Array)</tt>.
+ *  - Uses recursive <tt>element.join(separator)</tt> if +element+ is a <tt>kind_of?(Array)</tt>.
+ *
+ *  With no argument, joins using the output field separator, <tt>$,</tt>:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    $, # => nil
+ *    a.join # => "foobar2"
+ *
+ *  With \string argument +separator+, joins using that separator:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.join("\n") # => "foo\nbar\n2"
+ *
+ *  Joins recursively for nested Arrays:
  *
- *  Returns a string created by converting each element of the array to
- *  a string, separated by +sep+.
+ *   a = [:foo, [:bar, [:baz, :bat]]]
+ *   a.join # => "foobarbazbat"
  *
- *     [ "a", "b", "c" ].join        #=> "abc"
- *     [ "a", "b", "c" ].join("-")   #=> "a-b-c"
  */
-
 static VALUE
 rb_ary_join_m(int argc, VALUE *argv, VALUE ary)
 {
     VALUE sep;
 
-    rb_scan_args(argc, argv, "01", &sep);
-    if (NIL_P(sep)) sep = rb_output_fs;
+    if (rb_check_arity(argc, 0, 1) == 0 || NIL_P(sep = argv[0])) {
+        sep = rb_output_fs;
+        if (!NIL_P(sep)) {
+            rb_category_warn(RB_WARN_CATEGORY_DEPRECATED, "$, is set to non-nil value");
+        }
+    }
 
     return rb_ary_join(ary, sep);
 }
@@ -1794,33 +3089,32 @@ rb_ary_join_m(int argc, VALUE *argv, VALUE ary)
 static VALUE
 inspect_ary(VALUE ary, VALUE dummy, int recur)
 {
-    int tainted = OBJ_TAINTED(ary);
-    int untrust = OBJ_UNTRUSTED(ary);
     long i;
     VALUE s, str;
 
     if (recur) return rb_usascii_str_new_cstr("[...]");
     str = rb_str_buf_new2("[");
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	s = rb_inspect(RARRAY_PTR(ary)[i]);
-	if (OBJ_TAINTED(s)) tainted = TRUE;
-	if (OBJ_UNTRUSTED(s)) untrust = TRUE;
-	if (i > 0) rb_str_buf_cat2(str, ", ");
-	else rb_enc_copy(str, s);
-	rb_str_buf_append(str, s);
+        s = rb_inspect(RARRAY_AREF(ary, i));
+        if (i > 0) rb_str_buf_cat2(str, ", ");
+        else rb_enc_copy(str, s);
+        rb_str_buf_append(str, s);
     }
     rb_str_buf_cat2(str, "]");
-    if (tainted) OBJ_TAINT(str);
-    if (untrust) OBJ_UNTRUST(str);
     return str;
 }
 
 /*
  *  call-seq:
- *     ary.to_s -> string
- *     ary.inspect  -> string
+ *    array.inspect -> new_string
+ *
+ *  Returns the new \String formed by calling method <tt>#inspect</tt>
+ *  on each array element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.inspect # => "[:foo, \"bar\", 2]"
  *
- *  Creates a string representation of +self+.
+ *  Array#to_s is an alias for Array#inspect.
  */
 
 static VALUE
@@ -1838,26 +3132,88 @@ rb_ary_to_s(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.to_a     -> ary
+ *    to_a -> self or new_array
+ *
+ *  When +self+ is an instance of \Array, returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.to_a # => [:foo, "bar", 2]
+ *
+ *  Otherwise, returns a new \Array containing the elements of +self+:
+ *
+ *    class MyArray < Array; end
+ *    a = MyArray.new(['foo', 'bar', 'two'])
+ *    a.instance_of?(Array) # => false
+ *    a.kind_of?(Array) # => true
+ *    a1 = a.to_a
+ *    a1 # => ["foo", "bar", "two"]
+ *    a1.class # => Array # Not MyArray
  *
- *  Returns +self+. If called on a subclass of Array, converts
- *  the receiver to an Array object.
  */
 
 static VALUE
 rb_ary_to_a(VALUE ary)
 {
     if (rb_obj_class(ary) != rb_cArray) {
-	VALUE dup = rb_ary_new2(RARRAY_LEN(ary));
-	rb_ary_replace(dup, ary);
-	return dup;
+        VALUE dup = rb_ary_new2(RARRAY_LEN(ary));
+        rb_ary_replace(dup, ary);
+        return dup;
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.to_ary -> ary
+ *    array.to_h -> new_hash
+ *    array.to_h {|item| ... } -> new_hash
+ *
+ *  Returns a new \Hash formed from +self+.
+ *
+ *  When a block is given, calls the block with each array element;
+ *  the block must return a 2-element \Array whose two elements
+ *  form a key-value pair in the returned \Hash:
+ *
+ *    a = ['foo', :bar, 1, [2, 3], {baz: 4}]
+ *    h = a.to_h {|item| [item, item] }
+ *    h # => {"foo"=>"foo", :bar=>:bar, 1=>1, [2, 3]=>[2, 3], {:baz=>4}=>{:baz=>4}}
+ *
+ *  When no block is given, +self+ must be an \Array of 2-element sub-arrays,
+ *  each sub-array is formed into a key-value pair in the new \Hash:
+ *
+ *    [].to_h # => {}
+ *    a = [['foo', 'zero'], ['bar', 'one'], ['baz', 'two']]
+ *    h = a.to_h
+ *    h # => {"foo"=>"zero", "bar"=>"one", "baz"=>"two"}
+ *
+ */
+
+static VALUE
+rb_ary_to_h(VALUE ary)
+{
+    long i;
+    VALUE hash = rb_hash_new_with_size(RARRAY_LEN(ary));
+    int block_given = rb_block_given_p();
+
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        const VALUE e = rb_ary_elt(ary, i);
+        const VALUE elt = block_given ? rb_yield_force_blockarg(e) : e;
+        const VALUE key_value_pair = rb_check_array_type(elt);
+        if (NIL_P(key_value_pair)) {
+            rb_raise(rb_eTypeError, "wrong element type %"PRIsVALUE" at %ld (expected array)",
+                     rb_obj_class(elt), i);
+        }
+        if (RARRAY_LEN(key_value_pair) != 2) {
+            rb_raise(rb_eArgError, "wrong array length at %ld (expected 2, was %ld)",
+                i, RARRAY_LEN(key_value_pair));
+        }
+        rb_hash_aset(hash, RARRAY_AREF(key_value_pair, 0), RARRAY_AREF(key_value_pair, 1));
+    }
+    return hash;
+}
+
+/*
+ *  call-seq:
+ *    array.to_ary -> self
  *
  *  Returns +self+.
  */
@@ -1869,39 +3225,40 @@ rb_ary_to_ary_m(VALUE ary)
 }
 
 static void
-ary_reverse(p1, p2)
-    VALUE *p1, *p2;
+ary_reverse(VALUE *p1, VALUE *p2)
 {
     while (p1 < p2) {
-	VALUE tmp = *p1;
-	*p1++ = *p2;
-	*p2-- = tmp;
+        VALUE tmp = *p1;
+        *p1++ = *p2;
+        *p2-- = tmp;
     }
 }
 
 VALUE
 rb_ary_reverse(VALUE ary)
 {
-    VALUE *p1, *p2;
+    VALUE *p2;
+    long len = RARRAY_LEN(ary);
 
     rb_ary_modify(ary);
-    if (RARRAY_LEN(ary) > 1) {
-	p1 = RARRAY_PTR(ary);
-	p2 = p1 + RARRAY_LEN(ary) - 1;	/* points last item */
-	ary_reverse(p1, p2);
+    if (len > 1) {
+        RARRAY_PTR_USE_TRANSIENT(ary, p1, {
+            p2 = p1 + len - 1;	/* points last item */
+            ary_reverse(p1, p2);
+        }); /* WB: no new reference */
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.reverse!   -> ary
+ *    array.reverse! -> self
+ *
+ *  Reverses +self+ in place:
  *
- *  Reverses +self+ in place.
+ *    a = ['foo', 'bar', 'two']
+ *    a.reverse! # => ["two", "bar", "foo"]
  *
- *     a = [ "a", "b", "c" ]
- *     a.reverse!       #=> ["c", "b", "a"]
- *     a                #=> ["c", "b", "a"]
  */
 
 static VALUE
@@ -1912,12 +3269,14 @@ rb_ary_reverse_bang(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.reverse -> new_ary
+ *    array.reverse -> new_array
  *
- *  Returns a new array containing +self+'s elements in reverse order.
+ *  Returns a new \Array with the elements of +self+ in reverse order:
+ *
+ *    a = ['foo', 'bar', 'two']
+ *    a1 = a.reverse
+ *    a1 # => ["two", "bar", "foo"]
  *
- *     [ "a", "b", "c" ].reverse   #=> ["c", "b", "a"]
- *     [ 1 ].reverse               #=> [1]
  */
 
 static VALUE
@@ -1927,9 +3286,9 @@ rb_ary_reverse_m(VALUE ary)
     VALUE dup = rb_ary_new2(len);
 
     if (len > 0) {
-	VALUE *p1 = RARRAY_PTR(ary);
-	VALUE *p2 = RARRAY_PTR(dup) + len - 1;
-	do *p2-- = *p1++; while (--len > 0);
+        const VALUE *p1 = RARRAY_CONST_PTR_TRANSIENT(ary);
+        VALUE *p2 = (VALUE *)RARRAY_CONST_PTR_TRANSIENT(dup) + len - 1;
+        do *p2-- = *p1++; while (--len > 0);
     }
     ARY_SET_LEN(dup, RARRAY_LEN(ary));
     return dup;
@@ -1941,92 +3300,161 @@ rotate_count(long cnt, long len)
     return (cnt < 0) ? (len - (~cnt % len) - 1) : (cnt % len);
 }
 
+static void
+ary_rotate_ptr(VALUE *ptr, long len, long cnt)
+{
+    if (cnt == 1) {
+        VALUE tmp = *ptr;
+        memmove(ptr, ptr + 1, sizeof(VALUE)*(len - 1));
+        *(ptr + len - 1) = tmp;
+    }
+    else if (cnt == len - 1) {
+        VALUE tmp = *(ptr + len - 1);
+        memmove(ptr + 1, ptr, sizeof(VALUE)*(len - 1));
+        *ptr = tmp;
+    }
+    else {
+        --len;
+        if (cnt < len) ary_reverse(ptr + cnt, ptr + len);
+        if (--cnt > 0) ary_reverse(ptr, ptr + cnt);
+        if (len > 0) ary_reverse(ptr, ptr + len);
+    }
+}
+
 VALUE
 rb_ary_rotate(VALUE ary, long cnt)
 {
     rb_ary_modify(ary);
 
     if (cnt != 0) {
-	VALUE *ptr = RARRAY_PTR(ary);
-	long len = RARRAY_LEN(ary);
-
-	if (len > 0 && (cnt = rotate_count(cnt, len)) > 0) {
-	    --len;
-	    if (cnt < len) ary_reverse(ptr + cnt, ptr + len);
-	    if (--cnt > 0) ary_reverse(ptr, ptr + cnt);
-	    if (len > 0) ary_reverse(ptr, ptr + len);
-	    return ary;
-	}
+        long len = RARRAY_LEN(ary);
+        if (len > 1 && (cnt = rotate_count(cnt, len)) > 0) {
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, ary_rotate_ptr(ptr, len, cnt));
+            return ary;
+        }
     }
-
     return Qnil;
 }
 
 /*
  *  call-seq:
- *     ary.rotate!(cnt=1) -> ary
+ *    array.rotate! -> self
+ *    array.rotate!(count) -> self
+ *
+ *  Rotates +self+ in place by moving elements from one end to the other; returns +self+.
+ *
+ *  When no argument given, rotates the first element to the last position:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rotate! # => ["bar", 2, "bar", :foo]
+ *
+ *  When given a non-negative \Integer +count+,
+ *  rotates +count+ elements from the beginning to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(2)
+ *    a # => [2, :foo, "bar"]
+ *
+ *  If +count+ is large, uses <tt>count % array.size</tt> as the count:
  *
- *  Rotates +self+ in place so that the element at +cnt+ comes first,
- *  and returns +self+.  If +cnt+ is negative then it rotates in
- *  the opposite direction.
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(20)
+ *    a # => [2, :foo, "bar"]
+ *
+ *  If +count+ is zero, returns +self+ unmodified:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(0)
+ *    a # => [:foo, "bar", 2]
+ *
+ *  When given a negative Integer +count+, rotates in the opposite direction,
+ *  from end to beginning:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(-2)
+ *    a # => ["bar", 2, :foo]
+ *
+ *  If +count+ is small (far from zero), uses <tt>count % array.size</tt> as the count:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.rotate!(-5)
+ *    a # => ["bar", 2, :foo]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.rotate!        #=> ["b", "c", "d", "a"]
- *     a                #=> ["b", "c", "d", "a"]
- *     a.rotate!(2)     #=> ["d", "a", "b", "c"]
- *     a.rotate!(-3)    #=> ["a", "b", "c", "d"]
  */
 
 static VALUE
 rb_ary_rotate_bang(int argc, VALUE *argv, VALUE ary)
 {
-    long n = 1;
-
-    switch (argc) {
-      case 1: n = NUM2LONG(argv[0]);
-      case 0: break;
-      default: rb_scan_args(argc, argv, "01", NULL);
-    }
+    long n = (rb_check_arity(argc, 0, 1) ? NUM2LONG(argv[0]) : 1);
     rb_ary_rotate(ary, n);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.rotate(cnt=1) -> new_ary
+ *    array.rotate -> new_array
+ *    array.rotate(count) -> new_array
+ *
+ *  Returns a new \Array formed from +self+ with elements
+ *  rotated from one end to the other.
+ *
+ *  When no argument given, returns a new \Array that is like +self+,
+ *  except that the first element has been rotated to the last position:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a1 = a.rotate
+ *    a1 # => ["bar", 2, "bar", :foo]
+ *
+ *  When given a non-negative \Integer +count+,
+ *  returns a new \Array with +count+ elements rotated from the beginning to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(2)
+ *    a1 # => [2, :foo, "bar"]
+ *
+ *  If +count+ is large, uses <tt>count % array.size</tt> as the count:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(20)
+ *    a1 # => [2, :foo, "bar"]
+ *
+ *  If +count+ is zero, returns a copy of +self+, unmodified:
  *
- *  Returns new array by rotating +self+ so that the element at
- *  +cnt+ in +self+ is the first element of the new array. If +cnt+
- *  is negative then it rotates in the opposite direction.
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(0)
+ *    a1 # => [:foo, "bar", 2]
+ *
+ *  When given a negative \Integer +count+, rotates in the opposite direction,
+ *  from end to beginning:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(-2)
+ *    a1 # => ["bar", 2, :foo]
+ *
+ *  If +count+ is small (far from zero), uses <tt>count % array.size</tt> as the count:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.rotate(-5)
+ *    a1 # => ["bar", 2, :foo]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.rotate         #=> ["b", "c", "d", "a"]
- *     a                #=> ["a", "b", "c", "d"]
- *     a.rotate(2)      #=> ["c", "d", "a", "b"]
- *     a.rotate(-3)     #=> ["b", "c", "d", "a"]
  */
 
 static VALUE
 rb_ary_rotate_m(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE rotated, *ptr, *ptr2;
-    long len, cnt = 1;
-
-    switch (argc) {
-      case 1: cnt = NUM2LONG(argv[0]);
-      case 0: break;
-      default: rb_scan_args(argc, argv, "01", NULL);
-    }
+    VALUE rotated;
+    const VALUE *ptr;
+    long len;
+    long cnt = (rb_check_arity(argc, 0, 1) ? NUM2LONG(argv[0]) : 1);
 
     len = RARRAY_LEN(ary);
     rotated = rb_ary_new2(len);
     if (len > 0) {
-	cnt = rotate_count(cnt, len);
-	ptr = RARRAY_PTR(ary);
-	ptr2 = RARRAY_PTR(rotated);
-	len -= cnt;
-	MEMCPY(ptr2, ptr + cnt, VALUE, len);
-	MEMCPY(ptr2 + len, ptr, VALUE, cnt);
+        cnt = rotate_count(cnt, len);
+        ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
+        len -= cnt;
+        ary_memcpy(rotated, 0, len, ptr + cnt);
+        ary_memcpy(rotated, len, cnt, ptr);
     }
     ARY_SET_LEN(rotated, RARRAY_LEN(ary));
     return rotated;
@@ -2034,46 +3462,41 @@ rb_ary_rotate_m(int argc, VALUE *argv, VALUE ary)
 
 struct ary_sort_data {
     VALUE ary;
-    int opt_methods;
-    int opt_inited;
+    VALUE receiver;
 };
 
-enum {
-    sort_opt_Fixnum,
-    sort_opt_String,
-    sort_optimizable_count
-};
-
-#define STRING_P(s) (RB_TYPE_P((s), T_STRING) && CLASS_OF(s) == rb_cString)
-
-#define SORT_OPTIMIZABLE_BIT(type) (1U << TOKEN_PASTE(sort_opt_,type))
-#define SORT_OPTIMIZABLE(data, type) \
-    (((data)->opt_inited & SORT_OPTIMIZABLE_BIT(type)) ? \
-     ((data)->opt_methods & SORT_OPTIMIZABLE_BIT(type)) : \
-     (((data)->opt_inited |= SORT_OPTIMIZABLE_BIT(type)), \
-      rb_method_basic_definition_p(TOKEN_PASTE(rb_c,type), id_cmp) && \
-      ((data)->opt_methods |= SORT_OPTIMIZABLE_BIT(type))))
-
 static VALUE
 sort_reentered(VALUE ary)
 {
     if (RBASIC(ary)->klass) {
-	rb_raise(rb_eRuntimeError, "sort reentered");
+        rb_raise(rb_eRuntimeError, "sort reentered");
     }
     return Qnil;
 }
 
+static void
+sort_returned(struct ary_sort_data *data)
+{
+    if (rb_obj_frozen_p(data->receiver)) {
+        rb_raise(rb_eFrozenError, "array frozen during sort");
+    }
+    sort_reentered(data->ary);
+}
+
 static int
 sort_1(const void *ap, const void *bp, void *dummy)
 {
     struct ary_sort_data *data = dummy;
     VALUE retval = sort_reentered(data->ary);
     VALUE a = *(const VALUE *)ap, b = *(const VALUE *)bp;
+    VALUE args[2];
     int n;
 
-    retval = rb_yield_values(2, a, b);
+    args[0] = a;
+    args[1] = b;
+    retval = rb_yield_values2(2, args);
     n = rb_cmpint(retval, a, b);
-    sort_reentered(data->ary);
+    sort_returned(data);
     return n;
 }
 
@@ -2085,36 +3508,64 @@ sort_2(const void *ap, const void *bp, void *dummy)
     VALUE a = *(const VALUE *)ap, b = *(const VALUE *)bp;
     int n;
 
-    if (FIXNUM_P(a) && FIXNUM_P(b) && SORT_OPTIMIZABLE(data, Fixnum)) {
-	if ((long)a > (long)b) return 1;
-	if ((long)a < (long)b) return -1;
-	return 0;
+    if (FIXNUM_P(a) && FIXNUM_P(b) && CMP_OPTIMIZABLE(INTEGER)) {
+        if ((long)a > (long)b) return 1;
+        if ((long)a < (long)b) return -1;
+        return 0;
     }
-    if (STRING_P(a) && STRING_P(b) && SORT_OPTIMIZABLE(data, String)) {
-	return rb_str_cmp(a, b);
+    if (STRING_P(a) && STRING_P(b) && CMP_OPTIMIZABLE(STRING)) {
+        return rb_str_cmp(a, b);
+    }
+    if (RB_FLOAT_TYPE_P(a) && CMP_OPTIMIZABLE(FLOAT)) {
+        return rb_float_cmp(a, b);
     }
 
-    retval = rb_funcall(a, id_cmp, 1, b);
+    retval = rb_funcallv(a, id_cmp, 1, &b);
     n = rb_cmpint(retval, a, b);
-    sort_reentered(data->ary);
+    sort_returned(data);
 
     return n;
 }
 
 /*
  *  call-seq:
- *     ary.sort!                   -> ary
- *     ary.sort! {| a,b | block }  -> ary
- *
- *  Sorts +self+. Comparisons for
- *  the sort will be done using the <code><=></code> operator or using
- *  an optional code block. The block implements a comparison between
- *  +a+ and +b+, returning -1, 0, or +1. See also
- *  Enumerable#sort_by.
- *
- *     a = [ "d", "a", "e", "c", "b" ]
- *     a.sort!                    #=> ["a", "b", "c", "d", "e"]
- *     a.sort! {|x,y| y <=> x }   #=> ["e", "d", "c", "b", "a"]
+ *    array.sort! -> self
+ *    array.sort! {|a, b| ... } -> self
+ *
+ *  Returns +self+ with its elements sorted in place.
+ *
+ *  With no block, compares elements using operator <tt><=></tt>
+ *  (see Comparable):
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a.sort!
+ *    a # => ["a", "b", "c", "d", "e"]
+ *
+ *  With a block, calls the block with each element pair;
+ *  for each element pair +a+ and +b+, the block should return an integer:
+ *
+ *  - Negative when +b+ is to follow +a+.
+ *  - Zero when +a+ and +b+ are equivalent.
+ *  - Positive when +a+ is to follow +b+.
+ *
+ *  Example:
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a.sort! {|a, b| a <=> b }
+ *    a # => ["a", "b", "c", "d", "e"]
+ *    a.sort! {|a, b| b <=> a }
+ *    a # => ["e", "d", "c", "b", "a"]
+ *
+ *  When the block returns zero, the order for +a+ and +b+ is indeterminate,
+ *  and may be unstable:
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a.sort! {|a, b| 0 }
+ *    a # => ["d", "e", "c", "a", "b"]
+ *
  */
 
 VALUE
@@ -2123,31 +3574,29 @@ rb_ary_sort_bang(VALUE ary)
     rb_ary_modify(ary);
     assert(!ARY_SHARED_P(ary));
     if (RARRAY_LEN(ary) > 1) {
-	VALUE tmp = ary_make_substitution(ary); /* only ary refers tmp */
-	struct ary_sort_data data;
-
-	RBASIC(tmp)->klass = 0;
-	data.ary = tmp;
-	data.opt_methods = 0;
-	data.opt_inited = 0;
-	ruby_qsort(RARRAY_PTR(tmp), RARRAY_LEN(tmp), sizeof(VALUE),
-		   rb_block_given_p()?sort_1:sort_2, &data);
-
+        VALUE tmp = ary_make_substitution(ary); /* only ary refers tmp */
+        struct ary_sort_data data;
+        long len = RARRAY_LEN(ary);
+        RBASIC_CLEAR_CLASS(tmp);
+        data.ary = tmp;
+        data.receiver = ary;
+        RARRAY_PTR_USE(tmp, ptr, {
+            ruby_qsort(ptr, len, sizeof(VALUE),
+                       rb_block_given_p()?sort_1:sort_2, &data);
+        }); /* WB: no new reference */
+        rb_ary_modify(ary);
         if (ARY_EMBED_P(tmp)) {
-            assert(ARY_EMBED_P(tmp));
             if (ARY_SHARED_P(ary)) { /* ary might be destructively operated in the given block */
                 rb_ary_unshare(ary);
+                FL_SET_EMBED(ary);
             }
-            FL_SET_EMBED(ary);
-            MEMCPY(RARRAY_PTR(ary), ARY_EMBED_PTR(tmp), VALUE, ARY_EMBED_LEN(tmp));
+            ary_memcpy(ary, 0, ARY_EMBED_LEN(tmp), ARY_EMBED_PTR(tmp));
             ARY_SET_LEN(ary, ARY_EMBED_LEN(tmp));
         }
         else {
-            assert(!ARY_EMBED_P(tmp));
-            if (ARY_HEAP_PTR(ary) == ARY_HEAP_PTR(tmp)) {
-                assert(!ARY_EMBED_P(ary));
+            if (!ARY_EMBED_P(ary) && ARY_HEAP_PTR(ary) == ARY_HEAP_PTR(tmp)) {
                 FL_UNSET_SHARED(ary);
-                ARY_SET_CAPA(ary, ARY_CAPA(tmp));
+                ARY_SET_CAPA(ary, RARRAY_LEN(tmp));
             }
             else {
                 assert(!ARY_SHARED_P(tmp));
@@ -2159,38 +3608,65 @@ rb_ary_sort_bang(VALUE ary)
                     rb_ary_unshare(ary);
                 }
                 else {
-                    xfree(ARY_HEAP_PTR(ary));
+                    ary_heap_free(ary);
                 }
-                ARY_SET_PTR(ary, RARRAY_PTR(tmp));
-                ARY_SET_HEAP_LEN(ary, RARRAY_LEN(tmp));
-                ARY_SET_CAPA(ary, ARY_CAPA(tmp));
+                ARY_SET_PTR(ary, ARY_HEAP_PTR(tmp));
+                ARY_SET_HEAP_LEN(ary, len);
+                ARY_SET_CAPA(ary, ARY_HEAP_LEN(tmp));
             }
             /* tmp was lost ownership for the ptr */
             FL_UNSET(tmp, FL_FREEZE);
             FL_SET_EMBED(tmp);
             ARY_SET_EMBED_LEN(tmp, 0);
             FL_SET(tmp, FL_FREEZE);
-	}
+        }
         /* tmp will be GC'ed. */
-        RBASIC(tmp)->klass = rb_cArray;
+        RBASIC_SET_CLASS_RAW(tmp, rb_cArray); /* rb_cArray must be marked */
     }
+    ary_verify(ary);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.sort                   -> new_ary
- *     ary.sort {| a,b | block }  -> new_ary
- *
- *  Returns a new array created by sorting +self+. Comparisons for
- *  the sort will be done using the <code><=></code> operator or using
- *  an optional code block. The block implements a comparison between
- *  +a+ and +b+, returning -1, 0, or +1. See also
- *  Enumerable#sort_by.
- *
- *     a = [ "d", "a", "e", "c", "b" ]
- *     a.sort                    #=> ["a", "b", "c", "d", "e"]
- *     a.sort {|x,y| y <=> x }   #=> ["e", "d", "c", "b", "a"]
+ *    array.sort -> new_array
+ *    array.sort {|a, b| ... } -> new_array
+ *
+ *  Returns a new \Array whose elements are those from +self+, sorted.
+ *
+ *  With no block, compares elements using operator <tt><=></tt>
+ *  (see Comparable):
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a1 = a.sort
+ *    a1 # => ["a", "b", "c", "d", "e"]
+ *
+ *  With a block, calls the block with each element pair;
+ *  for each element pair +a+ and +b+, the block should return an integer:
+ *
+ *  - Negative when +b+ is to follow +a+.
+ *  - Zero when +a+ and +b+ are equivalent.
+ *  - Positive when +a+ is to follow +b+.
+ *
+ *  Example:
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a1 = a.sort {|a, b| a <=> b }
+ *    a1 # => ["a", "b", "c", "d", "e"]
+ *    a2 = a.sort {|a, b| b <=> a }
+ *    a2 # => ["e", "d", "c", "b", "a"]
+ *
+ *  When the block returns zero, the order for +a+ and +b+ is indeterminate,
+ *  and may be unstable:
+ *
+ *    a = 'abcde'.split('').shuffle
+ *    a # => ["e", "b", "d", "a", "c"]
+ *    a1 = a.sort {|a, b| 0 }
+ *    a1 # =>  ["c", "e", "b", "d", "a"]
+ *
+ *  Related: Enumerable#sort_by.
  */
 
 VALUE
@@ -2201,22 +3677,115 @@ rb_ary_sort(VALUE ary)
     return ary;
 }
 
+static VALUE rb_ary_bsearch_index(VALUE ary);
+
+/*
+ *  call-seq:
+ *    array.bsearch {|element| ... } -> object
+ *    array.bsearch -> new_enumerator
+ *
+ *  Returns an element from +self+ selected by a binary search.
+ *
+ *  See {Binary Searching}[rdoc-ref:bsearch.rdoc].
+ */
+
+static VALUE
+rb_ary_bsearch(VALUE ary)
+{
+    VALUE index_result = rb_ary_bsearch_index(ary);
+
+    if (FIXNUM_P(index_result)) {
+        return rb_ary_entry(ary, FIX2LONG(index_result));
+    }
+    return index_result;
+}
+
+/*
+ *  call-seq:
+ *    array.bsearch_index {|element| ... } -> integer or nil
+ *    array.bsearch_index -> new_enumerator
+ *
+ *  Searches +self+ as described at method #bsearch,
+ *  but returns the _index_ of the found element instead of the element itself.
+ */
+
+static VALUE
+rb_ary_bsearch_index(VALUE ary)
+{
+    long low = 0, high = RARRAY_LEN(ary), mid;
+    int smaller = 0, satisfied = 0;
+    VALUE v, val;
+
+    RETURN_ENUMERATOR(ary, 0, 0);
+    while (low < high) {
+        mid = low + ((high - low) / 2);
+        val = rb_ary_entry(ary, mid);
+        v = rb_yield(val);
+        if (FIXNUM_P(v)) {
+            if (v == INT2FIX(0)) return INT2FIX(mid);
+            smaller = (SIGNED_VALUE)v < 0; /* Fixnum preserves its sign-bit */
+        }
+        else if (v == Qtrue) {
+            satisfied = 1;
+            smaller = 1;
+        }
+        else if (!RTEST(v)) {
+            smaller = 0;
+        }
+        else if (rb_obj_is_kind_of(v, rb_cNumeric)) {
+            const VALUE zero = INT2FIX(0);
+            switch (rb_cmpint(rb_funcallv(v, id_cmp, 1, &zero), v, zero)) {
+              case 0: return INT2FIX(mid);
+              case 1: smaller = 0; break;
+              case -1: smaller = 1;
+            }
+        }
+        else {
+            rb_raise(rb_eTypeError, "wrong argument type %"PRIsVALUE
+                     " (must be numeric, true, false or nil)",
+                     rb_obj_class(v));
+        }
+        if (smaller) {
+            high = mid;
+        }
+        else {
+            low = mid + 1;
+        }
+    }
+    if (!satisfied) return Qnil;
+    return INT2FIX(low);
+}
+
 
 static VALUE
-sort_by_i(VALUE i)
+sort_by_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, dummy))
 {
     return rb_yield(i);
 }
 
 /*
  *  call-seq:
- *     ary.sort_by! {| obj | block }    -> ary
- *     ary.sort_by!                     -> an_enumerator
+ *    array.sort_by! {|element| ... } -> self
+ *    array.sort_by! -> new_enumerator
+ *
+ *  Sorts the elements of +self+ in place,
+ *  using an ordering determined by the block; returns self.
+ *
+ *  Calls the block with each successive element;
+ *  sorts elements based on the values returned from the block.
+ *
+ *  For duplicates returned by the block, the ordering is indeterminate, and may be unstable.
  *
- *  Sorts +self+ in place using a set of keys generated by mapping the
- *  values in +self+ through the given block.
+ *  This example sorts strings based on their sizes:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    a = ['aaaa', 'bbb', 'cc', 'd']
+ *    a.sort_by! {|element| element.size }
+ *    a # => ["d", "cc", "bbb", "aaaa"]
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = ['aaaa', 'bbb', 'cc', 'd']
+ *    a.sort_by! # => #<Enumerator: ["aaaa", "bbb", "cc", "d"]:sort_by!>
  *
  */
 
@@ -2225,7 +3794,7 @@ rb_ary_sort_by_bang(VALUE ary)
 {
     VALUE sorted;
 
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_modify(ary);
     sorted = rb_block_call(ary, rb_intern("sort_by"), 0, 0, sort_by_i, 0);
     rb_ary_replace(ary, sorted);
@@ -2235,20 +3804,22 @@ rb_ary_sort_by_bang(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.collect {|item| block }  -> new_ary
- *     ary.map     {|item| block }  -> new_ary
- *     ary.collect                  -> an_enumerator
- *     ary.map                      -> an_enumerator
+ *    array.map {|element| ... } -> new_array
+ *    array.map -> new_enumerator
  *
- *  Invokes +block+ once for each element of +self+. Creates a
- *  new array containing the values returned by the block.
- *  See also Enumerable#collect.
+ *  Calls the block, if given, with each element of +self+;
+ *  returns a new \Array whose elements are the return values from the block:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.map {|element| element.class }
+ *    a1 # => [Symbol, String, Integer]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.map {|x| x + "!" }   #=> ["a!", "b!", "c!", "d!"]
- *     a                      #=> ["a", "b", "c", "d"]
+ *  Returns a new \Enumerator if no block given:
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.map
+ *    a1 # => #<Enumerator: [:foo, "bar", 2]:map>
+ *
+ *  Array#collect is an alias for Array#map.
  */
 
 static VALUE
@@ -2257,10 +3828,10 @@ rb_ary_collect(VALUE ary)
     long i;
     VALUE collect;
 
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     collect = rb_ary_new2(RARRAY_LEN(ary));
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	rb_ary_push(collect, rb_yield(RARRAY_PTR(ary)[i]));
+        rb_ary_push(collect, rb_yield(RARRAY_AREF(ary, i)));
     }
     return collect;
 }
@@ -2268,20 +3839,22 @@ rb_ary_collect(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.collect! {|item| block }   -> ary
- *     ary.map!     {|item| block }   -> ary
- *     ary.collect                    -> an_enumerator
- *     ary.map                        -> an_enumerator
+ *    array.map! {|element| ... } -> self
+ *    array.map! -> new_enumerator
  *
- *  Invokes the block once for each element of +self+, replacing the
- *  element with the value returned by +block+.
- *  See also Enumerable#collect.
+ *  Calls the block, if given, with each element;
+ *  replaces the element with the block's return value:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    a = [:foo, 'bar', 2]
+ *    a.map! { |element| element.class } # => [Symbol, String, Integer]
  *
- *     a = [ "a", "b", "c", "d" ]
- *     a.map! {|x| x + "!" }
- *     a #=>  [ "a!", "b!", "c!", "d!" ]
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.map!
+ *    a1 # => #<Enumerator: [:foo, "bar", 2]:map!>
+ *
+ *  Array#collect! is an alias for Array#map!.
  */
 
 static VALUE
@@ -2289,78 +3862,143 @@ rb_ary_collect_bang(VALUE ary)
 {
     long i;
 
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_modify(ary);
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	rb_ary_store(ary, i, rb_yield(RARRAY_PTR(ary)[i]));
+        rb_ary_store(ary, i, rb_yield(RARRAY_AREF(ary, i)));
     }
     return ary;
 }
 
 VALUE
-rb_get_values_at(VALUE obj, long olen, int argc, VALUE *argv, VALUE (*func) (VALUE, long))
+rb_get_values_at(VALUE obj, long olen, int argc, const VALUE *argv, VALUE (*func) (VALUE, long))
 {
     VALUE result = rb_ary_new2(argc);
     long beg, len, i, j;
 
     for (i=0; i<argc; i++) {
-	if (FIXNUM_P(argv[i])) {
-	    rb_ary_push(result, (*func)(obj, FIX2LONG(argv[i])));
-	    continue;
-	}
-	/* check if idx is Range */
-	switch (rb_range_beg_len(argv[i], &beg, &len, olen, 0)) {
-	  case Qfalse:
-	    break;
-	  case Qnil:
-	    continue;
-	  default:
-	    for (j=0; j<len; j++) {
-		rb_ary_push(result, (*func)(obj, j+beg));
-	    }
-	    continue;
-	}
-	rb_ary_push(result, (*func)(obj, NUM2LONG(argv[i])));
+        if (FIXNUM_P(argv[i])) {
+            rb_ary_push(result, (*func)(obj, FIX2LONG(argv[i])));
+            continue;
+        }
+        /* check if idx is Range */
+        if (rb_range_beg_len(argv[i], &beg, &len, olen, 1)) {
+            long end = olen < beg+len ? olen : beg+len;
+            for (j = beg; j < end; j++) {
+                rb_ary_push(result, (*func)(obj, j));
+            }
+            if (beg + len > j)
+                rb_ary_resize(result, RARRAY_LEN(result) + (beg + len) - j);
+            continue;
+        }
+        rb_ary_push(result, (*func)(obj, NUM2LONG(argv[i])));
     }
     return result;
 }
 
+static VALUE
+append_values_at_single(VALUE result, VALUE ary, long olen, VALUE idx)
+{
+    long beg, len;
+    if (FIXNUM_P(idx)) {
+        beg = FIX2LONG(idx);
+    }
+    /* check if idx is Range */
+    else if (rb_range_beg_len(idx, &beg, &len, olen, 1)) {
+        if (len > 0) {
+            const VALUE *const src = RARRAY_CONST_PTR_TRANSIENT(ary);
+            const long end = beg + len;
+            const long prevlen = RARRAY_LEN(result);
+            if (beg < olen) {
+                rb_ary_cat(result, src + beg, end > olen ? olen-beg : len);
+            }
+            if (end > olen) {
+                rb_ary_store(result, prevlen + len - 1, Qnil);
+            }
+        }
+        return result;
+    }
+    else {
+        beg = NUM2LONG(idx);
+    }
+    return rb_ary_push(result, rb_ary_entry(ary, beg));
+}
+
 /*
  *  call-seq:
- *     ary.values_at(selector,... )  -> new_ary
- *
- *  Returns an array containing the elements in
- *  +self+ corresponding to the given selector(s). The selectors
- *  may be either integer indices or ranges.
- *  See also Array#select.
- *
- *     a = %w{ a b c d e f }
- *     a.values_at(1, 3, 5)
- *     a.values_at(1, 3, 5, 7)
- *     a.values_at(-1, -3, -5, -7)
- *     a.values_at(1..3, 2...5)
+ *    array.values_at(*indexes) -> new_array
+ *
+ *  Returns a new \Array whose elements are the elements
+ *  of +self+ at the given \Integer or \Range +indexes+.
+ *
+ *  For each positive +index+, returns the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, 2) # => [:foo, 2]
+ *    a.values_at(0..1) # => [:foo, "bar"]
+ *
+ *  The given +indexes+ may be in any order, and may repeat:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(2, 0, 1, 0, 2) # => [2, :foo, "bar", :foo, 2]
+ *    a.values_at(1, 0..2) # => ["bar", :foo, "bar", 2]
+ *
+ *  Assigns +nil+ for an +index+ that is too large:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, 3, 1, 3) # => [:foo, nil, "bar", nil]
+ *
+ *  Returns a new empty \Array if no arguments given.
+ *
+ *  For each negative +index+, counts backward from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(-1, -3) # => [2, :foo]
+ *
+ *  Assigns +nil+ for an +index+ that is too small:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, -5, 1, -6, 2) # => [:foo, nil, "bar", nil, 2]
+ *
+ *  The given +indexes+ may have a mixture of signs:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.values_at(0, -2, 1, -1) # => [:foo, "bar", "bar", 2]
+ *
  */
 
 static VALUE
 rb_ary_values_at(int argc, VALUE *argv, VALUE ary)
 {
-    return rb_get_values_at(ary, RARRAY_LEN(ary), argc, argv, rb_ary_entry);
+    long i, olen = RARRAY_LEN(ary);
+    VALUE result = rb_ary_new_capa(argc);
+    for (i = 0; i < argc; ++i) {
+        append_values_at_single(result, ary, olen, argv[i]);
+    }
+    RB_GC_GUARD(ary);
+    return result;
 }
 
 
 /*
  *  call-seq:
- *     ary.select {|item| block } -> new_ary
- *     ary.select                 -> an_enumerator
+ *    array.select {|element| ... } -> new_array
+ *    array.select -> new_enumerator
+ *
+ *  Calls the block, if given, with each element of +self+;
+ *  returns a new \Array containing those elements of +self+
+ *  for which the block returns a truthy value:
  *
- *  Invokes the block passing in successive elements from +self+,
- *  returning an array containing those elements for which the block
- *  returns a true value (equivalent to Enumerable#select).
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a1 = a.select {|element| element.to_s.start_with?('b') }
+ *    a1 # => ["bar", :bam]
  *
- *  If no block is given, an enumerator is returned instead.
+ *  Returns a new \Enumerator if no block given:
  *
- *     a = %w{ a b c d e f }
- *     a.select {|v| v =~ /[aeiou]/}   #=> ["a", "e"]
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select # => #<Enumerator: [:foo, "bar", 2, :bam]:select>
+ *
+ *  Array#filter is an alias for Array#select.
  */
 
 static VALUE
@@ -2369,93 +4007,170 @@ rb_ary_select(VALUE ary)
     VALUE result;
     long i;
 
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     result = rb_ary_new2(RARRAY_LEN(ary));
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	if (RTEST(rb_yield(RARRAY_PTR(ary)[i]))) {
-	    rb_ary_push(result, rb_ary_elt(ary, i));
-	}
+        if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
+            rb_ary_push(result, rb_ary_elt(ary, i));
+        }
     }
     return result;
 }
 
+struct select_bang_arg {
+    VALUE ary;
+    long len[2];
+};
+
+static VALUE
+select_bang_i(VALUE a)
+{
+    volatile struct select_bang_arg *arg = (void *)a;
+    VALUE ary = arg->ary;
+    long i1, i2;
+
+    for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); arg->len[0] = ++i1) {
+        VALUE v = RARRAY_AREF(ary, i1);
+        if (!RTEST(rb_yield(v))) continue;
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, v);
+        }
+        arg->len[1] = ++i2;
+    }
+    return (i1 == i2) ? Qnil : ary;
+}
+
+static VALUE
+select_bang_ensure(VALUE a)
+{
+    volatile struct select_bang_arg *arg = (void *)a;
+    VALUE ary = arg->ary;
+    long len = RARRAY_LEN(ary);
+    long i1 = arg->len[0], i2 = arg->len[1];
+
+    if (i2 < len && i2 < i1) {
+        long tail = 0;
+        rb_ary_modify(ary);
+        if (i1 < len) {
+            tail = len - i1;
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+                    MEMMOVE(ptr + i2, ptr + i1, VALUE, tail);
+                });
+        }
+        ARY_SET_LEN(ary, i2 + tail);
+    }
+    return ary;
+}
+
 /*
  *  call-seq:
- *     ary.select! {|item| block } -> ary or nil
- *     ary.select!                 -> an_enumerator
+ *    array.select! {|element| ... } -> self or nil
+ *    array.select! -> new_enumerator
+ *
+ *  Calls the block, if given  with each element of +self+;
+ *  removes from +self+ those elements for which the block returns +false+ or +nil+.
+ *
+ *  Returns +self+ if any elements were removed:
+ *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select! {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
  *
- *  Invokes the block passing in successive elements from
- *  +self+, deleting elements for which the block returns a
- *  false value. It returns +self+ if changes were made,
- *  otherwise it returns <code>nil</code>.
- *  See also Array#keep_if
+ *  Returns +nil+ if no elements were removed.
  *
- *  If no block is given, an enumerator is returned instead.
+ *  Returns a new \Enumerator if no block given:
  *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select! # => #<Enumerator: [:foo, "bar", 2, :bam]:select!>
+ *
+ *  Array#filter! is an alias for Array#select!.
  */
 
 static VALUE
 rb_ary_select_bang(VALUE ary)
 {
-    long i1, i2;
+    struct select_bang_arg args;
 
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_modify(ary);
-    for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); i1++) {
-	VALUE v = RARRAY_PTR(ary)[i1];
-	if (!RTEST(rb_yield(v))) continue;
-	if (i1 != i2) {
-	    rb_ary_store(ary, i2, v);
-	}
-	i2++;
-    }
 
-    if (RARRAY_LEN(ary) == i2) return Qnil;
-    if (i2 < RARRAY_LEN(ary))
-	ARY_SET_LEN(ary, i2);
-    return ary;
+    args.ary = ary;
+    args.len[0] = args.len[1] = 0;
+    return rb_ensure(select_bang_i, (VALUE)&args, select_bang_ensure, (VALUE)&args);
 }
 
 /*
  *  call-seq:
- *     ary.keep_if {|item| block } -> ary
- *     ary.keep_if                 -> an_enumerator
+ *    array.keep_if {|element| ... } -> self
+ *    array.keep_if -> new_enumeration
+ *
+ *  Retains those elements for which the block returns a truthy value;
+ *  deletes all other elements; returns +self+:
  *
- *  Deletes every element of +self+ for which +block+ evaluates
- *  to false.
- *  See also Array#select!
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.keep_if {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
  *
- *  If no block is given, an enumerator is returned instead.
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.keep_if # => #<Enumerator: [:foo, "bar", 2, :bam]:keep_if>
  *
- *     a = %w{ a b c d e f }
- *     a.keep_if {|v| v =~ /[aeiou]/}   #=> ["a", "e"]
  */
 
 static VALUE
 rb_ary_keep_if(VALUE ary)
 {
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_select_bang(ary);
     return ary;
 }
 
+static void
+ary_resize_smaller(VALUE ary, long len)
+{
+    rb_ary_modify(ary);
+    if (RARRAY_LEN(ary) > len) {
+        ARY_SET_LEN(ary, len);
+        if (len * 2 < ARY_CAPA(ary) &&
+            ARY_CAPA(ary) > ARY_DEFAULT_SIZE) {
+            ary_resize_capa(ary, len * 2);
+        }
+    }
+}
+
 /*
  *  call-seq:
- *     ary.delete(obj)            -> obj or nil
- *     ary.delete(obj) { block }  -> obj or nil
- *
- *  Deletes items from +self+ that are equal to +obj+.
- *  If any items are found, returns +obj+.   If
- *  the item is not found, returns <code>nil</code>. If the optional
- *  code block is given, returns the result of +block+ if the item
- *  is not found.  (To remove <code>nil</code> elements and
- *  get an informative return value, use #compact!)
- *
- *     a = [ "a", "b", "b", "b", "c" ]
- *     a.delete("b")                   #=> "b"
- *     a                               #=> ["a", "c"]
- *     a.delete("z")                   #=> nil
- *     a.delete("z") { "not found" }   #=> "not found"
+ *    array.delete(obj) -> deleted_object
+ *    array.delete(obj) {|nosuch| ... } -> deleted_object or block_return
+ *
+ *  Removes zero or more elements from +self+.
+ *
+ *  When no block is given,
+ *  removes from +self+ each element +ele+ such that <tt>ele == obj</tt>;
+ *  returns the last deleted element:
+ *
+ *    s1 = 'bar'; s2 = 'bar'
+ *    a = [:foo, s1, 2, s2]
+ *    a.delete('bar') # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  Returns +nil+ if no elements removed.
+ *
+ *  When a block is given,
+ *  removes from +self+ each element +ele+ such that <tt>ele == obj</tt>.
+ *
+ *  If any such elements are found, ignores the block
+ *  and returns the last deleted element:
+ *
+ *    s1 = 'bar'; s2 = 'bar'
+ *    a = [:foo, s1, 2, s2]
+ *    deleted_obj = a.delete('bar') {|obj| fail 'Cannot happen' }
+ *    a # => [:foo, 2]
+ *
+ *  If no such elements are found, returns the block's return value:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete(:nosuch) {|obj| "#{obj} not found" } # => "nosuch not found"
+ *
  */
 
 VALUE
@@ -2465,36 +4180,53 @@ rb_ary_delete(VALUE ary, VALUE item)
     long i1, i2;
 
     for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); i1++) {
-	VALUE e = RARRAY_PTR(ary)[i1];
+        VALUE e = RARRAY_AREF(ary, i1);
 
-	if (rb_equal(e, item)) {
-	    v = e;
-	    continue;
-	}
-	if (i1 != i2) {
-	    rb_ary_store(ary, i2, e);
-	}
-	i2++;
+        if (rb_equal(e, item)) {
+            v = e;
+            continue;
+        }
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, e);
+        }
+        i2++;
     }
     if (RARRAY_LEN(ary) == i2) {
-	if (rb_block_given_p()) {
-	    return rb_yield(item);
-	}
-	return Qnil;
+        if (rb_block_given_p()) {
+            return rb_yield(item);
+        }
+        return Qnil;
     }
 
-    rb_ary_modify(ary);
-    if (RARRAY_LEN(ary) > i2) {
-	ARY_SET_LEN(ary, i2);
-	if (i2 * 2 < ARY_CAPA(ary) &&
-	    ARY_CAPA(ary) > ARY_DEFAULT_SIZE) {
-	    ary_resize_capa(ary, i2*2);
-	}
-    }
+    ary_resize_smaller(ary, i2);
 
+    ary_verify(ary);
     return v;
 }
 
+void
+rb_ary_delete_same(VALUE ary, VALUE item)
+{
+    long i1, i2;
+
+    for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); i1++) {
+        VALUE e = RARRAY_AREF(ary, i1);
+
+        if (e == item) {
+            continue;
+        }
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, e);
+        }
+        i2++;
+    }
+    if (RARRAY_LEN(ary) == i2) {
+        return;
+    }
+
+    ary_resize_smaller(ary, i2);
+}
+
 VALUE
 rb_ary_delete_at(VALUE ary, long pos)
 {
@@ -2503,31 +4235,41 @@ rb_ary_delete_at(VALUE ary, long pos)
 
     if (pos >= len) return Qnil;
     if (pos < 0) {
-	pos += len;
-	if (pos < 0) return Qnil;
+        pos += len;
+        if (pos < 0) return Qnil;
     }
 
     rb_ary_modify(ary);
-    del = RARRAY_PTR(ary)[pos];
-    MEMMOVE(RARRAY_PTR(ary)+pos, RARRAY_PTR(ary)+pos+1, VALUE,
-	    RARRAY_LEN(ary)-pos-1);
+    del = RARRAY_AREF(ary, pos);
+    RARRAY_PTR_USE_TRANSIENT(ary, ptr, {
+        MEMMOVE(ptr+pos, ptr+pos+1, VALUE, len-pos-1);
+    });
     ARY_INCREASE_LEN(ary, -1);
-
+    ary_verify(ary);
     return del;
 }
 
 /*
  *  call-seq:
- *     ary.delete_at(index)  -> obj or nil
+ *    array.delete_at(index) -> deleted_object or nil
+ *
+ *  Deletes an element from +self+, per the given \Integer +index+.
+ *
+ *  When +index+ is non-negative, deletes the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_at(1) # => "bar"
+ *    a # => [:foo, 2]
  *
- *  Deletes the element at the specified index, returning that element,
- *  or <code>nil</code> if the index is out of range. See also
- *  Array#slice!.
+ *  If index is too large, returns +nil+.
  *
- *     a = ["ant", "bat", "cat", "dog"]
- *     a.delete_at(2)    #=> "cat"
- *     a                 #=> ["ant", "bat", "dog"]
- *     a.delete_at(99)   #=> nil
+ *  When +index+ is negative, counts backward from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_at(-2) # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  If +index+ is too small (far from zero), returns nil.
  */
 
 static VALUE
@@ -2536,71 +4278,133 @@ rb_ary_delete_at_m(VALUE ary, VALUE pos)
     return rb_ary_delete_at(ary, NUM2LONG(pos));
 }
 
+static VALUE
+ary_slice_bang_by_rb_ary_splice(VALUE ary, long pos, long len)
+{
+    const long orig_len = RARRAY_LEN(ary);
+
+    if (len < 0) {
+        return Qnil;
+    }
+    else if (pos < -orig_len) {
+        return Qnil;
+    }
+    else if (pos < 0) {
+        pos += orig_len;
+    }
+    else if (orig_len < pos) {
+        return Qnil;
+    }
+    if (orig_len < pos + len) {
+        len = orig_len - pos;
+    }
+    if (len == 0) {
+        return rb_ary_new2(0);
+    }
+    else {
+        VALUE arg2 = rb_ary_new4(len, RARRAY_CONST_PTR_TRANSIENT(ary)+pos);
+        rb_ary_splice(ary, pos, len, 0, 0);
+        return arg2;
+    }
+}
+
 /*
  *  call-seq:
- *     ary.slice!(index)         -> obj or nil
- *     ary.slice!(start, length) -> new_ary or nil
- *     ary.slice!(range)         -> new_ary or nil
- *
- *  Deletes the element(s) given by an index (optionally with a length)
- *  or by a range. Returns the deleted object (or objects), or
- *  <code>nil</code> if the index is out of range.
- *
- *     a = [ "a", "b", "c" ]
- *     a.slice!(1)     #=> "b"
- *     a               #=> ["a", "c"]
- *     a.slice!(-1)    #=> "c"
- *     a               #=> ["a"]
- *     a.slice!(100)   #=> nil
- *     a               #=> ["a"]
+ *    array.slice!(n) -> object or nil
+ *    array.slice!(start, length) -> new_array or nil
+ *    array.slice!(range) -> new_array or nil
+ *
+ *  Removes and returns elements from +self+.
+ *
+ *  When the only argument is an \Integer +n+,
+ *  removes and returns the _nth_ element in +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(1) # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  If +n+ is negative, counts backwards from the end of +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(-1) # => 2
+ *    a # => [:foo, "bar"]
+ *
+ *  If +n+ is out of range, returns +nil+.
+ *
+ *  When the only arguments are Integers +start+ and +length+,
+ *  removes +length+ elements from +self+ beginning at offset  +start+;
+ *  returns the deleted objects in a new \Array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(0, 2) # => [:foo, "bar"]
+ *    a # => [2]
+ *
+ *  If <tt>start + length</tt> exceeds the array size,
+ *  removes and returns all elements from offset +start+ to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(1, 50) # => ["bar", 2]
+ *    a # => [:foo]
+ *
+ *  If <tt>start == a.size</tt> and +length+ is non-negative,
+ *  returns a new empty \Array.
+ *
+ *  If +length+ is negative, returns +nil+.
+ *
+ *  When the only argument is a \Range object +range+,
+ *  treats <tt>range.min</tt> as +start+ above and <tt>range.size</tt> as +length+ above:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(1..2) # => ["bar", 2]
+ *    a # => [:foo]
+ *
+ *  If <tt>range.start == a.size</tt>, returns a new empty \Array.
+ *
+ *  If <tt>range.start</tt> is larger than the array size, returns +nil+.
+ *
+ *  If <tt>range.end</tt> is negative, counts backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(0..-2) # => [:foo, "bar"]
+ *    a # => [2]
+ *
+ *  If <tt>range.start</tt> is negative,
+ *  calculates the start index backwards from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.slice!(-2..2) # => ["bar", 2]
+ *    a # => [:foo]
+ *
  */
 
 static VALUE
 rb_ary_slice_bang(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE arg1, arg2;
-    long pos, len, orig_len;
+    VALUE arg1;
+    long pos, len;
 
     rb_ary_modify_check(ary);
+    rb_check_arity(argc, 1, 2);
+    arg1 = argv[0];
+
     if (argc == 2) {
-	pos = NUM2LONG(argv[0]);
-	len = NUM2LONG(argv[1]);
-      delete_pos_len:
-	if (len < 0) return Qnil;
-	orig_len = RARRAY_LEN(ary);
-	if (pos < 0) {
-	    pos += orig_len;
-	    if (pos < 0) return Qnil;
-	}
-	else if (orig_len < pos) return Qnil;
-	if (orig_len < pos + len) {
-	    len = orig_len - pos;
-	}
-	if (len == 0) return rb_ary_new2(0);
-	arg2 = rb_ary_new4(len, RARRAY_PTR(ary)+pos);
-	RBASIC(arg2)->klass = rb_obj_class(ary);
-	rb_ary_splice(ary, pos, len, Qundef);
-	return arg2;
-    }
-
-    if (argc != 1) {
-	/* error report */
-	rb_scan_args(argc, argv, "11", NULL, NULL);
+        pos = NUM2LONG(argv[0]);
+        len = NUM2LONG(argv[1]);
+        return ary_slice_bang_by_rb_ary_splice(ary, pos, len);
     }
-    arg1 = argv[0];
 
     if (!FIXNUM_P(arg1)) {
-	switch (rb_range_beg_len(arg1, &pos, &len, RARRAY_LEN(ary), 0)) {
-	  case Qtrue:
-	    /* valid range */
-	    goto delete_pos_len;
-	  case Qnil:
-	    /* invalid range */
-	    return Qnil;
-	  default:
-	    /* not a range */
-	    break;
-	}
+        switch (rb_range_beg_len(arg1, &pos, &len, RARRAY_LEN(ary), 0)) {
+          case Qtrue:
+            /* valid range */
+            return ary_slice_bang_by_rb_ary_splice(ary, pos, len);
+          case Qnil:
+            /* invalid range */
+            return Qnil;
+          default:
+            /* not a range */
+            break;
+        }
     }
 
     return rb_ary_delete_at(ary, NUM2LONG(arg1));
@@ -2612,67 +4416,88 @@ ary_reject(VALUE orig, VALUE result)
     long i;
 
     for (i = 0; i < RARRAY_LEN(orig); i++) {
-	VALUE v = RARRAY_PTR(orig)[i];
-	if (!RTEST(rb_yield(v))) {
-	    rb_ary_push_1(result, v);
-	}
+        VALUE v = RARRAY_AREF(orig, i);
+
+        if (!RTEST(rb_yield(v))) {
+            rb_ary_push(result, v);
+        }
     }
     return result;
 }
 
 static VALUE
-ary_reject_bang(VALUE ary)
+reject_bang_i(VALUE a)
 {
-    long i;
-    VALUE result = Qnil;
+    volatile struct select_bang_arg *arg = (void *)a;
+    VALUE ary = arg->ary;
+    long i1, i2;
 
-    rb_ary_modify_check(ary);
-    for (i = 0; i < RARRAY_LEN(ary); ) {
-	VALUE v = RARRAY_PTR(ary)[i];
-	if (RTEST(rb_yield(v))) {
-	    rb_ary_delete_at(ary, i);
-	    result = ary;
-	}
-	else {
-	    i++;
-	}
+    for (i1 = i2 = 0; i1 < RARRAY_LEN(ary); arg->len[0] = ++i1) {
+        VALUE v = RARRAY_AREF(ary, i1);
+        if (RTEST(rb_yield(v))) continue;
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, v);
+        }
+        arg->len[1] = ++i2;
     }
-    return result;
+    return (i1 == i2) ? Qnil : ary;
+}
+
+static VALUE
+ary_reject_bang(VALUE ary)
+{
+    struct select_bang_arg args;
+    rb_ary_modify_check(ary);
+    args.ary = ary;
+    args.len[0] = args.len[1] = 0;
+    return rb_ensure(reject_bang_i, (VALUE)&args, select_bang_ensure, (VALUE)&args);
 }
 
 /*
  *  call-seq:
- *     ary.reject! {|item| block }  -> ary or nil
- *     ary.reject!                  -> an_enumerator
+ *    array.reject! {|element| ... } -> self or nil
+ *    array.reject! -> new_enumerator
+ *
+ *  Removes each element for which the block returns a truthy value.
  *
- *  Equivalent to Array#delete_if, deleting elements from
- *  +self+ for which the block evaluates to true, but returns
- *  <code>nil</code> if no changes were made.
- *  The array is changed instantly every time the block is called and
- *  not after the iteration is over.
- *  See also Enumerable#reject and Array#delete_if.
+ *  Returns +self+ if any elements removed:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a.reject! {|element| element.to_s.start_with?('b') } # => [:foo, 2]
+ *
+ *  Returns +nil+ if no elements removed.
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.reject! # => #<Enumerator: [:foo, "bar", 2]:reject!>
  *
  */
 
 static VALUE
 rb_ary_reject_bang(VALUE ary)
 {
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
+    rb_ary_modify(ary);
     return ary_reject_bang(ary);
 }
 
 /*
  *  call-seq:
- *     ary.reject {|item| block }  -> new_ary
- *     ary.reject                  -> an_enumerator
+ *    array.reject {|element| ... } -> new_array
+ *    array.reject -> new_enumerator
+ *
+ *  Returns a new \Array whose elements are all those from +self+
+ *  for which the block returns +false+ or +nil+:
  *
- *  Returns a new array containing the items in +self+
- *  for which the block is not true.
- *  See also Array#delete_if
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a1 = a.reject {|element| element.to_s.start_with?('b') }
+ *    a1 # => [:foo, 2]
  *
- *  If no block is given, an enumerator is returned instead.
+ *  Returns a new \Enumerator if no block given:
+ *
+ *     a = [:foo, 'bar', 2]
+ *     a.reject # => #<Enumerator: [:foo, "bar", 2]:reject>
  *
  */
 
@@ -2681,7 +4506,7 @@ rb_ary_reject(VALUE ary)
 {
     VALUE rejected_ary;
 
-    RETURN_ENUMERATOR(ary, 0, 0);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rejected_ary = rb_ary_new();
     ary_reject(ary, rejected_ary);
     return rejected_ary;
@@ -2689,35 +4514,38 @@ rb_ary_reject(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.delete_if {|item| block }  -> ary
- *     ary.delete_if                  -> an_enumerator
+ *    array.delete_if {|element| ... } -> self
+ *    array.delete_if -> Enumerator
  *
- *  Deletes every element of +self+ for which +block+ evaluates
- *  to true.
- *  The array is changed instantly every time the block is called and
- *  not after the iteration is over.
- *  See also Array#reject!
+ *  Removes each element in +self+ for which the block returns a truthy value;
+ *  returns +self+:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a.delete_if {|element| element.to_s.start_with?('b') } # => [:foo, 2]
  *
- *     a = [ "a", "b", "c" ]
- *     a.delete_if {|x| x >= "b" }   #=> ["a"]
- */
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_if # => #<Enumerator: [:foo, "bar", 2]:delete_if>
+ *
+3 */
 
 static VALUE
 rb_ary_delete_if(VALUE ary)
 {
-    RETURN_ENUMERATOR(ary, 0, 0);
+    ary_verify(ary);
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     ary_reject_bang(ary);
     return ary;
 }
 
 static VALUE
-take_i(VALUE val, VALUE *args, int argc, VALUE *argv)
+take_i(RB_BLOCK_CALL_FUNC_ARGLIST(val, cbarg))
 {
-    if (args[1]-- == 0) rb_iter_break();
+    VALUE *args = (VALUE *)cbarg;
     if (argc > 1) val = rb_ary_new4(argc, argv);
     rb_ary_push(args[0], val);
+    if (--args[1] == 0) rb_iter_break();
     return Qnil;
 }
 
@@ -2727,76 +4555,141 @@ take_items(VALUE obj, long n)
     VALUE result = rb_check_array_type(obj);
     VALUE args[2];
 
+    if (n == 0) return result;
     if (!NIL_P(result)) return rb_ary_subseq(result, 0, n);
     result = rb_ary_new2(n);
     args[0] = result; args[1] = (VALUE)n;
-    rb_block_call(obj, rb_intern("each"), 0, 0, take_i, (VALUE)args);
+    if (UNDEF_P(rb_check_block_call(obj, idEach, 0, 0, take_i, (VALUE)args)))
+        rb_raise(rb_eTypeError, "wrong argument type %"PRIsVALUE" (must respond to :each)",
+                 rb_obj_class(obj));
     return result;
 }
 
 
 /*
  *  call-seq:
- *     ary.zip(arg, ...)                   -> new_ary
- *     ary.zip(arg, ...) {| arr | block }  -> nil
- *
- *  Converts any arguments to arrays, then merges elements of
- *  +self+ with corresponding elements from each argument. This
- *  generates a sequence of <code>self.size</code> <em>n</em>-element
- *  arrays, where <em>n</em> is one more that the count of arguments. If
- *  the size of any argument is less than <code>enumObj.size</code>,
- *  <code>nil</code> values are supplied. If a block is given, it is
- *  invoked for each output array, otherwise an array of arrays is
- *  returned.
- *
- *     a = [ 4, 5, 6 ]
- *     b = [ 7, 8, 9 ]
- *     [1,2,3].zip(a, b)      #=> [[1, 4, 7], [2, 5, 8], [3, 6, 9]]
- *     [1,2].zip(a,b)         #=> [[1, 4, 7], [2, 5, 8]]
- *     a.zip([1,2],[8])       #=> [[4,1,8], [5,2,nil], [6,nil,nil]]
+ *    array.zip(*other_arrays) -> new_array
+ *    array.zip(*other_arrays) {|other_array| ... } -> nil
+ *
+ *  When no block given, returns a new \Array +new_array+ of size <tt>self.size</tt>
+ *  whose elements are Arrays.
+ *
+ *  Each nested array <tt>new_array[n]</tt> is of size <tt>other_arrays.size+1</tt>,
+ *  and contains:
+ *
+ *  - The _nth_ element of +self+.
+ *  - The _nth_ element of each of the +other_arrays+.
+ *
+ *  If all +other_arrays+ and +self+ are the same size:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3]
+ *    c = [:c0, :c1, :c2, :c3]
+ *    d = a.zip(b, c)
+ *    d # => [[:a0, :b0, :c0], [:a1, :b1, :c1], [:a2, :b2, :c2], [:a3, :b3, :c3]]
+ *
+ *  If any array in +other_arrays+ is smaller than +self+,
+ *  fills to <tt>self.size</tt> with +nil+:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2]
+ *    c = [:c0, :c1]
+ *    d = a.zip(b, c)
+ *    d # => [[:a0, :b0, :c0], [:a1, :b1, :c1], [:a2, :b2, nil], [:a3, nil, nil]]
+ *
+ *  If any array in +other_arrays+ is larger than +self+,
+ *  its trailing elements are ignored:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3, :b4]
+ *    c = [:c0, :c1, :c2, :c3, :c4, :c5]
+ *    d = a.zip(b, c)
+ *    d # => [[:a0, :b0, :c0], [:a1, :b1, :c1], [:a2, :b2, :c2], [:a3, :b3, :c3]]
+ *
+ *  When a block is given, calls the block with each of the sub-arrays (formed as above); returns +nil+:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3]
+ *    c = [:c0, :c1, :c2, :c3]
+ *    a.zip(b, c) {|sub_array| p sub_array} # => nil
+ *
+ *  Output:
+ *
+ *    [:a0, :b0, :c0]
+ *    [:a1, :b1, :c1]
+ *    [:a2, :b2, :c2]
+ *    [:a3, :b3, :c3]
+ *
  */
 
 static VALUE
 rb_ary_zip(int argc, VALUE *argv, VALUE ary)
 {
     int i, j;
-    long len;
+    long len = RARRAY_LEN(ary);
     VALUE result = Qnil;
 
-    len = RARRAY_LEN(ary);
     for (i=0; i<argc; i++) {
-	argv[i] = take_items(argv[i], len);
+        argv[i] = take_items(argv[i], len);
     }
-    if (!rb_block_given_p()) {
-	result = rb_ary_new2(len);
+
+    if (rb_block_given_p()) {
+        int arity = rb_block_arity();
+
+        if (arity > 1) {
+            VALUE work, *tmp;
+
+            tmp = ALLOCV_N(VALUE, work, argc+1);
+
+            for (i=0; i<RARRAY_LEN(ary); i++) {
+                tmp[0] = RARRAY_AREF(ary, i);
+                for (j=0; j<argc; j++) {
+                    tmp[j+1] = rb_ary_elt(argv[j], i);
+                }
+                rb_yield_values2(argc+1, tmp);
+            }
+
+            if (work) ALLOCV_END(work);
+        }
+        else {
+            for (i=0; i<RARRAY_LEN(ary); i++) {
+                VALUE tmp = rb_ary_new2(argc+1);
+
+                rb_ary_push(tmp, RARRAY_AREF(ary, i));
+                for (j=0; j<argc; j++) {
+                    rb_ary_push(tmp, rb_ary_elt(argv[j], i));
+                }
+                rb_yield(tmp);
+            }
+        }
     }
+    else {
+        result = rb_ary_new_capa(len);
 
-    for (i=0; i<RARRAY_LEN(ary); i++) {
-	VALUE tmp = rb_ary_new2(argc+1);
-
-	rb_ary_push(tmp, rb_ary_elt(ary, i));
-	for (j=0; j<argc; j++) {
-	    rb_ary_push(tmp, rb_ary_elt(argv[j], i));
-	}
-	if (NIL_P(result)) {
-	    rb_yield(tmp);
-	}
-	else {
-	    rb_ary_push(result, tmp);
-	}
+        for (i=0; i<len; i++) {
+            VALUE tmp = rb_ary_new_capa(argc+1);
+
+            rb_ary_push(tmp, RARRAY_AREF(ary, i));
+            for (j=0; j<argc; j++) {
+                rb_ary_push(tmp, rb_ary_elt(argv[j], i));
+            }
+            rb_ary_push(result, tmp);
+        }
     }
+
     return result;
 }
 
 /*
  *  call-seq:
- *     ary.transpose -> new_ary
+ *    array.transpose -> new_array
  *
- *  Assumes that +self+ is an array of arrays and transposes the
- *  rows and columns.
+ *  Transposes the rows and columns in an \Array of Arrays;
+ *  the nested Arrays must all be the same size:
+ *
+ *    a = [[:a0, :a1], [:b0, :b1], [:c0, :c1]]
+ *    a.transpose # => [[:a0, :b0, :c0], [:a1, :b1, :c1]]
  *
- *     a = [[1,2], [3,4], [5,6]]
- *     a.transpose   #=> [[1, 3, 5], [2, 4, 6]]
  */
 
 static VALUE
@@ -2808,35 +4701,34 @@ rb_ary_transpose(VALUE ary)
     alen = RARRAY_LEN(ary);
     if (alen == 0) return rb_ary_dup(ary);
     for (i=0; i<alen; i++) {
-	tmp = to_ary(rb_ary_elt(ary, i));
-	if (elen < 0) {		/* first element */
-	    elen = RARRAY_LEN(tmp);
-	    result = rb_ary_new2(elen);
-	    for (j=0; j<elen; j++) {
-		rb_ary_store(result, j, rb_ary_new2(alen));
-	    }
-	}
-	else if (elen != RARRAY_LEN(tmp)) {
-	    rb_raise(rb_eIndexError, "element size differs (%ld should be %ld)",
-		     RARRAY_LEN(tmp), elen);
-	}
-	for (j=0; j<elen; j++) {
-	    rb_ary_store(rb_ary_elt(result, j), i, rb_ary_elt(tmp, j));
-	}
+        tmp = to_ary(rb_ary_elt(ary, i));
+        if (elen < 0) {		/* first element */
+            elen = RARRAY_LEN(tmp);
+            result = rb_ary_new2(elen);
+            for (j=0; j<elen; j++) {
+                rb_ary_store(result, j, rb_ary_new2(alen));
+            }
+        }
+        else if (elen != RARRAY_LEN(tmp)) {
+            rb_raise(rb_eIndexError, "element size differs (%ld should be %ld)",
+                     RARRAY_LEN(tmp), elen);
+        }
+        for (j=0; j<elen; j++) {
+            rb_ary_store(rb_ary_elt(result, j), i, rb_ary_elt(tmp, j));
+        }
     }
     return result;
 }
 
 /*
  *  call-seq:
- *     ary.replace(other_ary)  -> ary
+ *    array.replace(other_array) -> self
+ *
+ *  Replaces the content of +self+ with the content of +other_array+; returns +self+:
  *
- *  Replaces the contents of +self+ with the contents of
- *  +other_ary+, truncating or expanding if necessary.
+ *    a = [:foo, 'bar', 2]
+ *    a.replace(['foo', :bar, 3]) # => ["foo", :bar, 3]
  *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a.replace([ "x", "y", "z" ])   #=> ["x", "y", "z"]
- *     a                              #=> ["x", "y", "z"]
  */
 
 VALUE
@@ -2846,290 +4738,490 @@ rb_ary_replace(VALUE copy, VALUE orig)
     orig = to_ary(orig);
     if (copy == orig) return copy;
 
-    if (RARRAY_LEN(orig) <= RARRAY_EMBED_LEN_MAX) {
-        VALUE *ptr;
-        VALUE shared = 0;
+    rb_ary_reset(copy);
 
-        if (ARY_OWNS_HEAP_P(copy)) {
-            xfree(RARRAY_PTR(copy));
-        }
-        else if (ARY_SHARED_P(copy)) {
-            shared = ARY_SHARED(copy);
-            FL_UNSET_SHARED(copy);
-        }
-        FL_SET_EMBED(copy);
-        ptr = RARRAY_PTR(orig);
-        MEMCPY(RARRAY_PTR(copy), ptr, VALUE, RARRAY_LEN(orig));
-        if (shared) {
-            rb_ary_decrement_share(shared);
-        }
-        ARY_SET_LEN(copy, RARRAY_LEN(orig));
+    /* orig has enough space to embed the contents of orig. */
+    if (RARRAY_LEN(orig) <= ary_embed_capa(copy)) {
+        assert(ARY_EMBED_P(copy));
+        ary_memcpy(copy, 0, RARRAY_LEN(orig), RARRAY_CONST_PTR_TRANSIENT(orig));
+        ARY_SET_EMBED_LEN(copy, RARRAY_LEN(orig));
+    }
+#if USE_RVARGC
+    /* orig is embedded but copy does not have enough space to embed the
+     * contents of orig. */
+    else if (ARY_EMBED_P(orig)) {
+        long len = ARY_EMBED_LEN(orig);
+        VALUE *ptr = ary_heap_alloc(copy, len);
+
+        FL_UNSET_EMBED(copy);
+        ARY_SET_PTR(copy, ptr);
+        ARY_SET_LEN(copy, len);
+        ARY_SET_CAPA(copy, len);
+
+        // No allocation and exception expected that could leave `copy` in a
+        // bad state from the edits above.
+        ary_memcpy(copy, 0, len, RARRAY_CONST_PTR_TRANSIENT(orig));
     }
+#endif
+    /* Otherwise, orig is on heap and copy does not have enough space to embed
+     * the contents of orig. */
     else {
-        VALUE shared = ary_make_shared(orig);
-        if (ARY_OWNS_HEAP_P(copy)) {
-            xfree(RARRAY_PTR(copy));
-        }
-        else {
-            rb_ary_unshare_safe(copy);
-        }
+        VALUE shared_root = ary_make_shared(orig);
         FL_UNSET_EMBED(copy);
-        ARY_SET_PTR(copy, RARRAY_PTR(orig));
-        ARY_SET_LEN(copy, RARRAY_LEN(orig));
-        rb_ary_set_shared(copy, shared);
+        ARY_SET_PTR(copy, ARY_HEAP_PTR(orig));
+        ARY_SET_LEN(copy, ARY_HEAP_LEN(orig));
+        rb_ary_set_shared(copy, shared_root);
     }
+    ary_verify(copy);
     return copy;
 }
 
 /*
  *  call-seq:
- *     ary.clear    -> ary
+ *     array.clear -> self
  *
- *  Removes all elements from +self+.
+ *  Removes all elements from +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.clear # => []
  *
- *     a = [ "a", "b", "c", "d", "e" ]
- *     a.clear    #=> [ ]
  */
 
 VALUE
 rb_ary_clear(VALUE ary)
 {
     rb_ary_modify_check(ary);
-    ARY_SET_LEN(ary, 0);
     if (ARY_SHARED_P(ary)) {
-	if (!ARY_EMBED_P(ary)) {
-	    rb_ary_unshare(ary);
-	    FL_SET_EMBED(ary);
-	}
+        if (!ARY_EMBED_P(ary)) {
+            rb_ary_unshare(ary);
+            FL_SET_EMBED(ary);
+            ARY_SET_EMBED_LEN(ary, 0);
+        }
     }
-    else if (ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
-	ary_resize_capa(ary, ARY_DEFAULT_SIZE * 2);
+    else {
+        ARY_SET_LEN(ary, 0);
+        if (ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
+            ary_resize_capa(ary, ARY_DEFAULT_SIZE * 2);
+        }
     }
+    ary_verify(ary);
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.fill(obj)                                -> ary
- *     ary.fill(obj, start [, length])              -> ary
- *     ary.fill(obj, range )                        -> ary
- *     ary.fill {|index| block }                    -> ary
- *     ary.fill(start [, length] ) {|index| block } -> ary
- *     ary.fill(range) {|index| block }             -> ary
- *
- *  The first three forms set the selected elements of +self+ (which
- *  may be the entire array) to +obj+. A +start+ of
- *  <code>nil</code> is equivalent to zero. A +length+ of
- *  <code>nil</code> is equivalent to <code>self.length</code>. The last three
- *  forms fill the array with the value of the block. The block is
- *  passed the absolute index of each element to be filled.
- *  Negative values of +start+ count from the end of the array.
- *
- *     a = [ "a", "b", "c", "d" ]
- *     a.fill("x")              #=> ["x", "x", "x", "x"]
- *     a.fill("z", 2, 2)        #=> ["x", "x", "z", "z"]
- *     a.fill("y", 0..1)        #=> ["y", "y", "z", "z"]
- *     a.fill {|i| i*i}         #=> [0, 1, 4, 9]
- *     a.fill(-2) {|i| i*i*i}   #=> [0, 1, 8, 27]
+ *    array.fill(obj) -> self
+ *    array.fill(obj, start) -> self
+ *    array.fill(obj, start, length) -> self
+ *    array.fill(obj, range) -> self
+ *    array.fill {|index| ... } -> self
+ *    array.fill(start) {|index| ... } -> self
+ *    array.fill(start, length) {|index| ... } -> self
+ *    array.fill(range) {|index| ... } -> self
+ *
+ *  Replaces specified elements in +self+ with specified objects; returns +self+.
+ *
+ *  With argument +obj+ and no block given, replaces all elements with that one object:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a # => ["a", "b", "c", "d"]
+ *    a.fill(:X) # => [:X, :X, :X, :X]
+ *
+ *  With arguments +obj+ and \Integer +start+, and no block given,
+ *  replaces elements based on the given start.
+ *
+ *  If +start+ is in range (<tt>0 <= start < array.size</tt>),
+ *  replaces all elements from offset +start+ through the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 2) # => ["a", "b", :X, :X]
+ *
+ *  If +start+ is too large (<tt>start >= array.size</tt>), does nothing:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 4) # => ["a", "b", "c", "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 5) # => ["a", "b", "c", "d"]
+ *
+ *  If +start+ is negative, counts from the end (starting index is <tt>start + array.size</tt>):
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -2) # => ["a", "b", :X, :X]
+ *
+ *  If +start+ is too small (less than and far from zero), replaces all elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -6) # => [:X, :X, :X, :X]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -50) # => [:X, :X, :X, :X]
+ *
+ *  With arguments +obj+, \Integer +start+, and \Integer +length+, and no block given,
+ *  replaces elements based on the given +start+ and +length+.
+ *
+ *  If +start+ is in range, replaces +length+ elements beginning at offset +start+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 1, 1) # => ["a", :X, "c", "d"]
+ *
+ *  If +start+ is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, -2, 1) # => ["a", "b", :X, "d"]
+ *
+ *  If +start+ is large (<tt>start >= array.size</tt>), extends +self+ with +nil+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 5, 0) # => ["a", "b", "c", "d", nil]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 5, 2) # => ["a", "b", "c", "d", nil, :X, :X]
+ *
+ *  If +length+ is zero or negative, replaces no elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, 1, 0) # => ["a", "b", "c", "d"]
+ *    a.fill(:X, 1, -1) # => ["a", "b", "c", "d"]
+ *
+ *  With arguments +obj+ and \Range +range+, and no block given,
+ *  replaces elements based on the given range.
+ *
+ *  If the range is positive and ascending (<tt>0 < range.begin <= range.end</tt>),
+ *  replaces elements from <tt>range.begin</tt> to <tt>range.end</tt>:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (1..1)) # => ["a", :X, "c", "d"]
+ *
+ *  If <tt>range.first</tt> is negative, replaces no elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (-1..1)) # => ["a", "b", "c", "d"]
+ *
+ *  If <tt>range.last</tt> is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (0..-2)) # => [:X, :X, :X, "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (1..-2)) # => ["a", :X, :X, "d"]
+ *
+ *  If <tt>range.last</tt> and <tt>range.last</tt> are both negative,
+ *  both count from the end of the array:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (-1..-1)) # => ["a", "b", "c", :X]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(:X, (-2..-2)) # => ["a", "b", :X, "d"]
+ *
+ *  With no arguments and a block given, calls the block with each index;
+ *  replaces the corresponding element with the block's return value:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
+ *
+ *  With argument +start+ and a block given, calls the block with each index
+ *  from offset +start+ to the end; replaces the corresponding element
+ *  with the block's return value.
+ *
+ *  If start is in range (<tt>0 <= start < array.size</tt>),
+ *  replaces from offset +start+ to the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1) { |index| "new_#{index}" } # => ["a", "new_1", "new_2", "new_3"]
+ *
+ *  If +start+ is too large(<tt>start >= array.size</tt>), does nothing:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(4) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(4) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *
+ *  If +start+ is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-2) { |index| "new_#{index}" } # => ["a", "b", "new_2", "new_3"]
+ *
+ *  If start is too small (<tt>start <= -array.size</tt>, replaces all elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-6) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-50) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "new_3"]
+ *
+ *  With arguments +start+ and +length+, and a block given,
+ *  calls the block for each index specified by start length;
+ *  replaces the corresponding element with the block's return value.
+ *
+ *  If +start+ is in range, replaces +length+ elements beginning at offset +start+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1, 1) { |index| "new_#{index}" } # => ["a", "new_1", "c", "d"]
+ *
+ *  If start is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-2, 1) { |index| "new_#{index}" } # => ["a", "b", "new_2", "d"]
+ *
+ *  If +start+ is large (<tt>start >= array.size</tt>), extends +self+ with +nil+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(5, 0) { |index| "new_#{index}" } # => ["a", "b", "c", "d", nil]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(5, 2) { |index| "new_#{index}" } # => ["a", "b", "c", "d", nil, "new_5", "new_6"]
+ *
+ *  If +length+ is zero or less, replaces no elements:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1, 0) { |index| "new_#{index}" } # => ["a", "b", "c", "d"]
+ *    a.fill(1, -1) { |index| "new_#{index}" } # => ["a", "b", "c", "d"]
+ *
+ *  With arguments +obj+ and +range+, and a block given,
+ *  calls the block with each index in the given range;
+ *  replaces the corresponding element with the block's return value.
+ *
+ *  If the range is positive and ascending (<tt>range 0 < range.begin <= range.end</tt>,
+ *  replaces elements from <tt>range.begin</tt> to <tt>range.end</tt>:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1..1) { |index| "new_#{index}" } # => ["a", "new_1", "c", "d"]
+ *
+ *  If +range.first+ is negative, does nothing:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-1..1) { |index| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *
+ *  If <tt>range.last</tt> is negative, counts from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(0..-2) { |index| "new_#{index}" } # => ["new_0", "new_1", "new_2", "d"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(1..-2) { |index| "new_#{index}" } # => ["a", "new_1", "new_2", "d"]
+ *
+ *  If <tt>range.first</tt> and <tt>range.last</tt> are both negative,
+ *  both count from the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-1..-1) { |index| "new_#{index}" } # => ["a", "b", "c", "new_3"]
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.fill(-2..-2) { |index| "new_#{index}" } # => ["a", "b", "new_2", "d"]
+ *
  */
 
 static VALUE
 rb_ary_fill(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE item, arg1, arg2;
+    VALUE item = Qundef, arg1, arg2;
     long beg = 0, end = 0, len = 0;
-    VALUE *p, *pend;
-    int block_p = FALSE;
 
     if (rb_block_given_p()) {
-	block_p = TRUE;
-	rb_scan_args(argc, argv, "02", &arg1, &arg2);
-	argc += 1;		/* hackish */
+        rb_scan_args(argc, argv, "02", &arg1, &arg2);
+        argc += 1;		/* hackish */
     }
     else {
-	rb_scan_args(argc, argv, "12", &item, &arg1, &arg2);
+        rb_scan_args(argc, argv, "12", &item, &arg1, &arg2);
     }
     switch (argc) {
       case 1:
-	beg = 0;
-	len = RARRAY_LEN(ary);
-	break;
+        beg = 0;
+        len = RARRAY_LEN(ary);
+        break;
       case 2:
-	if (rb_range_beg_len(arg1, &beg, &len, RARRAY_LEN(ary), 1)) {
-	    break;
-	}
-	/* fall through */
+        if (rb_range_beg_len(arg1, &beg, &len, RARRAY_LEN(ary), 1)) {
+            break;
+        }
+        /* fall through */
       case 3:
-	beg = NIL_P(arg1) ? 0 : NUM2LONG(arg1);
-	if (beg < 0) {
-	    beg = RARRAY_LEN(ary) + beg;
-	    if (beg < 0) beg = 0;
-	}
-	len = NIL_P(arg2) ? RARRAY_LEN(ary) - beg : NUM2LONG(arg2);
-	break;
+        beg = NIL_P(arg1) ? 0 : NUM2LONG(arg1);
+        if (beg < 0) {
+            beg = RARRAY_LEN(ary) + beg;
+            if (beg < 0) beg = 0;
+        }
+        len = NIL_P(arg2) ? RARRAY_LEN(ary) - beg : NUM2LONG(arg2);
+        break;
     }
     rb_ary_modify(ary);
     if (len < 0) {
         return ary;
     }
     if (beg >= ARY_MAX_SIZE || len > ARY_MAX_SIZE - beg) {
-	rb_raise(rb_eArgError, "argument too big");
+        rb_raise(rb_eArgError, "argument too big");
     }
     end = beg + len;
     if (RARRAY_LEN(ary) < end) {
-	if (end >= ARY_CAPA(ary)) {
-	    ary_resize_capa(ary, end);
-	}
-	rb_mem_clear(RARRAY_PTR(ary) + RARRAY_LEN(ary), end - RARRAY_LEN(ary));
-	ARY_SET_LEN(ary, end);
+        if (end >= ARY_CAPA(ary)) {
+            ary_resize_capa(ary, end);
+        }
+        ary_mem_clear(ary, RARRAY_LEN(ary), end - RARRAY_LEN(ary));
+        ARY_SET_LEN(ary, end);
     }
 
-    if (block_p) {
-	VALUE v;
-	long i;
+    if (UNDEF_P(item)) {
+        VALUE v;
+        long i;
 
-	for (i=beg; i<end; i++) {
-	    v = rb_yield(LONG2NUM(i));
-	    if (i>=RARRAY_LEN(ary)) break;
-	    RARRAY_PTR(ary)[i] = v;
-	}
+        for (i=beg; i<end; i++) {
+            v = rb_yield(LONG2NUM(i));
+            if (i>=RARRAY_LEN(ary)) break;
+            ARY_SET(ary, i, v);
+        }
     }
     else {
-	p = RARRAY_PTR(ary) + beg;
-	pend = p + len;
-	while (p < pend) {
-	    *p++ = item;
-	}
+        ary_memfill(ary, beg, len, item);
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary + other_ary   -> new_ary
+ *    array + other_array -> new_array
+ *
+ *  Returns a new \Array containing all elements of +array+
+ *  followed by all elements of +other_array+:
  *
- *  Concatenation---Returns a new array built by concatenating the
- *  two arrays together to produce a third array.
+ *    a = [0, 1] + [2, 3]
+ *    a # => [0, 1, 2, 3]
  *
- *     [ 1, 2, 3 ] + [ 4, 5 ]    #=> [ 1, 2, 3, 4, 5 ]
+ *  Related: #concat.
  */
 
 VALUE
 rb_ary_plus(VALUE x, VALUE y)
 {
     VALUE z;
-    long len;
+    long len, xlen, ylen;
 
     y = to_ary(y);
-    len = RARRAY_LEN(x) + RARRAY_LEN(y);
+    xlen = RARRAY_LEN(x);
+    ylen = RARRAY_LEN(y);
+    len = xlen + ylen;
     z = rb_ary_new2(len);
-    MEMCPY(RARRAY_PTR(z), RARRAY_PTR(x), VALUE, RARRAY_LEN(x));
-    MEMCPY(RARRAY_PTR(z) + RARRAY_LEN(x), RARRAY_PTR(y), VALUE, RARRAY_LEN(y));
+
+    ary_memcpy(z, 0, xlen, RARRAY_CONST_PTR_TRANSIENT(x));
+    ary_memcpy(z, xlen, ylen, RARRAY_CONST_PTR_TRANSIENT(y));
     ARY_SET_LEN(z, len);
     return z;
 }
 
+static VALUE
+ary_append(VALUE x, VALUE y)
+{
+    long n = RARRAY_LEN(y);
+    if (n > 0) {
+        rb_ary_splice(x, RARRAY_LEN(x), 0, RARRAY_CONST_PTR_TRANSIENT(y), n);
+    }
+    RB_GC_GUARD(y);
+    return x;
+}
+
 /*
  *  call-seq:
- *     ary.concat(other_ary)   -> ary
+ *    array.concat(*other_arrays) -> self
  *
- *  Appends the elements of +other_ary+ to +self+.
+ *  Adds to +array+ all elements from each \Array in +other_arrays+; returns +self+:
  *
- *     [ "a", "b" ].concat( ["c", "d"] ) #=> [ "a", "b", "c", "d" ]
+ *    a = [0, 1]
+ *    a.concat([2, 3], [4, 5]) # => [0, 1, 2, 3, 4, 5]
  */
 
+static VALUE
+rb_ary_concat_multi(int argc, VALUE *argv, VALUE ary)
+{
+    rb_ary_modify_check(ary);
+
+    if (argc == 1) {
+        rb_ary_concat(ary, argv[0]);
+    }
+    else if (argc > 1) {
+        int i;
+        VALUE args = rb_ary_hidden_new(argc);
+        for (i = 0; i < argc; i++) {
+            rb_ary_concat(args, argv[i]);
+        }
+        ary_append(ary, args);
+    }
+
+    ary_verify(ary);
+    return ary;
+}
 
 VALUE
 rb_ary_concat(VALUE x, VALUE y)
 {
-    rb_ary_modify_check(x);
-    y = to_ary(y);
-    if (RARRAY_LEN(y) > 0) {
-	rb_ary_splice(x, RARRAY_LEN(x), 0, y);
-    }
-    return x;
+    return ary_append(x, to_ary(y));
 }
 
-
 /*
  *  call-seq:
- *     ary * int     -> new_ary
- *     ary * str     -> new_string
+ *    array * n -> new_array
+ *    array * string_separator -> new_string
+ *
+ *  When non-negative argument \Integer +n+ is given,
+ *  returns a new \Array built by concatenating the +n+ copies of +self+:
  *
- *  Repetition---With a String argument, equivalent to
- *  self.join(str). Otherwise, returns a new array
- *  built by concatenating the +int+ copies of +self+.
+ *    a = ['x', 'y']
+ *    a * 3 # => ["x", "y", "x", "y", "x", "y"]
  *
+ *  When \String argument +string_separator+ is given,
+ *  equivalent to <tt>array.join(string_separator)</tt>:
  *
- *     [ 1, 2, 3 ] * 3    #=> [ 1, 2, 3, 1, 2, 3, 1, 2, 3 ]
- *     [ 1, 2, 3 ] * ","  #=> "1,2,3"
+ *    [0, [0, 1], {foo: 0}] * ', ' # => "0, 0, 1, {:foo=>0}"
  *
  */
 
 static VALUE
 rb_ary_times(VALUE ary, VALUE times)
 {
-    VALUE ary2, tmp, *ptr, *ptr2;
+    VALUE ary2, tmp;
+    const VALUE *ptr;
     long t, len;
 
     tmp = rb_check_string_type(times);
     if (!NIL_P(tmp)) {
-	return rb_ary_join(ary, tmp);
+        return rb_ary_join(ary, tmp);
     }
 
     len = NUM2LONG(times);
     if (len == 0) {
-	ary2 = ary_new(rb_obj_class(ary), 0);
-	goto out;
+        ary2 = ary_new(rb_cArray, 0);
+        goto out;
     }
     if (len < 0) {
-	rb_raise(rb_eArgError, "negative argument");
+        rb_raise(rb_eArgError, "negative argument");
     }
     if (ARY_MAX_SIZE/len < RARRAY_LEN(ary)) {
-	rb_raise(rb_eArgError, "argument too big");
+        rb_raise(rb_eArgError, "argument too big");
     }
     len *= RARRAY_LEN(ary);
 
-    ary2 = ary_new(rb_obj_class(ary), len);
+    ary2 = ary_new(rb_cArray, len);
     ARY_SET_LEN(ary2, len);
 
-    ptr = RARRAY_PTR(ary);
-    ptr2 = RARRAY_PTR(ary2);
+    ptr = RARRAY_CONST_PTR_TRANSIENT(ary);
     t = RARRAY_LEN(ary);
     if (0 < t) {
-        MEMCPY(ptr2, ptr, VALUE, t);
+        ary_memcpy(ary2, 0, t, ptr);
         while (t <= len/2) {
-            MEMCPY(ptr2+t, ptr2, VALUE, t);
+            ary_memcpy(ary2, t, t, RARRAY_CONST_PTR_TRANSIENT(ary2));
             t *= 2;
         }
         if (t < len) {
-            MEMCPY(ptr2+t, ptr2, VALUE, len-t);
+            ary_memcpy(ary2, t, len-t, RARRAY_CONST_PTR_TRANSIENT(ary2));
         }
     }
   out:
-    OBJ_INFECT(ary2, ary);
-
     return ary2;
 }
 
 /*
  *  call-seq:
- *     ary.assoc(obj)   -> new_ary  or  nil
- *
- *  Searches through an array whose elements are also arrays
- *  comparing +obj+ with the first element of each contained array
- *  using obj.==.
- *  Returns the first contained array that matches (that
- *  is, the first associated array),
- *  or +nil+ if no match is found.
- *  See also Array#rassoc.
- *
- *     s1 = [ "colors", "red", "blue", "green" ]
- *     s2 = [ "letters", "a", "b", "c" ]
- *     s3 = "foo"
- *     a  = [ s1, s2, s3 ]
- *     a.assoc("letters")  #=> [ "letters", "a", "b", "c" ]
- *     a.assoc("foo")      #=> nil
+ *    array.assoc(obj) -> found_array or nil
+ *
+ *  Returns the first element in +self+ that is an \Array
+ *  whose first element <tt>==</tt> +obj+:
+ *
+ *    a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
+ *    a.assoc(4) # => [4, 5, 6]
+ *
+ *  Returns +nil+ if no such element is found.
+ *
+ *  Related: #rassoc.
  */
 
 VALUE
@@ -3139,26 +5231,27 @@ rb_ary_assoc(VALUE ary, VALUE key)
     VALUE v;
 
     for (i = 0; i < RARRAY_LEN(ary); ++i) {
-	v = rb_check_array_type(RARRAY_PTR(ary)[i]);
-	if (!NIL_P(v) && RARRAY_LEN(v) > 0 &&
-	    rb_equal(RARRAY_PTR(v)[0], key))
-	    return v;
+        v = rb_check_array_type(RARRAY_AREF(ary, i));
+        if (!NIL_P(v) && RARRAY_LEN(v) > 0 &&
+            rb_equal(RARRAY_AREF(v, 0), key))
+            return v;
     }
     return Qnil;
 }
 
 /*
  *  call-seq:
- *     ary.rassoc(obj) -> new_ary or nil
+ *    array.rassoc(obj) -> found_array or nil
  *
- *  Searches through the array whose elements are also arrays. Compares
- *  +obj+ with the second element of each contained array using
- *  <code>==</code>. Returns the first contained array that matches. See
- *  also Array#assoc.
+ *  Returns the first element in +self+ that is an \Array
+ *  whose second element <tt>==</tt> +obj+:
  *
- *     a = [ [ 1, "one"], [2, "two"], [3, "three"], ["ii", "two"] ]
- *     a.rassoc("two")    #=> [2, "two"]
- *     a.rassoc("four")   #=> nil
+ *    a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
+ *    a.rassoc(4) # => [2, 4]
+ *
+ *  Returns +nil+ if no such element is found.
+ *
+ *  Related: #assoc.
  */
 
 VALUE
@@ -3168,11 +5261,11 @@ rb_ary_rassoc(VALUE ary, VALUE value)
     VALUE v;
 
     for (i = 0; i < RARRAY_LEN(ary); ++i) {
-	v = RARRAY_PTR(ary)[i];
-	if (RB_TYPE_P(v, T_ARRAY) &&
-	    RARRAY_LEN(v) > 1 &&
-	    rb_equal(RARRAY_PTR(v)[1], value))
-	    return v;
+        v = RARRAY_AREF(ary, i);
+        if (RB_TYPE_P(v, T_ARRAY) &&
+            RARRAY_LEN(v) > 1 &&
+            rb_equal(RARRAY_AREF(v, 1), value))
+            return v;
     }
     return Qnil;
 }
@@ -3180,28 +5273,53 @@ rb_ary_rassoc(VALUE ary, VALUE value)
 static VALUE
 recursive_equal(VALUE ary1, VALUE ary2, int recur)
 {
-    long i;
+    long i, len1;
+    const VALUE *p1, *p2;
 
     if (recur) return Qtrue; /* Subtle! */
-    for (i=0; i<RARRAY_LEN(ary1); i++) {
-	if (!rb_equal(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i)))
-	    return Qfalse;
+
+    /* rb_equal() can evacuate ptrs */
+    p1 = RARRAY_CONST_PTR(ary1);
+    p2 = RARRAY_CONST_PTR(ary2);
+    len1 = RARRAY_LEN(ary1);
+
+    for (i = 0; i < len1; i++) {
+        if (*p1 != *p2) {
+            if (rb_equal(*p1, *p2)) {
+                len1 = RARRAY_LEN(ary1);
+                if (len1 != RARRAY_LEN(ary2))
+                    return Qfalse;
+                if (len1 < i)
+                    return Qtrue;
+                p1 = RARRAY_CONST_PTR(ary1) + i;
+                p2 = RARRAY_CONST_PTR(ary2) + i;
+            }
+            else {
+                return Qfalse;
+            }
+        }
+        p1++;
+        p2++;
     }
     return Qtrue;
 }
 
 /*
  *  call-seq:
- *     ary == other_ary   ->   bool
+ *    array == other_array -> true or false
+ *
+ *  Returns +true+ if both <tt>array.size == other_array.size</tt>
+ *  and for each index +i+ in +array+, <tt>array[i] == other_array[i]</tt>:
  *
- *  Equality---Two arrays are equal if they contain the same number
- *  of elements and if each element is equal to (according to
- *  Object.==) the corresponding element in the other array.
+ *    a0 = [:foo, 'bar', 2]
+ *    a1 = [:foo, 'bar', 2.0]
+ *    a1 == a0 # => true
+ *    [] == [] # => true
  *
- *     [ "a", "c" ]    == [ "a", "c", 7 ]     #=> false
- *     [ "a", "c", 7 ] == [ "a", "c", 7 ]     #=> true
- *     [ "a", "c", 7 ] == [ "a", "d", "f" ]   #=> false
+ *  Otherwise, returns +false+.
  *
+ *  This method is different from method Array#eql?,
+ *  which compares elements using <tt>Object#eql?</tt>.
  */
 
 static VALUE
@@ -3209,12 +5327,13 @@ rb_ary_equal(VALUE ary1, VALUE ary2)
 {
     if (ary1 == ary2) return Qtrue;
     if (!RB_TYPE_P(ary2, T_ARRAY)) {
-	if (!rb_respond_to(ary2, rb_intern("to_ary"))) {
-	    return Qfalse;
-	}
-	return rb_equal(ary2, ary1);
+        if (!rb_respond_to(ary2, idTo_ary)) {
+            return Qfalse;
+        }
+        return rb_equal(ary2, ary1);
     }
     if (RARRAY_LEN(ary1) != RARRAY_LEN(ary2)) return Qfalse;
+    if (RARRAY_CONST_PTR_TRANSIENT(ary1) == RARRAY_CONST_PTR_TRANSIENT(ary2)) return Qtrue;
     return rb_exec_recursive_paired(recursive_equal, ary1, ary2, ary2);
 }
 
@@ -3225,18 +5344,27 @@ recursive_eql(VALUE ary1, VALUE ary2, int recur)
 
     if (recur) return Qtrue; /* Subtle! */
     for (i=0; i<RARRAY_LEN(ary1); i++) {
-	if (!rb_eql(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i)))
-	    return Qfalse;
+        if (!rb_eql(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i)))
+            return Qfalse;
     }
     return Qtrue;
 }
 
 /*
  *  call-seq:
- *     ary.eql?(other)  -> true or false
+ *    array.eql? other_array -> true or false
+ *
+ *  Returns +true+ if +self+ and +other_array+ are the same size,
+ *  and if, for each index +i+ in +self+, <tt>self[i].eql? other_array[i]</tt>:
  *
- *  Returns <code>true</code> if +self+ and +other+ are the same object,
- *  or are both arrays with the same content.
+ *    a0 = [:foo, 'bar', 2]
+ *    a1 = [:foo, 'bar', 2]
+ *    a1.eql?(a0) # => true
+ *
+ *  Otherwise, returns +false+.
+ *
+ *  This method is different from method Array#==,
+ *  which compares using method <tt>Object#==</tt>.
  */
 
 static VALUE
@@ -3245,70 +5373,80 @@ rb_ary_eql(VALUE ary1, VALUE ary2)
     if (ary1 == ary2) return Qtrue;
     if (!RB_TYPE_P(ary2, T_ARRAY)) return Qfalse;
     if (RARRAY_LEN(ary1) != RARRAY_LEN(ary2)) return Qfalse;
+    if (RARRAY_CONST_PTR_TRANSIENT(ary1) == RARRAY_CONST_PTR_TRANSIENT(ary2)) return Qtrue;
     return rb_exec_recursive_paired(recursive_eql, ary1, ary2, ary2);
 }
 
+/*
+ *  call-seq:
+ *    array.hash -> integer
+ *
+ *  Returns the integer hash value for +self+.
+ *
+ *  Two arrays with the same content will have the same hash code (and will compare using eql?):
+ *
+ *    [0, 1, 2].hash == [0, 1, 2].hash # => true
+ *    [0, 1, 2].hash == [0, 1, 3].hash # => false
+ *
+ */
+
 static VALUE
-recursive_hash(VALUE ary, VALUE dummy, int recur)
+rb_ary_hash(VALUE ary)
 {
     long i;
     st_index_t h;
     VALUE n;
 
     h = rb_hash_start(RARRAY_LEN(ary));
-    if (recur) {
-	h = rb_hash_uint(h, NUM2LONG(rb_hash(rb_cArray)));
-    }
-    else {
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    n = rb_hash(RARRAY_PTR(ary)[i]);
-	    h = rb_hash_uint(h, NUM2LONG(n));
-	}
+    h = rb_hash_uint(h, (st_index_t)rb_ary_hash);
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        n = rb_hash(RARRAY_AREF(ary, i));
+        h = rb_hash_uint(h, NUM2LONG(n));
     }
     h = rb_hash_end(h);
-    return LONG2FIX(h);
-}
-
-/*
- *  call-seq:
- *     ary.hash   -> fixnum
- *
- *  Compute a hash-code for this array. Two arrays with the same content
- *  will have the same hash code (and will compare using <code>eql?</code>).
- */
-
-static VALUE
-rb_ary_hash(VALUE ary)
-{
-    return rb_exec_recursive_outer(recursive_hash, ary, 0);
+    return ST2FIX(h);
 }
 
 /*
  *  call-seq:
- *     ary.include?(object)   -> true or false
+ *    array.include?(obj) -> true or false
  *
- *  Returns <code>true</code> if the given +object+ is present in
- *  +self+ (that is, if any object <code>==</code> +object+),
- *  <code>false</code> otherwise.
+ *  Returns +true+ if for some index +i+ in +self+, <tt>obj == self[i]</tt>;
+ *  otherwise +false+:
  *
- *     a = [ "a", "b", "c" ]
- *     a.include?("b")   #=> true
- *     a.include?("z")   #=> false
+ *    [0, 1, 2].include?(2) # => true
+ *    [0, 1, 2].include?(3) # => false
  */
 
 VALUE
 rb_ary_includes(VALUE ary, VALUE item)
 {
     long i;
+    VALUE e;
 
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	if (rb_equal(RARRAY_PTR(ary)[i], item)) {
-	    return Qtrue;
-	}
+        e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, item)) {
+            return Qtrue;
+        }
     }
     return Qfalse;
 }
 
+static VALUE
+rb_ary_includes_by_eql(VALUE ary, VALUE item)
+{
+    long i;
+    VALUE e;
+
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        e = RARRAY_AREF(ary, i);
+        if (rb_eql(item, e)) {
+            return Qtrue;
+        }
+    }
+    return Qfalse;
+}
 
 static VALUE
 recursive_cmp(VALUE ary1, VALUE ary2, int recur)
@@ -3318,35 +5456,46 @@ recursive_cmp(VALUE ary1, VALUE ary2, int recur)
     if (recur) return Qundef;	/* Subtle! */
     len = RARRAY_LEN(ary1);
     if (len > RARRAY_LEN(ary2)) {
-	len = RARRAY_LEN(ary2);
+        len = RARRAY_LEN(ary2);
     }
     for (i=0; i<len; i++) {
-	VALUE v = rb_funcall(rb_ary_elt(ary1, i), id_cmp, 1, rb_ary_elt(ary2, i));
-	if (v != INT2FIX(0)) {
-	    return v;
-	}
+        VALUE e1 = rb_ary_elt(ary1, i), e2 = rb_ary_elt(ary2, i);
+        VALUE v = rb_funcallv(e1, id_cmp, 1, &e2);
+        if (v != INT2FIX(0)) {
+            return v;
+        }
     }
     return Qundef;
 }
 
 /*
  *  call-seq:
- *     ary <=> other_ary   ->  -1, 0, +1 or nil
+ *    array <=> other_array -> -1, 0, or 1
+ *
+ *  Returns -1, 0, or 1 as +self+ is less than, equal to, or greater than +other_array+.
+ *  For each index +i+ in +self+, evaluates <tt>result = self[i] <=> other_array[i]</tt>.
+ *
+ *  Returns -1 if any result is -1:
+ *
+ *    [0, 1, 2] <=> [0, 1, 3] # => -1
+ *
+ *  Returns 1 if any result is 1:
+ *
+ *    [0, 1, 2] <=> [0, 1, 1] # => 1
+ *
+ *  When all results are zero:
+ *
+ *  - Returns -1 if +array+ is smaller than +other_array+:
  *
- *  Comparison---Returns an integer (-1, 0,
- *  or +1) if this array is less than, equal to, or greater than
- *  +other_ary+.
+ *      [0, 1, 2] <=> [0, 1, 2, 3] # => -1
  *
- *  Each object in each array is compared (using <=>). Arrays are compared in
- *  an "element-wise" manner; the first two elements that are not equal will
- *  determine the return value for the whole comparison.  If all the values
- *  are equal, then the return is based on a comparison of the array lengths.
- *  Thus, two arrays are "equal" according to Array#<=> if and only if they
- *  have the same length and the value of each element is equal to the
- *  value of the corresponding element in the other array.
+ *  - Returns 1 if +array+ is larger than +other_array+:
  *
- *     [ "a", "a", "c" ]    <=> [ "a", "b", "c" ]   #=> -1
- *     [ 1, 2, 3, 4, 5, 6 ] <=> [ 1, 2 ]            #=> +1
+ *      [0, 1, 2] <=> [0, 1] # => 1
+ *
+ *  - Returns 0 if +array+ and +other_array+ are the same size:
+ *
+ *      [0, 1, 2] <=> [0, 1, 2] # => 0
  *
  */
 
@@ -3360,7 +5509,7 @@ rb_ary_cmp(VALUE ary1, VALUE ary2)
     if (NIL_P(ary2)) return Qnil;
     if (ary1 == ary2) return INT2FIX(0);
     v = rb_exec_recursive_paired(recursive_cmp, ary1, ary2, ary2);
-    if (v != Qundef) return v;
+    if (!UNDEF_P(v)) return v;
     len = RARRAY_LEN(ary1) - RARRAY_LEN(ary2);
     if (len == 0) return INT2FIX(0);
     if (len > 0) return INT2FIX(1);
@@ -3373,24 +5522,26 @@ ary_add_hash(VALUE hash, VALUE ary)
     long i;
 
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	rb_hash_aset(hash, RARRAY_PTR(ary)[i], Qtrue);
+        VALUE elt = RARRAY_AREF(ary, i);
+        rb_hash_add_new_element(hash, elt, elt);
     }
     return hash;
 }
 
 static inline VALUE
-ary_tmp_hash_new(void)
+ary_tmp_hash_new(VALUE ary)
 {
-    VALUE hash = rb_hash_new();
+    long size = RARRAY_LEN(ary);
+    VALUE hash = rb_hash_new_with_size(size);
 
-    RBASIC(hash)->klass = 0;
+    RBASIC_CLEAR_CLASS(hash);
     return hash;
 }
 
 static VALUE
 ary_make_hash(VALUE ary)
 {
-    VALUE hash = ary_tmp_hash_new();
+    VALUE hash = ary_tmp_hash_new(ary);
     return ary_add_hash(hash, ary);
 }
 
@@ -3400,10 +5551,8 @@ ary_add_hash_by(VALUE hash, VALUE ary)
     long i;
 
     for (i = 0; i < RARRAY_LEN(ary); ++i) {
-	VALUE v = rb_ary_elt(ary, i), k = rb_yield(v);
-	if (rb_hash_lookup2(hash, k, Qundef) == Qundef) {
-	    rb_hash_aset(hash, k, v);
-	}
+        VALUE v = rb_ary_elt(ary, i), k = rb_yield(v);
+        rb_hash_add_new_element(hash, k, v);
     }
     return hash;
 }
@@ -3411,45 +5560,61 @@ ary_add_hash_by(VALUE hash, VALUE ary)
 static VALUE
 ary_make_hash_by(VALUE ary)
 {
-    VALUE hash = ary_tmp_hash_new();
+    VALUE hash = ary_tmp_hash_new(ary);
     return ary_add_hash_by(hash, ary);
 }
 
 static inline void
 ary_recycle_hash(VALUE hash)
 {
-    if (RHASH(hash)->ntbl) {
-	st_table *tbl = RHASH(hash)->ntbl;
-	RHASH(hash)->ntbl = 0;
-	st_free_table(tbl);
+    assert(RBASIC_CLASS(hash) == 0);
+    if (RHASH_ST_TABLE_P(hash)) {
+        st_table *tbl = RHASH_ST_TABLE(hash);
+        st_free_table(tbl);
+        RHASH_ST_CLEAR(hash);
     }
 }
 
 /*
  *  call-seq:
- *     ary - other_ary    -> new_ary
+ *    array - other_array -> new_array
  *
- *  Array Difference---Returns a new array that is a copy of
- *  the original array, removing any items that also appear in
- *  +other_ary+. (If you need set-like behavior, see the
- *  library class Set.)
+ *  Returns a new \Array containing only those elements from +array+
+ *  that are not found in \Array +other_array+;
+ *  items are compared using <tt>eql?</tt>;
+ *  the order from +array+ is preserved:
  *
- *     [ 1, 1, 2, 2, 3, 3, 4, 5 ] - [ 1, 2, 4 ]  #=>  [ 3, 3, 5 ]
+ *    [0, 1, 1, 2, 1, 1, 3, 1, 1] - [1] # => [0, 2, 3]
+ *    [0, 1, 2, 3] - [3, 0] # => [1, 2]
+ *    [0, 1, 2] - [4] # => [0, 1, 2]
+ *
+ *  Related: Array#difference.
  */
 
-static VALUE
+VALUE
 rb_ary_diff(VALUE ary1, VALUE ary2)
 {
     VALUE ary3;
-    volatile VALUE hash;
+    VALUE hash;
     long i;
 
-    hash = ary_make_hash(to_ary(ary2));
+    ary2 = to_ary(ary2);
+    if (RARRAY_LEN(ary2) == 0) { return ary_make_shared_copy(ary1); }
     ary3 = rb_ary_new();
 
+    if (RARRAY_LEN(ary1) <= SMALL_ARRAY_LEN || RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        for (i=0; i<RARRAY_LEN(ary1); i++) {
+            VALUE elt = rb_ary_elt(ary1, i);
+            if (rb_ary_includes_by_eql(ary2, elt)) continue;
+            rb_ary_push(ary3, elt);
+        }
+        return ary3;
+    }
+
+    hash = ary_make_hash(ary2);
     for (i=0; i<RARRAY_LEN(ary1); i++) {
-	if (st_lookup(RHASH_TBL(hash), RARRAY_PTR(ary1)[i], 0)) continue;
-	rb_ary_push(ary3, rb_ary_elt(ary1, i));
+        if (rb_hash_stlike_lookup(hash, RARRAY_AREF(ary1, i), NULL)) continue;
+        rb_ary_push(ary3, rb_ary_elt(ary1, i));
     }
     ary_recycle_hash(hash);
     return ary3;
@@ -3457,12 +5622,73 @@ rb_ary_diff(VALUE ary1, VALUE ary2)
 
 /*
  *  call-seq:
- *     ary & other_ary      -> new_ary
+ *    array.difference(*other_arrays) -> new_array
+ *
+ *  Returns a new \Array containing only those elements from +self+
+ *  that are not found in any of the Arrays +other_arrays+;
+ *  items are compared using <tt>eql?</tt>;  order from +self+ is preserved:
+ *
+ *    [0, 1, 1, 2, 1, 1, 3, 1, 1].difference([1]) # => [0, 2, 3]
+ *    [0, 1, 2, 3].difference([3, 0], [1, 3]) # => [2]
+ *    [0, 1, 2].difference([4]) # => [0, 1, 2]
  *
- *  Set Intersection---Returns a new array
- *  containing elements common to the two arrays, with no duplicates.
+ *  Returns a copy of +self+ if no arguments given.
  *
- *     [ 1, 1, 3, 5 ] & [ 1, 2, 3 ]   #=> [ 1, 3 ]
+ *  Related: Array#-.
+ */
+
+static VALUE
+rb_ary_difference_multi(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE ary_diff;
+    long i, length;
+    volatile VALUE t0;
+    bool *is_hash = ALLOCV_N(bool, t0, argc);
+    ary_diff = rb_ary_new();
+    length = RARRAY_LEN(ary);
+
+    for (i = 0; i < argc; i++) {
+        argv[i] = to_ary(argv[i]);
+        is_hash[i] = (length > SMALL_ARRAY_LEN && RARRAY_LEN(argv[i]) > SMALL_ARRAY_LEN);
+        if (is_hash[i]) argv[i] = ary_make_hash(argv[i]);
+    }
+
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        int j;
+        VALUE elt = rb_ary_elt(ary, i);
+        for (j = 0; j < argc; j++) {
+            if (is_hash[j]) {
+                if (rb_hash_stlike_lookup(argv[j], RARRAY_AREF(ary, i), NULL))
+                    break;
+            }
+            else {
+                if (rb_ary_includes_by_eql(argv[j], elt)) break;
+            }
+        }
+        if (j == argc) rb_ary_push(ary_diff, elt);
+    }
+
+    ALLOCV_END(t0);
+
+    return ary_diff;
+}
+
+
+/*
+ *  call-seq:
+ *    array & other_array -> new_array
+ *
+ *  Returns a new \Array containing each element found in both +array+ and \Array +other_array+;
+ *  duplicates are omitted; items are compared using <tt>eql?</tt>:
+ *
+ *    [0, 1, 2, 3] & [1, 2] # => [1, 2]
+ *    [0, 1, 0, 1] & [0, 1] # => [0, 1]
+ *
+ *  Preserves order from +array+:
+ *
+ *    [0, 1, 2] & [3, 2, 1, 0] # => [0, 1, 2]
+ *
+ *  Related: Array#intersection.
  */
 
 
@@ -3474,18 +5700,27 @@ rb_ary_and(VALUE ary1, VALUE ary2)
     long i;
 
     ary2 = to_ary(ary2);
-    ary3 = rb_ary_new2(RARRAY_LEN(ary1) < RARRAY_LEN(ary2) ?
-	    RARRAY_LEN(ary1) : RARRAY_LEN(ary2));
-    hash = ary_make_hash(ary2);
-
-    if (RHASH_EMPTY_P(hash))
+    ary3 = rb_ary_new();
+    if (RARRAY_LEN(ary1) == 0 || RARRAY_LEN(ary2) == 0) return ary3;
+
+    if (RARRAY_LEN(ary1) <= SMALL_ARRAY_LEN && RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        for (i=0; i<RARRAY_LEN(ary1); i++) {
+            v = RARRAY_AREF(ary1, i);
+            if (!rb_ary_includes_by_eql(ary2, v)) continue;
+            if (rb_ary_includes_by_eql(ary3, v)) continue;
+            rb_ary_push(ary3, v);
+        }
         return ary3;
+    }
+
+    hash = ary_make_hash(ary2);
 
     for (i=0; i<RARRAY_LEN(ary1); i++) {
-	vv = (st_data_t)(v = rb_ary_elt(ary1, i));
-	if (st_delete(RHASH_TBL(hash), &vv, 0)) {
-	    rb_ary_push(ary3, v);
-	}
+        v = RARRAY_AREF(ary1, i);
+        vv = (st_data_t)v;
+        if (rb_hash_stlike_delete(hash, &vv, 0)) {
+            rb_ary_push(ary3, v);
+        }
     }
     ary_recycle_hash(hash);
 
@@ -3494,40 +5729,572 @@ rb_ary_and(VALUE ary1, VALUE ary2)
 
 /*
  *  call-seq:
- *     ary | other_ary     -> new_ary
+ *    array.intersection(*other_arrays) -> new_array
+ *
+ *  Returns a new \Array containing each element found both in +self+
+ *  and in all of the given Arrays +other_arrays+;
+ *  duplicates are omitted; items are compared using <tt>eql?</tt>:
+ *
+ *    [0, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]
+ *    [0, 0, 1, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]
  *
- *  Set Union---Returns a new array by joining this array with
- *  +other_ary+, removing duplicates.
+ *  Preserves order from +self+:
  *
- *     [ "a", "b", "c" ] | [ "c", "d", "a" ]
- *            #=> [ "a", "b", "c", "d" ]
+ *    [0, 1, 2].intersection([2, 1, 0]) # => [0, 1, 2]
+ *
+ *  Returns a copy of +self+ if no arguments given.
+ *
+ *  Related: Array#&.
+ */
+
+static VALUE
+rb_ary_intersection_multi(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result = rb_ary_dup(ary);
+    int i;
+
+    for (i = 0; i < argc; i++) {
+        result = rb_ary_and(result, argv[i]);
+    }
+
+    return result;
+}
+
+static int
+ary_hash_orset(st_data_t *key, st_data_t *value, st_data_t arg, int existing)
+{
+    if (existing) return ST_STOP;
+    *key = *value = (VALUE)arg;
+    return ST_CONTINUE;
+}
+
+static void
+rb_ary_union(VALUE ary_union, VALUE ary)
+{
+    long i;
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        VALUE elt = rb_ary_elt(ary, i);
+        if (rb_ary_includes_by_eql(ary_union, elt)) continue;
+        rb_ary_push(ary_union, elt);
+    }
+}
+
+static void
+rb_ary_union_hash(VALUE hash, VALUE ary2)
+{
+    long i;
+    for (i = 0; i < RARRAY_LEN(ary2); i++) {
+        VALUE elt = RARRAY_AREF(ary2, i);
+        if (!rb_hash_stlike_update(hash, (st_data_t)elt, ary_hash_orset, (st_data_t)elt)) {
+            RB_OBJ_WRITTEN(hash, Qundef, elt);
+        }
+    }
+}
+
+/*
+ *  call-seq:
+ *    array | other_array -> new_array
+ *
+ *  Returns the union of +array+ and \Array +other_array+;
+ *  duplicates are removed; order is preserved;
+ *  items are compared using <tt>eql?</tt>:
+ *
+ *    [0, 1] | [2, 3] # => [0, 1, 2, 3]
+ *    [0, 1, 1] | [2, 2, 3] # => [0, 1, 2, 3]
+ *    [0, 1, 2] | [3, 2, 1, 0] # => [0, 1, 2, 3]
+ *
+ *  Related: Array#union.
  */
 
 static VALUE
 rb_ary_or(VALUE ary1, VALUE ary2)
 {
-    VALUE hash, ary3, v;
+    VALUE hash, ary3;
+
+    ary2 = to_ary(ary2);
+    if (RARRAY_LEN(ary1) + RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        ary3 = rb_ary_new();
+        rb_ary_union(ary3, ary1);
+        rb_ary_union(ary3, ary2);
+        return ary3;
+    }
+
+    hash = ary_make_hash(ary1);
+    rb_ary_union_hash(hash, ary2);
+
+    ary3 = rb_hash_values(hash);
+    ary_recycle_hash(hash);
+    return ary3;
+}
+
+/*
+ *  call-seq:
+ *    array.union(*other_arrays) -> new_array
+ *
+ *  Returns a new \Array that is the union of +self+ and all given Arrays +other_arrays+;
+ *  duplicates are removed;  order is preserved;  items are compared using <tt>eql?</tt>:
+ *
+ *    [0, 1, 2, 3].union([4, 5], [6, 7]) # => [0, 1, 2, 3, 4, 5, 6, 7]
+ *    [0, 1, 1].union([2, 1], [3, 1]) # => [0, 1, 2, 3]
+ *    [0, 1, 2, 3].union([3, 2], [1, 0]) # => [0, 1, 2, 3]
+ *
+ *  Returns a copy of +self+ if no arguments given.
+ *
+ *  Related: Array#|.
+ */
+
+static VALUE
+rb_ary_union_multi(int argc, VALUE *argv, VALUE ary)
+{
+    int i;
+    long sum;
+    VALUE hash, ary_union;
+
+    sum = RARRAY_LEN(ary);
+    for (i = 0; i < argc; i++) {
+        argv[i] = to_ary(argv[i]);
+        sum += RARRAY_LEN(argv[i]);
+    }
+
+    if (sum <= SMALL_ARRAY_LEN) {
+        ary_union = rb_ary_new();
+
+        rb_ary_union(ary_union, ary);
+        for (i = 0; i < argc; i++) rb_ary_union(ary_union, argv[i]);
+
+        return ary_union;
+    }
+
+    hash = ary_make_hash(ary);
+    for (i = 0; i < argc; i++) rb_ary_union_hash(hash, argv[i]);
+
+    ary_union = rb_hash_values(hash);
+    ary_recycle_hash(hash);
+    return ary_union;
+}
+
+/*
+ *  call-seq:
+ *     ary.intersect?(other_ary)   -> true or false
+ *
+ *  Returns +true+ if the array and +other_ary+ have at least one element in
+ *  common, otherwise returns +false+:
+ *
+ *     a = [ 1, 2, 3 ]
+ *     b = [ 3, 4, 5 ]
+ *     c = [ 5, 6, 7 ]
+ *     a.intersect?(b)   #=> true
+ *     a.intersect?(c)   #=> false
+ *
+ */
+
+static VALUE
+rb_ary_intersect_p(VALUE ary1, VALUE ary2)
+{
+    VALUE hash, v, result, shorter, longer;
     st_data_t vv;
     long i;
 
     ary2 = to_ary(ary2);
-    ary3 = rb_ary_new2(RARRAY_LEN(ary1)+RARRAY_LEN(ary2));
-    hash = ary_add_hash(ary_make_hash(ary1), ary2);
+    if (RARRAY_LEN(ary1) == 0 || RARRAY_LEN(ary2) == 0) return Qfalse;
 
-    for (i=0; i<RARRAY_LEN(ary1); i++) {
-	vv = (st_data_t)(v = rb_ary_elt(ary1, i));
-	if (st_delete(RHASH_TBL(hash), &vv, 0)) {
-	    rb_ary_push(ary3, v);
-	}
+    if (RARRAY_LEN(ary1) <= SMALL_ARRAY_LEN && RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        for (i=0; i<RARRAY_LEN(ary1); i++) {
+            v = RARRAY_AREF(ary1, i);
+            if (rb_ary_includes_by_eql(ary2, v)) return Qtrue;
+        }
+        return Qfalse;
+    }
+
+    shorter = ary1;
+    longer = ary2;
+    if (RARRAY_LEN(ary1) > RARRAY_LEN(ary2)) {
+        longer = ary1;
+        shorter = ary2;
     }
-    for (i=0; i<RARRAY_LEN(ary2); i++) {
-	vv = (st_data_t)(v = rb_ary_elt(ary2, i));
-	if (st_delete(RHASH_TBL(hash), &vv, 0)) {
-	    rb_ary_push(ary3, v);
-	}
+
+    hash = ary_make_hash(shorter);
+    result = Qfalse;
+
+    for (i=0; i<RARRAY_LEN(longer); i++) {
+        v = RARRAY_AREF(longer, i);
+        vv = (st_data_t)v;
+        if (rb_hash_stlike_lookup(hash, vv, 0)) {
+            result = Qtrue;
+            break;
+        }
     }
     ary_recycle_hash(hash);
-    return ary3;
+
+    return result;
+}
+
+static VALUE
+ary_max_generic(VALUE ary, long i, VALUE vmax)
+{
+    RUBY_ASSERT(i > 0 && i < RARRAY_LEN(ary));
+
+    VALUE v;
+    for (; i < RARRAY_LEN(ary); ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (rb_cmpint(rb_funcallv(vmax, id_cmp, 1, &v), vmax, v) < 0) {
+            vmax = v;
+        }
+    }
+
+    return vmax;
+}
+
+static VALUE
+ary_max_opt_fixnum(VALUE ary, long i, VALUE vmax)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(FIXNUM_P(vmax));
+
+    VALUE v;
+    for (; i < n; ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (FIXNUM_P(v)) {
+            if ((long)vmax < (long)v) {
+                vmax = v;
+            }
+        }
+        else {
+            return ary_max_generic(ary, i, vmax);
+        }
+    }
+
+    return vmax;
+}
+
+static VALUE
+ary_max_opt_float(VALUE ary, long i, VALUE vmax)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(RB_FLOAT_TYPE_P(vmax));
+
+    VALUE v;
+    for (; i < n; ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (RB_FLOAT_TYPE_P(v)) {
+            if (rb_float_cmp(vmax, v) < 0) {
+                vmax = v;
+            }
+        }
+        else {
+            return ary_max_generic(ary, i, vmax);
+        }
+    }
+
+    return vmax;
+}
+
+static VALUE
+ary_max_opt_string(VALUE ary, long i, VALUE vmax)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(STRING_P(vmax));
+
+    VALUE v;
+    for (; i < n; ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (STRING_P(v)) {
+            if (rb_str_cmp(vmax, v) < 0) {
+                vmax = v;
+            }
+        }
+        else {
+            return ary_max_generic(ary, i, vmax);
+        }
+    }
+
+    return vmax;
+}
+
+/*
+ *  call-seq:
+ *    array.max -> element
+ *    array.max {|a, b| ... } -> element
+ *    array.max(n) -> new_array
+ *    array.max(n) {|a, b| ... } -> new_array
+ *
+ *  Returns one of the following:
+ *
+ *  - The maximum-valued element from +self+.
+ *  - A new \Array of maximum-valued elements selected from +self+.
+ *
+ *  When no block is given, each element in +self+ must respond to method <tt><=></tt>
+ *  with an \Integer.
+ *
+ *  With no argument and no block, returns the element in +self+
+ *  having the maximum value per method <tt><=></tt>:
+ *
+ *    [0, 1, 2].max # => 2
+ *
+ *  With an argument \Integer +n+ and no block, returns a new \Array with at most +n+ elements,
+ *  in descending order per method <tt><=></tt>:
+ *
+ *    [0, 1, 2, 3].max(3) # => [3, 2, 1]
+ *    [0, 1, 2, 3].max(6) # => [3, 2, 1, 0]
+ *
+ *  When a block is given, the block must return an \Integer.
+ *
+ *  With a block and no argument, calls the block <tt>self.size-1</tt> times to compare elements;
+ *  returns the element having the maximum value per the block:
+ *
+ *    ['0', '00', '000'].max {|a, b| a.size <=> b.size } # => "000"
+ *
+ *  With an argument +n+ and a block, returns a new \Array with at most +n+ elements,
+ *  in descending order per the block:
+ *
+ *    ['0', '00', '000'].max(2) {|a, b| a.size <=> b.size } # => ["000", "00"]
+ *
+ */
+static VALUE
+rb_ary_max(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result = Qundef, v;
+    VALUE num;
+    long i;
+
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(num = argv[0]))
+       return rb_nmin_run(ary, num, 0, 1, 1);
+
+    const long n = RARRAY_LEN(ary);
+    if (rb_block_given_p()) {
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+           v = RARRAY_AREF(ary, i);
+           if (UNDEF_P(result) || rb_cmpint(rb_yield_values(2, v, result), v, result) > 0) {
+               result = v;
+           }
+        }
+    }
+    else if (n > 0) {
+        result = RARRAY_AREF(ary, 0);
+        if (n > 1) {
+            if (FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
+                return ary_max_opt_fixnum(ary, 1, result);
+            }
+            else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
+                return ary_max_opt_string(ary, 1, result);
+            }
+            else if (RB_FLOAT_TYPE_P(result) && CMP_OPTIMIZABLE(FLOAT)) {
+                return ary_max_opt_float(ary, 1, result);
+            }
+            else {
+                return ary_max_generic(ary, 1, result);
+            }
+        }
+    }
+    if (UNDEF_P(result)) return Qnil;
+    return result;
+}
+
+static VALUE
+ary_min_generic(VALUE ary, long i, VALUE vmin)
+{
+    RUBY_ASSERT(i > 0 && i < RARRAY_LEN(ary));
+
+    VALUE v;
+    for (; i < RARRAY_LEN(ary); ++i) {
+        v = RARRAY_AREF(ary, i);
+
+        if (rb_cmpint(rb_funcallv(vmin, id_cmp, 1, &v), vmin, v) > 0) {
+            vmin = v;
+        }
+    }
+
+    return vmin;
+}
+
+static VALUE
+ary_min_opt_fixnum(VALUE ary, long i, VALUE vmin)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(FIXNUM_P(vmin));
+
+    VALUE a;
+    for (; i < n; ++i) {
+        a = RARRAY_AREF(ary, i);
+
+        if (FIXNUM_P(a)) {
+            if ((long)vmin > (long)a) {
+                vmin = a;
+            }
+        }
+        else {
+            return ary_min_generic(ary, i, vmin);
+        }
+    }
+
+    return vmin;
+}
+
+static VALUE
+ary_min_opt_float(VALUE ary, long i, VALUE vmin)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(RB_FLOAT_TYPE_P(vmin));
+
+    VALUE a;
+    for (; i < n; ++i) {
+        a = RARRAY_AREF(ary, i);
+
+        if (RB_FLOAT_TYPE_P(a)) {
+            if (rb_float_cmp(vmin, a) > 0) {
+                vmin = a;
+            }
+        }
+        else {
+            return ary_min_generic(ary, i, vmin);
+        }
+    }
+
+    return vmin;
+}
+
+static VALUE
+ary_min_opt_string(VALUE ary, long i, VALUE vmin)
+{
+    const long n = RARRAY_LEN(ary);
+    RUBY_ASSERT(i > 0 && i < n);
+    RUBY_ASSERT(STRING_P(vmin));
+
+    VALUE a;
+    for (; i < n; ++i) {
+        a = RARRAY_AREF(ary, i);
+
+        if (STRING_P(a)) {
+            if (rb_str_cmp(vmin, a) > 0) {
+                vmin = a;
+            }
+        }
+        else {
+            return ary_min_generic(ary, i, vmin);
+        }
+    }
+
+    return vmin;
+}
+
+/*
+ *  call-seq:
+ *    array.min -> element
+ *    array.min { |a, b| ... } -> element
+ *    array.min(n) -> new_array
+ *    array.min(n) { |a, b| ... } -> new_array
+ *
+ *  Returns one of the following:
+ *
+ *  - The minimum-valued element from +self+.
+ *  - A new \Array of minimum-valued elements selected from +self+.
+ *
+ *  When no block is given, each element in +self+ must respond to method <tt><=></tt>
+ *  with an \Integer.
+ *
+ *  With no argument and no block, returns the element in +self+
+ *  having the minimum value per method <tt><=></tt>:
+ *
+ *    [0, 1, 2].min # => 0
+ *
+ *  With \Integer argument +n+ and no block, returns a new \Array with at most +n+ elements,
+ *  in ascending order per method <tt><=></tt>:
+ *
+ *    [0, 1, 2, 3].min(3) # => [0, 1, 2]
+ *    [0, 1, 2, 3].min(6) # => [0, 1, 2, 3]
+ *
+ *  When a block is given, the block must return an Integer.
+ *
+ *  With a block and no argument, calls the block <tt>self.size-1</tt> times to compare elements;
+ *  returns the element having the minimum value per the block:
+ *
+ *    ['0', '00', '000'].min { |a, b| a.size <=> b.size } # => "0"
+ *
+ *  With an argument +n+ and a block, returns a new \Array with at most +n+ elements,
+ *  in ascending order per the block:
+ *
+ *    ['0', '00', '000'].min(2) {|a, b| a.size <=> b.size } # => ["0", "00"]
+ *
+ */
+static VALUE
+rb_ary_min(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result = Qundef, v;
+    VALUE num;
+    long i;
+
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(num = argv[0]))
+       return rb_nmin_run(ary, num, 0, 0, 1);
+
+    const long n = RARRAY_LEN(ary);
+    if (rb_block_given_p()) {
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+           v = RARRAY_AREF(ary, i);
+           if (UNDEF_P(result) || rb_cmpint(rb_yield_values(2, v, result), v, result) < 0) {
+               result = v;
+           }
+        }
+    }
+    else if (n > 0) {
+        result = RARRAY_AREF(ary, 0);
+        if (n > 1) {
+            if (FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
+                return ary_min_opt_fixnum(ary, 1, result);
+            }
+            else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
+                return ary_min_opt_string(ary, 1, result);
+            }
+            else if (RB_FLOAT_TYPE_P(result) && CMP_OPTIMIZABLE(FLOAT)) {
+                return ary_min_opt_float(ary, 1, result);
+            }
+            else {
+                return ary_min_generic(ary, 1, result);
+            }
+        }
+    }
+    if (UNDEF_P(result)) return Qnil;
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    array.minmax -> [min_val, max_val]
+ *    array.minmax {|a, b| ... } -> [min_val, max_val]
+ *
+ *  Returns a new 2-element \Array containing the minimum and maximum values
+ *  from +self+, either per method <tt><=></tt> or per a given block:.
+ *
+ *  When no block is given, each element in +self+ must respond to method <tt><=></tt>
+ *  with an \Integer;
+ *  returns a new 2-element \Array containing the minimum and maximum values
+ *  from +self+, per method <tt><=></tt>:
+ *
+ *    [0, 1, 2].minmax # => [0, 2]
+ *
+ *  When a block is given, the block must return an \Integer;
+ *  the block is called <tt>self.size-1</tt> times to compare elements;
+ *  returns a new 2-element \Array containing the minimum and maximum values
+ *  from +self+, per the block:
+ *
+ *    ['0', '00', '000'].minmax {|a, b| a.size <=> b.size } # => ["0", "000"]
+ *
+ */
+static VALUE
+rb_ary_minmax(VALUE ary)
+{
+    if (rb_block_given_p()) {
+        return rb_call_super(0, NULL);
+    }
+    return rb_assoc_new(rb_ary_min(0, 0, ary), rb_ary_max(0, 0, ary));
 }
 
 static int
@@ -3539,60 +6306,59 @@ push_value(st_data_t key, st_data_t val, st_data_t ary)
 
 /*
  *  call-seq:
- *     ary.uniq!                -> ary or nil
- *     ary.uniq! { |item| ... } -> ary or nil
+ *    array.uniq! -> self or nil
+ *    array.uniq! {|element| ... } -> self or nil
+ *
+ *  Removes duplicate elements from +self+, the first occurrence always being retained;
+ *  returns +self+ if any elements removed, +nil+ otherwise.
  *
- *  Removes duplicate elements from +self+. If a block is given,
- *  it will use the return value of the block for comparison.
- *  Returns <code>nil</code> if no changes are made (that is, no
- *  duplicates are found).
+ *  With no block given, identifies and removes elements using method <tt>eql?</tt>
+ *  to compare.
  *
- *     a = [ "a", "a", "b", "b", "c" ]
- *     a.uniq!   # => ["a", "b", "c"]
+ *  Returns +self+ if any elements removed:
  *
- *     b = [ "a", "b", "c" ]
- *     b.uniq!   # => nil
+ *    a = [0, 0, 1, 1, 2, 2]
+ *    a.uniq! # => [0, 1, 2]
  *
- *     c = [["student","sam"], ["student","george"], ["teacher","matz"]]
- *     c.uniq! { |s| s.first } # => [["student", "sam"], ["teacher", "matz"]]
+ *  Returns +nil+ if no elements removed.
  *
+ *  With a block given, calls the block for each element;
+ *  identifies (using method <tt>eql?</tt>) and removes
+ *  elements for which the block returns duplicate values.
+ *
+ *  Returns +self+ if any elements removed:
+ *
+ *    a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
+ *    a.uniq! {|element| element.size } # => ['a', 'aa', 'aaa']
+ *
+ *  Returns +nil+ if no elements removed.
  */
-
 static VALUE
 rb_ary_uniq_bang(VALUE ary)
 {
-    VALUE hash, v;
-    long i, j;
+    VALUE hash;
+    long hash_size;
 
     rb_ary_modify_check(ary);
     if (RARRAY_LEN(ary) <= 1)
         return Qnil;
-    if (rb_block_given_p()) {
-	hash = ary_make_hash_by(ary);
-	if (RARRAY_LEN(ary) == (i = RHASH_SIZE(hash))) {
-	    return Qnil;
-	}
-	ARY_SET_LEN(ary, 0);
-	if (ARY_SHARED_P(ary) && !ARY_EMBED_P(ary)) {
-	    rb_ary_unshare(ary);
-	    FL_SET_EMBED(ary);
-	}
-	ary_resize_capa(ary, i);
-	st_foreach(RHASH_TBL(hash), push_value, ary);
+    if (rb_block_given_p())
+        hash = ary_make_hash_by(ary);
+    else
+        hash = ary_make_hash(ary);
+
+    hash_size = RHASH_SIZE(hash);
+    if (RARRAY_LEN(ary) == hash_size) {
+        return Qnil;
     }
-    else {
-	hash = ary_make_hash(ary);
-	if (RARRAY_LEN(ary) == (long)RHASH_SIZE(hash)) {
-	    return Qnil;
-	}
-	for (i=j=0; i<RARRAY_LEN(ary); i++) {
-	    st_data_t vv = (st_data_t)(v = rb_ary_elt(ary, i));
-	    if (st_delete(RHASH_TBL(hash), &vv, 0)) {
-		rb_ary_store(ary, j++, v);
-	    }
-	}
-	ARY_SET_LEN(ary, j);
+    rb_ary_modify_check(ary);
+    ARY_SET_LEN(ary, 0);
+    if (ARY_SHARED_P(ary) && !ARY_EMBED_P(ary)) {
+        rb_ary_unshare(ary);
+        FL_SET_EMBED(ary);
     }
+    ary_resize_capa(ary, hash_size);
+    rb_hash_foreach(hash, push_value, ary);
     ary_recycle_hash(hash);
 
     return ary;
@@ -3600,57 +6366,58 @@ rb_ary_uniq_bang(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.uniq                -> ary or nil
- *     ary.uniq { |item| ... } -> ary or nil
+ *    array.uniq -> new_array
+ *    array.uniq {|element| ... } -> new_array
  *
- *  Returns a new array by removing duplicate values in +self+. If a block
- *  is given, it will use the return value of the block for comparison.
+ *  Returns a new \Array containing those elements from +self+ that are not duplicates,
+ *  the first occurrence always being retained.
  *
- *     a = [ "a", "a", "b", "b", "c" ]
- *     a.uniq   # => ["a", "b", "c"]
+ *  With no block given, identifies and omits duplicates using method <tt>eql?</tt>
+ *  to compare:
  *
- *     b = [["student","sam"], ["student","george"], ["teacher","matz"]]
- *     b.uniq { |s| s.first } # => [["student", "sam"], ["teacher", "matz"]]
+ *    a = [0, 0, 1, 1, 2, 2]
+ *    a.uniq # => [0, 1, 2]
+ *
+ *  With a block given, calls the block for each element;
+ *  identifies (using method <tt>eql?</tt>) and omits duplicate values,
+ *  that is, those elements for which the block returns the same value:
+ *
+ *    a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
+ *    a.uniq {|element| element.size } # => ["a", "aa", "aaa"]
  *
  */
 
 static VALUE
 rb_ary_uniq(VALUE ary)
 {
-    VALUE hash, uniq, v;
-    long i;
+    VALUE hash, uniq;
 
-    if (RARRAY_LEN(ary) <= 1)
-        return rb_ary_dup(ary);
-    if (rb_block_given_p()) {
-	hash = ary_make_hash_by(ary);
-	uniq = ary_new(rb_obj_class(ary), RHASH_SIZE(hash));
-	st_foreach(RHASH_TBL(hash), push_value, uniq);
+    if (RARRAY_LEN(ary) <= 1) {
+        hash = 0;
+        uniq = rb_ary_dup(ary);
+    }
+    else if (rb_block_given_p()) {
+        hash = ary_make_hash_by(ary);
+        uniq = rb_hash_values(hash);
     }
     else {
-	hash = ary_make_hash(ary);
-	uniq = ary_new(rb_obj_class(ary), RHASH_SIZE(hash));
-	for (i=0; i<RARRAY_LEN(ary); i++) {
-	    st_data_t vv = (st_data_t)(v = rb_ary_elt(ary, i));
-	    if (st_delete(RHASH_TBL(hash), &vv, 0)) {
-		rb_ary_push(uniq, v);
-	    }
-	}
+        hash = ary_make_hash(ary);
+        uniq = rb_hash_values(hash);
+    }
+    if (hash) {
+        ary_recycle_hash(hash);
     }
-    ary_recycle_hash(hash);
 
     return uniq;
 }
 
 /*
  *  call-seq:
- *     ary.compact!    -> ary  or  nil
+ *    array.compact! -> self or nil
  *
- *  Removes +nil+ elements from the array.
- *  Returns +nil+ if no changes were made, otherwise returns the array.
+ *  Removes all +nil+ elements from +self+.
  *
- *     [ "a", nil, "b", nil, "c" ].compact! #=> [ "a", "b", "c" ]
- *     [ "a", "b", "c" ].compact!           #=> nil
+ *  Returns +self+ if any elements removed, otherwise +nil+.
  */
 
 static VALUE
@@ -3660,33 +6427,30 @@ rb_ary_compact_bang(VALUE ary)
     long n;
 
     rb_ary_modify(ary);
-    p = t = RARRAY_PTR(ary);
+    p = t = (VALUE *)RARRAY_CONST_PTR_TRANSIENT(ary); /* WB: no new reference */
     end = p + RARRAY_LEN(ary);
 
     while (t < end) {
-	if (NIL_P(*t)) t++;
-	else *p++ = *t++;
+        if (NIL_P(*t)) t++;
+        else *p++ = *t++;
     }
-    n = p - RARRAY_PTR(ary);
+    n = p - RARRAY_CONST_PTR_TRANSIENT(ary);
     if (RARRAY_LEN(ary) == n) {
-	return Qnil;
-    }
-    ARY_SET_LEN(ary, n);
-    if (n * 2 < ARY_CAPA(ary) && ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
-	ary_resize_capa(ary, n * 2);
+        return Qnil;
     }
+    ary_resize_smaller(ary, n);
 
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.compact     -> new_ary
+ *    array.compact -> new_array
  *
- *  Returns a copy of +self+ with all +nil+ elements removed.
+ *  Returns a new \Array containing all non-+nil+ elements from +self+:
  *
- *     [ "a", nil, "b", nil, "c", nil ].compact
- *                       #=> [ "a", "b", "c" ]
+ *    a = [nil, 0, nil, 1, nil, 2, nil]
+ *    a.compact # => [0, 1, 2]
  */
 
 static VALUE
@@ -3699,122 +6463,182 @@ rb_ary_compact(VALUE ary)
 
 /*
  *  call-seq:
- *     ary.count      -> int
- *     ary.count(obj) -> int
- *     ary.count { |item| block }  -> int
+ *    array.count -> an_integer
+ *    array.count(obj) -> an_integer
+ *    array.count {|element| ... } -> an_integer
+ *
+ *  Returns a count of specified elements.
+ *
+ *  With no argument and no block, returns the count of all elements:
  *
- *  Returns the number of elements.  If an argument is given, counts
- *  the number of elements which equals to +obj+.  If a block is
- *  given, counts the number of elements for which the block returns a true
- *  value.
+ *    [0, 1, 2].count # => 3
+ *    [].count # => 0
  *
- *     ary = [1, 2, 4, 2]
- *     ary.count             #=> 4
- *     ary.count(2)          #=> 2
- *     ary.count{|x|x%2==0}  #=> 3
+ *  With argument +obj+, returns the count of elements <tt>==</tt> to +obj+:
  *
+ *    [0, 1, 2, 0.0].count(0) # => 2
+ *    [0, 1, 2].count(3) # => 0
+ *
+ *  With no argument and a block given, calls the block with each element;
+ *  returns the count of elements for which the block returns a truthy value:
+ *
+ *    [0, 1, 2, 3].count {|element| element > 1} # => 2
+ *
+ *  With argument +obj+ and a block given, issues a warning, ignores the block,
+ *  and returns the count of elements <tt>==</tt> to +obj+.
  */
 
 static VALUE
 rb_ary_count(int argc, VALUE *argv, VALUE ary)
 {
-    long n = 0;
+    long i, n = 0;
 
-    if (argc == 0) {
-	VALUE *p, *pend;
+    if (rb_check_arity(argc, 0, 1) == 0) {
+        VALUE v;
 
-	if (!rb_block_given_p())
-	    return LONG2NUM(RARRAY_LEN(ary));
+        if (!rb_block_given_p())
+            return LONG2NUM(RARRAY_LEN(ary));
 
-	for (p = RARRAY_PTR(ary), pend = p + RARRAY_LEN(ary); p < pend; p++) {
-	    if (RTEST(rb_yield(*p))) n++;
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            v = RARRAY_AREF(ary, i);
+            if (RTEST(rb_yield(v))) n++;
+        }
     }
     else {
-	VALUE obj, *p, *pend;
+        VALUE obj = argv[0];
 
-	rb_scan_args(argc, argv, "1", &obj);
-	if (rb_block_given_p()) {
-	    rb_warn("given block not used");
-	}
-	for (p = RARRAY_PTR(ary), pend = p + RARRAY_LEN(ary); p < pend; p++) {
-	    if (rb_equal(*p, obj)) n++;
-	}
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            if (rb_equal(RARRAY_AREF(ary, i), obj)) n++;
+        }
     }
 
     return LONG2NUM(n);
 }
 
 static VALUE
-flatten(VALUE ary, int level, int *modified)
+flatten(VALUE ary, int level)
 {
-    long i = 0;
-    VALUE stack, result, tmp, elt;
-    st_table *memo;
+    long i;
+    VALUE stack, result, tmp = 0, elt, vmemo;
+    st_table *memo = 0;
     st_data_t id;
 
-    stack = ary_new(0, ARY_DEFAULT_SIZE);
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        elt = RARRAY_AREF(ary, i);
+        tmp = rb_check_array_type(elt);
+        if (!NIL_P(tmp)) {
+            break;
+        }
+    }
+    if (i == RARRAY_LEN(ary)) {
+        return ary;
+    }
+
     result = ary_new(0, RARRAY_LEN(ary));
-    memo = st_init_numtable();
-    st_insert(memo, (st_data_t)ary, (st_data_t)Qtrue);
-    *modified = 0;
+    ary_memcpy(result, 0, i, RARRAY_CONST_PTR_TRANSIENT(ary));
+    ARY_SET_LEN(result, i);
+
+    stack = ary_new(0, ARY_DEFAULT_SIZE);
+    rb_ary_push(stack, ary);
+    rb_ary_push(stack, LONG2NUM(i + 1));
+
+    if (level < 0) {
+        vmemo = rb_hash_new();
+        RBASIC_CLEAR_CLASS(vmemo);
+        memo = st_init_numtable();
+        rb_hash_st_table_set(vmemo, memo);
+        st_insert(memo, (st_data_t)ary, (st_data_t)Qtrue);
+        st_insert(memo, (st_data_t)tmp, (st_data_t)Qtrue);
+    }
+
+    ary = tmp;
+    i = 0;
 
     while (1) {
-	while (i < RARRAY_LEN(ary)) {
-	    elt = RARRAY_PTR(ary)[i++];
-	    tmp = rb_check_array_type(elt);
-	    if (RBASIC(result)->klass) {
-		rb_raise(rb_eRuntimeError, "flatten reentered");
-	    }
-	    if (NIL_P(tmp) || (level >= 0 && RARRAY_LEN(stack) / 2 >= level)) {
-		rb_ary_push(result, elt);
-	    }
-	    else {
-		*modified = 1;
-		id = (st_data_t)tmp;
-		if (st_lookup(memo, id, 0)) {
-		    st_free_table(memo);
-		    rb_raise(rb_eArgError, "tried to flatten recursive array");
-		}
-		st_insert(memo, id, (st_data_t)Qtrue);
-		rb_ary_push(stack, ary);
-		rb_ary_push(stack, LONG2NUM(i));
-		ary = tmp;
-		i = 0;
-	    }
-	}
-	if (RARRAY_LEN(stack) == 0) {
-	    break;
-	}
-	id = (st_data_t)ary;
-	st_delete(memo, &id, 0);
-	tmp = rb_ary_pop(stack);
-	i = NUM2LONG(tmp);
-	ary = rb_ary_pop(stack);
-    }
-
-    st_free_table(memo);
-
-    RBASIC(result)->klass = rb_class_of(ary);
+        while (i < RARRAY_LEN(ary)) {
+            elt = RARRAY_AREF(ary, i++);
+            if (level >= 0 && RARRAY_LEN(stack) / 2 >= level) {
+                rb_ary_push(result, elt);
+                continue;
+            }
+            tmp = rb_check_array_type(elt);
+            if (RBASIC(result)->klass) {
+                if (memo) {
+                    RB_GC_GUARD(vmemo);
+                    st_clear(memo);
+                }
+                rb_raise(rb_eRuntimeError, "flatten reentered");
+            }
+            if (NIL_P(tmp)) {
+                rb_ary_push(result, elt);
+            }
+            else {
+                if (memo) {
+                    id = (st_data_t)tmp;
+                    if (st_is_member(memo, id)) {
+                        st_clear(memo);
+                        rb_raise(rb_eArgError, "tried to flatten recursive array");
+                    }
+                    st_insert(memo, id, (st_data_t)Qtrue);
+                }
+                rb_ary_push(stack, ary);
+                rb_ary_push(stack, LONG2NUM(i));
+                ary = tmp;
+                i = 0;
+            }
+        }
+        if (RARRAY_LEN(stack) == 0) {
+            break;
+        }
+        if (memo) {
+            id = (st_data_t)ary;
+            st_delete(memo, &id, 0);
+        }
+        tmp = rb_ary_pop(stack);
+        i = NUM2LONG(tmp);
+        ary = rb_ary_pop(stack);
+    }
+
+    if (memo) {
+        st_clear(memo);
+    }
+
+    RBASIC_SET_CLASS(result, rb_cArray);
     return result;
 }
 
 /*
  *  call-seq:
- *     ary.flatten!        -> ary or nil
- *     ary.flatten!(level) -> array or nil
- *
- *  Flattens +self+ in place.
- *  Returns <code>nil</code> if no modifications were made (i.e.,
- *  the array contains no subarrays.)  If the optional +level+
- *  argument determines the level of recursion to flatten.
- *
- *     a = [ 1, 2, [3, [4, 5] ] ]
- *     a.flatten!   #=> [1, 2, 3, 4, 5]
- *     a.flatten!   #=> nil
- *     a            #=> [1, 2, 3, 4, 5]
- *     a = [ 1, 2, [3, [4, 5] ] ]
- *     a.flatten!(1) #=> [1, 2, 3, [4, 5]]
+ *    array.flatten! -> self or nil
+ *    array.flatten!(level) -> self or nil
+ *
+ *  Replaces each nested \Array in +self+ with the elements from that \Array;
+ *  returns +self+ if any changes, +nil+ otherwise.
+ *
+ *  With non-negative \Integer argument +level+, flattens recursively through +level+ levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(1) # => [0, 1, [2, 3], 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(2) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(3) # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten!(1) # => nil
+ *
+ *  With no argument, a +nil+ argument, or with negative argument +level+, flattens all levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten! # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten! # => nil
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(-1) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten!(-2) # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten!(-1) # => nil
+ *
  */
 
 static VALUE
@@ -3823,15 +6647,14 @@ rb_ary_flatten_bang(int argc, VALUE *argv, VALUE ary)
     int mod = 0, level = -1;
     VALUE result, lv;
 
-    rb_scan_args(argc, argv, "01", &lv);
+    lv = (rb_check_arity(argc, 0, 1) ? argv[0] : Qnil);
     rb_ary_modify_check(ary);
     if (!NIL_P(lv)) level = NUM2INT(lv);
     if (level == 0) return Qnil;
 
-    result = flatten(ary, level, &mod);
-    if (mod == 0) {
-	ary_discard(result);
-	return Qnil;
+    result = flatten(ary, level);
+    if (result == ary) {
+        return Qnil;
     }
     if (!(mod = ARY_EMBED_P(result))) rb_obj_freeze(result);
     rb_ary_replace(ary, result);
@@ -3842,599 +6665,889 @@ rb_ary_flatten_bang(int argc, VALUE *argv, VALUE ary)
 
 /*
  *  call-seq:
- *     ary.flatten -> new_ary
- *     ary.flatten(level) -> new_ary
- *
- *  Returns a new array that is a one-dimensional flattening of this
- *  array (recursively). That is, for every element that is an array,
- *  extract its elements into the new array.  If the optional
- *  +level+ argument determines the level of recursion to flatten.
- *
- *     s = [ 1, 2, 3 ]           #=> [1, 2, 3]
- *     t = [ 4, 5, 6, [7, 8] ]   #=> [4, 5, 6, [7, 8]]
- *     a = [ s, t, 9, 10 ]       #=> [[1, 2, 3], [4, 5, 6, [7, 8]], 9, 10]
- *     a.flatten                 #=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
- *     a = [ 1, 2, [3, [4, 5] ] ]
- *     a.flatten(1)              #=> [1, 2, 3, [4, 5]]
+ *    array.flatten -> new_array
+ *    array.flatten(level) -> new_array
+ *
+ *  Returns a new \Array that is a recursive flattening of +self+:
+ *  - Each non-Array element is unchanged.
+ *  - Each \Array is replaced by its individual elements.
+ *
+ *  With non-negative \Integer argument +level+, flattens recursively through +level+ levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(0) # => [0, [1, [2, 3], 4], 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(1) # => [0, 1, [2, 3], 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(2) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(3) # => [0, 1, 2, 3, 4, 5]
+ *
+ *  With no argument, a +nil+ argument, or with negative argument +level+, flattens all levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten # => [0, 1, 2]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(-1) # => [0, 1, 2, 3, 4, 5]
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5 ]
+ *    a.flatten(-2) # => [0, 1, 2, 3, 4, 5]
+ *    [0, 1, 2].flatten(-1) # => [0, 1, 2]
+ *
  */
 
 static VALUE
 rb_ary_flatten(int argc, VALUE *argv, VALUE ary)
 {
-    int mod = 0, level = -1;
-    VALUE result, lv;
+    int level = -1;
+    VALUE result;
 
-    rb_scan_args(argc, argv, "01", &lv);
-    if (!NIL_P(lv)) level = NUM2INT(lv);
-    if (level == 0) return ary_make_shared_copy(ary);
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(argv[0])) {
+        level = NUM2INT(argv[0]);
+        if (level == 0) return ary_make_shared_copy(ary);
+    }
 
-    result = flatten(ary, level, &mod);
-    OBJ_INFECT(result, ary);
+    result = flatten(ary, level);
+    if (result == ary) {
+        result = ary_make_shared_copy(ary);
+    }
 
     return result;
 }
 
-#define OPTHASH_GIVEN_P(opts) \
-    (argc > 0 && !NIL_P((opts) = rb_check_hash_type(argv[argc-1])) && (--argc, 1))
-static VALUE sym_random;
-
-#define RAND_UPTO(max) (long)(rb_random_real(randgen)*(max))
-
-/*
- *  call-seq:
- *     ary.shuffle!              -> ary
- *     ary.shuffle!(random: rng) -> ary
- *
- *  Shuffles elements in +self+ in place.
- *  If +rng+ is given, it will be used as the random number generator.
- */
+#define RAND_UPTO(max) (long)rb_random_ulong_limited((randgen), (max)-1)
 
 static VALUE
-rb_ary_shuffle_bang(int argc, VALUE *argv, VALUE ary)
+rb_ary_shuffle_bang(rb_execution_context_t *ec, VALUE ary, VALUE randgen)
 {
-    VALUE *ptr, opts, *snap_ptr, randgen = rb_cRandom;
-    long i, snap_len;
+    long i, len;
 
-    if (OPTHASH_GIVEN_P(opts)) {
-	randgen = rb_hash_lookup2(opts, sym_random, randgen);
-    }
-    rb_check_arity(argc, 0, 0);
     rb_ary_modify(ary);
-    i = RARRAY_LEN(ary);
-    ptr = RARRAY_PTR(ary);
-    snap_len = i;
-    snap_ptr = ptr;
-    while (i) {
-	long j = RAND_UPTO(i);
-	VALUE tmp;
-	if (snap_len != RARRAY_LEN(ary) || snap_ptr != RARRAY_PTR(ary)) {
-	    rb_raise(rb_eRuntimeError, "modified during shuffle");
-	}
-	tmp = ptr[--i];
-	ptr[i] = ptr[j];
-	ptr[j] = tmp;
-    }
+    i = len = RARRAY_LEN(ary);
+    RARRAY_PTR_USE(ary, ptr, {
+        while (i) {
+            long j = RAND_UPTO(i);
+            VALUE tmp;
+            if (len != RARRAY_LEN(ary) || ptr != RARRAY_CONST_PTR_TRANSIENT(ary)) {
+                rb_raise(rb_eRuntimeError, "modified during shuffle");
+            }
+            tmp = ptr[--i];
+            ptr[i] = ptr[j];
+            ptr[j] = tmp;
+        }
+    }); /* WB: no new reference */
     return ary;
 }
 
-
-/*
- *  call-seq:
- *     ary.shuffle              -> new_ary
- *     ary.shuffle(random: rng) -> new_ary
- *
- *  Returns a new array with elements of this array shuffled.
- *
- *     a = [ 1, 2, 3 ]           #=> [1, 2, 3]
- *     a.shuffle                 #=> [2, 3, 1]
- *
- *  If +rng+ is given, it will be used as the random number generator.
- *
- *     a.shuffle(random: Random.new(1))  #=> [1, 3, 2]
- */
-
 static VALUE
-rb_ary_shuffle(int argc, VALUE *argv, VALUE ary)
+rb_ary_shuffle(rb_execution_context_t *ec, VALUE ary, VALUE randgen)
 {
     ary = rb_ary_dup(ary);
-    rb_ary_shuffle_bang(argc, argv, ary);
+    rb_ary_shuffle_bang(ec, ary, randgen);
     return ary;
 }
 
-
-/*
- *  call-seq:
- *     ary.sample                  -> obj
- *     ary.sample(random: rng)     -> obj
- *     ary.sample(n)               -> new_ary
- *     ary.sample(n, random: rng)  -> new_ary
- *
- *  Choose a random element or +n+ random elements from the array. The elements
- *  are chosen by using random and unique indices into the array in order to
- *  ensure that an element doesn't repeat itself unless the array already
- *  contained duplicate elements. If the array is empty the first form returns
- *  <code>nil</code> and the second form returns an empty array.
- *
- *  If +rng+ is given, it will be used as the random number generator.
- *
- *     a = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]
- *     a.sample         #=> 7
- *     a.sample(4)      #=> [6, 4, 2, 5]
- */
-
-
 static VALUE
-rb_ary_sample(int argc, VALUE *argv, VALUE ary)
+ary_sample(rb_execution_context_t *ec, VALUE ary, VALUE randgen, VALUE nv, VALUE to_array)
 {
-    VALUE nv, result, *ptr;
-    VALUE opts, randgen = rb_cRandom;
+    VALUE result;
     long n, len, i, j, k, idx[10];
-    double rnds[numberof(idx)];
+    long rnds[numberof(idx)];
+    long memo_threshold;
 
-    if (OPTHASH_GIVEN_P(opts)) {
-	randgen = rb_hash_lookup2(opts, sym_random, randgen);
-    }
-    ptr = RARRAY_PTR(ary);
     len = RARRAY_LEN(ary);
-    if (argc == 0) {
-	if (len == 0) return Qnil;
-	if (len == 1) {
-	    i = 0;
-	}
-	else {
-	    double x = rb_random_real(randgen);
-	    if ((len = RARRAY_LEN(ary)) == 0) return Qnil;
-	    i = (long)(x * len);
-	}
-	return RARRAY_PTR(ary)[i];
-    }
-    rb_scan_args(argc, argv, "1", &nv);
+    if (!to_array) {
+        if (len < 2)
+            i = 0;
+        else
+            i = RAND_UPTO(len);
+
+        return rb_ary_elt(ary, i);
+    }
     n = NUM2LONG(nv);
     if (n < 0) rb_raise(rb_eArgError, "negative sample number");
     if (n > len) n = len;
     if (n <= numberof(idx)) {
-	for (i = 0; i < n; ++i) {
-	    rnds[i] = rb_random_real(randgen);
-	}
+        for (i = 0; i < n; ++i) {
+            rnds[i] = RAND_UPTO(len - i);
+        }
     }
+    k = len;
     len = RARRAY_LEN(ary);
-    ptr = RARRAY_PTR(ary);
+    if (len < k && n <= numberof(idx)) {
+        for (i = 0; i < n; ++i) {
+            if (rnds[i] >= len) return rb_ary_new_capa(0);
+        }
+    }
     if (n > len) n = len;
     switch (n) {
       case 0:
-	return rb_ary_new2(0);
+        return rb_ary_new_capa(0);
       case 1:
-	i = (long)(rnds[0] * len);
-	return rb_ary_new4(1, &ptr[i]);
+        i = rnds[0];
+        return rb_ary_new_from_args(1, RARRAY_AREF(ary, i));
       case 2:
-	i = (long)(rnds[0] * len);
-	j = (long)(rnds[1] * (len-1));
-	if (j >= i) j++;
-	return rb_ary_new3(2, ptr[i], ptr[j]);
+        i = rnds[0];
+        j = rnds[1];
+        if (j >= i) j++;
+        return rb_ary_new_from_args(2, RARRAY_AREF(ary, i), RARRAY_AREF(ary, j));
       case 3:
-	i = (long)(rnds[0] * len);
-	j = (long)(rnds[1] * (len-1));
-	k = (long)(rnds[2] * (len-2));
-	{
-	    long l = j, g = i;
-	    if (j >= i) l = i, g = ++j;
-	    if (k >= l && (++k >= g)) ++k;
-	}
-	return rb_ary_new3(3, ptr[i], ptr[j], ptr[k]);
+        i = rnds[0];
+        j = rnds[1];
+        k = rnds[2];
+        {
+            long l = j, g = i;
+            if (j >= i) l = i, g = ++j;
+            if (k >= l && (++k >= g)) ++k;
+        }
+        return rb_ary_new_from_args(3, RARRAY_AREF(ary, i), RARRAY_AREF(ary, j), RARRAY_AREF(ary, k));
     }
+    memo_threshold =
+        len < 2560 ? len / 128 :
+        len < 5120 ? len / 64 :
+        len < 10240 ? len / 32 :
+        len / 16;
     if (n <= numberof(idx)) {
-	VALUE *ptr_result;
-	long sorted[numberof(idx)];
-	sorted[0] = idx[0] = (long)(rnds[0] * len);
-	for (i=1; i<n; i++) {
-	    k = (long)(rnds[i] * --len);
-	    for (j = 0; j < i; ++j) {
-		if (k < sorted[j]) break;
-		++k;
-	    }
-	    memmove(&sorted[j+1], &sorted[j], sizeof(sorted[0])*(i-j));
-	    sorted[j] = idx[i] = k;
-	}
-	result = rb_ary_new2(n);
-	ptr_result = RARRAY_PTR(result);
-	for (i=0; i<n; i++) {
-	    ptr_result[i] = ptr[idx[i]];
-	}
+        long sorted[numberof(idx)];
+        sorted[0] = idx[0] = rnds[0];
+        for (i=1; i<n; i++) {
+            k = rnds[i];
+            for (j = 0; j < i; ++j) {
+                if (k < sorted[j]) break;
+                ++k;
+            }
+            memmove(&sorted[j+1], &sorted[j], sizeof(sorted[0])*(i-j));
+            sorted[j] = idx[i] = k;
+        }
+        result = rb_ary_new_capa(n);
+        RARRAY_PTR_USE_TRANSIENT(result, ptr_result, {
+            for (i=0; i<n; i++) {
+                ptr_result[i] = RARRAY_AREF(ary, idx[i]);
+            }
+        });
+    }
+    else if (n <= memo_threshold / 2) {
+        long max_idx = 0;
+#undef RUBY_UNTYPED_DATA_WARNING
+#define RUBY_UNTYPED_DATA_WARNING 0
+        VALUE vmemo = Data_Wrap_Struct(0, 0, st_free_table, 0);
+        st_table *memo = st_init_numtable_with_size(n);
+        DATA_PTR(vmemo) = memo;
+        result = rb_ary_new_capa(n);
+        RARRAY_PTR_USE(result, ptr_result, {
+            for (i=0; i<n; i++) {
+                long r = RAND_UPTO(len-i) + i;
+                ptr_result[i] = r;
+                if (r > max_idx) max_idx = r;
+            }
+            len = RARRAY_LEN(ary);
+            if (len <= max_idx) n = 0;
+            else if (n > len) n = len;
+            RARRAY_PTR_USE_TRANSIENT(ary, ptr_ary, {
+                for (i=0; i<n; i++) {
+                    long j2 = j = ptr_result[i];
+                    long i2 = i;
+                    st_data_t value;
+                    if (st_lookup(memo, (st_data_t)i, &value)) i2 = (long)value;
+                    if (st_lookup(memo, (st_data_t)j, &value)) j2 = (long)value;
+                    st_insert(memo, (st_data_t)j, (st_data_t)i2);
+                    ptr_result[i] = ptr_ary[j2];
+                }
+            });
+        });
+        DATA_PTR(vmemo) = 0;
+        st_free_table(memo);
     }
     else {
-	VALUE *ptr_result;
-	result = rb_ary_new4(len, ptr);
-	RBASIC(result)->klass = 0;
-	ptr_result = RARRAY_PTR(result);
-	RB_GC_GUARD(ary);
-	for (i=0; i<n; i++) {
-	    j = RAND_UPTO(len-i) + i;
-	    nv = ptr_result[j];
-	    ptr_result[j] = ptr_result[i];
-	    ptr_result[i] = nv;
-	}
-	RBASIC(result)->klass = rb_cArray;
+        result = rb_ary_dup(ary);
+        RBASIC_CLEAR_CLASS(result);
+        RB_GC_GUARD(ary);
+        RARRAY_PTR_USE(result, ptr_result, {
+            for (i=0; i<n; i++) {
+                j = RAND_UPTO(len-i) + i;
+                nv = ptr_result[j];
+                ptr_result[j] = ptr_result[i];
+                ptr_result[i] = nv;
+            }
+        });
+        RBASIC_SET_CLASS_RAW(result, rb_cArray);
     }
     ARY_SET_LEN(result, n);
 
     return result;
 }
 
+static VALUE
+ary_sample0(rb_execution_context_t *ec, VALUE ary)
+{
+    return ary_sample(ec, ary, rb_cRandom, Qfalse, Qfalse);
+}
+
+static VALUE
+rb_ary_cycle_size(VALUE self, VALUE args, VALUE eobj)
+{
+    long mul;
+    VALUE n = Qnil;
+    if (args && (RARRAY_LEN(args) > 0)) {
+        n = RARRAY_AREF(args, 0);
+    }
+    if (RARRAY_LEN(self) == 0) return INT2FIX(0);
+    if (NIL_P(n)) return DBL2NUM(HUGE_VAL);
+    mul = NUM2LONG(n);
+    if (mul <= 0) return INT2FIX(0);
+    n = LONG2FIX(mul);
+    return rb_fix_mul_fix(rb_ary_length(self), n);
+}
 
 /*
  *  call-seq:
- *     ary.cycle(n=nil) {|obj| block }  -> nil
- *     ary.cycle(n=nil)                 -> an_enumerator
+ *    array.cycle {|element| ... } -> nil
+ *    array.cycle(count) {|element| ... } -> nil
+ *    array.cycle -> new_enumerator
+ *    array.cycle(count) -> new_enumerator
+ *
+ *  When called with positive \Integer argument +count+ and a block,
+ *  calls the block with each element, then does so again,
+ *  until it has done so +count+ times; returns +nil+:
+ *
+ *    output = []
+ *    [0, 1].cycle(2) {|element| output.push(element) } # => nil
+ *    output # => [0, 1, 0, 1]
  *
- *  Calls +block+ for each element repeatedly +n+ times or
- *  forever if none or +nil+ is given.  If a non-positive number is
- *  given or the array is empty, does nothing.  Returns +nil+ if the
- *  loop has finished without getting interrupted.
+ *  If +count+ is zero or negative, does not call the block:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    [0, 1].cycle(0) {|element| fail 'Cannot happen' } # => nil
+ *    [0, 1].cycle(-1) {|element| fail 'Cannot happen' } # => nil
  *
+ *  When a block is given, and argument is omitted or +nil+, cycles forever:
  *
- *     a = ["a", "b", "c"]
- *     a.cycle {|x| puts x }  # print, a, b, c, a, b, c,.. forever.
- *     a.cycle(2) {|x| puts x }  # print, a, b, c, a, b, c.
+ *    # Prints 0 and 1 forever.
+ *    [0, 1].cycle {|element| puts element }
+ *    [0, 1].cycle(nil) {|element| puts element }
+ *
+ *  When no block is given, returns a new \Enumerator:
+ *
+ *    [0, 1].cycle(2) # => #<Enumerator: [0, 1]:cycle(2)>
+ *    [0, 1].cycle # => # => #<Enumerator: [0, 1]:cycle>
+ *    [0, 1].cycle.first(5) # => [0, 1, 0, 1, 0]
  *
  */
-
 static VALUE
 rb_ary_cycle(int argc, VALUE *argv, VALUE ary)
 {
     long n, i;
-    VALUE nv = Qnil;
 
-    rb_scan_args(argc, argv, "01", &nv);
+    rb_check_arity(argc, 0, 1);
 
-    RETURN_ENUMERATOR(ary, argc, argv);
-    if (NIL_P(nv)) {
+    RETURN_SIZED_ENUMERATOR(ary, argc, argv, rb_ary_cycle_size);
+    if (argc == 0 || NIL_P(argv[0])) {
         n = -1;
     }
     else {
-        n = NUM2LONG(nv);
+        n = NUM2LONG(argv[0]);
         if (n <= 0) return Qnil;
     }
 
     while (RARRAY_LEN(ary) > 0 && (n < 0 || 0 < n--)) {
         for (i=0; i<RARRAY_LEN(ary); i++) {
-            rb_yield(RARRAY_PTR(ary)[i]);
+            rb_yield(RARRAY_AREF(ary, i));
         }
     }
     return Qnil;
 }
 
-#define tmpbuf(n, size) rb_str_tmp_new((n)*(size))
-#define tmpbuf_discard(s) (rb_str_resize((s), 0L), RBASIC(s)->klass = rb_cString)
-#define tmpary(n) rb_ary_tmp_new(n)
-#define tmpary_discard(a) (ary_discard(a), RBASIC(a)->klass = rb_cArray)
+/*
+ * Build a ruby array of the corresponding values and yield it to the
+ * associated block.
+ * Return the class of +values+ for reentry check.
+ */
+static int
+yield_indexed_values(const VALUE values, const long r, const long *const p)
+{
+    const VALUE result = rb_ary_new2(r);
+    long i;
+
+    for (i = 0; i < r; i++) ARY_SET(result, i, RARRAY_AREF(values, p[i]));
+    ARY_SET_LEN(result, r);
+    rb_yield(result);
+    return !RBASIC(values)->klass;
+}
 
 /*
- * Recursively compute permutations of r elements of the set [0..n-1].
- * When we have a complete permutation of array indexes, copy the values
- * at those indexes into a new array and yield that array.
+ * Compute permutations of +r+ elements of the set <code>[0..n-1]</code>.
+ *
+ * When we have a complete permutation of array indices, copy the values
+ * at those indices into a new array and yield that array.
  *
  * n: the size of the set
  * r: the number of elements in each permutation
  * p: the array (of size r) that we're filling in
- * index: what index we're filling in now
  * used: an array of booleans: whether a given index is already used
  * values: the Ruby array that holds the actual values to permute
  */
 static void
-permute0(long n, long r, long *p, long index, char *used, VALUE values)
+permute0(const long n, const long r, long *const p, char *const used, const VALUE values)
 {
-    long i,j;
-    for (i = 0; i < n; i++) {
-	if (used[i] == 0) {
-	    p[index] = i;
-	    if (index < r-1) {             /* if not done yet */
-		used[i] = 1;               /* mark index used */
-		permute0(n, r, p, index+1, /* recurse */
-			 used, values);
-		used[i] = 0;               /* index unused */
-	    }
-	    else {
-		/* We have a complete permutation of array indexes */
-		/* Build a ruby array of the corresponding values */
-		/* And yield it to the associated block */
-		VALUE result = rb_ary_new2(r);
-		VALUE *result_array = RARRAY_PTR(result);
-		const VALUE *values_array = RARRAY_PTR(values);
-
-		for (j = 0; j < r; j++) result_array[j] = values_array[p[j]];
-		ARY_SET_LEN(result, r);
-		rb_yield(result);
-		if (RBASIC(values)->klass) {
-		    rb_raise(rb_eRuntimeError, "permute reentered");
-		}
-	    }
-	}
+    long i = 0, index = 0;
+
+    for (;;) {
+        const char *const unused = memchr(&used[i], 0, n-i);
+        if (!unused) {
+            if (!index) break;
+            i = p[--index];                /* pop index */
+            used[i++] = 0;                 /* index unused */
+        }
+        else {
+            i = unused - used;
+            p[index] = i;
+            used[i] = 1;                   /* mark index used */
+            ++index;
+            if (index < r-1) {             /* if not done yet */
+                p[index] = i = 0;
+                continue;
+            }
+            for (i = 0; i < n; ++i) {
+                if (used[i]) continue;
+                p[index] = i;
+                if (!yield_indexed_values(values, r, p)) {
+                    rb_raise(rb_eRuntimeError, "permute reentered");
+                }
+            }
+            i = p[--index];                /* pop index */
+            used[i] = 0;                   /* index unused */
+            p[index] = ++i;
+        }
+    }
+}
+
+/*
+ * Returns the product of from, from-1, ..., from - how_many + 1.
+ * https://en.wikipedia.org/wiki/Pochhammer_symbol
+ */
+static VALUE
+descending_factorial(long from, long how_many)
+{
+    VALUE cnt;
+    if (how_many > 0) {
+        cnt = LONG2FIX(from);
+        while (--how_many > 0) {
+            long v = --from;
+            cnt = rb_int_mul(cnt, LONG2FIX(v));
+        }
+    }
+    else {
+        cnt = LONG2FIX(how_many == 0);
     }
+    return cnt;
+}
+
+static VALUE
+binomial_coefficient(long comb, long size)
+{
+    VALUE r;
+    long i;
+    if (comb > size-comb) {
+        comb = size-comb;
+    }
+    if (comb < 0) {
+        return LONG2FIX(0);
+    }
+    else if (comb == 0) {
+        return LONG2FIX(1);
+    }
+    r = LONG2FIX(size);
+    for (i = 1; i < comb; ++i) {
+        r = rb_int_mul(r, LONG2FIX(size - i));
+        r = rb_int_idiv(r, LONG2FIX(i + 1));
+    }
+    return r;
+}
+
+static VALUE
+rb_ary_permutation_size(VALUE ary, VALUE args, VALUE eobj)
+{
+    long n = RARRAY_LEN(ary);
+    long k = (args && (RARRAY_LEN(args) > 0)) ? NUM2LONG(RARRAY_AREF(args, 0)) : n;
+
+    return descending_factorial(n, k);
 }
 
 /*
  *  call-seq:
- *     ary.permutation { |p| block }          -> ary
- *     ary.permutation                        -> an_enumerator
- *     ary.permutation(n) { |p| block }       -> ary
- *     ary.permutation(n)                     -> an_enumerator
- *
- * When invoked with a block, yield all permutations of length +n+
- * of the elements of the array, then return the array itself.
- * If +n+ is not specified, yield all permutations of all elements.
- * The implementation makes no guarantees about the order in which
- * the permutations are yielded.
- *
- * If no block is given, an enumerator is returned instead.
- *
- * Examples:
- *
- *     a = [1, 2, 3]
- *     a.permutation.to_a     #=> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
- *     a.permutation(1).to_a  #=> [[1],[2],[3]]
- *     a.permutation(2).to_a  #=> [[1,2],[1,3],[2,1],[2,3],[3,1],[3,2]]
- *     a.permutation(3).to_a  #=> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
- *     a.permutation(0).to_a  #=> [[]] # one permutation of length 0
- *     a.permutation(4).to_a  #=> []   # no permutations of length 4
+ *    array.permutation {|element| ... } -> self
+ *    array.permutation(n) {|element| ... } -> self
+ *    array.permutation -> new_enumerator
+ *    array.permutation(n) -> new_enumerator
+ *
+ *  When invoked with a block, yield all permutations of elements of +self+; returns +self+.
+ *  The order of permutations is indeterminate.
+ *
+ *  When a block and an in-range positive \Integer argument +n+ (<tt>0 < n <= self.size</tt>)
+ *  are given, calls the block with all +n+-tuple permutations of +self+.
+ *
+ *  Example:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation(2) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 0]
+ *    [1, 2]
+ *    [2, 0]
+ *    [2, 1]
+ *
+ *  Another example:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation(3) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0, 1, 2]
+ *    [0, 2, 1]
+ *    [1, 0, 2]
+ *    [1, 2, 0]
+ *    [2, 0, 1]
+ *    [2, 1, 0]
+ *
+ *  When +n+ is zero, calls the block once with a new empty \Array:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation(0) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    []
+ *
+ *  When +n+ is out of range (negative or larger than <tt>self.size</tt>),
+ *  does not call the block:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation(-1) {|permutation| fail 'Cannot happen' }
+ *    a.permutation(4) {|permutation| fail 'Cannot happen' }
+ *
+ *  When a block given but no argument,
+ *  behaves the same as <tt>a.permutation(a.size)</tt>:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0, 1, 2]
+ *    [0, 2, 1]
+ *    [1, 0, 2]
+ *    [1, 2, 0]
+ *    [2, 0, 1]
+ *    [2, 1, 0]
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [0, 1, 2]
+ *    a.permutation # => #<Enumerator: [0, 1, 2]:permutation>
+ *    a.permutation(2) # => #<Enumerator: [0, 1, 2]:permutation(2)>
+ *
  */
 
 static VALUE
 rb_ary_permutation(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE num;
     long r, n, i;
 
     n = RARRAY_LEN(ary);                  /* Array length */
-    RETURN_ENUMERATOR(ary, argc, argv);   /* Return enumerator if no block */
-    rb_scan_args(argc, argv, "01", &num);
-    r = NIL_P(num) ? n : NUM2LONG(num);   /* Permutation size from argument */
+    RETURN_SIZED_ENUMERATOR(ary, argc, argv, rb_ary_permutation_size);   /* Return enumerator if no block */
+    r = n;
+    if (rb_check_arity(argc, 0, 1) && !NIL_P(argv[0]))
+        r = NUM2LONG(argv[0]);            /* Permutation size from argument */
 
     if (r < 0 || n < r) {
-	/* no permutations: yield nothing */
+        /* no permutations: yield nothing */
     }
     else if (r == 0) { /* exactly one permutation: the zero-length array */
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (r == 1) { /* this is a special, easy case */
-	for (i = 0; i < RARRAY_LEN(ary); i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_PTR(ary)[i]));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else {             /* this is the general case */
-	volatile VALUE t0 = tmpbuf(n,sizeof(long));
-	long *p = (long*)RSTRING_PTR(t0);
-	volatile VALUE t1 = tmpbuf(n,sizeof(char));
-	char *used = (char*)RSTRING_PTR(t1);
-	VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
-	RBASIC(ary0)->klass = 0;
+        volatile VALUE t0;
+        long *p = ALLOCV_N(long, t0, r+roomof(n, sizeof(long)));
+        char *used = (char*)(p + r);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        RBASIC_CLEAR_CLASS(ary0);
 
-	MEMZERO(used, char, n); /* initialize array */
+        MEMZERO(used, char, n); /* initialize array */
 
-	permute0(n, r, p, 0, used, ary0); /* compute and yield permutations */
-	tmpbuf_discard(t0);
-	tmpbuf_discard(t1);
-	RBASIC(ary0)->klass = rb_cArray;
+        permute0(n, r, p, used, ary0); /* compute and yield permutations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
+static void
+combinate0(const long len, const long n, long *const stack, const VALUE values)
+{
+    long lev = 0;
+
+    MEMZERO(stack+1, long, n);
+    stack[0] = -1;
+    for (;;) {
+        for (lev++; lev < n; lev++) {
+            stack[lev+1] = stack[lev]+1;
+        }
+        if (!yield_indexed_values(values, n, stack+1)) {
+            rb_raise(rb_eRuntimeError, "combination reentered");
+        }
+        do {
+            if (lev == 0) return;
+            stack[lev--]++;
+        } while (stack[lev+1]+n == len+lev+1);
+    }
+}
+
+static VALUE
+rb_ary_combination_size(VALUE ary, VALUE args, VALUE eobj)
+{
+    long n = RARRAY_LEN(ary);
+    long k = NUM2LONG(RARRAY_AREF(args, 0));
+
+    return binomial_coefficient(k, n);
+}
+
 /*
  *  call-seq:
- *     ary.combination(n) { |c| block }    -> ary
- *     ary.combination(n)                  -> an_enumerator
+ *    array.combination(n) {|element| ... } -> self
+ *    array.combination(n) -> new_enumerator
+ *
+ *  Calls the block, if given, with combinations of elements of +self+;
+ *  returns +self+. The order of combinations is indeterminate.
+ *
+ *  When a block and an in-range positive \Integer argument +n+ (<tt>0 < n <= self.size</tt>)
+ *  are given, calls the block with all +n+-tuple combinations of +self+.
+ *
+ *  Example:
+ *
+ *    a = [0, 1, 2]
+ *    a.combination(2) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 2]
+ *
+ *  Another example:
  *
- * When invoked with a block, yields all combinations of length +n+
- * of elements from the array and then returns the array itself.
- * The implementation makes no guarantees about the order in which
- * the combinations are yielded.
+ *    a = [0, 1, 2]
+ *    a.combination(3) {|combination| p combination }
  *
- * If no block is given, an enumerator is returned instead.
+ *  Output:
  *
- * Examples:
+ *    [0, 1, 2]
  *
- *     a = [1, 2, 3, 4]
- *     a.combination(1).to_a  #=> [[1],[2],[3],[4]]
- *     a.combination(2).to_a  #=> [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]
- *     a.combination(3).to_a  #=> [[1,2,3],[1,2,4],[1,3,4],[2,3,4]]
- *     a.combination(4).to_a  #=> [[1,2,3,4]]
- *     a.combination(0).to_a  #=> [[]] # one combination of length 0
- *     a.combination(5).to_a  #=> []   # no combinations of length 5
+ *  When +n+ is zero, calls the block once with a new empty \Array:
+ *
+ *    a = [0, 1, 2]
+ *    a1 = a.combination(0) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    []
+ *
+ *  When +n+ is out of range (negative or larger than <tt>self.size</tt>),
+ *  does not call the block:
+ *
+ *    a = [0, 1, 2]
+ *    a.combination(-1) {|combination| fail 'Cannot happen' }
+ *    a.combination(4) {|combination| fail 'Cannot happen' }
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [0, 1, 2]
+ *    a.combination(2) # => #<Enumerator: [0, 1, 2]:combination(2)>
  *
  */
 
 static VALUE
 rb_ary_combination(VALUE ary, VALUE num)
 {
-    long n, i, len;
+    long i, n, len;
 
     n = NUM2LONG(num);
-    RETURN_ENUMERATOR(ary, 1, &num);
+    RETURN_SIZED_ENUMERATOR(ary, 1, &num, rb_ary_combination_size);
     len = RARRAY_LEN(ary);
     if (n < 0 || len < n) {
-	/* yield nothing */
+        /* yield nothing */
     }
     else if (n == 0) {
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (n == 1) {
-	for (i = 0; i < len; i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_PTR(ary)[i]));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else {
-	volatile VALUE t0 = tmpbuf(n+1, sizeof(long));
-	long *stack = (long*)RSTRING_PTR(t0);
-	volatile VALUE cc = tmpary(n);
-	VALUE *chosen = RARRAY_PTR(cc);
-	long lev = 0;
-
-	MEMZERO(stack, long, n);
-	stack[0] = -1;
-	for (;;) {
-	    chosen[lev] = RARRAY_PTR(ary)[stack[lev+1]];
-	    for (lev++; lev < n; lev++) {
-		chosen[lev] = RARRAY_PTR(ary)[stack[lev+1] = stack[lev]+1];
-	    }
-	    rb_yield(rb_ary_new4(n, chosen));
-	    if (RBASIC(t0)->klass) {
-		rb_raise(rb_eRuntimeError, "combination reentered");
-	    }
-	    do {
-		if (lev == 0) goto done;
-		stack[lev--]++;
-	    } while (stack[lev+1]+n == len+lev+1);
-	}
-    done:
-	tmpbuf_discard(t0);
-	tmpary_discard(cc);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        volatile VALUE t0;
+        long *stack = ALLOCV_N(long, t0, n+1);
+
+        RBASIC_CLEAR_CLASS(ary0);
+        combinate0(len, n, stack, ary0);
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
 /*
- * Recursively compute repeated permutations of r elements of the set
- * [0..n-1].
- * When we have a complete repeated permutation of array indexes, copy the
- * values at those indexes into a new array and yield that array.
+ * Compute repeated permutations of +r+ elements of the set
+ * <code>[0..n-1]</code>.
+ *
+ * When we have a complete repeated permutation of array indices, copy the
+ * values at those indices into a new array and yield that array.
  *
  * n: the size of the set
  * r: the number of elements in each permutation
  * p: the array (of size r) that we're filling in
- * index: what index we're filling in now
  * values: the Ruby array that holds the actual values to permute
  */
 static void
-rpermute0(long n, long r, long *p, long index, VALUE values)
-{
-    long i, j;
-    for (i = 0; i < n; i++) {
-	p[index] = i;
-	if (index < r-1) {              /* if not done yet */
-	    rpermute0(n, r, p, index+1, values); /* recurse */
-	}
-	else {
-	    /* We have a complete permutation of array indexes */
-	    /* Build a ruby array of the corresponding values */
-	    /* And yield it to the associated block */
-	    VALUE result = rb_ary_new2(r);
-	    VALUE *result_array = RARRAY_PTR(result);
-	    const VALUE *values_array = RARRAY_PTR(values);
-
-	    for (j = 0; j < r; j++) result_array[j] = values_array[p[j]];
-	    ARY_SET_LEN(result, r);
-	    rb_yield(result);
-	    if (RBASIC(values)->klass) {
-		rb_raise(rb_eRuntimeError, "repeated permute reentered");
-	    }
-	}
+rpermute0(const long n, const long r, long *const p, const VALUE values)
+{
+    long i = 0, index = 0;
+
+    p[index] = i;
+    for (;;) {
+        if (++index < r-1) {
+            p[index] = i = 0;
+            continue;
+        }
+        for (i = 0; i < n; ++i) {
+            p[index] = i;
+            if (!yield_indexed_values(values, r, p)) {
+                rb_raise(rb_eRuntimeError, "repeated permute reentered");
+            }
+        }
+        do {
+            if (index <= 0) return;
+        } while ((i = ++p[--index]) >= n);
     }
 }
 
+static VALUE
+rb_ary_repeated_permutation_size(VALUE ary, VALUE args, VALUE eobj)
+{
+    long n = RARRAY_LEN(ary);
+    long k = NUM2LONG(RARRAY_AREF(args, 0));
+
+    if (k < 0) {
+        return LONG2FIX(0);
+    }
+    if (n <= 0) {
+        return LONG2FIX(!k);
+    }
+    return rb_int_positive_pow(n, (unsigned long)k);
+}
+
 /*
  *  call-seq:
- *     ary.repeated_permutation(n) { |p| block } -> ary
- *     ary.repeated_permutation(n)               -> an_enumerator
+ *    array.repeated_permutation(n) {|permutation| ... } -> self
+ *    array.repeated_permutation(n) -> new_enumerator
+ *
+ *  Calls the block with each repeated permutation of length +n+ of the elements of +self+;
+ *  each permutation is an \Array;
+ *  returns +self+. The order of the permutations is indeterminate.
  *
- * When invoked with a block, yield all repeated permutations of length
- * +n+ of the elements of the array, then return the array itself.
- * The implementation makes no guarantees about the order in which
- * the repeated permutations are yielded.
+ *  When a block and a positive \Integer argument +n+ are given, calls the block with each
+ *  +n+-tuple repeated permutation of the elements of +self+.
+ *  The number of permutations is <tt>self.size**n</tt>.
  *
- * If no block is given, an enumerator is returned instead.
+ *  +n+ = 1:
  *
- * Examples:
+ *    a = [0, 1, 2]
+ *    a.repeated_permutation(1) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0]
+ *    [1]
+ *    [2]
+ *
+ *  +n+ = 2:
+ *
+ *    a.repeated_permutation(2) {|permutation| p permutation }
+ *
+ *  Output:
+ *
+ *    [0, 0]
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 0]
+ *    [1, 1]
+ *    [1, 2]
+ *    [2, 0]
+ *    [2, 1]
+ *    [2, 2]
+ *
+ *  If +n+ is zero, calls the block once with an empty \Array.
+ *
+ *  If +n+ is negative, does not call the block:
+ *
+ *    a.repeated_permutation(-1) {|permutation| fail 'Cannot happen' }
+ *
+ *  Returns a new \Enumerator if no block given:
+ *
+ *    a = [0, 1, 2]
+ *    a.repeated_permutation(2) # => #<Enumerator: [0, 1, 2]:permutation(2)>
+ *
+ *  Using Enumerators, it's convenient to show the permutations and counts
+ *  for some values of +n+:
+ *
+ *    e = a.repeated_permutation(0)
+ *    e.size # => 1
+ *    e.to_a # => [[]]
+ *    e = a.repeated_permutation(1)
+ *    e.size # => 3
+ *    e.to_a # => [[0], [1], [2]]
+ *    e = a.repeated_permutation(2)
+ *    e.size # => 9
+ *    e.to_a # => [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
  *
- *     a = [1, 2]
- *     a.repeated_permutation(1).to_a  #=> [[1], [2]]
- *     a.repeated_permutation(2).to_a  #=> [[1,1],[1,2],[2,1],[2,2]]
- *     a.repeated_permutation(3).to_a  #=> [[1,1,1],[1,1,2],[1,2,1],[1,2,2],
- *                                     #    [2,1,1],[2,1,2],[2,2,1],[2,2,2]]
- *     a.repeated_permutation(0).to_a  #=> [[]] # one permutation of length 0
  */
-
 static VALUE
 rb_ary_repeated_permutation(VALUE ary, VALUE num)
 {
     long r, n, i;
 
     n = RARRAY_LEN(ary);                  /* Array length */
-    RETURN_ENUMERATOR(ary, 1, &num);      /* Return enumerator if no block */
+    RETURN_SIZED_ENUMERATOR(ary, 1, &num, rb_ary_repeated_permutation_size);      /* Return Enumerator if no block */
     r = NUM2LONG(num);                    /* Permutation size from argument */
 
     if (r < 0) {
-	/* no permutations: yield nothing */
+        /* no permutations: yield nothing */
     }
     else if (r == 0) { /* exactly one permutation: the zero-length array */
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (r == 1) { /* this is a special, easy case */
-	for (i = 0; i < RARRAY_LEN(ary); i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_PTR(ary)[i]));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else {             /* this is the general case */
-	volatile VALUE t0 = tmpbuf(r, sizeof(long));
-	long *p = (long*)RSTRING_PTR(t0);
-	VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
-	RBASIC(ary0)->klass = 0;
+        volatile VALUE t0;
+        long *p = ALLOCV_N(long, t0, r);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        RBASIC_CLEAR_CLASS(ary0);
 
-	rpermute0(n, r, p, 0, ary0); /* compute and yield repeated permutations */
-	tmpbuf_discard(t0);
-	RBASIC(ary0)->klass = rb_cArray;
+        rpermute0(n, r, p, ary0); /* compute and yield repeated permutations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
 static void
-rcombinate0(long n, long r, long *p, long index, long rest, VALUE values)
+rcombinate0(const long n, const long r, long *const p, const long rest, const VALUE values)
 {
-    long j;
-    if (rest > 0) {
-	for (; index < n; ++index) {
-	    p[r-rest] = index;
-	    rcombinate0(n, r, p, index, rest-1, values);
-	}
+    long i = 0, index = 0;
+
+    p[index] = i;
+    for (;;) {
+        if (++index < r-1) {
+            p[index] = i;
+            continue;
+        }
+        for (; i < n; ++i) {
+            p[index] = i;
+            if (!yield_indexed_values(values, r, p)) {
+                rb_raise(rb_eRuntimeError, "repeated combination reentered");
+            }
+        }
+        do {
+            if (index <= 0) return;
+        } while ((i = ++p[--index]) >= n);
     }
-    else {
-	VALUE result = rb_ary_new2(r);
-	VALUE *result_array = RARRAY_PTR(result);
-	const VALUE *values_array = RARRAY_PTR(values);
+}
 
-	for (j = 0; j < r; ++j) result_array[j] = values_array[p[j]];
-	ARY_SET_LEN(result, r);
-	rb_yield(result);
-	if (RBASIC(values)->klass) {
-	    rb_raise(rb_eRuntimeError, "repeated combination reentered");
-	}
+static VALUE
+rb_ary_repeated_combination_size(VALUE ary, VALUE args, VALUE eobj)
+{
+    long n = RARRAY_LEN(ary);
+    long k = NUM2LONG(RARRAY_AREF(args, 0));
+    if (k == 0) {
+        return LONG2FIX(1);
     }
+    return binomial_coefficient(k, n + k - 1);
 }
 
 /*
  *  call-seq:
- *     ary.repeated_combination(n) { |c| block } -> ary
- *     ary.repeated_combination(n)               -> an_enumerator
+ *    array.repeated_combination(n) {|combination| ... } -> self
+ *    array.repeated_combination(n) -> new_enumerator
+ *
+ *  Calls the block with each repeated combination of length +n+ of the elements of +self+;
+ *  each combination is an \Array;
+ *  returns +self+. The order of the combinations is indeterminate.
+ *
+ *  When a block and a positive \Integer argument +n+ are given, calls the block with each
+ *  +n+-tuple repeated combination of the elements of +self+.
+ *  The number of combinations is <tt>(n+1)(n+2)/2</tt>.
+ *
+ *  +n+ = 1:
+ *
+ *    a = [0, 1, 2]
+ *    a.repeated_combination(1) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0]
+ *    [1]
+ *    [2]
+ *
+ *  +n+ = 2:
+ *
+ *    a.repeated_combination(2) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0, 0]
+ *    [0, 1]
+ *    [0, 2]
+ *    [1, 1]
+ *    [1, 2]
+ *    [2, 2]
+ *
+ *  If +n+ is zero, calls the block once with an empty \Array.
  *
- * When invoked with a block, yields all repeated combinations of
- * length +n+ of elements from the array and then returns
- * the array itself.
- * The implementation makes no guarantees about the order in which
- * the repeated combinations are yielded.
+ *  If +n+ is negative, does not call the block:
  *
- * If no block is given, an enumerator is returned instead.
+ *    a.repeated_combination(-1) {|combination| fail 'Cannot happen' }
  *
- * Examples:
+ *  Returns a new \Enumerator if no block given:
  *
- *     a = [1, 2, 3]
- *     a.repeated_combination(1).to_a  #=> [[1], [2], [3]]
- *     a.repeated_combination(2).to_a  #=> [[1,1],[1,2],[1,3],[2,2],[2,3],[3,3]]
- *     a.repeated_combination(3).to_a  #=> [[1,1,1],[1,1,2],[1,1,3],[1,2,2],[1,2,3],
- *                                     #    [1,3,3],[2,2,2],[2,2,3],[2,3,3],[3,3,3]]
- *     a.repeated_combination(4).to_a  #=> [[1,1,1,1],[1,1,1,2],[1,1,1,3],[1,1,2,2],[1,1,2,3],
- *                                     #    [1,1,3,3],[1,2,2,2],[1,2,2,3],[1,2,3,3],[1,3,3,3],
- *                                     #    [2,2,2,2],[2,2,2,3],[2,2,3,3],[2,3,3,3],[3,3,3,3]]
- *     a.repeated_combination(0).to_a  #=> [[]] # one combination of length 0
+ *    a = [0, 1, 2]
+ *    a.repeated_combination(2) # => #<Enumerator: [0, 1, 2]:combination(2)>
+ *
+ *  Using Enumerators, it's convenient to show the combinations and counts
+ *  for some values of +n+:
+ *
+ *    e = a.repeated_combination(0)
+ *    e.size # => 1
+ *    e.to_a # => [[]]
+ *    e = a.repeated_combination(1)
+ *    e.size # => 3
+ *    e.to_a # => [[0], [1], [2]]
+ *    e = a.repeated_combination(2)
+ *    e.size # => 6
+ *    e.to_a # => [[0, 0], [0, 1], [0, 2], [1, 1], [1, 2], [2, 2]]
  *
  */
 
@@ -4444,69 +7557,108 @@ rb_ary_repeated_combination(VALUE ary, VALUE num)
     long n, i, len;
 
     n = NUM2LONG(num);                 /* Combination size from argument */
-    RETURN_ENUMERATOR(ary, 1, &num);   /* Return enumerator if no block */
+    RETURN_SIZED_ENUMERATOR(ary, 1, &num, rb_ary_repeated_combination_size);   /* Return enumerator if no block */
     len = RARRAY_LEN(ary);
     if (n < 0) {
-	/* yield nothing */
+        /* yield nothing */
     }
     else if (n == 0) {
-	rb_yield(rb_ary_new2(0));
+        rb_yield(rb_ary_new2(0));
     }
     else if (n == 1) {
-	for (i = 0; i < len; i++) {
-	    rb_yield(rb_ary_new3(1, RARRAY_PTR(ary)[i]));
-	}
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
     }
     else if (len == 0) {
-	/* yield nothing */
+        /* yield nothing */
     }
     else {
-	volatile VALUE t0 = tmpbuf(n, sizeof(long));
-	long *p = (long*)RSTRING_PTR(t0);
-	VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
-	RBASIC(ary0)->klass = 0;
+        volatile VALUE t0;
+        long *p = ALLOCV_N(long, t0, n);
+        VALUE ary0 = ary_make_shared_copy(ary); /* private defensive copy of ary */
+        RBASIC_CLEAR_CLASS(ary0);
 
-	rcombinate0(len, n, p, 0, n, ary0); /* compute and yield repeated combinations */
-	tmpbuf_discard(t0);
-	RBASIC(ary0)->klass = rb_cArray;
+        rcombinate0(len, n, p, n, ary0); /* compute and yield repeated combinations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
     }
     return ary;
 }
 
 /*
  *  call-seq:
- *     ary.product(other_ary, ...)                -> new_ary
- *     ary.product(other_ary, ...) { |p| block }  -> ary
- *
- *  Returns an array of all combinations of elements from all arrays.
- *  The length of the returned array is the product of the length
- *  of +self+ and the argument arrays.
- *  If given a block, #product will yield all combinations
- *  and return +self+ instead.
- *
- *
- *     [1,2,3].product([4,5])     #=> [[1,4],[1,5],[2,4],[2,5],[3,4],[3,5]]
- *     [1,2].product([1,2])       #=> [[1,1],[1,2],[2,1],[2,2]]
- *     [1,2].product([3,4],[5,6]) #=> [[1,3,5],[1,3,6],[1,4,5],[1,4,6],
- *                                #     [2,3,5],[2,3,6],[2,4,5],[2,4,6]]
- *     [1,2].product()            #=> [[1],[2]]
- *     [1,2].product([])          #=> []
+ *    array.product(*other_arrays) -> new_array
+ *    array.product(*other_arrays) {|combination| ... } -> self
+ *
+ *  Computes and returns or yields all combinations of elements from all the Arrays,
+ *  including both +self+ and +other_arrays+:
+ *
+ *  - The number of combinations is the product of the sizes of all the arrays,
+ *    including both +self+ and +other_arrays+.
+ *  - The order of the returned combinations is indeterminate.
+ *
+ *  When no block is given, returns the combinations as an \Array of Arrays:
+ *
+ *    a = [0, 1, 2]
+ *    a1 = [3, 4]
+ *    a2 = [5, 6]
+ *    p = a.product(a1)
+ *    p.size # => 6 # a.size * a1.size
+ *    p # => [[0, 3], [0, 4], [1, 3], [1, 4], [2, 3], [2, 4]]
+ *    p = a.product(a1, a2)
+ *    p.size # => 12 # a.size * a1.size * a2.size
+ *    p # => [[0, 3, 5], [0, 3, 6], [0, 4, 5], [0, 4, 6], [1, 3, 5], [1, 3, 6], [1, 4, 5], [1, 4, 6], [2, 3, 5], [2, 3, 6], [2, 4, 5], [2, 4, 6]]
+ *
+ *  If any argument is an empty \Array, returns an empty \Array.
+ *
+ *  If no argument is given, returns an \Array of 1-element Arrays,
+ *  each containing an element of +self+:
+ *
+ *    a.product # => [[0], [1], [2]]
+ *
+ *  When a block is given, yields each combination as an \Array; returns +self+:
+ *
+ *    a.product(a1) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0, 3]
+ *    [0, 4]
+ *    [1, 3]
+ *    [1, 4]
+ *    [2, 3]
+ *    [2, 4]
+ *
+ *  If any argument is an empty \Array, does not call the block:
+ *
+ *    a.product(a1, a2, []) {|combination| fail 'Cannot happen' }
+ *
+ *  If no argument is given, yields each element of +self+ as a 1-element \Array:
+ *
+ *    a.product {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    [0]
+ *    [1]
+ *    [2]
+ *
  */
 
 static VALUE
 rb_ary_product(int argc, VALUE *argv, VALUE ary)
 {
     int n = argc+1;    /* How many arrays we're operating on */
-    volatile VALUE t0 = tmpary(n);
-    volatile VALUE t1 = tmpbuf(n, sizeof(int));
+    volatile VALUE t0 = rb_ary_hidden_new(n);
+    volatile VALUE t1 = Qundef;
     VALUE *arrays = RARRAY_PTR(t0); /* The arrays we're computing the product of */
-    int *counters = (int*)RSTRING_PTR(t1); /* The current position in each one */
+    int *counters = ALLOCV_N(int, t1, n); /* The current position in each one */
     VALUE result = Qnil;      /* The array we'll be returning, when no block given */
     long i,j;
     long resultlen = 1;
 
-    RBASIC(t0)->klass = 0;
-    RBASIC(t1)->klass = 0;
+    RBASIC_CLEAR_CLASS(t0);
 
     /* initialize the arrays of arrays */
     ARY_SET_LEN(t0, n);
@@ -4519,78 +7671,84 @@ rb_ary_product(int argc, VALUE *argv, VALUE ary)
 
     /* Otherwise, allocate and fill in an array of results */
     if (rb_block_given_p()) {
-	/* Make defensive copies of arrays; exit if any is empty */
-	for (i = 0; i < n; i++) {
-	    if (RARRAY_LEN(arrays[i]) == 0) goto done;
-	    arrays[i] = ary_make_shared_copy(arrays[i]);
-	}
+        /* Make defensive copies of arrays; exit if any is empty */
+        for (i = 0; i < n; i++) {
+            if (RARRAY_LEN(arrays[i]) == 0) goto done;
+            arrays[i] = ary_make_shared_copy(arrays[i]);
+        }
     }
     else {
-	/* Compute the length of the result array; return [] if any is empty */
-	for (i = 0; i < n; i++) {
-	    long k = RARRAY_LEN(arrays[i]), l = resultlen;
-	    if (k == 0) {
-		result = rb_ary_new2(0);
-		goto done;
-	    }
-	    resultlen *= k;
-	    if (resultlen < k || resultlen < l || resultlen / k != l) {
-		rb_raise(rb_eRangeError, "too big to product");
-	    }
-	}
-	result = rb_ary_new2(resultlen);
+        /* Compute the length of the result array; return [] if any is empty */
+        for (i = 0; i < n; i++) {
+            long k = RARRAY_LEN(arrays[i]);
+            if (k == 0) {
+                result = rb_ary_new2(0);
+                goto done;
+            }
+            if (MUL_OVERFLOW_LONG_P(resultlen, k))
+                rb_raise(rb_eRangeError, "too big to product");
+            resultlen *= k;
+        }
+        result = rb_ary_new2(resultlen);
     }
     for (;;) {
-	int m;
-	/* fill in one subarray */
-	VALUE subarray = rb_ary_new2(n);
-	for (j = 0; j < n; j++) {
-	    rb_ary_push(subarray, rb_ary_entry(arrays[j], counters[j]));
-	}
-
-	/* put it on the result array */
-	if(NIL_P(result)) {
-	    FL_SET(t0, FL_USER5);
-	    rb_yield(subarray);
-	    if (! FL_TEST(t0, FL_USER5)) {
-		rb_raise(rb_eRuntimeError, "product reentered");
-	    }
-	    else {
-		FL_UNSET(t0, FL_USER5);
-	    }
-	}
-	else {
-	    rb_ary_push(result, subarray);
-	}
-
-	/*
-	 * Increment the last counter.  If it overflows, reset to 0
-	 * and increment the one before it.
-	 */
-	m = n-1;
-	counters[m]++;
-	while (counters[m] == RARRAY_LEN(arrays[m])) {
-	    counters[m] = 0;
-	    /* If the first counter overflows, we are done */
-	    if (--m < 0) goto done;
-	    counters[m]++;
-	}
+        int m;
+        /* fill in one subarray */
+        VALUE subarray = rb_ary_new2(n);
+        for (j = 0; j < n; j++) {
+            rb_ary_push(subarray, rb_ary_entry(arrays[j], counters[j]));
+        }
+
+        /* put it on the result array */
+        if (NIL_P(result)) {
+            FL_SET(t0, RARRAY_SHARED_ROOT_FLAG);
+            rb_yield(subarray);
+            if (!FL_TEST(t0, RARRAY_SHARED_ROOT_FLAG)) {
+                rb_raise(rb_eRuntimeError, "product reentered");
+            }
+            else {
+                FL_UNSET(t0, RARRAY_SHARED_ROOT_FLAG);
+            }
+        }
+        else {
+            rb_ary_push(result, subarray);
+        }
+
+        /*
+         * Increment the last counter.  If it overflows, reset to 0
+         * and increment the one before it.
+         */
+        m = n-1;
+        counters[m]++;
+        while (counters[m] == RARRAY_LEN(arrays[m])) {
+            counters[m] = 0;
+            /* If the first counter overflows, we are done */
+            if (--m < 0) goto done;
+            counters[m]++;
+        }
     }
+
 done:
-    tmpary_discard(t0);
-    tmpbuf_discard(t1);
+    ALLOCV_END(t1);
 
     return NIL_P(result) ? ary : result;
 }
 
 /*
  *  call-seq:
- *     ary.take(n)               -> new_ary
+ *    array.take(n) -> new_array
+ *
+ *  Returns a new \Array containing the first +n+ element of +self+,
+ *  where +n+ is a non-negative \Integer;
+ *  does not modify +self+.
  *
- *  Returns first +n+ elements from the array.
+ *  Examples:
  *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.take(3)             #=> [1, 2, 3]
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.take(1) # => [0]
+ *    a.take(2) # => [0, 1]
+ *    a.take(50) # => [0, 1, 2, 3, 4, 5]
+ *    a # => [0, 1, 2, 3, 4, 5]
  *
  */
 
@@ -4599,23 +7757,31 @@ rb_ary_take(VALUE obj, VALUE n)
 {
     long len = NUM2LONG(n);
     if (len < 0) {
-	rb_raise(rb_eArgError, "attempt to take negative size");
+        rb_raise(rb_eArgError, "attempt to take negative size");
     }
     return rb_ary_subseq(obj, 0, len);
 }
 
 /*
  *  call-seq:
- *     ary.take_while {|arr| block }   -> new_ary
- *     ary.take_while                  -> an_enumerator
+ *    array.take_while {|element| ... } -> new_array
+ *    array.take_while -> new_enumerator
+ *
+ *  Returns a new \Array containing zero or more leading elements of +self+;
+ *  does not modify +self+.
  *
- *  Passes elements to the block until the block returns +nil+ or +false+,
- *  then stops iterating and returns an array of all prior elements.
+ *  With a block given, calls the block with each successive element of +self+;
+ *  stops if the block returns +false+ or +nil+;
+ *  returns a new \Array containing those elements for which the block returned a truthy value:
  *
- *  If no block is given, an enumerator is returned instead.
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.take_while {|element| element < 3 } # => [0, 1, 2]
+ *    a.take_while {|element| true } # => [0, 1, 2, 3, 4, 5]
+ *    a # => [0, 1, 2, 3, 4, 5]
  *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.take_while {|i| i < 3 }   #=> [1, 2]
+ *  With no block given, returns a new \Enumerator:
+ *
+ *    [0, 1].take_while # => #<Enumerator: [0, 1]:take_while>
  *
  */
 
@@ -4626,20 +7792,25 @@ rb_ary_take_while(VALUE ary)
 
     RETURN_ENUMERATOR(ary, 0, 0);
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	if (!RTEST(rb_yield(RARRAY_PTR(ary)[i]))) break;
+        if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
     }
     return rb_ary_take(ary, LONG2FIX(i));
 }
 
 /*
  *  call-seq:
- *     ary.drop(n)               -> new_ary
+ *    array.drop(n) -> new_array
+ *
+ *  Returns a new \Array containing all but the first +n+ element of +self+,
+ *  where +n+ is a non-negative \Integer;
+ *  does not modify +self+.
  *
- *  Drops first n elements from +ary+ and returns the rest of
- *  the elements in an array.
+ *  Examples:
  *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.drop(3)             #=> [4, 5, 0]
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.drop(0) # => [0, 1, 2, 3, 4, 5]
+ *    a.drop(1) # => [1, 2, 3, 4, 5]
+ *    a.drop(2) # => [2, 3, 4, 5]
  *
  */
 
@@ -4649,27 +7820,32 @@ rb_ary_drop(VALUE ary, VALUE n)
     VALUE result;
     long pos = NUM2LONG(n);
     if (pos < 0) {
-	rb_raise(rb_eArgError, "attempt to drop negative size");
+        rb_raise(rb_eArgError, "attempt to drop negative size");
     }
 
     result = rb_ary_subseq(ary, pos, RARRAY_LEN(ary));
-    if (result == Qnil) result = rb_ary_new();
+    if (NIL_P(result)) result = rb_ary_new();
     return result;
 }
 
 /*
  *  call-seq:
- *     ary.drop_while {|arr| block }   -> new_ary
- *     ary.drop_while                  -> an_enumerator
+ *    array.drop_while {|element| ... } -> new_array
+ *    array.drop_while -> new_enumerator
+
+ *  Returns a new \Array containing zero or more trailing elements of +self+;
+ *  does not modify +self+.
+ *
+ *  With a block given, calls the block with each successive element of +self+;
+ *  stops if the block returns +false+ or +nil+;
+ *  returns a new \Array _omitting_ those elements for which the block returned a truthy value:
  *
- *  Drops elements up to, but not including, the first element for
- *  which the block returns +nil+ or +false+ and returns an array
- *  containing the remaining elements.
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.drop_while {|element| element < 3 } # => [3, 4, 5]
  *
- *  If no block is given, an enumerator is returned instead.
+ *  With no block given, returns a new \Enumerator:
  *
- *     a = [1, 2, 3, 4, 5, 0]
- *     a.drop_while {|i| i < 3 }   #=> [3, 4, 5, 0]
+ *    [0, 1].drop_while # => # => #<Enumerator: [0, 1]:drop_while>
  *
  */
 
@@ -4680,246 +7856,967 @@ rb_ary_drop_while(VALUE ary)
 
     RETURN_ENUMERATOR(ary, 0, 0);
     for (i = 0; i < RARRAY_LEN(ary); i++) {
-	if (!RTEST(rb_yield(RARRAY_PTR(ary)[i]))) break;
+        if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
     }
     return rb_ary_drop(ary, LONG2FIX(i));
 }
 
 /*
- * Arrays are ordered, integer-indexed collections of any object.
- * Array indexing starts at 0, as in C or Java.  A negative index is
- * assumed to be relative to the end of the array---that is, an index of -1
- * indicates the last element of the array, -2 is the next to last
- * element in the array, and so on.
+ *  call-seq:
+ *    array.any? -> true or false
+ *    array.any? {|element| ... } -> true or false
+ *    array.any?(obj) -> true or false
  *
- * == Creating Arrays
+ *  Returns +true+ if any element of +self+ meets a given criterion.
  *
- * A new array can be created by using the literal constructor
- * <code>[]</code>.  Arrays can contain different types of objects.  For
- * example, the array below contains an Integer, a String and a Float:
+ *  With no block given and no argument, returns +true+ if +self+ has any truthy element,
+ *  +false+ otherwise:
  *
- *    ary = [1, "two", 3.0] #=> [1, "two", 3.0]
+ *    [nil, 0, false].any? # => true
+ *    [nil, false].any? # => false
+ *    [].any? # => false
  *
- * An array can also be created by explicitly calling Array.new with zero,
- * one (the initial size of the Array) or two arguments (the initial size and
- * a default object).
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block returns any truthy value, +false+ otherwise:
  *
- *    ary = Array.new    #=> []
- *    Array.new(3)       #=> [nil, nil, nil]
- *    Array.new(3, true) #=> [0, 0, 0]
+ *    [0, 1, 2].any? {|element| element > 1 } # => true
+ *    [0, 1, 2].any? {|element| element > 2 } # => false
  *
- * Note that the second argument populates the array with references the same
- * object.  Therefore, it is only recommended in cases when you need to
- * instantiate arrays with natively immutable objects such Symbols, numbers,
- * true or false.
+ *  If argument +obj+ is given, returns +true+ if +obj+.<tt>===</tt> any element,
+ *  +false+ otherwise:
  *
- * To create an array with separate objects a block can be passed instead.
- * This method is safe to use with mutable objects such as hashes, strings or
- * other arrays:
+ *    ['food', 'drink'].any?(/foo/) # => true
+ *    ['food', 'drink'].any?(/bar/) # => false
+ *    [].any?(/foo/) # => false
+ *    [0, 1, 2].any?(1) # => true
+ *    [0, 1, 2].any?(3) # => false
  *
- *    Array.new(4) { Hash.new } #=> [{}, {}, {}, {}]
+ *  Related: Enumerable#any?
+ */
+
+static VALUE
+rb_ary_any_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qfalse;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) return Qtrue;
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (RTEST(RARRAY_AREF(ary, i))) return Qtrue;
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) return Qtrue;
+        }
+    }
+    return Qfalse;
+}
+
+/*
+ *  call-seq:
+ *    array.all? -> true or false
+ *    array.all? {|element| ... } -> true or false
+ *    array.all?(obj) -> true or false
  *
- * This is also a quick way to build up multi-dimensional arrays:
+ *  Returns +true+ if all elements of +self+ meet a given criterion.
  *
- *    empty_table = Array.new(3) { Array.new(3) }
- *    #=> [[nil, nil, nil], [nil, nil, nil], [nil, nil, nil]]
+ *  With no block given and no argument, returns +true+ if +self+ contains only truthy elements,
+ *  +false+ otherwise:
  *
- * == Example Usage
+ *    [0, 1, :foo].all? # => true
+ *    [0, nil, 2].all? # => false
+ *    [].all? # => true
  *
- * In addition to the methods it mixes in through the Enumerable module, the
- * Array class has proprietary methods for accessing, searching and otherwise
- * manipulating arrays.  Some of the more common ones are illustrated below.
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block returns only truthy values, +false+ otherwise:
  *
- * == Accessing Elements
+ *    [0, 1, 2].all? { |element| element < 3 } # => true
+ *    [0, 1, 2].all? { |element| element < 2 } # => false
  *
- * Elements in an array can be retrieved using the Array#[] method.  It can
- * take a single integer argument (a numeric index), a pair of arguments
- * (start and length) or a range.
+ *  If argument +obj+ is given, returns +true+ if <tt>obj.===</tt> every element, +false+ otherwise:
  *
- *    arr = [1, 2, 3, 4, 5, 6]
- *    arr[2]    #=> 3
- *    arr[100]  #=> nil
- *    arr[-3]   #=> 4
- *    arr[2, 3] #=> [3, 4, 5]
- *    arr[1..4] #=> [2, 3, 4, 5]
+ *    ['food', 'fool', 'foot'].all?(/foo/) # => true
+ *    ['food', 'drink'].all?(/bar/) # => false
+ *    [].all?(/foo/) # => true
+ *    [0, 0, 0].all?(0) # => true
+ *    [0, 1, 2].all?(1) # => false
  *
- * Another way to access a particular array element is by using the #at method
+ *  Related: Enumerable#all?
+ */
+
+static VALUE
+rb_ary_all_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qtrue;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (!RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (!RTEST(RARRAY_AREF(ary, i))) return Qfalse;
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    return Qtrue;
+}
+
+/*
+ *  call-seq:
+ *    array.none? -> true or false
+ *    array.none? {|element| ... } -> true or false
+ *    array.none?(obj) -> true or false
  *
- *    arr.at(0) #=> 1
+ *  Returns +true+ if no element of +self+ meet a given criterion.
  *
- * The #slice method works in an identical manner to Array#[].
+ *  With no block given and no argument, returns +true+ if +self+ has no truthy elements,
+ *  +false+ otherwise:
  *
- * To raise an error for indices outside of the array bounds or else to provide
- * a default value when that happens, you can use #fetch.
+ *    [nil, false].none? # => true
+ *    [nil, 0, false].none? # => false
+ *    [].none? # => true
  *
- *    arr = ['a', 'b', 'c', 'd', 'e', 'f']
- *    arr.fetch(100) #=> IndexError: index 100 outside of array bounds: -6...6
- *    arr.fetch(100, "oops") #=> "oops"
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block returns no truthy value, +false+ otherwise:
  *
- * The special methods #first and #last will return the first and last
- * elements of an array, respectively.
+ *    [0, 1, 2].none? {|element| element > 3 } # => true
+ *    [0, 1, 2].none? {|element| element > 1 } # => false
  *
- *    arr.first #=> 1
- *    arr.last  #=> 6
+ *  If argument +obj+ is given, returns +true+ if <tt>obj.===</tt> no element, +false+ otherwise:
  *
- * To return the first n elements of an array, use #take
+ *    ['food', 'drink'].none?(/bar/) # => true
+ *    ['food', 'drink'].none?(/foo/) # => false
+ *    [].none?(/foo/) # => true
+ *    [0, 1, 2].none?(3) # => true
+ *    [0, 1, 2].none?(1) # => false
  *
- *    arr.take(3) #=> [1, 2, 3]
+ *  Related: Enumerable#none?
+ */
+
+static VALUE
+rb_ary_none_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qtrue;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (RTEST(RARRAY_AREF(ary, i))) return Qfalse;
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) return Qfalse;
+        }
+    }
+    return Qtrue;
+}
+
+/*
+ *  call-seq:
+ *    array.one? -> true or false
+ *    array.one? {|element| ... } -> true or false
+ *    array.one?(obj) -> true or false
  *
- * #drop does the opposite of #take, by returning the elements after n elements
- * have been dropped:
+ *  Returns +true+ if exactly one element of +self+ meets a given criterion.
  *
- *    arr.drop(3) #=> [4, 5, 6]
+ *  With no block given and no argument, returns +true+ if +self+ has exactly one truthy element,
+ *  +false+ otherwise:
  *
- * == Obtaining Information about an Array
+ *    [nil, 0].one? # => true
+ *    [0, 0].one? # => false
+ *    [nil, nil].one? # => false
+ *    [].one? # => false
  *
- * Arrays keep track of their own length at all times.  To query an array about
- * the number of elements it contains, use #length, #count or #size.
+ *  With a block given and no argument, calls the block with each element in +self+;
+ *  returns +true+ if the block a truthy value for exactly one element, +false+ otherwise:
  *
- *   browsers = ['Chrome', 'Firefox', 'Safari', 'Opera', 'IE']
- *   browsers.length #=> 5
- *   browsers.count #=> 5
+ *    [0, 1, 2].one? {|element| element > 0 } # => false
+ *    [0, 1, 2].one? {|element| element > 1 } # => true
+ *    [0, 1, 2].one? {|element| element > 2 } # => false
  *
- * To check whether an array contains any elements at all
+ *  If argument +obj+ is given, returns +true+ if <tt>obj.===</tt> exactly one element,
+ *  +false+ otherwise:
  *
- *   browsers.empty? #=> false
+ *    [0, 1, 2].one?(0) # => true
+ *    [0, 0, 1].one?(0) # => false
+ *    [1, 1, 2].one?(0) # => false
+ *    ['food', 'drink'].one?(/bar/) # => false
+ *    ['food', 'drink'].one?(/foo/) # => true
+ *    [].one?(/foo/) # => false
  *
- * To check whether a particular item is included in the array
+ *  Related: Enumerable#one?
+ */
+
+static VALUE
+rb_ary_one_p(int argc, VALUE *argv, VALUE ary)
+{
+    long i, len = RARRAY_LEN(ary);
+    VALUE result = Qfalse;
+
+    rb_check_arity(argc, 0, 1);
+    if (!len) return Qfalse;
+    if (argc) {
+        if (rb_block_given_p()) {
+            rb_warn("given block not used");
+        }
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_funcall(argv[0], idEqq, 1, RARRAY_AREF(ary, i)))) {
+                if (result) return Qfalse;
+                result = Qtrue;
+            }
+        }
+    }
+    else if (!rb_block_given_p()) {
+        for (i = 0; i < len; ++i) {
+            if (RTEST(RARRAY_AREF(ary, i))) {
+                if (result) return Qfalse;
+                result = Qtrue;
+            }
+        }
+    }
+    else {
+        for (i = 0; i < RARRAY_LEN(ary); ++i) {
+            if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) {
+                if (result) return Qfalse;
+                result = Qtrue;
+            }
+        }
+    }
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    array.dig(index, *identifiers) -> object
+ *
+ *  Finds and returns the object in nested objects
+ *  that is specified by +index+ and +identifiers+.
+ *  The nested objects may be instances of various classes.
+ *  See {Dig Methods}[rdoc-ref:dig_methods.rdoc].
+ *
+ *  Examples:
+ *
+ *    a = [:foo, [:bar, :baz, [:bat, :bam]]]
+ *    a.dig(1) # => [:bar, :baz, [:bat, :bam]]
+ *    a.dig(1, 2) # => [:bat, :bam]
+ *    a.dig(1, 2, 0) # => :bat
+ *    a.dig(1, 2, 3) # => nil
+ *
+ */
+
+static VALUE
+rb_ary_dig(int argc, VALUE *argv, VALUE self)
+{
+    rb_check_arity(argc, 1, UNLIMITED_ARGUMENTS);
+    self = rb_ary_at(self, *argv);
+    if (!--argc) return self;
+    ++argv;
+    return rb_obj_dig(argc, argv, self, Qnil);
+}
+
+static inline VALUE
+finish_exact_sum(long n, VALUE r, VALUE v, int z)
+{
+    if (n != 0)
+        v = rb_fix_plus(LONG2FIX(n), v);
+    if (!UNDEF_P(r)) {
+        v = rb_rational_plus(r, v);
+    }
+    else if (!n && z) {
+        v = rb_fix_plus(LONG2FIX(0), v);
+    }
+    return v;
+}
+
+/*
+ * call-seq:
+ *   array.sum(init = 0) -> object
+ *   array.sum(init = 0) {|element| ... } -> object
+ *
+ *  When no block is given, returns the object equivalent to:
+ *
+ *    sum = init
+ *    array.each {|element| sum += element }
+ *    sum
+ *
+ *  For example, <tt>[e1, e2, e3].sum</tt> returns <tt>init + e1 + e2 + e3</tt>.
+ *
+ *  Examples:
+ *
+ *    a = [0, 1, 2, 3]
+ *    a.sum # => 6
+ *    a.sum(100) # => 106
+ *
+ *  The elements need not be numeric, but must be <tt>+</tt>-compatible
+ *  with each other and with +init+:
+ *
+ *    a = ['abc', 'def', 'ghi']
+ *    a.sum('jkl') # => "jklabcdefghi"
+ *
+ *  When a block is given, it is called with each element
+ *  and the block's return value (instead of the element itself) is used as the addend:
+ *
+ *    a = ['zero', 1, :two]
+ *    s = a.sum('Coerced and concatenated: ') {|element| element.to_s }
+ *    s # => "Coerced and concatenated: zero1two"
+ *
+ *  Notes:
+ *
+ *  - Array#join and Array#flatten may be faster than Array#sum
+ *    for an \Array of Strings or an \Array of Arrays.
+ *  - Array#sum method may not respect method redefinition of "+" methods such as Integer#+.
+ *
+ */
+
+static VALUE
+rb_ary_sum(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE e, v, r;
+    long i, n;
+    int block_given;
+
+    v = (rb_check_arity(argc, 0, 1) ? argv[0] : LONG2FIX(0));
+
+    block_given = rb_block_given_p();
+
+    if (RARRAY_LEN(ary) == 0)
+        return v;
+
+    n = 0;
+    r = Qundef;
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        e = RARRAY_AREF(ary, i);
+        if (block_given)
+            e = rb_yield(e);
+        if (FIXNUM_P(e)) {
+            n += FIX2LONG(e); /* should not overflow long type */
+            if (!FIXABLE(n)) {
+                v = rb_big_plus(LONG2NUM(n), v);
+                n = 0;
+            }
+        }
+        else if (RB_BIGNUM_TYPE_P(e))
+            v = rb_big_plus(e, v);
+        else if (RB_TYPE_P(e, T_RATIONAL)) {
+            if (UNDEF_P(r))
+                r = e;
+            else
+                r = rb_rational_plus(r, e);
+        }
+        else
+            goto not_exact;
+    }
+    v = finish_exact_sum(n, r, v, argc!=0);
+    return v;
+
+  not_exact:
+    v = finish_exact_sum(n, r, v, i!=0);
+
+    if (RB_FLOAT_TYPE_P(e)) {
+        /*
+         * Kahan-Babuska balancing compensated summation algorithm
+         * See https://link.springer.com/article/10.1007/s00607-005-0139-x
+         */
+        double f, c;
+        double x, t;
+
+        f = NUM2DBL(v);
+        c = 0.0;
+        goto has_float_value;
+        for (; i < RARRAY_LEN(ary); i++) {
+            e = RARRAY_AREF(ary, i);
+            if (block_given)
+                e = rb_yield(e);
+            if (RB_FLOAT_TYPE_P(e))
+              has_float_value:
+                x = RFLOAT_VALUE(e);
+            else if (FIXNUM_P(e))
+                x = FIX2LONG(e);
+            else if (RB_BIGNUM_TYPE_P(e))
+                x = rb_big2dbl(e);
+            else if (RB_TYPE_P(e, T_RATIONAL))
+                x = rb_num2dbl(e);
+            else
+                goto not_float;
+
+            if (isnan(f)) continue;
+            if (isnan(x)) {
+                f = x;
+                continue;
+            }
+            if (isinf(x)) {
+                if (isinf(f) && signbit(x) != signbit(f))
+                    f = NAN;
+                else
+                    f = x;
+                continue;
+            }
+            if (isinf(f)) continue;
+
+            t = f + x;
+            if (fabs(f) >= fabs(x))
+                c += ((f - t) + x);
+            else
+                c += ((x - t) + f);
+            f = t;
+        }
+        f += c;
+        return DBL2NUM(f);
+
+      not_float:
+        v = DBL2NUM(f);
+    }
+
+    goto has_some_value;
+    for (; i < RARRAY_LEN(ary); i++) {
+        e = RARRAY_AREF(ary, i);
+        if (block_given)
+            e = rb_yield(e);
+      has_some_value:
+        v = rb_funcall(v, idPLUS, 1, e);
+    }
+    return v;
+}
+
+static VALUE
+rb_ary_deconstruct(VALUE ary)
+{
+    return ary;
+}
+
+/*
+ *  An \Array is an ordered, integer-indexed collection of objects, called _elements_.
+ *  Any object (even another array) may be an array element,
+ *  and an array can contain objects of different types.
+ *
+ *  == \Array Indexes
+ *
+ *  \Array indexing starts at 0, as in C or Java.
+ *
+ *  A positive index is an offset from the first element:
+ *
+ *  - Index 0 indicates the first element.
+ *  - Index 1 indicates the second element.
+ *  - ...
+ *
+ *  A negative index is an offset, backwards, from the end of the array:
+ *
+ *  - Index -1 indicates the last element.
+ *  - Index -2 indicates the next-to-last element.
+ *  - ...
+ *
+ *  A non-negative index is <i>in range</i> if and only if it is smaller than
+ *  the size of the array.  For a 3-element array:
+ *
+ *  - Indexes 0 through 2 are in range.
+ *  - Index 3 is out of range.
+ *
+ *  A negative index is <i>in range</i> if and only if its absolute value is
+ *  not larger than the size of the array.  For a 3-element array:
+ *
+ *  - Indexes -1 through -3 are in range.
+ *  - Index -4 is out of range.
+ *
+ *  Although the effective index into an array is always an integer,
+ *  some methods (both within and outside of class \Array)
+ *  accept one or more non-integer arguments that are
+ *  {integer-convertible objects}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects].
+ *
+ *
+ *  == Creating Arrays
+ *
+ *  You can create an \Array object explicitly with:
+ *
+ *  - An {array literal}[rdoc-ref:literals.rdoc@Array+Literals]:
+ *
+ *      [1, 'one', :one, [2, 'two', :two]]
+ *
+ *  - A {%w or %W: string-array Literal}[rdoc-ref:literals.rdoc@25w+and+-25W-3A+String-Array+Literals]:
+ *
+ *      %w[foo bar baz] # => ["foo", "bar", "baz"]
+ *      %w[1 % *]       # => ["1", "%", "*"]
+ *
+ *  - A {%i pr %I: symbol-array Literal}[rdoc-ref:literals.rdoc@25i+and+-25I-3A+Symbol-Array+Literals]:
+ *
+ *      %i[foo bar baz] # => [:foo, :bar, :baz]
+ *      %i[1 % *]       # => [:"1", :%, :*]
+ *
+ *  - \Method Kernel#Array:
+ *
+ *      Array(["a", "b"])             # => ["a", "b"]
+ *      Array(1..5)                   # => [1, 2, 3, 4, 5]
+ *      Array(key: :value)            # => [[:key, :value]]
+ *      Array(nil)                    # => []
+ *      Array(1)                      # => [1]
+ *      Array({:a => "a", :b => "b"}) # => [[:a, "a"], [:b, "b"]]
+ *
+ *  - \Method Array.new:
  *
- *   browsers.include?('Konqueror') #=> false
+ *      Array.new               # => []
+ *      Array.new(3)            # => [nil, nil, nil]
+ *      Array.new(4) {Hash.new} # => [{}, {}, {}, {}]
+ *      Array.new(3, true)      # => [true, true, true]
  *
- * == Adding Items to Arrays
+ *    Note that the last example above populates the array
+ *    with references to the same object.
+ *    This is recommended only in cases where that object is a natively immutable object
+ *    such as a symbol, a numeric, +nil+, +true+, or +false+.
  *
- * Items can be added to the end of an array by using either #push or
- * <code><<</code>
+ *    Another way to create an array with various objects, using a block;
+ *    this usage is safe for mutable objects such as hashes, strings or
+ *    other arrays:
  *
- *   arr = [1, 2, 3, 4]
- *   arr.push(5) #=> [1, 2, 3, 4, 5]
- *   arr << 6    #=> [1, 2, 3, 4, 5, 6]
+ *      Array.new(4) {|i| i.to_s } # => ["0", "1", "2", "3"]
  *
- * #unshift will add a new item to the beginning of an array.
+ *    Here is a way to create a multi-dimensional array:
  *
- *    arr.unshift(0) #=> [0, 1, 2, 3, 4, 5, 6]
+ *      Array.new(3) {Array.new(3)}
+ *      # => [[nil, nil, nil], [nil, nil, nil], [nil, nil, nil]]
  *
- * With #insert you can add a new element to an array at any position.
+ *  A number of Ruby methods, both in the core and in the standard library,
+ *  provide instance method +to_a+, which converts an object to an array.
  *
- *    arr.insert(3, 'apple')  #=> [0, 1, 2, 'apple', 3, 4, 5, 6]
+ *  - ARGF#to_a
+ *  - Array#to_a
+ *  - Enumerable#to_a
+ *  - Hash#to_a
+ *  - MatchData#to_a
+ *  - NilClass#to_a
+ *  - OptionParser#to_a
+ *  - Range#to_a
+ *  - Set#to_a
+ *  - Struct#to_a
+ *  - Time#to_a
+ *  - Benchmark::Tms#to_a
+ *  - CSV::Table#to_a
+ *  - Enumerator::Lazy#to_a
+ *  - Gem::List#to_a
+ *  - Gem::NameTuple#to_a
+ *  - Gem::Platform#to_a
+ *  - Gem::RequestSet::Lockfile::Tokenizer#to_a
+ *  - Gem::SourceList#to_a
+ *  - OpenSSL::X509::Extension#to_a
+ *  - OpenSSL::X509::Name#to_a
+ *  - Racc::ISet#to_a
+ *  - Rinda::RingFinger#to_a
+ *  - Ripper::Lexer::Elem#to_a
+ *  - RubyVM::InstructionSequence#to_a
+ *  - YAML::DBM#to_a
  *
- * Using the #insert method, you can also insert multiple values at once:
+ *  == Example Usage
  *
- *    arr.insert(3, 'orange', 'pear', 'grapefruit')
- *    #=> [0, 1, 2, "orange", "pear", "grapefruit", "apple", 3, 4, 5, 6]
+ *  In addition to the methods it mixes in through the Enumerable module, the
+ *  \Array class has proprietary methods for accessing, searching and otherwise
+ *  manipulating arrays.
  *
- * == Removing Items from an Array
+ *  Some of the more common ones are illustrated below.
  *
- * The method #pop removes the last element in an array and returns it:
+ *  == Accessing Elements
  *
- *    arr =  [1, 2, 3, 4, 5, 6]
- *    arr.pop #=> 6
- *    arr #=> [1, 2, 3, 4, 5]
+ *  Elements in an array can be retrieved using the Array#[] method.  It can
+ *  take a single integer argument (a numeric index), a pair of arguments
+ *  (start and length) or a range. Negative indices start counting from the end,
+ *  with -1 being the last element.
  *
- * To retrieve and at the same time remove the first item, use #shift:
+ *     arr = [1, 2, 3, 4, 5, 6]
+ *     arr[2]    #=> 3
+ *     arr[100]  #=> nil
+ *     arr[-3]   #=> 4
+ *     arr[2, 3] #=> [3, 4, 5]
+ *     arr[1..4] #=> [2, 3, 4, 5]
+ *     arr[1..-3] #=> [2, 3, 4]
  *
- *    arr.shift #=> 1
- *    arr #=> [2, 3, 4, 5]
+ *  Another way to access a particular array element is by using the #at method
  *
- * To delete an element at a particular index:
+ *     arr.at(0) #=> 1
  *
- *    arr.delete_at(2) #=> 4
- *    arr #=> [2, 3, 5]
+ *  The #slice method works in an identical manner to Array#[].
  *
- * To delete a particular element anywhere in an array, use #delete:
+ *  To raise an error for indices outside of the array bounds or else to
+ *  provide a default value when that happens, you can use #fetch.
  *
- *    arr = [1, 2, 2, 3]
- *    arr.delete(2) #=> [1, 3]
+ *     arr = ['a', 'b', 'c', 'd', 'e', 'f']
+ *     arr.fetch(100) #=> IndexError: index 100 outside of array bounds: -6...6
+ *     arr.fetch(100, "oops") #=> "oops"
  *
- * A useful method if you need to remove +nil+ values from an array is
- * #compact:
+ *  The special methods #first and #last will return the first and last
+ *  elements of an array, respectively.
  *
- *    arr = ['foo', 0, nil, 'bar', 7, 'baz', nil]
- *    arr.compact  #=> ['foo', 0, 'bar', 7, 'baz']
- *    arr          #=> ['foo', 0, nil, 'bar', 7, 'baz', nil]
- *    arr.compact! #=> ['foo', 0, 'bar', 7, 'baz']
- *    arr          #=> ['foo', 0, 'bar', 7, 'baz']
+ *     arr.first #=> 1
+ *     arr.last  #=> 6
  *
- * Another common need is to remove duplicate elements from an array.
- * It has a non-destructive (#uniq) and a destructive method (#uniq!)
+ *  To return the first +n+ elements of an array, use #take
  *
- *    arr = [2, 5, 6, 556, 6, 6, 8, 9, 0, 123, 556]
- *    arr.uniq #=> [2, 5, 6, 556, 8, 9, 0, 123]
+ *     arr.take(3) #=> [1, 2, 3]
  *
- * == Iterating over Arrays
+ *  #drop does the opposite of #take, by returning the elements after +n+
+ *  elements have been dropped:
  *
- * Like all classes that include the Enumerable module, Array has an each
- * method, which defines what elements should be iterated over and how.  In
- * case of Array's #each, all elements in the Array instance are yielded
- * to the supplied block in sequence.  Note that this
- * operation leaves the array unchanged.
+ *     arr.drop(3) #=> [4, 5, 6]
  *
- *    arr = [1, 2, 3, 4, 5]
- *    arr.each { |a| print a -= 10, " " }
- *    # prints: -9 -8 -7 -6 -5
- *    #=> [1, 2, 3, 4, 5]
+ *  == Obtaining Information about an \Array
  *
- * Another sometimes useful iterator is #reverse_each which will iterate over
- * the elements in the array in reverse order.
+ *  Arrays keep track of their own length at all times.  To query an array
+ *  about the number of elements it contains, use #length, #count or #size.
  *
- *    words = %w[rats live on no evil star]
- *    str = ""
- *    words.reverse_each { |word| str += "#{word.reverse} " }
- *    str #=> "rats live on no evil star "
+ *    browsers = ['Chrome', 'Firefox', 'Safari', 'Opera', 'IE']
+ *    browsers.length #=> 5
+ *    browsers.count #=> 5
  *
- * The #map method can be used to create a new array based on the original
- * array, but with the values modified by the supplied block:
+ *  To check whether an array contains any elements at all
  *
- *    arr.map { |a| 2*a }   #=> [2, 4, 6, 8, 10]
- *    arr                   #=> [1, 2, 3, 4, 5]
- *    arr.map! { |a| a**2 } #=> [1, 4, 9, 16, 25]
- *    arr                   #=> [1, 4, 9, 16, 25]
+ *    browsers.empty? #=> false
  *
- * == Selecting Items from an Array
+ *  To check whether a particular item is included in the array
  *
- * Elements can be selected from an array according to criteria defined in a
- * block.  The selection can happen in a destructive or a non-destructive
- * manner.  While the destructive operations will modify the array they were
- * called on, the non-destructive methods usually return a new array with the
- * selected elements, but leave the original array unchanged.
+ *    browsers.include?('Konqueror') #=> false
  *
- * === Non-destructive Selection
+ *  == Adding Items to Arrays
  *
- *    arr = [1, 2, 3, 4, 5, 6]
- *    arr.select { |a| a > 3 }     #=> [4, 5, 6]
- *    arr.reject { |a| a < 3 }     #=> [4, 5, 6]
- *    arr.drop_while { |a| a < 4 } #=> [4, 5, 6]
- *    arr                          #=> [1, 2, 3, 4, 5, 6]
+ *  Items can be added to the end of an array by using either #push or #<<
  *
- * === Destructive Selection
+ *    arr = [1, 2, 3, 4]
+ *    arr.push(5) #=> [1, 2, 3, 4, 5]
+ *    arr << 6    #=> [1, 2, 3, 4, 5, 6]
  *
- * #select! and #reject! are the corresponding destructive methods to #select
- * and #reject
+ *  #unshift will add a new item to the beginning of an array.
  *
- * Similar to #select vs. #reject, #delete_if and #keep_if have the exact
- * opposite result when supplied with the same block:
+ *     arr.unshift(0) #=> [0, 1, 2, 3, 4, 5, 6]
  *
- *    arr.delete_if { |a| a < 4 } #=> [4, 5, 6]
- *    arr                         #=> [4, 5, 6]
+ *  With #insert you can add a new element to an array at any position.
  *
- *    arr = [1, 2, 3, 4, 5, 6]
- *    arr.keep_if { |a| a < 4 } #=> [1, 2, 3]
- *    arr                       #=> [1, 2, 3]
+ *     arr.insert(3, 'apple')  #=> [0, 1, 2, 'apple', 3, 4, 5, 6]
  *
+ *  Using the #insert method, you can also insert multiple values at once:
+ *
+ *     arr.insert(3, 'orange', 'pear', 'grapefruit')
+ *     #=> [0, 1, 2, "orange", "pear", "grapefruit", "apple", 3, 4, 5, 6]
+ *
+ *  == Removing Items from an \Array
+ *
+ *  The method #pop removes the last element in an array and returns it:
+ *
+ *     arr =  [1, 2, 3, 4, 5, 6]
+ *     arr.pop #=> 6
+ *     arr #=> [1, 2, 3, 4, 5]
+ *
+ *  To retrieve and at the same time remove the first item, use #shift:
+ *
+ *     arr.shift #=> 1
+ *     arr #=> [2, 3, 4, 5]
+ *
+ *  To delete an element at a particular index:
+ *
+ *     arr.delete_at(2) #=> 4
+ *     arr #=> [2, 3, 5]
+ *
+ *  To delete a particular element anywhere in an array, use #delete:
+ *
+ *     arr = [1, 2, 2, 3]
+ *     arr.delete(2) #=> 2
+ *     arr #=> [1,3]
+ *
+ *  A useful method if you need to remove +nil+ values from an array is
+ *  #compact:
+ *
+ *     arr = ['foo', 0, nil, 'bar', 7, 'baz', nil]
+ *     arr.compact  #=> ['foo', 0, 'bar', 7, 'baz']
+ *     arr          #=> ['foo', 0, nil, 'bar', 7, 'baz', nil]
+ *     arr.compact! #=> ['foo', 0, 'bar', 7, 'baz']
+ *     arr          #=> ['foo', 0, 'bar', 7, 'baz']
+ *
+ *  Another common need is to remove duplicate elements from an array.
+ *
+ *  It has the non-destructive #uniq, and destructive method #uniq!
+ *
+ *     arr = [2, 5, 6, 556, 6, 6, 8, 9, 0, 123, 556]
+ *     arr.uniq #=> [2, 5, 6, 556, 8, 9, 0, 123]
+ *
+ *  == Iterating over Arrays
+ *
+ *  Like all classes that include the Enumerable module, \Array has an each
+ *  method, which defines what elements should be iterated over and how.  In
+ *  case of Array's #each, all elements in the \Array instance are yielded to
+ *  the supplied block in sequence.
+ *
+ *  Note that this operation leaves the array unchanged.
+ *
+ *     arr = [1, 2, 3, 4, 5]
+ *     arr.each {|a| print a -= 10, " "}
+ *     # prints: -9 -8 -7 -6 -5
+ *     #=> [1, 2, 3, 4, 5]
+ *
+ *  Another sometimes useful iterator is #reverse_each which will iterate over
+ *  the elements in the array in reverse order.
+ *
+ *     words = %w[first second third fourth fifth sixth]
+ *     str = ""
+ *     words.reverse_each {|word| str += "#{word} "}
+ *     p str #=> "sixth fifth fourth third second first "
+ *
+ *  The #map method can be used to create a new array based on the original
+ *  array, but with the values modified by the supplied block:
+ *
+ *     arr.map {|a| 2*a}     #=> [2, 4, 6, 8, 10]
+ *     arr                   #=> [1, 2, 3, 4, 5]
+ *     arr.map! {|a| a**2}   #=> [1, 4, 9, 16, 25]
+ *     arr                   #=> [1, 4, 9, 16, 25]
+ *
+ *
+ *  == Selecting Items from an \Array
+ *
+ *  Elements can be selected from an array according to criteria defined in a
+ *  block.  The selection can happen in a destructive or a non-destructive
+ *  manner.  While the destructive operations will modify the array they were
+ *  called on, the non-destructive methods usually return a new array with the
+ *  selected elements, but leave the original array unchanged.
+ *
+ *  === Non-destructive Selection
+ *
+ *     arr = [1, 2, 3, 4, 5, 6]
+ *     arr.select {|a| a > 3}       #=> [4, 5, 6]
+ *     arr.reject {|a| a < 3}       #=> [3, 4, 5, 6]
+ *     arr.drop_while {|a| a < 4}   #=> [4, 5, 6]
+ *     arr                          #=> [1, 2, 3, 4, 5, 6]
+ *
+ *  === Destructive Selection
+ *
+ *  #select! and #reject! are the corresponding destructive methods to #select
+ *  and #reject
+ *
+ *  Similar to #select vs. #reject, #delete_if and #keep_if have the exact
+ *  opposite result when supplied with the same block:
+ *
+ *     arr.delete_if {|a| a < 4}   #=> [4, 5, 6]
+ *     arr                         #=> [4, 5, 6]
+ *
+ *     arr = [1, 2, 3, 4, 5, 6]
+ *     arr.keep_if {|a| a < 4}   #=> [1, 2, 3]
+ *     arr                       #=> [1, 2, 3]
+ *
+ *  == What's Here
+ *
+ *  First, what's elsewhere. \Class \Array:
+ *
+ *  - Inherits from {class Object}[rdoc-ref:Object@What-27s+Here].
+ *  - Includes {module Enumerable}[rdoc-ref:Enumerable@What-27s+Here],
+ *    which provides dozens of additional methods.
+ *
+ *  Here, class \Array provides methods that are useful for:
+ *
+ *  - {Creating an Array}[rdoc-ref:Array@Methods+for+Creating+an+Array]
+ *  - {Querying}[rdoc-ref:Array@Methods+for+Querying]
+ *  - {Comparing}[rdoc-ref:Array@Methods+for+Comparing]
+ *  - {Fetching}[rdoc-ref:Array@Methods+for+Fetching]
+ *  - {Assigning}[rdoc-ref:Array@Methods+for+Assigning]
+ *  - {Deleting}[rdoc-ref:Array@Methods+for+Deleting]
+ *  - {Combining}[rdoc-ref:Array@Methods+for+Combining]
+ *  - {Iterating}[rdoc-ref:Array@Methods+for+Iterating]
+ *  - {Converting}[rdoc-ref:Array@Methods+for+Converting]
+ *  - {And more....}[rdoc-ref:Array@Other+Methods]
+ *
+ *  === Methods for Creating an \Array
+ *
+ *  - ::[]: Returns a new array populated with given objects.
+ *  - ::new: Returns a new array.
+ *  - ::try_convert: Returns a new array created from a given object.
+ *
+ *  === Methods for Querying
+ *
+ *  - #length, #size: Returns the count of elements.
+ *  - #include?: Returns whether any element <tt>==</tt> a given object.
+ *  - #empty?: Returns whether there are no elements.
+ *  - #all?: Returns whether all elements meet a given criterion.
+ *  - #any?: Returns whether any element meets a given criterion.
+ *  - #none?: Returns whether no element <tt>==</tt> a given object.
+ *  - #one?: Returns whether exactly one element <tt>==</tt> a given object.
+ *  - #count: Returns the count of elements that meet a given criterion.
+ *  - #find_index, #index: Returns the index of the first element that meets a given criterion.
+ *  - #rindex: Returns the index of the last element that meets a given criterion.
+ *  - #hash: Returns the integer hash code.
+ *
+ *  === Methods for Comparing
+ *
+ *  - #<=>: Returns -1, 0, or 1 * as +self+ is less than, equal to, or
+ *    greater than a given object.
+ *  - #==: Returns whether each element in +self+ is <tt>==</tt> to the corresponding element
+ *    in a given object.
+ *  - #eql?: Returns whether each element in +self+ is <tt>eql?</tt> to the corresponding
+ *    element in a given object.
+
+ *  === Methods for Fetching
+ *
+ *  These methods do not modify +self+.
+ *
+ *  - #[]: Returns one or more elements.
+ *  - #fetch: Returns the element at a given offset.
+ *  - #first: Returns one or more leading elements.
+ *  - #last: Returns one or more trailing elements.
+ *  - #max: Returns one or more maximum-valued elements,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #min: Returns one or more minimum-valued elements,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #minmax: Returns the minimum-valued and maximum-valued elements,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #assoc: Returns the first element that is an array
+ *    whose first element <tt>==</tt> a given object.
+ *  - #rassoc: Returns the first element that is an array
+ *    whose second element <tt>==</tt> a given object.
+ *  - #at: Returns the element at a given offset.
+ *  - #values_at: Returns the elements at given offsets.
+ *  - #dig: Returns the object in nested objects
+ *    that is specified by a given index and additional arguments.
+ *  - #drop: Returns trailing elements as determined by a given index.
+ *  - #take: Returns leading elements as determined by a given index.
+ *  - #drop_while: Returns trailing elements as determined by a given block.
+ *  - #take_while: Returns leading elements as determined by a given block.
+ *  - #slice: Returns consecutive elements as determined by a given argument.
+ *  - #sort: Returns all elements in an order determined by <tt><=></tt> or a given block.
+ *  - #reverse: Returns all elements in reverse order.
+ *  - #compact: Returns an array containing all non-+nil+ elements.
+ *  - #select, #filter: Returns an array containing elements selected by a given block.
+ *  - #uniq: Returns an array containing non-duplicate elements.
+ *  - #rotate: Returns all elements with some rotated from one end to the other.
+ *  - #bsearch: Returns an element selected via a binary search
+ *    as determined by a given block.
+ *  - #bsearch_index: Returns the index of an element selected via a binary search
+ *    as determined by a given block.
+ *  - #sample: Returns one or more random elements.
+ *  - #shuffle: Returns elements in a random order.
+ *
+ *  === Methods for Assigning
+ *
+ *  These methods add, replace, or reorder elements in +self+.
+ *
+ *  - #[]=: Assigns specified elements with a given object.
+ *  - #push, #append, #<<: Appends trailing elements.
+ *  - #unshift, #prepend: Prepends leading elements.
+ *  - #insert: Inserts given objects at a given offset; does not replace elements.
+ *  - #concat: Appends all elements from given arrays.
+ *  - #fill: Replaces specified elements with specified objects.
+ *  - #replace: Replaces the content of +self+ with the content of a given array.
+ *  - #reverse!: Replaces +self+ with its elements reversed.
+ *  - #rotate!: Replaces +self+ with its elements rotated.
+ *  - #shuffle!: Replaces +self+ with its elements in random order.
+ *  - #sort!: Replaces +self+ with its elements sorted,
+ *    as determined by <tt><=></tt> or a given block.
+ *  - #sort_by!: Replaces +self+ with its elements sorted, as determined by a given block.
+ *
+ *  === Methods for Deleting
+ *
+ *  Each of these methods removes elements from +self+:
+ *
+ *  - #pop: Removes and returns the last element.
+ *  - #shift:  Removes and returns the first element.
+ *  - #compact!: Removes all +nil+ elements.
+ *  - #delete: Removes elements equal to a given object.
+ *  - #delete_at: Removes the element at a given offset.
+ *  - #delete_if: Removes elements specified by a given block.
+ *  - #keep_if: Removes elements not specified by a given block.
+ *  - #reject!: Removes elements specified by a given block.
+ *  - #select!, #filter!: Removes elements not specified by a given block.
+ *  - #slice!: Removes and returns a sequence of elements.
+ *  - #uniq!: Removes duplicates.
+ *
+ *  === Methods for Combining
+ *
+ *  - #&: Returns an array containing elements found both in +self+ and a given array.
+ *  - #intersection: Returns an array containing elements found both in +self+
+ *    and in each given array.
+ *  - #+: Returns an array containing all elements of +self+ followed by all elements of a given array.
+ *  - #-: Returns an array containing all elements of +self+ that are not found in a given array.
+ *  - #|: Returns an array containing all elements of +self+ and all elements of a given array,
+ *    duplicates removed.
+ *  - #union: Returns an array containing all elements of +self+ and all elements of given arrays,
+ *    duplicates removed.
+ *  - #difference: Returns an array containing all elements of +self+ that are not found
+ *    in any of the given arrays..
+ *  - #product: Returns or yields all combinations of elements from +self+ and given arrays.
+ *
+ *  === Methods for Iterating
+ *
+ *  - #each: Passes each element to a given block.
+ *  - #reverse_each:  Passes each element, in reverse order, to a given block.
+ *  - #each_index: Passes each element index to a given block.
+ *  - #cycle: Calls a given block with each element, then does so again,
+ *    for a specified number of times, or forever.
+ *  - #combination: Calls a given block with combinations of elements of +self+;
+ *    a combination does not use the same element more than once.
+ *  - #permutation: Calls a given block with permutations of elements of +self+;
+ *    a permutation does not use the same element more than once.
+ *  - #repeated_combination: Calls a given block with combinations of elements of +self+;
+ *    a combination may use the same element more than once.
+ *  - #repeated_permutation: Calls a given block with permutations of elements of +self+;
+ *    a permutation may use the same element more than once.
+ *
+ *  === Methods for Converting
+ *
+ *  - #map, #collect: Returns an array containing the block return-value for each element.
+ *  - #map!, #collect!: Replaces each element with a block return-value.
+ *  - #flatten: Returns an array that is a recursive flattening of +self+.
+ *  - #flatten!: Replaces each nested array in +self+ with the elements from that array.
+ *  - #inspect, #to_s: Returns a new String containing the elements.
+ *  - #join: Returns a newsString containing the elements joined by the field separator.
+ *  - #to_a: Returns +self+ or a new array containing all elements.
+ *  - #to_ary: Returns +self+.
+ *  - #to_h: Returns a new hash formed from the elements.
+ *  - #transpose: Transposes +self+, which must be an array of arrays.
+ *  - #zip: Returns a new array of arrays containing +self+ and given arrays;
+ *    follow the link for details.
+ *
+ *  === Other Methods
+ *
+ *  - #*: Returns one of the following:
+ *
+ *    - With integer argument +n+, a new array that is the concatenation
+ *      of +n+ copies of +self+.
+ *    - With string argument +field_separator+, a new string that is equivalent to
+ *      <tt>join(field_separator)</tt>.
+ *
+ *  - #abbrev: Returns a hash of unambiguous abbreviations for elements.
+ *  - #pack: Packs the elements into a binary sequence.
+ *  - #sum: Returns a sum of elements according to either <tt>+</tt> or a given block.
  */
 
 void
 Init_Array(void)
 {
-#undef rb_intern
-#define rb_intern(str) rb_intern_const(str)
-
     rb_cArray  = rb_define_class("Array", rb_cObject);
     rb_include_module(rb_cArray, rb_mEnumerable);
 
-    rb_define_alloc_func(rb_cArray, ary_alloc);
+    rb_define_alloc_func(rb_cArray, empty_ary_alloc);
+    rb_define_singleton_method(rb_cArray, "new", rb_ary_s_new, -1);
     rb_define_singleton_method(rb_cArray, "[]", rb_ary_s_create, -1);
     rb_define_singleton_method(rb_cArray, "try_convert", rb_ary_s_try_convert, 1);
     rb_define_method(rb_cArray, "initialize", rb_ary_initialize, -1);
@@ -4928,8 +8825,8 @@ Init_Array(void)
     rb_define_method(rb_cArray, "inspect", rb_ary_inspect, 0);
     rb_define_alias(rb_cArray,  "to_s", "inspect");
     rb_define_method(rb_cArray, "to_a", rb_ary_to_a, 0);
+    rb_define_method(rb_cArray, "to_h", rb_ary_to_h, 0);
     rb_define_method(rb_cArray, "to_ary", rb_ary_to_ary_m, 0);
-    rb_define_method(rb_cArray, "frozen?",  rb_ary_frozen_p, 0);
 
     rb_define_method(rb_cArray, "==", rb_ary_equal, 1);
     rb_define_method(rb_cArray, "eql?", rb_ary_eql, 1);
@@ -4941,18 +8838,24 @@ Init_Array(void)
     rb_define_method(rb_cArray, "fetch", rb_ary_fetch, -1);
     rb_define_method(rb_cArray, "first", rb_ary_first, -1);
     rb_define_method(rb_cArray, "last", rb_ary_last, -1);
-    rb_define_method(rb_cArray, "concat", rb_ary_concat, 1);
+    rb_define_method(rb_cArray, "concat", rb_ary_concat_multi, -1);
+    rb_define_method(rb_cArray, "union", rb_ary_union_multi, -1);
+    rb_define_method(rb_cArray, "difference", rb_ary_difference_multi, -1);
+    rb_define_method(rb_cArray, "intersection", rb_ary_intersection_multi, -1);
+    rb_define_method(rb_cArray, "intersect?", rb_ary_intersect_p, 1);
     rb_define_method(rb_cArray, "<<", rb_ary_push, 1);
     rb_define_method(rb_cArray, "push", rb_ary_push_m, -1);
+    rb_define_alias(rb_cArray,  "append", "push");
     rb_define_method(rb_cArray, "pop", rb_ary_pop_m, -1);
     rb_define_method(rb_cArray, "shift", rb_ary_shift_m, -1);
     rb_define_method(rb_cArray, "unshift", rb_ary_unshift_m, -1);
+    rb_define_alias(rb_cArray,  "prepend", "unshift");
     rb_define_method(rb_cArray, "insert", rb_ary_insert, -1);
     rb_define_method(rb_cArray, "each", rb_ary_each, 0);
     rb_define_method(rb_cArray, "each_index", rb_ary_each_index, 0);
     rb_define_method(rb_cArray, "reverse_each", rb_ary_reverse_each, 0);
     rb_define_method(rb_cArray, "length", rb_ary_length, 0);
-    rb_define_alias(rb_cArray,  "size", "length");
+    rb_define_method(rb_cArray, "size", rb_ary_length, 0);
     rb_define_method(rb_cArray, "empty?", rb_ary_empty_p, 0);
     rb_define_method(rb_cArray, "find_index", rb_ary_index, -1);
     rb_define_method(rb_cArray, "index", rb_ary_index, -1);
@@ -4971,6 +8874,8 @@ Init_Array(void)
     rb_define_method(rb_cArray, "map!", rb_ary_collect_bang, 0);
     rb_define_method(rb_cArray, "select", rb_ary_select, 0);
     rb_define_method(rb_cArray, "select!", rb_ary_select_bang, 0);
+    rb_define_method(rb_cArray, "filter", rb_ary_select, 0);
+    rb_define_method(rb_cArray, "filter!", rb_ary_select_bang, 0);
     rb_define_method(rb_cArray, "keep_if", rb_ary_keep_if, 0);
     rb_define_method(rb_cArray, "values_at", rb_ary_values_at, -1);
     rb_define_method(rb_cArray, "delete", rb_ary_delete, 1);
@@ -4999,6 +8904,10 @@ Init_Array(void)
     rb_define_method(rb_cArray, "&", rb_ary_and, 1);
     rb_define_method(rb_cArray, "|", rb_ary_or, 1);
 
+    rb_define_method(rb_cArray, "max", rb_ary_max, -1);
+    rb_define_method(rb_cArray, "min", rb_ary_min, -1);
+    rb_define_method(rb_cArray, "minmax", rb_ary_minmax, 0);
+
     rb_define_method(rb_cArray, "uniq", rb_ary_uniq, 0);
     rb_define_method(rb_cArray, "uniq!", rb_ary_uniq_bang, 0);
     rb_define_method(rb_cArray, "compact", rb_ary_compact, 0);
@@ -5006,9 +8915,6 @@ Init_Array(void)
     rb_define_method(rb_cArray, "flatten", rb_ary_flatten, -1);
     rb_define_method(rb_cArray, "flatten!", rb_ary_flatten_bang, -1);
     rb_define_method(rb_cArray, "count", rb_ary_count, -1);
-    rb_define_method(rb_cArray, "shuffle!", rb_ary_shuffle_bang, -1);
-    rb_define_method(rb_cArray, "shuffle", rb_ary_shuffle, -1);
-    rb_define_method(rb_cArray, "sample", rb_ary_sample, -1);
     rb_define_method(rb_cArray, "cycle", rb_ary_cycle, -1);
     rb_define_method(rb_cArray, "permutation", rb_ary_permutation, -1);
     rb_define_method(rb_cArray, "combination", rb_ary_combination, 1);
@@ -5020,8 +8926,16 @@ Init_Array(void)
     rb_define_method(rb_cArray, "take_while", rb_ary_take_while, 0);
     rb_define_method(rb_cArray, "drop", rb_ary_drop, 1);
     rb_define_method(rb_cArray, "drop_while", rb_ary_drop_while, 0);
+    rb_define_method(rb_cArray, "bsearch", rb_ary_bsearch, 0);
+    rb_define_method(rb_cArray, "bsearch_index", rb_ary_bsearch_index, 0);
+    rb_define_method(rb_cArray, "any?", rb_ary_any_p, -1);
+    rb_define_method(rb_cArray, "all?", rb_ary_all_p, -1);
+    rb_define_method(rb_cArray, "none?", rb_ary_none_p, -1);
+    rb_define_method(rb_cArray, "one?", rb_ary_one_p, -1);
+    rb_define_method(rb_cArray, "dig", rb_ary_dig, -1);
+    rb_define_method(rb_cArray, "sum", rb_ary_sum, -1);
 
-    id_cmp = rb_intern("<=>");
-    sym_random = ID2SYM(rb_intern("random"));
+    rb_define_method(rb_cArray, "deconstruct", rb_ary_deconstruct, 0);
 }
 
+#include "array.rbinc"
diff --git a/array.rb b/array.rb
new file mode 100644
index 0000000000..b9fa9844e6
--- /dev/null
+++ b/array.rb
@@ -0,0 +1,69 @@
+class Array
+  # call-seq:
+  #    array.shuffle!(random: Random) -> array
+  #
+  # Shuffles the elements of +self+ in place.
+  #    a = [1, 2, 3] #=> [1, 2, 3]
+  #    a.shuffle!    #=> [2, 3, 1]
+  #    a             #=> [2, 3, 1]
+  #
+  # The optional +random+ argument will be used as the random number generator:
+  #    a.shuffle!(random: Random.new(1))  #=> [1, 3, 2]
+  def shuffle!(random: Random)
+    Primitive.rb_ary_shuffle_bang(random)
+  end
+
+  # call-seq:
+  #    array.shuffle(random: Random) -> new_ary
+  #
+  # Returns a new array with elements of +self+ shuffled.
+  #    a = [1, 2, 3] #=> [1, 2, 3]
+  #    a.shuffle     #=> [2, 3, 1]
+  #    a             #=> [1, 2, 3]
+  #
+  # The optional +random+ argument will be used as the random number generator:
+  #    a.shuffle(random: Random.new(1))  #=> [1, 3, 2]
+  def shuffle(random: Random)
+    Primitive.rb_ary_shuffle(random)
+  end
+
+  # call-seq:
+  #    array.sample(random: Random) -> object
+  #    array.sample(n, random: Random) -> new_ary
+  #
+  # Returns random elements from +self+.
+  #
+  # When no arguments are given, returns a random element from +self+:
+  #    a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+  #    a.sample # => 3
+  #    a.sample # => 8
+  # If +self+ is empty, returns +nil+.
+  #
+  # When argument +n+ is given, returns a new \Array containing +n+ random
+  # elements from +self+:
+  #    a.sample(3) # => [8, 9, 2]
+  #    a.sample(6) # => [9, 6, 10, 3, 1, 4]
+  # Returns no more than <tt>a.size</tt> elements
+  # (because no new duplicates are introduced):
+  #    a.sample(a.size * 2) # => [6, 4, 1, 8, 5, 9, 10, 2, 3, 7]
+  # But +self+ may contain duplicates:
+  #    a = [1, 1, 1, 2, 2, 3]
+  #    a.sample(a.size * 2) # => [1, 1, 3, 2, 1, 2]
+  # The argument +n+ must be a non-negative numeric value.
+  # The order of the result array is unrelated to the order of +self+.
+  # Returns a new empty \Array if +self+ is empty.
+  #
+  # The optional +random+ argument will be used as the random number generator:
+  #    a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+  #    a.sample(random: Random.new(1))     #=> 6
+  #    a.sample(4, random: Random.new(1))  #=> [6, 10, 9, 2]
+  def sample(n = (ary = false), random: Random)
+    if Primitive.mandatory_only?
+      # Primitive.cexpr! %{ rb_ary_sample(self, rb_cRandom, Qfalse, Qfalse) }
+      Primitive.ary_sample0
+    else
+      # Primitive.cexpr! %{ rb_ary_sample(self, random, n, ary) }
+      Primitive.ary_sample(random, n, ary)
+    end
+  end
+end
diff --git a/ast.c b/ast.c
new file mode 100644
index 0000000000..adb7287ed3
--- /dev/null
+++ b/ast.c
@@ -0,0 +1,773 @@
+/* indent-tabs-mode: nil */
+#include "internal.h"
+#include "internal/parse.h"
+#include "internal/symbol.h"
+#include "internal/warnings.h"
+#include "iseq.h"
+#include "node.h"
+#include "ruby.h"
+#include "ruby/encoding.h"
+#include "ruby/util.h"
+#include "vm_core.h"
+
+#include "builtin.h"
+
+static VALUE rb_mAST;
+static VALUE rb_cNode;
+
+struct ASTNodeData {
+    rb_ast_t *ast;
+    const NODE *node;
+};
+
+static void
+node_gc_mark(void *ptr)
+{
+    struct ASTNodeData *data = (struct ASTNodeData *)ptr;
+    rb_gc_mark((VALUE)data->ast);
+}
+
+static size_t
+node_memsize(const void *ptr)
+{
+    struct ASTNodeData *data = (struct ASTNodeData *)ptr;
+    return rb_ast_memsize(data->ast);
+}
+
+static const rb_data_type_t rb_node_type = {
+    "AST/node",
+    {node_gc_mark, RUBY_TYPED_DEFAULT_FREE, node_memsize,},
+    0, 0,
+    RUBY_TYPED_FREE_IMMEDIATELY,
+};
+
+static VALUE rb_ast_node_alloc(VALUE klass);
+
+static void
+setup_node(VALUE obj, rb_ast_t *ast, const NODE *node)
+{
+    struct ASTNodeData *data;
+
+    TypedData_Get_Struct(obj, struct ASTNodeData, &rb_node_type, data);
+    data->ast = ast;
+    data->node = node;
+}
+
+static VALUE
+ast_new_internal(rb_ast_t *ast, const NODE *node)
+{
+    VALUE obj;
+
+    obj = rb_ast_node_alloc(rb_cNode);
+    setup_node(obj, ast, node);
+
+    return obj;
+}
+
+static VALUE rb_ast_parse_str(VALUE str, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens);
+static VALUE rb_ast_parse_file(VALUE path, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens);
+
+static VALUE
+ast_parse_new(void)
+{
+    return rb_parser_set_context(rb_parser_new(), NULL, 0);
+}
+
+static VALUE
+ast_parse_done(rb_ast_t *ast)
+{
+    if (!ast->body.root) {
+        rb_ast_dispose(ast);
+        rb_exc_raise(GET_EC()->errinfo);
+    }
+
+    return ast_new_internal(ast, (NODE *)ast->body.root);
+}
+
+static VALUE
+ast_s_parse(rb_execution_context_t *ec, VALUE module, VALUE str, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    return rb_ast_parse_str(str, keep_script_lines, error_tolerant, keep_tokens);
+}
+
+static VALUE
+rb_ast_parse_str(VALUE str, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    rb_ast_t *ast = 0;
+
+    StringValue(str);
+    VALUE vparser = ast_parse_new();
+    if (RTEST(keep_script_lines)) rb_parser_keep_script_lines(vparser);
+    if (RTEST(error_tolerant)) rb_parser_error_tolerant(vparser);
+    if (RTEST(keep_tokens)) rb_parser_keep_tokens(vparser);
+    ast = rb_parser_compile_string_path(vparser, Qnil, str, 1);
+    return ast_parse_done(ast);
+}
+
+static VALUE
+ast_s_parse_file(rb_execution_context_t *ec, VALUE module, VALUE path, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    return rb_ast_parse_file(path, keep_script_lines, error_tolerant, keep_tokens);
+}
+
+static VALUE
+rb_ast_parse_file(VALUE path, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    VALUE f;
+    rb_ast_t *ast = 0;
+    rb_encoding *enc = rb_utf8_encoding();
+
+    FilePathValue(path);
+    f = rb_file_open_str(path, "r");
+    rb_funcall(f, rb_intern("set_encoding"), 2, rb_enc_from_encoding(enc), rb_str_new_cstr("-"));
+    VALUE vparser = ast_parse_new();
+    if (RTEST(keep_script_lines)) rb_parser_keep_script_lines(vparser);
+    if (RTEST(error_tolerant))  rb_parser_error_tolerant(vparser);
+    if (RTEST(keep_tokens))  rb_parser_keep_tokens(vparser);
+    ast = rb_parser_compile_file_path(vparser, Qnil, f, 1);
+    rb_io_close(f);
+    return ast_parse_done(ast);
+}
+
+static VALUE
+lex_array(VALUE array, int index)
+{
+    VALUE str = rb_ary_entry(array, index);
+    if (!NIL_P(str)) {
+        StringValue(str);
+        if (!rb_enc_asciicompat(rb_enc_get(str))) {
+            rb_raise(rb_eArgError, "invalid source encoding");
+        }
+    }
+    return str;
+}
+
+static VALUE
+rb_ast_parse_array(VALUE array, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    rb_ast_t *ast = 0;
+
+    array = rb_check_array_type(array);
+    VALUE vparser = ast_parse_new();
+    if (RTEST(keep_script_lines)) rb_parser_keep_script_lines(vparser);
+    if (RTEST(error_tolerant)) rb_parser_error_tolerant(vparser);
+    if (RTEST(keep_tokens)) rb_parser_keep_tokens(vparser);
+    ast = rb_parser_compile_generic(vparser, lex_array, Qnil, array, 1);
+    return ast_parse_done(ast);
+}
+
+static VALUE node_children(rb_ast_t*, const NODE*);
+
+static VALUE
+node_find(VALUE self, const int node_id)
+{
+    VALUE ary;
+    long i;
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    if (nd_node_id(data->node) == node_id) return self;
+
+    ary = node_children(data->ast, data->node);
+
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        VALUE child = RARRAY_AREF(ary, i);
+
+        if (CLASS_OF(child) == rb_cNode) {
+            VALUE result = node_find(child, node_id);
+            if (RTEST(result)) return result;
+        }
+    }
+
+    return Qnil;
+}
+
+extern VALUE rb_e_script;
+
+static VALUE
+script_lines(VALUE path)
+{
+    VALUE hash, lines;
+    ID script_lines;
+    CONST_ID(script_lines, "SCRIPT_LINES__");
+    if (!rb_const_defined_at(rb_cObject, script_lines)) return Qnil;
+    hash = rb_const_get_at(rb_cObject, script_lines);
+    if (!RB_TYPE_P(hash, T_HASH)) return Qnil;
+    lines = rb_hash_lookup(hash, path);
+    if (!RB_TYPE_P(lines, T_ARRAY)) return Qnil;
+    return lines;
+}
+
+static VALUE
+node_id_for_backtrace_location(rb_execution_context_t *ec, VALUE module, VALUE location)
+{
+    int node_id;
+
+    if (!rb_frame_info_p(location)) {
+        rb_raise(rb_eTypeError, "Thread::Backtrace::Location object expected");
+    }
+
+    node_id = rb_get_node_id_from_frame_info(location);
+    if (node_id == -1) {
+        return Qnil;
+    }
+
+    return INT2NUM(node_id);
+}
+
+static VALUE
+ast_s_of(rb_execution_context_t *ec, VALUE module, VALUE body, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    VALUE node, lines = Qnil;
+    const rb_iseq_t *iseq;
+    int node_id;
+
+    if (rb_frame_info_p(body)) {
+        iseq = rb_get_iseq_from_frame_info(body);
+        node_id = rb_get_node_id_from_frame_info(body);
+    }
+    else {
+        iseq = NULL;
+
+        if (rb_obj_is_proc(body)) {
+            iseq = vm_proc_iseq(body);
+
+            if (!rb_obj_is_iseq((VALUE)iseq)) return Qnil;
+        }
+        else {
+            iseq = rb_method_iseq(body);
+        }
+        if (iseq) {
+            node_id = ISEQ_BODY(iseq)->location.node_id;
+        }
+    }
+
+    if (!iseq) {
+        return Qnil;
+    }
+    lines = ISEQ_BODY(iseq)->variable.script_lines;
+
+    VALUE path = rb_iseq_path(iseq);
+    int e_option = RSTRING_LEN(path) == 2 && memcmp(RSTRING_PTR(path), "-e", 2) == 0;
+
+    if (NIL_P(lines) && rb_iseq_from_eval_p(iseq) && !e_option) {
+        rb_raise(rb_eArgError, "cannot get AST for method defined in eval");
+    }
+
+    if (!NIL_P(lines) || !NIL_P(lines = script_lines(path))) {
+        node = rb_ast_parse_array(lines, keep_script_lines, error_tolerant, keep_tokens);
+    }
+    else if (e_option) {
+        node = rb_ast_parse_str(rb_e_script, keep_script_lines, error_tolerant, keep_tokens);
+    }
+    else {
+        node = rb_ast_parse_file(path, keep_script_lines, error_tolerant, keep_tokens);
+    }
+
+    return node_find(node, node_id);
+}
+
+static VALUE
+rb_ast_node_alloc(VALUE klass)
+{
+    struct ASTNodeData *data;
+    VALUE obj = TypedData_Make_Struct(klass, struct ASTNodeData, &rb_node_type, data);
+
+    return obj;
+}
+
+static const char*
+node_type_to_str(const NODE *node)
+{
+    return (ruby_node_name(nd_type(node)) + rb_strlen_lit("NODE_"));
+}
+
+static VALUE
+ast_node_type(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return rb_sym_intern_ascii_cstr(node_type_to_str(data->node));
+}
+
+static VALUE
+ast_node_node_id(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2FIX(nd_node_id(data->node));
+}
+
+#define NEW_CHILD(ast, node) node ? ast_new_internal(ast, node) : Qnil
+
+static VALUE
+rb_ary_new_from_node_args(rb_ast_t *ast, long n, ...)
+{
+    va_list ar;
+    VALUE ary;
+    long i;
+
+    ary = rb_ary_new2(n);
+
+    va_start(ar, n);
+    for (i=0; i<n; i++) {
+        NODE *node;
+        node = va_arg(ar, NODE *);
+        rb_ary_push(ary, NEW_CHILD(ast, node));
+    }
+    va_end(ar);
+    return ary;
+}
+
+static VALUE
+dump_block(rb_ast_t *ast, const NODE *node)
+{
+    VALUE ary = rb_ary_new();
+    do {
+        rb_ary_push(ary, NEW_CHILD(ast, node->nd_head));
+    } while (node->nd_next &&
+        nd_type_p(node->nd_next, NODE_BLOCK) &&
+        (node = node->nd_next, 1));
+    if (node->nd_next) {
+        rb_ary_push(ary, NEW_CHILD(ast, node->nd_next));
+    }
+
+    return ary;
+}
+
+static VALUE
+dump_array(rb_ast_t *ast, const NODE *node)
+{
+    VALUE ary = rb_ary_new();
+    rb_ary_push(ary, NEW_CHILD(ast, node->nd_head));
+
+    while (node->nd_next && nd_type_p(node->nd_next, NODE_LIST)) {
+        node = node->nd_next;
+        rb_ary_push(ary, NEW_CHILD(ast, node->nd_head));
+    }
+    rb_ary_push(ary, NEW_CHILD(ast, node->nd_next));
+
+    return ary;
+}
+
+static VALUE
+var_name(ID id)
+{
+    if (!id) return Qnil;
+    if (!rb_id2str(id)) return Qnil;
+    return ID2SYM(id);
+}
+
+static VALUE
+no_name_rest(void)
+{
+    ID rest;
+    CONST_ID(rest, "NODE_SPECIAL_NO_NAME_REST");
+    return ID2SYM(rest);
+}
+
+static VALUE
+rest_arg(rb_ast_t *ast, const NODE *rest_arg)
+{
+    return NODE_NAMED_REST_P(rest_arg) ? NEW_CHILD(ast, rest_arg) : no_name_rest();
+}
+
+static VALUE
+node_children(rb_ast_t *ast, const NODE *node)
+{
+    char name[DECIMAL_SIZE_OF_BITS(sizeof(long) * CHAR_BIT) + 2]; /* including '$' */
+
+    enum node_type type = nd_type(node);
+    switch (type) {
+      case NODE_BLOCK:
+        return dump_block(ast, node);
+      case NODE_IF:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_cond, node->nd_body, node->nd_else);
+      case NODE_UNLESS:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_cond, node->nd_body, node->nd_else);
+      case NODE_CASE:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_CASE2:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_CASE3:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_WHEN:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_head, node->nd_body, node->nd_next);
+      case NODE_IN:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_head, node->nd_body, node->nd_next);
+      case NODE_WHILE:
+      case NODE_UNTIL:
+        return rb_ary_push(rb_ary_new_from_node_args(ast, 2, node->nd_cond, node->nd_body),
+                           RBOOL(node->nd_state));
+      case NODE_ITER:
+      case NODE_FOR:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_iter, node->nd_body);
+      case NODE_FOR_MASGN:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_var);
+      case NODE_BREAK:
+      case NODE_NEXT:
+      case NODE_RETURN:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_stts);
+      case NODE_REDO:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_RETRY:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_BEGIN:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_RESCUE:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_head, node->nd_resq, node->nd_else);
+      case NODE_RESBODY:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_args, node->nd_body, node->nd_head);
+      case NODE_ENSURE:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_ensr);
+      case NODE_AND:
+      case NODE_OR:
+        {
+            VALUE ary = rb_ary_new();
+
+            while (1) {
+                rb_ary_push(ary, NEW_CHILD(ast, node->nd_1st));
+                if (!node->nd_2nd || !nd_type_p(node->nd_2nd, type))
+                    break;
+                node = node->nd_2nd;
+            }
+            rb_ary_push(ary, NEW_CHILD(ast, node->nd_2nd));
+            return ary;
+        }
+      case NODE_MASGN:
+        if (NODE_NAMED_REST_P(node->nd_args)) {
+            return rb_ary_new_from_node_args(ast, 3, node->nd_value, node->nd_head, node->nd_args);
+        }
+        else {
+            return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_value),
+                                        NEW_CHILD(ast, node->nd_head),
+                                        no_name_rest());
+        }
+      case NODE_LASGN:
+      case NODE_DASGN:
+      case NODE_IASGN:
+      case NODE_CVASGN:
+      case NODE_GASGN:
+        if (NODE_REQUIRED_KEYWORD_P(node)) {
+            return rb_ary_new_from_args(2, var_name(node->nd_vid), ID2SYM(rb_intern("NODE_SPECIAL_REQUIRED_KEYWORD")));
+        }
+        return rb_ary_new_from_args(2, var_name(node->nd_vid), NEW_CHILD(ast, node->nd_value));
+      case NODE_CDECL:
+        if (node->nd_vid) {
+            return rb_ary_new_from_args(2, ID2SYM(node->nd_vid), NEW_CHILD(ast, node->nd_value));
+        }
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_else), ID2SYM(node->nd_else->nd_mid), NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_ASGN1:
+        return rb_ary_new_from_args(4, NEW_CHILD(ast, node->nd_recv),
+                                    ID2SYM(node->nd_mid),
+                                    NEW_CHILD(ast, node->nd_args->nd_head),
+                                    NEW_CHILD(ast, node->nd_args->nd_body));
+      case NODE_OP_ASGN2:
+        return rb_ary_new_from_args(5, NEW_CHILD(ast, node->nd_recv),
+                                    RBOOL(node->nd_next->nd_aid),
+                                    ID2SYM(node->nd_next->nd_vid),
+                                    ID2SYM(node->nd_next->nd_mid),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_ASGN_AND:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_head), ID2SYM(idANDOP),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_ASGN_OR:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_head), ID2SYM(idOROP),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_OP_CDECL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_head),
+                                    ID2SYM(node->nd_aid),
+                                    NEW_CHILD(ast, node->nd_value));
+      case NODE_CALL:
+      case NODE_OPCALL:
+      case NODE_QCALL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_recv),
+                                    ID2SYM(node->nd_mid),
+                                    NEW_CHILD(ast, node->nd_args));
+      case NODE_FCALL:
+        return rb_ary_new_from_args(2, ID2SYM(node->nd_mid),
+                                    NEW_CHILD(ast, node->nd_args));
+      case NODE_VCALL:
+        return rb_ary_new_from_args(1, ID2SYM(node->nd_mid));
+      case NODE_SUPER:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_args);
+      case NODE_ZSUPER:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_LIST:
+      case NODE_VALUES:
+        return dump_array(ast, node);
+      case NODE_ZLIST:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_HASH:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_YIELD:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_LVAR:
+      case NODE_DVAR:
+        return rb_ary_new_from_args(1, var_name(node->nd_vid));
+      case NODE_IVAR:
+      case NODE_CONST:
+      case NODE_CVAR:
+      case NODE_GVAR:
+        return rb_ary_new_from_args(1, ID2SYM(node->nd_vid));
+      case NODE_NTH_REF:
+        snprintf(name, sizeof(name), "$%ld", node->nd_nth);
+        return rb_ary_new_from_args(1, ID2SYM(rb_intern(name)));
+      case NODE_BACK_REF:
+        name[0] = '$';
+        name[1] = (char)node->nd_nth;
+        name[2] = '\0';
+        return rb_ary_new_from_args(1, ID2SYM(rb_intern(name)));
+      case NODE_MATCH2:
+        if (node->nd_args) {
+            return rb_ary_new_from_node_args(ast, 3, node->nd_recv, node->nd_value, node->nd_args);
+        }
+        return rb_ary_new_from_node_args(ast, 2, node->nd_recv, node->nd_value);
+      case NODE_MATCH3:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_recv, node->nd_value);
+      case NODE_MATCH:
+      case NODE_LIT:
+      case NODE_STR:
+      case NODE_XSTR:
+        return rb_ary_new_from_args(1, node->nd_lit);
+      case NODE_ONCE:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_DSTR:
+      case NODE_DXSTR:
+      case NODE_DREGX:
+      case NODE_DSYM:
+        {
+            NODE *n = node->nd_next;
+            VALUE head = Qnil, next = Qnil;
+            if (n) {
+                head = NEW_CHILD(ast, n->nd_head);
+                next = NEW_CHILD(ast, n->nd_next);
+            }
+            return rb_ary_new_from_args(3, node->nd_lit, head, next);
+        }
+      case NODE_EVSTR:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_ARGSCAT:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_ARGSPUSH:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_SPLAT:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_BLOCK_PASS:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_head, node->nd_body);
+      case NODE_DEFN:
+        return rb_ary_new_from_args(2, ID2SYM(node->nd_mid), NEW_CHILD(ast, node->nd_defn));
+      case NODE_DEFS:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_recv), ID2SYM(node->nd_mid), NEW_CHILD(ast, node->nd_defn));
+      case NODE_ALIAS:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_1st, node->nd_2nd);
+      case NODE_VALIAS:
+        return rb_ary_new_from_args(2, ID2SYM(node->nd_alias), ID2SYM(node->nd_orig));
+      case NODE_UNDEF:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_undef);
+      case NODE_CLASS:
+        return rb_ary_new_from_node_args(ast, 3, node->nd_cpath, node->nd_super, node->nd_body);
+      case NODE_MODULE:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_cpath, node->nd_body);
+      case NODE_SCLASS:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_recv, node->nd_body);
+      case NODE_COLON2:
+        return rb_ary_new_from_args(2, NEW_CHILD(ast, node->nd_head), ID2SYM(node->nd_mid));
+      case NODE_COLON3:
+        return rb_ary_new_from_args(1, ID2SYM(node->nd_mid));
+      case NODE_DOT2:
+      case NODE_DOT3:
+      case NODE_FLIP2:
+      case NODE_FLIP3:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_beg, node->nd_end);
+      case NODE_SELF:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_NIL:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_TRUE:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_FALSE:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_ERRINFO:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_DEFINED:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_head);
+      case NODE_POSTEXE:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_ATTRASGN:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast, node->nd_recv), ID2SYM(node->nd_mid), NEW_CHILD(ast, node->nd_args));
+      case NODE_LAMBDA:
+        return rb_ary_new_from_node_args(ast, 1, node->nd_body);
+      case NODE_OPT_ARG:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_body, node->nd_next);
+      case NODE_KW_ARG:
+        return rb_ary_new_from_node_args(ast, 2, node->nd_body, node->nd_next);
+      case NODE_POSTARG:
+        if (NODE_NAMED_REST_P(node->nd_1st)) {
+            return rb_ary_new_from_node_args(ast, 2, node->nd_1st, node->nd_2nd);
+        }
+        return rb_ary_new_from_args(2, no_name_rest(),
+                                    NEW_CHILD(ast, node->nd_2nd));
+      case NODE_ARGS:
+        {
+            struct rb_args_info *ainfo = node->nd_ainfo;
+            return rb_ary_new_from_args(10,
+                                        INT2NUM(ainfo->pre_args_num),
+                                        NEW_CHILD(ast, ainfo->pre_init),
+                                        NEW_CHILD(ast, ainfo->opt_args),
+                                        var_name(ainfo->first_post_arg),
+                                        INT2NUM(ainfo->post_args_num),
+                                        NEW_CHILD(ast, ainfo->post_init),
+                                        (ainfo->rest_arg == NODE_SPECIAL_EXCESSIVE_COMMA
+                                            ? ID2SYM(rb_intern("NODE_SPECIAL_EXCESSIVE_COMMA"))
+                                            : var_name(ainfo->rest_arg)),
+                                        (ainfo->no_kwarg ? Qfalse : NEW_CHILD(ast, ainfo->kw_args)),
+                                        (ainfo->no_kwarg ? Qfalse : NEW_CHILD(ast, ainfo->kw_rest_arg)),
+                                        var_name(ainfo->block_arg));
+        }
+      case NODE_SCOPE:
+        {
+            rb_ast_id_table_t *tbl = node->nd_tbl;
+            int i, size = tbl ? tbl->size : 0;
+            VALUE locals = rb_ary_new_capa(size);
+            for (i = 0; i < size; i++) {
+                rb_ary_push(locals, var_name(tbl->ids[i]));
+            }
+            return rb_ary_new_from_args(3, locals, NEW_CHILD(ast, node->nd_args), NEW_CHILD(ast, node->nd_body));
+        }
+      case NODE_ARYPTN:
+        {
+            struct rb_ary_pattern_info *apinfo = node->nd_apinfo;
+            VALUE rest = rest_arg(ast, apinfo->rest_arg);
+            return rb_ary_new_from_args(4,
+                                        NEW_CHILD(ast, node->nd_pconst),
+                                        NEW_CHILD(ast, apinfo->pre_args),
+                                        rest,
+                                        NEW_CHILD(ast, apinfo->post_args));
+        }
+      case NODE_FNDPTN:
+        {
+            struct rb_fnd_pattern_info *fpinfo = node->nd_fpinfo;
+            VALUE pre_rest = rest_arg(ast, fpinfo->pre_rest_arg);
+            VALUE post_rest = rest_arg(ast, fpinfo->post_rest_arg);
+            return rb_ary_new_from_args(4,
+                                        NEW_CHILD(ast, node->nd_pconst),
+                                        pre_rest,
+                                        NEW_CHILD(ast, fpinfo->args),
+                                        post_rest);
+        }
+      case NODE_HSHPTN:
+        {
+            VALUE kwrest = node->nd_pkwrestarg == NODE_SPECIAL_NO_REST_KEYWORD ? ID2SYM(rb_intern("NODE_SPECIAL_NO_REST_KEYWORD")) :
+                                                                                 NEW_CHILD(ast, node->nd_pkwrestarg);
+
+            return rb_ary_new_from_args(3,
+                                        NEW_CHILD(ast, node->nd_pconst),
+                                        NEW_CHILD(ast, node->nd_pkwargs),
+                                        kwrest);
+        }
+      case NODE_ERROR:
+        return rb_ary_new_from_node_args(ast, 0);
+      case NODE_ARGS_AUX:
+      case NODE_LAST:
+        break;
+    }
+
+    rb_bug("node_children: unknown node: %s", ruby_node_name(type));
+}
+
+static VALUE
+ast_node_children(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return node_children(data->ast, data->node);
+}
+
+static VALUE
+ast_node_first_lineno(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_first_lineno(data->node));
+}
+
+static VALUE
+ast_node_first_column(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_first_column(data->node));
+}
+
+static VALUE
+ast_node_last_lineno(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_last_lineno(data->node));
+}
+
+static VALUE
+ast_node_last_column(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return INT2NUM(nd_last_column(data->node));
+}
+
+static VALUE
+ast_node_all_tokens(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return rb_ast_tokens(data->ast);
+}
+
+static VALUE
+ast_node_inspect(rb_execution_context_t *ec, VALUE self)
+{
+    VALUE str;
+    VALUE cname;
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    cname = rb_class_path(rb_obj_class(self));
+    str = rb_str_new2("#<");
+
+    rb_str_append(str, cname);
+    rb_str_catf(str, ":%s@%d:%d-%d:%d>",
+                node_type_to_str(data->node),
+                nd_first_lineno(data->node), nd_first_column(data->node),
+                nd_last_lineno(data->node), nd_last_column(data->node));
+
+    return str;
+}
+
+static VALUE
+ast_node_script_lines(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+    VALUE ret = data->ast->body.script_lines;
+    if (!RB_TYPE_P(ret, T_ARRAY)) return Qnil;
+    return ret;
+}
+
+#include "ast.rbinc"
+
+void
+Init_ast(void)
+{
+    rb_mAST = rb_define_module_under(rb_cRubyVM, "AbstractSyntaxTree");
+    rb_cNode = rb_define_class_under(rb_mAST, "Node", rb_cObject);
+    rb_undef_alloc_func(rb_cNode);
+}
diff --git a/ast.rb b/ast.rb
new file mode 100644
index 0000000000..f3f72c747f
--- /dev/null
+++ b/ast.rb
@@ -0,0 +1,276 @@
+# for ast.c
+
+# AbstractSyntaxTree provides methods to parse Ruby code into
+# abstract syntax trees. The nodes in the tree
+# are instances of RubyVM::AbstractSyntaxTree::Node.
+#
+# This module is MRI specific as it exposes implementation details
+# of the MRI abstract syntax tree.
+#
+# This module is experimental and its API is not stable, therefore it might
+# change without notice. As examples, the order of children nodes is not
+# guaranteed, the number of children nodes might change, there is no way to
+# access children nodes by name, etc.
+#
+# If you are looking for a stable API or an API working under multiple Ruby
+# implementations, consider using the _parser_ gem or Ripper. If you would
+# like to make RubyVM::AbstractSyntaxTree stable, please join the discussion
+# at https://bugs.ruby-lang.org/issues/14844.
+#
+module RubyVM::AbstractSyntaxTree
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.parse(string, keep_script_lines: false, error_tolerant: false, keep_tokens: false) -> RubyVM::AbstractSyntaxTree::Node
+  #
+  #  Parses the given _string_ into an abstract syntax tree,
+  #  returning the root node of that tree.
+  #
+  #    RubyVM::AbstractSyntaxTree.parse("x = 1 + 2")
+  #    # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-1:9>
+  #
+  #  If <tt>keep_script_lines: true</tt> option is provided, the text of the parsed
+  #  source is associated with nodes and is available via Node#script_lines.
+  #
+  #  If <tt>keep_tokens: true</tt> option is provided, Node#tokens are populated.
+  #
+  #  SyntaxError is raised if the given _string_ is invalid syntax. To overwrite this
+  #  behavior, <tt>error_tolerant: true</tt> can be provided. In this case, the parser
+  #  will produce a tree where expressions with syntax errors would be represented by
+  #  Node with <tt>type=:ERROR</tt>.
+  #
+  #     root = RubyVM::AbstractSyntaxTree.parse("x = 1; p(x; y=2")
+  #     # <internal:ast>:33:in `parse': syntax error, unexpected ';', expecting ')' (SyntaxError)
+  #     # x = 1; p(x; y=2
+  #     #           ^
+  #
+  #     root = RubyVM::AbstractSyntaxTree.parse("x = 1; p(x; y=2", error_tolerant: true)
+  #     # (SCOPE@1:0-1:15
+  #     #  tbl: [:x, :y]
+  #     #  args: nil
+  #     #  body: (BLOCK@1:0-1:15 (LASGN@1:0-1:5 :x (LIT@1:4-1:5 1)) (ERROR@1:7-1:11) (LASGN@1:12-1:15 :y (LIT@1:14-1:15 2))))
+  #     root.children.last.children
+  #     # [(LASGN@1:0-1:5 :x (LIT@1:4-1:5 1)),
+  #     #  (ERROR@1:7-1:11),
+  #     #  (LASGN@1:12-1:15 :y (LIT@1:14-1:15 2))]
+  #
+  #  Note that parsing continues even after the errored expresion.
+  #
+  def self.parse string, keep_script_lines: false, error_tolerant: false, keep_tokens: false
+    Primitive.ast_s_parse string, keep_script_lines, error_tolerant, keep_tokens
+  end
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.parse_file(pathname, keep_script_lines: false, error_tolerant: false, keep_tokens: false) -> RubyVM::AbstractSyntaxTree::Node
+  #
+  #   Reads the file from _pathname_, then parses it like ::parse,
+  #   returning the root node of the abstract syntax tree.
+  #
+  #   SyntaxError is raised if _pathname_'s contents are not
+  #   valid Ruby syntax.
+  #
+  #     RubyVM::AbstractSyntaxTree.parse_file("my-app/app.rb")
+  #     # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-31:3>
+  #
+  #   See ::parse for explanation of keyword argument meaning and usage.
+  def self.parse_file pathname, keep_script_lines: false, error_tolerant: false, keep_tokens: false
+    Primitive.ast_s_parse_file pathname, keep_script_lines, error_tolerant, keep_tokens
+  end
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.of(proc, keep_script_lines: false, error_tolerant: false, keep_tokens: false)   -> RubyVM::AbstractSyntaxTree::Node
+  #     RubyVM::AbstractSyntaxTree.of(method, keep_script_lines: false, error_tolerant: false, keep_tokens: false) -> RubyVM::AbstractSyntaxTree::Node
+  #
+  #   Returns AST nodes of the given _proc_ or _method_.
+  #
+  #     RubyVM::AbstractSyntaxTree.of(proc {1 + 2})
+  #     # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:35-1:42>
+  #
+  #     def hello
+  #       puts "hello, world"
+  #     end
+  #
+  #     RubyVM::AbstractSyntaxTree.of(method(:hello))
+  #     # => #<RubyVM::AbstractSyntaxTree::Node:SCOPE@1:0-3:3>
+  #
+  #   See ::parse for explanation of keyword argument meaning and usage.
+  def self.of body, keep_script_lines: false, error_tolerant: false, keep_tokens: false
+    Primitive.ast_s_of body, keep_script_lines, error_tolerant, keep_tokens
+  end
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.node_id_for_backtrace_location(backtrace_location)   -> integer
+  #
+  #   Returns the node id for the given backtrace location.
+  #
+  #     begin
+  #       raise
+  #     rescue =>  e
+  #       loc = e.backtrace_locations.first
+  #       RubyVM::AbstractSyntaxTree.node_id_for_backtrace_location(loc)
+  #     end # => 0
+  def self.node_id_for_backtrace_location backtrace_location
+    Primitive.node_id_for_backtrace_location backtrace_location
+  end
+
+  # RubyVM::AbstractSyntaxTree::Node instances are created by parse methods in
+  # RubyVM::AbstractSyntaxTree.
+  #
+  # This class is MRI specific.
+  #
+  class Node
+
+    #  call-seq:
+    #     node.type -> symbol
+    #
+    #  Returns the type of this node as a symbol.
+    #
+    #    root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2")
+    #    root.type # => :SCOPE
+    #    lasgn = root.children[2]
+    #    lasgn.type # => :LASGN
+    #    call = lasgn.children[1]
+    #    call.type # => :OPCALL
+    def type
+      Primitive.ast_node_type
+    end
+
+    #  call-seq:
+    #     node.first_lineno -> integer
+    #
+    #  The line number in the source code where this AST's text began.
+    def first_lineno
+      Primitive.ast_node_first_lineno
+    end
+
+    #  call-seq:
+    #     node.first_column -> integer
+    #
+    #  The column number in the source code where this AST's text began.
+    def first_column
+      Primitive.ast_node_first_column
+    end
+
+    #  call-seq:
+    #     node.last_lineno -> integer
+    #
+    #  The line number in the source code where this AST's text ended.
+    def last_lineno
+      Primitive.ast_node_last_lineno
+    end
+
+    #  call-seq:
+    #     node.last_column -> integer
+    #
+    #  The column number in the source code where this AST's text ended.
+    def last_column
+      Primitive.ast_node_last_column
+    end
+
+    #  call-seq:
+    #     node.tokens -> array
+    #
+    #  Returns tokens corresponding to the location of the node.
+    #  Returns +nil+ if +keep_tokens+ is not enabled when #parse method is called.
+    #
+    #    root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2", keep_tokens: true)
+    #    root.tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+    #    root.tokens.map{_1[2]}.join # => "x = 1 + 2"
+    #
+    #  Token is an array of:
+    #
+    #  - id
+    #  - token type
+    #  - source code text
+    #  - location [ first_lineno, first_column, last_lineno, last_column ]
+    def tokens
+      return nil unless all_tokens
+
+      all_tokens.each_with_object([]) do |token, a|
+        loc = token.last
+        if ([first_lineno, first_column] <=> [loc[0], loc[1]]) <= 0 &&
+           ([last_lineno, last_column]   <=> [loc[2], loc[3]]) >= 0
+           a << token
+        end
+      end
+    end
+
+    #  call-seq:
+    #     node.all_tokens -> array
+    #
+    #  Returns all tokens for the input script regardless the receiver node.
+    #  Returns +nil+ if +keep_tokens+ is not enabled when #parse method is called.
+    #
+    #    root = RubyVM::AbstractSyntaxTree.parse("x = 1 + 2", keep_tokens: true)
+    #    root.all_tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+    #    root.children[-1].all_tokens # => [[0, :tIDENTIFIER, "x", [1, 0, 1, 1]], [1, :tSP, " ", [1, 1, 1, 2]], ...]
+    def all_tokens
+      Primitive.ast_node_all_tokens
+    end
+
+    #  call-seq:
+    #     node.children -> array
+    #
+    #  Returns AST nodes under this one.  Each kind of node
+    #  has different children, depending on what kind of node it is.
+    #
+    #  The returned array may contain other nodes or <code>nil</code>.
+    def children
+      Primitive.ast_node_children
+    end
+
+    #  call-seq:
+    #     node.inspect -> string
+    #
+    #  Returns debugging information about this node as a string.
+    def inspect
+      Primitive.ast_node_inspect
+    end
+
+    #  call-seq:
+    #     node.node_id -> integer
+    #
+    #  Returns an internal node_id number.
+    #  Note that this is an API for ruby internal use, debugging,
+    #  and research. Do not use this for any other purpose.
+    #  The compatibility is not guaranteed.
+    def node_id
+      Primitive.ast_node_node_id
+    end
+
+    #  call-seq:
+    #     node.script_lines -> array
+    #
+    #  Returns the original source code as an array of lines.
+    #
+    #  Note that this is an API for ruby internal use, debugging,
+    #  and research. Do not use this for any other purpose.
+    #  The compatibility is not guaranteed.
+    def script_lines
+      Primitive.ast_node_script_lines
+    end
+
+    #  call-seq:
+    #     node.source -> string
+    #
+    #  Returns the code fragment that corresponds to this AST.
+    #
+    #  Note that this is an API for ruby internal use, debugging,
+    #  and research. Do not use this for any other purpose.
+    #  The compatibility is not guaranteed.
+    #
+    #  Also note that this API may return an incomplete code fragment
+    #  that does not parse; for example, a here document following
+    #  an expression may be dropped.
+    def source
+      lines = script_lines
+      if lines
+        lines = lines[first_lineno - 1 .. last_lineno - 1]
+        lines[-1] = lines[-1][0...last_column]
+        lines[0] = lines[0][first_column..-1]
+        lines.join
+      else
+        nil
+      end
+    end
+  end
+end
diff --git a/atomic.h b/atomic.h
deleted file mode 100644
index d314804a15..0000000000
--- a/atomic.h
+++ /dev/null
@@ -1,67 +0,0 @@
-#ifndef RUBY_ATOMIC_H
-#define RUBY_ATOMIC_H
-
-#ifdef _WIN32
-#if defined _MSC_VER && _MSC_VER > 1200
-#pragma intrinsic(_InterlockedOr)
-#endif
-typedef LONG rb_atomic_t;
-
-# define ATOMIC_SET(var, val) InterlockedExchange(&(var), (val))
-# define ATOMIC_INC(var) InterlockedIncrement(&(var))
-# define ATOMIC_DEC(var) InterlockedDecrement(&(var))
-#if defined __GNUC__
-# define ATOMIC_OR(var, val) __asm__("lock\n\t" "orl\t%1, %0" : "=m"(var) : "Ir"(val))
-#elif defined _MSC_VER && _MSC_VER <= 1200
-# define ATOMIC_OR(var, val) rb_w32_atomic_or(&(var), (val))
-static inline void
-rb_w32_atomic_or(volatile rb_atomic_t *var, rb_atomic_t val)
-{
-#ifdef _M_IX86
-    __asm mov eax, var;
-    __asm mov ecx, val;
-    __asm lock or [eax], ecx;
-#else
-#error unsupported architecture
-#endif
-}
-#else
-# define ATOMIC_OR(var, val) _InterlockedOr(&(var), (val))
-#endif
-# define ATOMIC_EXCHANGE(var, val) InterlockedExchange(&(var), (val))
-
-#elif defined HAVE_GCC_ATOMIC_BUILTINS
-/* @shyouhei hack to support atomic operations in case of gcc. Gcc
- * has its own pseudo-insns to support them.  See info, or
- * http://gcc.gnu.org/onlinedocs/gcc/Atomic-Builtins.html */
-
-typedef unsigned int rb_atomic_t; /* Anything OK */
-# define ATOMIC_SET(var, val)  (void)__sync_lock_test_and_set(&(var), (val))
-# define ATOMIC_INC(var) __sync_fetch_and_add(&(var), 1)
-# define ATOMIC_DEC(var) __sync_fetch_and_sub(&(var), 1)
-# define ATOMIC_OR(var, val) __sync_or_and_fetch(&(var), (val))
-# define ATOMIC_EXCHANGE(var, val) __sync_lock_test_and_set(&(var), (val))
-
-#elif defined(__sun)
-#include <atomic.h>
-typedef unsigned int rb_atomic_t;
-
-# define ATOMIC_SET(var, val) (void)atomic_swap_uint(&(var), (val))
-# define ATOMIC_INC(var) atomic_inc_uint(&(var))
-# define ATOMIC_DEC(var) atomic_dec_uint(&(var))
-# define ATOMIC_OR(var, val) atomic_or_uint(&(var), (val))
-# define ATOMIC_EXCHANGE(var, val) atomic_swap_uint(&(var), (val))
-
-#else
-typedef int rb_atomic_t;
-#define NEED_RUBY_ATOMIC_EXCHANGE
-extern rb_atomic_t ruby_atomic_exchange(rb_atomic_t *ptr, rb_atomic_t val);
-
-# define ATOMIC_SET(var, val) (void)((var) = (val))
-# define ATOMIC_INC(var) ((var)++)
-# define ATOMIC_DEC(var) ((var)--)
-# define ATOMIC_OR(var, val) ((var) |= (val))
-# define ATOMIC_EXCHANGE(var, val) ruby_atomic_exchange(&(var), (val))
-#endif
-
-#endif /* RUBY_ATOMIC_H */
diff --git a/autogen.sh b/autogen.sh
new file mode 100755
index 0000000000..f8cdf3c0c1
--- /dev/null
+++ b/autogen.sh
@@ -0,0 +1,17 @@
+#!/bin/sh
+
+PWD=
+case "$0" in
+*/*) srcdir=`dirname $0`;;
+*) srcdir="";;
+esac
+
+symlink='--install --symlink'
+case " $* " in
+    *" -i "*|*" --install "*)
+        # reset to copy missing standard auxiliary files, instead of symlinks
+        symlink=
+        ;;
+esac
+
+exec ${AUTORECONF:-autoreconf} ${symlink} "$@" ${srcdir:+"$srcdir"}
diff --git a/basictest/runner.rb b/basictest/runner.rb
new file mode 100755
index 0000000000..0f398e7acc
--- /dev/null
+++ b/basictest/runner.rb
@@ -0,0 +1,33 @@
+#! ./miniruby
+
+exit if defined?(CROSS_COMPILING) and CROSS_COMPILING
+ruby = ENV["RUBY"]
+unless ruby
+  load './rbconfig.rb'
+  ruby = "./#{RbConfig::CONFIG['ruby_install_name']}#{RbConfig::CONFIG['EXEEXT']}"
+end
+unless File.exist? ruby
+  print "#{ruby} is not found.\n"
+  print "Try `make' first, then `make test', please.\n"
+  exit false
+end
+ARGV[0] and opt = ARGV[0][/\A--run-opt=(.*)/, 1] and ARGV.shift
+
+$stderr.reopen($stdout)
+error = ''
+
+srcdir = File.expand_path('..', File.dirname(__FILE__))
+if env = ENV["RUBYOPT"]
+  ENV["RUBYOPT"] = env + " -W1"
+end
+`#{ruby} #{opt} -W1 #{srcdir}/basictest/test.rb #{ARGV.join(' ')}`.each_line do |line|
+  if line =~ /^end of test/
+    print "\ntest succeeded\n"
+    exit true
+  end
+  error << line if %r:^(basictest/test.rb|not): =~ line
+end
+puts
+print error
+print "test failed\n"
+exit false
diff --git a/basictest/test.rb b/basictest/test.rb
new file mode 100755
index 0000000000..95875b52a6
--- /dev/null
+++ b/basictest/test.rb
@@ -0,0 +1,2367 @@
+#! /usr/bin/env ruby
+# -*- coding: us-ascii -*-
+
+$testnum=0
+$ntest=0
+$failed = 0
+class Progress
+  def initialize
+    @color = nil
+    @tty = nil
+    @quiet = nil
+    @verbose = nil
+    ARGV.each do |arg|
+      case arg
+      when /\A--color(?:=(?:always|(auto)|(never)|(.*)))?\z/
+        warn "unknown --color argument: #$3" if $3
+        @color = $1 ? nil : !$2
+      when /\A--tty(=(?:yes|(no)|(.*)))?\z/
+        warn "unknown --tty argument: #$3" if $3
+        @tty = !$1 || !$2
+        true
+      when /\A-(q|-quiet)\z/
+        @quiet = true
+      when /\A-(v|-verbose)\z/
+        @verbose = true
+      end
+    end
+    @tty = STDERR.tty? && !STDOUT.tty? && /dumb/ !~ ENV["TERM"] if @tty.nil?
+    @eol = @tty && !@verbose ? "\r\e[K\r" : "\n"
+    case @color
+    when nil
+      @color = @tty
+    end
+    if @color
+      # dircolors-like style
+      colors = (colors = ENV['TEST_COLORS']) ? Hash[colors.scan(/(\w+)=([^:\n]*)/)] : {}
+      begin
+        File.read(File.join(__dir__, "../tool/colors")).scan(/(\w+)=([^:\n]*)/) do |n, c|
+          colors[n] ||= c
+        end
+      rescue
+      end
+      @passed = "\e[;#{colors["pass"] || "32"}m"
+      @failed = "\e[;#{colors["fail"] || "31"}m"
+      @reset = "\e[m"
+    else
+      @passed = @failed = @reset = ""
+    end
+    extend(Rotator) if @tty
+  end
+
+  def passed_string
+    "."
+  end
+  def failed_string
+    "#{@failed}F#{@reset}"
+  end
+  def init_string
+  end
+  def finish_string
+    if @quiet
+      @eol
+    else
+      "#{@passed}#{@ok ? 'OK' : ''} #{$testnum}#{@reset}#{@eol}"
+    end
+  end
+  def pass
+    STDERR.print passed_string
+  end
+  def fail
+    @ok = false
+    STDERR.print failed_string
+  end
+  def init
+    @ok = true
+    STDERR.print init_string
+  end
+  def finish
+    STDERR.print finish_string
+  end
+
+  module Rotator
+    ROTATOR = %w[- \\ | /]
+    BS = "\b" * ROTATOR[0].size
+    def passed_string
+      "#{BS}#{ROTATOR[(@count += 1) % ROTATOR.size]}"
+    end
+    def failed_string
+      "#{BS}#{super}#{ROTATOR[@count % ROTATOR.size]}"
+    end
+    def init_string
+      @count = 0
+      " "
+    end
+    def finish_string
+      s = "#{BS}#{' ' * BS.size}#{BS}#{super}"
+      s.gsub!(/\n/, "\r\e[2K\r") if @quiet
+      s
+    end
+  end
+end
+PROGRESS = Progress.new
+
+def test_check(what)
+  unless $ntest.zero?
+    PROGRESS.finish
+  end
+  STDERR.print "#{$0}:#{what} "
+  PROGRESS.init
+  $what = what
+  $testnum = 0
+end
+
+def test_ok(cond,n=1)
+  $testnum+=1
+  $ntest+=1
+  where = (st = caller(n)) ? st[0] : "caller error! (n=#{n}, trace=#{caller(0).join(', ')}"
+  if cond
+    PROGRESS.pass
+    printf "ok %d (%s)\n", $testnum, where
+  else
+    PROGRESS.fail
+    printf "not ok %s %d -- %s\n", $what, $testnum, where
+    $failed+=1
+  end
+  STDOUT.flush
+  STDERR.flush
+end
+
+# make sure conditional operators work
+
+test_check "assignment"
+
+a=[]; a[0] ||= "bar";
+test_ok(a[0] == "bar")
+h={}; h["foo"] ||= "bar";
+test_ok(h["foo"] == "bar")
+
+aa = 5
+aa ||= 25
+test_ok(aa == 5)
+bb ||= 25
+test_ok(bb == 25)
+cc &&=33
+test_ok(cc == nil)
+cc = 5
+cc &&=44
+test_ok(cc == 44)
+
+a = nil; test_ok(a == nil)
+a = 1; test_ok(a == 1)
+a = []; test_ok(a == [])
+a = [1]; test_ok(a == [1])
+a = [nil]; test_ok(a == [nil])
+a = [[]]; test_ok(a == [[]])
+a = [1,2]; test_ok(a == [1,2])
+a = [*[]]; test_ok(a == [])
+a = [*[1]]; test_ok(a == [1])
+a = [*[1,2]]; test_ok(a == [1,2])
+
+a = *[]; test_ok(a == [])
+a = *[1]; test_ok(a == [1])
+a = *[nil]; test_ok(a == [nil])
+a = *[[]]; test_ok(a == [[]])
+a = *[1,2]; test_ok(a == [1,2])
+a = *[*[]]; test_ok(a == [])
+a = *[*[1]]; test_ok(a == [1])
+a = *[*[1,2]]; test_ok(a == [1,2])
+
+a, = nil; test_ok(a == nil)
+a, = 1; test_ok(a == 1)
+a, = []; test_ok(a == nil)
+a, = [1]; test_ok(a == 1)
+a, = [nil]; test_ok(a == nil)
+a, = [[]]; test_ok(a == [])
+a, = 1,2; test_ok(a == 1)
+a, = [1,2]; test_ok(a == 1)
+a, = [*[]]; test_ok(a == nil)
+a, = [*[1]]; test_ok(a == 1)
+a, = *[1,2]; test_ok(a == 1)
+a, = [*[1,2]]; test_ok(a == 1)
+
+a, = *[]; test_ok(a == nil)
+a, = *[1]; test_ok(a == 1)
+a, = *[nil]; test_ok(a == nil)
+a, = *[[]]; test_ok(a == [])
+a, = *[1,2]; test_ok(a == 1)
+a, = *[*[]]; test_ok(a == nil)
+a, = *[*[1]]; test_ok(a == 1)
+a, = *[*[1,2]]; test_ok(a == 1)
+
+*a = nil; test_ok(a == [nil])
+*a = 1; test_ok(a == [1])
+*a = []; test_ok(a == [])
+*a = [1]; test_ok(a == [1])
+*a = [nil]; test_ok(a == [nil])
+*a = [[]]; test_ok(a == [[]])
+*a = [1,2]; test_ok(a == [1,2])
+*a = [*[]]; test_ok(a == [])
+*a = [*[1]]; test_ok(a == [1])
+*a = [*[1,2]]; test_ok(a == [1,2])
+
+*a = *[]; test_ok(a == [])
+*a = *[1]; test_ok(a == [1])
+*a = *[nil]; test_ok(a == [nil])
+*a = *[[]]; test_ok(a == [[]])
+*a = *[1,2]; test_ok(a == [1,2])
+*a = *[*[]]; test_ok(a == [])
+*a = *[*[1]]; test_ok(a == [1])
+*a = *[*[1,2]]; test_ok(a == [1,2])
+
+a,b,*c = nil; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = 1; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = []; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = [1]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = [nil]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = [[]]; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = [1,2]; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = [*[]]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = [*[1]]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = [*[1,2]]; test_ok([a,b,c] == [1,2,[]])
+
+a,b,*c = *[]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = *[1]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = *[nil]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = *[[]]; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = *[1,2]; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = *[*[]]; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = *[*[1]]; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = *[*[1,2]]; test_ok([a,b,c] == [1,2,[]])
+
+def f; yield nil; end; f {|a| test_ok(a == nil)}
+def f; yield 1; end; f {|a| test_ok(a == 1)}
+def f; yield []; end; f {|a| test_ok(a == [])}
+def f; yield [1]; end; f {|a| test_ok(a == [1])}
+def f; yield [nil]; end; f {|a| test_ok(a == [nil])}
+def f; yield [[]]; end; f {|a| test_ok(a == [[]])}
+def f; yield [*[]]; end; f {|a| test_ok(a == [])}
+def f; yield [*[1]]; end; f {|a| test_ok(a == [1])}
+def f; yield [*[1,2]]; end; f {|a| test_ok(a == [1,2])}
+def f; yield *[]; end; f {|a| test_ok(a == nil)}
+def f; yield *[1]; end; f {|a| test_ok(a == 1)}
+def f; yield *[nil]; end; f {|a| test_ok(a == nil)}
+def f; yield *[[]]; end; f {|a| test_ok(a == [])}
+def f; yield *[*[]]; end; f {|a| test_ok(a == nil)}
+def f; yield *[*[1]]; end; f {|a| test_ok(a == 1)}
+def f; yield *[*[1,2]]; end; f {|a| test_ok(a == 1)}
+
+def f; yield; end; f {|a,| test_ok(a == nil)}
+def f; yield nil; end; f {|a,| test_ok(a == nil)}
+def f; yield 1; end; f {|a,| test_ok(a == 1)}
+def f; yield []; end; f {|a,| test_ok(a == nil)}
+def f; yield [1]; end; f {|a,| test_ok(a == 1)}
+def f; yield [nil]; end; f {|a,| test_ok(a == nil)}
+def f; yield [[]]; end; f {|a,| test_ok(a == [])}
+def f; yield [*[]]; end; f {|a,| test_ok(a == nil)}
+def f; yield [*[1]]; end; f {|a,| test_ok(a == 1)}
+def f; yield [*[1,2]]; end; f {|a,| test_ok(a == 1)}
+
+def f; yield *[]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[1]; end; f {|a,| test_ok(a == 1)}
+def f; yield *[nil]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[[]]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[*[]]; end; f {|a,| test_ok(a == nil)}
+def f; yield *[*[1]]; end; f {|a,| test_ok(a == 1)}
+def f; yield *[*[1,2]]; end; f {|a,| test_ok(a == 1)}
+
+def f; yield; end; f {|*a| test_ok(a == [])}
+def f; yield nil; end; f {|*a| test_ok(a == [nil])}
+def f; yield 1; end; f {|*a| test_ok(a == [1])}
+def f; yield []; end; f {|*a| test_ok(a == [[]])}
+def f; yield [1]; end; f {|*a| test_ok(a == [[1]])}
+def f; yield [nil]; end; f {|*a| test_ok(a == [[nil]])}
+def f; yield [[]]; end; f {|*a| test_ok(a == [[[]]])}
+def f; yield [1,2]; end; f {|*a| test_ok(a == [[1,2]])}
+def f; yield [*[]]; end; f {|*a| test_ok(a == [[]])}
+def f; yield [*[1]]; end; f {|*a| test_ok(a == [[1]])}
+def f; yield [*[1,2]]; end; f {|*a| test_ok(a == [[1,2]])}
+
+def f; yield *[]; end; f {|*a| test_ok(a == [])}
+def f; yield *[1]; end; f {|*a| test_ok(a == [1])}
+def f; yield *[nil]; end; f {|*a| test_ok(a == [nil])}
+def f; yield *[[]]; end; f {|*a| test_ok(a == [[]])}
+def f; yield *[*[]]; end; f {|*a| test_ok(a == [])}
+def f; yield *[*[1]]; end; f {|*a| test_ok(a == [1])}
+def f; yield *[*[1,2]]; end; f {|*a| test_ok(a == [1,2])}
+
+def f; yield; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield nil; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield 1; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield []; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield [1]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield [nil]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield [[]]; end; f {|a,b,*c| test_ok([a,b,c] == [[],nil,[]])}
+def f; yield [*[]]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield [*[1]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield [*[1,2]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,2,[]])}
+
+def f; yield *[]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[1]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield *[nil]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[[]]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[*[]]; end; f {|a,b,*c| test_ok([a,b,c] == [nil,nil,[]])}
+def f; yield *[*[1]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,nil,[]])}
+def f; yield *[*[1,2]]; end; f {|a,b,*c| test_ok([a,b,c] == [1,2,[]])}
+
+def r; return; end; a = r(); test_ok(a == nil)
+def r; return nil; end; a = r(); test_ok(a == nil)
+def r; return 1; end; a = r(); test_ok(a == 1)
+def r; return []; end; a = r(); test_ok(a == [])
+def r; return [1]; end; a = r(); test_ok(a == [1])
+def r; return [nil]; end; a = r(); test_ok(a == [nil])
+def r; return [[]]; end; a = r(); test_ok(a == [[]])
+def r; return [*[]]; end; a = r(); test_ok(a == [])
+def r; return [*[1]]; end; a = r(); test_ok(a == [1])
+def r; return [*[1,2]]; end; a = r(); test_ok(a == [1,2])
+
+def r; return *[]; end; a = r(); test_ok(a == [])
+def r; return *[1]; end; a = r(); test_ok(a == [1])
+def r; return *[nil]; end; a = r(); test_ok(a == [nil])
+def r; return *[[]]; end; a = r(); test_ok(a == [[]])
+def r; return *[*[]]; end; a = r(); test_ok(a == [])
+def r; return *[*[1]]; end; a = r(); test_ok(a == [1])
+def r; return *[*[1,2]]; end; a = r(); test_ok(a == [1,2])
+
+def r; return *[[]]; end; a = *r(); test_ok(a == [[]])
+def r; return *[*[1,2]]; end; a = *r(); test_ok(a == [1,2])
+
+def r; return; end; *a = r(); test_ok(a == [nil])
+def r; return nil; end; *a = r(); test_ok(a == [nil])
+def r; return 1; end; *a = r(); test_ok(a == [1])
+def r; return []; end; *a = r(); test_ok(a == [])
+def r; return [1]; end; *a = r(); test_ok(a == [1])
+def r; return [nil]; end; *a = r(); test_ok(a == [nil])
+def r; return [[]]; end; *a = r(); test_ok(a == [[]])
+def r; return [1,2]; end; *a = r(); test_ok(a == [1,2])
+def r; return [*[]]; end; *a = r(); test_ok(a == [])
+def r; return [*[1]]; end; *a = r(); test_ok(a == [1])
+def r; return [*[1,2]]; end; *a = r(); test_ok(a == [1,2])
+
+def r; return *[]; end; *a = r(); test_ok(a == [])
+def r; return *[1]; end; *a = r(); test_ok(a == [1])
+def r; return *[nil]; end; *a = r(); test_ok(a == [nil])
+def r; return *[[]]; end; *a = r(); test_ok(a == [[]])
+def r; return *[1,2]; end; *a = r(); test_ok(a == [1,2])
+def r; return *[*[]]; end; *a = r(); test_ok(a == [])
+def r; return *[*[1]]; end; *a = r(); test_ok(a == [1])
+def r; return *[*[1,2]]; end; *a = r(); test_ok(a == [1,2])
+
+def r; return *[[]]; end; *a = *r(); test_ok(a == [[]])
+def r; return *[1,2]; end; *a = *r(); test_ok(a == [1,2])
+def r; return *[*[1,2]]; end; *a = *r(); test_ok(a == [1,2])
+
+def r; return; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return nil; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return 1; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return []; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return [1]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return [nil]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return [[]]; end; a,b,*c = r(); test_ok([a,b,c] == [[],nil,[]])
+def r; return [1,2]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+def r; return [*[]]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return [*[1]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return [*[1,2]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+
+def r; return *[]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return *[1]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return *[nil]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return *[[]]; end; a,b,*c = r(); test_ok([a,b,c] == [[],nil,[]])
+def r; return *[1,2]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+def r; return *[*[]]; end; a,b,*c = r(); test_ok([a,b,c] == [nil,nil,[]])
+def r; return *[*[1]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,nil,[]])
+def r; return *[*[1,2]]; end; a,b,*c = r(); test_ok([a,b,c] == [1,2,[]])
+
+f = lambda {|r,| test_ok([] == r)}
+f.call([], *[])
+
+f = lambda {|r,*l| test_ok([] == r); test_ok([1] == l)}
+f.call([], *[1])
+
+f = lambda{|x| x}
+test_ok(f.call(42) == 42)
+test_ok(f.call([42]) == [42])
+test_ok(f.call([[42]]) == [[42]])
+test_ok(f.call([42,55]) == [42,55])
+
+f = lambda{|x,| x}
+test_ok(f.call(42) == 42)
+test_ok(f.call([42]) == [42])
+test_ok(f.call([[42]]) == [[42]])
+test_ok(f.call([42,55]) == [42,55])
+
+f = lambda{|*x| x}
+test_ok(f.call(42) == [42])
+test_ok(f.call([42]) == [[42]])
+test_ok(f.call([[42]]) == [[[42]]])
+test_ok(f.call([42,55]) == [[42,55]])
+test_ok(f.call(42,55) == [42,55])
+
+f = lambda { |a, b=42, *c| [a,b,c] }
+test_ok(f.call(1      ) == [1,42,[  ]] )
+test_ok(f.call(1,43   ) == [1,43,[  ]] )
+test_ok(f.call(1,43,44) == [1,43,[44]] )
+
+f = lambda { |a, b=(a|16), *c, &block| [a,b,c,block&&block[]] }
+test_ok(f.call(8      )     == [8,24,[  ],nil] )
+test_ok(f.call(8,43   )     == [8,43,[  ],nil] )
+test_ok(f.call(8,43,44)     == [8,43,[44],nil] )
+test_ok(f.call(8      ){45} == [8,24,[  ],45 ] )
+test_ok(f.call(8,43   ){45} == [8,43,[  ],45 ] )
+test_ok(f.call(8,43,44){45} == [8,43,[44],45 ] )
+
+f = lambda { |a, b=42, *c, d| [a,b,c,d] }
+test_ok(f.call(1      ,99) == [1,42,[  ],99] )
+test_ok(f.call(1,43   ,99) == [1,43,[  ],99] )
+test_ok(f.call(1,43,44,99) == [1,43,[44],99] )
+
+f = lambda { |a, b=(a|16), &block| [a,b,block&&block[]] }
+test_ok(f.call(8   )     == [8,24,nil] )
+test_ok(f.call(8,43)     == [8,43,nil] )
+test_ok(f.call(8,43)     == [8,43,nil] )
+test_ok(f.call(8   ){45} == [8,24,45 ] )
+test_ok(f.call(8,43){45} == [8,43,45 ] )
+test_ok(f.call(8,43){45} == [8,43,45 ] )
+
+f = lambda { |a, b=42, d| [a,b,d] }
+test_ok(f.call(1   ,99) == [1,42,99] )
+test_ok(f.call(1,43,99) == [1,43,99] )
+test_ok(f.call(1,43,99) == [1,43,99] )
+
+f = lambda { |b=42, *c, &block| [b,c,block&&block[]] }
+test_ok(f.call(     )     == [42,[  ],nil] )
+test_ok(f.call(43   )     == [43,[  ],nil] )
+test_ok(f.call(43,44)     == [43,[44],nil] )
+test_ok(f.call(     ){45} == [42,[  ],45 ] )
+test_ok(f.call(43   ){45} == [43,[  ],45 ] )
+test_ok(f.call(43,44){45} == [43,[44],45 ] )
+
+f = lambda { |b=42, *c, d| [b,c,d] }
+test_ok(f.call(      99) == [42,[  ],99] )
+test_ok(f.call(43   ,99) == [43,[  ],99] )
+test_ok(f.call(43,44,99) == [43,[44],99] )
+
+f = lambda { |b=42, &block| [b,block&&block[]] }
+test_ok(f.call(  )     == [42,nil] )
+test_ok(f.call(43)     == [43,nil] )
+test_ok(f.call(43)     == [43,nil] )
+test_ok(f.call(  ){45} == [42,45 ] )
+test_ok(f.call(43){45} == [43,45 ] )
+test_ok(f.call(43){45} == [43,45 ] )
+
+f = lambda { |b=42, d| [b,d] }
+test_ok(f.call(   99) == [42,99] )
+test_ok(f.call(43,99) == [43,99] )
+test_ok(f.call(43,99) == [43,99] )
+
+
+a,=*[1]
+test_ok(a == 1)
+a,=*[[1]]
+test_ok(a == [1])
+a,=*[[[1]]]
+test_ok(a == [[1]])
+
+x, (y, z) = 1, 2, 3
+test_ok([1,2,nil] == [x,y,z])
+x, (y, z) = 1, [2,3]
+test_ok([1,2,3] == [x,y,z])
+x, (y, z) = 1, [2]
+test_ok([1,2,nil] == [x,y,z])
+
+a = loop do break; end; test_ok(a == nil)
+a = loop do break nil; end; test_ok(a == nil)
+a = loop do break 1; end; test_ok(a == 1)
+a = loop do break []; end; test_ok(a == [])
+a = loop do break [1]; end; test_ok(a == [1])
+a = loop do break [nil]; end; test_ok(a == [nil])
+a = loop do break [[]]; end; test_ok(a == [[]])
+a = loop do break [*[]]; end; test_ok(a == [])
+a = loop do break [*[1]]; end; test_ok(a == [1])
+a = loop do break [*[1,2]]; end; test_ok(a == [1,2])
+
+a = loop do break *[]; end; test_ok(a == [])
+a = loop do break *[1]; end; test_ok(a == [1])
+a = loop do break *[nil]; end; test_ok(a == [nil])
+a = loop do break *[[]]; end; test_ok(a == [[]])
+a = loop do break *[*[]]; end; test_ok(a == [])
+a = loop do break *[*[1]]; end; test_ok(a == [1])
+a = loop do break *[*[1,2]]; end; test_ok(a == [1,2])
+
+*a = loop do break; end; test_ok(a == [nil])
+*a = loop do break nil; end; test_ok(a == [nil])
+*a = loop do break 1; end; test_ok(a == [1])
+*a = loop do break []; end; test_ok(a == [])
+*a = loop do break [1]; end; test_ok(a == [1])
+*a = loop do break [nil]; end; test_ok(a == [nil])
+*a = loop do break [[]]; end; test_ok(a == [[]])
+*a = loop do break [1,2]; end; test_ok(a == [1,2])
+*a = loop do break [*[]]; end; test_ok(a == [])
+*a = loop do break [*[1]]; end; test_ok(a == [1])
+*a = loop do break [*[1,2]]; end; test_ok(a == [1,2])
+
+*a = loop do break *[]; end; test_ok(a == [])
+*a = loop do break *[1]; end; test_ok(a == [1])
+*a = loop do break *[nil]; end; test_ok(a == [nil])
+*a = loop do break *[[]]; end; test_ok(a == [[]])
+*a = loop do break *[1,2]; end; test_ok(a == [1,2])
+*a = loop do break *[*[]]; end; test_ok(a == [])
+*a = loop do break *[*[1]]; end; test_ok(a == [1])
+*a = loop do break *[*[1,2]]; end; test_ok(a == [1,2])
+
+*a = *loop do break *[[]]; end; test_ok(a == [[]])
+*a = *loop do break *[1,2]; end; test_ok(a == [1,2])
+*a = *loop do break *[*[1,2]]; end; test_ok(a == [1,2])
+
+a,b,*c = loop do break; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break nil; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break 1; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break []; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break [1]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break [nil]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break [[]]; end; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = loop do break [1,2]; end; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = loop do break [*[]]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break [*[1]]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break [*[1,2]]; end; test_ok([a,b,c] == [1,2,[]])
+
+a,b,*c = loop do break *[]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break *[1]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break *[nil]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break *[[]]; end; test_ok([a,b,c] == [[],nil,[]])
+a,b,*c = loop do break *[1,2]; end; test_ok([a,b,c] == [1,2,[]])
+a,b,*c = loop do break *[*[]]; end; test_ok([a,b,c] == [nil,nil,[]])
+a,b,*c = loop do break *[*[1]]; end; test_ok([a,b,c] == [1,nil,[]])
+a,b,*c = loop do break *[*[1,2]]; end; test_ok([a,b,c] == [1,2,[]])
+
+def r(val); a = yield(); test_ok(a == val, 2); end
+r(nil){next}
+r(nil){next nil}
+r(1){next 1}
+r([]){next []}
+r([1]){next [1]}
+r([nil]){next [nil]}
+r([[]]){next [[]]}
+r([]){next [*[]]}
+r([1]){next [*[1]]}
+r([1,2]){next [*[1,2]]}
+
+r([]){next *[]}
+r([1]){next *[1]}
+r([nil]){next *[nil]}
+r([[]]){next *[[]]}
+r([]){next *[*[]]}
+r([1]){next *[*[1]]}
+r([1,2]){next *[*[1,2]]}
+
+def r(val); *a = yield(); test_ok(a == val, 2); end
+r([nil]){next}
+r([nil]){next nil}
+r([1]){next 1}
+r([]){next []}
+r([1]){next [1]}
+r([nil]){next [nil]}
+r([[]]){next [[]]}
+r([1,2]){next [1,2]}
+r([]){next [*[]]}
+r([1]){next [*[1]]}
+r([1,2]){next [*[1,2]]}
+
+def r(val); *a = *yield(); test_ok(a == val, 2); end
+r([[]]){next *[[]]}
+r([1,2]){next *[1,2]}
+r([1,2]){next *[*[1,2]]}
+
+def r(val); a,b,*c = yield(); test_ok([a,b,c] == val, 2); end
+r([nil,nil,[]]){next}
+r([nil,nil,[]]){next nil}
+r([1,nil,[]]){next 1}
+r([nil,nil,[]]){next []}
+r([1,nil,[]]){next [1]}
+r([nil,nil,[]]){next [nil]}
+r([[],nil,[]]){next [[]]}
+r([1,2,[]]){next [1,2]}
+r([nil,nil,[]]){next [*[]]}
+r([1,nil,[]]){next [*[1]]}
+r([1,2,[]]){next [*[1,2]]}
+
+def r(val); a,b,*c = *yield(); test_ok([a,b,c] == val, 2); end
+r([[],nil,[]]){next *[[]]}
+r([1,2,[]]){next *[1,2]}
+r([1,2,[]]){next *[*[1,2]]}
+
+test_check "condition"
+
+$x = '0';
+
+$x == $x && test_ok(true)
+$x != $x && test_ok(false)
+$x == $x || test_ok(false)
+$x != $x || test_ok(true)
+
+# first test to see if we can run the tests.
+
+test_check "if/unless";
+
+$x = 'test';
+test_ok(if $x == $x then true else false end)
+$bad = false
+unless $x == $x
+  $bad = true
+end
+test_ok(!$bad)
+test_ok(unless $x != $x then true else false end)
+
+test_check "case"
+
+case 5
+when 1, 2, 3, 4, 6, 7, 8
+  test_ok(false)
+when 5
+  test_ok(true)
+end
+
+case 5
+when 5
+  test_ok(true)
+when 1..10
+  test_ok(false)
+end
+
+case 5
+when 1..10
+  test_ok(true)
+else
+  test_ok(false)
+end
+
+case 5
+when 5
+  test_ok(true)
+else
+  test_ok(false)
+end
+
+case "foobar"
+when /^f.*r$/
+  test_ok(true)
+else
+  test_ok(false)
+end
+
+test_check "while/until";
+
+while_tmp = "while_tmp.#{$$}"
+tmp = open(while_tmp, "w")
+tmp.print "tvi925\n";
+tmp.print "tvi920\n";
+tmp.print "vt100\n";
+tmp.print "Amiga\n";
+tmp.print "paper\n";
+tmp.close
+
+# test break
+
+tmp = open(while_tmp, "r")
+test_ok(tmp.kind_of?(File))
+
+while line = tmp.gets()
+  break if /vt100/ =~ line
+end
+
+test_ok(!tmp.eof? && /vt100/ =~ line)
+tmp.close
+
+# test next
+$bad = false
+tmp = open(while_tmp, "r")
+while line = tmp.gets()
+  next if /vt100/ =~ line
+  $bad = 1 if /vt100/ =~ line
+end
+test_ok(!(!tmp.eof? || /vt100/ =~ line || $bad))
+tmp.close
+
+# test redo
+$bad = false
+tmp = open(while_tmp, "r")
+while line = tmp.gets()
+  lastline = line
+  line = line.gsub(/vt100/, 'VT100')
+  if lastline != line
+    line.gsub!('VT100', 'Vt100')
+    redo
+  end
+  $bad = 1 if /vt100/ =~ line
+  $bad = 1 if /VT100/ =~ line
+end
+test_ok(tmp.eof? && !$bad)
+tmp.close
+
+sum=0
+for i in 1..10
+  sum += i
+  i -= 1
+  if i > 0
+    redo
+  end
+end
+test_ok(sum == 220)
+
+# test interval
+$bad = false
+tmp = open(while_tmp, "r")
+while line = tmp.gets()
+  break if 3
+  case line
+  when /vt100/, /Amiga/, /paper/
+    $bad = true
+  end
+end
+test_ok(!$bad)
+tmp.close
+
+File.unlink while_tmp or `/bin/rm -f "#{while_tmp}"`
+test_ok(!File.exist?(while_tmp))
+
+i = 0
+until i>4
+  i+=1
+end
+test_ok(i>4)
+
+
+# exception handling
+test_check "exception";
+
+begin
+  raise "this must be handled"
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+$bad = true
+begin
+  raise "this must be handled no.2"
+rescue
+  if $bad
+    $bad = false
+    retry
+    test_ok(false)
+  end
+end
+test_ok(true)
+
+# exception in rescue clause
+$string = "this must be handled no.3"
+begin
+  begin
+    raise "exception in rescue clause"
+  rescue
+    raise $string
+  end
+  test_ok(false)
+rescue => e
+  test_ok($! == e)
+  test_ok(e.message == $string)
+  test_ok(e != $string)
+end
+
+# exception in ensure clause
+begin
+  begin
+    raise "this must be handled no.4"
+  ensure
+    raise "exception in ensure clause"
+  end
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+$bad = true
+begin
+  begin
+    raise "this must be handled no.5"
+  ensure
+    $bad = false
+  end
+rescue
+end
+test_ok(!$bad)
+
+$bad = true
+begin
+  begin
+    raise "this must be handled no.6"
+  ensure
+    $bad = false
+  end
+rescue
+end
+test_ok(!$bad)
+
+$bad = true
+while true
+  begin
+    break
+  ensure
+    $bad = false
+  end
+end
+test_ok(!$bad)
+
+test_ok(catch(:foo) {
+     loop do
+       loop do
+	 throw :foo, true
+	 break
+       end
+       break
+       test_ok(false)			# should not reach here
+     end
+     false
+   })
+
+test_check "array"
+test_ok([1, 2] + [3, 4] == [1, 2, 3, 4])
+test_ok([1, 2] * 2 == [1, 2, 1, 2])
+test_ok([1, 2] * ":" == "1:2")
+
+test_ok([1, 2].hash == [1, 2].hash)
+
+test_ok([1,2,3] & [2,3,4] == [2,3])
+test_ok([1,2,3] | [2,3,4] == [1,2,3,4])
+test_ok([1,2,3] - [2,3] == [1])
+
+$x = [0, 1, 2, 3, 4, 5]
+test_ok($x[2] == 2)
+test_ok($x[1..3] == [1, 2, 3])
+test_ok($x[1,3] == [1, 2, 3])
+
+$x[0, 2] = 10
+test_ok($x[0] == 10 && $x[1] == 2)
+
+$x[0, 0] = -1
+test_ok($x[0] == -1 && $x[1] == 10)
+
+$x[-1, 1] = 20
+test_ok($x[-1] == 20 && $x.pop == 20)
+
+# array and/or
+test_ok(([1,2,3]&[2,4,6]) == [2])
+test_ok(([1,2,3]|[2,4,6]) == [1,2,3,4,6])
+
+# compact
+$x = [nil, 1, nil, nil, 5, nil, nil]
+$x.compact!
+test_ok($x == [1, 5])
+
+# uniq
+$x = [1, 1, 4, 2, 5, 4, 5, 1, 2]
+$x.uniq!
+test_ok($x == [1, 4, 2, 5])
+
+# empty?
+test_ok(!$x.empty?)
+$x = []
+test_ok($x.empty?)
+
+# sort
+$x = ["it", "came", "to", "pass", "that", "..."]
+$x = $x.sort.join(" ")
+test_ok($x == "... came it pass that to")
+$x = [2,5,3,1,7]
+$x.sort!{|a,b| a<=>b}		# sort with condition
+test_ok($x == [1,2,3,5,7])
+$x.sort!{|a,b| b-a}		# reverse sort
+test_ok($x == [7,5,3,2,1])
+
+# split test
+$x = "The Book of Mormon"
+test_ok($x.split(//).reverse!.join == $x.reverse)
+test_ok($x.reverse == $x.reverse!)
+test_ok("1 byte string".split(//).reverse.join(":") == "g:n:i:r:t:s: :e:t:y:b: :1")
+$x = "a b c  d"
+test_ok($x.split == ['a', 'b', 'c', 'd'])
+test_ok($x.split(' ') == ['a', 'b', 'c', 'd'])
+test_ok(defined? "a".chomp)
+test_ok("abc".scan(/./) == ["a", "b", "c"])
+test_ok("1a2b3c".scan(/(\d.)/) == [["1a"], ["2b"], ["3c"]])
+# non-greedy match
+test_ok("a=12;b=22".scan(/(.*?)=(\d*);?/) == [["a", "12"], ["b", "22"]])
+
+$x = [1]
+test_ok(($x * 5).join(":") == '1:1:1:1:1')
+test_ok(($x * 1).join(":") == '1')
+test_ok(($x * 0).join(":") == '')
+
+*$x = *(1..7).to_a
+test_ok($x.size == 7)
+test_ok($x == [1, 2, 3, 4, 5, 6, 7])
+
+$x = [1,2,3]
+$x[1,0] = $x
+test_ok($x == [1,1,2,3,2,3])
+
+$x = [1,2,3]
+$x[-1,0] = $x
+test_ok($x == [1,2,1,2,3,3])
+
+$x = [1,2,3]
+$x.concat($x)
+test_ok($x == [1,2,3,1,2,3])
+
+test_check "hash"
+$x = {1=>2, 2=>4, 3=>6}
+
+test_ok($x[1] == 2)
+
+test_ok(begin
+     for k,v in $x
+       raise if k*2 != v
+     end
+     true
+   rescue
+     false
+   end)
+
+test_ok($x.length == 3)
+test_ok($x.has_key?(1))
+test_ok($x.has_value?(4))
+test_ok($x.values_at(2,3) == [4,6])
+test_ok($x == {1=>2, 2=>4, 3=>6})
+
+$z = $x.keys.sort.join(":")
+test_ok($z == "1:2:3")
+
+$z = $x.values.sort.join(":")
+test_ok($z == "2:4:6")
+test_ok($x == $x)
+
+$x.shift
+test_ok($x.length == 2)
+
+$z = [1,2]
+$x[$z] = 256
+test_ok($x[$z] == 256)
+
+$x = Hash.new(0)
+$x[1] = 1
+test_ok($x[1] == 1)
+test_ok($x[2] == 0)
+
+$x = Hash.new([])
+test_ok($x[22] == [])
+test_ok($x[22].equal?($x[22]))
+
+$x = Hash.new{[]}
+test_ok($x[22] == [])
+test_ok(!$x[22].equal?($x[22]))
+
+$x = Hash.new{|h,k| $z = k; h[k] = k*2}
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 22)
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 0)
+$x.default = 5
+test_ok($x[23] == 5)
+
+$x = Hash.new
+def $x.default(k)
+  $z = k
+  self[k] = k*2
+end
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 22)
+$z = 0
+test_ok($x[22] == 44)
+test_ok($z == 0)
+
+test_check "iterator"
+
+# yield at top level
+test_ok(!defined?(yield))
+
+$x = [1, 2, 3, 4]
+$y = []
+
+# iterator over array
+for i in $x
+  $y.push i
+end
+test_ok($x == $y)
+
+# nested iterator
+def tt
+  1.upto(10) {|i|
+    yield i
+  }
+end
+
+i=0
+tt{|i| break if i == 5}
+test_ok(i == 0)
+
+def tt2(dummy)
+  yield 1
+end
+
+def tt3(&block)
+  tt2(raise(ArgumentError,""),&block)
+end
+
+$x = false
+begin
+  tt3{}
+rescue ArgumentError
+  $x = true
+rescue Exception
+end
+test_ok($x)
+
+def tt4 &block
+  tt2(raise(ArgumentError,""),&block)
+end
+$x = false
+begin
+  tt4{}
+rescue ArgumentError
+  $x = true
+rescue Exception
+end
+test_ok($x)
+
+# iterator break/redo/next/retry
+done = true
+loop{
+  break
+  done = false			# should not reach here
+}
+test_ok(done)
+
+done = false
+$bad = false
+loop {
+  break if done
+  done = true
+  next
+  $bad = true			# should not reach here
+}
+test_ok(!$bad)
+
+done = false
+$bad = false
+loop {
+  break if done
+  done = true
+  redo
+  $bad = true			# should not reach here
+}
+test_ok(!$bad)
+
+$x = []
+for i in 1 .. 7
+  $x.push i
+end
+test_ok($x.size == 7)
+test_ok($x == [1, 2, 3, 4, 5, 6, 7])
+
+# append method to built-in class
+class Array
+  def iter_test1
+    collect{|e| [e, yield(e)]}.sort{|a,b|a[1]<=>b[1]}
+  end
+  def iter_test2
+    a = collect{|e| [e, yield(e)]}
+    a.sort{|a,b|a[1]<=>b[1]}
+  end
+end
+$x = [[1,2],[3,4],[5,6]]
+test_ok($x.iter_test1{|x|x} == $x.iter_test2{|x|x})
+
+class IterTest
+  def initialize(e); @body = e; end
+
+  def each0(&block); @body.each(&block); end
+  def each1(&block); @body.each {|*x| block.call(*x) } end
+  def each2(&block); @body.each {|*x| block.call(x) } end
+  def each3(&block); @body.each {|x| block.call(*x) } end
+  def each4(&block); @body.each {|x| block.call(x) } end
+  def each5; @body.each {|*x| yield(*x) } end
+  def each6; @body.each {|*x| yield(x) } end
+  def each7; @body.each {|x| yield(*x) } end
+  def each8; @body.each {|x| yield(x) } end
+
+  def f(a)
+    a
+  end
+end
+test_ok(IterTest.new(nil).method(:f).to_proc.call([1]) == [1])
+m = /\w+/.match("abc")
+test_ok(IterTest.new(nil).method(:f).to_proc.call([m]) == [m])
+
+IterTest.new([0]).each0 {|x| test_ok(x == 0)}
+IterTest.new([1]).each1 {|x| test_ok(x == 1)}
+IterTest.new([2]).each2 {|x| test_ok(x == [2])}
+#IterTest.new([3]).each3 {|x| test_ok(x == 3)}
+IterTest.new([4]).each4 {|x| test_ok(x == 4)}
+IterTest.new([5]).each5 {|x| test_ok(x == 5)}
+IterTest.new([6]).each6 {|x| test_ok(x == [6])}
+#IterTest.new([7]).each7 {|x| test_ok(x == 7)}
+IterTest.new([8]).each8 {|x| test_ok(x == 8)}
+
+IterTest.new([[0]]).each0 {|x| test_ok(x == [0])}
+IterTest.new([[1]]).each1 {|x| test_ok(x == [1])}
+IterTest.new([[2]]).each2 {|x| test_ok(x == [[2]])}
+IterTest.new([[3]]).each3 {|x| test_ok(x == 3)}
+IterTest.new([[4]]).each4 {|x| test_ok(x == [4])}
+IterTest.new([[5]]).each5 {|x| test_ok(x == [5])}
+IterTest.new([[6]]).each6 {|x| test_ok(x == [[6]])}
+IterTest.new([[7]]).each7 {|x| test_ok(x == 7)}
+IterTest.new([[8]]).each8 {|x| test_ok(x == [8])}
+
+IterTest.new([[0,0]]).each0 {|*x| test_ok(x == [[0,0]])}
+IterTest.new([[8,8]]).each8 {|*x| test_ok(x == [[8,8]])}
+
+def m0(v)
+  v
+end
+
+def m1
+  m0(block_given?)
+end
+test_ok(m1{p 'test'})
+test_ok(!m1)
+
+def m
+  m0(block_given?,&Proc.new{})
+end
+test_ok(m1{p 'test'})
+test_ok(!m1)
+
+class C
+  include Enumerable
+  def initialize
+    @a = [1,2,3]
+  end
+  def each(&block)
+    @a.each(&block)
+  end
+end
+
+test_ok(C.new.collect{|n| n} == [1,2,3])
+
+test_ok(Proc == lambda{}.class)
+test_ok(Proc == Proc.new{}.class)
+lambda{|a|test_ok(a==1)}.call(1)
+def block_test(klass, &block)
+  test_ok(klass === block)
+end
+
+block_test(NilClass)
+block_test(Proc){}
+
+def call_argument_test(state, proc, *args)
+  x = state
+  begin
+    proc.call(*args)
+  rescue ArgumentError
+    x = !x
+  end
+  test_ok(x,2)
+end
+
+call_argument_test(true, lambda{||})
+call_argument_test(false, lambda{||}, 1)
+call_argument_test(true, lambda{|a,|}, 1)
+call_argument_test(false, lambda{|a,|})
+call_argument_test(false, lambda{|a,|}, 1,2)
+
+call_argument_test(true, Proc.new{||})
+call_argument_test(true, Proc.new{||}, 1)
+call_argument_test(true, Proc.new{|a,|}, 1)
+call_argument_test(true, Proc.new{|a,|})
+call_argument_test(true, Proc.new{|a,|}, 1,2)
+
+def block_get(&block)
+  block
+end
+
+test_ok(Proc == block_get{}.class)
+call_argument_test(true, block_get{||})
+call_argument_test(true, block_get{||}, 1)
+call_argument_test(true, block_get{|a,|}, 1)
+call_argument_test(true, block_get{|a,|})
+call_argument_test(true, block_get{|a,|}, 1,2)
+
+call_argument_test(true, block_get(&lambda{||}))
+call_argument_test(false, block_get(&lambda{||}),1)
+call_argument_test(true, block_get(&lambda{|a,|}),1)
+call_argument_test(false, block_get(&lambda{|a,|}),1,2)
+
+blk = block_get{11}
+test_ok(blk.class == Proc)
+test_ok(blk.to_proc.class == Proc)
+test_ok(blk.clone.call == 11)
+test_ok(block_get(&blk).class == Proc)
+
+lmd = lambda{44}
+test_ok(lmd.class == Proc)
+test_ok(lmd.to_proc.class == Proc)
+test_ok(lmd.clone.call == 44)
+test_ok(block_get(&lmd).class == Proc)
+
+test_ok(Proc.new{|a,| a}.yield(1,2,3) == 1)
+call_argument_test(true, Proc.new{|a,|}, 1,2)
+
+test_ok(Proc.new{|&b| b.call(10)}.call {|x| x} == 10)
+test_ok(Proc.new{|a,&b| b.call(a)}.call(12) {|x| x} == 12)
+
+def test_return1
+  Proc.new {
+    return 55
+  }.yield + 5
+end
+test_ok(test_return1() == 55)
+def test_return2
+  lambda {
+    return 55
+  }.call + 5
+end
+test_ok(test_return2() == 60)
+
+def proc_call(&b)
+  b.call
+end
+def proc_yield()
+  yield
+end
+def proc_return1
+  lambda{return 42}.call+1
+end
+test_ok(proc_return1() == 43)
+def proc_return2
+  ->{return 42}.call+1
+end
+test_ok(proc_return2() == 43)
+def proc_return3
+  proc_call{return 42}+1
+end
+test_ok(proc_return3() == 42)
+def proc_return4
+  proc_yield{return 42}+1
+end
+test_ok(proc_return4() == 42)
+
+def ljump_test(state, proc, *args)
+  x = state
+  begin
+    proc.call(*args)
+  rescue LocalJumpError
+    x = !x
+  end
+  test_ok(x,2)
+end
+
+ljump_test(false, block_get{break})
+ljump_test(true, lambda{break})
+
+def exit_value_test(&block)
+  block.call
+rescue LocalJumpError
+  $!.exit_value
+end
+
+test_ok(45 == exit_value_test{break 45})
+
+test_ok(55 == begin
+              block_get{break 55}.call
+            rescue LocalJumpError
+              $!.exit_value
+            end)
+
+def block_call(&block)
+  block.call
+end
+
+def test_b1
+  block_call{break 11}
+end
+test_ok(test_b1() == 11)
+
+def ljump_rescue(r)
+  begin
+    yield
+  rescue LocalJumpError => e
+    r if /from proc-closure/ =~ e.message
+  end
+end
+
+def test_b2
+  ljump_rescue(22) do
+    block_get{break 21}.call
+  end
+end
+test_ok(test_b2() == 22)
+
+def test_b3
+  ljump_rescue(33) do
+    Proc.new{break 31}.yield
+  end
+end
+test_ok(test_b3() == 33)
+
+def test_b4
+  lambda{break 44}.call
+end
+test_ok(test_b4() == 44)
+
+def test_b5
+  ljump_rescue(55) do
+    b = block_get{break 54}
+    block_call(&b)
+  end
+end
+test_ok(test_b5() == 55)
+
+def test_b6
+  b = lambda{break 67}
+  block_call(&b)
+  66
+end
+test_ok(test_b6() == 66)
+
+def util_r7
+  block_get{break 78}
+end
+
+def test_b7
+  b = util_r7()
+  ljump_rescue(77) do
+    block_call(&b)
+  end
+end
+test_ok(test_b7() == 77)
+
+def util_b8(&block)
+  block_call(&block)
+end
+
+def test_b8
+  util_b8{break 88}
+end
+test_ok(test_b8() == 88)
+
+def util_b9(&block)
+  lambda{block.call; 98}.call
+end
+
+def test_b9
+  util_b9{break 99}
+end
+test_ok(test_b9() == 99)
+
+def util_b10
+  util_b9{break 100}
+end
+
+def test_b10
+  util_b10()
+end
+test_ok(test_b10() == 100)
+
+def test_b11
+  ljump_rescue(111) do
+    loop do
+      Proc.new{break 110}.yield
+      break 112
+    end
+  end
+end
+test_ok(test_b11() == 111)
+
+def test_b12
+  loop do
+    break lambda{break 122}.call
+    break 121
+  end
+end
+test_ok(test_b12() == 122)
+
+def test_b13
+  ljump_rescue(133) do
+    while true
+      Proc.new{break 130}.yield
+      break 131
+    end
+  end
+end
+test_ok(test_b13() == 133)
+
+def test_b14
+  while true
+    break lambda{break 144}.call
+    break 143
+  end
+end
+test_ok(test_b14() == 144)
+
+def test_b15
+  [0].each {|c| yield 1 }
+  156
+end
+test_ok(test_b15{|e| break 155 } == 155)
+
+def marity_test(m)
+  method = method(m)
+  test_ok(method.arity == method.to_proc.arity, 2)
+end
+marity_test(:test_ok)
+marity_test(:marity_test)
+marity_test(:p)
+
+class ITER_TEST1
+   def a
+     block_given?
+   end
+end
+
+class ITER_TEST2 < ITER_TEST1
+   def a
+     test_ok(super)
+     super
+   end
+end
+test_ok(ITER_TEST2.new.a {})
+
+class ITER_TEST3
+  def foo x
+    return yield if block_given?
+    x
+  end
+end
+
+class ITER_TEST4 < ITER_TEST3
+  def foo x
+    test_ok(super == yield)
+    test_ok(super(x, &nil) == x)
+  end
+end
+
+ITER_TEST4.new.foo(44){55}
+
+class ITER_TEST5
+   def tt(aa)
+     aa
+   end
+
+   def uu(a)
+      class << self
+         define_method(:tt) do |sym|
+            super(sym)
+         end
+      end
+   end
+
+   def xx(*x)
+     x.size
+   end
+end
+
+a = ITER_TEST5.new
+a.uu(12)
+test_ok(a.tt(1) == 1)
+
+class ITER_TEST6 < ITER_TEST5
+   def xx(*a)
+      a << 12
+      super
+   end
+end
+
+test_ok(ITER_TEST6.new.xx([24]) == 2)
+
+test_check "float"
+test_ok(2.6.floor == 2)
+test_ok((-2.6).floor == -3)
+test_ok(2.6.ceil == 3)
+test_ok((-2.6).ceil == -2)
+test_ok(2.6.truncate == 2)
+test_ok((-2.6).truncate == -2)
+test_ok(2.6.round == 3)
+test_ok((-2.4).truncate == -2)
+test_ok((13.4 % 1 - 0.4).abs < 0.0001)
+nan = 0.0/0
+def nan_test(x,y)
+  test_ok(x != y)
+  test_ok((x < y) == false)
+  test_ok((x > y) == false)
+  test_ok((x <= y) == false)
+  test_ok((x >= y) == false)
+end
+nan_test(nan, nan)
+nan_test(nan, 0)
+nan_test(nan, 1)
+nan_test(nan, -1)
+nan_test(nan, 1000)
+nan_test(nan, -1000)
+nan_test(nan, 1_000_000_000_000)
+nan_test(nan, -1_000_000_000_000)
+nan_test(nan, 100.0);
+nan_test(nan, -100.0);
+nan_test(nan, 0.001);
+nan_test(nan, -0.001);
+nan_test(nan, 1.0/0);
+nan_test(nan, -1.0/0);
+
+#s = "3.7517675036461267e+17"
+#test_ok(s == sprintf("%.16e", s.to_f))
+f = 3.7517675036461267e+17
+test_ok(f == sprintf("%.16e", f).to_f)
+
+
+test_check "bignum"
+def fact(n)
+  return 1 if n == 0
+  f = 1
+  while n>0
+    f *= n
+    n -= 1
+  end
+  return f
+end
+$x = fact(40)
+test_ok($x == $x)
+test_ok($x == fact(40))
+test_ok($x < $x+2)
+test_ok($x > $x-2)
+test_ok($x == 815915283247897734345611269596115894272000000000)
+test_ok($x != 815915283247897734345611269596115894272000000001)
+test_ok($x+1 == 815915283247897734345611269596115894272000000001)
+test_ok($x/fact(20) == 335367096786357081410764800000)
+$x = -$x
+test_ok($x == -815915283247897734345611269596115894272000000000)
+test_ok(2-(2**32) == -(2**32-2))
+test_ok(2**32 - 5 == (2**32-3)-2)
+
+$good = true;
+for i in 1000..1014
+  $good = false if ((1 << i) != (2**i))
+end
+test_ok($good)
+
+$good = true;
+n1= 1 << 1000
+for i in 1000..1014
+  $good = false if ((1 << i) != n1)
+  n1 *= 2
+end
+test_ok($good)
+
+$good = true;
+n2=n1
+for i in 1..10
+  n1 = n1 / 2
+  n2 = n2 >> 1
+  $good = false if (n1 != n2)
+end
+test_ok($good)
+
+$good = true;
+for i in 4000..4096
+  n1 = 1 << i;
+  if (n1**2-1) / (n1+1) != (n1-1)
+    $good = false
+  end
+end
+test_ok($good)
+
+b = 10**80
+a = b * 9 + 7
+test_ok(7 == a.modulo(b))
+test_ok(-b + 7 == a.modulo(-b))
+test_ok(b + -7 == (-a).modulo(b))
+test_ok(-7 == (-a).modulo(-b))
+test_ok(7 == a.remainder(b))
+test_ok(7 == a.remainder(-b))
+test_ok(-7 == (-a).remainder(b))
+test_ok(-7 == (-a).remainder(-b))
+
+test_ok(10**40+10**20 == 10000000000000000000100000000000000000000)
+test_ok(10**40/10**20 == 100000000000000000000)
+
+a = 677330545177305025495135714080
+b = 14269972710765292560
+test_ok(a % b == 0)
+test_ok(-a % b == 0)
+
+def shift_test(a)
+  b = a / (2 ** 32)
+  c = a >> 32
+  test_ok(b == c)
+
+  b = a * (2 ** 32)
+  c = a << 32
+  test_ok(b == c)
+end
+
+shift_test(-4518325415524767873)
+shift_test(-0xfffffffffffffffff)
+
+test_check "string & char"
+
+test_ok("abcd" == "abcd")
+test_ok("abcd" =~ /abcd/)
+test_ok("abcd" === "abcd")
+# compile time string concatenation
+test_ok("ab" "cd" == "abcd")
+test_ok("#{22}aa" "cd#{44}" == "22aacd44")
+test_ok("#{22}aa" "cd#{44}" "55" "#{66}" == "22aacd445566")
+test_ok("abc" !~ /^$/)
+test_ok("abc\n" !~ /^$/)
+test_ok("abc" !~ /^d*$/)
+test_ok(("abc" =~ /d*$/) == 3)
+test_ok("" =~ /^$/)
+test_ok("\n" =~ /^$/)
+test_ok("a\n\n" =~ /^$/)
+test_ok("abcabc" =~ /.*a/ && $& == "abca")
+test_ok("abcabc" =~ /.*c/ && $& == "abcabc")
+test_ok("abcabc" =~ /.*?a/ && $& == "a")
+test_ok("abcabc" =~ /.*?c/ && $& == "abc")
+test_ok(/(.|\n)*?\n(b|\n)/ =~ "a\nb\n\n" && $& == "a\nb")
+
+test_ok(/^(ab+)+b/ =~ "ababb" && $& == "ababb")
+test_ok(/^(?:ab+)+b/ =~ "ababb" && $& == "ababb")
+test_ok(/^(ab+)+/ =~ "ababb" && $& == "ababb")
+test_ok(/^(?:ab+)+/ =~ "ababb" && $& == "ababb")
+
+test_ok(/(\s+\d+){2}/ =~ " 1 2" && $& == " 1 2")
+test_ok(/(?:\s+\d+){2}/ =~ " 1 2" && $& == " 1 2")
+
+$x = <<END;
+ABCD
+ABCD
+END
+$x.gsub!(/((.|\n)*?)B((.|\n)*?)D/, '\1\3')
+test_ok($x == "AC\nAC\n")
+
+test_ok("foobar" =~ /foo(?=(bar)|(baz))/)
+test_ok("foobaz" =~ /foo(?=(bar)|(baz))/)
+
+$foo = "abc"
+test_ok("#$foo = abc" == "abc = abc")
+test_ok("#{$foo} = abc" == "abc = abc")
+
+foo = "abc"
+test_ok("#{foo} = abc" == "abc = abc")
+
+test_ok('-' * 5 == '-----')
+test_ok('-' * 1 == '-')
+test_ok('-' * 0 == '')
+
+foo = '-'
+test_ok(foo * 5 == '-----')
+test_ok(foo * 1 == '-')
+test_ok(foo * 0 == '')
+
+$x = "a.gif"
+test_ok($x.sub(/.*\.([^\.]+)$/, '\1') == "gif")
+test_ok($x.sub(/.*\.([^\.]+)$/, 'b.\1') == "b.gif")
+test_ok($x.sub(/.*\.([^\.]+)$/, '\2') == "")
+test_ok($x.sub(/.*\.([^\.]+)$/, 'a\2b') == "ab")
+test_ok($x.sub(/.*\.([^\.]+)$/, '<\&>') == "<a.gif>")
+
+# character constants(assumes ASCII)
+test_ok("a"[0] == ?a)
+test_ok(?a == ?a)
+test_ok(?\C-a == "\1")
+test_ok(?\M-a == "\341")
+test_ok(?\M-\C-a == "\201")
+test_ok("a".upcase![0] == ?A)
+test_ok("A".downcase![0] == ?a)
+test_ok("abc".tr!("a-z", "A-Z") == "ABC")
+test_ok("aabbcccc".tr_s!("a-z", "A-Z") == "ABC")
+test_ok("abcc".squeeze!("a-z") == "abc")
+test_ok("abcd".delete!("bc") == "ad")
+
+$x = "abcdef"
+$y = [ ?a, ?b, ?c, ?d, ?e, ?f ]
+$bad = false
+$x.each_byte {|i|
+  if i.chr != $y.shift
+    $bad = true
+    break
+  end
+}
+test_ok(!$bad)
+
+s = "a string"
+s[0..s.size]="another string"
+test_ok(s == "another string")
+
+s = <<EOS
+#{
+[1,2,3].join(",")
+}
+EOS
+test_ok(s == "1,2,3\n")
+test_ok("Just".to_i(36) == 926381)
+test_ok("-another".to_i(36) == -23200231779)
+test_ok(1299022.to_s(36) == "ruby")
+test_ok(-1045307475.to_s(36) == "-hacker")
+test_ok("Just_another_Ruby_hacker".to_i(36) == 265419172580680477752431643787347)
+test_ok(-265419172580680477752431643787347.to_s(36) == "-justanotherrubyhacker")
+
+a = []
+(0..255).each {|n|
+  ch = [n].pack("C")
+  a.push ch if /a#{Regexp.quote ch}b/x =~ "ab"
+}
+test_ok(a.size == 0)
+
+test_check "assignment"
+a = nil
+test_ok(defined?(a))
+test_ok(a == nil)
+
+# multiple assignment
+a, b = 1, 2
+test_ok(a == 1 && b == 2)
+
+a, b = b, a
+test_ok(a == 2 && b == 1)
+
+a, = 1,2
+test_ok(a == 1)
+
+a, *b = 1, 2, 3
+test_ok(a == 1 && b == [2, 3])
+
+a, (b, c), d = 1, [2, 3], 4
+test_ok(a == 1 && b == 2 && c == 3 && d == 4)
+
+*a = 1, 2, 3
+test_ok(a == [1, 2, 3])
+
+*a = 4
+test_ok(a == [4])
+
+*a = nil
+test_ok(a == [nil])
+
+test_check "call"
+def aaa(a, b=100, *rest)
+  res = [a, b]
+  res += rest if rest
+  return res
+end
+
+# not enough argument
+begin
+  aaa()				# need at least 1 arg
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+begin
+  aaa				# no arg given (exception raised)
+  test_ok(false)
+rescue
+  test_ok(true)
+end
+
+test_ok(aaa(1) == [1, 100])
+test_ok(aaa(1, 2) == [1, 2])
+test_ok(aaa(1, 2, 3, 4) == [1, 2, 3, 4])
+test_ok(aaa(1, *[2, 3, 4]) == [1, 2, 3, 4])
+
+test_check "proc"
+$proc = Proc.new{|i| i}
+test_ok($proc.call(2) == 2)
+test_ok($proc.call(3) == 3)
+
+$proc = Proc.new{|i| i*2}
+test_ok($proc.call(2) == 4)
+test_ok($proc.call(3) == 6)
+
+Proc.new{
+  iii=5				# nested local variable
+  $proc = Proc.new{|i|
+    iii = i
+  }
+  $proc2 = Proc.new {
+    $x = iii			# nested variables shared by procs
+  }
+  # scope of nested variables
+  test_ok(defined?(iii))
+}.call
+test_ok(!defined?(iii))		# out of scope
+
+loop{iii=5; test_ok(eval("defined? iii")); break}
+loop {
+  iii = 10
+  def dyna_var_check
+    loop {
+      test_ok(!defined?(iii))
+      break
+    }
+  end
+  dyna_var_check
+  break
+}
+$x=0
+$proc.call(5)
+$proc2.call
+test_ok($x == 5)
+
+if defined? Process.kill
+  test_check "signal"
+
+  $x = 0
+  trap "SIGINT", Proc.new{|sig| $x = 2}
+  Process.kill "SIGINT", $$
+  100.times {
+    sleep 0.1
+    break if $x != 0
+  }
+  test_ok($x == 2)
+
+  trap "SIGINT", Proc.new{raise "Interrupt"}
+
+  x = false
+  begin
+    Process.kill "SIGINT", $$
+    sleep 0.1
+  rescue
+    x = $!
+  end
+  test_ok(x && /Interrupt/ =~ x.message)
+end
+
+test_check "eval"
+test_ok(eval("") == nil)
+$bad=false
+eval 'while false; $bad = true; print "foo\n" end'
+test_ok(!$bad)
+
+test_ok(eval('Object'))
+test_ok(eval('true'))
+test_ok(!eval('nil'))
+test_ok(!eval('false'))
+
+$foo = 'test_ok(true)'
+begin
+  eval $foo
+rescue
+  test_ok(false)
+end
+
+test_ok(eval("$foo") == 'test_ok(true)')
+test_ok(eval("true") == true)
+i = 5
+test_ok(eval("i == 5"))
+test_ok(eval("i") == 5)
+test_ok(eval("defined? i"))
+
+# eval with binding
+def test_ev
+  local1 = "local1"
+  lambda {
+    local2 = "local2"
+    return binding
+  }.call
+end
+
+$x = test_ev
+test_ok(eval("local1", $x) == "local1") # normal local var
+test_ok(eval("local2", $x) == "local2") # nested local var
+$bad = true
+begin
+  p eval("local1")
+rescue NameError		# must raise error
+  $bad = false
+end
+test_ok(!$bad)
+
+module EvTest
+  EVTEST1 = 25
+  evtest2 = 125
+  $x = binding
+end
+test_ok(eval("EVTEST1", $x) == 25)	# constant in module
+test_ok(eval("evtest2", $x) == 125)	# local var in module
+$bad = true
+begin
+  eval("EVTEST1")
+rescue NameError		# must raise error
+  $bad = false
+end
+test_ok(!$bad)
+
+x = binding #! YARV Limitation: Proc.new{}
+eval "i4 = 1", x
+test_ok(eval("i4", x) == 1)
+x = Proc.new{binding}.call #! YARV Limitation: Proc.new{Proc.new{}}.call
+eval "i4 = 22", x
+test_ok(eval("i4", x) == 22)
+$x = []
+x = Proc.new{binding}.call #! YARV Limitation: Proc.new{Proc.new{}}.call
+eval "(0..9).each{|i5| $x[i5] = Proc.new{i5*2}}", x
+test_ok($x[4].call == 8)
+
+x = binding
+eval "i = 1", x
+test_ok(eval("i", x) == 1)
+x = Proc.new{binding}.call
+eval "i = 22", x
+test_ok(eval("i", x) == 22)
+$x = []
+x = Proc.new{binding}.call
+eval "(0..9).each{|i5| $x[i5] = Proc.new{i5*2}}", x
+test_ok($x[4].call == 8)
+x = Proc.new{binding}.call
+eval "for i6 in 1..1; j6=i6; end", x
+test_ok(eval("defined? i6", x))
+test_ok(eval("defined? j6", x))
+
+Proc.new {
+  p = binding
+  eval "foo11 = 1", p
+  foo22 = 5
+  Proc.new{foo11=22}.call
+  Proc.new{foo22=55}.call
+  test_ok(eval("foo11", p) == eval("foo11"))
+  test_ok(eval("foo11") == 1)
+  test_ok(eval("foo22", p) == eval("foo22"))
+  test_ok(eval("foo22") == 55)
+}.call if false #! YARV Limitation
+
+#! YARV Limitation: p1 = Proc.new{i7 = 0; Proc.new{i7}}.call
+p1 = Proc.new{i7 = 0; binding}.call
+#! YARV Limitation: test_ok(p1.call == 0)
+eval "i7=5", p1
+#! YARV Limitation: test_ok(p1.call == 5)
+test_ok(!defined?(i7))
+
+if false #! YARV Limitation
+p1 = Proc.new{i7 = 0; Proc.new{i7}}.call
+i7 = nil
+test_ok(p1.call == 0)
+eval "i7=1", p1
+test_ok(p1.call == 1)
+eval "i7=5", p1
+test_ok(p1.call == 5)
+test_ok(i7 == nil)
+end
+
+# WASI doesn't support spawning a new process for now.
+unless /wasi/ =~ RUBY_PLATFORM
+test_check "system"
+test_ok(`echo foobar` == "foobar\n")
+test_ok(`./miniruby -e 'print "foobar"'` == 'foobar')
+
+script_tmp = "script_tmp.#{$$}"
+tmp = open(script_tmp, "w")
+tmp.print "print $zzz\n";
+tmp.close
+
+test_ok(`./miniruby -s #{script_tmp} -zzz` == 'true')
+test_ok(`./miniruby -s #{script_tmp} -zzz=555` == '555')
+
+tmp = open(script_tmp, "w")
+tmp.print "#! /usr/local/bin/ruby -s\n";
+tmp.print "print $zzz\n";
+tmp.close
+
+test_ok(`./miniruby #{script_tmp} -zzz=678` == '678')
+
+tmp = open(script_tmp, "w")
+tmp.print "this is a leading junk\n";
+tmp.print "#! /usr/local/bin/ruby -s\n";
+tmp.print "print $zzz\n";
+tmp.print "__END__\n";
+tmp.print "this is a trailing junk\n";
+tmp.close
+
+test_ok(`./miniruby -x #{script_tmp}` == '')
+test_ok(`./miniruby -x #{script_tmp} -zzz=555` == '555')
+
+tmp = open(script_tmp, "w")
+for i in 1..5
+  tmp.print i, "\n"
+end
+tmp.close
+
+`./miniruby -i.bak -pe '$_.sub!(/^[0-9]+$/){$&.to_i * 5}' #{script_tmp}`
+done = true
+tmp = open(script_tmp, "r")
+while tmp.gets
+  if $_.to_i % 5 != 0
+    done = false
+    break
+  end
+end
+tmp.close
+test_ok(done)
+
+File.unlink script_tmp or `/bin/rm -f "#{script_tmp}"`
+File.unlink "#{script_tmp}.bak" or `/bin/rm -f "#{script_tmp}.bak"`
+end # not /wasi/ =~ RUBY_PLATFORM
+
+test_check "const"
+TEST1 = 1
+TEST2 = 2
+
+module Const
+  TEST3 = 3
+  TEST4 = 4
+end
+
+module Const2
+  TEST3 = 6
+  TEST4 = 8
+end
+
+include Const
+
+test_ok([TEST1,TEST2,TEST3,TEST4] == [1,2,3,4])
+
+include Const2
+STDERR.print "intentionally redefines TEST3, TEST4\n" if $VERBOSE
+test_ok([TEST1,TEST2,TEST3,TEST4] == [1,2,6,8])
+
+
+test_ok((String <=> Object) == -1)
+test_ok((Object <=> String) == 1)
+test_ok((Array <=> String) == nil)
+
+test_check "clone"
+foo = Object.new
+def foo.test
+  "test"
+end
+bar = foo.clone
+def bar.test2
+  "test2"
+end
+
+test_ok(bar.test2 == "test2")
+test_ok(bar.test == "test")
+test_ok(foo.test == "test")
+
+begin
+  foo.test2
+  test_ok false
+rescue NoMethodError
+  test_ok true
+end
+
+module M001; end
+module M002; end
+module M003; include M002; end
+module M002; include M001; end
+module M003; include M002; end
+
+test_ok(M003.ancestors == [M003, M002, M001])
+
+test_check "marshal"
+$x = [1,2,3,[4,5,"foo"],{1=>"bar"},2.5,fact(30)]
+$y = Marshal.dump($x)
+test_ok($x == Marshal.load($y))
+
+StrClone=String.clone;
+test_ok(Marshal.load(Marshal.dump(StrClone.new("abc"))).class == StrClone)
+
+[[1,2,3,4], [81, 2, 118, 3146]].each { |w,x,y,z|
+  a = (x.to_f + y.to_f / z.to_f) * Math.exp(w.to_f / (x.to_f + y.to_f / z.to_f))
+  ma = Marshal.dump(a)
+  b = Marshal.load(ma)
+  test_ok(a == b)
+}
+
+test_check "pack"
+
+$format = "c2x5CCxsdils_l_a6";
+# Need the expression in here to force ary[5] to be numeric.  This avoids
+# test2 failing because ary2 goes str->numeric->str and ary does not.
+ary = [1,-100,127,128,32767,987.654321098 / 100.0,12345,123456,-32767,-123456,"abcdef"]
+$x = ary.pack($format)
+ary2 = $x.unpack($format)
+
+test_ok(ary.length == ary2.length)
+test_ok(ary.join(':') == ary2.join(':'))
+test_ok($x =~ /def/)
+
+$x = [-1073741825]
+test_ok($x.pack("q").unpack("q") == $x)
+
+test_check "math"
+test_ok(Math.sqrt(4) == 2)
+
+include Math
+test_ok(sqrt(4) == 2)
+
+test_check "struct"
+struct_test = Struct.new("Test", :foo, :bar)
+test_ok(struct_test == Struct::Test)
+
+test = struct_test.new(1, 2)
+test_ok(test.foo == 1 && test.bar == 2)
+test_ok(test[0] == 1 && test[1] == 2)
+
+a, b = test.to_a
+test_ok(a == 1 && b == 2)
+
+test[0] = 22
+test_ok(test.foo == 22)
+
+test.bar = 47
+test_ok(test.bar == 47)
+
+test_check "variable"
+test_ok($$.instance_of?(Integer))
+
+# read-only variable
+begin
+  $$ = 5
+  test_ok false
+rescue NameError
+  test_ok true
+end
+
+foobar = "foobar"
+$_ = foobar
+test_ok($_ == foobar)
+
+class Gods
+  @@rule = "Uranus"
+  def ruler0
+    @@rule
+  end
+
+  def self.ruler1		# <= per method definition style
+    @@rule
+  end
+  class << self			# <= multiple method definition style
+    def ruler2
+      @@rule
+    end
+  end
+end
+
+module Olympians
+  @@rule ="Zeus"
+  def ruler3
+    @@rule
+  end
+end
+
+class Titans < Gods
+  @@rule = "Cronus"		# modifies @@rule in Gods
+  include Olympians
+  def ruler4
+    @@rule
+  end
+end
+
+test_ok(Gods.new.ruler0 == "Cronus")
+test_ok(Gods.ruler1 == "Cronus")
+test_ok(Gods.ruler2 == "Cronus")
+test_ok(Titans.ruler1 == "Cronus")
+test_ok(Titans.ruler2 == "Cronus")
+atlas = Titans.new
+test_ok(atlas.ruler0 == "Cronus")
+test_ok(atlas.ruler3 == "Zeus")
+begin
+  atlas.ruler4
+rescue RuntimeError => e
+  test_ok(e.message.include?("class variable @@rule of Olympians is overtaken by Gods"))
+else
+  test_ok(false)
+end
+test_ok(atlas.ruler3 == "Zeus")
+
+test_check "trace"
+$x = 1234
+$y = 0
+trace_var :$x, Proc.new{$y = $x}
+$x = 40414
+test_ok($y == $x)
+
+untrace_var :$x
+$x = 19660208
+test_ok($y != $x)
+
+trace_var :$x, Proc.new{$x *= 2}
+$x = 5
+test_ok($x == 10)
+
+untrace_var :$x
+
+test_check "defined?"
+
+test_ok(defined?($x))		# global variable
+test_ok(defined?($x) == 'global-variable')# returns description
+
+foo=5
+test_ok(defined?(foo))		# local variable
+
+test_ok(defined?(Array))	# constant
+test_ok(defined?(Object.new))	# method
+test_ok(!defined?(Object.print))# private method
+test_ok(defined?(1 == 2))	# operator expression
+
+class Foo
+  def foo
+    p :foo
+  end
+  protected :foo
+  def bar(f)
+    test_ok(defined?(self.foo))
+    test_ok(defined?(f.foo))
+  end
+end
+f = Foo.new
+test_ok(defined?(f.foo) == nil)
+f.bar(f)
+
+def defined_test
+  return !defined?(yield)
+end
+
+test_ok(defined_test)		# not iterator
+test_ok(!defined_test{})	# called as iterator
+
+test_check "alias"
+class Alias0
+  def foo; "foo" end
+end
+class Alias1 < Alias0
+  alias bar foo
+  def foo; "foo+" + super end
+end
+class Alias2 < Alias1
+  alias baz foo
+  undef foo
+end
+
+x = Alias2.new
+test_ok(x.bar == "foo")
+test_ok(x.baz == "foo+foo")
+
+# test_check for cache
+test_ok(x.baz == "foo+foo")
+
+class Alias3 < Alias2
+  def foo
+    defined? super
+  end
+  def bar
+    defined? super
+  end
+  def quux
+    defined? super
+  end
+end
+x = Alias3.new
+test_ok(!x.foo)
+test_ok(x.bar)
+test_ok(!x.quux)
+
+test_check "path"
+test_ok(File.basename("a") == "a")
+test_ok(File.basename("a/b") == "b")
+test_ok(File.basename("a/b/") == "b")
+test_ok(File.basename("/") == "/")
+test_ok(File.basename("//") == "/")
+test_ok(File.basename("///") == "/")
+test_ok(File.basename("a/b////") == "b")
+test_ok(File.basename("a.rb", ".rb") == "a")
+test_ok(File.basename("a.rb///", ".rb") == "a")
+test_ok(File.basename("a.rb///", ".*") == "a")
+test_ok(File.basename("a.rb///", ".c") == "a.rb")
+test_ok(File.dirname("a") == ".")
+test_ok(File.dirname("/") == "/")
+test_ok(File.dirname("/a") == "/")
+test_ok(File.dirname("a/b") == "a")
+test_ok(File.dirname("a/b/c") == "a/b")
+test_ok(File.dirname("/a/b/c") == "/a/b")
+test_ok(File.dirname("/a/b/") == "/a")
+test_ok(File.dirname("/a/b///") == "/a")
+case Dir.pwd
+when %r'\A\w:'
+  test_ok(/\A\w:\/\z/ =~ File.expand_path(".", "/"))
+  test_ok(/\A\w:\/a\z/ =~ File.expand_path("a", "/"))
+  dosish = true
+when %r'\A//'
+  test_ok(%r'\A//[^/]+/[^/]+\z' =~ File.expand_path(".", "/"))
+  test_ok(%r'\A//[^/]+/[^/]+/a\z' =~ File.expand_path(".", "/"))
+  dosish = true
+else
+  test_ok(File.expand_path(".", "/") == "/")
+  test_ok(File.expand_path("sub", "/") == "/sub")
+end
+if dosish
+  test_ok(File.expand_path("/", "//machine/share/sub") == "//machine/share")
+  test_ok(File.expand_path("/dir", "//machine/share/sub") == "//machine/share/dir")
+  test_ok(File.expand_path("/", "z:/sub") == "z:/")
+  test_ok(File.expand_path("/dir", "z:/sub") == "z:/dir")
+end
+test_ok(File.expand_path(".", "//") == "//")
+test_ok(File.expand_path("sub", "//") == "//sub")
+
+# test_check "Proc#binding"
+ObjectSpace.each_object(Proc){|o|
+  begin
+    b = o.binding
+    eval 'self', b
+  rescue ArgumentError
+  end
+}
+
+test_check "gc"
+begin
+  1.upto(10000) {
+    tmp = [0,1,2,3,4,5,6,7,8,9]
+  }
+  tmp = nil
+  test_ok true
+rescue
+  test_ok false
+end
+class S
+  def initialize(a)
+    @a = a
+  end
+end
+l=nil
+100000.times {
+  l = S.new(l)
+}
+GC.start
+test_ok true   # reach here or dumps core
+l = []
+100000.times {
+  l.push([l])
+}
+GC.start
+test_ok true   # reach here or dumps core
+
+ObjectSpace.each_object{|o|
+  o.class.name
+}
+
+test_ok true   # reach here or dumps core
+
+PROGRESS.finish
+if $failed > 0
+  printf "not ok/test: %d failed %d\n", $ntest, $failed
+else
+  printf "end of test(test: %d)\n", $ntest
+end
diff --git a/bcc32/Makefile.sub b/bcc32/Makefile.sub
deleted file mode 100644
index 1cd26a8643..0000000000
--- a/bcc32/Makefile.sub
+++ /dev/null
@@ -1,617 +0,0 @@
-# -*- makefile -*-
-
-SHELL = $(COMSPEC)
-MKFILES = Makefile
-
-!ifndef MFLAGS
-MFLAGS=-
-!endif
-
-#### Start of system configuration section. ####
-!ifndef OS
-OS = bccwin32
-!endif
-!if !defined(RT)
-!error RT not defined.  Retry from configure pass.
-!endif
-
-arch = $(ARCH)-$(OS)
-
-## variables may be overridden by $(compile_dir)/Makefile
-!ifndef srcdir
-srcdir = ..
-!endif
-!ifndef RUBY_INSTALL_NAME
-RUBY_INSTALL_NAME = ruby
-!endif
-!ifndef RUBYW_INSTALL_NAME
-RUBYW_INSTALL_NAME = $(RUBY_INSTALL_NAME:ruby=rubyw)
-!elif "$(RUBYW_INSTALL_NAME)" == "$(RUBY_INSTALL_NAME)"
-RUBYW_INSTALL_NAME = $(RUBY_INSTALL_NAME:ruby=rubyw)
-!endif
-!if "$(RUBYW_INSTALL_NAME)" == "$(RUBY_INSTALL_NAME)"
-RUBYW_INSTALL_NAME = $(RUBY_INSTALL_NAME)w
-!endif
-!ifndef RUBY_SO_NAME
-RUBY_SO_NAME = $(RT)-$(RUBY_INSTALL_NAME)$(MAJOR)$(MINOR)$(TEENY)
-!endif
-!ifndef icondirs
-!ifdef ICONDIRS
-icondirs=$(ICONDIRS)
-!endif
-!endif
-!ifdef icondirs
-icondirs=$(icondirs:\=/)
-iconinc=-I$(icondirs: = -I)
-!endif
-###############
-
-.SUFFIXES: .y
-
-!ifndef CC
-CC = bcc32
-!endif
-!ifndef CPP
-CPP = cpp32
-!endif
-!ifndef RC
-RC = brcc32
-!endif
-!ifndef YACC
-YACC = bison
-!endif
-!ifndef AR
-AR = tlib
-!endif
-!ifndef BASERUBY
-BASERUBY = ruby
-!endif
-
-PURIFY =
-AUTOCONF = autoconf
-IFCHANGE = $(srcdir:/=\)\win32\ifchange.bat
-RM = $(srcdir:/=\)\win32\rm.bat
-CP = copy > nul
-MV = move > nul
-
-!if !defined(PROCESSOR_ARCHITECTURE)
-PROCESSOR_ARCHITECTURE = x86
-!endif
-MACHINE = $(PROCESSOR_ARCHITECTURE)
-!if "$(PROCESSOR_ARCHITECTURE)" == "x86"
-!ifndef PROCESSOR_LEVEL
-PROCESSOR_LEVEL = 5
-!endif
-!if 6 < $(PROCESSOR_LEVEL)
-PROCESSOR_LEVEL = 6
-!endif
-PROCESSOR_FLAG = -$(PROCESSOR_LEVEL)
-CPU = i$(PROCESSOR_LEVEL)86
-ARCH = i386
-!else
-CPU = $(PROCESSOR_ARCHITECTURE)
-ARCH = $(PROCESSOR_ARCHITECTURE)
-!endif
-!ifndef DEBUGFLAGS
-DEBUGFLAGS = 
-!endif
-!ifndef OPTFLAGS
-OPTFLAGS = -O
-!endif
-
-!ifndef prefix
-prefix = /usr
-!endif
-!ifndef exec_prefix
-exec_prefix = $(prefix)
-!endif
-!ifndef libdir
-libdir = $(exec_prefix)/lib
-!endif
-!if !defined(datadir)
-datadir = $(prefix)/share
-!endif
-!ifndef EXTOUT
-EXTOUT = .ext
-!endif
-!ifndef TESTUI
-TESTUI = console
-!endif
-!ifndef TESTS
-TESTS =
-!endif
-!ifndef RDOCTARGET
-RDOCTARGET = install-doc
-!endif
-
-OUTFLAG       = -o
-COUTFLAG      = -o
-!ifndef CFLAGS
-CFLAGS = -q -tWR -tWC $(DEBUGFLAGS) $(OPTFLAGS) $(PROCESSOR_FLAG) -w- -wsus -wcpt -wdup -wext -wrng -wrpt -wzdi
-!endif
-!ifndef DEFS
-DEFS =
-!endif
-!ifndef CPPFLAGS
-CPPFLAGS =
-!endif
-CPPFLAGS = $(DEFS) $(CPPFLAGS)
-!ifndef CXXFLAGS
-CXXFLAGS = $(CFLAGS)
-!endif
-!ifndef LDFLAGS
-LDFLAGS = -S:$(STACK)
-!endif
-!ifndef RFLAGS
-RFLAGS = $(iconinc)
-!endif
-!ifndef EXTLIBS
-EXTLIBS =
-!endif
-!ifndef MEMLIB
-MEMLIB =
-!endif
-LIBS = $(MEMLIB) cw32i.lib import32.lib ws2_32.lib $(EXTLIBS)
-MISSING = acosh.obj cbrt.obj crypt.obj erf.obj lgamma_r.obj strlcat.obj strlcpy.obj tgamma.obj win32.obj
-
-!ifndef STACK
-STACK = 0x2000000
-!endif
-
-XCFLAGS = -DRUBY_EXPORT -I. -I$(arch_hdrdir) -I$(hdrdir) -I$(srcdir) -I$(srcdir)/missing
-
-ARFLAGS = /a /p32
-LD = ilink32 -q -Gn
-LDSHARED  = $(LD)
-XLDFLAGS  = -Tpe c0x32.obj
-WLDFLAGS  = -aa -Tpe c0w32.obj
-DLDFLAGS  = -Tpd c0d32.obj
-LIBRUBY_LDSHARED = $(LDSHARED)
-LIBRUBY_DLDFLAGS = -Gi $(DLDFLAGS) $(EXTLDFLAGS)
-LDOBJECTS = $(MAINOBJ)
-
-SOLIBS = 
-
-EXEEXT = .exe
-PROGRAM=$(RUBY_INSTALL_NAME)$(EXEEXT)
-WPROGRAM=$(RUBYW_INSTALL_NAME)$(EXEEXT)
-RUBYDEF = $(RUBY_SO_NAME).def
-MINIRUBY = .\miniruby$(EXEEXT) -I$(srcdir)/lib $(MINIRUBYOPT)
-RUNRUBY = .\$(PROGRAM) -i"$(EXTOUT)/$(arch)" "$(srcdir)/runruby.rb" --extout="$(EXTOUT)" --
-
-ORGLIBPATH = $(LIB)
-
-#### End of system configuration section. ####
-
-LIBRUBY_A     = $(RUBY_SO_NAME)-static.lib
-LIBRUBY_SO    = $(RUBY_SO_NAME).dll
-LIBRUBY       = $(RUBY_SO_NAME).lib
-LIBRUBYARG    = $(LIBRUBY)
-THREAD_MODEL  = win32
-
-PREP          = miniruby$(EXEEXT)
-
-OBJEXT        = obj
-ASMEXT        = asm
-
-INSTALLED_LIST= .installed.list
-
-MKMAIN_CMD    = mkmain.bat
-
-SRC_FILE      = $(<:\=/)
-
-WINMAINOBJ    = winmain.$(OBJEXT)
-ARCHMINIOBJS  = dmydln.$(OBJEXT)
-
-arch_hdrdir = $(EXTOUT)/include/$(arch)
-hdrdir = $(srcdir)/include
-VPATH = $(arch_hdrdir)/ruby;$(hdrdir)/ruby;$(srcdir);$(srcdir)/enc;$(srcdir)/missing;$(srcdir)/win32
-
-.path.c = .;$(srcdir);$(srcdir)/enc;$(srcdir)/win32;$(srcdir)/missing
-.path.ci = $(srcdir)
-.path.inc = .;$(srcdir)
-.path.def = .;$(srcdir)
-.path.h = .;$(arch_hdrdir)/ruby;$(hdrdir)/ruby;$(srcdir);$(srcdir)/win32;$(srcdir)/missing
-.path.y = $(srcdir)
-.path. = $(srcdir)
-
-.c.obj:
-	$(CC) $(CFLAGS) $(XCFLAGS) -I. $(CPPFLAGS) $(COUTFLAG)$@ -c $(<:/=\)
-
-.c.asm:
-	$(CC) $(CFLAGS) $(XCFLAGS) -I. $(CPPFLAGS) $(COUTFLAG)$@ -S $(<:\=/)
-
-.rc.res:
-	$(RC) $(RFLAGS) -I. -I$(<D). $(iconinc) -I$(srcdir)/win32 $(RFLAGS) -fo$@ $(<:/=\)
-
-all: $(srcdir)/bcc32/Makefile.sub $(srcdir)/common.mk
-
-ruby: $(PROGRAM)
-rubyw: $(WPROGRAM)
-
-!include $(srcdir)/common.mk
-
-$(MKFILES): $(srcdir)/bcc32/Makefile.sub $(srcdir)/bcc32/configure.bat $(srcdir)/bcc32/setup.mak
-	$(COMSPEC) /C $(srcdir:/=\)\bcc32\configure.bat $(configure_args)
-	@echo $(MKFILES) should be updated, re-run $(MAKE).
-	@$(MAKE) > nul -q -f &&|
-PHONY: nul
-	@exit
-|
-
-PHONY: nul
-
-RUBY_CONFIG_H = $(arch_hdrdir)/ruby/config.h
-CONFIG_H = ./.config.h.time
-
-config: config.status
-
-config.status: $(CONFIG_H)
-
-guard = INCLUDE_RUBY_CONFIG_H
-
-$(CONFIG_H): $(MKFILES) $(srcdir)/bcc32/Makefile.sub
-	@if not exist $(arch_hdrdir:/=\) md $(arch_hdrdir:/=\)
-	@if not exist $(arch_hdrdir:/=\)\ruby md $(arch_hdrdir:/=\)\ruby
-	@$(IFCHANGE) $(RUBY_CONFIG_H:/=\) &&|
-\#ifndef $(guard)
-\#define $(guard) 1
-\#define NO_BIG_INLINE 1
-\#define HAVE_SYS_TYPES_H 1
-\#define HAVE_SYS_STAT_H 1
-\#define HAVE_STDLIB_H 1
-\#define HAVE_STRING_H 1
-\#define HAVE_MEMORY_H 1
-\#define HAVE_LONG_LONG 1
-\#define HAVE_OFF_T 1
-\#define SIZEOF_INT 4
-\#define SIZEOF_SHORT 2
-\#define SIZEOF_LONG 4
-\#define SIZEOF_LONG_LONG 0
-\#define SIZEOF___INT64 8
-\#define SIZEOF_OFF_T 8
-\#define SIZEOF_VOIDP 4
-\#define SIZEOF_FLOAT 4
-\#define SIZEOF_DOUBLE 8
-\#define SIZEOF_TIME_T 4
-\#define SIZEOF_RLIM_T 0
-\#define SIZEOF_SIZE_T 4
-\#define SIZEOF_PTRDIFF_T 4
-\#define HAVE_PROTOTYPES 1
-\#define TOKEN_PASTE(x,y) x\#\#y
-\#define HAVE_STDARG_PROTOTYPES 1
-\#define NORETURN(x) x
-\#define RUBY_EXTERN extern __declspec(dllimport)
-\#define HAVE_DECL_SYS_NERR 1
-\#define HAVE_LIMITS_H 1
-\#define HAVE_FCNTL_H 1
-\#define HAVE_UTIME_H 1
-\#define HAVE_FLOAT_H 1
-\#define rb_uid_t uid_t
-\#define rb_gid_t gid_t
-\#define rb_pid_t int
-\#define HAVE_STRUCT_STAT_ST_RDEV 1
-\#define HAVE_ST_RDEV 1
-!if $(BORLANDC) < 0x0580
-\#define int8_t signed char
-\#define uint8_t unsigned char
-\#define int16_t short
-\#define uint16_t unsigned short
-\#define int32_t int
-\#define uint32_t unsigned int
-\#define int64_t __int64
-\#define uint64_t unsigned __int64
-\#define ssize_t int
-!endif
-\#define HAVE_INT8_T 1
-\#define HAVE_UINT8_T 1
-\#define SIZEOF_INT8_T 1
-\#define HAVE_INT16_T 1
-\#define HAVE_UINT16_T 1
-\#define SIZEOF_INT32_T 2
-\#define HAVE_INT32_T 1
-\#define HAVE_UINT32_T 1
-\#define SIZEOF_INT32_T 4
-\#define HAVE_INT64_T 1
-\#define HAVE_UINT64_T 1
-\#define SIZEOF_INT64_T 8
-\#define HAVE_INTPTR_T 1
-\#define HAVE_UINTPTR_T 1
-\#define HAVE_SSIZE_T 1
-\#define GETGROUPS_T int
-\#define RETSIGTYPE void
-\#define HAVE_ALLOCA 1
-\#define HAVE_DUP2 1
-\#define HAVE_MEMMOVE 1
-\#define HAVE_MKDIR 1
-\#define HAVE_STRCASECMP 1
-\#define HAVE_STRNCASECMP 1
-\#define HAVE_STRERROR 1
-\#define HAVE_STRFTIME 1
-\#define HAVE_STRCHR 1
-\#define HAVE_STRSTR 1
-\#define HAVE_STRTOD 1
-\#define HAVE_STRTOL 1
-\#define HAVE_STRTOUL 1
-\#define HAVE_SNPRINTF 1
-\#define HAVE_VSNPRINTF 1
-\#define HAVE_ISNAN 1
-\#define HAVE_FINITE 1
-\#define HAVE_HYPOT 1
-\#define HAVE_FMOD 1
-\#define HAVE_WAITPID 1
-\#define HAVE_FSYNC 1
-\#define HAVE_GETCWD 1
-\#define HAVE_TRUNCATE 1
-\#define HAVE_FTRUNCATE 1
-\#define HAVE_FSEEKO 1
-\#define HAVE_FTELLO 1
-\#define HAVE_TIMES 1
-\#define HAVE_FCNTL 1
-\#define HAVE_LINK 1
-\#define HAVE_TELLDIR 1
-\#define HAVE_SEEKDIR 1
-\#define HAVE_COSH 1
-\#define HAVE_SINH 1
-\#define HAVE_TANH 1
-\#define RSHIFT(x,y) ((x)>>(int)y)
-\#define FILE_COUNT level
-\#define FILE_READPTR curp
-\#define RUBY_SETJMP(env) setjmp(env)
-\#define RUBY_LONGJMP(env,val) longjmp(env,val)
-\#define RUBY_JMP_BUF jmp_buf
-\#define inline __inline
-\#define NEED_IO_SEEK_BETWEEN_RW 1
-\#define STACK_GROW_DIRECTION -1
-\#define DEFAULT_KCODE KCODE_NONE
-\#define LOAD_RELATIVE 1
-\#define DLEXT ".so"
-\#define RUBY_LIB_PREFIX "/lib/ruby"
-\#define RUBY_PLATFORM "$(ARCH)-$(OS)"
-\#endif /* $(guard) */
-|
-	@exit > $(@:/=\)
-
-config.status: $(MKFILES) $(srcdir)/bcc32/Makefile.sub $(srcdir)/common.mk
-	@echo Creating $@
-	@type > $@ &&|
-# Generated automatically by Makefile.sub.
-s,@SHELL@,$$(COMSPEC),;t t
-s,@BUILD_FILE_SEPARATOR@,\,;t t
-s,@PATH_SEPARATOR@,;,;t t
-s,@CFLAGS@,$(CFLAGS),;t t
-s,@DEFS@,$(DEFS),;t t
-s,@CPPFLAGS@,$(CPPFLAGS),;t t
-s,@CXXFLAGS@,$(CXXFLAGS),;t t
-s,@FFLAGS@,$(FFLAGS),;t t
-s,@LDFLAGS@,,;t t
-s,@LIBS@,$(LIBS),;t t
-s,@exec_prefix@,$${prefix},;t t
-s,@prefix@,$(prefix),;t t
-s,@program_transform_name@,s,,,,;t t
-s,@bindir@,$${exec_prefix}/bin,;t t
-s,@sbindir@,$${exec_prefix}/sbin,;t t
-s,@libexecdir@,$${exec_prefix}/libexec,;t t
-s,@datadir@,$${prefix}/share,;t t
-s,@sysconfdir@,$${prefix}/etc,;t t
-s,@sharedstatedir@,/etc,;t t
-s,@localstatedir@,/var,;t t
-s,@libdir@,$${exec_prefix}/lib,;t t
-s,@includedir@,$${prefix}/include,;t t
-s,@oldincludedir@,/usr/include,;t t
-s,@infodir@,$${prefix}/info,;t t
-s,@mandir@,$${prefix}/man,;t t
-s,@ridir@,$${prefix}/share/ri,;t t
-s,@build@,$(CPU)-pc-$(OS),;t t
-s,@build_alias@,$(CPU)-$(OS),;t t
-s,@build_cpu@,$(CPU),;t t
-s,@build_vendor@,pc,;t t
-s,@build_os@,$(OS),;t t
-s,@host@,$(CPU)-pc-$(OS),;t t
-s,@host_alias@,$(CPU)-$(OS),;t t
-s,@host_cpu@,$(CPU),;t t
-s,@host_vendor@,pc,;t t
-s,@host_os@,$(OS),;t t
-s,@target@,$(ARCH)-pc-$(OS),;t t
-s,@target_alias@,$(ARCH)-$(OS),;t t
-s,@target_cpu@,$(ARCH),;t t
-s,@target_vendor@,pc,;t t
-s,@target_os@,$(OS),;t t
-s,@CC@,$(CC),;t t
-s,@CPP@,cpp32,;t t
-s,@CXX@,$$(CC),;t t
-s,@LD@,$(LD),;t t
-s,@YACC@,$(YACC),;t t
-s,@RANLIB@,,;t t
-s,@AR@,$(AR),;t t
-s,@ARFLAGS@,$(ARFLAGS) ,;t t
-s,@LN_S@,$(LN_S),;t t
-s,@SET_MAKE@,MFLAGS = -$$(MAKEFLAGS),;t t
-s,@RM@,$$(top_srcdir:/=\)\win32\rm.bat,;t t
-s,@CP@,copy > nul,;t t
-s,@LIBOBJS@, $(MISSING),;t t
-s,@ALLOCA@,$(ALLOCA),;t t
-s,@DEFAULT_KCODE@,$(DEFAULT_KCODE),;t t
-s,@EXEEXT@,.exe,;t t
-s,@OBJEXT@,obj,;t t
-s,@XCFLAGS@,$(XCFLAGS),;t t
-s,@XLDFLAGS@,$(XLDFLAGS),;t t
-s,@DLDFLAGS@,$(DLDFLAGS),;t t
-s,@ARCH_FLAG@,$(ARCH_FLAG),;t t
-s,@STATIC@,$(STATIC),;t t
-s,@CCDLFLAGS@,,;t t
-s,@LDSHARED@,$(LDSHARED),;t t
-s,@DLEXT@,so,;t t
-s,@LIBEXT@,lib,;t t
-s,@STRIP@,$(STRIP),;t t
-s,@EXTSTATIC@,$(EXTSTATIC),;t t
-s,@setup@,Setup,;t t
-s,@MINIRUBY@,$(MINIRUBY),;t t
-s,@PREP@,miniruby$(EXEEXT),;t t
-s,@RUNRUBY@,$(RUNRUBY),;t t
-s,@EXTOUT@,$(EXTOUT),;t t
-s,@ARCHFILE@,,;t t
-s,@RDOCTARGET@,,;t t
-s,@LIBRUBY_LDSHARED@,$$(LDSHARED),;t t
-s,@LIBRUBY_DLDFLAGS@,-Gi $$(DLDFLAGS),;t t
-s,@RUBY_INSTALL_NAME@,$(RUBY_INSTALL_NAME),;t t
-s,@rubyw_install_name@,$(RUBYW_INSTALL_NAME),;t t
-s,@RUBYW_INSTALL_NAME@,$(RUBYW_INSTALL_NAME),;t t
-s,@RUBY_SO_NAME@,$(RUBY_SO_NAME),;t t
-s,@LIBRUBY_A@,$$(RUBY_SO_NAME)-static.lib,;t t
-s,@LIBRUBY_SO@,$$(RUBY_SO_NAME).dll,;t t
-s,@LIBRUBY_ALIASES@,$(LIBRUBY_ALIASES),;t t
-s,@LIBRUBY@,$$(RUBY_SO_NAME).lib,;t t
-s,@LIBRUBYARG@,$$(LIBRUBYARG_SHARED),;t t
-s,@LIBRUBYARG_STATIC@,$$(LIBRUBY_A),;t t
-s,@LIBRUBYARG_SHARED@,$$(LIBRUBY),;t t
-s,@SOLIBS@,$(SOLIBS),;t t
-s,@DLDLIBS@,$(DLDLIBS),;t t
-s,@ENABLE_SHARED@,yes,;t t
-s,@OUTFLAG@,$(OUTFLAG),;t t
-s,@COUTFLAG@,$(COUTFLAG),;t t
-s,@CPPOUTFILE@,,;t t
-s,@LIBPATHFLAG@, -L"%s",;t t
-s,@RPATHFLAG@,,;t t
-s,@LIBARG@,%s.lib,;t t
-s,@LINK_SO@,$$(LDSHARED) $$(DLDFLAGS) $$(LIBPATH) $$(OBJS:/=\), $$(@:/=\), nul, $$(LIBS) $$(LOCAL_LIBS), $$(DEFFILE:/=\), $$(RESFILE:/=\),;t t
-s,@COMPILE_C@,$$(CC) $$(INCFLAGS) $$(CFLAGS) $$(CPPFLAGS) $(COUTFLAG)$$(@) -c $$(<:/=\),;t t
-s,@COMPILE_CXX@,$$(CXX) $$(INCFLAGS) $$(CXXFLAGS) $$(CPPFLAGS) -P $(COUTFLAG)$$(@) -c $$(<:/=\),;t t
-s,@COMPILE_RULES@,{$$(srcdir)}.%s{}.%s: {$$(topdir)}.%s{}.%s: {$$(hdrdir)}.%s{}.%s: .%s.%s:,;t t
-s,@RULE_SUBST@,{.;$$(VPATH)}%s,;t t
-s,@COMMON_LIBS@,m advapi32 avicap32 avifil32 cap comctl32 comdlg32 dlcapi gdi32 glu32 imagehlp imm32 inetmib1 kernel32 loadperf lsapi32 lz32 mapi32 mgmtapi mpr msacm32 msvfw32 nddeapi netapi32 ole32 oleaut32 oledlg olepro32 opengl32 pdh pkpd32 rasapi32 rasdlg rassapi rpcrt4 setupapi shell32 shfolder snmpapi sporder tapi32 url user32 vdmdbg version win32spl winmm wintrust wsock32,;t t
-s,@COMMON_MACROS@,WIN32_LEAN_AND_MEAN WIN32,;t t
-s,@COMMON_HEADERS@,winsock2.h windows.h,;t t
-s,@cleanlibs@,$$*.tds,;t t
-s,@cleanobjs@,$$*-$$(arch).def $$*.il? $$*.lib,;t t
-s,@TRY_LINK@,$$(CC) -oconftest $$(INCFLAGS) -I$$(hdrdir) $$(CPPFLAGS) $$(CFLAGS) $$(LIBPATH) $$(LDFLAGS) $$(src) $$(LOCAL_LIBS) $$(LIBS),;t t
-s,@EXPORT_PREFIX@,_,;t t
-s,@arch@,$(ARCH)-$(OS),;t t
-s,@sitearch@,$(ARCH)-$(OS),;t t
-s,@sitedir@,$${prefix}/lib/ruby/site_ruby,;t t
-s,@vendordir@,$${prefix}/lib/ruby/vendor_ruby,;t t
-s,@rubyhdrdir@,$$(includedir)/ruby-$$(MAJOR).$$(MINOR).$$(TEENY),;t t
-s,@sitehdrdir@,$$(rubyhdrdir)/site_ruby,;t t
-s,@vendorhdrdir@,$$(rubyhdrdir)/vendor_ruby,;t t
-s,@configure_args@,--enable-shared $(configure_args),;t t
-s,@configure_input@,$$configure_input,;t t
-s,@srcdir@,$(srcdir),;t t
-s,@top_srcdir@,$(srcdir),;t t
-|
-
-miniruby$(EXEEXT):
-		@echo $(LIBS)
-		$(LD) $(LDFLAGS) $(XLDFLAGS) $(MAINOBJ) $(MINIOBJS) $(COMMONOBJS:/=\) $(DMYEXT),$@,nul,$(LIBS)
-
-$(PROGRAM):	$(MAINOBJ) $(LIBRUBY_SO) $(RUBY_INSTALL_NAME).res
-		$(LD) $(LDFLAGS) $(XLDFLAGS) $(MAINOBJ),$@,nul,$(LIBRUBYARG) $(LIBS),,$(RUBY_INSTALL_NAME).res
-
-$(WPROGRAM):	$(MAINOBJ) $(WINMAINOBJ) $(LIBRUBY_SO) $(RUBYW_INSTALL_NAME).res
-		$(LD) $(LDFLAGS) $(WLDFLAGS) $(MAINOBJ) $(WINMAINOBJ),$@,nul,$(LIBRUBYARG) $(LIBS),,$(RUBYW_INSTALL_NAME).res
-
-$(LIBRUBY_A):	$(OBJS) $(DMYEXT)
-		@-if exist $@ del $@
-		$(AR) $(ARFLAGS) "$@" $(OBJS) $(DMYEXT)
-
-# $(LIBRUBY):	$(LIBRUBY_SO)
-#		implib $@ $(LIBRUBY_SO)
-
-$(LIBRUBY_SO): $(LIBRUBY_A) $(DLDOBJS) $(RUBYDEF) $(RUBY_SO_NAME).res
-		@echo $(DLDOBJS)
-		@$(PRE_LIBRUBY_UPDATE)
-		$(LIBRUBY_LDSHARED) $(LIBRUBY_DLDFLAGS) $(DLDOBJS:/=\),$(LIBRUBY_SO),nul,$(LIBRUBY_A) $(LIBS),$(RUBYDEF),$(RUBY_SO_NAME).res
-
-$(LIBRUBY): $(LIBRUBY_SO)
-
-$(RUBYDEF):	$(LIBRUBY_A) $(PREP)
-		$(MINIRUBY) $(srcdir)/bcc32/mkexports.rb -output=$@ -base=$(RUBY_SO_NAME) $(LIBRUBY_A)
-
-$(RUBY_INSTALL_NAME).rc $(RUBYW_INSTALL_NAME).rc $(RUBY_SO_NAME).rc: rbconfig.rb $(srcdir)/revision.h $(srcdir)/win32/resource.rb
-		@$(MINIRUBY) $(srcdir)/win32/resource.rb \
-			-ruby_name=$(RUBY_INSTALL_NAME) \
-			-rubyw_name=$(RUBYW_INSTALL_NAME) \
-			-so_name=$(RUBY_SO_NAME) \
-			. $(icondirs) $(srcdir)/win32
-
-lex.c: {$(srcdir)}lex.c.blt
-	copy "$(?:/=\)" $@
-
-post-install-bin::
-	@$(NULLCMD)
-post-install-lib::
-	@$(NULLCMD)
-post-install-ext-comm::
-	@$(NULLCMD)
-post-install-ext-arch::
-	@$(NULLCMD)
-post-install-man::
-	@$(NULLCMD)
-post-install-doc::
-	@$(NULLCMD)
-
-clean-local::
-		@$(RM) $(WINMAINOBJ) ext\extinit.c ext\extinit.$(OBJEXT) *.tds *.il? $(RUBY_SO_NAME).lib
-		@$(RM) $(RUBY_INSTALL_NAME).res $(RUBYW_INSTALL_NAME).res $(RUBY_SO_NAME).res
-		@$(RM) *.map *.pdb *.ilk *.exp $(RUBYDEF) ext\ripper\y.output
-
-distclean-local::
-		@$(RM) ext\config.cache $(RBCONFIG:/=\)
-		@$(RM) $(RUBY_INSTALL_NAME).rc $(RUBYW_INSTALL_NAME).rc $(RUBY_SO_NAME).rc
-
-clean-ext distclean-ext realclean-ext::
-		@for /R ext %I in (.) do @if exist %I\Makefile ( \
-		    echo $(@:-ext=)ing %~nI & \
-		    cd %I & \
-		    $(MAKE) $(MFLAGS) $(@:-ext=) & \
-		    cd %CD% \
-		)
-
-ext/extinit.obj: ext/extinit.c $(SETUP)
-	$(CC) $(CFLAGS) $(XCFLAGS) $(CPPFLAGS) $(COUTFLAG)$@ -c ext/extinit.c
-
-main.$(OBJEXT): win32.h
-ascii.$(OBJEXT): win32.h
-array.$(OBJEXT): win32.h
-bignum.$(OBJEXT): win32.h
-class.$(OBJEXT): win32.h
-compar.$(OBJEXT): win32.h
-dir.$(OBJEXT): dir.h win32.h
-dln.$(OBJEXT): win32.h
-enum.$(OBJEXT): win32.h
-error.$(OBJEXT): win32.h
-euc_jp.$(OBJEXT): win32.h
-eval.$(OBJEXT): win32.h
-file.$(OBJEXT): win32.h
-gc.$(OBJEXT): win32.h
-hash.$(OBJEXT): win32.h
-inits.$(OBJEXT): win32.h
-io.$(OBJEXT): win32.h
-marshal.$(OBJEXT): win32.h
-math.$(OBJEXT): win32.h
-numeric.$(OBJEXT): win32.h
-object.$(OBJEXT): win32.h
-pack.$(OBJEXT): win32.h
-parse.$(OBJEXT): win32.h
-process.$(OBJEXT): win32.h
-prec.$(OBJEXT): win32.h
-random.$(OBJEXT): win32.h
-range.$(OBJEXT): win32.h
-re.$(OBJEXT): win32.h
-regcomp.$(OBJEXT): win32.h
-regenc.$(OBJEXT): win32.h
-regerror.$(OBJEXT): win32.h
-regexec.$(OBJEXT): win32.h
-reggnu.$(OBJEXT): win32.h
-regparse.$(OBJEXT): win32.h
-ruby.$(OBJEXT): win32.h
-signal.$(OBJEXT): win32.h
-sjis.$(OBJEXT): win32.h
-sprintf.$(OBJEXT): win32.h
-st.$(OBJEXT): win32.h
-string.$(OBJEXT): win32.h
-struct.$(OBJEXT): win32.h
-time.$(OBJEXT): win32.h
-utf_8.$(OBJEXT): win32.h
-util.$(OBJEXT): win32.h
-variable.$(OBJEXT): win32.h
-version.$(OBJEXT): win32.h
diff --git a/bcc32/README.bcc32 b/bcc32/README.bcc32
deleted file mode 100644
index cd33eec0a1..0000000000
--- a/bcc32/README.bcc32
+++ /dev/null
@@ -1,130 +0,0 @@
-=begin
-
-= How to build ruby using Borland C++
-
-== Requirement
-
-(1) Borland C++ 5.0 or later.
-
-(2) Please set environment variable (({PATH}))
-    to run required commands properly from the command line.
-
-    Note: building ruby requires following commands.
-     * make
-     * bcc32
-     * tlib
-     * ilink32
-
-(3) If you want to build from CVS source, following commands are required.
-     * bison ((<URL:http://gnuwin32.sourceforge.net/packages/bison.htm>))
-     * sed   ((<URL:http://gnuwin32.sourceforge.net/packages/sed.htm>))
-
-(4) We strongly recommend to build ruby on C++Builder, to link following files.
-     * usebormm.lib
-     * memmgr.lib
-
-    RTL's internal memory manager cannot handle large memory block properly,
-    so we should use borlndmm.dll instead.
-     10000.times { "" << "." * 529671; GC.start } # crash
-
-== How to compile and install
-
-(1) Execute bcc32\configure.bat on your build directory.
-     ex. c:\src\ruby> bcc32\configure.bat
-    You can specify the target platform as an argument.
-    For example, run `((%configure i686-bccwin32%))'
-    You can also specify the install directory.
-    For example, run `((%configure --prefix=<install_directory>%))'
-    Default of the install directory is /usr .
-    The default ((|<PLATFORM>|)) is `(({i386-bccwin32}))'.
-     
-(2) Change ((|RUBY_INSTALL_NAME|)) and ((|RUBY_SO_NAME|)) in (({Makefile}))
-    if you want to change the name of the executable files. 
-    And add ((|RUBYW_INSTALL_NAME|)) to change the name of the
-    executable without console window if also you want.
-
-(3) Run `((%make%))'
-
-(4) Run `((%make test%))'
-
-(5) Run `((%make install%))'
-
-(6) Requires dynamic RTL (cc3250.dll on C++Builder5) and borlndmm.dll (If built with
-    usebormm.lib) to use installed binary. These files are ordinary in bcc32's bin
-    directory.
-
-== Icons
-
-Any icon files(*.ico) in the build directory, directories specified with
-((|icondirs|)) make variable and (({win32})) directory under the ruby
-source directory will be included in DLL or executable files, according
-to their base names.
-    $(RUBY_INSTALL_NAME).ico or ruby.ico   --> $(RUBY_INSTALL_NAME).exe
-    $(RUBYW_INSTALL_NAME).ico or rubyw.ico --> $(RUBYW_INSTALL_NAME).exe
-    the others                             --> $(RUBY_SO_NAME).dll
-
-Although no icons are distributed with the ruby source or in the official 
-site, you can use anything you like. For example, followings are written 
-in Japanese, but you can download at least.
-
-* ((<URL:http://member.nifty.ne.jp/ueivu/rubyico.html>)) or
-  ((<zipped icons|URL:http://member.nifty.ne.jp/ueivu/Ruby_ico.zip>))
-* ((<URL:http://homepage1.nifty.com/a_nakata/ruby/>)) or
-  ((<icon itself|URL:http://homepage1.nifty.com/a_nakata/ruby/RubyIcon.ico>))
-
-== Build examples
-
-* Build on the ruby source directory.
-
-  ex.)
-    ruby source directory:  C:\ruby
-    build directory:        C:\ruby
-    install directory:      C:\usr\local
-
-    C:
-    cd \ruby
-    bcc32\configure --prefix=/usr/local
-    make
-    make test
-    make install
-
-* Build on the relative directory from the ruby source directory and CPU type 
-  i386.
-
-  ex.)
-    ruby source directory:  C:\ruby
-    build directory:        C:\ruby\bccwin32
-    install directory:      C:\usr\local
-    CPU                     i386
-    
-    C:
-    cd \ruby
-    mkdir bccwin32
-    cd bccwin32
-    ..\bcc32\configure --prefix=/usr/local
-    make
-    make test
-    make install
-
-* Build on the different drive.
-
-  ex.)
-    ruby source directory:  C:\src\ruby
-    build directory:        D:\build\ruby
-    install directory:      C:\usr\local
-
-    D:
-    cd D:\build\ruby
-    C:\src\ruby\bcc32\configure --prefix=C:/usr/local
-    make
-    make test
-    make install
-
-== Bugs
-
-You can ((*NOT*)) use a path name contains any white space characters as
-the ruby source directory, this restriction comes from the behavior of
-(({!INCLUDE})) directives of (({MAKE})).
-((- you may call it a bug. -))
-
-=end
diff --git a/bcc32/configure.bat b/bcc32/configure.bat
deleted file mode 100755
index 8cdfc64b03..0000000000
--- a/bcc32/configure.bat
+++ /dev/null
@@ -1,163 +0,0 @@
-@echo off

-::: Don't set environment variable in batch file other than autoexec.bat

-::: to avoid "Out of environment space" problem on Windows 95/98.

-::: set TMPMAKE=~tmp~.mak

-

-echo> ~tmp~.mak ####

-echo>> ~tmp~.mak conf = %0

-echo>> ~tmp~.mak $(conf:\=/): nul

-echo>> ~tmp~.mak 	@del ~setup~.mak

-echo>> ~tmp~.mak 	@-$(MAKE) -l$(MAKEFLAGS) -f $(@D)setup.mak \

-if exist pathlist.tmp del pathlist.tmp

-if exist confargs.mk del confargs.mk

-:loop

-if "%1" == "" goto :end

-if "%1" == "--prefix" goto :prefix

-if "%1" == "prefix" goto :prefix

-if "%1" == "--srcdir" goto :srcdir

-if "%1" == "srcdir" goto :srcdir

-if "%1" == "--target" goto :target

-if "%1" == "target" goto :target

-if "%1" == "--with-static-linked-ext" goto :extstatic

-if "%1" == "--program-suffix" goto :suffix

-if "%1" == "RUBY_SUFFIX" goto :suffix

-if "%1" == "--program-name" goto :installname

-if "%1" == "--install-name" goto :installname

-if "%1" == "RUBY_INSTALL_NAME" goto :installname

-if "%1" == "--so-name" goto :soname

-if "%1" == "RUBY_SO_NAME" goto :soname

-if "%1" == "--enable-install-doc" goto :enable-rdoc

-if "%1" == "--disable-install-doc" goto :disable-rdoc

-if "%1" == "--extout" goto :extout

-if "%1" == "EXTOUT" goto :extout

-if "%1" == "--with-baseruby" goto :baseruby

-if "%1" == "BASERUBY" goto :baseruby

-if "%1" == "--path" goto :path

-if "%1" == "-h" goto :help

-if "%1" == "--help" goto :help

-  echo>>confargs.tmp 	%1 \

-  shift

-goto :loop

-:srcdir

-  echo>> ~tmp~.mak 	-Dsrcdir=%2 \

-  echo>>confargs.tmp 	--srcdir=%2 \

-  shift

-  shift

-goto :loop

-:prefix

-  echo>> ~tmp~.mak 	-Dprefix=%2 \

-  echo>>confargs.tmp 	%1=%2 \

-  shift

-  shift

-goto :loop

-:suffix

-  echo>>confargs.mk !ifndef RUBY_SUFFIX

-  echo>>confargs.mk RUBY_SUFFIX = %2

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1=%2 \

-  shift

-  shift

-goto :loop

-:installname

-  echo>>confargs.mk !ifndef RUBY_INSTALL_NAME

-  echo>>confargs.mk RUBY_INSTALL_NAME = %2

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1=%2 \

-  shift

-  shift

-goto :loop

-:soname

-  echo>>confargs.mk !ifndef RUBY_SO_NAME

-  echo>>confargs.mk RUBY_SO_NAME = %2

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1=%2 \

-  shift

-  shift

-goto :loop

-:target

-  echo>> ~tmp~.mak 	%2 \

-  echo>>confargs.tmp 	--target=%2 \

-  shift

-  shift

-goto :loop

-:extstatic

-  echo>>confargs.mk !ifndef EXTSTATIC

-  echo>>confargs.mk EXTSTATIC = static

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1 \

-  shift

-goto :loop

-:enable-rdoc

-  echo>>confargs.mk !ifndef RDOCTARGET

-  echo>>confargs.mk RDOCTARGET = install-doc

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1 \

-  shift

-goto :loop

-:disable-rdoc

-  echo>>confargs.mk !ifndef RDOCTARGET

-  echo>>confargs.mk RDOCTARGET = install-nodoc

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1 \

-  shift

-goto :loop

-:extout

-  echo>>confargs.mk !ifndef EXTOUT

-  echo>>confargs.mk EXTOUT = %2

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1=%2 \

-  shift

-  shift

-goto :loop

-:baseruby

-  echo>>confargs.mk !ifndef BASERUBY

-  echo>>confargs.mk BASERUBY = %2

-  echo>>confargs.mk !endif

-  echo>>confargs.tmp 	%1=%2 \

-  shift

-  shift

-goto :loop

-:path

-  echo>>pathlist.tmp %2;\

-  echo>>confargs.tmp 	%1=%2 \

-  shift

-  shift

-goto :loop

-:help

-  echo Configuration:

-  echo   --help                  display this help

-  echo   --srcdir=DIR            find the sources in DIR [configure dir or `..']

-  echo Installation directories:

-  echo   --prefix=PREFIX         install files in PREFIX (ignored currently)

-  echo System types:

-  echo   --target=TARGET         configure for TARGET [i386-bccwin32]

-  echo Optional Package:

-  echo   --with-baseruby=RUBY    use RUBY as baseruby [ruby]

-  echo   --with-static-linked-ext link external modules statically

-  echo   --enable-install-doc    install rdoc indexes during install

-  del *.tmp

-  del ~tmp~.mak

-goto :exit

-:end

-echo>> ~tmp~.mak 	-Dbcc32dir=$(@D)

-if not exist confargs.tmp goto :noconfargs

-    echo>>confargs.mk configure_args = \

-    type>>confargs.mk confargs.tmp

-    echo.>>confargs.mk

-    echo>>confargs.mk ####

-:noconfargs

-if not exist pathlist.tmp goto :nopathlist

-    echo>>confargs.mk pathlist = \

-    type>>confargs.mk pathlist.tmp

-    echo.>>confargs.mk

-    echo>>confargs.mk ####

-    echo>>confargs.mk PATH = $(pathlist:;=/bin;)$(PATH)

-    echo>>confargs.mk INCLUDE = $(pathlist:;=/include;)

-    echo>>confargs.mk LIB = $(pathlist:;=/lib;)

-:nopathlist

-if exist confargs.mk copy confargs.mk ~setup~.mak > nul

-type>>~setup~.mak ~tmp~.mak

-del *.tmp > nul

-del ~tmp~.mak > nul

-make -s -f ~setup~.mak

-:exit

diff --git a/bcc32/mkexports.rb b/bcc32/mkexports.rb
deleted file mode 100755
index 888ab2e2a6..0000000000
--- a/bcc32/mkexports.rb
+++ /dev/null
@@ -1,26 +0,0 @@
-#!./miniruby -s
-
-$:.unshift(File.expand_path("../..", __FILE__))
-require 'win32/mkexports'
-
-class Exports::Bcc < Exports
-  def forwarding(internal, export)
-    internal[/\A_?/]+export
-  end
-
-  def each_line(objs, &block)
-    objs.each do |obj|
-      opt = /\.(?:so|dll)\z/i =~ obj ? "-ee" : "-oiPUBDEF -oiPUBD32"
-      IO.foreach("|tdump -q #{opt} #{obj.tr('/', '\\')} < nul", &block)
-    end
-  end
-
-  def each_export(objs)
-    objdump(objs) do |l|
-      next unless /(?:PUBDEF|PUBD32|EXPORT)/ =~ l
-      yield $1 if /'(.*?)'/ =~ l
-    end
-    yield "_strcasecmp", "_stricmp"
-    yield "_strncasecmp", "_strnicmp"
-  end
-end
diff --git a/bcc32/setup.mak b/bcc32/setup.mak
deleted file mode 100644
index df2fd3c128..0000000000
--- a/bcc32/setup.mak
+++ /dev/null
@@ -1,179 +0,0 @@
-# -*- makefile -*-
-
-!if "$(srcdir)" != ""
-bcc32dir = $(srcdir)/bcc32
-!elseif "$(bcc32dir)" == "bcc32/"
-srcdir = .
-!elseif "$(bcc32dir:/bcc32/=)/bcc32/" == "$(bcc32dir)"
-srcdir = $(bcc32dir:/bcc32/=)
-!else
-srcdir = $(bcc32dir)/..
-!endif
-!ifndef prefix
-prefix = /usr
-!endif
-OS = bccwin32
-RT = $(OS)
-BANG = !
-APPEND = echo.>>$(MAKEFILE)
-!ifdef MAKEFILE
-MAKE = $(MAKE) -f $(MAKEFILE)
-!else
-MAKEFILE = Makefile
-!endif
-
-all: Makefile
-Makefile: -prologue- -generic- -epilogue-
-i386-$(OS): -prologue- -i386- -epilogue-
-i486-$(OS): -prologue- -i486- -epilogue-
-i586-$(OS): -prologue- -i586- -epilogue-
-i686-$(OS): -prologue- -i686- -epilogue-
-alpha-$(OS): -prologue- -alpha- -epilogue-
-
--prologue-: -basic-vars- -version- -system-vars-
-
--basic-vars-: nul
-	@echo Creating $(MAKEFILE)
-	@type > $(MAKEFILE) &&|
-\#\#\# Makefile for ruby $(OS) \#\#\#
-$(BANG)ifndef srcdir
-srcdir = $(srcdir:\=/)
-$(BANG)endif
-$(BANG)ifndef prefix
-prefix = $(prefix:\=/)
-$(BANG)endif
-$(BANG)if !defined(BASERUBY)
-!if defined(BASERUBY)
-BASERUBY = $(BASERUBY)
-!endif
-|
-!if !defined(BASERUBY)
-	@for %I in (ruby.exe) do @echo BASERUBY = "%~$$PATH:I" >> $(MAKEFILE)
-!endif
-	@type >> $(MAKEFILE) &&|
-$(BANG)endif
-|
-!if exist(confargs.mk)
-	@type confargs.mk >> $(MAKEFILE)
-	@del confargs.mk
-!endif
-
--system-vars-: -runtime- -bormm-
-
--bormm-: nul
-	@-ilink32 -q -Gn -x usebormm.lib > nul
-	@-if exist usebormm.tds $(APPEND) MEMLIB = usebormm.lib
-	@if exist usebormm.* del usebormm.*
-
--osname-: nul
-	@echo OS =  >>$(MAKEFILE)
-
--runtime-: nul
-	type > conftest.c &&|
-\#include <stdio.h>
-int main(){printf("");return 0;}
-|
-	bcc32 conftest.c cw32i.lib > nul
-	tdump conftest.exe < nul > conftest.i
-	grep "^Imports from CC" conftest.i > conftest.c
-	cpp32 -P- -DFile=\# -DImports=RTNAME -Dfrom== conftest.c > nul
-	$(MAKE) > nul -DBANG=$(BANG) -f &&|
--runtime-: nul
-$(BANG)include conftest.i
-RT = $$(RTNAME:.DLL=)
-OS = $$(RT:CC32=)
--runtime-:
-	del conftest.*
-$(BANG)if "$$(OS)" == "50"
-	echo OS = bccwin32 >> $(MAKEFILE)
-$(BANG)else
-	echo OS = bccwin32_$$(OS) >> $(MAKEFILE)
-$(BANG)endif
-|
-	@echo RT = $$(OS) >> $(MAKEFILE)
-
--version-: nul
-	@cpp32 -I$(srcdir) -P- -o$(MAKEFILE) > nul &&|
-\#define RUBY_REVISION 0
-\#include "version.h"
-MAJOR = RUBY_API_VERSION_MAJOR
-MINOR = RUBY_API_VERSION_MINOR
-TEENY = RUBY_API_VERSION_TEENY
-
-BORLANDC = __BORLANDC__
-|
-	@$(MAKE) > nul -DBANG=$(BANG) -f &&,
--version-: nul
-$(BANG)include $(MAKEFILE)
-$(BANG)include $(MAKEFILE).i
--version-:
-	@del $(MAKEFILE).i
-	@type >> $(MAKEFILE) &&|
-MAJOR = $$(MAJOR)
-MINOR = $$(MINOR)
-TEENY = $$(TEENY)
-BORLANDC = $$(BORLANDC)
-|
-,
-
--generic-: nul
-!if defined(PROCESSOR_ARCHITECTURE) ||  defined(PROCESSOR_LEVEL)
-	@type >> $(MAKEFILE) &&|
-!if defined(PROCESSOR_ARCHITECTURE)
-$(BANG)ifndef PROCESSOR_ARCHITECTURE
-PROCESSOR_ARCHITECTURE = $(PROCESSOR_ARCHITECTURE)
-$(BANG)endif
-!endif
-!if defined(PROCESSOR_LEVEL)
-$(BANG)ifndef PROCESSOR_LEVEL
-PROCESSOR_LEVEL = $(PROCESSOR_LEVEL)
-$(BANG)endif
-!endif
-|
-!endif
-
--alpha-: nul
-	@$(APPEND) !ifndef PROCESSOR_ARCHITECTURE
-	@$(APPEND) PROCESSOR_ARCHITECTURE = alpha
-	@$(APPEND) !endif
--ix86-: nul
-	@$(APPEND) !ifndef PROCESSOR_ARCHITECTURE
-	@$(APPEND) PROCESSOR_ARCHITECTURE = x86
-	@$(APPEND) !endif
-
--i386-: -ix86-
-	@$(APPEND) !ifndef PROCESSOR_LEVEL
-	@$(APPEND) PROCESSOR_LEVEL = 3
-	@$(APPEND) !endif
--i486-: -ix86-
-	@$(APPEND) !ifndef PROCESSOR_LEVEL
-	@$(APPEND) PROCESSOR_LEVEL = 4
-	@$(APPEND) !endif
--i586-: -ix86-
-	@$(APPEND) !ifndef PROCESSOR_LEVEL
-	@$(APPEND) PROCESSOR_LEVEL = 5
-	@$(APPEND) !endif
--i686-: -ix86-
-	@$(APPEND) !ifndef PROCESSOR_LEVEL
-	@$(APPEND) PROCESSOR_LEVEL = 6
-	@$(APPEND) !endif
-
--epilogue-: -encs-
-
--encs-: nul
-	@$(MAKE) -f $(srcdir)/win32/enc-setup.mak srcdir="$(srcdir)" MAKEFILE=$(MAKEFILE)
-
--epilogue-: nul
-	@type >> $(MAKEFILE) &&|
-
-\# RUBY_INSTALL_NAME = ruby
-\# RUBY_SO_NAME = $$(RT)-$$(RUBY_INSTALL_NAME)$$(MAJOR)$$(MINOR)
-\# CFLAGS = -q $$(DEBUGFLAGS) $$(OPTFLAGS) $$(PROCESSOR_FLAG) -w- -wsus -wcpt -wdup -wext -wrng -wrpt -wzdi
-\# CPPFLAGS = -I. -I$$(srcdir) -I$$(srcdir)/missing -DLIBRUBY_SO=\"$$(LIBRUBY_SO)\"
-\# STACK = 0x2000000
-\# LDFLAGS = -S:$$(STACK)
-\# RFLAGS = $$(iconinc)
-\# EXTLIBS = cw32.lib import32.lib user32.lib kernel32.lib
-$(BANG)include $$(srcdir)/bcc32/Makefile.sub
-|
-	@echo type "`$(MAKE)'" to make ruby for $(OS).
diff --git a/benchmark/README.md b/benchmark/README.md
new file mode 100644
index 0000000000..e11381cad9
--- /dev/null
+++ b/benchmark/README.md
@@ -0,0 +1,74 @@
+# ruby/benchmark
+
+This directory has benchmark definitions to be run with
+[benchmark\_driver.gem](https://github.com/benchmark-driver/benchmark-driver).
+
+## Normal usage
+
+Execute `gem install benchmark_driver` and run a command like:
+
+```bash
+# Run a benchmark script with the ruby in the $PATH
+benchmark-driver benchmark/app_fib.rb
+
+# Run benchmark scripts with multiple Ruby executables or options
+benchmark-driver benchmark/*.rb -e /path/to/ruby -e '/path/to/ruby --jit'
+
+# Or compare Ruby versions managed by rbenv
+benchmark-driver benchmark/*.rb --rbenv '2.5.1;2.6.0-preview2 --jit'
+
+# You can collect many metrics in many ways
+benchmark-driver benchmark/*.rb --runner memory --output markdown
+
+# Some are defined with YAML for complex setup or accurate measurement
+benchmark-driver benchmark/*.yml
+```
+
+See also:
+
+```console
+Usage: benchmark-driver [options] RUBY|YAML...
+    -r, --runner TYPE                Specify runner type: ips, time, memory, once, block (default: ips)
+    -o, --output TYPE                Specify output type: compare, simple, markdown, record, all (default: compare)
+    -e, --executables EXECS          Ruby executables (e1::path1 arg1; e2::path2 arg2;...)
+        --rbenv VERSIONS             Ruby executables in rbenv (x.x.x arg1;y.y.y arg2;...)
+        --repeat-count NUM           Try benchmark NUM times and use the fastest result or the worst memory usage
+        --repeat-result TYPE         Yield "best", "average" or "worst" result with --repeat-count (default: best)
+        --alternate                  Alternate executables instead of running the same executable in a row with --repeat-count
+        --bundler                    Install and use gems specified in Gemfile
+        --filter REGEXP              Filter out benchmarks with given regexp
+        --run-duration SECONDS       Warmup estimates loop_count to run for this duration (default: 3)
+        --timeout SECONDS            Timeout ruby command execution with timeout(1)
+    -v, --verbose                    Verbose mode. Multiple -v options increase visilibity (max: 2)
+```
+
+## make benchmark
+
+Using `make benchmark`, `make update-benchmark-driver` automatically downloads
+the supported version of benchmark\_driver, and it runs benchmarks with the downloaded
+benchmark\_driver.
+
+```bash
+# Run all benchmarks with the ruby in the $PATH and the built ruby
+make benchmark
+
+# Or compare with specific ruby binary
+make benchmark COMPARE_RUBY="/path/to/ruby --jit"
+
+# Run vm benchmarks
+make benchmark ITEM=vm
+
+# Run some limited benchmarks in ITEM-matched files
+make benchmark ITEM=vm OPTS=--filter=block
+
+# You can specify the benchmark by an exact filename instead of using the default argument:
+# ARGS = $$(find $(srcdir)/benchmark -maxdepth 1 -name '*$(ITEM)*.yml' -o -name '*$(ITEM)*.rb')
+make benchmark ARGS=benchmark/erb_render.yml
+
+# You can specify any option via $OPTS
+make benchmark OPTS="--help"
+
+# With `make benchmark`, some special runner plugins are available:
+#   -r peak, -r size, -r total, -r utime, -r stime, -r cutime, -r cstime
+make benchmark ITEM=vm_bigarray OPTS="-r peak"
+```
diff --git a/benchmark/bm_app_answer.rb b/benchmark/app_answer.rb
index 3cd8a8fd37..3cd8a8fd37 100644
--- a/benchmark/bm_app_answer.rb
+++ b/benchmark/app_answer.rb
diff --git a/benchmark/app_aobench.rb b/benchmark/app_aobench.rb
new file mode 100644
index 0000000000..16296af12b
--- /dev/null
+++ b/benchmark/app_aobench.rb
@@ -0,0 +1,297 @@
+# coding: US-ASCII
+
+# AO render benchmark
+# Original program (C) Syoyo Fujita in Javascript (and other languages)
+#      https://code.google.com/p/aobench/
+# Ruby(yarv2llvm) version by Hideki Miura
+#
+
+IMAGE_WIDTH = 256
+IMAGE_HEIGHT = 256
+NSUBSAMPLES = 2
+NAO_SAMPLES = 8
+
+srand(0)
+
+class Vec
+  def initialize(x, y, z)
+    @x = x
+    @y = y
+    @z = z
+  end
+
+  attr_accessor :x, :y, :z
+
+  def vadd(b)
+    Vec.new(@x + b.x, @y + b.y, @z + b.z)
+  end
+
+  def vsub(b)
+    Vec.new(@x - b.x, @y - b.y, @z - b.z)
+  end
+
+  def vcross(b)
+    Vec.new(@y * b.z - @z * b.y,
+            @z * b.x - @x * b.z,
+            @x * b.y - @y * b.x)
+  end
+
+  def vdot(b)
+    @x * b.x + @y * b.y + @z * b.z
+  end
+
+  def vlength
+    Math.sqrt(@x * @x + @y * @y + @z * @z)
+  end
+
+  def vnormalize
+    len = vlength
+    v = Vec.new(@x, @y, @z)
+    if len > 1.0e-17 then
+      v.x = v.x / len
+      v.y = v.y / len
+      v.z = v.z / len
+    end
+    v
+  end
+end
+
+
+class Sphere
+  def initialize(center, radius)
+    @center = center
+    @radius = radius
+  end
+
+  attr_reader :center, :radius
+
+  def intersect(ray, isect)
+    rs = ray.org.vsub(@center)
+    b = rs.vdot(ray.dir)
+    c = rs.vdot(rs) - (@radius * @radius)
+    d = b * b - c
+    if d > 0.0 then
+      t = - b - Math.sqrt(d)
+
+      if t > 0.0 and t < isect.t then
+        isect.t = t
+        isect.hit = true
+        isect.pl = Vec.new(ray.org.x + ray.dir.x * t,
+                          ray.org.y + ray.dir.y * t,
+                          ray.org.z + ray.dir.z * t)
+        n = isect.pl.vsub(@center)
+        isect.n = n.vnormalize
+      else
+        0.0
+      end
+    end
+    nil
+  end
+end
+
+class Plane
+  def initialize(p, n)
+    @p = p
+    @n = n
+  end
+
+  def intersect(ray, isect)
+    d = -@p.vdot(@n)
+    v = ray.dir.vdot(@n)
+    v0 = v
+    if v < 0.0 then
+      v0 = -v
+    end
+    if v0 < 1.0e-17 then
+      return
+    end
+
+    t = -(ray.org.vdot(@n) + d) / v
+
+    if t > 0.0 and t < isect.t then
+      isect.hit = true
+      isect.t = t
+      isect.n = @n
+      isect.pl = Vec.new(ray.org.x + t * ray.dir.x,
+                        ray.org.y + t * ray.dir.y,
+                        ray.org.z + t * ray.dir.z)
+    end
+    nil
+  end
+end
+
+class Ray
+  def initialize(org, dir)
+    @org = org
+    @dir = dir
+  end
+
+  attr_accessor :org, :dir
+end
+
+class Isect
+  def initialize
+    @t = 10000000.0
+    @hit = false
+    @pl = Vec.new(0.0, 0.0, 0.0)
+    @n = Vec.new(0.0, 0.0, 0.0)
+  end
+
+  attr_accessor :t, :hit, :pl, :n
+end
+
+def clamp(f)
+  i = f * 255.5
+  if i > 255.0 then
+    i = 255.0
+  end
+  if i < 0.0 then
+    i = 0.0
+  end
+  i.to_i
+end
+
+def otherBasis(basis, n)
+  basis[2] = Vec.new(n.x, n.y, n.z)
+  basis[1] = Vec.new(0.0, 0.0, 0.0)
+
+  if n.x < 0.6 and n.x > -0.6 then
+    basis[1].x = 1.0
+  elsif n.y < 0.6 and n.y > -0.6 then
+    basis[1].y = 1.0
+  elsif n.z < 0.6 and n.z > -0.6 then
+    basis[1].z = 1.0
+  else
+    basis[1].x = 1.0
+  end
+
+  basis[0] = basis[1].vcross(basis[2])
+  basis[0] = basis[0].vnormalize
+
+  basis[1] = basis[2].vcross(basis[0])
+  basis[1] = basis[1].vnormalize
+end
+
+class Scene
+  def initialize
+    @spheres = Array.new
+    @spheres[0] = Sphere.new(Vec.new(-2.0, 0.0, -3.5), 0.5)
+    @spheres[1] = Sphere.new(Vec.new(-0.5, 0.0, -3.0), 0.5)
+    @spheres[2] = Sphere.new(Vec.new(1.0, 0.0, -2.2), 0.5)
+    @plane = Plane.new(Vec.new(0.0, -0.5, 0.0), Vec.new(0.0, 1.0, 0.0))
+  end
+
+  def ambient_occlusion(isect)
+    basis = Array.new
+    otherBasis(basis, isect.n)
+
+    ntheta    = NAO_SAMPLES
+    nphi      = NAO_SAMPLES
+    eps       = 0.0001
+    occlusion = 0.0
+
+    p0 = Vec.new(isect.pl.x + eps * isect.n.x,
+                isect.pl.y + eps * isect.n.y,
+                isect.pl.z + eps * isect.n.z)
+    nphi.times do |j|
+      ntheta.times do |i|
+        r = rand
+        phi = 2.0 * 3.14159265 * rand
+        x = Math.cos(phi) * Math.sqrt(1.0 - r)
+        y = Math.sin(phi) * Math.sqrt(1.0 - r)
+        z = Math.sqrt(r)
+
+        rx = x * basis[0].x + y * basis[1].x + z * basis[2].x
+        ry = x * basis[0].y + y * basis[1].y + z * basis[2].y
+        rz = x * basis[0].z + y * basis[1].z + z * basis[2].z
+
+        raydir = Vec.new(rx, ry, rz)
+        ray = Ray.new(p0, raydir)
+
+        occisect = Isect.new
+        @spheres[0].intersect(ray, occisect)
+        @spheres[1].intersect(ray, occisect)
+        @spheres[2].intersect(ray, occisect)
+        @plane.intersect(ray, occisect)
+        if occisect.hit then
+          occlusion = occlusion + 1.0
+        else
+          0.0
+        end
+      end
+    end
+
+    occlusion = (ntheta.to_f * nphi.to_f - occlusion) / (ntheta.to_f * nphi.to_f)
+
+    Vec.new(occlusion, occlusion, occlusion)
+  end
+
+  def render(w, h, nsubsamples)
+    cnt = 0
+    nsf = nsubsamples.to_f
+    h.times do |y|
+      w.times do |x|
+        rad = Vec.new(0.0, 0.0, 0.0)
+
+        # Subsampling
+        nsubsamples.times do |v|
+          nsubsamples.times do |u|
+
+            cnt = cnt + 1
+            wf = w.to_f
+            hf = h.to_f
+            xf = x.to_f
+            yf = y.to_f
+            uf = u.to_f
+            vf = v.to_f
+
+            px = (xf + (uf / nsf) - (wf / 2.0)) / (wf / 2.0)
+            py = -(yf + (vf / nsf) - (hf / 2.0)) / (hf / 2.0)
+
+            eye = Vec.new(px, py, -1.0).vnormalize
+
+            ray = Ray.new(Vec.new(0.0, 0.0, 0.0), eye)
+
+            isect = Isect.new
+            @spheres[0].intersect(ray, isect)
+            @spheres[1].intersect(ray, isect)
+            @spheres[2].intersect(ray, isect)
+            @plane.intersect(ray, isect)
+            if isect.hit then
+              col = ambient_occlusion(isect)
+              rad.x = rad.x + col.x
+              rad.y = rad.y + col.y
+              rad.z = rad.z + col.z
+            end
+          end
+        end
+
+        r = rad.x / (nsf * nsf)
+        g = rad.y / (nsf * nsf)
+        b = rad.z / (nsf * nsf)
+        printf("%c", clamp(r))
+        printf("%c", clamp(g))
+        printf("%c", clamp(b))
+      end
+      nil
+    end
+
+    nil
+  end
+end
+
+alias printf_orig printf
+def printf *args
+  # $fp.printf(*args)
+end
+
+# File.open("ao.ppm", "w") do |fp|
+  # $fp = fp
+  printf("P6\n")
+  printf("%d %d\n", IMAGE_WIDTH, IMAGE_HEIGHT)
+  printf("255\n")
+  Scene.new.render(IMAGE_WIDTH, IMAGE_HEIGHT, NSUBSAMPLES)
+# end
+
+undef printf
+alias printf printf_orig
diff --git a/benchmark/app_erb.yml b/benchmark/app_erb.yml
new file mode 100644
index 0000000000..31e29b7644
--- /dev/null
+++ b/benchmark/app_erb.yml
@@ -0,0 +1,23 @@
+#
+# Create many HTML strings with ERB.
+#
+prelude: |
+  require 'erb'
+
+  data = <<erb
+  <html>
+    <head> <%= title %> </head>
+    <body>
+      <h1> <%= title %> </h1>
+      <p>
+        <%= content %>
+      </p>
+    </body>
+  </html>
+  erb
+
+  title = "hello world!"
+  content = "hello world!\n" * 10
+benchmark:
+  app_erb: ERB.new(data).result(binding)
+loop_count: 15000
diff --git a/benchmark/bm_app_factorial.rb b/benchmark/app_factorial.rb
index 45f471dfdb..45f471dfdb 100644
--- a/benchmark/bm_app_factorial.rb
+++ b/benchmark/app_factorial.rb
diff --git a/benchmark/bm_app_fib.rb b/benchmark/app_fib.rb
index 34a7b2e725..34a7b2e725 100644
--- a/benchmark/bm_app_fib.rb
+++ b/benchmark/app_fib.rb
diff --git a/benchmark/app_lc_fizzbuzz.rb b/benchmark/app_lc_fizzbuzz.rb
new file mode 100644
index 0000000000..f09574bbeb
--- /dev/null
+++ b/benchmark/app_lc_fizzbuzz.rb
@@ -0,0 +1,52 @@
+#
+# FizzBuzz program using only lambda calculus
+#
+# This program is quoted from
+#   "Understanding Computation" by Tom Stuart
+#   http://computationbook.com/
+#
+# You can understand why this program works fine by reading this book.
+#
+
+solution = -> k { -> f { -> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> l { -> x { -> g { -> b { b }[-> p { p[-> x { -> y { x } }] }[l]][x][-> y { g[f[-> l { -> p { p[-> x { -> y { y } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][x][g]][-> l { -> p { p[-> x { -> y { x } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][y] }] } } } }][k][-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> l { -> x { -> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[l][f[x]] } }] } }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[m][n]][-> x { -> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[f[-> n { -> p { -> x { p[n[p][x]] } } }[m]][n]][m][x] }][-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]] } } }][-> p { -> x { p[x] } }][-> p { -> x { p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[x]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]] } }]][-> n { -> b { b }[-> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> p { -> x { p[p[p[p[p[p[p[p[p[p[p[p[p[p[p[x]]]]]]]]]]]]]]] } }]]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]][-> b { b }[-> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> p { -> x { p[p[p[x]]] } }]]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]][-> b { b }[-> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]]][-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> n { -> p { -> x { p[n[p][x]] } } }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]]]][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> n { -> l { -> x { -> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> l { -> x { -> g { -> b { b }[-> p { p[-> x { -> y { x } }] }[l]][x][-> y { g[f[-> l { -> p { p[-> x { -> y { y } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][x][g]][-> l { -> p { p[-> x { -> y { x } }] }[-> p { p[-> x { -> y { y } }] }[l]] }[l]][y] }] } } } }][l][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }[-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][x]][-> l { -> x { -> x { -> y { -> f { f[x][y] } } }[-> x { -> y { y } }][-> x { -> y { -> f { f[x][y] } } }[x][l]] } }] } }[-> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }[-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]]][-> x { -> y { -> f { f[x][y] } } }[-> x { -> y { x } }][-> x { -> y { x } }]][-> x { f[-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { -> n { -> p { -> x { p[n[p][x]] } } }[f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n]][x] }][-> p { -> x { x } }] } } }][n][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]][x] }]][-> f { -> x { f[-> y { x[x][y] }] }[-> x { f[-> y { x[x][y] }] }] }[-> f { -> m { -> n { -> b { b }[-> m { -> n { -> n { n[-> x { -> x { -> y { y } } }][-> x { -> y { x } }] }[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]] } }[n][m]][-> x { f[-> m { -> n { n[-> n { -> p { p[-> x { -> y { x } }] }[n[-> p { -> x { -> y { -> f { f[x][y] } } }[-> p { p[-> x { -> y { y } }] }[p]][-> n { -> p { -> x { p[n[p][x]] } } }[-> p { p[-> x { -> y { y } }] }[p]]] }][-> x { -> y { -> f { f[x][y] } } }[-> p { -> x { x } }][-> p { -> x { x } }]]] }][m] } }[m][n]][n][x] }][m] } } }][n][-> m { -> n { n[-> m { -> n { n[-> n { -> p { -> x { p[n[p][x]] } } }][m] } }[m]][-> p { -> x { x } }] } }[-> p { -> x { p[p[x]] } }][-> p { -> x { p[p[p[p[p[x]]]]] } }]]] } }][n]]]] }]
+
+FIRST     = -> l { LEFT[RIGHT[l]] }
+IF        = -> b { b }
+LEFT      = -> p { p[-> x { -> y { x } } ] }
+RIGHT     = -> p { p[-> x { -> y { y } } ] }
+IS_EMPTY  = LEFT
+REST      = -> l { RIGHT[RIGHT[l]] }
+
+def to_integer(proc)
+  proc[-> n { n + 1 }][0]
+end
+
+def to_boolean(proc)
+  IF[proc][true][false]
+end
+
+def to_array(proc)
+  array = []
+
+  until to_boolean(IS_EMPTY[proc])
+    array.push(FIRST[proc])
+    proc = REST[proc]
+  end
+
+  array
+end
+
+def to_char(c)
+  '0123456789BFiuz'.slice(to_integer(c))
+end
+
+def to_string(s)
+  to_array(s).map { |c| to_char(c) }.join
+end
+
+answer = to_array(solution).map do |p|
+  to_string(p)
+end
+
+answer_ary = answer.to_a
+# puts answer_ary
diff --git a/benchmark/app_mandelbrot.rb b/benchmark/app_mandelbrot.rb
new file mode 100644
index 0000000000..801b75e8e2
--- /dev/null
+++ b/benchmark/app_mandelbrot.rb
@@ -0,0 +1,23 @@
+require 'complex'
+
+def mandelbrot? z
+  i = 0
+  while i<100
+    i += 1
+    z = z * z
+    return false if z.abs > 2
+  end
+  true
+end
+
+ary = []
+
+(0..1000).each{|dx|
+  (0..1000).each{|dy|
+    x = dx / 50.0
+    y = dy / 50.0
+    c = Complex(x, y)
+    ary << c if mandelbrot?(c)
+  }
+}
+
diff --git a/benchmark/app_pentomino.rb b/benchmark/app_pentomino.rb
new file mode 100644
index 0000000000..47be7b203f
--- /dev/null
+++ b/benchmark/app_pentomino.rb
@@ -0,0 +1,130 @@
+#!/usr/local/bin/ruby
+# This program is contributed by Shin Nishiyama
+
+
+# modified by K.Sasada
+
+NP = 5
+ROW = 8 + NP
+COL = 8
+
+$p = []
+$b = []
+$no = 0
+
+def piece(n, a, nb)
+  nb.each{|x|
+    a[n] = x
+    if n == NP-1
+      $p << [a.sort]
+    else
+      nbc=nb.dup
+      [-ROW, -1, 1, ROW].each{|d|
+        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
+          nbc << x+d
+        end
+      }
+      nbc.delete x
+      piece(n+1,a[0..n],nbc)
+    end
+  }
+end
+
+def kikaku(a)
+  a.collect {|x| x - a[0]}
+end
+def ud(a)
+  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
+end
+def rl(a)
+  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
+end
+def xy(a)
+  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
+end
+
+def mkpieces
+  piece(0,[],[0])
+  $p.each do |a|
+    a0 = a[0]
+    a[1] = ud(a0)
+    a[2] = rl(a0)
+    a[3] = ud(rl(a0))
+    a[4] = xy(a0)
+    a[5] = ud(xy(a0))
+    a[6] = rl(xy(a0))
+    a[7] = ud(rl(xy(a0)))
+    a.sort!
+    a.uniq!
+  end
+  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
+end
+
+def mkboard
+  (0...ROW*COL).each{|i|
+    if i % ROW >= ROW-NP
+      $b[i] = -2
+    else
+      $b[i] = -1
+    end
+    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
+  }
+end
+
+def pboard
+  return # skip print
+  print "No. #$no\n"
+  (0...COL).each{|i|
+    print "|"
+    (0...ROW-NP).each{|j|
+      x = $b[i*ROW+j]
+      if x < 0
+        print "..|"
+      else
+        printf "%2d|",x+1
+      end
+    }
+    print "\n"
+  }
+  print "\n"
+end
+
+$pnum=[]
+def setpiece(a,pos)
+  if a.length == $p.length then
+    $no += 1
+    pboard
+    return
+  end
+  while $b[pos] != -1
+    pos += 1
+  end
+  ($pnum - a).each do |i|
+    $p[i].each do |x|
+      f = 0
+      x.each{|s|
+        if $b[pos+s] != -1
+          f=1
+          break
+        end
+      }
+      if f == 0 then
+        x.each{|s|
+          $b[pos+s] = i
+        }
+        a << i
+        setpiece(a.dup, pos)
+        a.pop
+        x.each{|s|
+          $b[pos+s] = -1
+        }
+      end
+    end
+  end
+end
+
+mkpieces
+mkboard
+$p[4] = [$p[4][0]]
+$pnum = (0...$p.length).to_a
+setpiece([],0)
diff --git a/benchmark/app_raise.rb b/benchmark/app_raise.rb
new file mode 100644
index 0000000000..5db8f95d50
--- /dev/null
+++ b/benchmark/app_raise.rb
@@ -0,0 +1,8 @@
+i = 0
+while i<300000
+  i += 1
+  begin
+    raise
+  rescue
+  end
+end
diff --git a/benchmark/app_strconcat.rb b/benchmark/app_strconcat.rb
new file mode 100644
index 0000000000..7eed7c1aed
--- /dev/null
+++ b/benchmark/app_strconcat.rb
@@ -0,0 +1,5 @@
+i = 0
+while i<2_000_000
+  "#{1+1} #{1+1} #{1+1}"
+  i += 1
+end
diff --git a/benchmark/bm_app_tak.rb b/benchmark/app_tak.rb
index efe5380f4e..efe5380f4e 100644
--- a/benchmark/bm_app_tak.rb
+++ b/benchmark/app_tak.rb
diff --git a/benchmark/bm_app_tarai.rb b/benchmark/app_tarai.rb
index 4c146f5ccf..4c146f5ccf 100644
--- a/benchmark/bm_app_tarai.rb
+++ b/benchmark/app_tarai.rb
diff --git a/benchmark/bm_app_uri.rb b/benchmark/app_uri.rb
index 586edfd5dc..586edfd5dc 100644
--- a/benchmark/bm_app_uri.rb
+++ b/benchmark/app_uri.rb
diff --git a/benchmark/array_flatten.yml b/benchmark/array_flatten.yml
new file mode 100644
index 0000000000..88ef544ba0
--- /dev/null
+++ b/benchmark/array_flatten.yml
@@ -0,0 +1,19 @@
+prelude: |
+  small_flat_ary = 5.times.to_a
+  large_flat_ary = 100.times.to_a
+  small_pairs_ary = [[1, 2]] * 5
+  large_pairs_ary = [[1, 2]] * 100
+  mostly_flat_ary = 100.times.to_a.push([101, 102])
+
+benchmark:
+  small_flat_ary.flatten: small_flat_ary.flatten
+  small_flat_ary.flatten!: small_flat_ary.flatten!
+  large_flat_ary.flatten: large_flat_ary.flatten
+  large_flat_ary.flatten!: large_flat_ary.flatten!
+  small_pairs_ary.flatten: small_pairs_ary.flatten
+  small_pairs_ary.flatten!: small_pairs_ary.dup.flatten!
+  large_pairs_ary.flatten: large_pairs_ary.flatten
+  large_pairs_ary.flatten!: large_pairs_ary.dup.flatten!
+  mostly_flat_ary.flatten: mostly_flat_ary.flatten
+  mostly_flat_ary.flatten!: mostly_flat_ary.dup.flatten!
+loop_count: 10000
diff --git a/benchmark/array_intersection.yml b/benchmark/array_intersection.yml
new file mode 100644
index 0000000000..26705323fd
--- /dev/null
+++ b/benchmark/array_intersection.yml
@@ -0,0 +1,14 @@
+prelude: |
+  small1 = [1, 2, 3]
+  small2 = [1, 2, 3, 4, 5]
+  small3 = [2, 3, 4, 5]
+  small4 = [2]
+  big1 = [1, 2, 3, 4] * 64
+  big2 = [1, 2, 3] * 64
+  big3 = [1, 2] * 64
+
+benchmark:
+  small-&: small1 & small2 & small3 & small4
+  small-intersection: small1.intersection(small2, small3, small4)
+  big-&: big1 & big2 & big3
+  big-intersection: big1.intersection(big2, big3)
diff --git a/benchmark/array_max_float.yml b/benchmark/array_max_float.yml
new file mode 100644
index 0000000000..ace1ae2e14
--- /dev/null
+++ b/benchmark/array_max_float.yml
@@ -0,0 +1,30 @@
+prelude: |
+  ary2 = 2.times.map(&:to_f).shuffle
+  ary10 = 10.times.map(&:to_f).shuffle
+  ary100 = 100.times.map(&:to_f).shuffle
+  ary500 = 500.times.map(&:to_f).shuffle
+  ary1000 = 1000.times.map(&:to_f).shuffle
+  ary2000 = 2500.times.map(&:to_f).shuffle
+  ary3000 = 2500.times.map(&:to_f).shuffle
+  ary5000 = 5000.times.map(&:to_f).shuffle
+  ary10000 = 10000.times.map(&:to_f).shuffle
+  ary20000 = 20000.times.map(&:to_f).shuffle
+  ary50000 = 50000.times.map(&:to_f).shuffle
+  ary100000 = 100000.times.map(&:to_f).shuffle
+
+benchmark:
+  ary2.max: ary2.max
+  ary10.max: ary10.max
+  ary100.max: ary100.max
+  ary500.max: ary500.max
+  ary1000.max: ary1000.max
+  ary2000.max: ary2000.max
+  ary3000.max: ary3000.max
+  ary5000.max: ary5000.max
+  ary10000.max: ary10000.max
+  ary20000.max: ary20000.max
+  ary50000.max: ary50000.max
+  ary100000.max: ary100000.max
+
+loop_count: 10000
+
diff --git a/benchmark/array_max_int.yml b/benchmark/array_max_int.yml
new file mode 100644
index 0000000000..acd83684d0
--- /dev/null
+++ b/benchmark/array_max_int.yml
@@ -0,0 +1,31 @@
+prelude: |
+  ary2 = 2.times.to_a.shuffle
+  ary10 = 10.times.to_a.shuffle
+  ary100 = 100.times.to_a.shuffle
+  ary500 = 500.times.to_a.shuffle
+  ary1000 = 1000.times.to_a.shuffle
+  ary2000 = 2500.times.to_a.shuffle
+  ary3000 = 2500.times.to_a.shuffle
+  ary5000 = 5000.times.to_a.shuffle
+  ary10000 = 10000.times.to_a.shuffle
+  ary20000 = 20000.times.to_a.shuffle
+  ary50000 = 50000.times.to_a.shuffle
+  ary100000 = 100000.times.to_a.shuffle
+  ary1000000 = 1000000.times.to_a.shuffle
+
+benchmark:
+  ary2.max: ary2.max
+  ary10.max: ary10.max
+  ary100.max: ary100.max
+  ary500.max: ary500.max
+  ary1000.max: ary1000.max
+  ary2000.max: ary2000.max
+  ary3000.max: ary3000.max
+  ary5000.max: ary5000.max
+  ary10000.max: ary10000.max
+  ary20000.max: ary20000.max
+  ary50000.max: ary50000.max
+  ary100000.max: ary100000.max
+  ary1000000.max: ary1000000.max
+
+loop_count: 10000
diff --git a/benchmark/array_max_str.yml b/benchmark/array_max_str.yml
new file mode 100644
index 0000000000..2aeed010f2
--- /dev/null
+++ b/benchmark/array_max_str.yml
@@ -0,0 +1,30 @@
+prelude: |
+  ary2 = 2.times.map(&:to_s).shuffle
+  ary10 = 10.times.map(&:to_s).shuffle
+  ary100 = 100.times.map(&:to_s).shuffle
+  ary500 = 500.times.map(&:to_s).shuffle
+  ary1000 = 1000.times.map(&:to_s).shuffle
+  ary2000 = 2500.times.map(&:to_s).shuffle
+  ary3000 = 2500.times.map(&:to_s).shuffle
+  ary5000 = 5000.times.map(&:to_s).shuffle
+  ary10000 = 10000.times.map(&:to_s).shuffle
+  ary20000 = 20000.times.map(&:to_s).shuffle
+  ary50000 = 50000.times.map(&:to_s).shuffle
+  ary100000 = 100000.times.map(&:to_s).shuffle
+
+benchmark:
+  ary2.max: ary2.max
+  ary10.max: ary10.max
+  ary100.max: ary100.max
+  ary500.max: ary500.max
+  ary1000.max: ary1000.max
+  ary2000.max: ary2000.max
+  ary3000.max: ary3000.max
+  ary5000.max: ary5000.max
+  ary10000.max: ary10000.max
+  ary20000.max: ary20000.max
+  ary50000.max: ary50000.max
+  ary100000.max: ary100000.max
+
+loop_count: 10000
+
diff --git a/benchmark/array_min.yml b/benchmark/array_min.yml
new file mode 100644
index 0000000000..53e5072b14
--- /dev/null
+++ b/benchmark/array_min.yml
@@ -0,0 +1,31 @@
+prelude: |
+  ary2 = 2.times.to_a.shuffle
+  ary10 = 10.times.to_a.shuffle
+  ary100 = 100.times.to_a.shuffle
+  ary500 = 500.times.to_a.shuffle
+  ary1000 = 1000.times.to_a.shuffle
+  ary2000 = 2500.times.to_a.shuffle
+  ary3000 = 2500.times.to_a.shuffle
+  ary5000 = 5000.times.to_a.shuffle
+  ary10000 = 10000.times.to_a.shuffle
+  ary20000 = 20000.times.to_a.shuffle
+  ary50000 = 50000.times.to_a.shuffle
+  ary100000 = 100000.times.to_a.shuffle
+  ary1000000 = 1000000.times.to_a.shuffle
+
+benchmark:
+  ary2.min: ary2.min
+  ary10.min: ary10.min
+  ary100.min: ary100.min
+  ary500.min: ary500.min
+  ary1000.min: ary1000.min
+  ary2000.min: ary2000.min
+  ary3000.min: ary3000.min
+  ary5000.min: ary5000.min
+  ary10000.min: ary10000.min
+  ary20000.min: ary20000.min
+  ary50000.min: ary50000.min
+  ary100000.min: ary100000.min
+  ary1000000.min: ary1000000.min
+
+loop_count: 10000
diff --git a/benchmark/array_sample.yml b/benchmark/array_sample.yml
new file mode 100644
index 0000000000..1cd2b34794
--- /dev/null
+++ b/benchmark/array_sample.yml
@@ -0,0 +1,4 @@
+prelude: ary = (1..10_000).to_a
+benchmark:
+  - ary.sample
+  - ary.sample(2)
diff --git a/benchmark/array_sample_100k_10.rb b/benchmark/array_sample_100k_10.rb
new file mode 100644
index 0000000000..5f41ecc32b
--- /dev/null
+++ b/benchmark/array_sample_100k_10.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 10}
diff --git a/benchmark/array_sample_100k_11.rb b/benchmark/array_sample_100k_11.rb
new file mode 100644
index 0000000000..18b1715319
--- /dev/null
+++ b/benchmark/array_sample_100k_11.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 11}
diff --git a/benchmark/array_sample_100k__100.rb b/benchmark/array_sample_100k__100.rb
new file mode 100644
index 0000000000..22863afe89
--- /dev/null
+++ b/benchmark/array_sample_100k__100.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 100}
diff --git a/benchmark/array_sample_100k__1k.rb b/benchmark/array_sample_100k__1k.rb
new file mode 100644
index 0000000000..4cd79e6c67
--- /dev/null
+++ b/benchmark/array_sample_100k__1k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 1000}
diff --git a/benchmark/array_sample_100k__6k.rb b/benchmark/array_sample_100k__6k.rb
new file mode 100644
index 0000000000..b3d264249e
--- /dev/null
+++ b/benchmark/array_sample_100k__6k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 6000}
diff --git a/benchmark/array_sample_100k___10k.rb b/benchmark/array_sample_100k___10k.rb
new file mode 100644
index 0000000000..5dd55ec058
--- /dev/null
+++ b/benchmark/array_sample_100k___10k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 10_000}
diff --git a/benchmark/array_sample_100k___50k.rb b/benchmark/array_sample_100k___50k.rb
new file mode 100644
index 0000000000..1506732c3c
--- /dev/null
+++ b/benchmark/array_sample_100k___50k.rb
@@ -0,0 +1,2 @@
+arr = [*0...100000]
+10_000.times {arr.sample 50_000}
diff --git a/benchmark/array_shift.rb b/benchmark/array_shift.rb
new file mode 100644
index 0000000000..798bb9e3f4
--- /dev/null
+++ b/benchmark/array_shift.rb
@@ -0,0 +1,14 @@
+require 'benchmark'
+
+Benchmark.bm do |x|
+  [10_000,1_000_000,100_000_000].each do |n|
+    ary = Array.new(n,0)
+    GC.start
+    x.report("#{n}:shift"){ ary.shift }
+    (0..4).each do |i|
+      ary = Array.new(n,0)
+      GC.start
+      x.report("#{n}:shift(#{i})"){ ary.shift(i) }
+    end
+  end
+end
diff --git a/benchmark/array_small_and.rb b/benchmark/array_small_and.rb
new file mode 100644
index 0000000000..e53a6edae6
--- /dev/null
+++ b/benchmark/array_small_and.rb
@@ -0,0 +1,17 @@
+MIN_SIZE = ENV.fetch('SMALL_ARRAY_MIN', 0).to_i
+MAX_SIZE = ENV.fetch('SMALL_ARRAY_MAX', 16).to_i
+ITERATIONS = ENV.fetch('SMALL_ARRAY_ITERATIONS', 100).to_i
+
+ARRAYS = (MIN_SIZE..MAX_SIZE).map do |size1|
+  (MIN_SIZE..MAX_SIZE).map do |size2|
+    [Array.new(size1) { rand(MAX_SIZE) }, Array.new(size2) { rand(MAX_SIZE) }]
+  end
+end
+
+ITERATIONS.times do
+  ARRAYS.each do |group|
+    group.each do |arr1, arr2|
+      arr1 & arr2
+    end
+  end
+end
diff --git a/benchmark/array_small_diff.rb b/benchmark/array_small_diff.rb
new file mode 100644
index 0000000000..9661ee48db
--- /dev/null
+++ b/benchmark/array_small_diff.rb
@@ -0,0 +1,17 @@
+MIN_SIZE = ENV.fetch('SMALL_ARRAY_MIN', 0).to_i
+MAX_SIZE = ENV.fetch('SMALL_ARRAY_MAX', 16).to_i
+ITERATIONS = ENV.fetch('SMALL_ARRAY_ITERATIONS', 100).to_i
+
+ARRAYS = (MIN_SIZE..MAX_SIZE).map do |size1|
+  (MIN_SIZE..MAX_SIZE).map do |size2|
+    [Array.new(size1) { rand(MAX_SIZE) }, Array.new(size2) { rand(MAX_SIZE) }]
+  end
+end
+
+ITERATIONS.times do
+  ARRAYS.each do |group|
+    group.each do |arr1, arr2|
+      arr1 - arr2
+    end
+  end
+end
diff --git a/benchmark/array_small_or.rb b/benchmark/array_small_or.rb
new file mode 100644
index 0000000000..c58b5fd1ff
--- /dev/null
+++ b/benchmark/array_small_or.rb
@@ -0,0 +1,17 @@
+MIN_SIZE = ENV.fetch('SMALL_ARRAY_MIN', 0).to_i
+MAX_SIZE = ENV.fetch('SMALL_ARRAY_MAX', 16).to_i
+ITERATIONS = ENV.fetch('SMALL_ARRAY_ITERATIONS', 100).to_i
+
+ARRAYS = (MIN_SIZE..MAX_SIZE).map do |size1|
+  (MIN_SIZE..MAX_SIZE).map do |size2|
+    [Array.new(size1) { rand(MAX_SIZE) }, Array.new(size2) { rand(MAX_SIZE) }]
+  end
+end
+
+ITERATIONS.times do
+  ARRAYS.each do |group|
+    group.each do |arr1, arr2|
+      arr1 | arr2
+    end
+  end
+end
diff --git a/benchmark/array_sort_block.rb b/benchmark/array_sort_block.rb
new file mode 100644
index 0000000000..3579786056
--- /dev/null
+++ b/benchmark/array_sort_block.rb
@@ -0,0 +1,2 @@
+ary = Array.new(1000) { rand(1000) }
+10000.times { ary.sort { |a, b| a <=> b } }
diff --git a/benchmark/array_sort_float.rb b/benchmark/array_sort_float.rb
new file mode 100644
index 0000000000..9a6e2f8bd2
--- /dev/null
+++ b/benchmark/array_sort_float.rb
@@ -0,0 +1,2 @@
+arr = Array.new(1000) { rand }
+10000.times { arr.sort }
diff --git a/benchmark/array_sort_int.yml b/benchmark/array_sort_int.yml
new file mode 100644
index 0000000000..7b9027ebf7
--- /dev/null
+++ b/benchmark/array_sort_int.yml
@@ -0,0 +1,15 @@
+prelude: |
+  ary2 = 2.times.to_a.shuffle
+  ary10 = 10.times.to_a.shuffle
+  ary100 = 100.times.to_a.shuffle
+  ary1000 = 1000.times.to_a.shuffle
+  ary10000 = 10000.times.to_a.shuffle
+
+benchmark:
+  ary2.sort: ary2.sort
+  ary10.sort: ary10.sort
+  ary100.sort: ary100.sort
+  ary1000.sort: ary1000.sort
+  ary10000.sort: ary10000.sort
+
+loop_count: 10000
diff --git a/benchmark/array_values_at_int.rb b/benchmark/array_values_at_int.rb
new file mode 100644
index 0000000000..6cb394cb9f
--- /dev/null
+++ b/benchmark/array_values_at_int.rb
@@ -0,0 +1,2 @@
+ary = Array.new(10000) {|i| i}
+100000.times { ary.values_at(500) }
diff --git a/benchmark/array_values_at_range.rb b/benchmark/array_values_at_range.rb
new file mode 100644
index 0000000000..5b53806d1c
--- /dev/null
+++ b/benchmark/array_values_at_range.rb
@@ -0,0 +1,2 @@
+ary = Array.new(10000) {|i| i}
+100000.times { ary.values_at(1..2000) }
diff --git a/benchmark/attr_accessor.yml b/benchmark/attr_accessor.yml
new file mode 100644
index 0000000000..82134cdf9b
--- /dev/null
+++ b/benchmark/attr_accessor.yml
@@ -0,0 +1,29 @@
+prelude: |
+  class C
+    attr_accessor :x
+    def initialize
+      @x = nil
+    end
+    class_eval <<-END
+      def ar
+        #{'x;'*256}
+      end
+      def aw
+        #{'self.x = nil;'*256}
+      end
+      def arm
+        m = method(:x)
+        #{'m.call;'*256}
+      end
+      def awm
+        m = method(:x=)
+        #{'m.call(nil);'*256}
+      end
+    END
+  end
+  obj = C.new
+benchmark:
+  attr_reader: "obj.ar"
+  attr_writer: "obj.aw"
+  attr_reader_method: "obj.arm"
+  attr_writer_method: "obj.awm"
diff --git a/benchmark/bighash.rb b/benchmark/bighash.rb
new file mode 100644
index 0000000000..e2ad5a5c94
--- /dev/null
+++ b/benchmark/bighash.rb
@@ -0,0 +1 @@
+h = {}; 5000000.times {|n| h[n] = n }
diff --git a/benchmark/bm_app_erb.rb b/benchmark/bm_app_erb.rb
deleted file mode 100644
index 77c66a7949..0000000000
--- a/benchmark/bm_app_erb.rb
+++ /dev/null
@@ -1,26 +0,0 @@
-#
-# Create many HTML strings with ERB.
-#
-
-require 'erb'
-
-data = DATA.read
-max = 15_000
-title = "hello world!"
-content = "hello world!\n" * 10
-
-max.times{
-  ERB.new(data).result(binding)
-}
-
-__END__
-
-<html>
-  <head> <%= title %> </head>
-  <body>
-    <h1> <%= title %> </h1>
-    <p>
-      <%= content %>
-    </p>
-  </body>
-</html>
diff --git a/benchmark/bm_app_mandelbrot.rb b/benchmark/bm_app_mandelbrot.rb
deleted file mode 100644
index 89069db7ab..0000000000
--- a/benchmark/bm_app_mandelbrot.rb
+++ /dev/null
@@ -1,23 +0,0 @@
-require 'complex'
-
-def mandelbrot? z
-  i = 0
-  while i<100
-    i+=1
-    z = z * z
-    return false if z.abs > 2
-  end
-  true
-end
-
-ary = []
-
-(0..1000).each{|dx|
-  (0..1000).each{|dy|
-    x = dx / 50.0
-    y = dy / 50.0
-    c = Complex(x, y)
-    ary << c if mandelbrot?(c)
-  }
-}
-
diff --git a/benchmark/bm_app_pentomino.rb b/benchmark/bm_app_pentomino.rb
deleted file mode 100644
index 59c63f358e..0000000000
--- a/benchmark/bm_app_pentomino.rb
+++ /dev/null
@@ -1,259 +0,0 @@
-#!/usr/local/bin/ruby
-# This program is contributed by Shin Nishiyama
-
-
-# modified by K.Sasada
-
-NP = 5
-ROW = 8 + NP
-COL = 8
-
-$p = []
-$b = []
-$no = 0
-
-def piece(n, a, nb)
-  nb.each{|x|
-    a[n] = x
-    if n == NP-1
-      $p << [a.sort]
-    else
-      nbc=nb.dup
-      [-ROW, -1, 1, ROW].each{|d|
-        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
-          nbc << x+d
-        end
-      }
-      nbc.delete x
-      piece(n+1,a[0..n],nbc)
-    end
-  }
-end
-
-def kikaku(a)
-  a.collect {|x| x - a[0]}
-end
-def ud(a)
-  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
-end
-def rl(a)
-  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
-end
-def xy(a)
-  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
-end
-
-def mkpieces
-  piece(0,[],[0])
-  $p.each do |a|
-    a0 = a[0]
-    a[1] = ud(a0)
-    a[2] = rl(a0)
-    a[3] = ud(rl(a0))
-    a[4] = xy(a0)
-    a[5] = ud(xy(a0))
-    a[6] = rl(xy(a0))
-    a[7] = ud(rl(xy(a0)))
-    a.sort!
-    a.uniq!
-  end
-  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
-end
-
-def mkboard
-  (0...ROW*COL).each{|i|
-    if i % ROW >= ROW-NP
-      $b[i] = -2
-    else
-      $b[i] = -1
-    end
-    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
-  }
-end
-
-def pboard
-  return # skip print
-  print "No. #$no\n"
-  (0...COL).each{|i|
-    print "|"
-    (0...ROW-NP).each{|j|
-      x = $b[i*ROW+j]
-      if x < 0
-        print "..|"
-      else
-        printf "%2d|",x+1
-      end
-    }
-    print "\n"
-  }
-  print "\n"
-end
-
-$pnum=[]
-def setpiece(a,pos)
-  if a.length == $p.length then
-    $no += 1
-    pboard
-    return
-  end
-  while $b[pos] != -1
-    pos += 1
-  end
-  ($pnum - a).each do |i|
-    $p[i].each do |x|
-      f = 0
-      x.each{|s|
-        if $b[pos+s] != -1
-          f=1
-          break
-        end
-      }
-      if f == 0 then
-        x.each{|s|
-          $b[pos+s] = i
-        }
-        a << i
-        setpiece(a.dup, pos)
-        a.pop
-        x.each{|s|
-          $b[pos+s] = -1
-        }
-      end
-    end
-  end
-end
-
-mkpieces
-mkboard
-$p[4] = [$p[4][0]]
-$pnum = (0...$p.length).to_a
-setpiece([],0)
-
-
-__END__
-
-# original
-
-NP = 5
-ROW = 8 + NP
-COL = 8
-
-$p = []
-$b = []
-$no = 0
-
-def piece(n,a,nb)
-  for x in nb
-    a[n] = x
-    if n == NP-1
-      $p << [a.sort]
-    else
-      nbc=nb.dup
-      for d in [-ROW, -1, 1, ROW]
-        if x+d > 0 and not a.include?(x+d) and not nbc.include?(x+d)
-          nbc << x+d
-        end
-      end
-      nbc.delete x
-      piece(n+1,a[0..n],nbc)
-    end
-  end
-end
-
-def kikaku(a)
-  a.collect {|x| x - a[0]}
-end
-def ud(a)
-  kikaku(a.collect {|x| ((x+NP)%ROW)-ROW*((x+NP)/ROW) }.sort)
-end
-def rl(a)
-  kikaku(a.collect {|x| ROW*((x+NP)/ROW)+ROW-((x+NP)%ROW)}.sort)
-end
-def xy(a)
-  kikaku(a.collect {|x| ROW*((x+NP)%ROW) + (x+NP)/ROW }.sort)
-end
-
-def mkpieces
-  piece(0,[],[0])
-  $p.each do |a|
-    a0 = a[0]
-    a[1] = ud(a0)
-    a[2] = rl(a0)
-    a[3] = ud(rl(a0))
-    a[4] = xy(a0)
-    a[5] = ud(xy(a0))
-    a[6] = rl(xy(a0))
-    a[7] = ud(rl(xy(a0)))
-    a.sort!
-    a.uniq!
-  end
-  $p.uniq!.sort! {|x,y| x[0] <=> y[0] }
-end
-
-def mkboard
-  for i in 0...ROW*COL
-    if i % ROW >= ROW-NP
-      $b[i] = -2
-    else
-      $b[i] = -1
-    end
-    $b[3*ROW+3]=$b[3*ROW+4]=$b[4*ROW+3]=$b[4*ROW+4]=-2
-  end
-end
-
-def pboard
-  print "No. #$no\n"
-  for i in 0...COL
-    print "|"
-    for j in 0...ROW-NP
-      x = $b[i*ROW+j]
-      if x < 0
-        print "..|"
-      else
-        printf "%2d|",x+1
-      end
-    end
-    print "\n"
-  end
-  print "\n"
-end
-
-$pnum=[]
-def setpiece(a,pos)
-  if a.length == $p.length then
-    $no += 1
-    pboard
-    return
-  end
-  while $b[pos] != -1
-    pos += 1
-  end
-  ($pnum - a).each do |i|
-    $p[i].each do |x|
-      f = 0
-      for s in x do
-        if $b[pos+s] != -1
-          f=1
-          break
-        end
-      end
-      if f == 0 then
-        for s in x do
-          $b[pos+s] = i
-        end
-        a << i
-        setpiece(a.dup, pos)
-        a.pop
-        for s in x do
-          $b[pos+s] = -1
-        end
-      end
-    end
-  end
-end
-
-mkpieces
-mkboard
-$p[4] = [$p[4][0]]
-$pnum = (0...$p.length).to_a
-setpiece([],0)
diff --git a/benchmark/bm_app_raise.rb b/benchmark/bm_app_raise.rb
deleted file mode 100644
index 01d2ae3219..0000000000
--- a/benchmark/bm_app_raise.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-i=0
-while i<300000
-  i+=1
-  begin
-    raise
-  rescue
-  end
-end
diff --git a/benchmark/bm_app_strconcat.rb b/benchmark/bm_app_strconcat.rb
deleted file mode 100644
index 7b2f2da5a7..0000000000
--- a/benchmark/bm_app_strconcat.rb
+++ /dev/null
@@ -1,5 +0,0 @@
-i=0
-while i<2_000_000
-  "#{1+1} #{1+1} #{1+1}"
-  i+=1
-end
diff --git a/benchmark/bm_loop_whileloop.rb b/benchmark/bm_loop_whileloop.rb
deleted file mode 100644
index 43d35e1131..0000000000
--- a/benchmark/bm_loop_whileloop.rb
+++ /dev/null
@@ -1,4 +0,0 @@
-i=0
-while i<30_000_000 # benchmark loop 1
-  i+=1
-end
diff --git a/benchmark/bm_loop_whileloop2.rb b/benchmark/bm_loop_whileloop2.rb
deleted file mode 100644
index e514989661..0000000000
--- a/benchmark/bm_loop_whileloop2.rb
+++ /dev/null
@@ -1,4 +0,0 @@
-i=0
-while i< 6_000_000 # benchmark loop 2
-  i+=1
-end
diff --git a/benchmark/bm_so_ackermann.rb b/benchmark/bm_so_ackermann.rb
deleted file mode 100644
index 7db5be9050..0000000000
--- a/benchmark/bm_so_ackermann.rb
+++ /dev/null
@@ -1,19 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: ackermann-ruby.code,v 1.4 2004/11/13 07:40:41 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-
-def ack(m, n)
-    if m == 0 then
-        n + 1
-    elsif n == 0 then
-        ack(m - 1, 1)
-    else
-        ack(m - 1, ack(m, n - 1))
-    end
-end
-
-NUM = 9
-ack(3, NUM)
-
-
diff --git a/benchmark/bm_so_array.rb b/benchmark/bm_so_array.rb
deleted file mode 100644
index 2b8fce8f99..0000000000
--- a/benchmark/bm_so_array.rb
+++ /dev/null
@@ -1,23 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: ary-ruby.code,v 1.4 2004/11/13 07:41:27 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# with help from Paul Brannan and Mark Hubbart
-
-n = 9000 # Integer(ARGV.shift || 1)
-
-x = Array.new(n)
-y = Array.new(n, 0)
-
-n.times{|bi|
-  x[bi] = bi + 1
-}
-
-(0 .. 999).each do |e|
-  (n-1).step(0,-1) do |bi|
-    y[bi] += x.at(bi)
-  end
-end
-# puts "#{y.first} #{y.last}"
-
-
diff --git a/benchmark/bm_so_binary_trees.rb b/benchmark/bm_so_binary_trees.rb
deleted file mode 100644
index 6a26465578..0000000000
--- a/benchmark/bm_so_binary_trees.rb
+++ /dev/null
@@ -1,57 +0,0 @@
-# The Computer Language Shootout Benchmarks
-# http://shootout.alioth.debian.org
-#
-# contributed by Jesse Millikan
-
-# disable output
-def STDOUT.write_ *args
-end
-
-def item_check(tree)
- if tree[0] == nil
-  tree[1]
- else
-  tree[1] + item_check(tree[0]) - item_check(tree[2])
- end
-end
-
-def bottom_up_tree(item, depth)
- if depth > 0
-  item_item = 2 * item
-  depth -= 1
-  [bottom_up_tree(item_item - 1, depth), item, bottom_up_tree(item_item, depth)]
- else
-  [nil, item, nil]
- end
-end
-
-max_depth = 12 # 16 # ARGV[0].to_i
-min_depth = 4
-
-max_depth = min_depth + 2 if min_depth + 2 > max_depth
-
-stretch_depth = max_depth + 1
-stretch_tree = bottom_up_tree(0, stretch_depth)
-
-puts "stretch tree of depth #{stretch_depth}\t check: #{item_check(stretch_tree)}"
-stretch_tree = nil
-
-long_lived_tree = bottom_up_tree(0, max_depth)
-
-min_depth.step(max_depth + 1, 2) do |depth|
- iterations = 2**(max_depth - depth + min_depth)
-
- check = 0
-
- for i in 1..iterations
-  temp_tree = bottom_up_tree(i, depth)
-  check += item_check(temp_tree)
-
-  temp_tree = bottom_up_tree(-i, depth)
-  check += item_check(temp_tree)
- end
-
- puts "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}"
-end
-
-puts "long lived tree of depth #{max_depth}\t check: #{item_check(long_lived_tree)}"
diff --git a/benchmark/bm_so_concatenate.rb b/benchmark/bm_so_concatenate.rb
deleted file mode 100644
index 56b9410632..0000000000
--- a/benchmark/bm_so_concatenate.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: strcat-ruby.code,v 1.4 2004/11/13 07:43:28 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# based on code from Aristarkh A Zagorodnikov and Dat Nguyen
-
-STUFF = "hello\n"
-i=0
-while i<10
-  i+=1
-  hello = ''
-  4_000_000.times do |e|
-    hello << STUFF
-  end
-end
-# puts hello.length
-
-
diff --git a/benchmark/bm_so_count_words.rb b/benchmark/bm_so_count_words.rb
deleted file mode 100644
index 65f6337a4a..0000000000
--- a/benchmark/bm_so_count_words.rb
+++ /dev/null
@@ -1,19 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: wc-ruby.code,v 1.4 2004/11/13 07:43:32 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# with help from Paul Brannan
-
-input = open(File.join(File.dirname($0), 'wc.input'), 'rb')
-
-nl = nw = nc = 0
-while true
-  tmp = input.read(4096) or break
-  data = tmp << (input.gets || "")
-  nc += data.length
-  nl += data.count("\n")
-  ((data.strip! || data).tr!("\n", " ") || data).squeeze!
-  nw += data.count(" ") + 1
-end
-# STDERR.puts "#{nl} #{nw} #{nc}"
-
diff --git a/benchmark/bm_so_exception.rb b/benchmark/bm_so_exception.rb
deleted file mode 100644
index d8b461290c..0000000000
--- a/benchmark/bm_so_exception.rb
+++ /dev/null
@@ -1,61 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: except-ruby.code,v 1.4 2004/11/13 07:41:33 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-
-$HI = 0
-$LO = 0
-NUM = 250000 # Integer(ARGV[0] || 1)
-
-
-class Lo_Exception < Exception
-  def initialize(num)
-    @value = num
-  end
-end
-
-class Hi_Exception < Exception
-  def initialize(num)
-    @value = num
-  end
-end
-
-def some_function(num)
-  begin
-    hi_function(num)
-  rescue
-    print "We shouldn't get here, exception is: #{$!.type}\n"
-  end
-end
-
-def hi_function(num)
-  begin
-    lo_function(num)
-  rescue Hi_Exception
-    $HI = $HI + 1
-  end
-end
-
-def lo_function(num)
-  begin
-    blowup(num)
-  rescue Lo_Exception
-    $LO = $LO + 1
-  end
-end
-
-def blowup(num)
-  if num % 2 == 0
-    raise Lo_Exception.new(num)
-  else
-    raise Hi_Exception.new(num)
-  end
-end
-
-
-i = 1
-max = NUM+1
-while i < max
-  i+=1
-  some_function(i+1)
-end
diff --git a/benchmark/bm_so_fasta.rb b/benchmark/bm_so_fasta.rb
deleted file mode 100644
index 3f759ba7ae..0000000000
--- a/benchmark/bm_so_fasta.rb
+++ /dev/null
@@ -1,81 +0,0 @@
-# The Computer Language Shootout
-# http://shootout.alioth.debian.org/
-# Contributed by Sokolov Yura
-
-$last = 42.0
-def gen_random (max,im=139968,ia=3877,ic=29573)
-    (max * ($last = ($last * ia + ic) % im)) / im
-end
-
-alu =
-   "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
-   "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
-   "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
-   "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
-   "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
-   "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
-   "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
-
-iub = [
-    ["a", 0.27],
-    ["c", 0.12],
-    ["g", 0.12],
-    ["t", 0.27],
-
-    ["B", 0.02],
-    ["D", 0.02],
-    ["H", 0.02],
-    ["K", 0.02],
-    ["M", 0.02],
-    ["N", 0.02],
-    ["R", 0.02],
-    ["S", 0.02],
-    ["V", 0.02],
-    ["W", 0.02],
-    ["Y", 0.02],
-]
-homosapiens = [
-    ["a", 0.3029549426680],
-    ["c", 0.1979883004921],
-    ["g", 0.1975473066391],
-    ["t", 0.3015094502008],
-]
-
-def make_repeat_fasta(id, desc, src, n)
-    puts ">#{id} #{desc}"
-    v = nil
-    width = 60
-    l = src.length
-    s = src * ((n / l) + 1)
-    s.slice!(n, l)
-    puts(s.scan(/.{1,#{width}}/).join("\n"))
-end
-
-def make_random_fasta(id, desc, table, n)
-    puts ">#{id} #{desc}"
-    rand, v = nil,nil
-    width = 60
-    chunk = 1 * width
-    prob = 0.0
-    table.each{|v| v[1]= (prob += v[1])}
-    for i in 1..(n/width)
-        puts((1..width).collect{
-            rand = gen_random(1.0)
-            table.find{|v| v[1]>rand}[0]
-        }.join)
-    end
-    if n%width != 0
-        puts((1..(n%width)).collect{
-            rand = gen_random(1.0)
-            table.find{|v| v[1]>rand}[0]
-        }.join)
-    end
-end
-
-
-n = (ARGV[0] or 250_000).to_i
-
-make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
-make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
-make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
-
diff --git a/benchmark/bm_so_k_nucleotide.rb b/benchmark/bm_so_k_nucleotide.rb
deleted file mode 100644
index dadab3e79c..0000000000
--- a/benchmark/bm_so_k_nucleotide.rb
+++ /dev/null
@@ -1,48 +0,0 @@
-# The Computer Language Shootout
-# http://shootout.alioth.debian.org
-#
-# contributed by jose fco. gonzalez
-# modified by Sokolov Yura
-
-seq = String.new
-
-def frecuency( seq,length )
-    n, table = seq.length - length + 1, Hash.new(0)
-    f, i = nil, nil
-    (0 ... length).each do |f|
-        (f ... n).step(length) do |i|
-            table[seq[i,length]] += 1
-        end
-    end
-    [n,table]
-
-end
-
-def sort_by_freq( seq,length )
-    n,table = frecuency( seq,length )
-    a, b, v = nil, nil, nil
-    table.sort{|a,b| b[1] <=> a[1]}.each do |v|
-        puts "%s %.3f" % [v[0].upcase,((v[1]*100).to_f/n)]
-    end
-    puts
-end
-
-def find_seq( seq,s )
-    n,table = frecuency( seq,s.length )
-    puts "#{table[s].to_s}\t#{s.upcase}"
-end
-
-input = open(File.join(File.dirname($0), 'fasta.output.100000'), 'rb')
-
-line = input.gets while line !~ /^>THREE/
-line = input.gets
-
-while (line !~ /^>/) & line do
-    seq << line.chomp
-    line = input.gets
-end
-
-[1,2].each {|i| sort_by_freq( seq,i ) }
-
-%w(ggt ggta ggtatt ggtattttaatt ggtattttaatttatagt).each{|s| find_seq( seq,s) }
-
diff --git a/benchmark/bm_so_lists.rb b/benchmark/bm_so_lists.rb
deleted file mode 100644
index f8d26797aa..0000000000
--- a/benchmark/bm_so_lists.rb
+++ /dev/null
@@ -1,47 +0,0 @@
-#from http://www.bagley.org/~doug/shootout/bench/lists/lists.ruby
-
-NUM = 300
-SIZE = 10000
-
-def test_lists()
-  # create a list of integers (Li1) from 1 to SIZE
-  li1 = (1..SIZE).to_a
-  # copy the list to li2 (not by individual items)
-  li2 = li1.dup
-  # remove each individual item from left side of li2 and
-  # append to right side of li3 (preserving order)
-  li3 = Array.new
-  while (not li2.empty?)
-    li3.push(li2.shift)
-  end
-  # li2 must now be empty
-  # remove each individual item from right side of li3 and
-  # append to right side of li2 (reversing list)
-  while (not li3.empty?)
-    li2.push(li3.pop)
-  end
-  # li3 must now be empty
-  # reverse li1 in place
-  li1.reverse!
-  # check that first item is now SIZE
-  if li1[0] != SIZE then
-    p "not SIZE"
-    0
-  else
-    # compare li1 and li2 for equality
-    if li1 != li2 then
-      return(0)
-    else
-      # return the length of the list
-      li1.length
-    end
-  end
-end
-
-i = 0
-while i<NUM
-  i+=1
-  result = test_lists()
-end
-
-result
diff --git a/benchmark/bm_so_matrix.rb b/benchmark/bm_so_matrix.rb
deleted file mode 100644
index e2c5c8e559..0000000000
--- a/benchmark/bm_so_matrix.rb
+++ /dev/null
@@ -1,48 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: matrix-ruby.code,v 1.4 2004/11/13 07:42:14 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-
-n = 60 #Integer(ARGV.shift || 1)
-
-size = 40
-
-def mkmatrix(rows, cols)
-    count = 1
-    mx = Array.new(rows)
-    (0 .. (rows - 1)).each do |bi|
-        row = Array.new(cols, 0)
-        (0 .. (cols - 1)).each do |j|
-            row[j] = count
-            count += 1
-        end
-        mx[bi] = row
-    end
-    mx
-end
-
-def mmult(rows, cols, m1, m2)
-    m3 = Array.new(rows)
-    (0 .. (rows - 1)).each do |bi|
-        row = Array.new(cols, 0)
-        (0 .. (cols - 1)).each do |j|
-            val = 0
-            (0 .. (cols - 1)).each do |k|
-                val += m1.at(bi).at(k) * m2.at(k).at(j)
-            end
-            row[j] = val
-        end
-        m3[bi] = row
-    end
-    m3
-end
-
-m1 = mkmatrix(size, size)
-m2 = mkmatrix(size, size)
-mm = Array.new
-n.times do
-    mm = mmult(size, size, m1, m2)
-end
-# puts "#{mm[0][0]} #{mm[2][3]} #{mm[3][2]} #{mm[4][4]}"
-
-
diff --git a/benchmark/bm_so_meteor_contest.rb b/benchmark/bm_so_meteor_contest.rb
deleted file mode 100644
index 99cf6a91cc..0000000000
--- a/benchmark/bm_so_meteor_contest.rb
+++ /dev/null
@@ -1,564 +0,0 @@
-#!/usr/bin/env ruby
-#
-# The Computer Language Shootout
-#   http://shootout.alioth.debian.org
-#   contributed by Kevin Barnes (Ruby novice)
-
-# PROGRAM:  the main body is at the bottom.
-#   1) read about the problem here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
-#   2) see how I represent a board as a bitmask by reading the blank_board comments
-#   3) read as your mental paths take you
-
-def print *args
-end
-
-# class to represent all information about a particular rotation of a particular piece
-class Rotation
-  # an array (by location) containing a bit mask for how the piece maps at the given location.
-  # if the rotation is invalid at that location the mask will contain false
-  attr_reader :start_masks
-
-  # maps a direction to a relative location.  these differ depending on whether it is an even or
-  # odd row being mapped from
-  @@rotation_even_adder = { :west => -1, :east => 1, :nw => -7, :ne => -6, :sw => 5, :se => 6 }
-  @@rotation_odd_adder = { :west => -1, :east => 1, :nw => -6, :ne => -5, :sw => 6, :se => 7 }
-
-  def initialize( directions )
-    @even_offsets, @odd_offsets = normalize_offsets( get_values( directions ))
-
-    @even_mask = mask_for_offsets( @even_offsets)
-    @odd_mask = mask_for_offsets( @odd_offsets)
-
-    @start_masks = Array.new(60)
-
-    # create the rotational masks by placing the base mask at the location and seeing if
-    # 1) it overlaps the boundries and 2) it produces a prunable board.  if either of these
-    # is true the piece cannot be placed
-    0.upto(59) do | offset |
-      mask = is_even(offset) ? (@even_mask << offset) : (@odd_mask << offset)
-      if (blank_board & mask == 0 && !prunable(blank_board | mask, 0, true)) then
-        imask = compute_required( mask, offset)
-        @start_masks[offset] = [ mask, imask, imask | mask ]
-      else
-        @start_masks[offset] = false
-      end
-    end
-  end
-
-  def compute_required( mask, offset )
-    board = blank_board
-    0.upto(offset) { | i | board |= 1 << i }
-    board |= mask
-    return 0 if (!prunable(board | mask, offset))
-    board = flood_fill(board,58)
-    count = 0
-    imask = 0
-    0.upto(59) do | i |
-      if (board[i] == 0) then
-        imask |= (1 << i)
-        count += 1
-      end
-    end
-    (count > 0 && count < 5) ? imask : 0
-  end
-
-  def flood_fill( board, location)
-    return board if (board[location] == 1)
-    board |= 1 << location
-    row, col = location.divmod(6)
-    board = flood_fill( board, location - 1) if (col > 0)
-    board = flood_fill( board, location + 1) if (col < 4)
-    if (row % 2 == 0) then
-      board = flood_fill( board, location - 7) if (col > 0 && row > 0)
-      board = flood_fill( board, location - 6) if (row > 0)
-      board = flood_fill( board, location + 6) if (row < 9)
-      board = flood_fill( board, location + 5) if (col > 0 && row < 9)
-    else
-      board = flood_fill( board, location - 5) if (col < 4 && row > 0)
-      board = flood_fill( board, location - 6) if (row > 0)
-      board = flood_fill( board, location + 6) if (row < 9)
-      board = flood_fill( board, location + 7) if (col < 4 && row < 9)
-    end
-    board
-  end
-
-  # given a location, produces a list of relative locations covered by the piece at this rotation
-  def offsets( location)
-    if is_even( location) then
-      @even_offsets.collect { | value | value + location }
-    else
-      @odd_offsets.collect { | value | value + location }
-    end
-  end
-
-  # returns a set of offsets relative to the top-left most piece of the rotation (by even or odd rows)
-  # this is hard to explain. imagine we have this partial board:
-  #   0 0 0 0 0 x        [positions 0-5]
-  #    0 0 1 1 0 x       [positions 6-11]
-  #   0 0 1 0 0 x        [positions 12-17]
-  #    0 1 0 0 0 x       [positions 18-23]
-  #   0 1 0 0 0 x        [positions 24-29]
-  #    0 0 0 0 0 x       [positions 30-35]
-  #       ...
-  # The top-left of the piece is at position 8, the
-  # board would be passed as a set of positions (values array) containing [8,9,14,19,25] not necessarily in that
-  # sorted order.  Since that array starts on an odd row, the offsets for an odd row are: [0,1,6,11,17] obtained
-  # by subtracting 8 from everything.  Now imagine the piece shifted up and to the right so it's on an even row:
-  #   0 0 0 1 1 x        [positions 0-5]
-  #    0 0 1 0 0 x       [positions 6-11]
-  #   0 0 1 0 0 x        [positions 12-17]
-  #    0 1 0 0 0 x       [positions 18-23]
-  #   0 0 0 0 0 x        [positions 24-29]
-  #    0 0 0 0 0 x       [positions 30-35]
-  #       ...
-  # Now the positions are [3,4,8,14,19] which after subtracting the lowest value (3) gives [0,1,5,11,16] thus, the
-  # offsets for this particular piece are (in even, odd order) [0,1,5,11,16],[0,1,6,11,17] which is what
-  # this function would return
-  def normalize_offsets( values)
-    min = values.min
-    even_min = is_even(min)
-    other_min = even_min ? min + 6 : min + 7
-    other_values = values.collect do | value |
-      if is_even(value) then
-        value + 6 - other_min
-      else
-        value + 7 - other_min
-      end
-    end
-    values.collect! { | value | value - min }
-
-    if even_min then
-      [values, other_values]
-    else
-      [other_values, values]
-    end
-  end
-
-  # produce a bitmask representation of an array of offset locations
-  def mask_for_offsets( offsets )
-    mask = 0
-    offsets.each { | value | mask = mask + ( 1 << value ) }
-    mask
-  end
-
-  # finds a "safe" position that a position as described by a list of directions can be placed
-  # without falling off any edge of the board.  the values returned a location to place the first piece
-  # at so it will fit after making the described moves
-  def start_adjust( directions )
-    south = east = 0;
-    directions.each do | direction |
-      east += 1 if ( direction == :sw || direction == :nw || direction == :west )
-      south += 1 if ( direction == :nw || direction == :ne )
-    end
-    south * 6 + east
-  end
-
-  # given a set of directions places the piece (as defined by a set of directions) on the board at
-  # a location that will not take it off the edge
-  def get_values ( directions )
-    start = start_adjust(directions)
-    values = [ start ]
-    directions.each do | direction |
-      if (start % 12 >= 6) then
-        start += @@rotation_odd_adder[direction]
-      else
-        start += @@rotation_even_adder[direction]
-      end
-      values += [ start ]
-    end
-
-    # some moves take you back to an existing location, we'll strip duplicates
-    values.uniq
-  end
-end
-
-# describes a piece and caches information about its rotations to as to be efficient for iteration
-# ATTRIBUTES:
-#   rotations -- all the rotations of the piece
-#   type -- a numeic "name" of the piece
-#   masks -- an array by location of all legal rotational masks (a n inner array) for that location
-#   placed -- the mask that this piece was last placed at (not a location, but the actual mask used)
-class Piece
-  attr_reader :rotations, :type, :masks
-  attr_accessor :placed
-
-  # transform hashes that change one direction into another when you either flip or rotate a set of directions
-  @@flip_converter = { :west => :west, :east => :east, :nw => :sw, :ne => :se, :sw => :nw, :se => :ne }
-  @@rotate_converter = { :west => :nw, :east => :se, :nw => :ne, :ne => :east, :sw => :west, :se => :sw }
-
-  def initialize( directions, type )
-    @type = type
-    @rotations = Array.new();
-    @map = {}
-
-    generate_rotations( directions )
-    directions.collect! { | value | @@flip_converter[value] }
-    generate_rotations( directions )
-
-    # creates the masks AND a map that returns [location, rotation] for any given mask
-    # this is used when a board is found and we want to draw it, otherwise the map is unused
-    @masks = Array.new();
-    0.upto(59) do | i |
-      even = true
-      @masks[i] = @rotations.collect do | rotation |
-        mask = rotation.start_masks[i]
-        @map[mask[0]] = [ i, rotation ] if (mask)
-        mask || nil
-      end
-      @masks[i].compact!
-    end
-  end
-
-  # rotates a set of directions through all six angles and adds a Rotation to the list for each one
-  def generate_rotations( directions )
-    6.times do
-      rotations.push( Rotation.new(directions))
-      directions.collect! { | value | @@rotate_converter[value] }
-    end
-  end
-
-  # given a board string, adds this piece to the board at whatever location/rotation
-  # important: the outbound board string is 5 wide, the normal location notation is six wide (padded)
-  def fill_string( board_string)
-    location, rotation = @map[@placed]
-    rotation.offsets(location).each do | offset |
-      row, col = offset.divmod(6)
-      board_string[ row*5 + col, 1 ] = @type.to_s
-    end
-  end
-end
-
-# a blank bit board having this form:
-#
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    0 0 0 0 0 1
-#     0 0 0 0 0 1
-#    1 1 1 1 1 1
-#
-# where left lest significant bit is the top left and the most significant is the lower right
-# the actual board only consists of the 0 places, the 1 places are blockers to keep things from running
-# off the edges or bottom
-def blank_board
-  0b111111100000100000100000100000100000100000100000100000100000100000
-end
-
-def full_board
-  0b111111111111111111111111111111111111111111111111111111111111111111
-end
-
-# determines if a location (bit position) is in an even row
-def is_even( location)
-  (location % 12) < 6
-end
-
-# support function that create three utility maps:
-#  $converter -- for each row an array that maps a five bit row (via array mapping)
-#                to the a a five bit representation of the bits below it
-#  $bit_count -- maps a five bit row (via array mapping) to the number of 1s in the row
-#  @@new_regions -- maps a five bit row (via array mapping) to an array of "region" arrays
-#                   a region array has three values the first is a mask of bits in the region,
-#                   the second is the count of those bits and the third is identical to the first
-#                   examples:
-#                           0b10010 => [ 0b01100, 2, 0b01100 ], [ 0b00001, 1, 0b00001]
-#                           0b01010 => [ 0b10000, 1, 0b10000 ], [ 0b00100, 1, 0b00100 ], [ 0b00001, 1, 0b00001]
-#                           0b10001 => [ 0b01110, 3, 0b01110 ]
-def create_collector_support
-  odd_map = [0b11, 0b110, 0b1100, 0b11000, 0b10000]
-  even_map = [0b1, 0b11, 0b110, 0b1100, 0b11000]
-
-  all_odds = Array.new(0b100000)
-  all_evens = Array.new(0b100000)
-  bit_counts = Array.new(0b100000)
-  new_regions = Array.new(0b100000)
-  0.upto(0b11111) do | i |
-    bit_count = odd = even = 0
-    0.upto(4) do | bit |
-      if (i[bit] == 1) then
-        bit_count += 1
-        odd |= odd_map[bit]
-        even |= even_map[bit]
-      end
-    end
-    all_odds[i] = odd
-    all_evens[i] = even
-    bit_counts[i] = bit_count
-    new_regions[i] = create_regions( i)
-  end
-
-  $converter = []
-  10.times { | row | $converter.push((row % 2 == 0) ? all_evens : all_odds) }
-  $bit_counts = bit_counts
-  $regions = new_regions.collect { | set | set.collect { | value | [ value, bit_counts[value], value] } }
-end
-
-# determines if a board is punable, meaning that there is no possibility that it
-# can be filled up with pieces.  A board is prunable if there is a grouping of unfilled spaces
-# that are not a multiple of five.  The following board is an example of a prunable board:
-#    0 0 1 0 0
-#     0 1 0 0 0
-#    1 1 0 0 0
-#     0 1 0 0 0
-#    0 0 0 0 0
-#       ...
-#
-# This board is prunable because the top left corner is only 3 bits in area, no piece will ever fit it
-# parameters:
-#   board -- an initial bit board (6 bit padded rows, see blank_board for format)
-#   location -- starting location, everything above and to the left is already full
-#   slotting -- set to true only when testing initial pieces, when filling normally
-#               additional assumptions are possible
-#
-# Algorithm:
-#    The algorithm starts at the top row (as determined by location) and iterates a row at a time
-#    maintainng counts of active open areas (kept in the collector array) each collector contains
-#    three values at the start of an iteration:
-#          0: mask of bits that would be adjacent to the collector in this row
-#          1: the number of bits collected so far
-#          2: a scratch space starting as zero, but used during the computation to represent
-#             the empty bits in the new row that are adjacent (position 0)
-#  The exact procedure is described in-code
-def prunable( board, location, slotting = false)
-  collectors = []
-  # loop accross the rows
-  (location / 6).to_i.upto(9) do | row_on |
-    # obtain a set of regions representing the bits of the curent row.
-    regions = $regions[(board >> (row_on * 6)) & 0b11111]
-    converter = $converter[row_on]
-
-    # track the number of collectors at the start of the cycle so that
-    # we don't compute against newly created collectors, only existing collectors
-    initial_collector_count = collectors.length
-
-    # loop against the regions.  For each region of the row
-    # we will see if it connects to one or more existing collectors.
-    # if it connects to 1 collector, the bits from the region are added to the
-    # bits of the collector and the mask is placed in collector[2]
-    # If the region overlaps more than one collector then all the collectors
-    # it overlaps with are merged into the first one (the others are set to nil in the array)
-    # if NO collectors are found then the region is copied as a new collector
-    regions.each do | region |
-      collector_found = nil
-      region_mask = region[2]
-      initial_collector_count.times do | collector_num |
-        collector = collectors[collector_num]
-        if (collector) then
-          collector_mask = collector[0]
-          if (collector_mask & region_mask != 0) then
-            if (collector_found) then
-              collector_found[0] |= collector_mask
-              collector_found[1] += collector[1]
-              collector_found[2] |= collector[2]
-              collectors[collector_num] = nil
-            else
-              collector_found = collector
-              collector[1] += region[1]
-              collector[2] |= region_mask
-            end
-          end
-        end
-      end
-      if (collector_found == nil) then
-        collectors.push(Array.new(region))
-      end
-    end
-
-    # check the existing collectors, if any collector overlapped no bits in the region its [2] value will
-    # be zero.  The size of any such reaason is tested if it is not a muliple of five true is returned since
-    # the board is prunable.  if it is a multiple of five it is removed.
-    # Collector that are still active have a new adjacent value [0] set based n the matched bits
-    # and have [2] cleared out for the next cycle.
-    collectors.length.times do | collector_num |
-      collector = collectors[collector_num]
-      if (collector) then
-        if (collector[2] == 0) then
-          return true if (collector[1] % 5 != 0)
-          collectors[collector_num] = nil
-        else
-          # if a collector matches all bits in the row then we can return unprunable early for the
-          # follwing reasons:
-          #    1) there can be no more unavailable bits bince we fill from the top left downward
-          #    2) all previous regions have been closed or joined so only this region can fail
-          #    3) this region must be good since there can never be only 1 region that is nuot
-          #       a multiple of five
-          # this rule only applies when filling normally, so we ignore the rule if we are "slotting"
-          # in pieces to see what configurations work for them (the only other time this algorithm is used).
-          return false if (collector[2] == 0b11111 && !slotting)
-          collector[0] = converter[collector[2]]
-          collector[2] = 0
-        end
-      end
-    end
-
-    # get rid of all the empty converters for the next round
-    collectors.compact!
-  end
-  return false if (collectors.length <= 1) # 1 collector or less and the region is fine
-  collectors.any? { | collector | (collector[1] % 5) != 0 } # more than 1 and we test them all for bad size
-end
-
-# creates a region given a row mask.  see prunable for what a "region" is
-def create_regions( value )
-  regions = []
-  cur_region = 0
-  5.times do | bit |
-    if (value[bit] == 0) then
-      cur_region |= 1 << bit
-    else
-      if (cur_region != 0 ) then
-        regions.push( cur_region)
-        cur_region = 0;
-      end
-    end
-  end
-  regions.push(cur_region) if (cur_region != 0)
-  regions
-end
-
-# find up to the counted number of solutions (or all solutions) and prints the final result
-def find_all
-  find_top( 1)
-  find_top( 0)
-  print_results
-end
-
-# show the board
-def print_results
-  print "#{@boards_found} solutions found\n\n"
-  print_full_board( @min_board)
-  print "\n"
-  print_full_board( @max_board)
-  print "\n"
-end
-
-# finds solutions.  This special version of the main function is only used for the top level
-# the reason for it is basically to force a particular ordering on how the rotations are tested for
-# the first piece.  It is called twice, first looking for placements of the odd rotations and then
-# looking for placements of the even locations.
-#
-# WHY?
-#   Since any found solution has an inverse we want to maximize finding solutions that are not already found
-#   as an inverse.  The inverse will ALWAYS be 3 one of the piece configurations that is exactly 3 rotations away
-#   (an odd number).  Checking even vs odd then produces a higher probability of finding more pieces earlier
-#   in the cycle.  We still need to keep checking all the permutations, but our probability of finding one will
-#   diminsh over time.  Since we are TOLD how many to search for this lets us exit before checking all pieces
-#   this bennifit is very great when seeking small numbers of solutions and is 0 when looking for more than the
-#   maximum number
-def find_top( rotation_skip)
-  board = blank_board
-  (@pieces.length-1).times do
-    piece = @pieces.shift
-    piece.masks[0].each do | mask, imask, cmask |
-      if ((rotation_skip += 1) % 2 == 0) then
-        piece.placed = mask
-        find( 1, 1, board | mask)
-      end
-    end
-    @pieces.push(piece)
-  end
-  piece = @pieces.shift
-  @pieces.push(piece)
-end
-
-# the normail find routine, iterates through the available pieces, checks all rotations at the current location
-# and adds any boards found.  depth is acheived via recursion.  the overall approach is described
-# here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
-# parameters:
-#  start_location -- where to start looking for place for the next piece at
-#  placed -- number of pieces placed
-#  board -- current state of the board
-#
-# see in-code comments
-def find( start_location, placed, board)
-  # find the next location to place a piece by looking for an empty bit
-  while board[start_location] == 1
-    start_location += 1
-  end
-
-  @pieces.length.times do
-    piece = @pieces.shift
-    piece.masks[start_location].each do | mask, imask, cmask |
-      if ( board & cmask == imask) then
-        piece.placed = mask
-        if (placed == 9) then
-          add_board
-        else
-          find( start_location + 1, placed + 1, board | mask)
-        end
-      end
-    end
-    @pieces.push(piece)
-  end
-end
-
-# print the board
-def print_full_board( board_string)
-  10.times do | row |
-    print " " if (row % 2 == 1)
-    5.times do | col |
-      print "#{board_string[row*5 + col,1]} "
-    end
-    print "\n"
-  end
-end
-
-# when a board is found we "draw it" into a string and then flip that string, adding both to
-# the list (hash) of solutions if they are unique.
-def add_board
-  board_string = "99999999999999999999999999999999999999999999999999"
-  @all_pieces.each {  | piece | piece.fill_string( board_string ) }
-  save( board_string)
-  save( board_string.reverse)
-end
-
-# adds a board string to the list (if new) and updates the current best/worst board
-def save( board_string)
-  if (@all_boards[board_string] == nil) then
-    @min_board = board_string if (board_string < @min_board)
-    @max_board = board_string if (board_string > @max_board)
-    @all_boards.store(board_string,true)
-    @boards_found += 1
-
-    # the exit motif is a time saver.  Ideally the function should return, but those tests
-    # take noticable time (performance).
-    if (@boards_found == @stop_count) then
-      print_results
-      exit(0)
-    end
-  end
-end
-
-
-##
-## MAIN BODY :)
-##
-create_collector_support
-@pieces = [
-  Piece.new( [ :nw, :ne, :east, :east ], 2),
-  Piece.new( [ :ne, :se, :east, :ne ], 7),
-  Piece.new( [ :ne, :east, :ne, :nw ], 1),
-  Piece.new( [ :east, :sw, :sw, :se ], 6),
-  Piece.new( [ :east, :ne, :se, :ne ], 5),
-  Piece.new( [ :east, :east, :east, :se ], 0),
-  Piece.new( [ :ne, :nw, :se, :east, :se ], 4),
-  Piece.new( [ :se, :se, :se, :west ], 9),
-  Piece.new( [ :se, :se, :east, :se ], 8),
-  Piece.new( [ :east, :east, :sw, :se ], 3)
-  ];
-
-@all_pieces = Array.new( @pieces)
-
-@min_board = "99999999999999999999999999999999999999999999999999"
-@max_board = "00000000000000000000000000000000000000000000000000"
-@stop_count = ARGV[0].to_i || 2089
-@all_boards = {}
-@boards_found = 0
-
-find_all ######## DO IT!!!
-
diff --git a/benchmark/bm_so_nbody.rb b/benchmark/bm_so_nbody.rb
deleted file mode 100644
index d6c5bb9e61..0000000000
--- a/benchmark/bm_so_nbody.rb
+++ /dev/null
@@ -1,148 +0,0 @@
-# The Computer Language Shootout
-# http://shootout.alioth.debian.org
-#
-# Optimized for Ruby by Jesse Millikan
-# From version ported by Michael Neumann from the C gcc version,
-# which was written by Christoph Bauer.
-
-SOLAR_MASS = 4 * Math::PI**2
-DAYS_PER_YEAR = 365.24
-
-def _puts *args
-end
-
-class Planet
- attr_accessor :x, :y, :z, :vx, :vy, :vz, :mass
-
- def initialize(x, y, z, vx, vy, vz, mass)
-  @x, @y, @z = x, y, z
-  @vx, @vy, @vz = vx * DAYS_PER_YEAR, vy * DAYS_PER_YEAR, vz * DAYS_PER_YEAR
-  @mass = mass * SOLAR_MASS
- end
-
- def move_from_i(bodies, nbodies, dt, i)
-  while i < nbodies
-   b2 = bodies[i]
-   dx = @x - b2.x
-   dy = @y - b2.y
-   dz = @z - b2.z
-
-   distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
-   mag = dt / (distance * distance * distance)
-   b_mass_mag, b2_mass_mag = @mass * mag, b2.mass * mag
-
-   @vx -= dx * b2_mass_mag
-   @vy -= dy * b2_mass_mag
-   @vz -= dz * b2_mass_mag
-   b2.vx += dx * b_mass_mag
-   b2.vy += dy * b_mass_mag
-   b2.vz += dz * b_mass_mag
-   i += 1
-  end
-
-  @x += dt * @vx
-  @y += dt * @vy
-  @z += dt * @vz
- end
-end
-
-def energy(bodies)
-  e = 0.0
-  nbodies = bodies.size
-
-  for i in 0 ... nbodies
-    b = bodies[i]
-    e += 0.5 * b.mass * (b.vx * b.vx + b.vy * b.vy + b.vz * b.vz)
-    for j in (i + 1) ... nbodies
-      b2 = bodies[j]
-      dx = b.x - b2.x
-      dy = b.y - b2.y
-      dz = b.z - b2.z
-      distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
-      e -= (b.mass * b2.mass) / distance
-    end
-  end
-  e
-end
-
-def offset_momentum(bodies)
-  px, py, pz = 0.0, 0.0, 0.0
-
-  for b in bodies
-    m = b.mass
-    px += b.vx * m
-    py += b.vy * m
-    pz += b.vz * m
-  end
-
-  b = bodies[0]
-  b.vx = - px / SOLAR_MASS
-  b.vy = - py / SOLAR_MASS
-  b.vz = - pz / SOLAR_MASS
-end
-
-BODIES = [
-  # sun
-  Planet.new(0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0),
-
-  # jupiter
-  Planet.new(
-    4.84143144246472090e+00,
-    -1.16032004402742839e+00,
-    -1.03622044471123109e-01,
-    1.66007664274403694e-03,
-    7.69901118419740425e-03,
-    -6.90460016972063023e-05,
-    9.54791938424326609e-04),
-
-  # saturn
-  Planet.new(
-    8.34336671824457987e+00,
-    4.12479856412430479e+00,
-    -4.03523417114321381e-01,
-    -2.76742510726862411e-03,
-    4.99852801234917238e-03,
-    2.30417297573763929e-05,
-    2.85885980666130812e-04),
-
-  # uranus
-  Planet.new(
-    1.28943695621391310e+01,
-    -1.51111514016986312e+01,
-    -2.23307578892655734e-01,
-    2.96460137564761618e-03,
-    2.37847173959480950e-03,
-    -2.96589568540237556e-05,
-    4.36624404335156298e-05),
-
-  # neptune
-  Planet.new(
-    1.53796971148509165e+01,
-    -2.59193146099879641e+01,
-    1.79258772950371181e-01,
-    2.68067772490389322e-03,
-    1.62824170038242295e-03,
-    -9.51592254519715870e-05,
-    5.15138902046611451e-05)
-]
-
-init = 200_000 # ARGV[0]
-n = Integer(init)
-
-offset_momentum(BODIES)
-
-puts "%.9f" % energy(BODIES)
-
-nbodies = BODIES.size
-dt = 0.01
-
-n.times do
-  i = 0
-  while i < nbodies
-    b = BODIES[i]
-    b.move_from_i(BODIES, nbodies, dt, i + 1)
-    i += 1
-  end
-end
-
-puts "%.9f" % energy(BODIES)
diff --git a/benchmark/bm_so_nested_loop.rb b/benchmark/bm_so_nested_loop.rb
deleted file mode 100644
index a0513f8c47..0000000000
--- a/benchmark/bm_so_nested_loop.rb
+++ /dev/null
@@ -1,24 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: nestedloop-ruby.code,v 1.4 2004/11/13 07:42:22 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# from Avi Bryant
-
-n = 16 # Integer(ARGV.shift || 1)
-x = 0
-n.times do
-    n.times do
-        n.times do
-            n.times do
-                n.times do
-                    n.times do
-                        x += 1
-                    end
-                end
-            end
-        end
-    end
-end
-# puts x
-
-
diff --git a/benchmark/bm_so_nsieve_bits.rb b/benchmark/bm_so_nsieve_bits.rb
deleted file mode 100644
index 019b8b6382..0000000000
--- a/benchmark/bm_so_nsieve_bits.rb
+++ /dev/null
@@ -1,42 +0,0 @@
-#!/usr/bin/ruby
-#
-# The Great Computer Language Shootout
-# http://shootout.alioth.debian.org/
-#
-# nsieve-bits in Ruby
-# Contributed by Glenn Parker, March 2005
-
-CharExponent = 3
-BitsPerChar = 1 << CharExponent
-LowMask = BitsPerChar - 1
-
-def sieve(m)
-  items = "\xFF" * ((m / BitsPerChar) + 1)
-  masks = ""
-  BitsPerChar.times do |b|
-    masks << (1 << b).chr
-  end
-
-  count = 0
-  pmax = m - 1
-  2.step(pmax, 1) do |p|
-    if items[p >> CharExponent][p & LowMask] == 1
-      count += 1
-      p.step(pmax, p) do |mult|
-	a = mult >> CharExponent
-	b = mult & LowMask
-	items[a] -= masks[b] if items[a][b] != 0
-      end
-    end
-  end
-  count
-end
-
-n = 9 # (ARGV[0] || 2).to_i
-n.step(n - 2, -1) do |exponent|
-  break if exponent < 0
-  m = 2 ** exponent * 10_000
-  count = sieve(m)
-  printf "Primes up to %8d %8d\n", m, count
-end
-
diff --git a/benchmark/bm_so_object.rb b/benchmark/bm_so_object.rb
deleted file mode 100644
index e8607c7199..0000000000
--- a/benchmark/bm_so_object.rb
+++ /dev/null
@@ -1,56 +0,0 @@
-#!/usr/bin/ruby
-# -*- mode: ruby -*-
-# $Id: objinst-ruby.code,v 1.4 2004/11/13 07:42:25 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-# with help from Aristarkh Zagorodnikov
-
-class Toggle
-    def initialize(start_state)
-        @bool = start_state
-    end
-
-    def value
-        @bool
-    end
-
-    def activate
-        @bool = !@bool
-        self
-    end
-end
-
-class NthToggle < Toggle
-    def initialize(start_state, max_counter)
-        super start_state
-        @count_max = max_counter
-        @counter = 0
-    end
-
-    def activate
-        @counter += 1
-        if @counter >= @count_max
-            @bool = !@bool
-            @counter = 0
-        end
-        self
-    end
-end
-
-n = 1500000 # (ARGV.shift || 1).to_i
-
-toggle = Toggle.new 1
-5.times do
-    toggle.activate.value ? 'true' : 'false'
-end
-n.times do
-    toggle = Toggle.new 1
-end
-
-ntoggle = NthToggle.new 1, 3
-8.times do
-    ntoggle.activate.value ? 'true' : 'false'
-end
-n.times do
-    ntoggle = NthToggle.new 1, 3
-end
-
diff --git a/benchmark/bm_so_pidigits.rb b/benchmark/bm_so_pidigits.rb
deleted file mode 100644
index c7d6fbfb4d..0000000000
--- a/benchmark/bm_so_pidigits.rb
+++ /dev/null
@@ -1,92 +0,0 @@
-# The Great Computer Language Shootout
-# http://shootout.alioth.debian.org/
-#
-# contributed by Gabriele Renzi
-
-class PiDigitSpigot
-
-    def initialize()
-        @z = Transformation.new 1,0,0,1
-        @x = Transformation.new 0,0,0,0
-        @inverse = Transformation.new 0,0,0,0
-    end
-
-    def next!
-        @y = @z.extract(3)
-        if safe? @y
-            @z = produce(@y)
-            @y
-        else
-            @z = consume @x.next!()
-            next!()
-        end
-    end
-
-    def safe?(digit)
-        digit == @z.extract(4)
-    end
-
-    def produce(i)
-        @inverse.qrst(10,-10*i,0,1).compose(@z)
-    end
-
-    def consume(a)
-        @z.compose(a)
-    end
-end
-
-
-class Transformation
-    attr_reader :q, :r, :s, :t
-    def initialize (q, r, s, t)
-        @q,@r,@s,@t,@k = q,r,s,t,0
-    end
-
-    def next!()
-        @q = @k = @k + 1
-        @r = 4 * @k + 2
-        @s = 0
-        @t = 2 * @k + 1
-        self
-    end
-
-    def extract(j)
-        (@q * j + @r) / (@s * j + @t)
-    end
-
-    def compose(a)
-        self.class.new( @q * a.q,
-                        @q * a.r + r * a.t,
-                        @s * a.q + t * a.s,
-                        @s * a.r + t * a.t
-                    )
-    end
-
-    def qrst *args
-        initialize *args
-        self
-    end
-
-
-end
-
-
-WIDTH = 10
-n = 2_500 # Integer(ARGV[0])
-j = 0
-
-digits = PiDigitSpigot.new
-
-while n > 0
-    if n >= WIDTH
-        WIDTH.times {print digits.next!}
-        j += WIDTH
-    else
-        n.times {print digits.next!}
-        (WIDTH-n).times {print " "}
-        j += n
-    end
-    puts "\t:"+j.to_s
-    n -= WIDTH
-end
-
diff --git a/benchmark/bm_so_random.rb b/benchmark/bm_so_random.rb
deleted file mode 100644
index 57f700b863..0000000000
--- a/benchmark/bm_so_random.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-# from http://www.bagley.org/~doug/shootout/bench/random/random.ruby
-
-IM = 139968.0
-IA = 3877.0
-IC = 29573.0
-
-$last = 42.0
-
-def gen_random(max)
-  (max * ($last = ($last * IA + IC) % IM)) / IM
-end
-
-N = 3_000_000
-
-i=0
-while i<N
-  i+=1
-  gen_random(100.0)
-end
-# "%.9f" % gen_random(100.0)
diff --git a/benchmark/bm_so_reverse_complement.rb b/benchmark/bm_so_reverse_complement.rb
deleted file mode 100644
index 82ea666994..0000000000
--- a/benchmark/bm_so_reverse_complement.rb
+++ /dev/null
@@ -1,30 +0,0 @@
-#!/usr/bin/ruby
-# The Great Computer Language Shootout
-# http://shootout.alioth.debian.org/
-#
-# Contributed by Peter Bjarke Olsen
-# Modified by Doug King
-
-seq=Array.new
-
-def revcomp(seq)
-  seq.reverse!.tr!('wsatugcyrkmbdhvnATUGCYRKMBDHVN','WSTAACGRYMKVHDBNTAACGRYMKVHDBN')
-  stringlen=seq.length
-  0.step(stringlen-1,60) {|x| print seq.slice(x,60) , "\n"}
-end
-
-input = open(File.join(File.dirname($0), 'fasta.output.2500000'), 'rb')
-
-while input.gets
-  if $_ =~ />/
-    if seq.length != 0
-      revcomp(seq.join)
-      seq=Array.new
-    end
-    puts $_
-  else
-    $_.sub(/\n/,'')
-    seq.push $_
-  end
-end
-revcomp(seq.join)
diff --git a/benchmark/bm_so_sieve.rb b/benchmark/bm_so_sieve.rb
deleted file mode 100644
index 3f1b138bd1..0000000000
--- a/benchmark/bm_so_sieve.rb
+++ /dev/null
@@ -1,24 +0,0 @@
-# from http://www.bagley.org/~doug/shootout/bench/sieve/sieve.ruby
-num = 500
-count = i = j = 0
-flags0 = Array.new(8192,1)
-k = 0
-while k < num
-  k+=1
-  count = 0
-  flags = flags0.dup
-  i = 2
-  while i<8192
-    i+=1
-    if flags[i]
-      # remove all multiples of prime: i
-      j = i*i
-      while j < 8192
-        j += i
-        flags[j] = nil
-      end
-      count += 1
-    end
-  end
-end
-count
diff --git a/benchmark/bm_vm1_block.rb b/benchmark/bm_vm1_block.rb
deleted file mode 100644
index 0a97883974..0000000000
--- a/benchmark/bm_vm1_block.rb
+++ /dev/null
@@ -1,10 +0,0 @@
-def m
-  yield
-end
-
-i=0
-while i<30_000_000 # while loop 1
-  i+=1
-  m{
-  }
-end
diff --git a/benchmark/bm_vm1_const.rb b/benchmark/bm_vm1_const.rb
deleted file mode 100644
index 066916dc31..0000000000
--- a/benchmark/bm_vm1_const.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-Const = 1
-
-i = 0
-while i<30_000_000 # while loop 1
-  i+= 1
-  j = Const
-  k = Const
-end
diff --git a/benchmark/bm_vm1_ensure.rb b/benchmark/bm_vm1_ensure.rb
deleted file mode 100644
index b1948f7621..0000000000
--- a/benchmark/bm_vm1_ensure.rb
+++ /dev/null
@@ -1,11 +0,0 @@
-i=0
-while i<30_000_000 # benchmark loop 1
-  i+=1
-  begin
-    begin
-    ensure
-    end
-  ensure
-  end
-end
-
diff --git a/benchmark/bm_vm1_ivar.rb b/benchmark/bm_vm1_ivar.rb
deleted file mode 100644
index 3ba56427f4..0000000000
--- a/benchmark/bm_vm1_ivar.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-@a = 1
-
-i = 0
-while i<30_000_000 # while loop 1
-  i+= 1
-  j = @a
-  k = @a
-end
diff --git a/benchmark/bm_vm1_ivar_set.rb b/benchmark/bm_vm1_ivar_set.rb
deleted file mode 100644
index c8076c6ab6..0000000000
--- a/benchmark/bm_vm1_ivar_set.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i = 0
-while i<30_000_000 # while loop 1
-  i+= 1
-  @a = 1
-  @b = 2
-end
diff --git a/benchmark/bm_vm1_length.rb b/benchmark/bm_vm1_length.rb
deleted file mode 100644
index ccb773278f..0000000000
--- a/benchmark/bm_vm1_length.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-a = 'abc'
-b = [1, 2, 3]
-i=0
-while i<30_000_000 # while loop 1
-  i+=1
-  a.length
-  b.length
-end
-
diff --git a/benchmark/bm_vm1_neq.rb b/benchmark/bm_vm1_neq.rb
deleted file mode 100644
index 9254a0ca9b..0000000000
--- a/benchmark/bm_vm1_neq.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-i = 0
-obj1 = Object.new
-obj2 = Object.new
-
-while i<30_000_000 # while loop 1
-  i+= 1
-  obj1 != obj2
-end
diff --git a/benchmark/bm_vm1_not.rb b/benchmark/bm_vm1_not.rb
deleted file mode 100644
index ee9d0f3605..0000000000
--- a/benchmark/bm_vm1_not.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-i = 0
-obj = Object.new
-
-while i<30_000_000 # while loop 1
-  i+= 1
-  !obj
-end
diff --git a/benchmark/bm_vm1_rescue.rb b/benchmark/bm_vm1_rescue.rb
deleted file mode 100644
index 3af12bb0f3..0000000000
--- a/benchmark/bm_vm1_rescue.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-i=0
-while i<30_000_000 # while loop 1
-  i+=1
-  begin
-  rescue
-  end
-end
diff --git a/benchmark/bm_vm1_simplereturn.rb b/benchmark/bm_vm1_simplereturn.rb
deleted file mode 100644
index 8e9bcb0129..0000000000
--- a/benchmark/bm_vm1_simplereturn.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-def m
-  return 1
-end
-i=0
-while i<30_000_000 # while loop 1
-  i+=1
-  m
-end
-
diff --git a/benchmark/bm_vm1_swap.rb b/benchmark/bm_vm1_swap.rb
deleted file mode 100644
index 611baf6b99..0000000000
--- a/benchmark/bm_vm1_swap.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-a = 1
-b = 2
-i=0
-while i<30_000_000 # while loop 1
-  i+=1
-  a, b = b, a
-end
-
diff --git a/benchmark/bm_vm2_array.rb b/benchmark/bm_vm2_array.rb
deleted file mode 100644
index 7713ae9f25..0000000000
--- a/benchmark/bm_vm2_array.rb
+++ /dev/null
@@ -1,5 +0,0 @@
-i=0
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  a = [1,2,3,4,5,6,7,8,9,10]
-end
diff --git a/benchmark/bm_vm2_case.rb b/benchmark/bm_vm2_case.rb
deleted file mode 100644
index cd09788a85..0000000000
--- a/benchmark/bm_vm2_case.rb
+++ /dev/null
@@ -1,14 +0,0 @@
-i=0
-while i<6_000_000 # while loop 2
-  case :foo
-  when :bar
-    raise
-  when :baz
-    raise
-  when :boo
-    raise
-  when :foo
-    i+=1
-  end
-end
-
diff --git a/benchmark/bm_vm2_defined_method.rb b/benchmark/bm_vm2_defined_method.rb
deleted file mode 100644
index 06c0d01baa..0000000000
--- a/benchmark/bm_vm2_defined_method.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-class Object
-  define_method(:m){}
-end
-
-i=0
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  m; m; m; m; m; m; m; m;
-end
diff --git a/benchmark/bm_vm2_eval.rb b/benchmark/bm_vm2_eval.rb
deleted file mode 100644
index e72b4661ac..0000000000
--- a/benchmark/bm_vm2_eval.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i=0
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  eval("1")
-end
-
diff --git a/benchmark/bm_vm2_method.rb b/benchmark/bm_vm2_method.rb
deleted file mode 100644
index f92e39a73f..0000000000
--- a/benchmark/bm_vm2_method.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-def m
-  nil
-end
-
-i=0
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  m; m; m; m; m; m; m; m;
-end
diff --git a/benchmark/bm_vm2_mutex.rb b/benchmark/bm_vm2_mutex.rb
deleted file mode 100644
index 01b1c478cb..0000000000
--- a/benchmark/bm_vm2_mutex.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-require 'thread'
-
-m = Mutex.new
-
-i=0
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  m.synchronize{}
-end
diff --git a/benchmark/bm_vm2_poly_method.rb b/benchmark/bm_vm2_poly_method.rb
deleted file mode 100644
index 921457d817..0000000000
--- a/benchmark/bm_vm2_poly_method.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-class C1
-  def m
-    1
-  end
-end
-class C2
-  def m
-    2
-  end
-end
-
-o1 = C1.new
-o2 = C2.new
-
-i=0
-while i<6_000_000 # benchmark loop 2
-  o = (i % 2 == 0) ? o1 : o2
-  o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
-  i+=1
-end
diff --git a/benchmark/bm_vm2_poly_method_ov.rb b/benchmark/bm_vm2_poly_method_ov.rb
deleted file mode 100644
index bf09837dd7..0000000000
--- a/benchmark/bm_vm2_poly_method_ov.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-class C1
-  def m
-    1
-  end
-end
-class C2
-  def m
-    2
-  end
-end
-
-o1 = C1.new
-o2 = C2.new
-
-i=0
-while i<6_000_000 # benchmark loop 2
-  o = (i % 2 == 0) ? o1 : o2
-#  o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
-  i+=1
-end
diff --git a/benchmark/bm_vm2_proc.rb b/benchmark/bm_vm2_proc.rb
deleted file mode 100644
index 3f51056bf9..0000000000
--- a/benchmark/bm_vm2_proc.rb
+++ /dev/null
@@ -1,14 +0,0 @@
-def m &b
-  b
-end
-
-pr = m{
-  a = 1
-}
-
-i=0
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  pr.call
-end
-
diff --git a/benchmark/bm_vm2_regexp.rb b/benchmark/bm_vm2_regexp.rb
deleted file mode 100644
index 428099e55a..0000000000
--- a/benchmark/bm_vm2_regexp.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i=0
-str = 'xxxhogexxx'
-while i<6_000_000 # benchmark loop 2
-  /hoge/ =~ str
-  i+=1
-end
diff --git a/benchmark/bm_vm2_send.rb b/benchmark/bm_vm2_send.rb
deleted file mode 100644
index 37c79fb1c3..0000000000
--- a/benchmark/bm_vm2_send.rb
+++ /dev/null
@@ -1,12 +0,0 @@
-class C
-  def m
-  end
-end
-
-o = C.new
-
-i=0
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  o.__send__ :m
-end
diff --git a/benchmark/bm_vm2_super.rb b/benchmark/bm_vm2_super.rb
deleted file mode 100644
index d4f0b647de..0000000000
--- a/benchmark/bm_vm2_super.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-
-class C
-  def m
-    1
-  end
-end
-
-class CC < C
-  def m
-    super()
-  end
-end
-
-obj = CC.new
-
-i = 0
-while i<6_000_000 # benchmark loop 2
-  obj.m
-  i+=1
-end
diff --git a/benchmark/bm_vm2_unif1.rb b/benchmark/bm_vm2_unif1.rb
deleted file mode 100644
index 775f4d37e6..0000000000
--- a/benchmark/bm_vm2_unif1.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-i = 0
-def m a, b
-end
-
-while i<6_000_000 # benchmark loop 2
-  i+=1
-  m 100, 200
-end
diff --git a/benchmark/bm_vm2_zsuper.rb b/benchmark/bm_vm2_zsuper.rb
deleted file mode 100644
index 7e90df1822..0000000000
--- a/benchmark/bm_vm2_zsuper.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-i = 0
-
-class C
-  def m a
-    1
-  end
-end
-
-class CC < C
-  def m a
-    super
-  end
-end
-
-obj = CC.new
-
-while i<6_000_000 # benchmark loop 2
-  obj.m 10
-  i+=1
-end
diff --git a/benchmark/bm_vm3_clearmethodcache.rb b/benchmark/bm_vm3_clearmethodcache.rb
deleted file mode 100644
index a25c372f06..0000000000
--- a/benchmark/bm_vm3_clearmethodcache.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-i=0
-while i<200_000
-  i+=1
-
-  Class.new{
-    def m; end
-  }
-end
diff --git a/benchmark/bm_vm3_gc.rb b/benchmark/bm_vm3_gc.rb
deleted file mode 100755
index 7db9829d44..0000000000
--- a/benchmark/bm_vm3_gc.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-#! /usr/bin/ruby
-5000.times do
-  100.times do
-    {"xxxx"=>"yyyy"}
-  end
-  GC.start
-end
diff --git a/benchmark/bm_vm_thread_alive_check1.rb b/benchmark/bm_vm_thread_alive_check1.rb
deleted file mode 100644
index c993accdda..0000000000
--- a/benchmark/bm_vm_thread_alive_check1.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-5_000.times{
-  t = Thread.new{}
-  while t.alive?
-    Thread.pass
-  end
-}
diff --git a/benchmark/bm_vm_thread_create_join.rb b/benchmark/bm_vm_thread_create_join.rb
deleted file mode 100644
index 325a66d587..0000000000
--- a/benchmark/bm_vm_thread_create_join.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-i=0
-while i<100_000 # benchmark loop 3
-  i+=1
-  Thread.new{
-  }.join
-end
diff --git a/benchmark/bm_vm_thread_mutex1.rb b/benchmark/bm_vm_thread_mutex1.rb
deleted file mode 100644
index 588506e87c..0000000000
--- a/benchmark/bm_vm_thread_mutex1.rb
+++ /dev/null
@@ -1,21 +0,0 @@
-# one thread, one mutex (no contention)
-
-require 'thread'
-m = Mutex.new
-r = 0
-max = 2000
-lmax = max * max
-(1..1).map{
-  Thread.new{
-    i=0
-    while i<lmax
-      i+=1
-      m.synchronize{
-        r += 1
-      }
-    end
-  }
-}.each{|e|
-  e.join
-}
-raise r.to_s if r != max * max
diff --git a/benchmark/bm_vm_thread_mutex2.rb b/benchmark/bm_vm_thread_mutex2.rb
deleted file mode 100644
index d700b146d4..0000000000
--- a/benchmark/bm_vm_thread_mutex2.rb
+++ /dev/null
@@ -1,21 +0,0 @@
-# two threads, one mutex
-
-require 'thread'
-m = Mutex.new
-r = 0
-max = 2000
-lmax = (max * max)/2
-(1..2).map{
-  Thread.new{
-    i=0
-    while i<lmax
-      i+=1
-      m.synchronize{
-        r += 1
-      }
-    end
-  }
-}.each{|e|
-  e.join
-}
-raise r.to_s if r != max * max
diff --git a/benchmark/bm_vm_thread_mutex3.rb b/benchmark/bm_vm_thread_mutex3.rb
deleted file mode 100644
index f502b6ac84..0000000000
--- a/benchmark/bm_vm_thread_mutex3.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-# 1000 threads, one mutex
-
-require 'thread'
-m = Mutex.new
-r = 0
-max = 2000
-(1..max).map{
-  Thread.new{
-    i=0
-    while i<max
-      i+=1
-      m.synchronize{
-        r += 1
-      }
-    end
-  }
-}.each{|e|
-  e.join
-}
-raise r.to_s if r != max * max
diff --git a/benchmark/bm_vm_thread_pass.rb b/benchmark/bm_vm_thread_pass.rb
deleted file mode 100644
index b5b3c0bc85..0000000000
--- a/benchmark/bm_vm_thread_pass.rb
+++ /dev/null
@@ -1,15 +0,0 @@
-# Plenty Thtread.pass
-# A performance may depend on GVL implementation.
-
-tmax = (ARGV.shift || 2).to_i
-lmax = 200_000 / tmax
-
-(1..tmax).map{
-  Thread.new{
-    lmax.times{
-      Thread.pass
-    }
-  }
-}.each{|t| t.join}
-
-
diff --git a/benchmark/bm_vm_thread_pass_flood.rb b/benchmark/bm_vm_thread_pass_flood.rb
deleted file mode 100644
index 56b5b0a956..0000000000
--- a/benchmark/bm_vm_thread_pass_flood.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-1000.times{
-  Thread.new{loop{Thread.pass}}
-}
-
-i=0
-while i<10000
-  i += 1
-end
diff --git a/benchmark/bm_vm_thread_pipe.rb b/benchmark/bm_vm_thread_pipe.rb
deleted file mode 100644
index 272d231eba..0000000000
--- a/benchmark/bm_vm_thread_pipe.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# Mesure small and plenty pipe read/write.
-# A performance may depend on GVL implementation.
-
-lmax = 100_000
-r, w = IO.pipe
-[Thread.new{
-  lmax.times{
-    w.write('a')
-  }
-  p "w:exit"
-}, Thread.new{
-  lmax.times{
-    r.read(1)
-  }
-  p "r:exit"
-}].each{|t| t.join}
-
diff --git a/benchmark/bmx_temp.rb b/benchmark/bmx_temp.rb
deleted file mode 100644
index 0b4b219ca2..0000000000
--- a/benchmark/bmx_temp.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-def m
-  nil
-end
-
-i=0
-while i<800000 # benchmark loop 2
-  i+=1
-  m; m; m; m; m; m; m; m;
-end
diff --git a/benchmark/buffer_each.yml b/benchmark/buffer_each.yml
new file mode 100644
index 0000000000..417941104e
--- /dev/null
+++ b/benchmark/buffer_each.yml
@@ -0,0 +1,27 @@
+prelude: |
+  # frozen_string_literal: true
+  Warning[:experimental] = false
+  string = "The quick brown fox jumped over the lazy dog."
+  array = string.bytes
+  buffer = IO::Buffer.for(string)
+benchmark:
+  string.each_byte: |
+    upcased = String.new
+    string.each_byte do |byte|
+      upcased << (byte ^ 32)
+    end
+  array.each: |
+    upcased = String.new
+    array.each do |byte|
+      upcased << (byte ^ 32)
+    end
+  buffer.each: |
+    upcased = String.new
+    buffer.each(:U8) do |offset, byte|
+      upcased << (byte ^ 32)
+    end
+  buffer.each_byte: |
+    upcased = String.new
+    buffer.each_byte do |byte|
+      upcased << (byte ^ 32)
+    end
diff --git a/benchmark/buffer_get.yml b/benchmark/buffer_get.yml
new file mode 100644
index 0000000000..9e1f99d64e
--- /dev/null
+++ b/benchmark/buffer_get.yml
@@ -0,0 +1,25 @@
+prelude: |
+  # frozen_string_literal: true
+  Warning[:experimental] = false
+  string = "The quick brown fox jumped over the lazy dog."
+  buffer = IO::Buffer.for(string)
+  format = [:U32, :U32, :U32, :U32]
+benchmark:
+  string.unpack1: |
+    [
+      string.unpack1("N"),
+      string.unpack1("N", offset: 4),
+      string.unpack1("N", offset: 8),
+      string.unpack1("N", offset: 12),
+    ]
+  buffer.get_value: |
+    [
+      buffer.get_value(:U32, 0),
+      buffer.get_value(:U32, 4),
+      buffer.get_value(:U32, 8),
+      buffer.get_value(:U32, 12),
+    ]
+  buffer.get_values: |
+    buffer.get_values(format, 0)
+  string.unpack: |
+    string.unpack("NNNN")
diff --git a/benchmark/cgi_escape_html.yml b/benchmark/cgi_escape_html.yml
new file mode 100644
index 0000000000..655be9d7d8
--- /dev/null
+++ b/benchmark/cgi_escape_html.yml
@@ -0,0 +1,31 @@
+prelude: |
+  # frozen_string_literal: true
+  require 'cgi/escape'
+benchmark:
+  - script: CGI.escapeHTML("")
+    loop_count: 20000000
+  - script: CGI.escapeHTML("abcde")
+    loop_count: 20000000
+  - script: CGI.escapeHTML("abcd<")
+    loop_count: 20000000
+  - script: CGI.escapeHTML("'&\"<>")
+    loop_count: 5000000
+  - prelude: long_no_escape = "abcde" * 300
+    script: CGI.escapeHTML(long_no_escape)
+    loop_count: 1000000
+  - prelude: long_all_escape = "'&\"<>" * 10
+    script: CGI.escapeHTML(long_all_escape)
+    loop_count: 1000000
+  - prelude: | # http://example.com/
+      example_html = <<~HTML
+        <body>
+        <div>
+            <h1>Example Domain</h1>
+            <p>This domain is established to be used for illustrative examples in documents. You may use this
+            domain in examples without prior coordination or asking for permission.</p>
+            <p><a href="http://www.iana.org/domains/example">More information...</a></p>
+        </div>
+        </body>
+      HTML
+    script: CGI.escapeHTML(example_html)
+    loop_count: 1000000
diff --git a/benchmark/complex_float_add.yml b/benchmark/complex_float_add.yml
new file mode 100644
index 0000000000..d0150c5e5b
--- /dev/null
+++ b/benchmark/complex_float_add.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_add: c = a + b
+loop_count: 1000000
diff --git a/benchmark/complex_float_div.yml b/benchmark/complex_float_div.yml
new file mode 100644
index 0000000000..b9f5e1d51c
--- /dev/null
+++ b/benchmark/complex_float_div.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_div: c = a / b
+loop_count: 1000000
diff --git a/benchmark/complex_float_mul.yml b/benchmark/complex_float_mul.yml
new file mode 100644
index 0000000000..59b096a6dc
--- /dev/null
+++ b/benchmark/complex_float_mul.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_mul: c = a * b
+loop_count: 1000000
diff --git a/benchmark/complex_float_new.yml b/benchmark/complex_float_new.yml
new file mode 100644
index 0000000000..6fcde3125b
--- /dev/null
+++ b/benchmark/complex_float_new.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_new: c = Complex(a, b)
+loop_count: 1000000
diff --git a/benchmark/complex_float_power.yml b/benchmark/complex_float_power.yml
new file mode 100644
index 0000000000..c40a31ab55
--- /dev/null
+++ b/benchmark/complex_float_power.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_power: c = a ** b
+loop_count: 1000000
diff --git a/benchmark/complex_float_sub.yml b/benchmark/complex_float_sub.yml
new file mode 100644
index 0000000000..3fafe7cdbe
--- /dev/null
+++ b/benchmark/complex_float_sub.yml
@@ -0,0 +1,7 @@
+prelude: |
+  max, min = 1000.0, -1000.0
+  a = Complex(rand(max)+min, rand(max)+min)
+  b = Complex(rand(max)+min, rand(max)+min)
+benchmark:
+  complex_float_sub: c = a - b
+loop_count: 1000000
diff --git a/benchmark/constant_invalidation.rb b/benchmark/constant_invalidation.rb
new file mode 100644
index 0000000000..a95ec6f37e
--- /dev/null
+++ b/benchmark/constant_invalidation.rb
@@ -0,0 +1,22 @@
+$VERBOSE = nil
+
+CONSTANT1 = 1
+CONSTANT2 = 1
+CONSTANT3 = 1
+CONSTANT4 = 1
+CONSTANT5 = 1
+
+def constants
+  [CONSTANT1, CONSTANT2, CONSTANT3, CONSTANT4, CONSTANT5]
+end
+
+500_000.times do
+  constants
+
+  # With previous behavior, this would cause all of the constant caches
+  # associated with the constant lookups listed above to invalidate, meaning
+  # they would all have to be fetched again. With current behavior, it only
+  # invalidates when a name matches, so the following constant set shouldn't
+  # impact the constant lookups listed above.
+  INVALIDATE = true
+end
diff --git a/benchmark/dir_empty_p.rb b/benchmark/dir_empty_p.rb
new file mode 100644
index 0000000000..8329c757cf
--- /dev/null
+++ b/benchmark/dir_empty_p.rb
@@ -0,0 +1,5 @@
+require 'tmpdir'
+max = 100_000
+Dir.mktmpdir('bm_dir_empty_p') do |dir|
+  max.times { Dir.empty?(dir) }
+end
diff --git a/benchmark/driver.rb b/benchmark/driver.rb
deleted file mode 100644
index f689ebfe2c..0000000000
--- a/benchmark/driver.rb
+++ /dev/null
@@ -1,269 +0,0 @@
-#
-# Ruby Benchmark driver
-#
-
-first = true
-
-begin
-  require 'optparse'
-rescue LoadError
-  if first
-    first = false
-    $:.unshift File.join(File.dirname(__FILE__), '../lib')
-    retry
-  else
-    raise
-  end
-end
-
-require 'benchmark'
-require 'pp'
-
-class BenchmarkDriver
-  def self.benchmark(opt)
-    driver = self.new(opt[:execs], opt[:dir], opt)
-    begin
-      driver.run
-    ensure
-      driver.show_results
-    end
-  end
-
-  def output *args
-    puts(*args)
-    @output and @output.puts(*args)
-  end
-
-  def message *args
-    output(*args) if @verbose
-  end
-
-  def message_print *args
-    if @verbose
-      print(*args)
-      STDOUT.flush
-      @output and @output.print(*args)
-    end
-  end
-
-  def progress_message *args
-    unless STDOUT.tty?
-      STDERR.print(*args)
-      STDERR.flush
-    end
-  end
-
-  def initialize execs, dir, opt = {}
-    @execs = execs.map{|e|
-      e.strip!
-      next if e.empty?
-
-      if /(.+)::(.+)/ =~ e
-        # ex) ruby-a::/path/to/ruby-a
-        v = $1.strip
-        e = $2
-      else
-        v =  `#{e} -v`.chomp
-        v.sub!(/ patchlevel \d+/, '')
-      end
-      [e, v]
-    }.compact
-
-    @dir = dir
-    @repeat = opt[:repeat] || 1
-    @repeat = 1 if @repeat < 1
-    @pattern = opt[:pattern] || nil
-    @verbose = opt[:quiet] ? false : (opt[:verbose] || false)
-    @output = opt[:output] ? open(opt[:output], 'w') : nil
-    @loop_wl1 = @loop_wl2 = nil
-    @opt = opt
-
-    # [[name, [[r-1-1, r-1-2, ...], [r-2-1, r-2-2, ...]]], ...]
-    @results = []
-
-    if @verbose
-      @start_time = Time.now
-      message @start_time
-      @execs.each_with_index{|(_, v), i|
-        message "target #{i}: #{v}"
-      }
-    end
-  end
-
-  def average results
-    results.inject(:+) / results.length
-  end
-
-  def show_results
-    output
-
-    if @verbose
-      message '-----------------------------------------------------------'
-      message 'raw data:'
-      message
-      message PP.pp(@results, "", 79)
-      message
-      message "Elapesed time: #{Time.now - @start_time} (sec)"
-    end
-
-    output '-----------------------------------------------------------'
-    output 'benchmark results:'
-
-    if @verbose and @repeat > 1
-      output "minimum results in each #{@repeat} measurements."
-    end
-
-    difference = "\taverage difference" if @execs.length == 2
-    total_difference = 0
-
-    output "name\t#{@execs.map{|(_, v)| v}.join("\t")}#{difference}"
-    @results.each{|v, result|
-      rets = []
-      s = nil
-      result.each_with_index{|e, i|
-        r = e.min
-        case v
-        when /^vm1_/
-          if @loop_wl1
-            r -= @loop_wl1[i]
-            s = '*'
-          end
-        when /^vm2_/
-          if @loop_wl2
-            r -= @loop_wl2[i]
-            s = '*'
-          end
-        end
-        rets << sprintf("%.3f", r)
-      }
-
-      if difference
-        diff = average(result.last) - average(result.first)
-        total_difference += diff
-        rets << sprintf("%.3f", diff)
-      end
-
-      output "#{v}#{s}\t#{rets.join("\t")}"
-    }
-
-    if difference and @verbose
-      output '-----------------------------------------------------------'
-      output "average total difference is #{total_difference}"
-    end
-  end
-
-  def files
-    flag = {}
-    @files = Dir.glob(File.join(@dir, 'bm*.rb')).map{|file|
-      next if @pattern && /#{@pattern}/ !~ File.basename(file)
-      case file
-      when /bm_(vm[12])_/, /bm_loop_(whileloop2?).rb/
-        flag[$1] = true
-      end
-      file
-    }.compact
-
-    if flag['vm1'] && !flag['whileloop']
-      @files << File.join(@dir, 'bm_loop_whileloop.rb')
-    elsif flag['vm2'] && !flag['whileloop2']
-      @files << File.join(@dir, 'bm_loop_whileloop2.rb')
-    end
-
-    @files.sort!
-    progress_message "total: #{@files.size * @repeat} trial(s) (#{@repeat} trial(s) for #{@files.size} benchmark(s))\n"
-    @files
-  end
-
-  def run
-    files.each_with_index{|file, i|
-      @i = i
-      r = measure_file(file)
-
-      if /bm_loop_whileloop.rb/ =~ file
-        @loop_wl1 = r[1].map{|e| e.min}
-      elsif /bm_loop_whileloop2.rb/ =~ file
-        @loop_wl2 = r[1].map{|e| e.min}
-      end
-    }
-  end
-
-  def measure_file file
-    name = File.basename(file, '.rb').sub(/^bm_/, '')
-    prepare_file = File.join(File.dirname(file), "prepare_#{name}.rb")
-    load prepare_file if FileTest.exist?(prepare_file)
-
-    if @verbose
-      output
-      output '-----------------------------------------------------------'
-      output name
-      output
-      output File.read(file)
-      output
-    end
-
-    result = [name]
-    result << @execs.map{|(e, v)|
-      (0...@repeat).map{
-        message_print "#{v}\t"
-        progress_message '.'
-
-        m = measure(e, file)
-        message "#{m}"
-        m
-      }
-    }
-    @results << result
-    result
-  end
-
-  def measure executable, file
-    cmd = "#{executable} #{file}"
-    m = Benchmark.measure{
-      `#{cmd}`
-    }
-
-    if $? != 0
-      raise "\`#{cmd}\' exited with abnormal status (#{$?})"
-    end
-
-    m.real
-  end
-end
-
-if __FILE__ == $0
-  opt = {
-    :execs => ['ruby'],
-    :dir => './',
-    :repeat => 1,
-    :output => "bmlog-#{Time.now.strftime('%Y%m%d-%H%M%S')}.#{$$}",
-  }
-
-  parser = OptionParser.new{|o|
-    o.on('-e', '--executables [EXECS]',
-         "Specify benchmark one or more targets. (exec1; exec2; exec3, ...)"){|e|
-      opt[:execs] = e.split(/;/)
-    }
-    o.on('-d', '--directory [DIRECTORY]', "Benchmark suites directory"){|d|
-      opt[:dir] = d
-    }
-    o.on('-p', '--pattern [PATTERN]', "Benchmark name pattern"){|p|
-      opt[:pattern] = p
-    }
-    o.on('-r', '--repeat-count [NUM]', "Repeat count"){|n|
-      opt[:repeat] = n.to_i
-    }
-    o.on('-o', '--output-file [FILE]', "Output file"){|f|
-      opt[:output] = f
-    }
-    o.on('-q', '--quiet', "Run without notify information except result table."){|q|
-      opt[:quiet] = q
-    }
-    o.on('-v', '--verbose'){|v|
-      opt[:verbose] = v
-    }
-  }
-
-  parser.parse!(ARGV)
-  BenchmarkDriver.benchmark(opt)
-end
-
diff --git a/benchmark/enum_lazy_flat_map.yml b/benchmark/enum_lazy_flat_map.yml
new file mode 100644
index 0000000000..0ee390a441
--- /dev/null
+++ b/benchmark/enum_lazy_flat_map.yml
@@ -0,0 +1,16 @@
+prelude: |
+  num = (1..).lazy.take(100)
+  ary2 = [[1,2]].cycle.lazy.take(10)
+  ary10 = [[*1..10]].cycle.lazy.take(10)
+  ary20 = [[*1..20]].cycle.lazy.take(10)
+  ary50 = [[*1..50]].cycle.lazy.take(10)
+  ary100 = [[*1..100]].cycle.lazy.take(10)
+
+benchmark:
+  num3: num.flat_map {|x| x}.take(3).to_a
+  num10: num.flat_map {|x| x}.take(3).to_a
+  ary2:  ary2.flat_map {|x| x}.take(3).to_a
+  ary10: ary10.flat_map {|x| x}.take(3).to_a
+  ary20: ary20.flat_map {|x| x}.take(3).to_a
+  ary50: ary50.flat_map {|x| x}.take(3).to_a
+  ary100: ary100.flat_map {|x| x}.take(3).to_a
diff --git a/benchmark/enum_lazy_grep_v_100.rb b/benchmark/enum_lazy_grep_v_100.rb
new file mode 100644
index 0000000000..8832392e65
--- /dev/null
+++ b/benchmark/enum_lazy_grep_v_100.rb
@@ -0,0 +1,4 @@
+grep_data = (1..10).to_a * 1000
+N = 100
+enum = grep_data.lazy.grep_v(->(i){i == 0}).grep_v(->(i){i == 0})
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_grep_v_20.rb b/benchmark/enum_lazy_grep_v_20.rb
new file mode 100644
index 0000000000..329509fa8f
--- /dev/null
+++ b/benchmark/enum_lazy_grep_v_20.rb
@@ -0,0 +1,4 @@
+grep_data = (1..10).to_a * 1000
+N = 100
+enum = grep_data.lazy.grep_v(->(i){i > 2}).grep_v(->(i){i > 2})
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_grep_v_50.rb b/benchmark/enum_lazy_grep_v_50.rb
new file mode 100644
index 0000000000..02ea4d4e71
--- /dev/null
+++ b/benchmark/enum_lazy_grep_v_50.rb
@@ -0,0 +1,4 @@
+grep_data = (1..10).to_a * 1000
+N = 100
+enum = grep_data.lazy.grep_v(->(i){i > 5}).grep_v(->(i){i > 5})
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_uniq_100.rb b/benchmark/enum_lazy_uniq_100.rb
new file mode 100644
index 0000000000..2e6434d9c4
--- /dev/null
+++ b/benchmark/enum_lazy_uniq_100.rb
@@ -0,0 +1,4 @@
+uniq_data = (1..10_000).to_a
+N = 100
+enum = uniq_data.lazy.uniq {|i| i % 10000}.uniq {|i| i % 10000}
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_uniq_20.rb b/benchmark/enum_lazy_uniq_20.rb
new file mode 100644
index 0000000000..75e6398fee
--- /dev/null
+++ b/benchmark/enum_lazy_uniq_20.rb
@@ -0,0 +1,4 @@
+uniq_data = (1..10_000).to_a
+N = 100
+enum = uniq_data.lazy.uniq {|i| i % 2000}.uniq {|i| i % 2000}
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_uniq_50.rb b/benchmark/enum_lazy_uniq_50.rb
new file mode 100644
index 0000000000..59a39b78ff
--- /dev/null
+++ b/benchmark/enum_lazy_uniq_50.rb
@@ -0,0 +1,4 @@
+uniq_data = (1..10_000).to_a
+N = 100
+enum = uniq_data.lazy.uniq {|i| i % 5000}.uniq {|i| i % 5000}
+N.times {enum.each {}}
diff --git a/benchmark/enum_lazy_zip.yml b/benchmark/enum_lazy_zip.yml
new file mode 100644
index 0000000000..4566ff0261
--- /dev/null
+++ b/benchmark/enum_lazy_zip.yml
@@ -0,0 +1,22 @@
+prelude: |
+  a = (1..3).lazy
+  b = a.map {|x| x}
+
+benchmark:
+  first_ary: a.zip(["a", "b", "c"]).first
+  first_nonary: a.zip("a".."c").first
+  first_noarg: a.zip.first
+
+  take3_ary: a.zip(["a", "b", "c"]).take(3).force
+  take3_nonary: a.zip("a".."c").take(3).force
+  take3_noarg: a.zip.take(3).force
+
+  chain-first_ary: b.zip(["a", "b", "c"]).first
+  chain-first_nonary: b.zip("a".."c").first
+  chain-first_noarg: b.zip.first
+
+  chain-take3_ary: b.zip(["a", "b", "c"]).take(3).force
+  chain-take3_nonary: b.zip("a".."c").take(3).force
+  chain-take3_noarg: b.zip.take(3).force
+
+  block: a.zip("a".."c") {|x, y| [x, y]}
diff --git a/benchmark/enum_minmax.yml b/benchmark/enum_minmax.yml
new file mode 100644
index 0000000000..9d01731abb
--- /dev/null
+++ b/benchmark/enum_minmax.yml
@@ -0,0 +1,25 @@
+prelude: |
+  set2 = 2.times.to_a.shuffle.to_set
+  set10 = 10.times.to_a.shuffle.to_set
+  set100 = 100.times.to_a.shuffle.to_set
+  set1000 = 1000.times.to_a.shuffle.to_set
+  set10000 = 10000.times.to_a.shuffle.to_set
+
+benchmark:
+  set2.min: set2.min
+  set10.min: set10.min
+  set100.min: set100.min
+  set1000.min: set1000.min
+  set10000.min: set10000.min
+  set2.max: set2.max
+  set10.max: set10.max
+  set100.max: set100.max
+  set1000.max: set1000.max
+  set10000.max: set10000.max
+  set2.minmax: set2.minmax
+  set10.minmax: set10.minmax
+  set100.minmax: set100.minmax
+  set1000.minmax: set1000.minmax
+  set10000.minmax: set10000.minmax
+
+loop_count: 10000
diff --git a/benchmark/enum_sort.yml b/benchmark/enum_sort.yml
new file mode 100644
index 0000000000..6f26e748c6
--- /dev/null
+++ b/benchmark/enum_sort.yml
@@ -0,0 +1,15 @@
+prelude: |
+  set2 = 2.times.to_a.shuffle.to_set
+  set10 = 10.times.to_a.shuffle.to_set
+  set100 = 100.times.to_a.shuffle.to_set
+  set1000 = 1000.times.to_a.shuffle.to_set
+  set10000 = 10000.times.to_a.shuffle.to_set
+
+benchmark:
+  set2.sort_by: set2.sort_by { 0 }
+  set10.sort_by: set10.sort_by { 0 }
+  set100.sort_by: set100.sort_by { 0 }
+  set1000.sort_by: set1000.sort_by { 0 }
+  set10000.sort_by: set10000.sort_by { 0 }
+
+loop_count: 10000
diff --git a/benchmark/enum_tally.yml b/benchmark/enum_tally.yml
new file mode 100644
index 0000000000..edd2e040a0
--- /dev/null
+++ b/benchmark/enum_tally.yml
@@ -0,0 +1,4 @@
+prelude: |
+  list = ("aaa".."zzz").to_a*10
+benchmark:
+  tally: list.tally
diff --git a/benchmark/erb_escape_html.yml b/benchmark/erb_escape_html.yml
new file mode 100644
index 0000000000..ca28d756e7
--- /dev/null
+++ b/benchmark/erb_escape_html.yml
@@ -0,0 +1,31 @@
+prelude: |
+  # frozen_string_literal: true
+  require 'erb'
+benchmark:
+  - script: ERB::Util.html_escape("")
+    loop_count: 20000000
+  - script: ERB::Util.html_escape("abcde")
+    loop_count: 20000000
+  - script: ERB::Util.html_escape("abcd<")
+    loop_count: 20000000
+  - script: ERB::Util.html_escape("'&\"<>")
+    loop_count: 5000000
+  - prelude: long_no_escape = "abcde" * 300
+    script: ERB::Util.html_escape(long_no_escape)
+    loop_count: 1000000
+  - prelude: long_all_escape = "'&\"<>" * 10
+    script: ERB::Util.html_escape(long_all_escape)
+    loop_count: 1000000
+  - prelude: | # http://example.com/
+      example_html = <<~HTML
+        <body>
+        <div>
+            <h1>Example Domain</h1>
+            <p>This domain is established to be used for illustrative examples in documents. You may use this
+            domain in examples without prior coordination or asking for permission.</p>
+            <p><a href="http://www.iana.org/domains/example">More information...</a></p>
+        </div>
+        </body>
+      HTML
+    script: ERB::Util.html_escape(example_html)
+    loop_count: 1000000
diff --git a/benchmark/erb_render.yml b/benchmark/erb_render.yml
new file mode 100644
index 0000000000..15f6c3880b
--- /dev/null
+++ b/benchmark/erb_render.yml
@@ -0,0 +1,24 @@
+prelude: |
+  require 'erb'
+
+  data = <<erb
+  <html>
+    <head> <%= title %> </head>
+    <body>
+      <h1> <%= title %> </h1>
+      <p>
+        <%= content %>
+      </p>
+    </body>
+  </html>
+  erb
+
+  title = "hello world!"
+  content = "hello world!\n" * 10
+
+  src = "def self.render(title, content); #{ERB.new(data).src}; end"
+  mod = Module.new
+  mod.instance_eval(src, "(ERB)")
+benchmark:
+  erb_render: mod.render(title, content)
+loop_count: 1500000
diff --git a/benchmark/fiber_chain.yml b/benchmark/fiber_chain.yml
new file mode 100644
index 0000000000..a36c759f8e
--- /dev/null
+++ b/benchmark/fiber_chain.yml
@@ -0,0 +1,36 @@
+prelude: |
+  def make_link(previous)
+    Fiber.new do
+      while message = previous.resume
+        Fiber.yield(message)
+      end
+    end
+  end
+
+  def make_chain(length = 1000, &block)
+    chain = Fiber.new(&block)
+
+    (length - 1).times do
+      chain = make_link(chain)
+    end
+
+    return chain
+  end
+
+  message = "Hello World!"
+
+  chain = make_chain do
+    while true
+      Fiber.yield(message)
+    end
+  end
+benchmark:
+  make_chain: |
+    make_chain(100) do
+      while true
+        Fiber.yield(message)
+      end
+    end
+  resume_chain: |
+    chain.resume
+loop_count: 5000
diff --git a/benchmark/fiber_locals.yml b/benchmark/fiber_locals.yml
new file mode 100644
index 0000000000..8588686477
--- /dev/null
+++ b/benchmark/fiber_locals.yml
@@ -0,0 +1,8 @@
+prelude: |
+  th = Thread.current
+  th[:key] = :val
+benchmark:
+  key?: th.key?(:key)
+  []: th[:key]
+  keys: th.keys
+loop_count: 1_000_000
diff --git a/benchmark/file_chmod.rb b/benchmark/file_chmod.rb
new file mode 100644
index 0000000000..1cd4760c9d
--- /dev/null
+++ b/benchmark/file_chmod.rb
@@ -0,0 +1,9 @@
+# chmod file
+require 'tempfile'
+max = 200_000
+tmp = Tempfile.new('chmod')
+path = tmp.path
+max.times do
+  File.chmod(0777, path)
+end
+tmp.close!
diff --git a/benchmark/file_rename.rb b/benchmark/file_rename.rb
new file mode 100644
index 0000000000..bbb44aebac
--- /dev/null
+++ b/benchmark/file_rename.rb
@@ -0,0 +1,11 @@
+# rename file
+require 'tempfile'
+
+max = 100_000
+tmp = [ Tempfile.new('rename-a'), Tempfile.new('rename-b') ]
+a, b = tmp.map { |x| x.path }
+tmp.each { |t| t.close } # Windows can't rename files without closing them
+max.times do
+  File.rename(a, b)
+  File.rename(b, a)
+end
diff --git a/benchmark/float_methods.yml b/benchmark/float_methods.yml
new file mode 100644
index 0000000000..56ea41effc
--- /dev/null
+++ b/benchmark/float_methods.yml
@@ -0,0 +1,14 @@
+prelude: |
+  flo = 4.2
+benchmark:
+  to_f: |
+    flo.to_f
+  abs: |
+    flo.abs
+  magnitude: |
+    flo.magnitude
+  -@: |
+    -flo
+  zero?: |
+    flo.zero?
+loop_count: 20000000
diff --git a/benchmark/float_neg_posi.yml b/benchmark/float_neg_posi.yml
new file mode 100644
index 0000000000..172db1bf6d
--- /dev/null
+++ b/benchmark/float_neg_posi.yml
@@ -0,0 +1,8 @@
+prelude: |
+  flo = 4.2
+benchmark:
+  negative?: |
+    flo.negative?
+  positive?: |
+    flo.positive?
+loop_count: 20000000
diff --git a/benchmark/float_to_s.yml b/benchmark/float_to_s.yml
new file mode 100644
index 0000000000..0abae5cdb8
--- /dev/null
+++ b/benchmark/float_to_s.yml
@@ -0,0 +1,7 @@
+prelude: |
+  floats = [*0.0.step(1.0, 0.0001)]
+
+benchmark:
+  to_s: floats.each {|f| f.to_s}
+
+loop_count: 1000
diff --git a/benchmark/gc/aobench.rb b/benchmark/gc/aobench.rb
new file mode 100644
index 0000000000..275f58b924
--- /dev/null
+++ b/benchmark/gc/aobench.rb
@@ -0,0 +1 @@
+require_relative '../app_aobench'
diff --git a/benchmark/gc/binary_trees.rb b/benchmark/gc/binary_trees.rb
new file mode 100644
index 0000000000..83347cdd20
--- /dev/null
+++ b/benchmark/gc/binary_trees.rb
@@ -0,0 +1 @@
+require_relative '../so_binary_trees'
diff --git a/benchmark/gc/gcbench.rb b/benchmark/gc/gcbench.rb
new file mode 100644
index 0000000000..23d0b91c6c
--- /dev/null
+++ b/benchmark/gc/gcbench.rb
@@ -0,0 +1,57 @@
+require 'benchmark'
+require 'pp'
+require 'optparse'
+
+$list = true
+$gcprof = false
+
+opt = OptionParser.new
+opt.on('-q'){$list = false}
+opt.on('-d'){$gcprof = false}
+opt.on('-p'){$gcprof = true}
+opt.parse!(ARGV)
+
+script = File.join(File.dirname(__FILE__), ARGV.shift)
+script += '.rb' unless FileTest.exist?(script)
+raise "#{script} not found" unless FileTest.exist?(script)
+
+puts "Script: #{script}"
+
+if $gcprof
+  GC::Profiler.enable
+end
+
+tms = Benchmark.measure{|x|
+  load script
+}
+
+gc_time = 0
+
+if $gcprof
+  gc_time = GC::Profiler.total_time
+  GC::Profiler.report if $list and RUBY_VERSION >= '2.0.0' # before 1.9.3, report() may run infinite loop
+  GC::Profiler.disable
+end
+
+pp GC.stat
+
+puts "#{RUBY_DESCRIPTION} #{GC::OPTS.inspect}" if defined?(GC::OPTS)
+
+desc = "#{RUBY_VERSION}#{RUBY_PATCHLEVEL >= 0 ? "p#{RUBY_PATCHLEVEL}" : "dev"}"
+name = File.basename(script, '.rb')
+
+puts
+puts script
+puts Benchmark::CAPTION
+puts tms
+puts "GC total time (sec): #{gc_time}"
+
+# show High-Water Mark on Linux
+if File.exist?('/proc/self/status') && /VmHWM:\s*(\d+.+)/ =~ File.read('/proc/self/status')
+  puts
+  puts "VmHWM: #{$1.chomp}"
+end
+
+puts
+puts "Summary of #{name} on #{desc}\t#{tms.real}\t#{gc_time}\t#{GC.count}"
+puts "         (real time in sec, GC time in sec, GC count)"
diff --git a/benchmark/gc/hash1.rb b/benchmark/gc/hash1.rb
new file mode 100644
index 0000000000..cb030d458d
--- /dev/null
+++ b/benchmark/gc/hash1.rb
@@ -0,0 +1,11 @@
+value = 0.01
+h = {}
+n = 50_000
+
+1.upto(n){|i|
+  h["%020d" % i] = "v-#{i}"
+}
+
+(n * 1_000).times{
+  ''
+}
diff --git a/benchmark/gc/hash2.rb b/benchmark/gc/hash2.rb
new file mode 100644
index 0000000000..e8c943fb21
--- /dev/null
+++ b/benchmark/gc/hash2.rb
@@ -0,0 +1,7 @@
+value = 0.01
+h = {}
+n = 4*(10**6)
+
+1.upto(n){|i|
+  h["%020d" % i] = value * i
+}
diff --git a/benchmark/gc/null.rb b/benchmark/gc/null.rb
new file mode 100644
index 0000000000..c05a79f561
--- /dev/null
+++ b/benchmark/gc/null.rb
@@ -0,0 +1 @@
+# null
diff --git a/benchmark/gc/pentomino.rb b/benchmark/gc/pentomino.rb
new file mode 100644
index 0000000000..8ebdff7d1d
--- /dev/null
+++ b/benchmark/gc/pentomino.rb
@@ -0,0 +1 @@
+require_relative '../app_pentomino'
diff --git a/benchmark/gc/rdoc.rb b/benchmark/gc/rdoc.rb
new file mode 100644
index 0000000000..14c89f5611
--- /dev/null
+++ b/benchmark/gc/rdoc.rb
@@ -0,0 +1,13 @@
+require 'rdoc/rdoc'
+require 'tmpdir'
+
+srcdir = File.expand_path('../..', __dir__)
+
+Dir.mktmpdir('rdocbench-'){|d|
+  dir = File.join(d, 'rdocbench')
+  args = %W(--root #{srcdir} --page-dir #{srcdir}/doc --encoding=UTF-8 --no-force-update --all --ri --debug --quiet #{srcdir})
+  args << '--op' << dir
+
+  r = RDoc::RDoc.new
+  r.document args
+}
diff --git a/benchmark/gc/redblack.rb b/benchmark/gc/redblack.rb
new file mode 100644
index 0000000000..c66290140a
--- /dev/null
+++ b/benchmark/gc/redblack.rb
@@ -0,0 +1,366 @@
+# This benchmark is imported from https://github.com/jruby/rubybench/blob/master/time/bench_red_black.rb
+# License is License is Apache-2
+
+require 'benchmark'
+
+# Algorithm based on "Introduction to Algorithms" by Cormen and others
+class RedBlackTree
+  class Node
+    attr_accessor :color
+    attr_accessor :key
+    attr_accessor :left
+    attr_accessor :right
+    attr_accessor :parent
+
+    RED = :red
+    BLACK = :black
+    COLORS = [RED, BLACK].freeze
+
+    def initialize(key, color = RED)
+      raise ArgumentError, "Bad value for color parameter" unless COLORS.include?(color)
+      @color = color
+      @key = key
+      @left = @right = @parent = NilNode.instance
+    end
+
+    def black?
+      return color == BLACK
+    end
+
+    def red?
+      return color == RED
+    end
+  end
+
+  class NilNode < Node
+    class << self
+      private :new
+
+      # it's not thread safe
+      def instance
+        @instance ||= begin
+          def instance
+            return @instance
+          end
+
+          new
+        end
+      end
+    end
+
+    def initialize
+      self.color = BLACK
+      self.key = 0
+      self.left = nil
+      self.right = nil
+      self.parent = nil
+    end
+
+    def nil?
+      return true
+    end
+  end
+
+  include Enumerable
+
+  attr_accessor :root
+  attr_accessor :size
+
+  def initialize
+    self.root = NilNode.instance
+    self.size = 0
+  end
+
+  def add(key)
+    insert(Node.new(key))
+  end
+
+  def insert(x)
+    insert_helper(x)
+
+    x.color = Node::RED
+    while x != root && x.parent.color == Node::RED
+      if x.parent == x.parent.parent.left
+        y = x.parent.parent.right
+        if !y.nil? && y.color == Node::RED
+          x.parent.color = Node::BLACK
+          y.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          x = x.parent.parent
+        else
+          if x == x.parent.right
+            x = x.parent
+            left_rotate(x)
+          end
+          x.parent.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          right_rotate(x.parent.parent)
+        end
+      else
+        y = x.parent.parent.left
+        if !y.nil? && y.color == Node::RED
+          x.parent.color = Node::BLACK
+          y.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          x = x.parent.parent
+        else
+          if x == x.parent.left
+            x = x.parent
+            right_rotate(x)
+          end
+          x.parent.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          left_rotate(x.parent.parent)
+        end
+      end
+    end
+    root.color = Node::BLACK
+  end
+
+  alias << insert
+
+  def delete(z)
+    y = (z.left.nil? || z.right.nil?) ? z : successor(z)
+    x = y.left.nil? ? y.right : y.left
+    x.parent = y.parent
+
+    if y.parent.nil?
+      self.root = x
+    else
+      if y == y.parent.left
+        y.parent.left = x
+      else
+        y.parent.right = x
+      end
+    end
+
+    z.key = y.key if y != z
+
+    if y.color == Node::BLACK
+      delete_fixup(x)
+    end
+
+    self.size -= 1
+    return y
+  end
+
+  def minimum(x = root)
+    while !x.left.nil?
+      x = x.left
+    end
+    return x
+  end
+
+  def maximum(x = root)
+    while !x.right.nil?
+      x = x.right
+    end
+    return x
+  end
+
+  def successor(x)
+    if !x.right.nil?
+      return minimum(x.right)
+    end
+    y = x.parent
+    while !y.nil? && x == y.right
+      x = y
+      y = y.parent
+    end
+    return y
+  end
+
+  def predecessor(x)
+    if !x.left.nil?
+      return maximum(x.left)
+    end
+    y = x.parent
+    while !y.nil? && x == y.left
+      x = y
+      y = y.parent
+    end
+    return y
+  end
+
+  def inorder_walk(x = root)
+    x = self.minimum
+    while !x.nil?
+      yield x.key
+      x = successor(x)
+    end
+  end
+
+  alias each inorder_walk
+
+  def reverse_inorder_walk(x = root)
+    x = self.maximum
+    while !x.nil?
+      yield x.key
+      x = predecessor(x)
+    end
+  end
+
+  alias reverse_each reverse_inorder_walk
+
+  def search(key, x = root)
+    while !x.nil? && x.key != key
+      key < x.key ? x = x.left : x = x.right
+    end
+    return x
+  end
+
+  def empty?
+    return self.root.nil?
+  end
+
+  def black_height(x = root)
+    height = 0
+    while !x.nil?
+      x = x.left
+      height +=1 if x.nil? || x.black?
+    end
+    return height
+  end
+
+private
+
+  def left_rotate(x)
+    raise "x.right is nil!" if x.right.nil?
+    y = x.right
+    x.right = y.left
+    y.left.parent = x if !y.left.nil?
+    y.parent = x.parent
+    if x.parent.nil?
+      self.root = y
+    else
+      if x == x.parent.left
+        x.parent.left = y
+      else
+        x.parent.right = y
+      end
+    end
+    y.left = x
+    x.parent = y
+  end
+
+  def right_rotate(x)
+    raise "x.left is nil!" if x.left.nil?
+    y = x.left
+    x.left = y.right
+    y.right.parent = x if !y.right.nil?
+    y.parent = x.parent
+    if x.parent.nil?
+      self.root = y
+    else
+      if x == x.parent.left
+        x.parent.left = y
+      else
+        x.parent.right = y
+      end
+    end
+    y.right = x
+    x.parent = y
+  end
+
+  def insert_helper(z)
+    y = NilNode.instance
+    x = root
+    while !x.nil?
+      y = x
+      z.key < x.key ? x = x.left : x = x.right
+    end
+    z.parent = y
+    if y.nil?
+      self.root = z
+    else
+      z.key < y.key ? y.left = z : y.right = z
+    end
+    self.size += 1
+  end
+
+  def delete_fixup(x)
+    while x != root && x.color == Node::BLACK
+      if x == x.parent.left
+        w = x.parent.right
+        if w.color == Node::RED
+          w.color = Node::BLACK
+          x.parent.color = Node::RED
+          left_rotate(x.parent)
+          w = x.parent.right
+        end
+        if w.left.color == Node::BLACK && w.right.color == Node::BLACK
+          w.color = Node::RED
+          x = x.parent
+        else
+          if w.right.color == Node::BLACK
+            w.left.color = Node::BLACK
+            w.color = Node::RED
+            right_rotate(w)
+            w = x.parent.right
+          end
+          w.color = x.parent.color
+          x.parent.color = Node::BLACK
+          w.right.color = Node::BLACK
+          left_rotate(x.parent)
+          x = root
+        end
+      else
+        w = x.parent.left
+        if w.color == Node::RED
+          w.color = Node::BLACK
+          x.parent.color = Node::RED
+          right_rotate(x.parent)
+          w = x.parent.left
+        end
+        if w.right.color == Node::BLACK && w.left.color == Node::BLACK
+          w.color = Node::RED
+          x = x.parent
+        else
+          if w.left.color == Node::BLACK
+            w.right.color = Node::BLACK
+            w.color = Node::RED
+            left_rotate(w)
+            w = x.parent.left
+          end
+          w.color = x.parent.color
+          x.parent.color = Node::BLACK
+          w.left.color = Node::BLACK
+          right_rotate(x.parent)
+          x = root
+        end
+      end
+    end
+    x.color = Node::BLACK
+  end
+end
+
+def rbt_bm
+  n = 100_000
+  a1 = []; n.times { a1 << rand(999_999) }
+  a2 = []; n.times { a2 << rand(999_999) }
+
+  start = Time.now
+
+  tree = RedBlackTree.new
+
+  n.times {|i| tree.add(i) }
+  n.times { tree.delete(tree.root) }
+
+  tree = RedBlackTree.new
+  a1.each {|e| tree.add(e) }
+  a2.each {|e| tree.search(e) }
+  tree.inorder_walk {|key| key + 1 }
+  tree.reverse_inorder_walk {|key| key + 1 }
+  n.times { tree.minimum }
+  n.times { tree.maximum }
+
+  return Time.now - start
+end
+
+N = (ARGV[0] || 10).to_i
+
+N.times do
+  # puts rbt_bm.to_f
+  rbt_bm.to_f
+  # puts "GC.count = #{GC.count}" if GC.respond_to?(:count)
+end
diff --git a/benchmark/gc/ring.rb b/benchmark/gc/ring.rb
new file mode 100644
index 0000000000..be2c7b7250
--- /dev/null
+++ b/benchmark/gc/ring.rb
@@ -0,0 +1,29 @@
+# create many old objects
+
+max = 30_000_000
+
+class Ring
+  attr_reader :next_ring
+  def initialize n = nil
+    @next_ring = n
+  end
+
+
+  def size
+    s = 1
+    ring = self
+    while ring.next_ring
+      s += 1
+      ring = ring.next_ring
+    end
+    s
+  end
+end
+
+ring = Ring.new
+
+max.times{
+  ring = Ring.new(ring)
+}
+
+# p ring.size
diff --git a/benchmark/hash_aref_array.rb b/benchmark/hash_aref_array.rb
new file mode 100644
index 0000000000..ac7a683d95
--- /dev/null
+++ b/benchmark/hash_aref_array.rb
@@ -0,0 +1,5 @@
+h = {}
+arrays = (0..99).each_slice(10).to_a
+#STDERR.puts arrays.inspect
+arrays.each { |s| h[s] = s }
+200_000.times { arrays.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_dsym.rb b/benchmark/hash_aref_dsym.rb
new file mode 100644
index 0000000000..af4f8c36d4
--- /dev/null
+++ b/benchmark/hash_aref_dsym.rb
@@ -0,0 +1,4 @@
+h = {}
+syms = ('a'..'z').map { |s| s.to_sym }
+syms.each { |s| h[s] = 1 }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_dsym_long.rb b/benchmark/hash_aref_dsym_long.rb
new file mode 100644
index 0000000000..9d7759379e
--- /dev/null
+++ b/benchmark/hash_aref_dsym_long.rb
@@ -0,0 +1,21 @@
+# [ruby-core:70129] [Bug #11396]
+collection_size = 200000
+sample_size = 10000
+
+values = (1..collection_size).to_a.map do |x|
+  "THIS IS A LONGER STRING THAT IS ALSO UNIQUE #{x}"
+end
+
+symbol_hash = {}
+
+values.each do |x|
+  symbol_hash[x.to_sym] = 1
+end
+
+# use the same samples each time to minimize deviations
+rng = Random.new(0)
+symbol_sample_array = values.sample(sample_size, random: rng).map(&:to_sym)
+
+3000.times do
+  symbol_sample_array.each { |x| symbol_hash[x] }
+end
diff --git a/benchmark/hash_aref_fix.rb b/benchmark/hash_aref_fix.rb
new file mode 100644
index 0000000000..1346890582
--- /dev/null
+++ b/benchmark/hash_aref_fix.rb
@@ -0,0 +1,4 @@
+h = {}
+nums = (1..26).to_a
+nums.each { |i| h[i] = i }
+200_000.times { nums.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_flo.rb b/benchmark/hash_aref_flo.rb
new file mode 100644
index 0000000000..2217274c82
--- /dev/null
+++ b/benchmark/hash_aref_flo.rb
@@ -0,0 +1,4 @@
+h = {}
+strs = [*1..10000].map! {|i| i.fdiv(10)}
+strs.each { |s| h[s] = s }
+50.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_miss.rb b/benchmark/hash_aref_miss.rb
new file mode 100644
index 0000000000..b0913dd4bb
--- /dev/null
+++ b/benchmark/hash_aref_miss.rb
@@ -0,0 +1,5 @@
+h = {}
+strs = ('a'..'z').to_a.map!(&:freeze)
+strs.each { |s| h[s] = s }
+strs = ('A'..'Z').to_a
+200_000.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_str.rb b/benchmark/hash_aref_str.rb
new file mode 100644
index 0000000000..19439b061b
--- /dev/null
+++ b/benchmark/hash_aref_str.rb
@@ -0,0 +1,4 @@
+h = {}
+strs = ('a'..'z').to_a.map!(&:freeze)
+strs.each { |s| h[s] = s }
+200_000.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_sym.rb b/benchmark/hash_aref_sym.rb
new file mode 100644
index 0000000000..f75d163fe6
--- /dev/null
+++ b/benchmark/hash_aref_sym.rb
@@ -0,0 +1,9 @@
+h = {}
+syms = ('a'..'z').to_a
+begin
+  syms = eval("%i[#{syms.join(' ')}]")
+rescue SyntaxError # <= 1.9.3
+  syms.map!(&:to_sym)
+end
+syms.each { |s| h[s] = s }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_aref_sym_long.rb b/benchmark/hash_aref_sym_long.rb
new file mode 100644
index 0000000000..9dab8df7be
--- /dev/null
+++ b/benchmark/hash_aref_sym_long.rb
@@ -0,0 +1,13 @@
+h = {}
+syms = %w[puts warn syswrite write stat bacon lettuce tomato
+some symbols in this array may already be interned  others should not be
+hash browns make good breakfast but not cooked using prime numbers
+shift for division entries delete_if keys exist?
+]
+begin
+  syms = eval("%i[#{syms.join(' ')}]")
+rescue SyntaxError # <= 1.9.3
+  syms.map!(&:to_sym)
+end
+syms.each { |s| h[s] = s }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_defaults.yml b/benchmark/hash_defaults.yml
new file mode 100644
index 0000000000..833f10e1c7
--- /dev/null
+++ b/benchmark/hash_defaults.yml
@@ -0,0 +1,6 @@
+prelude: |
+  h = Hash.new { :foo }
+benchmark:
+  default_aref: h[1]
+  default_method: h.default(1)
+loop_count: 1000000
diff --git a/benchmark/hash_dup.yml b/benchmark/hash_dup.yml
new file mode 100644
index 0000000000..65f521ec94
--- /dev/null
+++ b/benchmark/hash_dup.yml
@@ -0,0 +1,8 @@
+prelude: |
+  small_hash = { a: 1 }
+  larger_hash = 20.times.map { |i| [('a'.ord + i).chr.to_sym, i] }.to_h
+
+benchmark:
+  dup_small: small_hash.dup
+  dup_larger: larger_hash.dup
+loop_count: 10000
diff --git a/benchmark/hash_first.yml b/benchmark/hash_first.yml
new file mode 100644
index 0000000000..c26df1a7ed
--- /dev/null
+++ b/benchmark/hash_first.yml
@@ -0,0 +1,11 @@
+prelude: |
+  hash1 = 1_000_000.times.to_h { [rand, true]}
+  hash2 = hash1.dup
+  hash2.keys[1..100_000].each { hash2.delete _1 }
+  hash2.delete hash2.first[0]
+
+benchmark:
+  hash1: hash1.first
+  hash2: hash2.first
+
+loop_count: 100_000
diff --git a/benchmark/hash_flatten.rb b/benchmark/hash_flatten.rb
new file mode 100644
index 0000000000..e944aae9f2
--- /dev/null
+++ b/benchmark/hash_flatten.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+1000.times do
+  h.flatten
+end
diff --git a/benchmark/hash_ident_flo.rb b/benchmark/hash_ident_flo.rb
new file mode 100644
index 0000000000..0c7edfed3e
--- /dev/null
+++ b/benchmark/hash_ident_flo.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+strs = (1..10000).to_a.map!(&:to_f)
+strs.each { |s| h[s] = s }
+50.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_ident_num.rb b/benchmark/hash_ident_num.rb
new file mode 100644
index 0000000000..b226736c6f
--- /dev/null
+++ b/benchmark/hash_ident_num.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+nums = (1..26).to_a
+nums.each { |n| h[n] = n }
+200_000.times { nums.each { |n| h[n] } }
diff --git a/benchmark/hash_ident_obj.rb b/benchmark/hash_ident_obj.rb
new file mode 100644
index 0000000000..4b3b58edec
--- /dev/null
+++ b/benchmark/hash_ident_obj.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+objs = 26.times.map { Object.new }
+objs.each { |o| h[o] = o }
+200_000.times { objs.each { |o| h[o] } }
diff --git a/benchmark/hash_ident_str.rb b/benchmark/hash_ident_str.rb
new file mode 100644
index 0000000000..8582b38e31
--- /dev/null
+++ b/benchmark/hash_ident_str.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+strs = ('a'..'z').to_a
+strs.each { |s| h[s] = s }
+200_000.times { strs.each { |s| h[s] } }
diff --git a/benchmark/hash_ident_sym.rb b/benchmark/hash_ident_sym.rb
new file mode 100644
index 0000000000..4c81e3d28e
--- /dev/null
+++ b/benchmark/hash_ident_sym.rb
@@ -0,0 +1,4 @@
+h = {}.compare_by_identity
+syms = ('a'..'z').to_a.map(&:to_sym)
+syms.each { |s| h[s] = s }
+200_000.times { syms.each { |s| h[s] } }
diff --git a/benchmark/hash_keys.rb b/benchmark/hash_keys.rb
new file mode 100644
index 0000000000..6863cd01f9
--- /dev/null
+++ b/benchmark/hash_keys.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+5000.times do
+  h.keys
+end
diff --git a/benchmark/hash_literal_small2.rb b/benchmark/hash_literal_small2.rb
new file mode 100644
index 0000000000..c188529260
--- /dev/null
+++ b/benchmark/hash_literal_small2.rb
@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+1_000_000.times.map { { "foo" => "bar", "bar" => "baz" }  }
diff --git a/benchmark/hash_literal_small4.rb b/benchmark/hash_literal_small4.rb
new file mode 100644
index 0000000000..739f71b5b0
--- /dev/null
+++ b/benchmark/hash_literal_small4.rb
@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+1_000_000.times.map { { "foo" => "bar", "bar" => "baz", "baz" => "lol", "lol" => "lgtm" } }
diff --git a/benchmark/hash_literal_small8.rb b/benchmark/hash_literal_small8.rb
new file mode 100644
index 0000000000..53d80af535
--- /dev/null
+++ b/benchmark/hash_literal_small8.rb
@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+1_000_000.times.map { { "foo" => "bar", "bar" => "baz", "baz" => "lol", "lol" => "lgtm", "lgtm" => "nope", "nope" => "ok", "ok" => "again", "again" => "wait" } }
diff --git a/benchmark/hash_long.rb b/benchmark/hash_long.rb
new file mode 100644
index 0000000000..03d9109602
--- /dev/null
+++ b/benchmark/hash_long.rb
@@ -0,0 +1,4 @@
+k1 = "Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong";
+k2 = "Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping Pong Ping";
+h = {k1 => 0, k2 => 0};
+3000000.times{|i| k = i % 2 ? k2 : k1; h [k] = h[k] + 1}
diff --git a/benchmark/hash_shift.rb b/benchmark/hash_shift.rb
new file mode 100644
index 0000000000..a645671a5b
--- /dev/null
+++ b/benchmark/hash_shift.rb
@@ -0,0 +1,10 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+50000.times do
+  k, v = h.shift
+  h[k] = v
+end
diff --git a/benchmark/hash_shift_u16.rb b/benchmark/hash_shift_u16.rb
new file mode 100644
index 0000000000..ec800d0342
--- /dev/null
+++ b/benchmark/hash_shift_u16.rb
@@ -0,0 +1,10 @@
+h = {}
+
+(16384..65536).each do |i|
+  h[i] = nil
+end
+
+300000.times do
+  k, v = h.shift
+  h[k] = v
+end
diff --git a/benchmark/hash_shift_u24.rb b/benchmark/hash_shift_u24.rb
new file mode 100644
index 0000000000..de4e0fa696
--- /dev/null
+++ b/benchmark/hash_shift_u24.rb
@@ -0,0 +1,10 @@
+h = {}
+
+(0xff4000..0xffffff).each do |i|
+  h[i] = nil
+end
+
+300000.times do
+  k, v = h.shift
+  h[k] = v
+end
diff --git a/benchmark/hash_shift_u32.rb b/benchmark/hash_shift_u32.rb
new file mode 100644
index 0000000000..656aa55583
--- /dev/null
+++ b/benchmark/hash_shift_u32.rb
@@ -0,0 +1,10 @@
+h = {}
+
+(0xffff4000..0xffffffff).each do |i|
+  h[i] = nil
+end
+
+300000.times do
+  k, v = h.shift
+  h[k] = v
+end
diff --git a/benchmark/hash_small2.rb b/benchmark/hash_small2.rb
new file mode 100644
index 0000000000..45485d9c71
--- /dev/null
+++ b/benchmark/hash_small2.rb
@@ -0,0 +1 @@
+1000000.times.map{|i| a={}; 2.times{|j| a[j]=j}; a}
diff --git a/benchmark/hash_small4.rb b/benchmark/hash_small4.rb
new file mode 100644
index 0000000000..acd4084334
--- /dev/null
+++ b/benchmark/hash_small4.rb
@@ -0,0 +1 @@
+1000000.times.map{|i| a={}; 4.times{|j| a[j]=j}; a}
diff --git a/benchmark/hash_small8.rb b/benchmark/hash_small8.rb
new file mode 100644
index 0000000000..9cffcc91b6
--- /dev/null
+++ b/benchmark/hash_small8.rb
@@ -0,0 +1 @@
+1000000.times.map{|i| a={}; 8.times{|j| a[j]=j}; a}
diff --git a/benchmark/hash_to_proc.rb b/benchmark/hash_to_proc.rb
new file mode 100644
index 0000000000..2b675bf509
--- /dev/null
+++ b/benchmark/hash_to_proc.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+5000.times do |i|
+  [i].map(&h)
+end
diff --git a/benchmark/hash_values.rb b/benchmark/hash_values.rb
new file mode 100644
index 0000000000..069441302f
--- /dev/null
+++ b/benchmark/hash_values.rb
@@ -0,0 +1,9 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+5000.times do
+  h.values
+end
diff --git a/benchmark/int_quo.rb b/benchmark/int_quo.rb
new file mode 100644
index 0000000000..e22a3f8c30
--- /dev/null
+++ b/benchmark/int_quo.rb
@@ -0,0 +1 @@
+5000000.times { 42.quo(3) }
diff --git a/benchmark/io_copy_stream_write.rb b/benchmark/io_copy_stream_write.rb
new file mode 100644
index 0000000000..3fd87250a4
--- /dev/null
+++ b/benchmark/io_copy_stream_write.rb
@@ -0,0 +1,24 @@
+# The goal of this is to use a synthetic (non-IO) reader
+# to trigger the read/write loop of IO.copy_stream,
+# bypassing in-kernel mechanisms like sendfile for zero copy,
+# so we wrap the /dev/zero IO object:
+
+class Zero
+  def initialize
+    @n = 100000
+    @in = File.open('/dev/zero', 'rb')
+  end
+
+  def read(len, buf)
+    return if (@n -= 1) == 0
+    @in.read(len, buf)
+  end
+end
+
+begin
+  src = Zero.new
+  dst = File.open(IO::NULL, 'wb')
+  n = IO.copy_stream(src, dst)
+rescue Errno::ENOENT
+  # not *nix
+end if IO.respond_to?(:copy_stream) && IO.const_defined?(:NULL)
diff --git a/benchmark/io_copy_stream_write_socket.rb b/benchmark/io_copy_stream_write_socket.rb
new file mode 100644
index 0000000000..11f369bd0d
--- /dev/null
+++ b/benchmark/io_copy_stream_write_socket.rb
@@ -0,0 +1,35 @@
+# The goal of this is to use a synthetic (non-IO) reader
+# to trigger the read/write loop of IO.copy_stream,
+# bypassing in-kernel mechanisms like sendfile for zero copy,
+# so we wrap the /dev/zero IO object:
+class Zero
+  def initialize
+    @n = 100000
+    @in = File.open('/dev/zero', 'rb')
+  end
+
+  def read(len, buf)
+    return if (@n -= 1) == 0
+    @in.read(len, buf)
+  end
+end
+
+begin
+  require 'socket'
+  src = Zero.new
+  rd, wr = UNIXSocket.pair
+  pid = fork do
+    wr.close
+    buf = String.new
+    while rd.read(16384, buf)
+    end
+  end
+  rd.close
+  IO.copy_stream(src, wr)
+rescue Errno::ENOENT, NotImplementedError, NameError
+  # not *nix: missing /dev/zero, fork, or UNIXSocket
+rescue LoadError # no socket?
+ensure
+  wr.close if wr
+  Process.waitpid(pid) if pid
+end if IO.respond_to?(:copy_stream)
diff --git a/benchmark/bm_io_file_create.rb b/benchmark/io_file_create.rb
index 2f205c1333..2f205c1333 100644
--- a/benchmark/bm_io_file_create.rb
+++ b/benchmark/io_file_create.rb
diff --git a/benchmark/bm_io_file_read.rb b/benchmark/io_file_read.rb
index b9e796ed30..b9e796ed30 100644
--- a/benchmark/bm_io_file_read.rb
+++ b/benchmark/io_file_read.rb
diff --git a/benchmark/bm_io_file_write.rb b/benchmark/io_file_write.rb
index aa1be0e5fe..aa1be0e5fe 100644
--- a/benchmark/bm_io_file_write.rb
+++ b/benchmark/io_file_write.rb
diff --git a/benchmark/io_nonblock_noex.rb b/benchmark/io_nonblock_noex.rb
new file mode 100644
index 0000000000..da9357fdc6
--- /dev/null
+++ b/benchmark/io_nonblock_noex.rb
@@ -0,0 +1,22 @@
+nr = 1_000_000
+i = 0
+msg = '.'
+buf = '.'
+noex = { exception: false }
+begin
+  r, w = IO.pipe
+  while i < nr
+    i += 1
+    w.write_nonblock(msg, noex)
+    r.read_nonblock(1, buf, noex)
+  end
+rescue ArgumentError # old Rubies
+  while i < nr
+    i += 1
+    w.write_nonblock(msg)
+    r.read_nonblock(1, buf)
+  end
+ensure
+  r.close
+  w.close
+end
diff --git a/benchmark/io_nonblock_noex2.rb b/benchmark/io_nonblock_noex2.rb
new file mode 100644
index 0000000000..56819d049b
--- /dev/null
+++ b/benchmark/io_nonblock_noex2.rb
@@ -0,0 +1,21 @@
+nr = 1_000_000
+i = 0
+msg = '.'
+buf = '.'
+begin
+  r, w = IO.pipe
+  while i < nr
+    i += 1
+    w.write_nonblock(msg, exception: false)
+    r.read_nonblock(1, buf, exception: false)
+  end
+rescue ArgumentError # old Rubies
+  while i < nr
+    i += 1
+    w.write_nonblock(msg)
+    r.read_nonblock(1, buf)
+  end
+ensure
+  r.close
+  w.close
+end
diff --git a/benchmark/io_pipe_rw.rb b/benchmark/io_pipe_rw.rb
new file mode 100644
index 0000000000..6862a8ae61
--- /dev/null
+++ b/benchmark/io_pipe_rw.rb
@@ -0,0 +1,13 @@
+# Measure uncontended GVL performance via read/write with 1:1 threading
+# If we switch to M:N threading, this will benchmark something else...
+r, w = IO.pipe
+src = '0'.freeze
+dst = String.new
+i = 0
+while i < 1_000_000
+  i += 1
+  w.write(src)
+  r.read(1, dst)
+end
+w.close
+r.close
diff --git a/benchmark/bm_io_select.rb b/benchmark/io_select.rb
index 19248daeb1..19248daeb1 100644
--- a/benchmark/bm_io_select.rb
+++ b/benchmark/io_select.rb
diff --git a/benchmark/bm_io_select2.rb b/benchmark/io_select2.rb
index 10e37d71b2..10e37d71b2 100644
--- a/benchmark/bm_io_select2.rb
+++ b/benchmark/io_select2.rb
diff --git a/benchmark/bm_io_select3.rb b/benchmark/io_select3.rb
index 7d0ba1f092..7d0ba1f092 100644
--- a/benchmark/bm_io_select3.rb
+++ b/benchmark/io_select3.rb
diff --git a/benchmark/io_write.rb b/benchmark/io_write.rb
new file mode 100644
index 0000000000..cdb409948b
--- /dev/null
+++ b/benchmark/io_write.rb
@@ -0,0 +1,22 @@
+#!/usr/bin/env ruby
+
+require 'benchmark'
+
+i, o = IO.pipe
+o.sync = true
+
+DOT = ".".freeze
+
+chunks = 100_000.times.collect{DOT}
+
+thread = Thread.new do
+  while i.read(1024)
+  end
+end
+
+100.times do
+  o.write(*chunks)
+end
+
+o.close
+thread.join
diff --git a/benchmark/irb_color.yml b/benchmark/irb_color.yml
new file mode 100644
index 0000000000..ebdc8d7e8b
--- /dev/null
+++ b/benchmark/irb_color.yml
@@ -0,0 +1,13 @@
+prelude: |
+  require 'irb/color'
+  code = <<~'CODE'
+    def self.foo # bar
+      :"erb #{ERB.new("<%= self %>", trim_mode: ?-).result}"
+    end
+  CODE
+benchmark:
+  irb_color_complete: |
+    IRB::Color.colorize_code(code, complete: true)
+  irb_color_incomplete: |
+    IRB::Color.colorize_code(code, complete: false)
+loop_count: 2000000
diff --git a/benchmark/irb_exec.yml b/benchmark/irb_exec.yml
new file mode 100644
index 0000000000..28933f8b38
--- /dev/null
+++ b/benchmark/irb_exec.yml
@@ -0,0 +1,10 @@
+prelude: |
+  # frozen_string_literal: true
+  require 'rbconfig'
+  irb_f = [File.join(File.dirname(RbConfig.ruby), 'irb'), '-f']
+benchmark:
+  irb_exec: |
+    IO.popen(irb_f, 'w') do |io|
+      io.write('exit')
+    end
+loop_count: 30
diff --git a/benchmark/iseq_load_from_binary.yml b/benchmark/iseq_load_from_binary.yml
new file mode 100644
index 0000000000..7e9d73bdd4
--- /dev/null
+++ b/benchmark/iseq_load_from_binary.yml
@@ -0,0 +1,25 @@
+prelude: |
+  symbol = RubyVM::InstructionSequence.compile(":foo; :bar; :baz; :egg; :spam").to_binary
+
+  define_method = RubyVM::InstructionSequence.compile(%{
+    def foo; end
+    def bar; end
+    def baz; end
+    def egg; end
+    def spam; end
+  }).to_binary
+
+  all = RubyVM::InstructionSequence.compile(%{
+    module Foo; def foo; :foo; end; end
+    module Bar; def bar; :bar; end; end
+    module Baz; def baz; :baz; end; end
+    class Egg; def egg; :egg; end; end
+    class Spaml; def spam; :spam; end; end
+  }).to_binary
+
+benchmark:
+  symbol: RubyVM::InstructionSequence.load_from_binary(symbol)
+  define_method: RubyVM::InstructionSequence.load_from_binary(define_method)
+  all: RubyVM::InstructionSequence.load_from_binary(all)
+
+loop_count: 100_000
diff --git a/benchmark/ivar_extend.yml b/benchmark/ivar_extend.yml
new file mode 100644
index 0000000000..eb9ee923f5
--- /dev/null
+++ b/benchmark/ivar_extend.yml
@@ -0,0 +1,23 @@
+prelude: |
+  class Embedded
+    def initialize
+      @a = 1
+      @b = 1
+      @c = 1
+    end
+  end
+
+  class Extended
+    def initialize
+      @a = 1
+      @b = 1
+      @c = 1
+      @d = 1
+      @e = 1
+      @f = 1
+    end
+  end
+benchmark:
+  embedded: Embedded.new
+  extended: Extended.new
+loop_count: 20_000_000
diff --git a/benchmark/kernel_clone.yml b/benchmark/kernel_clone.yml
new file mode 100644
index 0000000000..069b23abcd
--- /dev/null
+++ b/benchmark/kernel_clone.yml
@@ -0,0 +1,6 @@
+prelude: "object = Object.new"
+benchmark:
+  clone: "object.clone"
+  clone_true: "object.clone(freeze: true)"
+  clone_false: "object.clone(freeze: false)"
+loop_count: 10000
diff --git a/benchmark/kernel_float.yml b/benchmark/kernel_float.yml
new file mode 100644
index 0000000000..215f6750fc
--- /dev/null
+++ b/benchmark/kernel_float.yml
@@ -0,0 +1,5 @@
+benchmark:
+  float: "Float(42)"
+  float_true: "Float(42, exception: true)"
+  float_false: "Float(42, exception: false)"
+loop_count: 10000
diff --git a/benchmark/kernel_tap.yml b/benchmark/kernel_tap.yml
new file mode 100644
index 0000000000..4dcbb31b4d
--- /dev/null
+++ b/benchmark/kernel_tap.yml
@@ -0,0 +1,6 @@
+prelude: |
+  obj = Object.new
+  x = nil
+benchmark:
+  kernel_tap: obj.tap { |o| x = o }
+loop_count: 20000000
diff --git a/benchmark/kernel_then.yml b/benchmark/kernel_then.yml
new file mode 100644
index 0000000000..85f7341e33
--- /dev/null
+++ b/benchmark/kernel_then.yml
@@ -0,0 +1,6 @@
+benchmark:
+  kernel_then: 1.then { |i| i + 1 }
+  kernel_then_enum: 1.then
+  kernel_yield_self: 1.yield_self { |i| i + 1 }
+  kernel_yield_self_enum: 1.yield_self
+loop_count: 20000000
diff --git a/benchmark/keyword_arguments.yml b/benchmark/keyword_arguments.yml
new file mode 100644
index 0000000000..fce6bce0b8
--- /dev/null
+++ b/benchmark/keyword_arguments.yml
@@ -0,0 +1,13 @@
+prelude: |
+  h = {a: 1}
+  def kw(a: 1) a end
+  def kws(**kw) kw end
+benchmark:
+  kw_to_kw: "kw(a: 1)"
+  kw_splat_to_kw: "kw(**h)"
+  kw_to_kw_splat: "kws(a: 1)"
+  kw_splat_to_kw_splat: "kws(**h)"
+  kw_and_splat_to_kw: "kw(a: 1, **h)"
+  kw_splats_to_kw: "kw(**h, **h)"
+  kw_and_splat_to_kw_splat: "kws(a: 1, **h)"
+  kw_splats_to_kw_splat: "kws(**h, **h)"
diff --git a/benchmark/lib/benchmark_driver/output/driver.rb b/benchmark/lib/benchmark_driver/output/driver.rb
new file mode 100644
index 0000000000..d22236e9fb
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/output/driver.rb
@@ -0,0 +1,36 @@
+require 'benchmark_driver/output/simple'
+
+# This replicates the legacy benchmark/driver.rb behavior.
+class BenchmarkDriver::Output::Driver < BenchmarkDriver::Output::Simple
+  def initialize(*)
+    super
+    @stdout = $stdout
+    @strio  = StringIO.new
+    $stdout = IOMultiplexer.new(@stdout, @strio)
+  end
+
+  def with_benchmark(*)
+    super
+  ensure
+    logfile = "bmlog-#{Time.now.strftime('%Y%m%d-%H%M%S')}.#{$$}.log"
+    puts "\nLog file: #{logfile}"
+
+    $stdout = @stdout
+    File.write(logfile, @strio.tap(&:rewind).read)
+  end
+
+  class IOMultiplexer
+    def initialize(io1, io2)
+      @io1 = io1
+      @io2 = io2
+    end
+
+    [:write, :sync, :sync=, :puts, :print, :flush].each do |method|
+      define_method(method) do |*args|
+        @io1.send(method, *args)
+        @io2.send(method, *args)
+      end
+    end
+  end
+  private_constant :IOMultiplexer
+end
diff --git a/benchmark/lib/benchmark_driver/runner/cstime.rb b/benchmark/lib/benchmark_driver/runner/cstime.rb
new file mode 100644
index 0000000000..3c3453e527
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/cstime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Cstime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'cstime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :cstime
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/cutime.rb b/benchmark/lib/benchmark_driver/runner/cutime.rb
new file mode 100644
index 0000000000..e139962ef2
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/cutime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Cutime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'cutime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :cutime
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/mjit.rb b/benchmark/lib/benchmark_driver/runner/mjit.rb
new file mode 100644
index 0000000000..3a58a620de
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/mjit.rb
@@ -0,0 +1,34 @@
+require 'benchmark_driver/struct'
+require 'benchmark_driver/metric'
+require 'erb'
+
+# A runner to measure after-JIT performance easily
+class BenchmarkDriver::Runner::Mjit < BenchmarkDriver::Runner::Ips
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC]).extend(Module.new{
+    def parse(**)
+      jobs = super
+      jobs.map do |job|
+        job = job.dup
+        job.prelude = "#{job.prelude}\n#{<<~EOS}"
+          if defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled?
+            __bmdv_ruby_i = 0
+            while __bmdv_ruby_i < 10000 # MJIT call threshold
+              #{job.script}
+              __bmdv_ruby_i += 1
+            end
+            RubyVM::MJIT.pause # compile
+            #{job.script}
+            RubyVM::MJIT.resume; RubyVM::MJIT.pause # recompile
+            #{job.script}
+            RubyVM::MJIT.resume; RubyVM::MJIT.pause # recompile 2
+          end
+        EOS
+        job
+      end
+    end
+  })
+end
diff --git a/benchmark/lib/benchmark_driver/runner/peak.rb b/benchmark/lib/benchmark_driver/runner/peak.rb
new file mode 100644
index 0000000000..d04f2e51ff
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/peak.rb
@@ -0,0 +1,151 @@
+require 'benchmark_driver/struct'
+require 'benchmark_driver/metric'
+require 'benchmark_driver/default_job'
+require 'benchmark_driver/default_job_parser'
+require 'tempfile'
+
+class BenchmarkDriver::Runner::Peak
+  METRIC = BenchmarkDriver::Metric.new(
+    name: 'Peak memory usage', unit: 'bytes', larger_better: false, worse_word: 'larger',
+  )
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  # @param [BenchmarkDriver::Config::RunnerConfig] config
+  # @param [BenchmarkDriver::Output] output
+  # @param [BenchmarkDriver::Context] contexts
+  def initialize(config:, output:, contexts:)
+    @config = config
+    @output = output
+    @contexts = contexts
+  end
+
+  # This method is dynamically called by `BenchmarkDriver::JobRunner.run`
+  # @param [Array<BenchmarkDriver::Runner::Peak::Job>] jobs
+  def run(jobs)
+    if jobs.any? { |job| job.loop_count.nil? }
+      jobs = jobs.map do |job|
+        job.loop_count ? job : Job.new(job.to_h.merge(loop_count: 1))
+      end
+    end
+
+    @output.with_benchmark do
+      jobs.each do |job|
+        @output.with_job(name: job.name) do
+          job.runnable_contexts(@contexts).each do |context|
+            value = BenchmarkDriver::Repeater.with_repeat(config: @config, larger_better: false) do
+              run_benchmark(job, context: context)
+            end
+            @output.with_context(name: context.name, executable: context.executable, gems: context.gems, prelude: context.prelude) do
+              @output.report(values: { metric => value }, loop_count: job.loop_count)
+            end
+          end
+        end
+      end
+    end
+  end
+
+  private
+
+  # @param [BenchmarkDriver::Runner::Ips::Job] job - loop_count is not nil
+  # @param [BenchmarkDriver::Context] context
+  # @return [BenchmarkDriver::Metrics]
+  def run_benchmark(job, context:)
+    benchmark = BenchmarkScript.new(
+      preludes:   [context.prelude, job.prelude],
+      script:     job.script,
+      teardown:   job.teardown,
+      loop_count: job.loop_count,
+    )
+
+    memory_status = File.expand_path('../../../../tool/lib/memory_status', __dir__)
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      with_script(benchmark.render) do |path|
+        output = IO.popen([*context.executable.command, path, f.path, target, memory_status], &:read)
+        if $?.success?
+          Integer(f.read)
+        else
+          $stdout.print(output)
+          BenchmarkDriver::Result::ERROR
+        end
+      end
+    end
+  end
+
+  # Overridden by BenchmarkDriver::Runner::Size
+  def target
+    'peak'
+  end
+
+  # Overridden by BenchmarkDriver::Runner::Size
+  def metric
+    METRIC
+  end
+
+  def with_script(script)
+    if @config.verbose >= 2
+      sep = '-' * 30
+      $stdout.puts "\n\n#{sep}[Script begin]#{sep}\n#{script}#{sep}[Script end]#{sep}\n\n"
+    end
+
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      f.puts script
+      f.close
+      return yield(f.path)
+    end
+  end
+
+  # @param [String] prelude
+  # @param [String] script
+  # @param [String] teardown
+  # @param [Integer] loop_count
+  BenchmarkScript = ::BenchmarkDriver::Struct.new(:preludes, :script, :teardown, :loop_count) do
+    def render
+      prelude = preludes.reject(&:nil?).reject(&:empty?).join("\n")
+      <<-RUBY
+#{prelude}
+#{while_loop(script, loop_count)}
+#{teardown}
+
+result_file, target, memory_status = ARGV
+require_relative memory_status
+
+ms = Memory::Status.new
+case target.to_sym
+when :peak
+  key = ms.respond_to?(:hwm) ? :hwm : :peak
+when :size
+  key = ms.respond_to?(:rss) ? :rss : :size
+else
+  raise('unexpected target: ' + target)
+end
+
+File.write(result_file, ms[key])
+      RUBY
+    end
+
+    private
+
+    def while_loop(content, times)
+      if !times.is_a?(Integer) || times <= 0
+        raise ArgumentError.new("Unexpected times: #{times.inspect}")
+      end
+
+      if times > 1
+        <<-RUBY
+__bmdv_i = 0
+while __bmdv_i < #{times}
+  #{content}
+  __bmdv_i += 1
+end
+        RUBY
+      else
+        content
+      end
+    end
+  end
+  private_constant :BenchmarkScript
+end
diff --git a/benchmark/lib/benchmark_driver/runner/ractor.rb b/benchmark/lib/benchmark_driver/runner/ractor.rb
new file mode 100644
index 0000000000..c730b8e4a5
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/ractor.rb
@@ -0,0 +1,122 @@
+require 'erb'
+
+# A runner to measure performance *inside* Ractor
+class BenchmarkDriver::Runner::Ractor < BenchmarkDriver::Runner::Ips
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob) do
+    attr_accessor :ractor
+  end
+
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC]).extend(Module.new{
+    def parse(ractor: 1, **kwargs)
+      super(**kwargs).each do |job|
+        job.ractor = ractor
+      end
+    end
+  })
+
+  private
+
+  unless private_instance_methods.include?(:run_benchmark)
+    raise "#run_benchmark is no longer defined in BenchmarkDriver::Runner::Ips"
+  end
+
+  # @param [BenchmarkDriver::Runner::Ips::Job] job - loop_count is not nil
+  # @param [BenchmarkDriver::Context] context
+  # @return [BenchmarkDriver::Metrics]
+  def run_benchmark(job, context:)
+    benchmark = BenchmarkScript.new(
+      preludes:   [context.prelude, job.prelude],
+      script:     job.script,
+      teardown:   job.teardown,
+      loop_count: job.loop_count,
+    )
+
+    results = job.ractor.times.map do
+      Tempfile.open('benchmark_driver_result')
+    end
+    duration = with_script(benchmark.render(results: results.map(&:path))) do |path|
+      success = execute(*context.executable.command, path, exception: false)
+      if success && ((value = results.map { |f| Float(f.read) }.max) > 0)
+        value
+      else
+        BenchmarkDriver::Result::ERROR
+      end
+    end
+    results.each(&:close)
+
+    value_duration(
+      loop_count: job.loop_count,
+      duration: duration,
+    )
+  end
+
+  # @param [String] prelude
+  # @param [String] script
+  # @param [String] teardown
+  # @param [Integer] loop_count
+  BenchmarkScript = ::BenchmarkDriver::Struct.new(:preludes, :script, :teardown, :loop_count) do
+    # @param [String] result - A file to write result
+    def render(results:)
+      prelude = preludes.reject(&:nil?).reject(&:empty?).join("\n")
+      ERB.new(<<-RUBY).result_with_hash(results: results)
+Warning[:experimental] = false
+# shareable-constant-value: experimental_everything
+#{prelude}
+
+if #{loop_count} == 1
+  __bmdv_loop_before = 0
+  __bmdv_loop_after = 0
+else
+  __bmdv_loop_before = Time.new
+  #{while_loop('', loop_count, id: 0)}
+  __bmdv_loop_after = Time.new
+end
+
+__bmdv_ractors = []
+<% results.size.times do %>
+__bmdv_ractors << Ractor.new(__bmdv_loop_after - __bmdv_loop_before) { |__bmdv_loop_time|
+  __bmdv_time = Time
+  __bmdv_script_before = __bmdv_time.new
+  #{while_loop(script, loop_count, id: 1)}
+  __bmdv_script_after = __bmdv_time.new
+
+  (__bmdv_script_after - __bmdv_script_before) - __bmdv_loop_time
+}
+<% end %>
+
+# Wait for all Ractors before executing code to write results
+__bmdv_ractors.map!(&:take)
+
+<% results.each do |result| %>
+File.write(<%= result.dump %>, __bmdv_ractors.shift)
+<% end %>
+
+#{teardown}
+      RUBY
+    end
+
+    private
+
+    # id is to prevent:
+    # can not isolate a Proc because it accesses outer variables (__bmdv_i)
+    def while_loop(content, times, id:)
+      if !times.is_a?(Integer) || times <= 0
+        raise ArgumentError.new("Unexpected times: #{times.inspect}")
+      elsif times == 1
+        return content
+      end
+
+      # TODO: execute in batch
+      <<-RUBY
+__bmdv_i#{id} = 0
+while __bmdv_i#{id} < #{times}
+  #{content}
+  __bmdv_i#{id} += 1
+end
+      RUBY
+    end
+  end
+  private_constant :BenchmarkScript
+end
diff --git a/benchmark/lib/benchmark_driver/runner/size.rb b/benchmark/lib/benchmark_driver/runner/size.rb
new file mode 100644
index 0000000000..1b31f901c7
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/size.rb
@@ -0,0 +1,25 @@
+require 'benchmark_driver/runner/peak'
+
+# Actually the same as BenchmarkDriver::Runner::Memory
+class BenchmarkDriver::Runner::Size < BenchmarkDriver::Runner::Peak
+  METRIC = BenchmarkDriver::Metric.new(
+    name: 'Max resident set size', unit: 'bytes', larger_better: false, worse_word: 'larger',
+  )
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Peak#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Peak#target
+  def target
+    'size'
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/stime.rb b/benchmark/lib/benchmark_driver/runner/stime.rb
new file mode 100644
index 0000000000..4577fb0bf8
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/stime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Stime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'stime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :stime
+  end
+end
diff --git a/benchmark/lib/benchmark_driver/runner/total.rb b/benchmark/lib/benchmark_driver/runner/total.rb
new file mode 100644
index 0000000000..64dc14f84e
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/total.rb
@@ -0,0 +1,137 @@
+require 'benchmark_driver/struct'
+require 'benchmark_driver/metric'
+require 'benchmark_driver/default_job'
+require 'benchmark_driver/default_job_parser'
+require 'tempfile'
+
+class BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'Total time', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  # @param [BenchmarkDriver::Config::RunnerConfig] config
+  # @param [BenchmarkDriver::Output] output
+  # @param [BenchmarkDriver::Context] contexts
+  def initialize(config:, output:, contexts:)
+    @config = config
+    @output = output
+    @contexts = contexts
+  end
+
+  # This method is dynamically called by `BenchmarkDriver::JobRunner.run`
+  # @param [Array<BenchmarkDriver::Runner::Total::Job>] jobs
+  def run(jobs)
+    if jobs.any? { |job| job.loop_count.nil? }
+      raise 'missing loop_count is not supported in Ruby repository'
+    end
+
+    @output.with_benchmark do
+      jobs.each do |job|
+        @output.with_job(name: job.name) do
+          job.runnable_contexts(@contexts).each do |context|
+            duration = BenchmarkDriver::Repeater.with_repeat(config: @config, larger_better: false) do
+              run_benchmark(job, context: context)
+            end
+            @output.with_context(name: context.name, executable: context.executable, gems: context.gems, prelude: context.prelude) do
+              @output.report(values: { metric => duration }, duration: duration, loop_count: job.loop_count)
+            end
+          end
+        end
+      end
+    end
+  end
+
+  private
+
+  # @param [BenchmarkDriver::Runner::Ips::Job] job - loop_count is not nil
+  # @param [BenchmarkDriver::Context] context
+  # @return [BenchmarkDriver::Metrics]
+  def run_benchmark(job, context:)
+    benchmark = BenchmarkScript.new(
+      preludes:   [context.prelude, job.prelude],
+      script:     job.script,
+      teardown:   job.teardown,
+      loop_count: job.loop_count,
+    )
+
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      with_script(benchmark.render(result: f.path, target: target)) do |path|
+        IO.popen([*context.executable.command, path], &:read) # TODO: print stdout if verbose=2
+        if $?.success?
+          Float(f.read)
+        else
+          BenchmarkDriver::Result::ERROR
+        end
+      end
+    end
+  end
+
+  # This method is overridden by some subclasses
+  def metric
+    METRIC
+  end
+
+  # This method is overridden by some subclasses
+  def target
+    :total
+  end
+
+  def with_script(script)
+    if @config.verbose >= 2
+      sep = '-' * 30
+      $stdout.puts "\n\n#{sep}[Script begin]#{sep}\n#{script}#{sep}[Script end]#{sep}\n\n"
+    end
+
+    Tempfile.open(['benchmark_driver-', '.rb']) do |f|
+      f.puts script
+      f.close
+      return yield(f.path)
+    end
+  end
+
+  # @param [String] prelude
+  # @param [String] script
+  # @param [String] teardown
+  # @param [Integer] loop_count
+  BenchmarkScript = ::BenchmarkDriver::Struct.new(:preludes, :script, :teardown, :loop_count) do
+    # @param [String] result - A file to write result
+    def render(result:, target:)
+      prelude = preludes.reject(&:nil?).reject(&:empty?).join("\n")
+      <<-RUBY
+#{prelude}
+
+require 'benchmark'
+__bmdv_result = Benchmark.measure {
+  #{while_loop(script, loop_count)}
+}
+
+#{teardown}
+
+File.write(#{result.dump}, __bmdv_result.#{target})
+      RUBY
+    end
+
+    private
+
+    def while_loop(content, times)
+      if !times.is_a?(Integer) || times <= 0
+        raise ArgumentError.new("Unexpected times: #{times.inspect}")
+      elsif times == 1
+        return content
+      end
+
+      # TODO: execute in batch
+      <<-RUBY
+__bmdv_i = 0
+while __bmdv_i < #{times}
+  #{content}
+  __bmdv_i += 1
+end
+      RUBY
+    end
+  end
+  private_constant :BenchmarkScript
+end
diff --git a/benchmark/lib/benchmark_driver/runner/utime.rb b/benchmark/lib/benchmark_driver/runner/utime.rb
new file mode 100644
index 0000000000..b61d83a188
--- /dev/null
+++ b/benchmark/lib/benchmark_driver/runner/utime.rb
@@ -0,0 +1,22 @@
+require 'benchmark_driver/runner/total'
+
+class BenchmarkDriver::Runner::Utime < BenchmarkDriver::Runner::Total
+  METRIC = BenchmarkDriver::Metric.new(name: 'utime', unit: 's', larger_better: false)
+
+  # JobParser returns this, `BenchmarkDriver::Runner.runner_for` searches "*::Job"
+  Job = Class.new(BenchmarkDriver::DefaultJob)
+  # Dynamically fetched and used by `BenchmarkDriver::JobParser.parse`
+  JobParser = BenchmarkDriver::DefaultJobParser.for(klass: Job, metrics: [METRIC])
+
+  private
+
+  # Overriding BenchmarkDriver::Runner::Total#metric
+  def metric
+    METRIC
+  end
+
+  # Overriding BenchmarkDriver::Runner::Total#target
+  def target
+    :utime
+  end
+end
diff --git a/benchmark/lib/load.rb b/benchmark/lib/load.rb
new file mode 100644
index 0000000000..31b770c484
--- /dev/null
+++ b/benchmark/lib/load.rb
@@ -0,0 +1,18 @@
+# How to use this file:
+#   1. write a `$(srcdir)/test.rb` like:
+=begin
+require_relative 'benchmark/lib/load'
+
+Benchmark.driver(repeat_count: 5){|x|
+  x.executable name: 'clean-miniruby', command: %w'../clean-trunk/miniruby'
+  x.executable name: 'modif-miniruby', command: %w'./miniruby'
+
+  x.report %q{
+    h = {a: 1, b: 2, c: 3, d: 4}
+  }
+}
+=end
+#
+#  2. `make run`
+$:.unshift(File.join(__dir__, '../benchmark-driver/lib'))
+require 'benchmark_driver'
diff --git a/benchmark/bm_loop_for.rb b/benchmark/loop_for.rb
index 0fc4cc1511..0fc4cc1511 100644
--- a/benchmark/bm_loop_for.rb
+++ b/benchmark/loop_for.rb
diff --git a/benchmark/bm_loop_generator.rb b/benchmark/loop_generator.rb
index d3375c744c..d3375c744c 100644
--- a/benchmark/bm_loop_generator.rb
+++ b/benchmark/loop_generator.rb
diff --git a/benchmark/bm_loop_times.rb b/benchmark/loop_times.rb
index 521f72ad1a..521f72ad1a 100644
--- a/benchmark/bm_loop_times.rb
+++ b/benchmark/loop_times.rb
diff --git a/benchmark/loop_whileloop.rb b/benchmark/loop_whileloop.rb
new file mode 100644
index 0000000000..0072822c06
--- /dev/null
+++ b/benchmark/loop_whileloop.rb
@@ -0,0 +1,4 @@
+i = 0
+while i<30_000_000 # benchmark loop 1
+  i += 1
+end
diff --git a/benchmark/loop_whileloop2.rb b/benchmark/loop_whileloop2.rb
new file mode 100644
index 0000000000..47d02dffc4
--- /dev/null
+++ b/benchmark/loop_whileloop2.rb
@@ -0,0 +1,4 @@
+i = 0
+while i< 6_000_000 # benchmark loop 2
+  i += 1
+end
diff --git a/benchmark/make_fasta_output.rb b/benchmark/make_fasta_output.rb
deleted file mode 100644
index b6d787ae27..0000000000
--- a/benchmark/make_fasta_output.rb
+++ /dev/null
@@ -1,19 +0,0 @@
-# prepare 'fasta.output'
-
-def prepare_fasta_output n
-  filebase = File.join(File.dirname($0), 'fasta.output')
-  script = File.join(File.dirname($0), 'bm_so_fasta.rb')
-  file = "#{filebase}.#{n}"
-
-  unless FileTest.exist?(file)
-    STDERR.puts "preparing #{file}"
-
-    open(file, 'w'){|f|
-      ARGV[0] = n
-      $stdout = f
-      load script
-      $stdout = STDOUT
-    }
-  end
-end
-
diff --git a/benchmark/marshal_dump_flo.rb b/benchmark/marshal_dump_flo.rb
new file mode 100644
index 0000000000..9b8d0c6afb
--- /dev/null
+++ b/benchmark/marshal_dump_flo.rb
@@ -0,0 +1,2 @@
+bug10761 = 10000.times.map { |x| x.to_f }
+100.times { Marshal.dump(bug10761) }
diff --git a/benchmark/marshal_dump_load_geniv.rb b/benchmark/marshal_dump_load_geniv.rb
new file mode 100644
index 0000000000..8252ad90fa
--- /dev/null
+++ b/benchmark/marshal_dump_load_geniv.rb
@@ -0,0 +1,10 @@
+a = ''
+a.instance_eval do
+  @a = :a
+  @b = :b
+  @c = :c
+end
+100000.times do
+  a = Marshal.load(Marshal.dump(a))
+end
+#p(a.instance_eval { @a == :a && @b == :b && @c == :c })
diff --git a/benchmark/marshal_dump_load_integer.yml b/benchmark/marshal_dump_load_integer.yml
new file mode 100644
index 0000000000..78ebf823d2
--- /dev/null
+++ b/benchmark/marshal_dump_load_integer.yml
@@ -0,0 +1,22 @@
+prelude: |
+  smallint_array = 1000.times.map { |x| x }
+  bigint32_array = 1000.times.map { |x| x + 2**32 }
+  bigint64_array = 1000.times.map { |x| x + 2**64 }
+
+  smallint_dump = Marshal.dump(smallint_array)
+  bigint32_dump = Marshal.dump(bigint32_array)
+  bigint64_dump = Marshal.dump(bigint64_array)
+benchmark:
+  marshal_dump_integer_small: |
+    Marshal.dump(smallint_array)
+  marshal_dump_integer_over_32_bit: |
+    Marshal.dump(bigint32_array)
+  marshal_dump_integer_over_64_bit: |
+    Marshal.dump(bigint64_array)
+  marshal_load_integer_small: |
+    Marshal.load(smallint_dump)
+  marshal_load_integer_over_32_bit: |
+    Marshal.load(bigint32_dump)
+  marshal_load_integer_over_64_bit: |
+    Marshal.load(bigint64_dump)
+loop_count: 4000
diff --git a/benchmark/marshal_dump_load_time.rb b/benchmark/marshal_dump_load_time.rb
new file mode 100644
index 0000000000..e29743b791
--- /dev/null
+++ b/benchmark/marshal_dump_load_time.rb
@@ -0,0 +1 @@
+100000.times { Marshal.load(Marshal.dump(Time.now)) }
diff --git a/benchmark/masgn.yml b/benchmark/masgn.yml
new file mode 100644
index 0000000000..31cb8ee4a3
--- /dev/null
+++ b/benchmark/masgn.yml
@@ -0,0 +1,53 @@
+prelude: |
+  a = [nil] * 3
+  b = Class.new{attr_writer :a, :b, :c}.new
+  c = d = e = f = g = h = i = nil
+benchmark:
+  array2_2: "c = (a[0], a[1] = 1, 2)"
+  array2_3: "c = (a[0], a[1] = 1, 2, 3)"
+  array3_2: "c = (a[0], a[1], a[2] = 1, 2)"
+  array3_3: "c = (a[0], a[1], a[2] = 1, 2, 3)"
+  attr2_2: "c = (b.a, b.b = 1, 2)"
+  attr2_3: "c = (b.a, b.b = 1, 2, 3)"
+  attr3_2: "c = (b.a, b.b, b.c = 1, 2)"
+  attr3_3: "c = (b.a, b.b, b.c = 1, 2, 3)"
+  lvar2_2: "c = (d, e = 1, 2)"
+  lvar2_3: "c = (d, e = 1, 2, 3)"
+  lvar3_2: "c = (d, e, f = 1, 2)"
+  lvar3_3: "c = (d, e, f = 1, 2, 3)"
+  array2_2p: "(a[0], a[1] = 1, 2; nil)"
+  array2_3p: "(a[0], a[1] = 1, 2, 3; nil)"
+  array3_2p: "(a[0], a[1], a[2] = 1, 2; nil)"
+  array3_3p: "(a[0], a[1], a[2] = 1, 2, 3; nil)"
+  attr2_2p: "(b.a, b.b = 1, 2; nil)"
+  attr2_3p: "(b.a, b.b = 1, 2, 3; nil)"
+  attr3_2p: "(b.a, b.b, b.c = 1, 2; nil)"
+  attr3_3p: "(b.a, b.b, b.c = 1, 2, 3; nil)"
+  lvar2_2p: "(d, e = 1, 2; nil)"
+  lvar2_3p: "(d, e = 1, 2, 3; nil)"
+  lvar3_2p: "(d, e, f = 1, 2; nil)"
+  lvar3_3p: "(d, e, f = 1, 2, 3; nil)"
+  array2_2lv: "c = (a[0], a[1] = g, h)"
+  array2_ilv: "c = (a[0], a[1] = g, h, i)"
+  arrayi_2lv: "c = (a[0], a[1], a[2] = g, h)"
+  arrayi_ilv: "c = (a[0], a[1], a[2] = g, h, i)"
+  attr2_2lv: "c = (b.a, b.b = g, h)"
+  attr2_ilv: "c = (b.a, b.b = g, h, i)"
+  attri_2lv: "c = (b.a, b.b, b.c = g, h)"
+  attri_ilv: "c = (b.a, b.b, b.c = g, h, i)"
+  lvar2_2lv: "c = (d, e = g, h)"
+  lvar2_ilv: "c = (d, e = g, h, i)"
+  lvari_2lv: "c = (d, e, f = g, h)"
+  lvari_ilv: "c = (d, e, f = g, h, i)"
+  array2_2plv: "(a[0], a[1] = g, h; nil)"
+  array2_iplv: "(a[0], a[1] = g, h, i; nil)"
+  arrayi_2plv: "(a[0], a[1], a[2] = g, h; nil)"
+  arrayi_iplv: "(a[0], a[1], a[2] = g, h, i; nil)"
+  attr2_2plv: "(b.a, b.b = g, h; nil)"
+  attr2_iplv: "(b.a, b.b = g, h, i; nil)"
+  attri_2plv: "(b.a, b.b, b.c = g, h; nil)"
+  attri_iplv: "(b.a, b.b, b.c = g, h, i; nil)"
+  lvar2_2plv: "(d, e = g, h; nil)"
+  lvar2_iplv: "(d, e = g, h, i; nil)"
+  lvari_2plv: "(d, e, f = g, h; nil)"
+  lvari_iplv: "(d, e, f = g, h, i; nil)"
diff --git a/benchmark/match_gt4.rb b/benchmark/match_gt4.rb
new file mode 100644
index 0000000000..ffda109912
--- /dev/null
+++ b/benchmark/match_gt4.rb
@@ -0,0 +1 @@
+1000000.times { /(.)(.)(\d+)(\d)/.match("THX1138.") }
diff --git a/benchmark/match_small.rb b/benchmark/match_small.rb
new file mode 100644
index 0000000000..3b743d484a
--- /dev/null
+++ b/benchmark/match_small.rb
@@ -0,0 +1 @@
+1000000.times { 'haystack'.match(/hay/) }
diff --git a/benchmark/method_bind_call.yml b/benchmark/method_bind_call.yml
new file mode 100644
index 0000000000..9e0e046ed4
--- /dev/null
+++ b/benchmark/method_bind_call.yml
@@ -0,0 +1,16 @@
+prelude: |
+  named_module = Kernel
+
+  module FakeName
+    def self.name
+      "NotMyame".freeze
+    end
+  end
+
+  MOD_NAME = Module.instance_method(:name)
+
+benchmark:
+  fastpath: MOD_NAME.bind_call(Kernel)
+  slowpath: MOD_NAME.bind_call(FakeName)
+
+loop_count: 100_000
diff --git a/benchmark/mjit_exivar.yml b/benchmark/mjit_exivar.yml
new file mode 100644
index 0000000000..2584fa6410
--- /dev/null
+++ b/benchmark/mjit_exivar.yml
@@ -0,0 +1,18 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  class Bench < Hash
+    def initialize
+      @exivar = nil
+    end
+
+    def exivar
+      @exivar
+    end
+  end
+
+  bench = Bench.new
+
+benchmark:
+  mjit_exivar: bench.exivar
+
+loop_count: 200000000
diff --git a/benchmark/mjit_integer.yml b/benchmark/mjit_integer.yml
new file mode 100644
index 0000000000..a6b5c9ee16
--- /dev/null
+++ b/benchmark/mjit_integer.yml
@@ -0,0 +1,32 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_abs(int)        int.abs        end
+  def mjit_bit_length(int) int.bit_length end
+  def mjit_comp(int)       ~int           end
+  def mjit_even?(int)      int.even?      end
+  def mjit_integer?(int)   int.integer?   end
+  def mjit_magnitude(int)  int.magnitude  end
+  def mjit_odd?(int)       int.odd?       end
+  def mjit_ord(int)        int.ord        end
+  def mjit_size(int)       int.size       end
+  def mjit_to_i(int)       int.to_i       end
+  def mjit_to_int(int)     int.to_int     end
+  def mjit_uminus(int)     -int           end
+  def mjit_zero?(int)      int.zero?      end
+
+benchmark:
+  - mjit_abs(-1)
+  - mjit_bit_length(100)
+  - mjit_comp(1)
+  - mjit_even?(2)
+  - mjit_integer?(0)
+  - mjit_magnitude(-1)
+  - mjit_odd?(1)
+  - mjit_ord(1)
+  - mjit_size(1)
+  - mjit_to_i(1)
+  - mjit_to_int(1)
+  - mjit_uminus(1)
+  - mjit_zero?(0)
+
+loop_count: 40000000
diff --git a/benchmark/mjit_kernel.yml b/benchmark/mjit_kernel.yml
new file mode 100644
index 0000000000..7720e65c2c
--- /dev/null
+++ b/benchmark/mjit_kernel.yml
@@ -0,0 +1,20 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_class(obj)
+    obj.class
+  end
+
+  def mjit_frozen?(obj)
+    obj.frozen?
+  end
+
+  str = ""
+  fstr = "".freeze
+
+benchmark:
+  - mjit_class(self)
+  - mjit_class(1)
+  - mjit_frozen?(str)
+  - mjit_frozen?(fstr)
+
+loop_count: 40000000
diff --git a/benchmark/mjit_leave.yml b/benchmark/mjit_leave.yml
new file mode 100644
index 0000000000..9ac68b164b
--- /dev/null
+++ b/benchmark/mjit_leave.yml
@@ -0,0 +1,8 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def leave
+    nil
+  end
+benchmark:
+  mjit_leave: leave
+loop_count: 200000000
diff --git a/benchmark/mjit_opt_cc_insns.yml b/benchmark/mjit_opt_cc_insns.yml
new file mode 100644
index 0000000000..fed6d34bd5
--- /dev/null
+++ b/benchmark/mjit_opt_cc_insns.yml
@@ -0,0 +1,27 @@
+# opt_* insns using vm_method_cfunc_is with send-compatible operands:
+#   * opt_nil_p
+#   * opt_not
+#   * opt_eq
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_nil?(obj)
+    obj.nil?
+  end
+
+  def mjit_not(obj)
+    !obj
+  end
+
+  def mjit_eq(a, b)
+    a == b
+  end
+
+benchmark:
+  - script: mjit_nil?(1)
+    loop_count: 40000000
+  - script: mjit_not(1)
+    loop_count: 40000000
+  - script: mjit_eq(1, nil)
+    loop_count: 8000000
+  - script: mjit_eq(nil, 1)
+    loop_count: 8000000
diff --git a/benchmark/mjit_struct_aref.yml b/benchmark/mjit_struct_aref.yml
new file mode 100644
index 0000000000..bfba1323f2
--- /dev/null
+++ b/benchmark/mjit_struct_aref.yml
@@ -0,0 +1,10 @@
+type: lib/benchmark_driver/runner/mjit
+prelude: |
+  def mjit_struct_aref(struct)
+    struct.aa
+  end
+  struct = Struct.new(:a0, :a1, :a2, :a3, :a4, :a5, :a6, :a7, :a8, :a9, :aa).new
+
+benchmark: mjit_struct_aref(struct)
+
+loop_count: 40000000
diff --git a/benchmark/module_eqq.yml b/benchmark/module_eqq.yml
new file mode 100644
index 0000000000..a561fb86dc
--- /dev/null
+++ b/benchmark/module_eqq.yml
@@ -0,0 +1,27 @@
+prelude: |
+  class SimpleClass; end
+  class MediumClass
+    10.times { include Module.new }
+  end
+  class LargeClass
+    100.times { include Module.new }
+  end
+  class HugeClass
+    300.times { include Module.new }
+  end
+  SimpleObj = SimpleClass.new
+  MediumObj = MediumClass.new
+  LargeObj = LargeClass.new
+  HugeObj = HugeClass.new
+benchmark:
+  simple_class_eqq_simple_obj: |
+    SimpleClass === SimpleObj
+  medium_class_eqq_simple_obj: |
+    MediumClass === SimpleObj
+  simple_class_eqq_medium_obj: |
+    SimpleClass === MediumObj
+  simple_class_eqq_large_obj: |
+    SimpleClass === LargeObj
+  simple_class_eqq_huge_obj: |
+    SimpleClass === HugeObj
+loop_count: 20000000
diff --git a/benchmark/nil_p.yml b/benchmark/nil_p.yml
new file mode 100644
index 0000000000..79ba4f2177
--- /dev/null
+++ b/benchmark/nil_p.yml
@@ -0,0 +1,9 @@
+prelude: |
+  class Niller; def nil?; true; end; end
+  xnil, notnil = nil, Object.new
+  niller = Niller.new
+benchmark:
+  - xnil.nil?
+  - notnil.nil?
+  - niller.nil?
+loop_count: 10000000
diff --git a/benchmark/nilclass.yml b/benchmark/nilclass.yml
new file mode 100644
index 0000000000..fba67a5f6a
--- /dev/null
+++ b/benchmark/nilclass.yml
@@ -0,0 +1,6 @@
+benchmark:
+  to_i: |
+    nil.to_i
+  to_f: |
+    nil.to_f
+loop_count: 100000
diff --git a/benchmark/num_zero_p.yml b/benchmark/num_zero_p.yml
new file mode 100644
index 0000000000..2195963433
--- /dev/null
+++ b/benchmark/num_zero_p.yml
@@ -0,0 +1,8 @@
+benchmark:
+  - 0.zero?
+  - 1.zero?
+  - 0r.zero?
+  - 1r.zero?
+  - 0i.zero?
+  - 1i.zero?
+loop_count: 50000000
diff --git a/benchmark/numeric_methods.yml b/benchmark/numeric_methods.yml
new file mode 100644
index 0000000000..1384902935
--- /dev/null
+++ b/benchmark/numeric_methods.yml
@@ -0,0 +1,29 @@
+prelude: |
+  int = 42
+  flo = 4.2
+benchmark:
+  real?: |
+    int.real?
+  integer?: |
+    flo.integer?
+  finite?: |
+    int.finite?
+  infinite?: |
+    int.infinite?
+  integer_real: |
+    int.real
+  float_real: |
+    flo.real
+  integr_imag: |
+    int.imag
+  float_imag: |
+    flo.imag
+  integer_conj: |
+    int.conj
+  float_conj: |
+    flo.conj
+  integer_numerator: |
+    int.numerator
+  integer_denominator: |
+    int.denominator
+loop_count: 20000000
diff --git a/benchmark/object_allocate.yml b/benchmark/object_allocate.yml
new file mode 100644
index 0000000000..93ff463e41
--- /dev/null
+++ b/benchmark/object_allocate.yml
@@ -0,0 +1,21 @@
+prelude: |
+  class Eight
+    8.times { include(Module.new) }
+  end
+  class ThirtyTwo
+    32.times { include(Module.new) }
+  end
+  class SixtyFour
+    64.times { include(Module.new) }
+  end
+  class OneTwentyEight
+    128.times { include(Module.new) }
+  end
+  # Disable GC to see raw throughput:
+  GC.disable
+benchmark:
+  allocate_8_deep: Eight.new
+  allocate_32_deep: ThirtyTwo.new
+  allocate_64_deep: SixtyFour.new
+  allocate_128_deep: OneTwentyEight.new
+loop_count: 100000
diff --git a/benchmark/objspace_dump_all.yml b/benchmark/objspace_dump_all.yml
new file mode 100644
index 0000000000..ebab562d2e
--- /dev/null
+++ b/benchmark/objspace_dump_all.yml
@@ -0,0 +1,13 @@
+prelude: |
+  require 'objspace'
+  require 'tempfile'
+  $objs = 1_000.times.map { Object.new }
+  $strings = 1_000.times.map { |i| "string #{i}" }
+  $file = Tempfile.new('heap')
+  $dev_null = File.open(File::NULL, 'w+')
+
+benchmark:
+  dump_all_string: "ObjectSpace.dump_all(output: :string)"
+  dump_all_file: "ObjectSpace.dump_all(output: $file)"
+  dump_all_dev_null: "ObjectSpace.dump_all(output: $dev_null)"
+loop_count: 1
diff --git a/benchmark/other-lang/fact.py b/benchmark/other-lang/fact.py
index 01593965d9..1ce9f76275 100644
--- a/benchmark/other-lang/fact.py
+++ b/benchmark/other-lang/fact.py
@@ -3,7 +3,7 @@
 
 def factL(n):
 	r = 1
-	for x in range(2, n):
+	for x in range(2, n+1):
 		r *= x
 	return r
 
diff --git a/benchmark/other-lang/fact.rb b/benchmark/other-lang/fact.rb
index 7e97b22b39..6cedc752cd 100644
--- a/benchmark/other-lang/fact.rb
+++ b/benchmark/other-lang/fact.rb
@@ -6,8 +6,8 @@ def fact(n)
   end
 end
 
-i=0
+i = 0
 while i<10000
-  i+=1
+  i += 1
   fact(100)
 end
diff --git a/benchmark/other-lang/loop.rb b/benchmark/other-lang/loop.rb
index d43cef61f3..b367b9dbf3 100644
--- a/benchmark/other-lang/loop.rb
+++ b/benchmark/other-lang/loop.rb
@@ -1,4 +1,4 @@
-i=0
+i = 0
 while i<30000000
-  i+=1
+  i += 1
 end
diff --git a/benchmark/pm_array.yml b/benchmark/pm_array.yml
new file mode 100644
index 0000000000..babb65a289
--- /dev/null
+++ b/benchmark/pm_array.yml
@@ -0,0 +1,19 @@
+prelude: |
+  def call(*val)
+    case val
+      in [String => body]
+        [200, {}, [body]]
+      in [Integer => status]
+        [status, {}, [""]]
+      in [Integer, String] => response
+        [response[0], {}, [response[1]]]
+      in [Integer, Hash, String] => response
+        [response[0], response[1], [response[2]]]
+    end
+  end
+
+benchmark:
+  first_match: call("ok")
+  second_match: call(401)
+  third_match: call(200, "ok")
+  fourth_match: call(201, {}, "created")
diff --git a/benchmark/prepare_so_count_words.rb b/benchmark/prepare_so_count_words.rb
deleted file mode 100644
index ee2138cdb2..0000000000
--- a/benchmark/prepare_so_count_words.rb
+++ /dev/null
@@ -1,15 +0,0 @@
-# prepare 'wc.input'
-
-def prepare_wc_input
-  wcinput = File.join(File.dirname($0), 'wc.input')
-  wcbase  = File.join(File.dirname($0), 'wc.input.base')
-  unless FileTest.exist?(wcinput)
-    data = File.read(wcbase)
-    13.times{
-      data << data
-    }
-    open(wcinput, 'w'){|f| f.write data}
-  end
-end
-
-prepare_wc_input
diff --git a/benchmark/prepare_so_k_nucleotide.rb b/benchmark/prepare_so_k_nucleotide.rb
deleted file mode 100644
index f28f4460a1..0000000000
--- a/benchmark/prepare_so_k_nucleotide.rb
+++ /dev/null
@@ -1,2 +0,0 @@
-require File.join(File.dirname(__FILE__), 'make_fasta_output')
-prepare_fasta_output(100_000)
diff --git a/benchmark/prepare_so_reverse_complement.rb b/benchmark/prepare_so_reverse_complement.rb
deleted file mode 100644
index 7f089109de..0000000000
--- a/benchmark/prepare_so_reverse_complement.rb
+++ /dev/null
@@ -1,2 +0,0 @@
-require File.join(File.dirname(__FILE__), 'make_fasta_output')
-prepare_fasta_output(2_500_000)
diff --git a/benchmark/ractor_const.yml b/benchmark/ractor_const.yml
new file mode 100644
index 0000000000..d7ab74bdca
--- /dev/null
+++ b/benchmark/ractor_const.yml
@@ -0,0 +1,4 @@
+type: lib/benchmark_driver/runner/ractor
+benchmark:
+  ractor_const: Object
+ractor: 1
diff --git a/benchmark/ractor_float_to_s.yml b/benchmark/ractor_float_to_s.yml
new file mode 100644
index 0000000000..8f492be668
--- /dev/null
+++ b/benchmark/ractor_float_to_s.yml
@@ -0,0 +1,8 @@
+type: lib/benchmark_driver/runner/ractor
+prelude: |
+  FLOATS = [*0.0.step(1.0, 0.001)]
+benchmark:
+  ractor_float_to_s: |
+    FLOATS.each {|f| f.to_s}
+loop_count: 100
+ractor: 2
diff --git a/benchmark/range_last.yml b/benchmark/range_last.yml
new file mode 100644
index 0000000000..a6674f82ee
--- /dev/null
+++ b/benchmark/range_last.yml
@@ -0,0 +1,4 @@
+benchmark:
+  - (1..1_000_000).last(100)
+  - (1..1_000_000).last(1000)
+  - (1..1_000_000).last(10000)
diff --git a/benchmark/range_min.yml b/benchmark/range_min.yml
new file mode 100644
index 0000000000..9e60dd7308
--- /dev/null
+++ b/benchmark/range_min.yml
@@ -0,0 +1,2 @@
+benchmark:
+  - (1..10).min
diff --git a/benchmark/realpath.yml b/benchmark/realpath.yml
new file mode 100644
index 0000000000..90a029d5b9
--- /dev/null
+++ b/benchmark/realpath.yml
@@ -0,0 +1,30 @@
+prelude: |
+  f = File
+  pwd = Dir.pwd
+  Dir.mkdir('b') unless f.directory?('b')
+  f.write('b/a', '') unless f.file?('b/a')
+
+  relative = 'b/a'
+  absolute = File.join(pwd, relative)
+  dir = 'b'
+  file = 'a'
+
+  relative_dir = 'b/c'
+  absolute_dir = File.join(pwd, relative_dir)
+  file_dir = 'c'
+benchmark:
+  relative_nil: "f.realpath(relative, nil)"
+  absolute_nil: "f.realpath(absolute, nil)"
+  relative_relative: "f.realpath(file, dir)"
+  absolute_relative: "f.realpath(absolute, dir)"
+  relative_absolute: "f.realpath(relative, pwd)"
+  relative_nil_dir: "f.realdirpath(relative_dir, nil)"
+  absolute_nil_dir: "f.realdirpath(absolute_dir, nil)"
+  relative_relative_dir: "f.realdirpath(file_dir, dir)"
+  absolute_relative_dir: "f.realdirpath(absolute_dir, dir)"
+  relative_absolute_dir: "f.realdirpath(relative_dir, pwd)"
+  relative_nil_notexist: "f.realpath(relative_dir, nil) rescue nil"
+  absolute_nil_notexist: "f.realpath(absolute_dir, nil) rescue nil"
+  relative_relative_notexist: "f.realpath(file_dir, dir) rescue nil"
+  absolute_relative_notexist: "f.realpath(absolute_dir, dir) rescue nil"
+  relative_absolute_notexist: "f.realpath(relative_dir, pwd) rescue nil"
diff --git a/benchmark/report.rb b/benchmark/report.rb
deleted file mode 100644
index d2dc56b1e1..0000000000
--- a/benchmark/report.rb
+++ /dev/null
@@ -1,79 +0,0 @@
-#
-# YARV benchmark driver
-#
-
-require 'yarvutil'
-require 'benchmark'
-require 'rbconfig'
-
-def exec_command type, file, w
-  <<-EOP
-  $DRIVER_PATH = '#{File.dirname($0)}'
-  $LOAD_PATH.replace $LOAD_PATH | #{$LOAD_PATH.inspect}
-  require 'benchmark'
-  require 'yarvutil'
-#  print '#{type}'
-  begin
-    puts Benchmark.measure{
-      #{w}('#{file}')
-    }.utime
-  rescue Exception => exec_command_error_variable
-    puts "\t" + exec_command_error_variable.message
-  end
-  EOP
-end
-
-def benchmark cmd
-  rubybin = ENV['RUBY'] || RbConfig.ruby
-
-  IO.popen(rubybin, 'r+'){|io|
-    io.write cmd
-    io.close_write
-    return io.gets
-  }
-end
-
-def ruby_exec file
-  prog = exec_command 'ruby', file, 'load'
-  benchmark prog
-end
-
-def yarv_exec file
-  prog = exec_command 'yarv', file, 'YARVUtil.load_bm'
-  benchmark prog
-end
-
-$wr = $wy = nil
-
-def measure bench
-  file = File.dirname($0) + "/bm_#{bench}.rb"
-  r = ruby_exec(file).to_f
-  y = yarv_exec(file).to_f
-  puts "#{bench}\t#{r}\t#{y}"
-end
-
-def measure2
-  r = ruby_exec.to_f
-  y = yarv_exec.to_f
-  puts r/y
-end
-
-if $0 == __FILE__
-  %w{
-    whileloop
-    whileloop2
-    times
-    const
-    method
-    poly_method
-    block
-    rescue
-    rescue2
-  }.each{|bench|
-    measure bench
-  }
-end
-
-
-
-
diff --git a/benchmark/require.yml b/benchmark/require.yml
new file mode 100644
index 0000000000..09f218cf08
--- /dev/null
+++ b/benchmark/require.yml
@@ -0,0 +1,32 @@
+prelude: |
+  require "fileutils"
+
+  def prepare
+    num_files = 10000
+
+    basename = File.dirname($0)
+    data_dir = File.join(basename, "bm_require.data")
+
+    # skip if all of files exists
+    if File.exist?(File.join(data_dir, "c#{num_files}.rb"))
+      return
+    end
+
+    FileUtils.mkdir_p(data_dir)
+
+    1.upto(num_files) do |i|
+      File.write("#{data_dir}/c#{i}.rb", "class C#{i}\n""end\n")
+    end
+  end
+
+  prepare
+benchmark:
+  require: |
+    $:.push File.join(File.dirname(__FILE__), "bm_require.data")
+
+    1.upto(10000) do |i|
+      require "c#{i}"
+    end
+
+    $:.pop
+loop_count: 1
diff --git a/benchmark/require_thread.yml b/benchmark/require_thread.yml
new file mode 100644
index 0000000000..0c63257106
--- /dev/null
+++ b/benchmark/require_thread.yml
@@ -0,0 +1,40 @@
+prelude: |
+  require "fileutils"
+
+  def prepare
+    num_files = 10000
+
+    basename = File.dirname($0)
+    data_dir = File.join(basename, "bm_require.data")
+
+    # skip if all of files exists
+    if File.exist?(File.join(data_dir, "c#{num_files}.rb"))
+      return
+    end
+
+    FileUtils.mkdir_p(data_dir)
+
+    1.upto(num_files) do |i|
+      File.write("#{data_dir}/c#{i}.rb", "class C#{i}\n""end\n")
+    end
+  end
+
+  prepare
+benchmark:
+  require_thread: |
+    $:.push File.join(File.dirname(__FILE__), "bm_require.data")
+
+    i=0
+    t = Thread.new do
+      while true
+        i = i+1 # dummy loop
+      end
+    end
+
+    1.upto(100) do |i|
+      require "c#{i}"
+    end
+
+    $:.pop
+    t.kill
+loop_count: 1
diff --git a/benchmark/run.rb b/benchmark/run.rb
deleted file mode 100644
index 0cd2363849..0000000000
--- a/benchmark/run.rb
+++ /dev/null
@@ -1,127 +0,0 @@
-#
-# Ruby benchmark driver
-#
-
-require 'benchmark'
-require 'rbconfig'
-
-$matzrubyonly = false
-$rubyonly = false
-
-$results  = []
-
-# prepare 'wc.input'
-def prepare_wc_input
-  wcinput = File.join(File.dirname($0), 'wc.input')
-  wcbase  = File.join(File.dirname($0), 'wc.input.base')
-  unless FileTest.exist?(wcinput)
-    data = File.read(wcbase)
-    13.times{
-      data << data
-    }
-    open(wcinput, 'w'){|f| f.write data}
-  end
-end
-
-prepare_wc_input
-
-def bm file
-  prog = File.readlines(file).map{|e| e.rstrip}.join("\n")
-  return if prog.empty?
-
-  /[a-z]+_(.+)\.rb/ =~ file
-  bm_name = $1
-  puts '-----------------------------------------------------------' unless $rubyonly || $matzrubyonly
-  puts "#{bm_name}: "
-
-
-puts <<EOS unless $matzrubyonly || $rubyonly
-#{prog}
---
-EOS
-  begin
-    result = [bm_name]
-    result << matzruby_exec(file) unless $rubyonly
-    result << ruby_exec(file) unless $matzrubyonly
-    $results << result
-
-  rescue Exception => e
-    puts
-    puts "** benchmark failure: #{e}"
-    puts e.backtrace
-  end
-end
-
-def benchmark file, bin
-  m = Benchmark.measure{
-    `#{bin} #{$opts} #{file}`
-  }
-  sec = '%.3f' % m.real
-  puts " #{sec}"
-  sec
-end
-
-def ruby_exec file
-  print 'ruby'
-  benchmark file, $ruby_program
-end
-
-def matzruby_exec file
-  print 'matz'
-  rubylib = ENV['RUBYLIB']
-  ENV['RUBYLIB'] = ''
-  r = benchmark file, $matzruby_program
-  ENV['RUBYLIB'] = rubylib
-  r
-end
-
-if $0 == __FILE__
-  ARGV.each{|arg|
-    case arg
-    when /\A--ruby=(.+)/
-      $ruby_program = $1
-    when /\A--matzruby=(.+)/
-      $matzruby_program = $1
-    when /\A--opts=(.+)/
-      $opts = $1
-    when /\A(-r|--only-ruby)\z/
-      $rubyonly = true
-    when /\A(-m|--only-matzruby)\z/
-      $matzrubyonly = true
-    end
-  }
-  ARGV.delete_if{|arg|
-    /\A-/ =~ arg
-  }
-
-  puts "MatzRuby:"
-  system("#{$matzruby_program} -v")
-  puts "Ruby:"
-  system("#{$ruby_program} -v")
-  puts
-
-  if ARGV.empty?
-    Dir.glob(File.dirname(__FILE__) + '/bm_*.rb').sort.each{|file|
-      bm file
-    }
-  else
-    ARGV.each{|file|
-      Dir.glob(File.join(File.dirname(__FILE__), file + '*')){|ef|
-        # file = "#{File.dirname(__FILE__)}/#{file}.rb"
-        bm ef
-      }
-    }
-  end
-
-  puts
-  puts "-- benchmark summary ---------------------------"
-  $results.each{|res|
-    print res.shift, "\t"
-    (res||[]).each{|result|
-      /([\d\.]+)/ =~ result
-      print $1 + "\t" if $1
-    }
-    puts
-  }
-end
-
diff --git a/benchmark/runc.rb b/benchmark/runc.rb
deleted file mode 100644
index 97c5cef045..0000000000
--- a/benchmark/runc.rb
+++ /dev/null
@@ -1,27 +0,0 @@
-#
-#
-#
-
-require 'benchmark'
-require 'rbconfig'
-
-$rubybin = ENV['RUBY'] || RbConfig.ruby
-
-def runfile file
-  puts file
-  file = File.join(File.dirname($0), 'contrib', file)
-  Benchmark.bm{|x|
-    x.report('ruby'){
-      system("#{$rubybin} #{file}")
-    }
-    x.report('yarv'){
-      system("#{$rubybin} -rite -I.. #{file}")
-    }
-  }
-end
-
-ARGV.each{|file|
-  runfile file
-}
-
-
diff --git a/benchmark/securerandom.rb b/benchmark/securerandom.rb
new file mode 100644
index 0000000000..a082ea6d5b
--- /dev/null
+++ b/benchmark/securerandom.rb
@@ -0,0 +1,5 @@
+require "securerandom"
+
+20_0000.times do
+  SecureRandom.random_number(100)
+end
diff --git a/benchmark/so_ackermann.rb b/benchmark/so_ackermann.rb
new file mode 100644
index 0000000000..4effa1ecaf
--- /dev/null
+++ b/benchmark/so_ackermann.rb
@@ -0,0 +1,19 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: ackermann-ruby.code,v 1.4 2004/11/13 07:40:41 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+
+def ack(m, n)
+    if m == 0 then
+        n + 1
+    elsif n == 0 then
+        ack(m - 1, 1)
+    else
+        ack(m - 1, ack(m, n - 1))
+    end
+end
+
+NUM = 9
+ack(3, NUM)
+
+
diff --git a/benchmark/so_array.rb b/benchmark/so_array.rb
new file mode 100644
index 0000000000..767e03db5f
--- /dev/null
+++ b/benchmark/so_array.rb
@@ -0,0 +1,23 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: ary-ruby.code,v 1.4 2004/11/13 07:41:27 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# with help from Paul Brannan and Mark Hubbart
+
+n = 9000 # Integer(ARGV.shift || 1)
+
+x = Array.new(n)
+y = Array.new(n, 0)
+
+n.times{|bi|
+  x[bi] = bi + 1
+}
+
+(0 .. 999).each do |e|
+  (n-1).step(0,-1) do |bi|
+    y[bi] += x.at(bi)
+  end
+end
+# puts "#{y.first} #{y.last}"
+
+
diff --git a/benchmark/so_binary_trees.rb b/benchmark/so_binary_trees.rb
new file mode 100644
index 0000000000..b1693e4109
--- /dev/null
+++ b/benchmark/so_binary_trees.rb
@@ -0,0 +1,62 @@
+# The Computer Language Shootout Benchmarks
+# http://shootout.alioth.debian.org
+#
+# contributed by Jesse Millikan
+
+# disable output
+alias puts_orig puts
+def puts str
+  # disable puts
+end
+
+def item_check(tree)
+ if tree[0] == nil
+  tree[1]
+ else
+  tree[1] + item_check(tree[0]) - item_check(tree[2])
+ end
+end
+
+def bottom_up_tree(item, depth)
+ if depth > 0
+  item_item = 2 * item
+  depth -= 1
+  [bottom_up_tree(item_item - 1, depth), item, bottom_up_tree(item_item, depth)]
+ else
+  [nil, item, nil]
+ end
+end
+
+max_depth = 16 # ARGV[0].to_i
+min_depth = 4
+
+max_depth = min_depth + 2 if min_depth + 2 > max_depth
+
+stretch_depth = max_depth + 1
+stretch_tree = bottom_up_tree(0, stretch_depth)
+
+puts "stretch tree of depth #{stretch_depth}\t check: #{item_check(stretch_tree)}"
+stretch_tree = nil
+
+long_lived_tree = bottom_up_tree(0, max_depth)
+
+min_depth.step(max_depth + 1, 2) do |depth|
+ iterations = 2**(max_depth - depth + min_depth)
+
+ check = 0
+
+ for i in 1..iterations
+  temp_tree = bottom_up_tree(i, depth)
+  check += item_check(temp_tree)
+
+  temp_tree = bottom_up_tree(-i, depth)
+  check += item_check(temp_tree)
+ end
+
+ puts "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}"
+end
+
+puts "long lived tree of depth #{max_depth}\t check: #{item_check(long_lived_tree)}"
+
+undef puts
+alias puts puts_orig
diff --git a/benchmark/so_concatenate.rb b/benchmark/so_concatenate.rb
new file mode 100644
index 0000000000..4468e20ac8
--- /dev/null
+++ b/benchmark/so_concatenate.rb
@@ -0,0 +1,18 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: strcat-ruby.code,v 1.4 2004/11/13 07:43:28 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# based on code from Aristarkh A Zagorodnikov and Dat Nguyen
+
+STUFF = "hello\n"
+i = 0
+while i<10
+  i += 1
+  hello = ''
+  4_000_000.times do |e|
+    hello << STUFF
+  end
+end
+# puts hello.length
+
+
diff --git a/benchmark/so_count_words.yml b/benchmark/so_count_words.yml
new file mode 100644
index 0000000000..99683505f9
--- /dev/null
+++ b/benchmark/so_count_words.yml
@@ -0,0 +1,65 @@
+prelude: |
+  #!/usr/bin/ruby
+
+  wc_input_base = <<EOS
+  Subject:      Re: Who was Izchak Miller?
+  From:         "Jane D. Anonymous" <nobody@yale.edu>
+  Date:         1996/04/28
+  Message-Id:   <4lv7bc$oh@news.ycc.yale.edu>
+  References:   <317C405E.5DFA@panix.com> <4lk6vl$gde@ns.oar.net>
+  To:           75176.2330@compuserve.com
+  Content-Type: text/plain; charset=us-ascii
+  Organization: Yale University
+  X-Url:        news:4lk6vl$gde@ns.oar.net
+  Mime-Version: 1.0
+  Newsgroups:   rec.games.roguelike.nethack
+  X-Mailer:     Mozilla 1.1N (Macintosh; I; 68K)
+
+  Hello there, Izchak Miller was my father.  When I was younger I spent 
+  many a night, hunched over the keyboard with a cup of tea, playing 
+  nethack with him and my brother.  my dad was a philosopher with a strong 
+  weakness for fantasy/sci fi.  I remember when he started to get involved 
+  with the Nethack team- my brother's Dungeons and Dragons monster book 
+  found a regular place beside my dad's desk. it's nice to see him living 
+  on in the game he loved so much :-).  
+                                                                    Tamar Miller
+
+  The following is a really long word of 5000 characters:
+
+  wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww
+  EOS
+
+  # prepare 'wc.input'
+
+  def prepare_wc_input(wcbase)
+    wcinput = File.join(File.dirname($0), 'wc.input')
+    unless FileTest.exist?(wcinput)
+      data = wcbase.dup
+      13.times{
+        data << data
+      }
+      open(wcinput, 'w'){|f| f.write data}
+    end
+  end
+
+  prepare_wc_input(wc_input_base)
+
+benchmark:
+  so_count_words: |
+    # $Id: wc-ruby.code,v 1.4 2004/11/13 07:43:32 bfulgham Exp $
+    # http://www.bagley.org/~doug/shootout/
+    # with help from Paul Brannan
+    input = open(File.join(File.dirname($0), 'wc.input'), 'rb')
+
+    nl = nw = nc = 0
+    while true
+      tmp = input.read(4096) or break
+      data = tmp << (input.gets || "")
+      nc += data.length
+      nl += data.count("\n")
+      ((data.strip! || data).tr!("\n", " ") || data).squeeze!
+      nw += data.count(" ") + 1
+    end
+    # STDERR.puts "#{nl} #{nw} #{nc}"
+
+loop_count: 1
diff --git a/benchmark/so_exception.rb b/benchmark/so_exception.rb
new file mode 100644
index 0000000000..eb205b4df1
--- /dev/null
+++ b/benchmark/so_exception.rb
@@ -0,0 +1,61 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: except-ruby.code,v 1.4 2004/11/13 07:41:33 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+
+$HI = 0
+$LO = 0
+NUM = 250000 # Integer(ARGV[0] || 1)
+
+
+class Lo_Exception < Exception
+  def initialize(num)
+    @value = num
+  end
+end
+
+class Hi_Exception < Exception
+  def initialize(num)
+    @value = num
+  end
+end
+
+def some_function(num)
+  begin
+    hi_function(num)
+  rescue
+    print "We shouldn't get here, exception is: #{$!.type}\n"
+  end
+end
+
+def hi_function(num)
+  begin
+    lo_function(num)
+  rescue Hi_Exception
+    $HI = $HI + 1
+  end
+end
+
+def lo_function(num)
+  begin
+    blowup(num)
+  rescue Lo_Exception
+    $LO = $LO + 1
+  end
+end
+
+def blowup(num)
+  if num % 2 == 0
+    raise Lo_Exception.new(num)
+  else
+    raise Hi_Exception.new(num)
+  end
+end
+
+
+i = 1
+max = NUM+1
+while i < max
+  i += 1
+  some_function(i+1)
+end
diff --git a/benchmark/bm_so_fannkuch.rb b/benchmark/so_fannkuch.rb
index bac5ecd44c..bac5ecd44c 100644
--- a/benchmark/bm_so_fannkuch.rb
+++ b/benchmark/so_fannkuch.rb
diff --git a/benchmark/so_fasta.rb b/benchmark/so_fasta.rb
new file mode 100644
index 0000000000..dcc6b39507
--- /dev/null
+++ b/benchmark/so_fasta.rb
@@ -0,0 +1,81 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org/
+# Contributed by Sokolov Yura
+
+$last = 42.0
+def gen_random(max, im=139968, ia=3877, ic=29573)
+    (max * ($last = ($last * ia + ic) % im)) / im
+end
+
+alu =
+   "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
+   "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
+   "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
+   "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
+   "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
+   "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
+   "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
+
+iub = [
+    ["a", 0.27],
+    ["c", 0.12],
+    ["g", 0.12],
+    ["t", 0.27],
+
+    ["B", 0.02],
+    ["D", 0.02],
+    ["H", 0.02],
+    ["K", 0.02],
+    ["M", 0.02],
+    ["N", 0.02],
+    ["R", 0.02],
+    ["S", 0.02],
+    ["V", 0.02],
+    ["W", 0.02],
+    ["Y", 0.02],
+]
+homosapiens = [
+    ["a", 0.3029549426680],
+    ["c", 0.1979883004921],
+    ["g", 0.1975473066391],
+    ["t", 0.3015094502008],
+]
+
+def make_repeat_fasta(id, desc, src, n)
+    puts ">#{id} #{desc}"
+    v = nil
+    width = 60
+    l = src.length
+    s = src * ((n / l) + 1)
+    s.slice!(n, l)
+    puts(s.scan(/.{1,#{width}}/).join("\n"))
+end
+
+def make_random_fasta(id, desc, table, n)
+    puts ">#{id} #{desc}"
+    rand, v = nil,nil
+    width = 60
+    chunk = 1 * width
+    prob = 0.0
+    table.each{|v| v[1]= (prob += v[1])}
+    for i in 1..(n/width)
+        puts((1..width).collect{
+            rand = gen_random(1.0)
+            table.find{|v| v[1]>rand}[0]
+        }.join)
+    end
+    if n%width != 0
+        puts((1..(n%width)).collect{
+            rand = gen_random(1.0)
+            table.find{|v| v[1]>rand}[0]
+        }.join)
+    end
+end
+
+
+n = (ARGV[0] or 250_000).to_i
+
+make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
+make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
+make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
+
diff --git a/benchmark/so_k_nucleotide.yml b/benchmark/so_k_nucleotide.yml
new file mode 100644
index 0000000000..d7df086c39
--- /dev/null
+++ b/benchmark/so_k_nucleotide.yml
@@ -0,0 +1,155 @@
+prelude: |
+  bm_so_fasta = <<'EOS'
+  # The Computer Language Shootout
+  # http://shootout.alioth.debian.org/
+  # Contributed by Sokolov Yura
+
+  $last = 42.0
+  def gen_random(max, im=139968, ia=3877, ic=29573)
+      (max * ($last = ($last * ia + ic) % im)) / im
+  end
+
+  alu =
+     "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
+     "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
+     "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
+     "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
+     "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
+     "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
+     "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
+
+  iub = [
+      ["a", 0.27],
+      ["c", 0.12],
+      ["g", 0.12],
+      ["t", 0.27],
+
+      ["B", 0.02],
+      ["D", 0.02],
+      ["H", 0.02],
+      ["K", 0.02],
+      ["M", 0.02],
+      ["N", 0.02],
+      ["R", 0.02],
+      ["S", 0.02],
+      ["V", 0.02],
+      ["W", 0.02],
+      ["Y", 0.02],
+  ]
+  homosapiens = [
+      ["a", 0.3029549426680],
+      ["c", 0.1979883004921],
+      ["g", 0.1975473066391],
+      ["t", 0.3015094502008],
+  ]
+
+  def make_repeat_fasta(id, desc, src, n)
+      puts ">#{id} #{desc}"
+      v = nil
+      width = 60
+      l = src.length
+      s = src * ((n / l) + 1)
+      s.slice!(n, l)
+      puts(s.scan(/.{1,#{width}}/).join("\n"))
+  end
+
+  def make_random_fasta(id, desc, table, n)
+      puts ">#{id} #{desc}"
+      rand, v = nil,nil
+      width = 60
+      chunk = 1 * width
+      prob = 0.0
+      table.each{|v| v[1]= (prob += v[1])}
+      for i in 1..(n/width)
+          puts((1..width).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+      if n%width != 0
+          puts((1..(n%width)).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+  end
+
+
+  n = (ARGV[0] or 250_000).to_i
+
+  make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
+  make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
+  make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
+  EOS
+benchmark:
+  - name: so_k_nucleotide
+    prelude: |
+      script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+      File.write(script, bm_so_fasta)
+
+      def prepare_fasta_output n
+        filebase = File.join(File.dirname($0), 'fasta.output')
+        script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+        file = "#{filebase}.#{n}"
+
+        unless FileTest.exist?(file)
+          STDERR.puts "preparing #{file}"
+
+          open(file, 'w'){|f|
+            ARGV[0] = n
+            $stdout = f
+            load script
+            $stdout = STDOUT
+          }
+        end
+      end
+      prepare_fasta_output(100_000)
+    script: |
+      # The Computer Language Shootout
+      # http://shootout.alioth.debian.org
+      #
+      # contributed by jose fco. gonzalez
+      # modified by Sokolov Yura
+
+      seq = String.new
+
+      def frecuency( seq,length )
+          n, table = seq.length - length + 1, Hash.new(0)
+          f, i = nil, nil
+          (0 ... length).each do |f|
+              (f ... n).step(length) do |i|
+                  table[seq[i,length]] += 1
+              end
+          end
+          [n,table]
+
+      end
+
+      def sort_by_freq( seq,length )
+          n,table = frecuency( seq,length )
+          a, b, v = nil, nil, nil
+          table.sort{|a,b| b[1] <=> a[1]}.each do |v|
+              puts "%s %.3f" % [v[0].upcase,((v[1]*100).to_f/n)]
+          end
+          puts
+      end
+
+      def find_seq( seq,s )
+          n,table = frecuency( seq,s.length )
+          puts "#{table[s].to_s}\t#{s.upcase}"
+      end
+
+      input = open(File.join(File.dirname($0), 'fasta.output.100000'), 'rb')
+
+      line = input.gets while line !~ /^>THREE/
+      line = input.gets
+
+      while (line !~ /^>/) & line do
+          seq << line.chomp
+          line = input.gets
+      end
+
+      [1,2].each {|i| sort_by_freq( seq,i ) }
+
+      %w(ggt ggta ggtatt ggtattttaatt ggtattttaatttatagt).each{|s| find_seq( seq,s) }
+    loop_count: 1
diff --git a/benchmark/so_lists.rb b/benchmark/so_lists.rb
new file mode 100644
index 0000000000..e8f4a2a5f7
--- /dev/null
+++ b/benchmark/so_lists.rb
@@ -0,0 +1,47 @@
+#from http://www.bagley.org/~doug/shootout/bench/lists/lists.ruby
+
+NUM = 300
+SIZE = 10000
+
+def test_lists()
+  # create a list of integers (Li1) from 1 to SIZE
+  li1 = (1..SIZE).to_a
+  # copy the list to li2 (not by individual items)
+  li2 = li1.dup
+  # remove each individual item from left side of li2 and
+  # append to right side of li3 (preserving order)
+  li3 = Array.new
+  while (not li2.empty?)
+    li3.push(li2.shift)
+  end
+  # li2 must now be empty
+  # remove each individual item from right side of li3 and
+  # append to right side of li2 (reversing list)
+  while (not li3.empty?)
+    li2.push(li3.pop)
+  end
+  # li3 must now be empty
+  # reverse li1 in place
+  li1.reverse!
+  # check that first item is now SIZE
+  if li1[0] != SIZE then
+    p "not SIZE"
+    0
+  else
+    # compare li1 and li2 for equality
+    if li1 != li2 then
+      return(0)
+    else
+      # return the length of the list
+      li1.length
+    end
+  end
+end
+
+i = 0
+while i<NUM
+  i += 1
+  result = test_lists()
+end
+
+result
diff --git a/benchmark/bm_so_mandelbrot.rb b/benchmark/so_mandelbrot.rb
index 76331c64b8..76331c64b8 100644
--- a/benchmark/bm_so_mandelbrot.rb
+++ b/benchmark/so_mandelbrot.rb
diff --git a/benchmark/so_matrix.rb b/benchmark/so_matrix.rb
new file mode 100644
index 0000000000..2d1e72bda9
--- /dev/null
+++ b/benchmark/so_matrix.rb
@@ -0,0 +1,48 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: matrix-ruby.code,v 1.4 2004/11/13 07:42:14 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+
+n = 60 #Integer(ARGV.shift || 1)
+
+size = 40
+
+def mkmatrix(rows, cols)
+    count = 1
+    mx = Array.new(rows)
+    (0 .. (rows - 1)).each do |bi|
+        row = Array.new(cols, 0)
+        (0 .. (cols - 1)).each do |j|
+            row[j] = count
+            count += 1
+        end
+        mx[bi] = row
+    end
+    mx
+end
+
+def mmult(rows, cols, m1, m2)
+    m3 = Array.new(rows)
+    (0 .. (rows - 1)).each do |bi|
+        row = Array.new(cols, 0)
+        (0 .. (cols - 1)).each do |j|
+            val = 0
+            (0 .. (cols - 1)).each do |k|
+                val += m1.at(bi).at(k) * m2.at(k).at(j)
+            end
+            row[j] = val
+        end
+        m3[bi] = row
+    end
+    m3
+end
+
+m1 = mkmatrix(size, size)
+m2 = mkmatrix(size, size)
+mm = Array.new
+n.times do
+    mm = mmult(size, size, m1, m2)
+end
+# puts "#{mm[0][0]} #{mm[2][3]} #{mm[3][2]} #{mm[4][4]}"
+
+
diff --git a/benchmark/so_meteor_contest.rb b/benchmark/so_meteor_contest.rb
new file mode 100644
index 0000000000..8c136baa6c
--- /dev/null
+++ b/benchmark/so_meteor_contest.rb
@@ -0,0 +1,563 @@
+#!/usr/bin/env ruby
+#
+# The Computer Language Shootout
+#   http://shootout.alioth.debian.org
+#   contributed by Kevin Barnes (Ruby novice)
+
+# PROGRAM:  the main body is at the bottom.
+#   1) read about the problem here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
+#   2) see how I represent a board as a bitmask by reading the blank_board comments
+#   3) read as your mental paths take you
+
+def print *args
+end
+
+# class to represent all information about a particular rotation of a particular piece
+class Rotation
+  # an array (by location) containing a bit mask for how the piece maps at the given location.
+  # if the rotation is invalid at that location the mask will contain false
+  attr_reader :start_masks
+
+  # maps a direction to a relative location.  these differ depending on whether it is an even or
+  # odd row being mapped from
+  @@rotation_even_adder = { :west => -1, :east => 1, :nw => -7, :ne => -6, :sw => 5, :se => 6 }
+  @@rotation_odd_adder = { :west => -1, :east => 1, :nw => -6, :ne => -5, :sw => 6, :se => 7 }
+
+  def initialize( directions )
+    @even_offsets, @odd_offsets = normalize_offsets( get_values( directions ))
+
+    @even_mask = mask_for_offsets( @even_offsets)
+    @odd_mask = mask_for_offsets( @odd_offsets)
+
+    @start_masks = Array.new(60)
+
+    # create the rotational masks by placing the base mask at the location and seeing if
+    # 1) it overlaps the boundaries and 2) it produces a prunable board.  if either of these
+    # is true the piece cannot be placed
+    0.upto(59) do | offset |
+      mask = is_even(offset) ? (@even_mask << offset) : (@odd_mask << offset)
+      if (blank_board & mask == 0 && !prunable(blank_board | mask, 0, true)) then
+        imask = compute_required( mask, offset)
+        @start_masks[offset] = [ mask, imask, imask | mask ]
+      else
+        @start_masks[offset] = false
+      end
+    end
+  end
+
+  def compute_required( mask, offset )
+    board = blank_board
+    0.upto(offset) { | i | board |= 1 << i }
+    board |= mask
+    return 0 if (!prunable(board | mask, offset))
+    board = flood_fill(board,58)
+    count = 0
+    imask = 0
+    0.upto(59) do | i |
+      if (board[i] == 0) then
+        imask |= (1 << i)
+        count += 1
+      end
+    end
+    (count > 0 && count < 5) ? imask : 0
+  end
+
+  def flood_fill( board, location)
+    return board if (board[location] == 1)
+    board |= 1 << location
+    row, col = location.divmod(6)
+    board = flood_fill( board, location - 1) if (col > 0)
+    board = flood_fill( board, location + 1) if (col < 4)
+    if (row % 2 == 0) then
+      board = flood_fill( board, location - 7) if (col > 0 && row > 0)
+      board = flood_fill( board, location - 6) if (row > 0)
+      board = flood_fill( board, location + 6) if (row < 9)
+      board = flood_fill( board, location + 5) if (col > 0 && row < 9)
+    else
+      board = flood_fill( board, location - 5) if (col < 4 && row > 0)
+      board = flood_fill( board, location - 6) if (row > 0)
+      board = flood_fill( board, location + 6) if (row < 9)
+      board = flood_fill( board, location + 7) if (col < 4 && row < 9)
+    end
+    board
+  end
+
+  # given a location, produces a list of relative locations covered by the piece at this rotation
+  def offsets( location)
+    if is_even( location) then
+      @even_offsets.collect { | value | value + location }
+    else
+      @odd_offsets.collect { | value | value + location }
+    end
+  end
+
+  # returns a set of offsets relative to the top-left most piece of the rotation (by even or odd rows)
+  # this is hard to explain. imagine we have this partial board:
+  #   0 0 0 0 0 x        [positions 0-5]
+  #    0 0 1 1 0 x       [positions 6-11]
+  #   0 0 1 0 0 x        [positions 12-17]
+  #    0 1 0 0 0 x       [positions 18-23]
+  #   0 1 0 0 0 x        [positions 24-29]
+  #    0 0 0 0 0 x       [positions 30-35]
+  #       ...
+  # The top-left of the piece is at position 8, the
+  # board would be passed as a set of positions (values array) containing [8,9,14,19,25] not necessarily in that
+  # sorted order.  Since that array starts on an odd row, the offsets for an odd row are: [0,1,6,11,17] obtained
+  # by subtracting 8 from everything.  Now imagine the piece shifted up and to the right so it's on an even row:
+  #   0 0 0 1 1 x        [positions 0-5]
+  #    0 0 1 0 0 x       [positions 6-11]
+  #   0 0 1 0 0 x        [positions 12-17]
+  #    0 1 0 0 0 x       [positions 18-23]
+  #   0 0 0 0 0 x        [positions 24-29]
+  #    0 0 0 0 0 x       [positions 30-35]
+  #       ...
+  # Now the positions are [3,4,8,14,19] which after subtracting the lowest value (3) gives [0,1,5,11,16] thus, the
+  # offsets for this particular piece are (in even, odd order) [0,1,5,11,16],[0,1,6,11,17] which is what
+  # this function would return
+  def normalize_offsets( values)
+    min = values.min
+    even_min = is_even(min)
+    other_min = even_min ? min + 6 : min + 7
+    other_values = values.collect do | value |
+      if is_even(value) then
+        value + 6 - other_min
+      else
+        value + 7 - other_min
+      end
+    end
+    values.collect! { | value | value - min }
+
+    if even_min then
+      [values, other_values]
+    else
+      [other_values, values]
+    end
+  end
+
+  # produce a bitmask representation of an array of offset locations
+  def mask_for_offsets( offsets )
+    mask = 0
+    offsets.each { | value | mask = mask + ( 1 << value ) }
+    mask
+  end
+
+  # finds a "safe" position that a position as described by a list of directions can be placed
+  # without falling off any edge of the board.  the values returned a location to place the first piece
+  # at so it will fit after making the described moves
+  def start_adjust( directions )
+    south = east = 0;
+    directions.each do | direction |
+      east += 1 if ( direction == :sw || direction == :nw || direction == :west )
+      south += 1 if ( direction == :nw || direction == :ne )
+    end
+    south * 6 + east
+  end
+
+  # given a set of directions places the piece (as defined by a set of directions) on the board at
+  # a location that will not take it off the edge
+  def get_values( directions )
+    start = start_adjust(directions)
+    values = [ start ]
+    directions.each do | direction |
+      if (start % 12 >= 6) then
+        start += @@rotation_odd_adder[direction]
+      else
+        start += @@rotation_even_adder[direction]
+      end
+      values += [ start ]
+    end
+
+    # some moves take you back to an existing location, we'll strip duplicates
+    values.uniq
+  end
+end
+
+# describes a piece and caches information about its rotations to as to be efficient for iteration
+# ATTRIBUTES:
+#   rotations -- all the rotations of the piece
+#   type -- a numeic "name" of the piece
+#   masks -- an array by location of all legal rotational masks (a n inner array) for that location
+#   placed -- the mask that this piece was last placed at (not a location, but the actual mask used)
+class Piece
+  attr_reader :rotations, :type, :masks
+  attr_accessor :placed
+
+  # transform hashes that change one direction into another when you either flip or rotate a set of directions
+  @@flip_converter = { :west => :west, :east => :east, :nw => :sw, :ne => :se, :sw => :nw, :se => :ne }
+  @@rotate_converter = { :west => :nw, :east => :se, :nw => :ne, :ne => :east, :sw => :west, :se => :sw }
+
+  def initialize( directions, type )
+    @type = type
+    @rotations = Array.new();
+    @map = {}
+
+    generate_rotations( directions )
+    directions.collect! { | value | @@flip_converter[value] }
+    generate_rotations( directions )
+
+    # creates the masks AND a map that returns [location, rotation] for any given mask
+    # this is used when a board is found and we want to draw it, otherwise the map is unused
+    @masks = Array.new();
+    0.upto(59) do | i |
+      even = true
+      @masks[i] = @rotations.collect do | rotation |
+        mask = rotation.start_masks[i]
+        @map[mask[0]] = [ i, rotation ] if (mask)
+        mask || nil
+      end
+      @masks[i].compact!
+    end
+  end
+
+  # rotates a set of directions through all six angles and adds a Rotation to the list for each one
+  def generate_rotations( directions )
+    6.times do
+      rotations.push( Rotation.new(directions))
+      directions.collect! { | value | @@rotate_converter[value] }
+    end
+  end
+
+  # given a board string, adds this piece to the board at whatever location/rotation
+  # important: the outbound board string is 5 wide, the normal location notation is six wide (padded)
+  def fill_string( board_string)
+    location, rotation = @map[@placed]
+    rotation.offsets(location).each do | offset |
+      row, col = offset.divmod(6)
+      board_string[ row*5 + col, 1 ] = @type.to_s
+    end
+  end
+end
+
+# a blank bit board having this form:
+#
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    0 0 0 0 0 1
+#     0 0 0 0 0 1
+#    1 1 1 1 1 1
+#
+# where left lest significant bit is the top left and the most significant is the lower right
+# the actual board only consists of the 0 places, the 1 places are blockers to keep things from running
+# off the edges or bottom
+def blank_board
+  0b111111100000100000100000100000100000100000100000100000100000100000
+end
+
+def full_board
+  0b111111111111111111111111111111111111111111111111111111111111111111
+end
+
+# determines if a location (bit position) is in an even row
+def is_even( location)
+  (location % 12) < 6
+end
+
+# support function that create three utility maps:
+#  $converter -- for each row an array that maps a five bit row (via array mapping)
+#                to the a five bit representation of the bits below it
+#  $bit_count -- maps a five bit row (via array mapping) to the number of 1s in the row
+#  @@new_regions -- maps a five bit row (via array mapping) to an array of "region" arrays
+#                   a region array has three values the first is a mask of bits in the region,
+#                   the second is the count of those bits and the third is identical to the first
+#                   examples:
+#                           0b10010 => [ 0b01100, 2, 0b01100 ], [ 0b00001, 1, 0b00001]
+#                           0b01010 => [ 0b10000, 1, 0b10000 ], [ 0b00100, 1, 0b00100 ], [ 0b00001, 1, 0b00001]
+#                           0b10001 => [ 0b01110, 3, 0b01110 ]
+def create_collector_support
+  odd_map = [0b11, 0b110, 0b1100, 0b11000, 0b10000]
+  even_map = [0b1, 0b11, 0b110, 0b1100, 0b11000]
+
+  all_odds = Array.new(0b100000)
+  all_evens = Array.new(0b100000)
+  bit_counts = Array.new(0b100000)
+  new_regions = Array.new(0b100000)
+  0.upto(0b11111) do | i |
+    bit_count = odd = even = 0
+    0.upto(4) do | bit |
+      if (i[bit] == 1) then
+        bit_count += 1
+        odd |= odd_map[bit]
+        even |= even_map[bit]
+      end
+    end
+    all_odds[i] = odd
+    all_evens[i] = even
+    bit_counts[i] = bit_count
+    new_regions[i] = create_regions( i)
+  end
+
+  $converter = []
+  10.times { | row | $converter.push((row % 2 == 0) ? all_evens : all_odds) }
+  $bit_counts = bit_counts
+  $regions = new_regions.collect { | set | set.collect { | value | [ value, bit_counts[value], value] } }
+end
+
+# determines if a board is punable, meaning that there is no possibility that it
+# can be filled up with pieces.  A board is prunable if there is a grouping of unfilled spaces
+# that are not a multiple of five.  The following board is an example of a prunable board:
+#    0 0 1 0 0
+#     0 1 0 0 0
+#    1 1 0 0 0
+#     0 1 0 0 0
+#    0 0 0 0 0
+#       ...
+#
+# This board is prunable because the top left corner is only 3 bits in area, no piece will ever fit it
+# parameters:
+#   board -- an initial bit board (6 bit padded rows, see blank_board for format)
+#   location -- starting location, everything above and to the left is already full
+#   slotting -- set to true only when testing initial pieces, when filling normally
+#               additional assumptions are possible
+#
+# Algorithm:
+#    The algorithm starts at the top row (as determined by location) and iterates a row at a time
+#    maintainng counts of active open areas (kept in the collector array) each collector contains
+#    three values at the start of an iteration:
+#          0: mask of bits that would be adjacent to the collector in this row
+#          1: the number of bits collected so far
+#          2: a scratch space starting as zero, but used during the computation to represent
+#             the empty bits in the new row that are adjacent (position 0)
+#  The exact procedure is described in-code
+def prunable( board, location, slotting = false)
+  collectors = []
+  # loop across the rows
+  (location / 6).to_i.upto(9) do | row_on |
+    # obtain a set of regions representing the bits of the current row.
+    regions = $regions[(board >> (row_on * 6)) & 0b11111]
+    converter = $converter[row_on]
+
+    # track the number of collectors at the start of the cycle so that
+    # we don't compute against newly created collectors, only existing collectors
+    initial_collector_count = collectors.length
+
+    # loop against the regions.  For each region of the row
+    # we will see if it connects to one or more existing collectors.
+    # if it connects to 1 collector, the bits from the region are added to the
+    # bits of the collector and the mask is placed in collector[2]
+    # If the region overlaps more than one collector then all the collectors
+    # it overlaps with are merged into the first one (the others are set to nil in the array)
+    # if NO collectors are found then the region is copied as a new collector
+    regions.each do | region |
+      collector_found = nil
+      region_mask = region[2]
+      initial_collector_count.times do | collector_num |
+        collector = collectors[collector_num]
+        if (collector) then
+          collector_mask = collector[0]
+          if (collector_mask & region_mask != 0) then
+            if (collector_found) then
+              collector_found[0] |= collector_mask
+              collector_found[1] += collector[1]
+              collector_found[2] |= collector[2]
+              collectors[collector_num] = nil
+            else
+              collector_found = collector
+              collector[1] += region[1]
+              collector[2] |= region_mask
+            end
+          end
+        end
+      end
+      if (collector_found == nil) then
+        collectors.push(Array.new(region))
+      end
+    end
+
+    # check the existing collectors, if any collector overlapped no bits in the region its [2] value will
+    # be zero.  The size of any such reaason is tested if it is not a multiple of five true is returned since
+    # the board is prunable.  if it is a multiple of five it is removed.
+    # Collector that are still active have a new adjacent value [0] set based n the matched bits
+    # and have [2] cleared out for the next cycle.
+    collectors.length.times do | collector_num |
+      collector = collectors[collector_num]
+      if (collector) then
+        if (collector[2] == 0) then
+          return true if (collector[1] % 5 != 0)
+          collectors[collector_num] = nil
+        else
+          # if a collector matches all bits in the row then we can return unprunable early for the
+          # following reasons:
+          #    1) there can be no more unavailable bits bince we fill from the top left downward
+          #    2) all previous regions have been closed or joined so only this region can fail
+          #    3) this region must be good since there can never be only 1 region that is nuot
+          #       a multiple of five
+          # this rule only applies when filling normally, so we ignore the rule if we are "slotting"
+          # in pieces to see what configurations work for them (the only other time this algorithm is used).
+          return false if (collector[2] == 0b11111 && !slotting)
+          collector[0] = converter[collector[2]]
+          collector[2] = 0
+        end
+      end
+    end
+
+    # get rid of all the empty converters for the next round
+    collectors.compact!
+  end
+  return false if (collectors.length <= 1) # 1 collector or less and the region is fine
+  collectors.any? { | collector | (collector[1] % 5) != 0 } # more than 1 and we test them all for bad size
+end
+
+# creates a region given a row mask.  see prunable for what a "region" is
+def create_regions( value )
+  regions = []
+  cur_region = 0
+  5.times do | bit |
+    if (value[bit] == 0) then
+      cur_region |= 1 << bit
+    else
+      if (cur_region != 0 ) then
+        regions.push( cur_region)
+        cur_region = 0;
+      end
+    end
+  end
+  regions.push(cur_region) if (cur_region != 0)
+  regions
+end
+
+# find up to the counted number of solutions (or all solutions) and prints the final result
+def find_all
+  find_top( 1)
+  find_top( 0)
+  print_results
+end
+
+# show the board
+def print_results
+  print "#{@boards_found} solutions found\n\n"
+  print_full_board( @min_board)
+  print "\n"
+  print_full_board( @max_board)
+  print "\n"
+end
+
+# finds solutions.  This special version of the main function is only used for the top level
+# the reason for it is basically to force a particular ordering on how the rotations are tested for
+# the first piece.  It is called twice, first looking for placements of the odd rotations and then
+# looking for placements of the even locations.
+#
+# WHY?
+#   Since any found solution has an inverse we want to maximize finding solutions that are not already found
+#   as an inverse.  The inverse will ALWAYS be 3 one of the piece configurations that is exactly 3 rotations away
+#   (an odd number).  Checking even vs odd then produces a higher probability of finding more pieces earlier
+#   in the cycle.  We still need to keep checking all the permutations, but our probability of finding one will
+#   diminsh over time.  Since we are TOLD how many to search for this lets us exit before checking all pieces
+#   this bennifit is very great when seeking small numbers of solutions and is 0 when looking for more than the
+#   maximum number
+def find_top( rotation_skip)
+  board = blank_board
+  (@pieces.length-1).times do
+    piece = @pieces.shift
+    piece.masks[0].each do | mask, imask, cmask |
+      if ((rotation_skip += 1) % 2 == 0) then
+        piece.placed = mask
+        find( 1, 1, board | mask)
+      end
+    end
+    @pieces.push(piece)
+  end
+  piece = @pieces.shift
+  @pieces.push(piece)
+end
+
+# the normail find routine, iterates through the available pieces, checks all rotations at the current location
+# and adds any boards found.  depth is achieved via recursion.  the overall approach is described
+# here: http://www-128.ibm.com/developerworks/java/library/j-javaopt/
+# parameters:
+#  start_location -- where to start looking for place for the next piece at
+#  placed -- number of pieces placed
+#  board -- current state of the board
+#
+# see in-code comments
+def find( start_location, placed, board)
+  # find the next location to place a piece by looking for an empty bit
+  while board[start_location] == 1
+    start_location += 1
+  end
+
+  @pieces.length.times do
+    piece = @pieces.shift
+    piece.masks[start_location].each do | mask, imask, cmask |
+      if ( board & cmask == imask) then
+        piece.placed = mask
+        if (placed == 9) then
+          add_board
+        else
+          find( start_location + 1, placed + 1, board | mask)
+        end
+      end
+    end
+    @pieces.push(piece)
+  end
+end
+
+# print the board
+def print_full_board( board_string)
+  10.times do | row |
+    print " " if (row % 2 == 1)
+    5.times do | col |
+      print "#{board_string[row*5 + col,1]} "
+    end
+    print "\n"
+  end
+end
+
+# when a board is found we "draw it" into a string and then flip that string, adding both to
+# the list (hash) of solutions if they are unique.
+def add_board
+  board_string = "99999999999999999999999999999999999999999999999999"
+  @all_pieces.each {  | piece | piece.fill_string( board_string ) }
+  save( board_string)
+  save( board_string.reverse)
+end
+
+# adds a board string to the list (if new) and updates the current best/worst board
+def save( board_string)
+  if (@all_boards[board_string] == nil) then
+    @min_board = board_string if (board_string < @min_board)
+    @max_board = board_string if (board_string > @max_board)
+    @all_boards.store(board_string,true)
+    @boards_found += 1
+
+    # the exit motif is a time saver.  Ideally the function should return, but those tests
+    # take noticeable time (performance).
+    if (@boards_found == @stop_count) then
+      print_results
+      exit(0)
+    end
+  end
+end
+
+
+##
+## MAIN BODY :)
+##
+create_collector_support
+@pieces = [
+  Piece.new( [ :nw, :ne, :east, :east ], 2),
+  Piece.new( [ :ne, :se, :east, :ne ], 7),
+  Piece.new( [ :ne, :east, :ne, :nw ], 1),
+  Piece.new( [ :east, :sw, :sw, :se ], 6),
+  Piece.new( [ :east, :ne, :se, :ne ], 5),
+  Piece.new( [ :east, :east, :east, :se ], 0),
+  Piece.new( [ :ne, :nw, :se, :east, :se ], 4),
+  Piece.new( [ :se, :se, :se, :west ], 9),
+  Piece.new( [ :se, :se, :east, :se ], 8),
+  Piece.new( [ :east, :east, :sw, :se ], 3)
+  ];
+
+@all_pieces = Array.new( @pieces)
+
+@min_board = "99999999999999999999999999999999999999999999999999"
+@max_board = "00000000000000000000000000000000000000000000000000"
+@stop_count = ARGV[0].to_i || 2089
+@all_boards = {}
+@boards_found = 0
+
+find_all ######## DO IT!!!
diff --git a/benchmark/so_nbody.rb b/benchmark/so_nbody.rb
new file mode 100644
index 0000000000..9884fc4edc
--- /dev/null
+++ b/benchmark/so_nbody.rb
@@ -0,0 +1,148 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org
+#
+# Optimized for Ruby by Jesse Millikan
+# From version ported by Michael Neumann from the C gcc version,
+# which was written by Christoph Bauer.
+
+SOLAR_MASS = 4 * Math::PI**2
+DAYS_PER_YEAR = 365.24
+
+def _puts *args
+end
+
+class Planet
+  attr_accessor :x, :y, :z, :vx, :vy, :vz, :mass
+
+  def initialize(x, y, z, vx, vy, vz, mass)
+    @x, @y, @z = x, y, z
+    @vx, @vy, @vz = vx * DAYS_PER_YEAR, vy * DAYS_PER_YEAR, vz * DAYS_PER_YEAR
+    @mass = mass * SOLAR_MASS
+  end
+
+  def move_from_i(bodies, nbodies, dt, i)
+    while i < nbodies
+      b2 = bodies[i]
+      dx = @x - b2.x
+      dy = @y - b2.y
+      dz = @z - b2.z
+
+      distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
+      mag = dt / (distance * distance * distance)
+      b_mass_mag, b2_mass_mag = @mass * mag, b2.mass * mag
+
+      @vx -= dx * b2_mass_mag
+      @vy -= dy * b2_mass_mag
+      @vz -= dz * b2_mass_mag
+      b2.vx += dx * b_mass_mag
+      b2.vy += dy * b_mass_mag
+      b2.vz += dz * b_mass_mag
+      i += 1
+    end
+
+    @x += dt * @vx
+    @y += dt * @vy
+    @z += dt * @vz
+  end
+end
+
+def energy(bodies)
+  e = 0.0
+  nbodies = bodies.size
+
+  for i in 0 ... nbodies
+    b = bodies[i]
+    e += 0.5 * b.mass * (b.vx * b.vx + b.vy * b.vy + b.vz * b.vz)
+    for j in (i + 1) ... nbodies
+      b2 = bodies[j]
+      dx = b.x - b2.x
+      dy = b.y - b2.y
+      dz = b.z - b2.z
+      distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
+      e -= (b.mass * b2.mass) / distance
+    end
+  end
+  e
+end
+
+def offset_momentum(bodies)
+  px, py, pz = 0.0, 0.0, 0.0
+
+  for b in bodies
+    m = b.mass
+    px += b.vx * m
+    py += b.vy * m
+    pz += b.vz * m
+  end
+
+  b = bodies[0]
+  b.vx = - px / SOLAR_MASS
+  b.vy = - py / SOLAR_MASS
+  b.vz = - pz / SOLAR_MASS
+end
+
+BODIES = [
+  # sun
+  Planet.new(0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0),
+
+  # jupiter
+  Planet.new(
+    4.84143144246472090e+00,
+    -1.16032004402742839e+00,
+    -1.03622044471123109e-01,
+    1.66007664274403694e-03,
+    7.69901118419740425e-03,
+    -6.90460016972063023e-05,
+    9.54791938424326609e-04),
+
+  # saturn
+  Planet.new(
+    8.34336671824457987e+00,
+    4.12479856412430479e+00,
+    -4.03523417114321381e-01,
+    -2.76742510726862411e-03,
+    4.99852801234917238e-03,
+    2.30417297573763929e-05,
+    2.85885980666130812e-04),
+
+  # uranus
+  Planet.new(
+    1.28943695621391310e+01,
+    -1.51111514016986312e+01,
+    -2.23307578892655734e-01,
+    2.96460137564761618e-03,
+    2.37847173959480950e-03,
+    -2.96589568540237556e-05,
+    4.36624404335156298e-05),
+
+  # neptune
+  Planet.new(
+    1.53796971148509165e+01,
+    -2.59193146099879641e+01,
+    1.79258772950371181e-01,
+    2.68067772490389322e-03,
+    1.62824170038242295e-03,
+    -9.51592254519715870e-05,
+    5.15138902046611451e-05)
+]
+
+init = 200_000 # ARGV[0]
+n = Integer(init)
+
+offset_momentum(BODIES)
+
+puts "%.9f" % energy(BODIES)
+
+nbodies = BODIES.size
+dt = 0.01
+
+n.times do
+  i = 0
+  while i < nbodies
+    b = BODIES[i]
+    b.move_from_i(BODIES, nbodies, dt, i + 1)
+    i += 1
+  end
+end
+
+puts "%.9f" % energy(BODIES)
diff --git a/benchmark/so_nested_loop.rb b/benchmark/so_nested_loop.rb
new file mode 100644
index 0000000000..766fcf7b84
--- /dev/null
+++ b/benchmark/so_nested_loop.rb
@@ -0,0 +1,24 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: nestedloop-ruby.code,v 1.4 2004/11/13 07:42:22 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# from Avi Bryant
+
+n = 16 # Integer(ARGV.shift || 1)
+x = 0
+n.times do
+    n.times do
+        n.times do
+            n.times do
+                n.times do
+                    n.times do
+                        x += 1
+                    end
+                end
+            end
+        end
+    end
+end
+# puts x
+
+
diff --git a/benchmark/bm_so_nsieve.rb b/benchmark/so_nsieve.rb
index a65cc78233..a65cc78233 100644
--- a/benchmark/bm_so_nsieve.rb
+++ b/benchmark/so_nsieve.rb
diff --git a/benchmark/so_nsieve_bits.rb b/benchmark/so_nsieve_bits.rb
new file mode 100644
index 0000000000..6f958ee44e
--- /dev/null
+++ b/benchmark/so_nsieve_bits.rb
@@ -0,0 +1,43 @@
+#!/usr/bin/ruby
+#coding: us-ascii
+#
+# The Great Computer Language Shootout
+# http://shootout.alioth.debian.org/
+#
+# nsieve-bits in Ruby
+# Contributed by Glenn Parker, March 2005
+
+CharExponent = 3
+BitsPerChar = 1 << CharExponent
+LowMask = BitsPerChar - 1
+
+def sieve(m)
+  items = "\xFF" * ((m / BitsPerChar) + 1)
+  masks = ""
+  BitsPerChar.times do |b|
+    masks << (1 << b).chr
+  end
+
+  count = 0
+  pmax = m - 1
+  2.step(pmax, 1) do |p|
+    if items[p >> CharExponent][p & LowMask] == 1
+      count += 1
+      p.step(pmax, p) do |mult|
+	a = mult >> CharExponent
+	b = mult & LowMask
+	items[a] -= masks[b] if items[a][b] != 0
+      end
+    end
+  end
+  count
+end
+
+n = 9 # (ARGV[0] || 2).to_i
+n.step(n - 2, -1) do |exponent|
+  break if exponent < 0
+  m = 2 ** exponent * 10_000
+  count = sieve(m)
+  printf "Primes up to %8d %8d\n", m, count
+end
+
diff --git a/benchmark/so_object.rb b/benchmark/so_object.rb
new file mode 100644
index 0000000000..131f44624c
--- /dev/null
+++ b/benchmark/so_object.rb
@@ -0,0 +1,56 @@
+#!/usr/bin/ruby
+# -*- Ruby -*-
+# $Id: objinst-ruby.code,v 1.4 2004/11/13 07:42:25 bfulgham Exp $
+# http://www.bagley.org/~doug/shootout/
+# with help from Aristarkh Zagorodnikov
+
+class Toggle
+    def initialize(start_state)
+        @bool = start_state
+    end
+
+    def value
+        @bool
+    end
+
+    def activate
+        @bool = !@bool
+        self
+    end
+end
+
+class NthToggle < Toggle
+    def initialize(start_state, max_counter)
+        super start_state
+        @count_max = max_counter
+        @counter = 0
+    end
+
+    def activate
+        @counter += 1
+        if @counter >= @count_max
+            @bool = !@bool
+            @counter = 0
+        end
+        self
+    end
+end
+
+n = 1500000 # (ARGV.shift || 1).to_i
+
+toggle = Toggle.new 1
+5.times do
+    toggle.activate.value ? 'true' : 'false'
+end
+n.times do
+    toggle = Toggle.new 1
+end
+
+ntoggle = NthToggle.new 1, 3
+8.times do
+    ntoggle.activate.value ? 'true' : 'false'
+end
+n.times do
+    ntoggle = NthToggle.new 1, 3
+end
+
diff --git a/benchmark/bm_so_partial_sums.rb b/benchmark/so_partial_sums.rb
index 630b45cb8d..630b45cb8d 100644
--- a/benchmark/bm_so_partial_sums.rb
+++ b/benchmark/so_partial_sums.rb
diff --git a/benchmark/so_pidigits.rb b/benchmark/so_pidigits.rb
new file mode 100644
index 0000000000..9a537b2d1c
--- /dev/null
+++ b/benchmark/so_pidigits.rb
@@ -0,0 +1,92 @@
+# The Great Computer Language Shootout
+# http://shootout.alioth.debian.org/
+#
+# contributed by Gabriele Renzi
+
+class PiDigitSpigot
+
+    def initialize()
+        @z = Transformation.new 1,0,0,1
+        @x = Transformation.new 0,0,0,0
+        @inverse = Transformation.new 0,0,0,0
+    end
+
+    def next!
+        @y = @z.extract(3)
+        if safe? @y
+            @z = produce(@y)
+            @y
+        else
+            @z = consume @x.next!()
+            next!()
+        end
+    end
+
+    def safe?(digit)
+        digit == @z.extract(4)
+    end
+
+    def produce(i)
+        @inverse.qrst(10,-10*i,0,1).compose(@z)
+    end
+
+    def consume(a)
+        @z.compose(a)
+    end
+end
+
+
+class Transformation
+    attr_reader :q, :r, :s, :t
+    def initialize(q, r, s, t)
+        @q,@r,@s,@t,@k = q,r,s,t,0
+    end
+
+    def next!()
+        @q = @k = @k + 1
+        @r = 4 * @k + 2
+        @s = 0
+        @t = 2 * @k + 1
+        self
+    end
+
+    def extract(j)
+        (@q * j + @r) / (@s * j + @t)
+    end
+
+    def compose(a)
+        self.class.new( @q * a.q,
+                        @q * a.r + r * a.t,
+                        @s * a.q + t * a.s,
+                        @s * a.r + t * a.t
+                    )
+    end
+
+    def qrst *args
+        initialize *args
+        self
+    end
+
+
+end
+
+
+WIDTH = 10
+n = 2_500 # Integer(ARGV[0])
+j = 0
+
+digits = PiDigitSpigot.new
+
+while n > 0
+    if n >= WIDTH
+        WIDTH.times {print digits.next!}
+        j += WIDTH
+    else
+        n.times {print digits.next!}
+        (WIDTH-n).times {print " "}
+        j += n
+    end
+    puts "\t:"+j.to_s
+    n -= WIDTH
+end
+
diff --git a/benchmark/so_random.rb b/benchmark/so_random.rb
new file mode 100644
index 0000000000..a66b9e8e63
--- /dev/null
+++ b/benchmark/so_random.rb
@@ -0,0 +1,20 @@
+# from http://www.bagley.org/~doug/shootout/bench/random/random.ruby
+
+IM = 139968.0
+IA = 3877.0
+IC = 29573.0
+
+$last = 42.0
+
+def gen_random(max)
+  (max * ($last = ($last * IA + IC) % IM)) / IM
+end
+
+N = 3_000_000
+
+i = 0
+while i<N
+  i +=1
+  gen_random(100.0)
+end
+# "%.9f" % gen_random(100.0)
diff --git a/benchmark/so_reverse_complement.yml b/benchmark/so_reverse_complement.yml
new file mode 100644
index 0000000000..de05eedfc4
--- /dev/null
+++ b/benchmark/so_reverse_complement.yml
@@ -0,0 +1,137 @@
+prelude: |
+  bm_so_fasta = <<'EOS'
+  # The Computer Language Shootout
+  # http://shootout.alioth.debian.org/
+  # Contributed by Sokolov Yura
+
+  $last = 42.0
+  def gen_random(max, im=139968, ia=3877, ic=29573)
+      (max * ($last = ($last * ia + ic) % im)) / im
+  end
+
+  alu =
+     "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
+     "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
+     "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
+     "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
+     "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
+     "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
+     "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
+
+  iub = [
+      ["a", 0.27],
+      ["c", 0.12],
+      ["g", 0.12],
+      ["t", 0.27],
+
+      ["B", 0.02],
+      ["D", 0.02],
+      ["H", 0.02],
+      ["K", 0.02],
+      ["M", 0.02],
+      ["N", 0.02],
+      ["R", 0.02],
+      ["S", 0.02],
+      ["V", 0.02],
+      ["W", 0.02],
+      ["Y", 0.02],
+  ]
+  homosapiens = [
+      ["a", 0.3029549426680],
+      ["c", 0.1979883004921],
+      ["g", 0.1975473066391],
+      ["t", 0.3015094502008],
+  ]
+
+  def make_repeat_fasta(id, desc, src, n)
+      puts ">#{id} #{desc}"
+      v = nil
+      width = 60
+      l = src.length
+      s = src * ((n / l) + 1)
+      s.slice!(n, l)
+      puts(s.scan(/.{1,#{width}}/).join("\n"))
+  end
+
+  def make_random_fasta(id, desc, table, n)
+      puts ">#{id} #{desc}"
+      rand, v = nil,nil
+      width = 60
+      chunk = 1 * width
+      prob = 0.0
+      table.each{|v| v[1]= (prob += v[1])}
+      for i in 1..(n/width)
+          puts((1..width).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+      if n%width != 0
+          puts((1..(n%width)).collect{
+              rand = gen_random(1.0)
+              table.find{|v| v[1]>rand}[0]
+          }.join)
+      end
+  end
+
+
+  n = (ARGV[0] or 250_000).to_i
+
+  make_repeat_fasta('ONE', 'Homo sapiens alu', alu, n*2)
+  make_random_fasta('TWO', 'IUB ambiguity codes', iub, n*3)
+  make_random_fasta('THREE', 'Homo sapiens frequency', homosapiens, n*5)
+  EOS
+benchmark:
+  - name: so_reverse_complement
+    prelude: |
+      script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+      File.write(script, bm_so_fasta)
+
+      def prepare_fasta_output n
+        filebase = File.join(File.dirname($0), 'fasta.output')
+        script = File.join(File.dirname($0), 'bm_so_fasta.rb')
+        file = "#{filebase}.#{n}"
+
+        unless FileTest.exist?(file)
+          STDERR.puts "preparing #{file}"
+
+          open(file, 'w'){|f|
+            ARGV[0] = n
+            $stdout = f
+            load script
+            $stdout = STDOUT
+          }
+        end
+      end
+      prepare_fasta_output(2_500_000)
+    script: |
+      # The Great Computer Language Shootout
+      # http://shootout.alioth.debian.org/
+      #
+      # Contributed by Peter Bjarke Olsen
+      # Modified by Doug King
+
+      seq=Array.new
+
+      def revcomp(seq)
+        seq.reverse!.tr!('wsatugcyrkmbdhvnATUGCYRKMBDHVN','WSTAACGRYMKVHDBNTAACGRYMKVHDBN')
+        stringlen=seq.length
+        0.step(stringlen-1,60) {|x| print seq.slice(x,60) , "\n"}
+      end
+
+      input = open(File.join(File.dirname($0), 'fasta.output.2500000'), 'rb')
+
+      while input.gets
+        if $_ =~ />/
+          if seq.length != 0
+            revcomp(seq.join)
+            seq=Array.new
+          end
+          puts $_
+        else
+          $_.sub(/\n/,'')
+          seq.push $_
+        end
+      end
+      revcomp(seq.join)
+    loop_count: 1
diff --git a/benchmark/so_sieve.rb b/benchmark/so_sieve.rb
new file mode 100644
index 0000000000..43dc302648
--- /dev/null
+++ b/benchmark/so_sieve.rb
@@ -0,0 +1,24 @@
+# from http://www.bagley.org/~doug/shootout/bench/sieve/sieve.ruby
+num = 500
+count = i = j = 0
+flags0 = Array.new(8192,1)
+k = 0
+while k < num
+  k += 1
+  count = 0
+  flags = flags0.dup
+  i = 2
+  while i<8192
+    i += 1
+    if flags[i]
+      # remove all multiples of prime: i
+      j = i*i
+      while j < 8192
+        j += i
+        flags[j] = nil
+      end
+      count += 1
+    end
+  end
+end
+count
diff --git a/benchmark/bm_so_spectralnorm.rb b/benchmark/so_spectralnorm.rb
index 6b97206689..6b97206689 100644
--- a/benchmark/bm_so_spectralnorm.rb
+++ b/benchmark/so_spectralnorm.rb
diff --git a/benchmark/string_capitalize.yml b/benchmark/string_capitalize.yml
new file mode 100644
index 0000000000..7d23fd3d35
--- /dev/null
+++ b/benchmark/string_capitalize.yml
@@ -0,0 +1,10 @@
+prelude: |
+  str1 = [*"a".."m",*"N".."Z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+benchmark:
+  capitalize-1: str1.capitalize
+  capitalize-10: str10.capitalize
+  capitalize-100: str100.capitalize
+  capitalize-1000: str1000.capitalize
diff --git a/benchmark/string_casecmp.yml b/benchmark/string_casecmp.yml
new file mode 100644
index 0000000000..2354040a04
--- /dev/null
+++ b/benchmark/string_casecmp.yml
@@ -0,0 +1,26 @@
+prelude: |
+  lstr1 = [*"a".."z",*"0".."9"].join("")
+  lstr10 = lstr1 * 10
+  lstr100 = lstr10 * 10
+  lstr1000 = lstr100 * 10
+  lnonascii1 = [*"\u{e0}".."\u{ff}"].join("")
+  lnonascii10 = lnonascii1 * 10
+  lnonascii100 = lnonascii10 * 10
+  lnonascii1000 = lnonascii100 * 10
+  ustr1 = [*"A".."Z",*"0".."9"].join("")
+  ustr10 = ustr1 * 10
+  ustr100 = ustr10 * 10
+  ustr1000 = ustr100 * 10
+  unonascii1 = [*"\u{c0}".."\u{df}"].join("")
+  unonascii10 = unonascii1 * 10
+  unonascii100 = unonascii10 * 10
+  unonascii1000 = unonascii100 * 10
+benchmark:
+  casecmp-1: lstr1.casecmp(ustr1)
+  casecmp-10: lstr10.casecmp(ustr10)
+  casecmp-100: lstr100.casecmp(ustr100)
+  casecmp-1000: lstr1000.casecmp(ustr1000)
+  casecmp-nonascii1: lnonascii1.casecmp(unonascii1)
+  casecmp-nonascii10: lnonascii10.casecmp(unonascii10)
+  casecmp-nonascii100: lnonascii100.casecmp(unonascii100)
+  casecmp-nonascii1000: lnonascii1000.casecmp(unonascii1000)
diff --git a/benchmark/string_casecmp_p.yml b/benchmark/string_casecmp_p.yml
new file mode 100644
index 0000000000..a790ce7d55
--- /dev/null
+++ b/benchmark/string_casecmp_p.yml
@@ -0,0 +1,26 @@
+prelude: |
+  lstr1 = [*"a".."z",*"0".."9"].join("")
+  lstr10 = lstr1 * 10
+  lstr100 = lstr10 * 10
+  lstr1000 = lstr100 * 10
+  lnonascii1 = [*"\u{e0}".."\u{ff}"].join("")
+  lnonascii10 = lnonascii1 * 10
+  lnonascii100 = lnonascii10 * 10
+  lnonascii1000 = lnonascii100 * 10
+  ustr1 = [*"A".."Z",*"0".."9"].join("")
+  ustr10 = ustr1 * 10
+  ustr100 = ustr10 * 10
+  ustr1000 = ustr100 * 10
+  unonascii1 = [*"\u{c0}".."\u{df}"].join("")
+  unonascii10 = unonascii1 * 10
+  unonascii100 = unonascii10 * 10
+  unonascii1000 = unonascii100 * 10
+benchmark:
+  casecmp_p-1: lstr1.casecmp?(ustr1)
+  casecmp_p-10: lstr10.casecmp?(ustr10)
+  casecmp_p-100: lstr100.casecmp?(ustr100)
+  casecmp_p-1000: lstr1000.casecmp?(ustr1000)
+  casecmp_p-nonascii1: lnonascii1.casecmp?(unonascii1)
+  casecmp_p-nonascii10: lnonascii10.casecmp?(unonascii10)
+  casecmp_p-nonascii100: lnonascii100.casecmp?(unonascii100)
+  casecmp_p-nonascii1000: lnonascii1000.casecmp?(unonascii1000)
diff --git a/benchmark/string_concat.yml b/benchmark/string_concat.yml
new file mode 100644
index 0000000000..e65c00cca9
--- /dev/null
+++ b/benchmark/string_concat.yml
@@ -0,0 +1,45 @@
+prelude: |
+  CHUNK = "a" * 64
+  UCHUNK = "é" * 32
+  GC.disable # GC causes a lot of variance
+benchmark:
+  binary_concat_7bit: |
+    buffer = String.new(capacity: 4096, encoding: Encoding::BINARY)
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+  utf8_concat_7bit: |
+    buffer = String.new(capacity: 4096, encoding: Encoding::UTF_8)
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+    buffer << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK << CHUNK
+  utf8_concat_UTF8: |
+    buffer = String.new(capacity: 4096, encoding: Encoding::UTF_8)
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+    buffer << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK << UCHUNK
+  interpolation: |
+    buffer = "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}" \
+      "#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}#{CHUNK}"
diff --git a/benchmark/string_downcase.yml b/benchmark/string_downcase.yml
new file mode 100644
index 0000000000..1fea6afbec
--- /dev/null
+++ b/benchmark/string_downcase.yml
@@ -0,0 +1,18 @@
+prelude: |
+  str1 = [*"A".."Z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+  nonascii1 = [*"\u{c0}".."\u{df}"].join("")
+  nonascii10 = nonascii1 * 10
+  nonascii100 = nonascii10 * 10
+  nonascii1000 = nonascii100 * 10
+benchmark:
+  downcase-1: str1.upcase
+  downcase-10: str10.upcase
+  downcase-100: str100.upcase
+  downcase-1000: str1000.upcase
+  downcase-nonascii1: nonascii1.downcase
+  downcase-nonascii10: nonascii10.downcase
+  downcase-nonascii100: nonascii100.downcase
+  downcase-nonascii1000: nonascii1000.downcase
diff --git a/benchmark/string_index.rb b/benchmark/string_index.rb
new file mode 100644
index 0000000000..7783111082
--- /dev/null
+++ b/benchmark/string_index.rb
@@ -0,0 +1,3 @@
+str1 = "あ" * 1024 + "い" # not single byte optimizable
+str2 = "い"
+100_000.times { str1.index(str2) }
diff --git a/benchmark/string_scan_re.rb b/benchmark/string_scan_re.rb
new file mode 100644
index 0000000000..b0d60201a9
--- /dev/null
+++ b/benchmark/string_scan_re.rb
@@ -0,0 +1,2 @@
+str = Array.new(1_000, 'abc').join(',')
+1_000.times { str.scan(/abc/) }
diff --git a/benchmark/string_scan_str.rb b/benchmark/string_scan_str.rb
new file mode 100644
index 0000000000..42440bd948
--- /dev/null
+++ b/benchmark/string_scan_str.rb
@@ -0,0 +1,2 @@
+str = Array.new(1_000, 'abc').join(',')
+1_000.times { str.scan('abc') }
diff --git a/benchmark/string_slice.yml b/benchmark/string_slice.yml
new file mode 100644
index 0000000000..fc2393c5d1
--- /dev/null
+++ b/benchmark/string_slice.yml
@@ -0,0 +1,11 @@
+prelude: |
+  long_string = "x"*1000+"-hår"
+benchmark:
+  regexp-short: |
+    "x-hår".slice!(/-(.)(.)(.)/, 3)
+  regexp-long: |
+    long_string.dup.slice!(/-(.)(.)(.)/, 3)
+  string-short: |
+    "x-hår".slice!("r")
+  string-long: |
+    long_string.dup.slice!("r")
diff --git a/benchmark/string_split.yml b/benchmark/string_split.yml
new file mode 100644
index 0000000000..cc2c7d7855
--- /dev/null
+++ b/benchmark/string_split.yml
@@ -0,0 +1,22 @@
+prelude: |
+  str1 = [*0..5].join(" ") + " "
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+benchmark:
+  to_chars-1: str1.split('')
+  to_chars-10: str10.split('')
+  to_chars-100: str100.split('')
+  to_chars-1000: str1000.split('')
+  to_words-1: str1.split(' ')
+  to_words-10: str10.split(' ')
+  to_words-100: str100.split(' ')
+  to_words-1000: str1000.split(' ')
+  re_chars-1: str1.split(//)
+  re_chars-10: str10.split(//)
+  re_chars-100: str100.split(//)
+  re_chars-1000: str1000.split(//)
+  re_space-1: str1.split(/ /)
+  re_space-10: str10.split(/ /)
+  re_space-100: str100.split(/ /)
+  re_space-1000: str1000.split(/ /)
diff --git a/benchmark/string_swapcase.yml b/benchmark/string_swapcase.yml
new file mode 100644
index 0000000000..eeb5928907
--- /dev/null
+++ b/benchmark/string_swapcase.yml
@@ -0,0 +1,18 @@
+prelude: |
+  str1 = [*"A".."M",*"n".."z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+  nonascii1 = [*"\u{c0}".."\u{cf}",*"\u{f0}".."\u{ff}"].join("")
+  nonascii10 = nonascii1 * 10
+  nonascii100 = nonascii10 * 10
+  nonascii1000 = nonascii100 * 10
+benchmark:
+  swapcase-1: str1.swapcase
+  swapcase-10: str10.swapcase
+  swapcase-100: str100.swapcase
+  swapcase-1000: str1000.swapcase
+  swapcase-nonascii1: nonascii1.swapcase
+  swapcase-nonascii10: nonascii10.swapcase
+  swapcase-nonascii100: nonascii100.swapcase
+  swapcase-nonascii1000: nonascii1000.swapcase
diff --git a/benchmark/string_upcase.yml b/benchmark/string_upcase.yml
new file mode 100644
index 0000000000..dab84bbde2
--- /dev/null
+++ b/benchmark/string_upcase.yml
@@ -0,0 +1,18 @@
+prelude: |
+  str1 = [*"a".."z",*"0".."9"].join("")
+  str10 = str1 * 10
+  str100 = str10 * 10
+  str1000 = str100 * 10
+  nonascii1 = [*"\u{e0}".."\u{ff}"].join("")
+  nonascii10 = nonascii1 * 10
+  nonascii100 = nonascii10 * 10
+  nonascii1000 = nonascii100 * 10
+benchmark:
+  upcase-1: str1.upcase
+  upcase-10: str10.upcase
+  upcase-100: str100.upcase
+  upcase-1000: str1000.upcase
+  upcase-nonascii1: nonascii1.upcase
+  upcase-nonascii10: nonascii10.upcase
+  upcase-nonascii100: nonascii100.upcase
+  upcase-nonascii1000: nonascii1000.upcase
diff --git a/benchmark/time_at.yml b/benchmark/time_at.yml
new file mode 100644
index 0000000000..3247efbe77
--- /dev/null
+++ b/benchmark/time_at.yml
@@ -0,0 +1,7 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  - 'Time.at(0)'
+  - 'Time.at(0, 500)'
+  - 'Time.at(0, in: "+09:00")'
+  - 'Time.at(0, 500, in: "+09:00")'
diff --git a/benchmark/time_new.yml b/benchmark/time_new.yml
new file mode 100644
index 0000000000..5947dd3a41
--- /dev/null
+++ b/benchmark/time_new.yml
@@ -0,0 +1,4 @@
+benchmark:
+  - 'Time.new(2021)'
+  - 'Time.new(2021, 8, 22)'
+  - 'Time.new(2021, 8, 22, in: "+09:00")'
diff --git a/benchmark/time_now.yml b/benchmark/time_now.yml
new file mode 100644
index 0000000000..f6d6a31489
--- /dev/null
+++ b/benchmark/time_now.yml
@@ -0,0 +1,3 @@
+benchmark:
+  - 'Time.now'
+  - 'Time.now(in: "+09:00")'
diff --git a/benchmark/time_parse.yml b/benchmark/time_parse.yml
new file mode 100644
index 0000000000..6060b58bc6
--- /dev/null
+++ b/benchmark/time_parse.yml
@@ -0,0 +1,10 @@
+prelude: |
+  require 'time'
+  inspect = "2021-08-23 09:57:02 +0900"
+  iso8601 = "2021-08-23T09:57:02+09:00"
+benchmark:
+  - Time.iso8601(iso8601)
+  - Time.parse(iso8601)
+  - Time.parse(inspect)
+  - Time.new(iso8601) rescue Time.iso8601(iso8601)
+  - Time.new(inspect) rescue Time.parse(inspect)
diff --git a/benchmark/time_strptime.yml b/benchmark/time_strptime.yml
new file mode 100644
index 0000000000..8d89ebb7a7
--- /dev/null
+++ b/benchmark/time_strptime.yml
@@ -0,0 +1,13 @@
+prelude: |
+  require 'time'
+benchmark:
+  - Time.strptime("28/Aug/2005:06:54:20 +0000", "%d/%b/%Y:%T %z")
+  - Time.strptime("1", "%s")
+  - Time.strptime("0 +0100", "%s %z")
+  - Time.strptime("0 UTC", "%s %z")
+  - Time.strptime("1.5", "%s.%N")
+  - Time.strptime("1.000000000001", "%s.%N")
+  - Time.strptime("20010203 -0200", "%Y%m%d %z")
+  - Time.strptime("20010203 UTC", "%Y%m%d %z")
+  - Time.strptime("2018-365", "%Y-%j")
+  - Time.strptime("2018-091", "%Y-%j")
diff --git a/benchmark/time_subsec.rb b/benchmark/time_subsec.rb
new file mode 100644
index 0000000000..505021c701
--- /dev/null
+++ b/benchmark/time_subsec.rb
@@ -0,0 +1,2 @@
+t = Time.now
+4000000.times { t.subsec }
diff --git a/benchmark/vm_array.yml b/benchmark/vm_array.yml
new file mode 100644
index 0000000000..2a177237ef
--- /dev/null
+++ b/benchmark/vm_array.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_array: |
+    a = [1,2,3,4,5,6,7,8,9,10]
+loop_count: 6000000
diff --git a/benchmark/vm_attr_ivar.yml b/benchmark/vm_attr_ivar.yml
new file mode 100644
index 0000000000..75b803478e
--- /dev/null
+++ b/benchmark/vm_attr_ivar.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    attr_reader :a, :b
+    def initialize
+      @a = nil
+      @b = nil
+    end
+  end
+  obj = C.new
+benchmark:
+  vm_attr_ivar: |
+    j = obj.a
+    k = obj.b
+loop_count: 30000000
diff --git a/benchmark/vm_attr_ivar_set.yml b/benchmark/vm_attr_ivar_set.yml
new file mode 100644
index 0000000000..a0d379b18a
--- /dev/null
+++ b/benchmark/vm_attr_ivar_set.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    attr_accessor :a, :b
+    def initialize
+      @a = nil
+      @b = nil
+    end
+  end
+  obj = C.new
+benchmark:
+  vm_attr_ivar_set: |
+    obj.a = 1
+    obj.b = 2
+loop_count: 30000000
diff --git a/benchmark/vm_backtrace.rb b/benchmark/vm_backtrace.rb
new file mode 100644
index 0000000000..0fbf73e1ca
--- /dev/null
+++ b/benchmark/vm_backtrace.rb
@@ -0,0 +1,22 @@
+# get last backtrace
+
+begin
+  caller(0, 0)
+rescue ArgumentError
+  alias caller_orig caller
+  def caller lev, n
+    caller_orig(lev)[0..n]
+  end
+end
+
+def rec n
+  if n < 0
+    100_000.times{
+      caller(0, 1)
+    }
+  else
+    rec(n-1)
+  end
+end
+
+rec 50
diff --git a/benchmark/vm_bigarray.yml b/benchmark/vm_bigarray.yml
new file mode 100644
index 0000000000..8b2d3f3443
--- /dev/null
+++ b/benchmark/vm_bigarray.yml
@@ -0,0 +1,105 @@
+benchmark:
+  vm_bigarray: |
+    a = [
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+      1,2,3,4,5,6,7,8,9,10,
+    ]
+loop_count: 6000000
diff --git a/benchmark/vm_bighash.yml b/benchmark/vm_bighash.yml
new file mode 100644
index 0000000000..4dacfde793
--- /dev/null
+++ b/benchmark/vm_bighash.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_bighash: |
+    a = {0=>0, 1=>1, 2=>2, 3=>3, 4=>4, 5=>5, 6=>6, 7=>7, 8=>8, 9=>9, 10=>10, 11=>11, 12=>12, 13=>13, 14=>14, 15=>15, 16=>16, 17=>17, 18=>18, 19=>19, 20=>20, 21=>21, 22=>22, 23=>23, 24=>24, 25=>25, 26=>26, 27=>27, 28=>28, 29=>29, 30=>30, 31=>31, 32=>32, 33=>33, 34=>34, 35=>35, 36=>36, 37=>37, 38=>38, 39=>39, 40=>40, 41=>41, 42=>42, 43=>43, 44=>44, 45=>45, 46=>46, 47=>47, 48=>48, 49=>49, 50=>50, 51=>51, 52=>52, 53=>53, 54=>54, 55=>55, 56=>56, 57=>57, 58=>58, 59=>59, 60=>60, 61=>61, 62=>62, 63=>63, 64=>64, 65=>65, 66=>66, 67=>67, 68=>68, 69=>69, 70=>70, 71=>71, 72=>72, 73=>73, 74=>74, 75=>75, 76=>76, 77=>77, 78=>78, 79=>79, 80=>80, 81=>81, 82=>82, 83=>83, 84=>84, 85=>85, 86=>86, 87=>87, 88=>88, 89=>89, 90=>90, 91=>91, 92=>92, 93=>93, 94=>94, 95=>95, 96=>96, 97=>97, 98=>98, 99=>99, 100=>100, 101=>101, 102=>102, 103=>103, 104=>104, 105=>105, 106=>106, 107=>107, 108=>108, 109=>109, 110=>110, 111=>111, 112=>112, 113=>113, 114=>114, 115=>115, 116=>116, 117=>117, 118=>118, 119=>119, 120=>120, 121=>121, 122=>122, 123=>123, 124=>124, 125=>125, 126=>126, 127=>127, 128=>128, 129=>129, 130=>130, 131=>131, 132=>132, 133=>133, 134=>134, 135=>135, 136=>136, 137=>137, 138=>138, 139=>139, 140=>140, 141=>141, 142=>142, 143=>143, 144=>144, 145=>145, 146=>146, 147=>147, 148=>148, 149=>149, 150=>150, 151=>151, 152=>152, 153=>153, 154=>154, 155=>155, 156=>156, 157=>157, 158=>158, 159=>159, 160=>160, 161=>161, 162=>162, 163=>163, 164=>164, 165=>165, 166=>166, 167=>167, 168=>168, 169=>169, 170=>170, 171=>171, 172=>172, 173=>173, 174=>174, 175=>175, 176=>176, 177=>177, 178=>178, 179=>179, 180=>180, 181=>181, 182=>182, 183=>183, 184=>184, 185=>185, 186=>186, 187=>187, 188=>188, 189=>189, 190=>190, 191=>191, 192=>192, 193=>193, 194=>194, 195=>195, 196=>196, 197=>197, 198=>198, 199=>199, 200=>200, 201=>201, 202=>202, 203=>203, 204=>204, 205=>205, 206=>206, 207=>207, 208=>208, 209=>209, 210=>210, 211=>211, 212=>212, 213=>213, 214=>214, 215=>215, 216=>216, 217=>217, 218=>218, 219=>219, 220=>220, 221=>221, 222=>222, 223=>223, 224=>224, 225=>225, 226=>226, 227=>227, 228=>228, 229=>229, 230=>230, 231=>231, 232=>232, 233=>233, 234=>234, 235=>235, 236=>236, 237=>237, 238=>238, 239=>239, 240=>240, 241=>241, 242=>242, 243=>243, 244=>244, 245=>245, 246=>246, 247=>247, 248=>248, 249=>249, 250=>250, 251=>251, 252=>252, 253=>253, 254=>254, 255=>255, 256=>256, 257=>257, 258=>258, 259=>259, 260=>260, 261=>261, 262=>262, 263=>263, 264=>264, 265=>265, 266=>266, 267=>267, 268=>268, 269=>269, 270=>270, 271=>271, 272=>272, 273=>273, 274=>274, 275=>275, 276=>276, 277=>277, 278=>278, 279=>279, 280=>280, 281=>281, 282=>282, 283=>283, 284=>284, 285=>285, 286=>286, 287=>287, 288=>288, 289=>289, 290=>290, 291=>291, 292=>292, 293=>293, 294=>294, 295=>295, 296=>296, 297=>297, 298=>298, 299=>299, 300=>300, 301=>301, 302=>302, 303=>303, 304=>304, 305=>305, 306=>306, 307=>307, 308=>308, 309=>309, 310=>310, 311=>311, 312=>312, 313=>313, 314=>314, 315=>315, 316=>316, 317=>317, 318=>318, 319=>319, 320=>320, 321=>321, 322=>322, 323=>323, 324=>324, 325=>325, 326=>326, 327=>327, 328=>328, 329=>329, 330=>330, 331=>331, 332=>332, 333=>333, 334=>334, 335=>335, 336=>336, 337=>337, 338=>338, 339=>339, 340=>340, 341=>341, 342=>342, 343=>343, 344=>344, 345=>345, 346=>346, 347=>347, 348=>348, 349=>349, 350=>350, 351=>351, 352=>352, 353=>353, 354=>354, 355=>355, 356=>356, 357=>357, 358=>358, 359=>359, 360=>360, 361=>361, 362=>362, 363=>363, 364=>364, 365=>365, 366=>366, 367=>367, 368=>368, 369=>369, 370=>370, 371=>371, 372=>372, 373=>373, 374=>374, 375=>375, 376=>376, 377=>377, 378=>378, 379=>379, 380=>380, 381=>381, 382=>382, 383=>383, 384=>384, 385=>385, 386=>386, 387=>387, 388=>388, 389=>389, 390=>390, 391=>391, 392=>392, 393=>393, 394=>394, 395=>395, 396=>396, 397=>397, 398=>398, 399=>399, 400=>400, 401=>401, 402=>402, 403=>403, 404=>404, 405=>405, 406=>406, 407=>407, 408=>408, 409=>409, 410=>410, 411=>411, 412=>412, 413=>413, 414=>414, 415=>415, 416=>416, 417=>417, 418=>418, 419=>419, 420=>420, 421=>421, 422=>422, 423=>423, 424=>424, 425=>425, 426=>426, 427=>427, 428=>428, 429=>429, 430=>430, 431=>431, 432=>432, 433=>433, 434=>434, 435=>435, 436=>436, 437=>437, 438=>438, 439=>439, 440=>440, 441=>441, 442=>442, 443=>443, 444=>444, 445=>445, 446=>446, 447=>447, 448=>448, 449=>449, 450=>450, 451=>451, 452=>452, 453=>453, 454=>454, 455=>455, 456=>456, 457=>457, 458=>458, 459=>459, 460=>460, 461=>461, 462=>462, 463=>463, 464=>464, 465=>465, 466=>466, 467=>467, 468=>468, 469=>469, 470=>470, 471=>471, 472=>472, 473=>473, 474=>474, 475=>475, 476=>476, 477=>477, 478=>478, 479=>479, 480=>480, 481=>481, 482=>482, 483=>483, 484=>484, 485=>485, 486=>486, 487=>487, 488=>488, 489=>489, 490=>490, 491=>491, 492=>492, 493=>493, 494=>494, 495=>495, 496=>496, 497=>497, 498=>498, 499=>499, 500=>500,}
+loop_count: 60000
diff --git a/benchmark/vm_block.yml b/benchmark/vm_block.yml
new file mode 100644
index 0000000000..68b3e40bf5
--- /dev/null
+++ b/benchmark/vm_block.yml
@@ -0,0 +1,9 @@
+prelude: |
+  def m
+    yield
+  end
+benchmark:
+  vm_block: |
+    m{
+    }
+loop_count: 30000000
diff --git a/benchmark/vm_block_handler.yml b/benchmark/vm_block_handler.yml
new file mode 100644
index 0000000000..461d7953ad
--- /dev/null
+++ b/benchmark/vm_block_handler.yml
@@ -0,0 +1,27 @@
+# :FIXME: is there a way to benchmark block_handler_type_ifunc?
+
+prelude: |
+  p = proc{_1}
+  o = Object.new
+  def o.each
+    i = 0
+    while i < 3_000_000 do
+      yield i
+      i += 1
+    end
+  end
+
+benchmark:
+  - name: block_handler_type_iseq
+    script: |
+      o.each{_1}
+
+  - name: block_handler_type_symbol
+    script: |
+      o.each(&:itself)
+
+  - name: block_handler_type_proc
+    script: |
+      o.each(&p)
+
+loop_count: 1
diff --git a/benchmark/vm_blockparam.yml b/benchmark/vm_blockparam.yml
new file mode 100644
index 0000000000..5e5a0170a2
--- /dev/null
+++ b/benchmark/vm_blockparam.yml
@@ -0,0 +1,7 @@
+prelude: |
+  def m &b
+  end
+benchmark:
+  vm_blockparam: |
+    m{}
+loop_count: 30000000
diff --git a/benchmark/vm_blockparam_call.yml b/benchmark/vm_blockparam_call.yml
new file mode 100644
index 0000000000..a7d8d366ea
--- /dev/null
+++ b/benchmark/vm_blockparam_call.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def m &b
+    b.call
+  end
+benchmark:
+  vm_blockparam_call: |
+    m{}
+loop_count: 30000000
diff --git a/benchmark/vm_blockparam_pass.yml b/benchmark/vm_blockparam_pass.yml
new file mode 100644
index 0000000000..841f5e7a63
--- /dev/null
+++ b/benchmark/vm_blockparam_pass.yml
@@ -0,0 +1,12 @@
+prelude: |
+  def bp_yield
+    yield
+  end
+
+  def bp_pass &b
+    bp_yield &b
+  end
+benchmark:
+  vm_blockparam_pass: |
+    bp_pass{}
+loop_count: 30000000
diff --git a/benchmark/vm_blockparam_yield.yml b/benchmark/vm_blockparam_yield.yml
new file mode 100644
index 0000000000..8ea9b46ed2
--- /dev/null
+++ b/benchmark/vm_blockparam_yield.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def bp_yield &b
+    yield
+  end
+benchmark:
+  vm_blockparam_yield: |
+    bp_yield{}
+loop_count: 30000000
diff --git a/benchmark/vm_case.yml b/benchmark/vm_case.yml
new file mode 100644
index 0000000000..b26a491a15
--- /dev/null
+++ b/benchmark/vm_case.yml
@@ -0,0 +1,13 @@
+benchmark:
+  vm_case: |
+    case :foo
+    when :bar
+      raise
+    when :baz
+      raise
+    when :boo
+      raise
+    when :foo
+      # noop
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_case_classes.yml b/benchmark/vm_case_classes.yml
new file mode 100644
index 0000000000..cacc4f0464
--- /dev/null
+++ b/benchmark/vm_case_classes.yml
@@ -0,0 +1,9 @@
+benchmark:
+  vm_case_classes: |
+    case :foo
+    when Hash
+      raise
+    when Array
+      raise
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_case_lit.yml b/benchmark/vm_case_lit.yml
new file mode 100644
index 0000000000..9f91801544
--- /dev/null
+++ b/benchmark/vm_case_lit.yml
@@ -0,0 +1,23 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_case_lit: |
+    i = 0
+    @ret = [ "foo", true, false, :sym, 6, nil, 0.1, 0xffffffffffffffff ]
+    def foo(i)
+      @ret[i % @ret.size]
+    end
+
+    while i<6_000_000
+      case foo(i)
+      when "foo" then :foo
+      when true then true
+      when false then false
+      when :sym then :sym
+      when 6 then :fix
+      when nil then nil
+      when 0.1 then :float
+      when 0xffffffffffffffff then :big
+      end
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/vm_clearmethodcache.rb b/benchmark/vm_clearmethodcache.rb
new file mode 100644
index 0000000000..9661323cd2
--- /dev/null
+++ b/benchmark/vm_clearmethodcache.rb
@@ -0,0 +1,8 @@
+i = 0
+while i<200_000
+  i += 1
+
+  Class.new{
+    def m; end
+  }
+end
diff --git a/benchmark/vm_const.yml b/benchmark/vm_const.yml
new file mode 100644
index 0000000000..8939ca0cd3
--- /dev/null
+++ b/benchmark/vm_const.yml
@@ -0,0 +1,13 @@
+prelude: |
+  Const = 1
+  A = B = C = D = E = F = G = H = I = J = K = L = M = N = O = P = Q = R = S = T = U = V = W = X = Y = Z = 1
+  def foo
+    A; B; C; D; E; F; G; H; I; J; K; L; M; N; O; P; Q; R; S; T; U; V; W; X; Y; Z
+  end
+benchmark:
+  vm_const: |
+    j = Const
+    k = Const
+  vm_const_many: |
+    foo
+loop_count: 30000000
diff --git a/benchmark/vm_cvar.yml b/benchmark/vm_cvar.yml
new file mode 100644
index 0000000000..1d0e161829
--- /dev/null
+++ b/benchmark/vm_cvar.yml
@@ -0,0 +1,20 @@
+prelude: |
+  class A
+    @@foo = 1
+
+    def self.foo
+      @@foo
+    end
+
+    ("A".."Z").each do |module_name|
+      eval <<-EOM
+        module #{module_name}
+        end
+
+        include #{module_name}
+      EOM
+    end
+  end
+benchmark:
+  vm_cvar: A.foo
+loop_count: 600000
diff --git a/benchmark/vm_defined_method.yml b/benchmark/vm_defined_method.yml
new file mode 100644
index 0000000000..347e0cfd33
--- /dev/null
+++ b/benchmark/vm_defined_method.yml
@@ -0,0 +1,8 @@
+prelude: |
+  class Object
+    define_method(:m){}
+  end
+benchmark:
+  vm_defined_method: |
+    m; m; m; m; m; m; m; m;
+loop_count: 6000000
diff --git a/benchmark/vm_dstr.yml b/benchmark/vm_dstr.yml
new file mode 100644
index 0000000000..30c7a3193c
--- /dev/null
+++ b/benchmark/vm_dstr.yml
@@ -0,0 +1,6 @@
+prelude: |
+  x = y = 'z'
+benchmark:
+  vm_dstr: |
+    str = "foo#{x}bar#{y}baz"
+loop_count: 6000000
diff --git a/benchmark/vm_dstr_ary.rb b/benchmark/vm_dstr_ary.rb
new file mode 100644
index 0000000000..1d3aa3b97b
--- /dev/null
+++ b/benchmark/vm_dstr_ary.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = []
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_bool.rb b/benchmark/vm_dstr_bool.rb
new file mode 100644
index 0000000000..631ca54755
--- /dev/null
+++ b/benchmark/vm_dstr_bool.rb
@@ -0,0 +1,7 @@
+i = 0
+x = true
+y = false
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_class_module.rb b/benchmark/vm_dstr_class_module.rb
new file mode 100644
index 0000000000..becf0861c7
--- /dev/null
+++ b/benchmark/vm_dstr_class_module.rb
@@ -0,0 +1,10 @@
+i = 0
+class A; end unless defined?(A)
+module B; end unless defined?(B)
+x = A
+y = B
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
+
diff --git a/benchmark/vm_dstr_digit.rb b/benchmark/vm_dstr_digit.rb
new file mode 100644
index 0000000000..caaa395192
--- /dev/null
+++ b/benchmark/vm_dstr_digit.rb
@@ -0,0 +1,7 @@
+i = 0
+x = 0
+y = 9
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_int.rb b/benchmark/vm_dstr_int.rb
new file mode 100644
index 0000000000..ed380d7595
--- /dev/null
+++ b/benchmark/vm_dstr_int.rb
@@ -0,0 +1,5 @@
+i = 0
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{i}bar#{i}baz"
+end
diff --git a/benchmark/vm_dstr_nil.rb b/benchmark/vm_dstr_nil.rb
new file mode 100644
index 0000000000..ec4f5d6c67
--- /dev/null
+++ b/benchmark/vm_dstr_nil.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = nil
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_obj.rb b/benchmark/vm_dstr_obj.rb
new file mode 100644
index 0000000000..fb78637ead
--- /dev/null
+++ b/benchmark/vm_dstr_obj.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = Object.new
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_obj_def.rb b/benchmark/vm_dstr_obj_def.rb
new file mode 100644
index 0000000000..99ff7b98fb
--- /dev/null
+++ b/benchmark/vm_dstr_obj_def.rb
@@ -0,0 +1,8 @@
+i = 0
+o = Object.new
+def o.to_s; -""; end
+x = y = o
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_str.rb b/benchmark/vm_dstr_str.rb
new file mode 100644
index 0000000000..45fc107892
--- /dev/null
+++ b/benchmark/vm_dstr_str.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = ""
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_dstr_sym.rb b/benchmark/vm_dstr_sym.rb
new file mode 100644
index 0000000000..484b8f8150
--- /dev/null
+++ b/benchmark/vm_dstr_sym.rb
@@ -0,0 +1,6 @@
+i = 0
+x = y = :z
+while i<6_000_000 # benchmark loop 2
+  i += 1
+  str = "foo#{x}bar#{y}baz"
+end
diff --git a/benchmark/vm_ensure.yml b/benchmark/vm_ensure.yml
new file mode 100644
index 0000000000..4ea62f30de
--- /dev/null
+++ b/benchmark/vm_ensure.yml
@@ -0,0 +1,14 @@
+# Not utilizing loop_count since using it for this is too unstable for now
+benchmark:
+  vm_ensure: |
+    i = 0
+    while i<30_000_000
+      i += 1
+      begin
+        begin
+        ensure
+        end
+      ensure
+      end
+    end
+loop_count: 1
diff --git a/benchmark/vm_eval.yml b/benchmark/vm_eval.yml
new file mode 100644
index 0000000000..7ba1a8d1de
--- /dev/null
+++ b/benchmark/vm_eval.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_eval: |
+    eval("1")
+loop_count: 6000000
diff --git a/benchmark/vm_fiber_allocate.yml b/benchmark/vm_fiber_allocate.yml
new file mode 100644
index 0000000000..b5a54e1ddf
--- /dev/null
+++ b/benchmark/vm_fiber_allocate.yml
@@ -0,0 +1,8 @@
+prelude: |
+  # Disable GC to see raw throughput:
+  GC.disable
+benchmark:
+  vm_fiber_allocate: |
+    fiber = Fiber.new{Fiber.yield}
+    fiber.resume
+loop_count: 100000
diff --git a/benchmark/vm_fiber_count.yml b/benchmark/vm_fiber_count.yml
new file mode 100644
index 0000000000..b83d3152d4
--- /dev/null
+++ b/benchmark/vm_fiber_count.yml
@@ -0,0 +1,10 @@
+# On Linux, you will need to increase the maximum number of memory maps:
+# sudo sysctl -w vm.max_map_count=200000
+prelude: |
+  fibers = []
+benchmark:
+  vm_fiber_count: |
+    fiber = Fiber.new{Fiber.yield}
+    fibers << fiber
+    fiber.resume
+loop_count: 100000
diff --git a/benchmark/vm_fiber_reuse.yml b/benchmark/vm_fiber_reuse.yml
new file mode 100644
index 0000000000..4ca41085b1
--- /dev/null
+++ b/benchmark/vm_fiber_reuse.yml
@@ -0,0 +1,14 @@
+prelude: |
+  GC.disable
+  fibers = []
+benchmark:
+  vm_fiber_reuse: |
+    1024.times do
+      fiber = Fiber.new{Fiber.yield}
+      fibers << fiber
+      fiber.resume
+    end
+
+    fibers.clear
+    GC.start
+loop_count: 200
diff --git a/benchmark/vm_fiber_reuse_gc.yml b/benchmark/vm_fiber_reuse_gc.yml
new file mode 100644
index 0000000000..892622f121
--- /dev/null
+++ b/benchmark/vm_fiber_reuse_gc.yml
@@ -0,0 +1,12 @@
+# https://bugs.ruby-lang.org/issues/16009
+prelude: |
+  fibers = []
+benchmark:
+  vm_fiber_reuse_gc: |
+    2000.times do
+      fiber = Fiber.new{Fiber.yield}
+      fibers << fiber
+      fiber.resume
+    end
+    fibers.clear
+loop_count: 100
diff --git a/benchmark/vm_fiber_switch.yml b/benchmark/vm_fiber_switch.yml
new file mode 100644
index 0000000000..3de36b66eb
--- /dev/null
+++ b/benchmark/vm_fiber_switch.yml
@@ -0,0 +1,9 @@
+prelude: |
+  # based on benchmark for [ruby-core:65518] [Feature #10341] by Knut Franke
+  fib = Fiber.new do
+    loop { Fiber.yield }
+  end
+benchmark:
+  vm_fiber_switch: |
+    fib.resume
+loop_count: 20000000
diff --git a/benchmark/vm_float_simple.yml b/benchmark/vm_float_simple.yml
new file mode 100644
index 0000000000..92f5fd52ab
--- /dev/null
+++ b/benchmark/vm_float_simple.yml
@@ -0,0 +1,8 @@
+prelude: |
+  f = 0.0
+benchmark:
+  vm_float_simple: |
+    f += 0.1; f -= 0.1
+    f += 0.1; f -= 0.1
+    f += 0.1; f -= 0.1
+loop_count: 30000000
diff --git a/benchmark/vm_freezeobj.yml b/benchmark/vm_freezeobj.yml
new file mode 100644
index 0000000000..69a795a354
--- /dev/null
+++ b/benchmark/vm_freezeobj.yml
@@ -0,0 +1,6 @@
+prelude: |
+ objs = 100000.times.map { Object.new }
+benchmark:
+  vm_freeze_obj: |
+    objs.map(&:freeze)
+loop_count: 600
diff --git a/benchmark/vm_freezestring.yml b/benchmark/vm_freezestring.yml
new file mode 100644
index 0000000000..facc9aa043
--- /dev/null
+++ b/benchmark/vm_freezestring.yml
@@ -0,0 +1,10 @@
+prelude: |
+  class String
+    def freeze
+      -self
+    end
+  end
+benchmark:
+  vm_freezestring: |
+    "tXnL1BP5T1WPXMjuFNLQtallEtRcay1t2lHtJSrlVsDgvunlbtfpr/DGdH0NGYE9".freeze
+loop_count: 6000000
diff --git a/benchmark/vm_gc.rb b/benchmark/vm_gc.rb
new file mode 100644
index 0000000000..e668026915
--- /dev/null
+++ b/benchmark/vm_gc.rb
@@ -0,0 +1,6 @@
+5000.times do
+  100.times do
+    {"xxxx"=>"yyyy"}
+  end
+  GC.start
+end
diff --git a/benchmark/vm_gc_old_full.rb b/benchmark/vm_gc_old_full.rb
new file mode 100644
index 0000000000..cfdfc8c5a5
--- /dev/null
+++ b/benchmark/vm_gc_old_full.rb
@@ -0,0 +1,4 @@
+old_object = Array.new(1_000_000){''}
+100.times do
+  GC.start
+end
diff --git a/benchmark/vm_gc_old_immediate.rb b/benchmark/vm_gc_old_immediate.rb
new file mode 100644
index 0000000000..ad22feb655
--- /dev/null
+++ b/benchmark/vm_gc_old_immediate.rb
@@ -0,0 +1,4 @@
+old_object = Array.new(1_000_000){''}
+30_000.times do
+  GC.start(full_mark: false, immediate_sweep: true)
+end
diff --git a/benchmark/vm_gc_old_lazy.rb b/benchmark/vm_gc_old_lazy.rb
new file mode 100644
index 0000000000..b74d44baf1
--- /dev/null
+++ b/benchmark/vm_gc_old_lazy.rb
@@ -0,0 +1,4 @@
+old_object = Array.new(1_000_000){''}
+30_000.times do
+  GC.start(full_mark: false, immediate_sweep: false)
+end
diff --git a/benchmark/vm_gc_short_lived.yml b/benchmark/vm_gc_short_lived.yml
new file mode 100644
index 0000000000..29c803fee3
--- /dev/null
+++ b/benchmark/vm_gc_short_lived.yml
@@ -0,0 +1,9 @@
+benchmark:
+  vm_gc_short_lived: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_short_with_complex_long.yml b/benchmark/vm_gc_short_with_complex_long.yml
new file mode 100644
index 0000000000..4b6c3ed7b9
--- /dev/null
+++ b/benchmark/vm_gc_short_with_complex_long.yml
@@ -0,0 +1,25 @@
+prelude: |
+  def nested_hash h, n
+    if n == 0
+      ''
+    else
+      10.times{
+        h[Object.new] = nested_hash(h, n-1)
+      }
+    end
+  end
+
+  long_lived = Hash.new
+  nested_hash long_lived, 6
+
+  GC.start
+  GC.start
+benchmark:
+  vm_gc_short_with_complex_long: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_short_with_long.yml b/benchmark/vm_gc_short_with_long.yml
new file mode 100644
index 0000000000..03ba0f95a9
--- /dev/null
+++ b/benchmark/vm_gc_short_with_long.yml
@@ -0,0 +1,13 @@
+prelude: |
+  long_lived = Array.new(1_000_000){|i| "#{i}"}
+  GC.start
+  GC.start
+benchmark:
+  vm_gc_short_with_long: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_short_with_symbol.yml b/benchmark/vm_gc_short_with_symbol.yml
new file mode 100644
index 0000000000..129b8bf4ed
--- /dev/null
+++ b/benchmark/vm_gc_short_with_symbol.yml
@@ -0,0 +1,13 @@
+prelude: |
+  50_000.times{|i| sym = "sym#{i}".to_sym}
+  GC.start
+  GC.start
+benchmark:
+  vm_gc_short_with_symbol: |
+    a = '' # short-lived String
+    b = ''
+    c = ''
+    d = ''
+    e = ''
+    f = ''
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_ary.yml b/benchmark/vm_gc_wb_ary.yml
new file mode 100644
index 0000000000..e3293e72d0
--- /dev/null
+++ b/benchmark/vm_gc_wb_ary.yml
@@ -0,0 +1,12 @@
+prelude: |
+  short_lived_ary = []
+
+  if RUBY_VERSION >= "2.2.0"
+    GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true)
+  end
+
+  short_lived = ''
+benchmark:
+  vm_gc_wb_ary: |
+    short_lived_ary[0] = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_ary_promoted.yml b/benchmark/vm_gc_wb_ary_promoted.yml
new file mode 100644
index 0000000000..003995945b
--- /dev/null
+++ b/benchmark/vm_gc_wb_ary_promoted.yml
@@ -0,0 +1,15 @@
+prelude: |
+  long_lived = []
+
+  if RUBY_VERSION > "2.2.0"
+    3.times{ GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true) }
+  elsif
+    GC.start
+  end
+
+  short_lived = ''
+
+benchmark:
+  vm_gc_wb_ary_promoted: |
+    long_lived[0] = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_obj.yml b/benchmark/vm_gc_wb_obj.yml
new file mode 100644
index 0000000000..a2a2ce2d18
--- /dev/null
+++ b/benchmark/vm_gc_wb_obj.yml
@@ -0,0 +1,15 @@
+prelude: |
+  class C
+    attr_accessor :foo
+  end
+  short_lived_obj = C.new
+
+  if RUBY_VERSION >= "2.2.0"
+    GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true)
+  end
+
+  short_lived = ''
+benchmark:
+  vm_gc_wb_obj: |
+    short_lived_obj.foo = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_gc_wb_obj_promoted.yml b/benchmark/vm_gc_wb_obj_promoted.yml
new file mode 100644
index 0000000000..00a454ba72
--- /dev/null
+++ b/benchmark/vm_gc_wb_obj_promoted.yml
@@ -0,0 +1,17 @@
+prelude: |
+  class C
+    attr_accessor :foo
+  end
+  long_lived = C.new
+
+  if RUBY_VERSION >= "2.2.0"
+    3.times{ GC.start(full_mark: false, immediate_mark: true, immediate_sweep: true) }
+  elsif
+    GC.start
+  end
+
+  short_lived = ''
+benchmark:
+  vm_gc_wb_obj_promoted: |
+    long_lived.foo = short_lived # write barrier
+loop_count: 30000000
diff --git a/benchmark/vm_iclass_super.yml b/benchmark/vm_iclass_super.yml
new file mode 100644
index 0000000000..21bb7db247
--- /dev/null
+++ b/benchmark/vm_iclass_super.yml
@@ -0,0 +1,20 @@
+prelude: |
+  class C
+    def m
+      1
+    end
+
+    ("A".."M").each do |module_name|
+      eval <<-EOM
+          module #{module_name}
+            def m; super; end
+          end
+          prepend #{module_name}
+      EOM
+    end
+  end
+
+  obj = C.new
+benchmark:
+  vm_iclass_super: obj.m
+loop_count: 6000000
diff --git a/benchmark/vm_ivar.yml b/benchmark/vm_ivar.yml
new file mode 100644
index 0000000000..119531d5ef
--- /dev/null
+++ b/benchmark/vm_ivar.yml
@@ -0,0 +1,6 @@
+prelude: "@a = 1\n"
+benchmark:
+  vm_ivar: |
+    j = @a
+    k = @a
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_embedded_obj_init.yml b/benchmark/vm_ivar_embedded_obj_init.yml
new file mode 100644
index 0000000000..74fe20a630
--- /dev/null
+++ b/benchmark/vm_ivar_embedded_obj_init.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_embedded_obj_init: |
+    c.set_ivars
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_extended_obj_init.yml b/benchmark/vm_ivar_extended_obj_init.yml
new file mode 100644
index 0000000000..f054bab282
--- /dev/null
+++ b/benchmark/vm_ivar_extended_obj_init.yml
@@ -0,0 +1,16 @@
+prelude: |
+  class C
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+      @d = nil
+      @e = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_extended_obj_init: |
+    c.set_ivars
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_generic_get.yml b/benchmark/vm_ivar_generic_get.yml
new file mode 100644
index 0000000000..dae2d37671
--- /dev/null
+++ b/benchmark/vm_ivar_generic_get.yml
@@ -0,0 +1,17 @@
+prelude: |
+  class C < Array
+    attr_reader :a, :b, :c
+    def initialize
+      @a = nil
+      @b = nil
+      @c = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_generic_get: |
+    c.a
+    c.b
+    c.c
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_generic_set.yml b/benchmark/vm_ivar_generic_set.yml
new file mode 100644
index 0000000000..102a6577fb
--- /dev/null
+++ b/benchmark/vm_ivar_generic_set.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C < Array
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+    end
+  end
+
+  c = C.new
+benchmark:
+  vm_ivar_generic_set: |
+    c.set_ivars
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_get.yml b/benchmark/vm_ivar_get.yml
new file mode 100644
index 0000000000..9174af6965
--- /dev/null
+++ b/benchmark/vm_ivar_get.yml
@@ -0,0 +1,37 @@
+prelude: |
+  class Example
+    def initialize
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+      @levar = 1
+    end
+
+    def get_value_loop
+      sum = 0
+
+      i = 0
+      while i < 1000000
+        # 10 times to de-emphasize loop overhead
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        sum += @levar
+        i += 1
+      end
+
+      return sum
+    end
+  end
+
+  obj = Example.new
+benchmark:
+  vm_ivar_get: |
+    obj.get_value_loop
+loop_count: 100
diff --git a/benchmark/vm_ivar_get_unintialized.yml b/benchmark/vm_ivar_get_unintialized.yml
new file mode 100644
index 0000000000..a1ccfb06ce
--- /dev/null
+++ b/benchmark/vm_ivar_get_unintialized.yml
@@ -0,0 +1,12 @@
+prelude: |
+  class Example
+    def read
+      @uninitialized
+    end
+  end
+
+  obj = Example.new
+benchmark:
+  vm_ivar_get_uninitialized: |
+    obj.read
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_lazy_set.yml b/benchmark/vm_ivar_lazy_set.yml
new file mode 100644
index 0000000000..7372ffcfbc
--- /dev/null
+++ b/benchmark/vm_ivar_lazy_set.yml
@@ -0,0 +1,12 @@
+prelude: |
+  class Example
+    def lazy_set
+      @uninitialized ||= 123
+    end
+  end
+
+  objs = 10000000.times.map { Example.new }
+benchmark:
+  vm_ivar_lazy_set: |
+    objs.each(&:lazy_set)
+loop_count: 1
diff --git a/benchmark/vm_ivar_of_class.yml b/benchmark/vm_ivar_of_class.yml
new file mode 100644
index 0000000000..172e28b2fd
--- /dev/null
+++ b/benchmark/vm_ivar_of_class.yml
@@ -0,0 +1,12 @@
+prelude: |
+  class C
+    @a = 1
+    def self.a
+      _a = @a; _a = @a; _a = @a; _a = @a; _a = @a;
+      _a = @a; _a = @a; _a = @a; _a = @a; _a = @a;
+    end
+  end
+benchmark:
+  vm_ivar_of_class: |
+    a = C.a
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_of_class_set.yml b/benchmark/vm_ivar_of_class_set.yml
new file mode 100644
index 0000000000..2ea5199423
--- /dev/null
+++ b/benchmark/vm_ivar_of_class_set.yml
@@ -0,0 +1,11 @@
+prelude: |
+  class C
+    @a = 1
+    def self.a o
+      @a = o; @a = o; @a = o; @a = o; @a = o; @a = o;
+    end
+  end
+benchmark:
+  vm_ivar_of_class_set: |
+    a = C.a(nil)
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_set.yml b/benchmark/vm_ivar_set.yml
new file mode 100644
index 0000000000..8bbb60043b
--- /dev/null
+++ b/benchmark/vm_ivar_set.yml
@@ -0,0 +1,5 @@
+benchmark:
+  vm_ivar_set: |
+    @a = 1
+    @b = 2
+loop_count: 30000000
diff --git a/benchmark/vm_ivar_set_on_instance.yml b/benchmark/vm_ivar_set_on_instance.yml
new file mode 100644
index 0000000000..91857b7742
--- /dev/null
+++ b/benchmark/vm_ivar_set_on_instance.yml
@@ -0,0 +1,35 @@
+prelude: |
+  class TheClass
+    def initialize
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+      @levar = 1
+    end
+
+    def set_value_loop
+      # 1M
+      i = 0
+      while i < 1000000
+        # 10 times to de-emphasize loop overhead
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        @levar = i
+        i += 1
+      end
+    end
+  end
+
+  obj = TheClass.new
+
+benchmark:
+  vm_ivar_set_on_instance: |
+    obj.set_value_loop
+loop_count: 100
diff --git a/benchmark/vm_ivar_set_subclass.yml b/benchmark/vm_ivar_set_subclass.yml
new file mode 100644
index 0000000000..bc8bf5bf6b
--- /dev/null
+++ b/benchmark/vm_ivar_set_subclass.yml
@@ -0,0 +1,20 @@
+prelude: |
+  class A
+    def set_ivars
+      @a = nil
+      @b = nil
+      @c = nil
+      @d = nil
+      @e = nil
+    end
+  end
+  class B < A; end
+  class C < A; end
+
+  b = B.new
+  c = C.new
+benchmark:
+  vm_ivar_init_subclass: |
+    b.set_ivars
+    c.set_ivars
+loop_count: 3000000
diff --git a/benchmark/vm_length.yml b/benchmark/vm_length.yml
new file mode 100644
index 0000000000..5fd94e7d86
--- /dev/null
+++ b/benchmark/vm_length.yml
@@ -0,0 +1,8 @@
+prelude: |
+  a = 'abc'
+  b = [1, 2, 3]
+benchmark:
+  vm_length: |
+    a.length
+    b.length
+loop_count: 30000000
diff --git a/benchmark/vm_lvar_cond_set.yml b/benchmark/vm_lvar_cond_set.yml
new file mode 100644
index 0000000000..1845f9d12e
--- /dev/null
+++ b/benchmark/vm_lvar_cond_set.yml
@@ -0,0 +1,8 @@
+benchmark:
+  vm_lvar_cond_set: |
+    a ||= 1
+    b ||= 1
+    c ||= 1
+    d ||= 1
+    nil
+loop_count: 30000000
diff --git a/benchmark/vm_lvar_init.yml b/benchmark/vm_lvar_init.yml
new file mode 100644
index 0000000000..70a9b1c0ca
--- /dev/null
+++ b/benchmark/vm_lvar_init.yml
@@ -0,0 +1,21 @@
+# while loop cost is not removed because `i` is used in the script
+benchmark:
+  vm_lvar_init: |
+    def m v
+      unless v
+        # unreachable code
+        v1 = v2 = v3 = v4 = v5 = v6 = v7 = v8 = v9 = v10 =
+        v11 = v12 = v13 = v14 = v15 = v16 = v17 = v18 = v19 = v20 =
+        v21 = v22 = v23 = v24 = v25 = v26 = v27 = v28 = v29 = v30 =
+        v31 = v32 = v33 = v34 = v35 = v36 = v37 = v38 = v39 = v40 =
+        v41 = v42 = v43 = v44 = v45 = v46 = v47 = v48 = v49 = v50 = 1
+      end
+    end
+
+    i = 0
+
+    while i<30_000_000
+      i += 1
+      m i
+    end
+loop_count: 1
diff --git a/benchmark/vm_lvar_set.yml b/benchmark/vm_lvar_set.yml
new file mode 100644
index 0000000000..f29f763d81
--- /dev/null
+++ b/benchmark/vm_lvar_set.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_lvar_set: |
+    a = b = c = d = e = f = g = h = j = k = l = m = n = o = p = q = r = 1
+loop_count: 30000000
diff --git a/benchmark/vm_method.yml b/benchmark/vm_method.yml
new file mode 100644
index 0000000000..d45e4ec572
--- /dev/null
+++ b/benchmark/vm_method.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def m
+    nil
+  end
+benchmark:
+  vm_method: |
+    m; m; m; m; m; m; m; m;
+loop_count: 6000000
diff --git a/benchmark/vm_method_missing.yml b/benchmark/vm_method_missing.yml
new file mode 100644
index 0000000000..3da456c0bb
--- /dev/null
+++ b/benchmark/vm_method_missing.yml
@@ -0,0 +1,11 @@
+prelude: |
+  class C
+    def method_missing mid
+    end
+  end
+
+  obj = C.new
+benchmark:
+  vm_method_missing: |
+    obj.m; obj.m; obj.m; obj.m; obj.m; obj.m; obj.m; obj.m;
+loop_count: 6000000
diff --git a/benchmark/vm_method_with_block.yml b/benchmark/vm_method_with_block.yml
new file mode 100644
index 0000000000..281a481394
--- /dev/null
+++ b/benchmark/vm_method_with_block.yml
@@ -0,0 +1,8 @@
+prelude: |
+  def m
+    nil
+  end
+benchmark:
+  vm_method_with_block: |
+    m{}; m{}; m{}; m{}; m{}; m{}; m{}; m{};
+loop_count: 6000000
diff --git a/benchmark/vm_module_ann_const_set.yml b/benchmark/vm_module_ann_const_set.yml
new file mode 100644
index 0000000000..243229ba4a
--- /dev/null
+++ b/benchmark/vm_module_ann_const_set.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_module_ann_const_set: |
+    Module.new.const_set(:X, Module.new)
+loop_count: 6000000
diff --git a/benchmark/vm_module_const_set.yml b/benchmark/vm_module_const_set.yml
new file mode 100644
index 0000000000..e5a24181a9
--- /dev/null
+++ b/benchmark/vm_module_const_set.yml
@@ -0,0 +1,8 @@
+prelude: |
+  module M
+  end
+  $VERBOSE = nil
+benchmark:
+  vm_module_const_set: |
+    M.const_set(:X, Module.new)
+loop_count: 6000000
diff --git a/benchmark/vm_mutex.yml b/benchmark/vm_mutex.yml
new file mode 100644
index 0000000000..abcf1e28ce
--- /dev/null
+++ b/benchmark/vm_mutex.yml
@@ -0,0 +1,8 @@
+prelude: |
+  require 'thread'
+
+  m = Thread::Mutex.new
+benchmark:
+  vm_mutex: |
+    m.synchronize{}
+loop_count: 6000000
diff --git a/benchmark/vm_neq.yml b/benchmark/vm_neq.yml
new file mode 100644
index 0000000000..fb04d15ae8
--- /dev/null
+++ b/benchmark/vm_neq.yml
@@ -0,0 +1,7 @@
+prelude: |
+  obj1 = Object.new
+  obj2 = Object.new
+benchmark:
+  vm_neq: |
+    obj1 != obj2
+loop_count: 30000000
diff --git a/benchmark/vm_newlambda.yml b/benchmark/vm_newlambda.yml
new file mode 100644
index 0000000000..0b9787d91a
--- /dev/null
+++ b/benchmark/vm_newlambda.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_newlambda: |
+    lambda {}
+loop_count: 6000000
diff --git a/benchmark/vm_not.yml b/benchmark/vm_not.yml
new file mode 100644
index 0000000000..c68dde3c50
--- /dev/null
+++ b/benchmark/vm_not.yml
@@ -0,0 +1,6 @@
+prelude: |
+  obj = Object.new
+benchmark:
+  vm_not: |
+    !obj
+loop_count: 30000000
diff --git a/benchmark/vm_poly_method.yml b/benchmark/vm_poly_method.yml
new file mode 100644
index 0000000000..dd2f4e71de
--- /dev/null
+++ b/benchmark/vm_poly_method.yml
@@ -0,0 +1,24 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_poly_method: |
+    class C1
+      def m
+        1
+      end
+    end
+    class C2
+      def m
+        2
+      end
+    end
+
+    o1 = C1.new
+    o2 = C2.new
+
+    i = 0
+    while i<6_000_000
+      o = (i % 2 == 0) ? o1 : o2
+      o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/vm_poly_method_ov.yml b/benchmark/vm_poly_method_ov.yml
new file mode 100644
index 0000000000..bca1b62729
--- /dev/null
+++ b/benchmark/vm_poly_method_ov.yml
@@ -0,0 +1,24 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_poly_method_ov: |
+    class C1
+      def m
+        1
+      end
+    end
+    class C2
+      def m
+        2
+      end
+    end
+
+    o1 = C1.new
+    o2 = C2.new
+
+    i = 0
+    while i<6_000_000
+      o = (i % 2 == 0) ? o1 : o2
+    #  o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/vm_poly_same_method.yml b/benchmark/vm_poly_same_method.yml
new file mode 100644
index 0000000000..6c5404ac84
--- /dev/null
+++ b/benchmark/vm_poly_same_method.yml
@@ -0,0 +1,25 @@
+prelude: |
+  module AR; end
+  class AR::Base
+    def create_or_update
+      nil
+    end
+    def save
+      create_or_update
+    end
+  end
+  class Foo < AR::Base; end
+  class Bar < AR::Base; end
+  o1 = Foo.new
+  o2 = Bar.new
+benchmark:
+  vm_poly_same_method: |
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+    o1.save; o2.save;
+loop_count: 6000000
diff --git a/benchmark/vm_poly_singleton.yml b/benchmark/vm_poly_singleton.yml
new file mode 100644
index 0000000000..c7923160fb
--- /dev/null
+++ b/benchmark/vm_poly_singleton.yml
@@ -0,0 +1,18 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_poly_singleton: |
+    class C1
+      def m; 1; end
+    end
+
+    o1 = C1.new
+    o2 = C1.new
+    o2.singleton_class
+
+    i = 0
+    while i<6_000_000 # benchmark loop 2
+      o = (i % 2 == 0) ? o1 : o2
+      o.m; o.m; o.m; o.m; o.m; o.m; o.m; o.m
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/vm_proc.yml b/benchmark/vm_proc.yml
new file mode 100644
index 0000000000..2f8de6c272
--- /dev/null
+++ b/benchmark/vm_proc.yml
@@ -0,0 +1,12 @@
+prelude: |
+  def m &b
+    b
+  end
+
+  pr = m{
+    a = 1
+  }
+benchmark:
+  vm_proc: |
+    pr.call
+loop_count: 6000000
diff --git a/benchmark/vm_raise1.yml b/benchmark/vm_raise1.yml
new file mode 100644
index 0000000000..247d9f70ee
--- /dev/null
+++ b/benchmark/vm_raise1.yml
@@ -0,0 +1,16 @@
+prelude: |
+  def rec n
+    if n > 0
+      rec n-1
+    else
+      raise
+    end
+  end
+benchmark:
+  vm_raise1: |
+    begin
+      rec 1
+    rescue
+      # ignore
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_raise2.yml b/benchmark/vm_raise2.yml
new file mode 100644
index 0000000000..f0fa047b3c
--- /dev/null
+++ b/benchmark/vm_raise2.yml
@@ -0,0 +1,16 @@
+prelude: |
+  def rec n
+    if n > 0
+      rec n-1
+    else
+      raise
+    end
+  end
+benchmark:
+  vm_raise2: |
+    begin
+      rec 10
+    rescue
+      # ignore
+    end
+loop_count: 6000000
diff --git a/benchmark/vm_regexp.yml b/benchmark/vm_regexp.yml
new file mode 100644
index 0000000000..2aa3d94dbd
--- /dev/null
+++ b/benchmark/vm_regexp.yml
@@ -0,0 +1,8 @@
+prelude: |
+  str = 'xxxhogexxx'
+benchmark:
+  vm_regexp: |
+    /hoge/ =~ str
+  vm_regexp_invert: |
+    str =~ /hoge/
+loop_count: 6000000
diff --git a/benchmark/vm_rescue.yml b/benchmark/vm_rescue.yml
new file mode 100644
index 0000000000..b4a0af521f
--- /dev/null
+++ b/benchmark/vm_rescue.yml
@@ -0,0 +1,6 @@
+benchmark:
+  vm_rescue: |
+    begin
+    rescue
+    end
+loop_count: 30000000
diff --git a/benchmark/vm_send.yml b/benchmark/vm_send.yml
new file mode 100644
index 0000000000..f31bc7ac89
--- /dev/null
+++ b/benchmark/vm_send.yml
@@ -0,0 +1,14 @@
+prelude: |
+  class C
+    def m
+    end
+  end
+
+  o = C.new
+  m = :m
+benchmark:
+  vm_send: |
+    o.__send__ :m
+  vm_send_var: |
+    o.__send__ m
+loop_count: 6000000
diff --git a/benchmark/vm_send_cfunc.yml b/benchmark/vm_send_cfunc.yml
new file mode 100644
index 0000000000..b114ac317d
--- /dev/null
+++ b/benchmark/vm_send_cfunc.yml
@@ -0,0 +1,3 @@
+benchmark:
+  vm_send_cfunc: self.class
+loop_count: 100000000
diff --git a/benchmark/vm_simplereturn.yml b/benchmark/vm_simplereturn.yml
new file mode 100644
index 0000000000..c9829cff0b
--- /dev/null
+++ b/benchmark/vm_simplereturn.yml
@@ -0,0 +1,7 @@
+prelude: |
+  def m
+    return 1
+  end
+benchmark:
+  vm_simplereturn: m
+loop_count: 30000000
diff --git a/benchmark/vm_string_literal.yml b/benchmark/vm_string_literal.yml
new file mode 100644
index 0000000000..64439c7980
--- /dev/null
+++ b/benchmark/vm_string_literal.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_string_literal: |
+    x = "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_aref_hi.yml b/benchmark/vm_struct_big_aref_hi.yml
new file mode 100644
index 0000000000..4cf78970cb
--- /dev/null
+++ b/benchmark/vm_struct_big_aref_hi.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_aref_hi: |
+    x.z # x[25]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_aref_lo.yml b/benchmark/vm_struct_big_aref_lo.yml
new file mode 100644
index 0000000000..c91af27fa5
--- /dev/null
+++ b/benchmark/vm_struct_big_aref_lo.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_aref_lo: |
+    x.k # x[10]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_aset.yml b/benchmark/vm_struct_big_aset.yml
new file mode 100644
index 0000000000..69550d14ea
--- /dev/null
+++ b/benchmark/vm_struct_big_aset.yml
@@ -0,0 +1,11 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_struct_big_aset: |
+    s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+    x = s.new
+    i = 0
+    while i<6_000_000
+      i += 1
+      x.k = i # x[10] = i
+    end
+loop_count: 1
diff --git a/benchmark/vm_struct_big_href_hi.yml b/benchmark/vm_struct_big_href_hi.yml
new file mode 100644
index 0000000000..09b764dd13
--- /dev/null
+++ b/benchmark/vm_struct_big_href_hi.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_href_hi: |
+    x[:z]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_href_lo.yml b/benchmark/vm_struct_big_href_lo.yml
new file mode 100644
index 0000000000..d2f00b220f
--- /dev/null
+++ b/benchmark/vm_struct_big_href_lo.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+  x = s.new
+benchmark:
+  vm_struct_big_href_lo: |
+    x[:k]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_big_hset.yml b/benchmark/vm_struct_big_hset.yml
new file mode 100644
index 0000000000..fc45cbee9c
--- /dev/null
+++ b/benchmark/vm_struct_big_hset.yml
@@ -0,0 +1,11 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_struct_big_hset: |
+    s = Struct.new(*('a'..'z').map { |x| x.to_sym })
+    x = s.new
+    i = 0
+    while i<6_000_000
+      i += 1
+      x[:k] = i
+    end
+loop_count: 1
diff --git a/benchmark/vm_struct_small_aref.yml b/benchmark/vm_struct_small_aref.yml
new file mode 100644
index 0000000000..5a83251d1e
--- /dev/null
+++ b/benchmark/vm_struct_small_aref.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(:a, :b, :c)
+  x = s.new
+benchmark:
+  vm_struct_small_aref: |
+    x.a
+loop_count: 6000000
diff --git a/benchmark/vm_struct_small_aset.yml b/benchmark/vm_struct_small_aset.yml
new file mode 100644
index 0000000000..74f435f126
--- /dev/null
+++ b/benchmark/vm_struct_small_aset.yml
@@ -0,0 +1,11 @@
+# loop_count is not utilized since `i` is involved in the script
+benchmark:
+  vm_struct_small_aset: |
+    s = Struct.new(:a, :b, :c)
+    x = s.new
+    i = 0
+    while i<6_000_000
+      i += 1
+      x.a = i
+    end
+loop_count: 1
diff --git a/benchmark/vm_struct_small_href.yml b/benchmark/vm_struct_small_href.yml
new file mode 100644
index 0000000000..6b7d7f39e7
--- /dev/null
+++ b/benchmark/vm_struct_small_href.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(:a, :b, :c)
+  x = s.new
+benchmark:
+  vm_struct_small_href: |
+    x[:a]
+loop_count: 6000000
diff --git a/benchmark/vm_struct_small_hset.yml b/benchmark/vm_struct_small_hset.yml
new file mode 100644
index 0000000000..5d43b150de
--- /dev/null
+++ b/benchmark/vm_struct_small_hset.yml
@@ -0,0 +1,7 @@
+prelude: |
+  s = Struct.new(:a, :b, :c)
+  x = s.new
+benchmark:
+  vm_struct_small_hset: |
+    x[:a] = 1
+loop_count: 6000000
diff --git a/benchmark/vm_super.yml b/benchmark/vm_super.yml
new file mode 100644
index 0000000000..0d1e965c6e
--- /dev/null
+++ b/benchmark/vm_super.yml
@@ -0,0 +1,17 @@
+prelude: |
+  class C
+    def m
+      1
+    end
+  end
+
+  class CC < C
+    def m
+      super()
+    end
+  end
+
+  obj = CC.new
+benchmark:
+  vm_super: obj.m
+loop_count: 6000000
diff --git a/benchmark/vm_swap.yml b/benchmark/vm_swap.yml
new file mode 100644
index 0000000000..e824a65e0a
--- /dev/null
+++ b/benchmark/vm_swap.yml
@@ -0,0 +1,7 @@
+prelude: |
+  a = 1
+  b = 2
+benchmark:
+  vm_swap: |
+    a, b = b, a
+loop_count: 30000000
diff --git a/benchmark/vm_symbol_block_pass.rb b/benchmark/vm_symbol_block_pass.rb
new file mode 100644
index 0000000000..1d433353e1
--- /dev/null
+++ b/benchmark/vm_symbol_block_pass.rb
@@ -0,0 +1,13 @@
+class C
+  1000.times {|i|
+    eval("def i#{i};end")
+  }
+end
+
+c = C.new
+m = C.instance_methods(false)
+5_000.times do
+  m.each do |n|
+    c.tap(&n)
+  end
+end
diff --git a/benchmark/vm_thread_alive_check.yml b/benchmark/vm_thread_alive_check.yml
new file mode 100644
index 0000000000..d21737d3e8
--- /dev/null
+++ b/benchmark/vm_thread_alive_check.yml
@@ -0,0 +1,8 @@
+benchmark:
+  vm_thread_alive_check: |
+    t = Thread.new{}
+    while t.alive?
+      Thread.pass
+    end
+loop_count: 50_000
+
diff --git a/benchmark/vm_thread_close.rb b/benchmark/vm_thread_close.rb
new file mode 100644
index 0000000000..3e9a265ce8
--- /dev/null
+++ b/benchmark/vm_thread_close.rb
@@ -0,0 +1,6 @@
+1000.times { Thread.new { sleep } }
+i = 0
+while i<100_000 # benchmark loop 3
+  i += 1
+  IO.pipe.each(&:close)
+end
diff --git a/benchmark/vm_thread_condvar1.rb b/benchmark/vm_thread_condvar1.rb
new file mode 100644
index 0000000000..feed27c3ad
--- /dev/null
+++ b/benchmark/vm_thread_condvar1.rb
@@ -0,0 +1,28 @@
+# two threads, two mutex, two condvar ping-pong
+require 'thread'
+m1 = Thread::Mutex.new
+m2 = Thread::Mutex.new
+cv1 = Thread::ConditionVariable.new
+cv2 = Thread::ConditionVariable.new
+max = 100000
+i = 0
+wait = nil
+m2.synchronize do
+  wait = Thread.new do
+    m1.synchronize do
+      m2.synchronize { cv2.signal }
+      while (i += 1) < max
+        cv1.wait(m1)
+        cv2.signal
+      end
+    end
+  end
+  cv2.wait(m2)
+end
+m1.synchronize do
+  while i < max
+    cv1.signal
+    cv2.wait(m1)
+  end
+end
+wait.join
diff --git a/benchmark/vm_thread_condvar2.rb b/benchmark/vm_thread_condvar2.rb
new file mode 100644
index 0000000000..6590c4134b
--- /dev/null
+++ b/benchmark/vm_thread_condvar2.rb
@@ -0,0 +1,35 @@
+# many threads, one mutex, many condvars
+require 'thread'
+m = Thread::Mutex.new
+cv1 = Thread::ConditionVariable.new
+cv2 = Thread::ConditionVariable.new
+max = 1000
+n = 100
+waiting = 0
+scvs = []
+waiters = n.times.map do |i|
+  start_cv = Thread::ConditionVariable.new
+  scvs << start_cv
+  start_mtx = Thread::Mutex.new
+  start_mtx.synchronize do
+    th = Thread.new(start_mtx, start_cv) do |sm, scv|
+      m.synchronize do
+        sm.synchronize { scv.signal }
+        max.times do
+          cv2.signal if (waiting += 1) == n
+          cv1.wait(m)
+        end
+      end
+    end
+    start_cv.wait(start_mtx)
+    th
+  end
+end
+m.synchronize do
+  max.times do
+    cv2.wait(m) until waiting == n
+    waiting = 0
+    cv1.broadcast
+  end
+end
+waiters.each(&:join)
diff --git a/benchmark/vm_thread_create_join.rb b/benchmark/vm_thread_create_join.rb
new file mode 100644
index 0000000000..393cd45df9
--- /dev/null
+++ b/benchmark/vm_thread_create_join.rb
@@ -0,0 +1,6 @@
+i = 0
+while i<100_000 # benchmark loop 3
+  i += 1
+  Thread.new{
+  }.join
+end
diff --git a/benchmark/vm_thread_mutex1.rb b/benchmark/vm_thread_mutex1.rb
new file mode 100644
index 0000000000..66e42c85e1
--- /dev/null
+++ b/benchmark/vm_thread_mutex1.rb
@@ -0,0 +1,21 @@
+# one thread, one mutex (no contention)
+
+require 'thread'
+m = Thread::Mutex.new
+r = 0
+max = 2000
+lmax = max * max
+(1..1).map{
+  Thread.new{
+    i = 0
+    while i<lmax
+      i += 1
+      m.synchronize{
+        r += 1
+      }
+    end
+  }
+}.each{|e|
+  e.join
+}
+raise r.to_s if r != max * max
diff --git a/benchmark/vm_thread_mutex2.rb b/benchmark/vm_thread_mutex2.rb
new file mode 100644
index 0000000000..6e6c804c31
--- /dev/null
+++ b/benchmark/vm_thread_mutex2.rb
@@ -0,0 +1,21 @@
+# two threads, one mutex
+
+require 'thread'
+m = Thread::Mutex.new
+r = 0
+max = 2000
+lmax = (max * max)/2
+(1..2).map{
+  Thread.new{
+    i = 0
+    while i<lmax
+      i += 1
+      m.synchronize{
+        r += 1
+      }
+    end
+  }
+}.each{|e|
+  e.join
+}
+raise r.to_s if r != max * max
diff --git a/benchmark/vm_thread_mutex3.rb b/benchmark/vm_thread_mutex3.rb
new file mode 100644
index 0000000000..c750dc542a
--- /dev/null
+++ b/benchmark/vm_thread_mutex3.rb
@@ -0,0 +1,20 @@
+# 1000 threads, one mutex
+
+require 'thread'
+m = Thread::Mutex.new
+r = 0
+max = 2000
+(1..max).map{
+  Thread.new{
+    i = 0
+    while i<max
+      i += 1
+      m.synchronize{
+        r += 1
+      }
+    end
+  }
+}.each{|e|
+  e.join
+}
+raise r.to_s if r != max * max
diff --git a/benchmark/vm_thread_pass.rb b/benchmark/vm_thread_pass.rb
new file mode 100644
index 0000000000..438bd08d45
--- /dev/null
+++ b/benchmark/vm_thread_pass.rb
@@ -0,0 +1,15 @@
+# Plenty Thread.pass
+# A performance may depend on GVL implementation.
+
+tmax = (ARGV.shift || 8).to_i
+lmax = 400_000 / tmax
+
+(1..tmax).map{
+  Thread.new{
+    lmax.times{
+      Thread.pass
+    }
+  }
+}.each{|t| t.join}
+
+
diff --git a/benchmark/vm_thread_pass_flood.rb b/benchmark/vm_thread_pass_flood.rb
new file mode 100644
index 0000000000..65df8e6154
--- /dev/null
+++ b/benchmark/vm_thread_pass_flood.rb
@@ -0,0 +1,10 @@
+# n.b. this is a good test for GVL when pinned to a single CPU
+
+5_000.times{
+  Thread.new{loop{Thread.pass}}
+}
+
+i = 0
+while i<10_000
+  i += 1
+end
diff --git a/benchmark/vm_thread_pipe.rb b/benchmark/vm_thread_pipe.rb
new file mode 100644
index 0000000000..112a621905
--- /dev/null
+++ b/benchmark/vm_thread_pipe.rb
@@ -0,0 +1,17 @@
+# Measure small and plenty pipe read/write.
+# A performance may depend on GVL implementation.
+
+lmax = 100_000
+r, w = IO.pipe
+[Thread.new{
+  lmax.times{
+    w.write('a')
+  }
+  p "w:exit"
+}, Thread.new{
+  lmax.times{
+    r.read(1)
+  }
+  p "r:exit"
+}].each{|t| t.join}
+
diff --git a/benchmark/vm_thread_queue.rb b/benchmark/vm_thread_queue.rb
new file mode 100644
index 0000000000..1dd3696a3c
--- /dev/null
+++ b/benchmark/vm_thread_queue.rb
@@ -0,0 +1,18 @@
+require 'thread'
+
+n = 10_000_000
+q = Thread::Queue.new
+consumer = Thread.new{
+  while q.pop
+    # consuming
+  end
+}
+
+producer = Thread.new{
+  n.times{
+    q.push true
+  }
+  q.push nil
+}
+
+consumer.join
diff --git a/benchmark/vm_thread_sized_queue.rb b/benchmark/vm_thread_sized_queue.rb
new file mode 100644
index 0000000000..7b9af5482b
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue.rb
@@ -0,0 +1,20 @@
+require 'thread'
+# on producer, one consumer
+
+n = 1_000_000
+q = Thread::SizedQueue.new(100)
+consumer = Thread.new{
+  while q.pop
+    # consuming
+  end
+}
+
+producer = Thread.new{
+  while n > 0
+    q.push true
+    n -= 1
+  end
+  q.push nil
+}
+
+consumer.join
diff --git a/benchmark/vm_thread_sized_queue2.rb b/benchmark/vm_thread_sized_queue2.rb
new file mode 100644
index 0000000000..de9f55e978
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue2.rb
@@ -0,0 +1,23 @@
+require 'thread'
+# one producer, many consumers
+n = 1_000_000
+m = 10
+q = Thread::SizedQueue.new(100)
+consumers = m.times.map do
+  Thread.new do
+    while q.pop
+      # consuming
+    end
+  end
+end
+
+producer = Thread.new do
+  while n > 0
+    q.push true
+    n -= 1
+  end
+  m.times { q.push nil }
+end
+
+producer.join
+consumers.each(&:join)
diff --git a/benchmark/vm_thread_sized_queue3.rb b/benchmark/vm_thread_sized_queue3.rb
new file mode 100644
index 0000000000..ce5f1796d8
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue3.rb
@@ -0,0 +1,22 @@
+require 'thread'
+# many producers, one consumer
+n = 1_000_000
+m = 10
+q = Thread::SizedQueue.new(100)
+consumer = Thread.new do
+  while q.pop
+    # consuming
+  end
+end
+
+producers = m.times.map do
+  Thread.new do
+    while n > 0
+      q.push true
+      n -= 1
+    end
+  end
+end
+producers.each(&:join)
+q.push nil
+consumer.join
diff --git a/benchmark/vm_thread_sized_queue4.rb b/benchmark/vm_thread_sized_queue4.rb
new file mode 100644
index 0000000000..a9b7d80ec0
--- /dev/null
+++ b/benchmark/vm_thread_sized_queue4.rb
@@ -0,0 +1,26 @@
+require 'thread'
+# many producers, many consumers
+nr = 1_000_000
+n = 10
+m = 10
+q = Thread::SizedQueue.new(100)
+consumers = n.times.map do
+  Thread.new do
+    while q.pop
+      # consuming
+    end
+  end
+end
+
+producers = m.times.map do
+  Thread.new do
+    while nr > 0
+      q.push true
+      nr -= 1
+    end
+  end
+end
+
+producers.each(&:join)
+n.times { q.push nil }
+consumers.each(&:join)
diff --git a/benchmark/vm_thread_sleep.yml b/benchmark/vm_thread_sleep.yml
new file mode 100644
index 0000000000..96901d8466
--- /dev/null
+++ b/benchmark/vm_thread_sleep.yml
@@ -0,0 +1,4 @@
+benchmark:
+  vm_thread_sleep: |
+    Thread.new { sleep }
+loop_count: 10_000
diff --git a/benchmark/vm_unif1.yml b/benchmark/vm_unif1.yml
new file mode 100644
index 0000000000..04187bb0e2
--- /dev/null
+++ b/benchmark/vm_unif1.yml
@@ -0,0 +1,7 @@
+prelude: |
+  def m a, b
+  end
+benchmark:
+  vm_unif1: |
+    m 100, 200
+loop_count: 6000000
diff --git a/benchmark/vm_yield.yml b/benchmark/vm_yield.yml
new file mode 100644
index 0000000000..230be3d84f
--- /dev/null
+++ b/benchmark/vm_yield.yml
@@ -0,0 +1,13 @@
+# while loop cost is not removed due to benchmark_driver.gem's limitation
+benchmark:
+  vm_yield: |
+    def m
+      i = 0
+      while i<30_000_000
+        i += 1
+        yield
+      end
+    end
+
+    m{}
+loop_count: 1
diff --git a/benchmark/vm_zsuper.yml b/benchmark/vm_zsuper.yml
new file mode 100644
index 0000000000..bfb5837578
--- /dev/null
+++ b/benchmark/vm_zsuper.yml
@@ -0,0 +1,18 @@
+prelude: |
+  class C
+    def m a
+      1
+    end
+  end
+
+  class CC < C
+    def m a
+      super
+    end
+  end
+
+  obj = CC.new
+benchmark:
+  vm_zsuper: |
+    obj.m 10
+loop_count: 6000000
diff --git a/benchmark/wc.input.base b/benchmark/wc.input.base
deleted file mode 100644
index 41143fbac0..0000000000
--- a/benchmark/wc.input.base
+++ /dev/null
@@ -1,25 +0,0 @@
-Subject:      Re: Who was Izchak Miller?
-From:         "Jane D. Anonymous" <nobody@yale.edu>
-Date:         1996/04/28
-Message-Id:   <4lv7bc$oh@news.ycc.yale.edu>
-References:   <317C405E.5DFA@panix.com> <4lk6vl$gde@ns.oar.net>
-To:           75176.2330@compuserve.com
-Content-Type: text/plain; charset=us-ascii
-Organization: Yale University
-X-Url:        news:4lk6vl$gde@ns.oar.net
-Mime-Version: 1.0
-Newsgroups:   rec.games.roguelike.nethack
-X-Mailer:     Mozilla 1.1N (Macintosh; I; 68K)
-
-Hello there, Izchak Miller was my father.  When I was younger I spent 
-many a night, hunched over the keyboard with a cup of tea, playing 
-nethack with him and my brother.  my dad was a philosopher with a strong 
-weakness for fantasy/sci fi.  I remember when he started to get involved 
-with the Nethack team- my brother's Dungeons and Dragons monster book 
-found a regular place beside my dad's desk. it's nice to see him living 
-on in the game he loved so much :-).  
-                                                                  Tamar Miller
-
-The following is a really long word of 5000 characters:
-
-wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww
diff --git a/bignum.c b/bignum.c
index 678a65bba7..cb2c3b6f07 100644
--- a/bignum.c
+++ b/bignum.c
@@ -9,80 +9,2940 @@
 
 **********************************************************************/
 
-#include "ruby/ruby.h"
-#include "ruby/util.h"
-#include "internal.h"
+#include "ruby/internal/config.h"
 
-#include <math.h>
-#include <float.h>
 #include <ctype.h>
+#include <float.h>
+#include <math.h>
+
+#ifdef HAVE_STRINGS_H
+# include <strings.h>
+#endif
+
 #ifdef HAVE_IEEEFP_H
-#include <ieeefp.h>
+# include <ieeefp.h>
+#endif
+
+#if !defined(USE_GMP)
+#if defined(HAVE_LIBGMP) && defined(HAVE_GMP_H)
+# define USE_GMP 1
+#else
+# define USE_GMP 0
+#endif
 #endif
-#include <assert.h>
+#if USE_GMP
+# include <gmp.h>
+#endif
+
+#include "id.h"
+#include "internal.h"
+#include "internal/bignum.h"
+#include "internal/complex.h"
+#include "internal/gc.h"
+#include "internal/numeric.h"
+#include "internal/object.h"
+#include "internal/sanitizers.h"
+#include "internal/variable.h"
+#include "internal/warnings.h"
+#include "ruby/thread.h"
+#include "ruby/util.h"
+#include "ruby_assert.h"
 
-VALUE rb_cBignum;
+const char ruby_digitmap[] = "0123456789abcdefghijklmnopqrstuvwxyz";
 
-static VALUE big_three = Qnil;
+#ifndef SIZEOF_BDIGIT_DBL
+# if SIZEOF_INT*2 <= SIZEOF_LONG_LONG
+#  define SIZEOF_BDIGIT_DBL SIZEOF_LONG_LONG
+# else
+#  define SIZEOF_BDIGIT_DBL SIZEOF_LONG
+# endif
+#endif
 
-#if defined __MINGW32__
-#define USHORT _USHORT
+STATIC_ASSERT(sizeof_bdigit_dbl, sizeof(BDIGIT_DBL) == SIZEOF_BDIGIT_DBL);
+STATIC_ASSERT(sizeof_bdigit_dbl_signed, sizeof(BDIGIT_DBL_SIGNED) == SIZEOF_BDIGIT_DBL);
+STATIC_ASSERT(sizeof_bdigit, SIZEOF_BDIGIT <= sizeof(BDIGIT));
+STATIC_ASSERT(sizeof_bdigit_and_dbl, SIZEOF_BDIGIT*2 <= SIZEOF_BDIGIT_DBL);
+STATIC_ASSERT(bdigit_signedness, 0 < (BDIGIT)-1);
+STATIC_ASSERT(bdigit_dbl_signedness, 0 < (BDIGIT_DBL)-1);
+STATIC_ASSERT(bdigit_dbl_signed_signedness, 0 > (BDIGIT_DBL_SIGNED)-1);
+STATIC_ASSERT(rbignum_embed_len_max, BIGNUM_EMBED_LEN_MAX <= (BIGNUM_EMBED_LEN_MASK >> BIGNUM_EMBED_LEN_SHIFT));
+
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_LONG % SIZEOF_BDIGIT == 0);
+#else
+STATIC_ASSERT(sizeof_long_and_sizeof_bdigit, SIZEOF_BDIGIT % SIZEOF_LONG == 0);
 #endif
 
-#define BDIGITS(x) (RBIGNUM_DIGITS(x))
-#define BITSPERDIG (SIZEOF_BDIGITS*CHAR_BIT)
+#ifdef WORDS_BIGENDIAN
+#   define HOST_BIGENDIAN_P 1
+#else
+#   define HOST_BIGENDIAN_P 0
+#endif
+/* (!LSHIFTABLE(d, n) ? 0 : (n)) is the same as n but suppress a warning, C4293, by Visual Studio.  */
+#define LSHIFTABLE(d, n) ((n) < sizeof(d) * CHAR_BIT)
+#define LSHIFTX(d, n) (!LSHIFTABLE(d, n) ? 0 : ((d) << (!LSHIFTABLE(d, n) ? 0 : (n))))
+#define CLEAR_LOWBITS(d, numbits) ((d) & LSHIFTX(~((d)*0), (numbits)))
+#define FILL_LOWBITS(d, numbits) ((d) | (LSHIFTX(((d)*0+1), (numbits))-1))
+#define POW2_P(x) (((x)&((x)-1))==0)
+
+#define BDIGITS(x) (BIGNUM_DIGITS(x))
+#define BITSPERDIG (SIZEOF_BDIGIT*CHAR_BIT)
 #define BIGRAD ((BDIGIT_DBL)1 << BITSPERDIG)
 #define BIGRAD_HALF ((BDIGIT)(BIGRAD >> 1))
-#define DIGSPERLONG (SIZEOF_LONG/SIZEOF_BDIGITS)
-#if HAVE_LONG_LONG
-# define DIGSPERLL (SIZEOF_LONG_LONG/SIZEOF_BDIGITS)
-#endif
-#define BIGUP(x) ((BDIGIT_DBL)(x) << BITSPERDIG)
+#define BDIGIT_MSB(d) (((d) & BIGRAD_HALF) != 0)
+#define BIGUP(x) LSHIFTX(((x) + (BDIGIT_DBL)0), BITSPERDIG)
 #define BIGDN(x) RSHIFT((x),BITSPERDIG)
-#define BIGLO(x) ((BDIGIT)((x) & (BIGRAD-1)))
-#define BDIGMAX ((BDIGIT)-1)
+#define BIGLO(x) ((BDIGIT)((x) & BDIGMAX))
+#define BDIGMAX ((BDIGIT)(BIGRAD-1))
+#define BDIGIT_DBL_MAX (~(BDIGIT_DBL)0)
+
+#if SIZEOF_BDIGIT == 2
+#   define swap_bdigit(x) swap16(x)
+#elif SIZEOF_BDIGIT == 4
+#   define swap_bdigit(x) swap32(x)
+#elif SIZEOF_BDIGIT == 8
+#   define swap_bdigit(x) swap64(x)
+#endif
+
+#define BIGZEROP(x) (BIGNUM_LEN(x) == 0 || \
+                     (BDIGITS(x)[0] == 0 && \
+                      (BIGNUM_LEN(x) == 1 || bigzero_p(x))))
+#define BIGSIZE(x) (BIGNUM_LEN(x) == 0 ? (size_t)0 : \
+    BDIGITS(x)[BIGNUM_LEN(x)-1] ? \
+        (size_t)(BIGNUM_LEN(x)*SIZEOF_BDIGIT - nlz(BDIGITS(x)[BIGNUM_LEN(x)-1])/CHAR_BIT) : \
+    rb_absint_size(x, NULL))
+
+#define BIGDIVREM_EXTRA_WORDS 1
+#define bdigit_roomof(n) roomof(n, SIZEOF_BDIGIT)
+#define BARY_ARGS(ary) ary, numberof(ary)
+
+#define BARY_ADD(z, x, y) bary_add(BARY_ARGS(z), BARY_ARGS(x), BARY_ARGS(y))
+#define BARY_SUB(z, x, y) bary_sub(BARY_ARGS(z), BARY_ARGS(x), BARY_ARGS(y))
+#define BARY_SHORT_MUL(z, x, y) bary_short_mul(BARY_ARGS(z), BARY_ARGS(x), BARY_ARGS(y))
+#define BARY_DIVMOD(q, r, x, y) bary_divmod(BARY_ARGS(q), BARY_ARGS(r), BARY_ARGS(x), BARY_ARGS(y))
+#define BARY_ZERO_P(x) bary_zero_p(BARY_ARGS(x))
+
+#define BIGNUM_SET_NEGATIVE_SIGN(b) BIGNUM_SET_SIGN(b, 0)
+#define BIGNUM_SET_POSITIVE_SIGN(b) BIGNUM_SET_SIGN(b, 1)
+
+#define bignew(len,sign) bignew_1(rb_cInteger,(len),(sign))
+
+#define BDIGITS_ZERO(ptr, n) do { \
+  BDIGIT *bdigitz_zero_ptr = (ptr); \
+  size_t bdigitz_zero_n = (n); \
+  while (bdigitz_zero_n) { \
+    *bdigitz_zero_ptr++ = 0; \
+    bdigitz_zero_n--; \
+  } \
+} while (0)
+
+#define BARY_TRUNC(ds, n) do { \
+        while (0 < (n) && (ds)[(n)-1] == 0) \
+            (n)--; \
+    } while (0)
+
+#define KARATSUBA_BALANCED(xn, yn) ((yn)/2 < (xn))
+#define TOOM3_BALANCED(xn, yn) (((yn)+2)/3 * 2 < (xn))
+
+#define GMP_MUL_DIGITS 20
+#define KARATSUBA_MUL_DIGITS 70
+#define TOOM3_MUL_DIGITS 150
+
+#define GMP_DIV_DIGITS 20
+#define GMP_BIG2STR_DIGITS 20
+#define GMP_STR2BIG_DIGITS 20
+#if USE_GMP
+# define NAIVE_MUL_DIGITS GMP_MUL_DIGITS
+#else
+# define NAIVE_MUL_DIGITS KARATSUBA_MUL_DIGITS
+#endif
+
+typedef void (mulfunc_t)(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn);
+
+static mulfunc_t bary_mul_toom3_start;
+static mulfunc_t bary_mul_karatsuba_start;
+static BDIGIT bigdivrem_single(BDIGIT *qds, const BDIGIT *xds, size_t xn, BDIGIT y);
+
+static VALUE bignew_1(VALUE klass, size_t len, int sign);
+static inline VALUE bigtrunc(VALUE x);
+
+static VALUE bigsq(VALUE x);
+static inline VALUE power_cache_get_power(int base, int power_level, size_t *numdigits_ret);
+
+#if SIZEOF_BDIGIT <= SIZEOF_INT
+static int nlz(BDIGIT x) { return nlz_int((unsigned int)x) - (SIZEOF_INT-SIZEOF_BDIGIT) * CHAR_BIT; }
+#elif SIZEOF_BDIGIT <= SIZEOF_LONG
+static int nlz(BDIGIT x) { return nlz_long((unsigned long)x) - (SIZEOF_LONG-SIZEOF_BDIGIT) * CHAR_BIT; }
+#elif SIZEOF_BDIGIT <= SIZEOF_LONG_LONG
+static int nlz(BDIGIT x) { return nlz_long_long((unsigned LONG_LONG)x) - (SIZEOF_LONG_LONG-SIZEOF_BDIGIT) * CHAR_BIT; }
+#elif SIZEOF_BDIGIT <= SIZEOF_INT128_T
+static int nlz(BDIGIT x) { return nlz_int128((uint128_t)x) - (SIZEOF_INT128_T-SIZEOF_BDIGIT) * CHAR_BIT; }
+#endif
+
+#define U16(a) ((uint16_t)(a))
+#define U32(a) ((uint32_t)(a))
+#ifdef HAVE_UINT64_T
+#define U64(a,b) (((uint64_t)(a) << 32) | (b))
+#endif
+#ifdef HAVE_UINT128_T
+#define U128(a,b,c,d) (((uint128_t)U64(a,b) << 64) | U64(c,d))
+#endif
+
+/* The following script, maxpow.rb, generates the tables follows.
+
+def big(n, bits)
+  ns = []
+  ((bits+31)/32).times {
+    ns << sprintf("0x%08x", n & 0xffff_ffff)
+    n >>= 32
+  }
+  "U#{bits}(" + ns.reverse.join(",") + ")"
+end
+def values(ary, width, indent)
+  lines = [""]
+  ary.each {|e|
+    lines << "" if !ary.last.empty? && width < (lines.last + e + ", ").length
+    lines.last << e + ", "
+  }
+  lines.map {|line| " " * indent + line.chomp(" ") + "\n" }.join
+end
+[16,32,64,128].each {|bits|
+  max = 2**bits-1
+  exps = []
+  nums = []
+  2.upto(36) {|base|
+    exp = 0
+    n = 1
+    while n * base <= max
+      exp += 1
+      n *= base
+    end
+    exps << exp.to_s
+    nums << big(n, bits)
+  }
+  puts "#ifdef HAVE_UINT#{bits}_T"
+  puts "static const int maxpow#{bits}_exp[35] = {"
+  print values(exps, 70, 4)
+  puts "};"
+  puts "static const uint#{bits}_t maxpow#{bits}_num[35] = {"
+  print values(nums, 70, 4)
+  puts "};"
+  puts "#endif"
+}
+
+ */
+
+#if SIZEOF_BDIGIT_DBL == 2
+static const int maxpow16_exp[35] = {
+    15, 10, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3,
+    3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+};
+static const uint16_t maxpow16_num[35] = {
+    U16(0x00008000), U16(0x0000e6a9), U16(0x00004000), U16(0x00003d09),
+    U16(0x0000b640), U16(0x000041a7), U16(0x00008000), U16(0x0000e6a9),
+    U16(0x00002710), U16(0x00003931), U16(0x00005100), U16(0x00006f91),
+    U16(0x00009610), U16(0x0000c5c1), U16(0x00001000), U16(0x00001331),
+    U16(0x000016c8), U16(0x00001acb), U16(0x00001f40), U16(0x0000242d),
+    U16(0x00002998), U16(0x00002f87), U16(0x00003600), U16(0x00003d09),
+    U16(0x000044a8), U16(0x00004ce3), U16(0x000055c0), U16(0x00005f45),
+    U16(0x00006978), U16(0x0000745f), U16(0x00008000), U16(0x00008c61),
+    U16(0x00009988), U16(0x0000a77b), U16(0x0000b640),
+};
+#elif SIZEOF_BDIGIT_DBL == 4
+static const int maxpow32_exp[35] = {
+    31, 20, 15, 13, 12, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7,
+    7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
+};
+static const uint32_t maxpow32_num[35] = {
+    U32(0x80000000), U32(0xcfd41b91), U32(0x40000000), U32(0x48c27395),
+    U32(0x81bf1000), U32(0x75db9c97), U32(0x40000000), U32(0xcfd41b91),
+    U32(0x3b9aca00), U32(0x8c8b6d2b), U32(0x19a10000), U32(0x309f1021),
+    U32(0x57f6c100), U32(0x98c29b81), U32(0x10000000), U32(0x18754571),
+    U32(0x247dbc80), U32(0x3547667b), U32(0x4c4b4000), U32(0x6b5a6e1d),
+    U32(0x94ace180), U32(0xcaf18367), U32(0x0b640000), U32(0x0e8d4a51),
+    U32(0x1269ae40), U32(0x17179149), U32(0x1cb91000), U32(0x23744899),
+    U32(0x2b73a840), U32(0x34e63b41), U32(0x40000000), U32(0x4cfa3cc1),
+    U32(0x5c13d840), U32(0x6d91b519), U32(0x81bf1000),
+};
+#elif SIZEOF_BDIGIT_DBL == 8 && defined HAVE_UINT64_T
+static const int maxpow64_exp[35] = {
+    63, 40, 31, 27, 24, 22, 21, 20, 19, 18, 17, 17, 16, 16, 15, 15, 15,
+    15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12,
+    12,
+};
+static const uint64_t maxpow64_num[35] = {
+    U64(0x80000000,0x00000000), U64(0xa8b8b452,0x291fe821),
+    U64(0x40000000,0x00000000), U64(0x6765c793,0xfa10079d),
+    U64(0x41c21cb8,0xe1000000), U64(0x36427987,0x50226111),
+    U64(0x80000000,0x00000000), U64(0xa8b8b452,0x291fe821),
+    U64(0x8ac72304,0x89e80000), U64(0x4d28cb56,0xc33fa539),
+    U64(0x1eca170c,0x00000000), U64(0x780c7372,0x621bd74d),
+    U64(0x1e39a505,0x7d810000), U64(0x5b27ac99,0x3df97701),
+    U64(0x10000000,0x00000000), U64(0x27b95e99,0x7e21d9f1),
+    U64(0x5da0e1e5,0x3c5c8000), U64(0xd2ae3299,0xc1c4aedb),
+    U64(0x16bcc41e,0x90000000), U64(0x2d04b7fd,0xd9c0ef49),
+    U64(0x5658597b,0xcaa24000), U64(0xa0e20737,0x37609371),
+    U64(0x0c29e980,0x00000000), U64(0x14adf4b7,0x320334b9),
+    U64(0x226ed364,0x78bfa000), U64(0x383d9170,0xb85ff80b),
+    U64(0x5a3c23e3,0x9c000000), U64(0x8e651373,0x88122bcd),
+    U64(0xdd41bb36,0xd259e000), U64(0x0aee5720,0xee830681),
+    U64(0x10000000,0x00000000), U64(0x172588ad,0x4f5f0981),
+    U64(0x211e44f7,0xd02c1000), U64(0x2ee56725,0xf06e5c71),
+    U64(0x41c21cb8,0xe1000000),
+};
+#elif SIZEOF_BDIGIT_DBL == 16 && defined HAVE_UINT128_T
+static const int maxpow128_exp[35] = {
+    127, 80, 63, 55, 49, 45, 42, 40, 38, 37, 35, 34, 33, 32, 31, 31, 30,
+    30, 29, 29, 28, 28, 27, 27, 27, 26, 26, 26, 26, 25, 25, 25, 25, 24,
+    24,
+};
+static const uint128_t maxpow128_num[35] = {
+    U128(0x80000000,0x00000000,0x00000000,0x00000000),
+    U128(0x6f32f1ef,0x8b18a2bc,0x3cea5978,0x9c79d441),
+    U128(0x40000000,0x00000000,0x00000000,0x00000000),
+    U128(0xd0cf4b50,0xcfe20765,0xfff4b4e3,0xf741cf6d),
+    U128(0x6558e2a0,0x921fe069,0x42860000,0x00000000),
+    U128(0x5080c7b7,0xd0e31ba7,0x5911a67d,0xdd3d35e7),
+    U128(0x40000000,0x00000000,0x00000000,0x00000000),
+    U128(0x6f32f1ef,0x8b18a2bc,0x3cea5978,0x9c79d441),
+    U128(0x4b3b4ca8,0x5a86c47a,0x098a2240,0x00000000),
+    U128(0xffd1390a,0x0adc2fb8,0xdabbb817,0x4d95c99b),
+    U128(0x2c6fdb36,0x4c25e6c0,0x00000000,0x00000000),
+    U128(0x384bacd6,0x42c343b4,0xe90c4272,0x13506d29),
+    U128(0x31f5db32,0xa34aced6,0x0bf13a0e,0x00000000),
+    U128(0x20753ada,0xfd1e839f,0x53686d01,0x3143ee01),
+    U128(0x10000000,0x00000000,0x00000000,0x00000000),
+    U128(0x68ca11d6,0xb4f6d1d1,0xfaa82667,0x8073c2f1),
+    U128(0x223e493b,0xb3bb69ff,0xa4b87d6c,0x40000000),
+    U128(0xad62418d,0x14ea8247,0x01c4b488,0x6cc66f59),
+    U128(0x2863c1f5,0xcdae42f9,0x54000000,0x00000000),
+    U128(0xa63fd833,0xb9386b07,0x36039e82,0xbe651b25),
+    U128(0x1d1f7a9c,0xd087a14d,0x28cdf3d5,0x10000000),
+    U128(0x651b5095,0xc2ea8fc1,0xb30e2c57,0x77aaf7e1),
+    U128(0x0ddef20e,0xff760000,0x00000000,0x00000000),
+    U128(0x29c30f10,0x29939b14,0x6664242d,0x97d9f649),
+    U128(0x786a435a,0xe9558b0e,0x6aaf6d63,0xa8000000),
+    U128(0x0c5afe6f,0xf302bcbf,0x94fd9829,0xd87f5079),
+    U128(0x1fce575c,0xe1692706,0x07100000,0x00000000),
+    U128(0x4f34497c,0x8597e144,0x36e91802,0x00528229),
+    U128(0xbf3a8e1d,0x41ef2170,0x7802130d,0x84000000),
+    U128(0x0e7819e1,0x7f1eb0fb,0x6ee4fb89,0x01d9531f),
+    U128(0x20000000,0x00000000,0x00000000,0x00000000),
+    U128(0x4510460d,0xd9e879c0,0x14a82375,0x2f22b321),
+    U128(0x91abce3c,0x4b4117ad,0xe76d35db,0x22000000),
+    U128(0x08973ea3,0x55d75bc2,0x2e42c391,0x727d69e1),
+    U128(0x10e425c5,0x6daffabc,0x35c10000,0x00000000),
+};
+#endif
+
+static BDIGIT_DBL
+maxpow_in_bdigit_dbl(int base, int *exp_ret)
+{
+    BDIGIT_DBL maxpow;
+    int exponent;
+
+    assert(2 <= base && base <= 36);
+
+    {
+#if SIZEOF_BDIGIT_DBL == 2
+        maxpow = maxpow16_num[base-2];
+        exponent = maxpow16_exp[base-2];
+#elif SIZEOF_BDIGIT_DBL == 4
+        maxpow = maxpow32_num[base-2];
+        exponent = maxpow32_exp[base-2];
+#elif SIZEOF_BDIGIT_DBL == 8 && defined HAVE_UINT64_T
+        maxpow = maxpow64_num[base-2];
+        exponent = maxpow64_exp[base-2];
+#elif SIZEOF_BDIGIT_DBL == 16 && defined HAVE_UINT128_T
+        maxpow = maxpow128_num[base-2];
+        exponent = maxpow128_exp[base-2];
+#else
+        maxpow = base;
+        exponent = 1;
+        while (maxpow <= BDIGIT_DBL_MAX / base) {
+            maxpow *= base;
+            exponent++;
+        }
+#endif
+    }
+
+    *exp_ret = exponent;
+    return maxpow;
+}
+
+static inline BDIGIT_DBL
+bary2bdigitdbl(const BDIGIT *ds, size_t n)
+{
+    assert(n <= 2);
+
+    if (n == 2)
+        return ds[0] | BIGUP(ds[1]);
+    if (n == 1)
+        return ds[0];
+    return 0;
+}
+
+static inline void
+bdigitdbl2bary(BDIGIT *ds, size_t n, BDIGIT_DBL num)
+{
+    assert(n == 2);
+
+    ds[0] = BIGLO(num);
+    ds[1] = (BDIGIT)BIGDN(num);
+}
+
+static int
+bary_cmp(const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    size_t i;
+    BARY_TRUNC(xds, xn);
+    BARY_TRUNC(yds, yn);
+
+    if (xn < yn)
+        return -1;
+    if (xn > yn)
+        return 1;
+
+    for (i = 0; i < xn; i++)
+        if (xds[xn - i - 1] != yds[yn - i - 1])
+            break;
+    if (i == xn)
+        return 0;
+    return xds[xn - i - 1] < yds[yn - i - 1] ? -1 : 1;
+}
+
+static BDIGIT
+bary_small_lshift(BDIGIT *zds, const BDIGIT *xds, size_t n, int shift)
+{
+    size_t i;
+    BDIGIT_DBL num = 0;
+    assert(0 <= shift && shift < BITSPERDIG);
 
-#define BIGZEROP(x) (RBIGNUM_LEN(x) == 0 || \
-		     (BDIGITS(x)[0] == 0 && \
-		      (RBIGNUM_LEN(x) == 1 || bigzero_p(x))))
+    for (i=0; i<n; i++) {
+        num = num | (BDIGIT_DBL)*xds++ << shift;
+        *zds++ = BIGLO(num);
+        num = BIGDN(num);
+    }
+    return BIGLO(num);
+}
 
-#define BIGNUM_DEBUG 0
-#if BIGNUM_DEBUG
-#define ON_DEBUG(x) do { x; } while (0)
 static void
-dump_bignum(VALUE x)
+bary_small_rshift(BDIGIT *zds, const BDIGIT *xds, size_t n, int shift, BDIGIT higher_bdigit)
 {
-    long i;
-    printf("%c0x0", RBIGNUM_SIGN(x) ? '+' : '-');
-    for (i = RBIGNUM_LEN(x); i--; ) {
-	printf("_%08"PRIxBDIGIT, BDIGITS(x)[i]);
+    size_t i;
+    BDIGIT_DBL num = 0;
+
+    assert(0 <= shift && shift < BITSPERDIG);
+
+    num = BIGUP(higher_bdigit);
+    for (i = 0; i < n; i++) {
+        BDIGIT x = xds[n - i - 1];
+        num = (num | x) >> shift;
+        zds[n - i - 1] = BIGLO(num);
+        num = BIGUP(x);
     }
-    printf(", len=%lu", RBIGNUM_LEN(x));
-    puts("");
 }
 
-static VALUE
-rb_big_dump(VALUE x)
+static int
+bary_zero_p(const BDIGIT *xds, size_t xn)
 {
-    dump_bignum(x);
-    return x;
+    if (xn == 0)
+        return 1;
+    do {
+        if (xds[--xn]) return 0;
+    } while (xn);
+    return 1;
+}
+
+static void
+bary_neg(BDIGIT *ds, size_t n)
+{
+    size_t i;
+    for (i = 0; i < n; i++)
+        ds[n - i - 1] = BIGLO(~ds[n - i - 1]);
+}
+
+static int
+bary_2comp(BDIGIT *ds, size_t n)
+{
+    size_t i;
+    for (i = 0; i < n; i++) {
+        if (ds[i] != 0) {
+            goto non_zero;
+        }
+    }
+    return 1;
+
+  non_zero:
+    ds[i] = BIGLO(~ds[i] + 1);
+    i++;
+    for (; i < n; i++) {
+        ds[i] = BIGLO(~ds[i]);
+    }
+    return 0;
 }
+
+static void
+bary_swap(BDIGIT *ds, size_t num_bdigits)
+{
+    BDIGIT *p1 = ds;
+    BDIGIT *p2 = ds + num_bdigits - 1;
+    for (; p1 < p2; p1++, p2--) {
+        BDIGIT tmp = *p1;
+        *p1 = *p2;
+        *p2 = tmp;
+    }
+}
+
+#define INTEGER_PACK_WORDORDER_MASK \
+    (INTEGER_PACK_MSWORD_FIRST | \
+     INTEGER_PACK_LSWORD_FIRST)
+#define INTEGER_PACK_BYTEORDER_MASK \
+    (INTEGER_PACK_MSBYTE_FIRST | \
+     INTEGER_PACK_LSBYTE_FIRST | \
+     INTEGER_PACK_NATIVE_BYTE_ORDER)
+
+static void
+validate_integer_pack_format(size_t numwords, size_t wordsize, size_t nails, int flags, int supported_flags)
+{
+    int wordorder_bits = flags & INTEGER_PACK_WORDORDER_MASK;
+    int byteorder_bits = flags & INTEGER_PACK_BYTEORDER_MASK;
+
+    if (flags & ~supported_flags) {
+        rb_raise(rb_eArgError, "unsupported flags specified");
+    }
+    if (wordorder_bits == 0) {
+        if (1 < numwords)
+            rb_raise(rb_eArgError, "word order not specified");
+    }
+    else if (wordorder_bits != INTEGER_PACK_MSWORD_FIRST &&
+        wordorder_bits != INTEGER_PACK_LSWORD_FIRST)
+        rb_raise(rb_eArgError, "unexpected word order");
+    if (byteorder_bits == 0) {
+        rb_raise(rb_eArgError, "byte order not specified");
+    }
+    else if (byteorder_bits != INTEGER_PACK_MSBYTE_FIRST &&
+        byteorder_bits != INTEGER_PACK_LSBYTE_FIRST &&
+        byteorder_bits != INTEGER_PACK_NATIVE_BYTE_ORDER)
+        rb_raise(rb_eArgError, "unexpected byte order");
+    if (wordsize == 0)
+        rb_raise(rb_eArgError, "invalid wordsize: %"PRI_SIZE_PREFIX"u", wordsize);
+    if (SSIZE_MAX < wordsize)
+        rb_raise(rb_eArgError, "too big wordsize: %"PRI_SIZE_PREFIX"u", wordsize);
+    if (wordsize <= nails / CHAR_BIT)
+        rb_raise(rb_eArgError, "too big nails: %"PRI_SIZE_PREFIX"u", nails);
+    if (SIZE_MAX / wordsize < numwords)
+        rb_raise(rb_eArgError, "too big numwords * wordsize: %"PRI_SIZE_PREFIX"u * %"PRI_SIZE_PREFIX"u", numwords, wordsize);
+}
+
+static void
+integer_pack_loop_setup(
+    size_t numwords, size_t wordsize, size_t nails, int flags,
+    size_t *word_num_fullbytes_ret,
+    int *word_num_partialbits_ret,
+    size_t *word_start_ret,
+    ssize_t *word_step_ret,
+    size_t *word_last_ret,
+    size_t *byte_start_ret,
+    int *byte_step_ret)
+{
+    int wordorder_bits = flags & INTEGER_PACK_WORDORDER_MASK;
+    int byteorder_bits = flags & INTEGER_PACK_BYTEORDER_MASK;
+    size_t word_num_fullbytes;
+    int word_num_partialbits;
+    size_t word_start;
+    ssize_t word_step;
+    size_t word_last;
+    size_t byte_start;
+    int byte_step;
+
+    word_num_partialbits = CHAR_BIT - (int)(nails % CHAR_BIT);
+    if (word_num_partialbits == CHAR_BIT)
+        word_num_partialbits = 0;
+    word_num_fullbytes = wordsize - (nails / CHAR_BIT);
+    if (word_num_partialbits != 0) {
+        word_num_fullbytes--;
+    }
+
+    if (wordorder_bits == INTEGER_PACK_MSWORD_FIRST) {
+        word_start = wordsize*(numwords-1);
+        word_step = -(ssize_t)wordsize;
+        word_last = 0;
+    }
+    else {
+        word_start = 0;
+        word_step = wordsize;
+        word_last = wordsize*(numwords-1);
+    }
+
+    if (byteorder_bits == INTEGER_PACK_NATIVE_BYTE_ORDER) {
+#ifdef WORDS_BIGENDIAN
+        byteorder_bits = INTEGER_PACK_MSBYTE_FIRST;
 #else
-#define ON_DEBUG(x)
+        byteorder_bits = INTEGER_PACK_LSBYTE_FIRST;
 #endif
+    }
+    if (byteorder_bits == INTEGER_PACK_MSBYTE_FIRST) {
+        byte_start = wordsize-1;
+        byte_step = -1;
+    }
+    else {
+        byte_start = 0;
+        byte_step = 1;
+    }
 
+    *word_num_partialbits_ret = word_num_partialbits;
+    *word_num_fullbytes_ret = word_num_fullbytes;
+    *word_start_ret = word_start;
+    *word_step_ret = word_step;
+    *word_last_ret = word_last;
+    *byte_start_ret = byte_start;
+    *byte_step_ret = byte_step;
+}
+
+static inline void
+integer_pack_fill_dd(BDIGIT **dpp, BDIGIT **dep, BDIGIT_DBL *ddp, int *numbits_in_dd_p)
+{
+    if (*dpp < *dep && BITSPERDIG <= (int)sizeof(*ddp) * CHAR_BIT - *numbits_in_dd_p) {
+        *ddp |= (BDIGIT_DBL)(*(*dpp)++) << *numbits_in_dd_p;
+        *numbits_in_dd_p += BITSPERDIG;
+    }
+    else if (*dpp == *dep) {
+        /* higher bits are infinity zeros */
+        *numbits_in_dd_p = (int)sizeof(*ddp) * CHAR_BIT;
+    }
+}
+
+static inline BDIGIT_DBL
+integer_pack_take_lowbits(int n, BDIGIT_DBL *ddp, int *numbits_in_dd_p)
+{
+    BDIGIT_DBL ret;
+    ret = (*ddp) & (((BDIGIT_DBL)1 << n) - 1);
+    *ddp >>= n;
+    *numbits_in_dd_p -= n;
+    return ret;
+}
+
+#if !defined(WORDS_BIGENDIAN)
 static int
-bigzero_p(VALUE x)
+bytes_2comp(unsigned char *buf, size_t len)
 {
-    long i;
-    BDIGIT *ds = BDIGITS(x);
+    size_t i;
+    for (i = 0; i < len; i++) {
+        signed char c = buf[i];
+        signed int d = ~c;
+        unsigned int e = d & 0xFF;
+        buf[i] = e;
+    }
+    for (i = 0; i < len; i++) {
+        buf[i]++;
+        if (buf[i] != 0)
+            return 0;
+    }
+    return 1;
+}
+#endif
+
+static int
+bary_pack(int sign, BDIGIT *ds, size_t num_bdigits, void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
+{
+    BDIGIT *dp, *de;
+    unsigned char *buf, *bufend;
+
+    dp = ds;
+    de = ds + num_bdigits;
+
+    validate_integer_pack_format(numwords, wordsize, nails, flags,
+            INTEGER_PACK_MSWORD_FIRST|
+            INTEGER_PACK_LSWORD_FIRST|
+            INTEGER_PACK_MSBYTE_FIRST|
+            INTEGER_PACK_LSBYTE_FIRST|
+            INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP|
+            INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION);
+
+    while (dp < de && de[-1] == 0)
+        de--;
+    if (dp == de) {
+        sign = 0;
+    }
+
+    if (!(flags & INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION)) {
+        if (sign == 0) {
+            MEMZERO(words, unsigned char, numwords * wordsize);
+            return 0;
+        }
+        if (nails == 0 && numwords == 1) {
+            int need_swap = wordsize != 1 &&
+                (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_NATIVE_BYTE_ORDER &&
+                ((flags & INTEGER_PACK_MSBYTE_FIRST) ? !HOST_BIGENDIAN_P : HOST_BIGENDIAN_P);
+            if (0 < sign || !(flags & INTEGER_PACK_2COMP)) {
+                BDIGIT d;
+                if (wordsize == 1) {
+                    *((unsigned char *)words) = (unsigned char)(d = dp[0]);
+                    return ((1 < de - dp || CLEAR_LOWBITS(d, 8) != 0) ? 2 : 1) * sign;
+                }
+#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGIT
+                if (wordsize == 2 && (uintptr_t)words % RUBY_ALIGNOF(uint16_t) == 0) {
+                    uint16_t u = (uint16_t)(d = dp[0]);
+                    if (need_swap) u = swap16(u);
+                    *((uint16_t *)words) = u;
+                    return ((1 < de - dp || CLEAR_LOWBITS(d, 16) != 0) ? 2 : 1) * sign;
+                }
+#endif
+#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGIT
+                if (wordsize == 4 && (uintptr_t)words % RUBY_ALIGNOF(uint32_t) == 0) {
+                    uint32_t u = (uint32_t)(d = dp[0]);
+                    if (need_swap) u = swap32(u);
+                    *((uint32_t *)words) = u;
+                    return ((1 < de - dp || CLEAR_LOWBITS(d, 32) != 0) ? 2 : 1) * sign;
+                }
+#endif
+#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGIT
+                if (wordsize == 8 && (uintptr_t)words % RUBY_ALIGNOF(uint64_t) == 0) {
+                    uint64_t u = (uint64_t)(d = dp[0]);
+                    if (need_swap) u = swap64(u);
+                    *((uint64_t *)words) = u;
+                    return ((1 < de - dp || CLEAR_LOWBITS(d, 64) != 0) ? 2 : 1) * sign;
+                }
+#endif
+            }
+            else { /* sign < 0 && (flags & INTEGER_PACK_2COMP) */
+                BDIGIT_DBL_SIGNED d;
+                if (wordsize == 1) {
+                    *((unsigned char *)words) = (unsigned char)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
+                    return (1 < de - dp || FILL_LOWBITS(d, 8) != -1) ? -2 : -1;
+                }
+#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGIT
+                if (wordsize == 2 && (uintptr_t)words % RUBY_ALIGNOF(uint16_t) == 0) {
+                    uint16_t u = (uint16_t)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
+                    if (need_swap) u = swap16(u);
+                    *((uint16_t *)words) = u;
+                    return (wordsize == SIZEOF_BDIGIT && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
+                        (1 < de - dp || FILL_LOWBITS(d, 16) != -1) ? -2 : -1;
+                }
+#endif
+#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGIT
+                if (wordsize == 4 && (uintptr_t)words % RUBY_ALIGNOF(uint32_t) == 0) {
+                    uint32_t u = (uint32_t)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
+                    if (need_swap) u = swap32(u);
+                    *((uint32_t *)words) = u;
+                    return (wordsize == SIZEOF_BDIGIT && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
+                        (1 < de - dp || FILL_LOWBITS(d, 32) != -1) ? -2 : -1;
+                }
+#endif
+#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGIT
+                if (wordsize == 8 && (uintptr_t)words % RUBY_ALIGNOF(uint64_t) == 0) {
+                    uint64_t u = (uint64_t)(d = -(BDIGIT_DBL_SIGNED)dp[0]);
+                    if (need_swap) u = swap64(u);
+                    *((uint64_t *)words) = u;
+                    return (wordsize == SIZEOF_BDIGIT && de - dp == 2 && dp[1] == 1 && dp[0] == 0) ? -1 :
+                        (1 < de - dp || FILL_LOWBITS(d, 64) != -1) ? -2 : -1;
+                }
+#endif
+            }
+        }
+#if !defined(WORDS_BIGENDIAN)
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
+            (flags & INTEGER_PACK_WORDORDER_MASK) == INTEGER_PACK_LSWORD_FIRST &&
+            (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_MSBYTE_FIRST) {
+            size_t src_size = (de - dp) * SIZEOF_BDIGIT;
+            size_t dst_size = numwords * wordsize;
+            int overflow = 0;
+            while (0 < src_size && ((unsigned char *)ds)[src_size-1] == 0)
+                src_size--;
+            if (src_size <= dst_size) {
+                MEMCPY(words, dp, char, src_size);
+                MEMZERO((char*)words + src_size, char, dst_size - src_size);
+            }
+            else {
+                MEMCPY(words, dp, char, dst_size);
+                overflow = 1;
+            }
+            if (sign < 0 && (flags & INTEGER_PACK_2COMP)) {
+                int zero_p = bytes_2comp(words, dst_size);
+                if (zero_p && overflow) {
+                    unsigned char *p = (unsigned char *)dp;
+                    if (dst_size == src_size-1 &&
+                        p[dst_size] == 1) {
+                        overflow = 0;
+                    }
+                }
+            }
+            if (overflow)
+                sign *= 2;
+            return sign;
+        }
+#endif
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
+            wordsize % SIZEOF_BDIGIT == 0 && (uintptr_t)words % RUBY_ALIGNOF(BDIGIT) == 0) {
+            size_t bdigits_per_word = wordsize / SIZEOF_BDIGIT;
+            size_t src_num_bdigits = de - dp;
+            size_t dst_num_bdigits = numwords * bdigits_per_word;
+            int overflow = 0;
+            int mswordfirst_p = (flags & INTEGER_PACK_MSWORD_FIRST) != 0;
+            int msbytefirst_p = (flags & INTEGER_PACK_NATIVE_BYTE_ORDER) ? HOST_BIGENDIAN_P :
+                (flags & INTEGER_PACK_MSBYTE_FIRST) != 0;
+            if (src_num_bdigits <= dst_num_bdigits) {
+                MEMCPY(words, dp, BDIGIT, src_num_bdigits);
+                BDIGITS_ZERO((BDIGIT*)words + src_num_bdigits, dst_num_bdigits - src_num_bdigits);
+            }
+            else {
+                MEMCPY(words, dp, BDIGIT, dst_num_bdigits);
+                overflow = 1;
+            }
+            if (sign < 0 && (flags & INTEGER_PACK_2COMP)) {
+                int zero_p = bary_2comp(words, dst_num_bdigits);
+                if (zero_p && overflow &&
+                    dst_num_bdigits == src_num_bdigits-1 &&
+                    dp[dst_num_bdigits] == 1)
+                    overflow = 0;
+            }
+            if (msbytefirst_p != HOST_BIGENDIAN_P) {
+                size_t i;
+                for (i = 0; i < dst_num_bdigits; i++) {
+                    BDIGIT d = ((BDIGIT*)words)[i];
+                    ((BDIGIT*)words)[i] = swap_bdigit(d);
+                }
+            }
+            if (mswordfirst_p ? !msbytefirst_p : msbytefirst_p) {
+                size_t i;
+                BDIGIT *p = words;
+                for (i = 0; i < numwords; i++) {
+                    bary_swap(p, bdigits_per_word);
+                    p += bdigits_per_word;
+                }
+            }
+            if (mswordfirst_p) {
+                bary_swap(words, dst_num_bdigits);
+            }
+            if (overflow)
+                sign *= 2;
+            return sign;
+        }
+    }
+
+    buf = words;
+    bufend = buf + numwords * wordsize;
+
+    if (buf == bufend) {
+        /* overflow if non-zero*/
+        if (!(flags & INTEGER_PACK_2COMP) || 0 <= sign)
+            sign *= 2;
+        else {
+            if (de - dp == 1 && dp[0] == 1)
+                sign = -1; /* val == -1 == -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+            else
+                sign = -2; /* val < -1 == -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+        }
+    }
+    else if (dp == de) {
+        memset(buf, '\0', bufend - buf);
+    }
+    else if (dp < de && buf < bufend) {
+        int word_num_partialbits;
+        size_t word_num_fullbytes;
+
+        ssize_t word_step;
+        size_t byte_start;
+        int byte_step;
+
+        size_t word_start, word_last;
+        unsigned char *wordp, *last_wordp;
+        BDIGIT_DBL dd;
+        int numbits_in_dd;
+
+        integer_pack_loop_setup(numwords, wordsize, nails, flags,
+            &word_num_fullbytes, &word_num_partialbits,
+            &word_start, &word_step, &word_last, &byte_start, &byte_step);
+
+        wordp = buf + word_start;
+        last_wordp = buf + word_last;
+
+        dd = 0;
+        numbits_in_dd = 0;
+
+#define FILL_DD \
+    integer_pack_fill_dd(&dp, &de, &dd, &numbits_in_dd)
+#define TAKE_LOWBITS(n) \
+    integer_pack_take_lowbits(n, &dd, &numbits_in_dd)
+
+        while (1) {
+            size_t index_in_word = 0;
+            unsigned char *bytep = wordp + byte_start;
+            while (index_in_word < word_num_fullbytes) {
+                FILL_DD;
+                *bytep = TAKE_LOWBITS(CHAR_BIT);
+                bytep += byte_step;
+                index_in_word++;
+            }
+            if (word_num_partialbits) {
+                FILL_DD;
+                *bytep = TAKE_LOWBITS(word_num_partialbits);
+                bytep += byte_step;
+                index_in_word++;
+            }
+            while (index_in_word < wordsize) {
+                *bytep = 0;
+                bytep += byte_step;
+                index_in_word++;
+            }
+
+            if (wordp == last_wordp)
+                break;
+
+            wordp += word_step;
+        }
+        FILL_DD;
+        /* overflow tests */
+        if (dp != de || 1 < dd) {
+            /* 2**(numwords*(wordsize*CHAR_BIT-nails)+1) <= abs(val) */
+            sign *= 2;
+        }
+        else if (dd == 1) {
+            /* 2**(numwords*(wordsize*CHAR_BIT-nails)) <= abs(val) < 2**(numwords*(wordsize*CHAR_BIT-nails)+1) */
+            if (!(flags & INTEGER_PACK_2COMP) || 0 <= sign)
+                sign *= 2;
+            else { /* overflow_2comp && sign == -1 */
+                /* test lower bits are all zero. */
+                dp = ds;
+                while (dp < de && *dp == 0)
+                    dp++;
+                if (de - dp == 1 && /* only one non-zero word. */
+                    POW2_P(*dp)) /* *dp contains only one bit set. */
+                    sign = -1; /* val == -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+                else
+                    sign = -2; /* val < -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+            }
+        }
+    }
+
+    if ((flags & INTEGER_PACK_2COMP) && (sign < 0 && numwords != 0)) {
+        int word_num_partialbits;
+        size_t word_num_fullbytes;
+
+        ssize_t word_step;
+        size_t byte_start;
+        int byte_step;
+
+        size_t word_start, word_last;
+        unsigned char *wordp, *last_wordp;
+
+        unsigned int partialbits_mask;
+        int carry;
+
+        integer_pack_loop_setup(numwords, wordsize, nails, flags,
+            &word_num_fullbytes, &word_num_partialbits,
+            &word_start, &word_step, &word_last, &byte_start, &byte_step);
+
+        partialbits_mask = (1 << word_num_partialbits) - 1;
+
+        buf = words;
+        wordp = buf + word_start;
+        last_wordp = buf + word_last;
+
+        carry = 1;
+        while (1) {
+            size_t index_in_word = 0;
+            unsigned char *bytep = wordp + byte_start;
+            while (index_in_word < word_num_fullbytes) {
+                carry += (unsigned char)~*bytep;
+                *bytep = (unsigned char)carry;
+                carry >>= CHAR_BIT;
+                bytep += byte_step;
+                index_in_word++;
+            }
+            if (word_num_partialbits) {
+                carry += (*bytep & partialbits_mask) ^ partialbits_mask;
+                *bytep = carry & partialbits_mask;
+                carry >>= word_num_partialbits;
+                bytep += byte_step;
+                index_in_word++;
+            }
+
+            if (wordp == last_wordp)
+                break;
+
+            wordp += word_step;
+        }
+    }
+
+    return sign;
+#undef FILL_DD
+#undef TAKE_LOWBITS
+}
+
+static size_t
+integer_unpack_num_bdigits_small(size_t numwords, size_t wordsize, size_t nails, int *nlp_bits_ret)
+{
+    /* nlp_bits stands for number of leading padding bits */
+    size_t num_bits = (wordsize * CHAR_BIT - nails) * numwords;
+    size_t num_bdigits = roomof(num_bits, BITSPERDIG);
+    *nlp_bits_ret = (int)(num_bdigits * BITSPERDIG - num_bits);
+    return num_bdigits;
+}
+
+static size_t
+integer_unpack_num_bdigits_generic(size_t numwords, size_t wordsize, size_t nails, int *nlp_bits_ret)
+{
+    /* BITSPERDIG = SIZEOF_BDIGIT * CHAR_BIT */
+    /* num_bits = (wordsize * CHAR_BIT - nails) * numwords */
+    /* num_bdigits = roomof(num_bits, BITSPERDIG) */
+
+    /* num_bits = CHAR_BIT * (wordsize * numwords) - nails * numwords = CHAR_BIT * num_bytes1 - nails * numwords */
+    size_t num_bytes1 = wordsize * numwords;
+
+    /* q1 * CHAR_BIT + r1 = numwords */
+    size_t q1 = numwords / CHAR_BIT;
+    size_t r1 = numwords % CHAR_BIT;
+
+    /* num_bits = CHAR_BIT * num_bytes1 - nails * (q1 * CHAR_BIT + r1) = CHAR_BIT * num_bytes2 - nails * r1 */
+    size_t num_bytes2 = num_bytes1 - nails * q1;
+
+    /* q2 * CHAR_BIT + r2 = nails */
+    size_t q2 = nails / CHAR_BIT;
+    size_t r2 = nails % CHAR_BIT;
+
+    /* num_bits = CHAR_BIT * num_bytes2 - (q2 * CHAR_BIT + r2) * r1 = CHAR_BIT * num_bytes3 - r1 * r2 */
+    size_t num_bytes3 = num_bytes2 - q2 * r1;
+
+    /* q3 * BITSPERDIG + r3 = num_bytes3 */
+    size_t q3 = num_bytes3 / BITSPERDIG;
+    size_t r3 = num_bytes3 % BITSPERDIG;
+
+    /* num_bits = CHAR_BIT * (q3 * BITSPERDIG + r3) - r1 * r2 = BITSPERDIG * num_digits1 + CHAR_BIT * r3 - r1 * r2 */
+    size_t num_digits1 = CHAR_BIT * q3;
+
+    /*
+     * if CHAR_BIT * r3 >= r1 * r2
+     *   CHAR_BIT * r3 - r1 * r2 = CHAR_BIT * BITSPERDIG - (CHAR_BIT * BITSPERDIG - (CHAR_BIT * r3 - r1 * r2))
+     *   q4 * BITSPERDIG + r4 = CHAR_BIT * BITSPERDIG - (CHAR_BIT * r3 - r1 * r2)
+     *   num_bits = BITSPERDIG * num_digits1 + CHAR_BIT * BITSPERDIG - (q4 * BITSPERDIG + r4) = BITSPERDIG * num_digits2 - r4
+     * else
+     *   q4 * BITSPERDIG + r4 = -(CHAR_BIT * r3 - r1 * r2)
+     *   num_bits = BITSPERDIG * num_digits1 - (q4 * BITSPERDIG + r4) = BITSPERDIG * num_digits2 - r4
+     * end
+     */
+
+    if (CHAR_BIT * r3 >= r1 * r2) {
+        size_t tmp1 = CHAR_BIT * BITSPERDIG - (CHAR_BIT * r3 - r1 * r2);
+        size_t q4 = tmp1 / BITSPERDIG;
+        int r4 = (int)(tmp1 % BITSPERDIG);
+        size_t num_digits2 = num_digits1 + CHAR_BIT - q4;
+        *nlp_bits_ret = r4;
+        return num_digits2;
+    }
+    else {
+        size_t tmp1 = r1 * r2 - CHAR_BIT * r3;
+        size_t q4 = tmp1 / BITSPERDIG;
+        int r4 = (int)(tmp1 % BITSPERDIG);
+        size_t num_digits2 = num_digits1 - q4;
+        *nlp_bits_ret = r4;
+        return num_digits2;
+    }
+}
+
+static size_t
+integer_unpack_num_bdigits(size_t numwords, size_t wordsize, size_t nails, int *nlp_bits_ret)
+{
+    size_t num_bdigits;
+
+    if (numwords <= (SIZE_MAX - (BITSPERDIG-1)) / CHAR_BIT / wordsize) {
+        num_bdigits = integer_unpack_num_bdigits_small(numwords, wordsize, nails, nlp_bits_ret);
+#ifdef DEBUG_INTEGER_PACK
+        {
+            int nlp_bits1;
+            size_t num_bdigits1 = integer_unpack_num_bdigits_generic(numwords, wordsize, nails, &nlp_bits1);
+            assert(num_bdigits == num_bdigits1);
+            assert(*nlp_bits_ret == nlp_bits1);
+            (void)num_bdigits1;
+        }
+#endif
+    }
+    else {
+        num_bdigits = integer_unpack_num_bdigits_generic(numwords, wordsize, nails, nlp_bits_ret);
+    }
+    return num_bdigits;
+}
+
+static inline void
+integer_unpack_push_bits(int data, int numbits, BDIGIT_DBL *ddp, int *numbits_in_dd_p, BDIGIT **dpp)
+{
+    (*ddp) |= ((BDIGIT_DBL)data) << (*numbits_in_dd_p);
+    *numbits_in_dd_p += numbits;
+    while (BITSPERDIG <= *numbits_in_dd_p) {
+        *(*dpp)++ = BIGLO(*ddp);
+        *ddp = BIGDN(*ddp);
+        *numbits_in_dd_p -= BITSPERDIG;
+    }
+}
+
+static int
+integer_unpack_single_bdigit(BDIGIT u, size_t size, int flags, BDIGIT *dp)
+{
+    int sign;
+    if (flags & INTEGER_PACK_2COMP) {
+        sign = (flags & INTEGER_PACK_NEGATIVE) ?
+            ((size == SIZEOF_BDIGIT && u == 0) ? -2 : -1) :
+            ((u >> (size * CHAR_BIT - 1)) ? -1 : 1);
+        if (sign < 0) {
+            u |= LSHIFTX(BDIGMAX, size * CHAR_BIT);
+            u = BIGLO(1 + ~u);
+        }
+    }
+    else
+        sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+    *dp = u;
+    return sign;
+}
+
+#ifdef HAVE_BUILTIN___BUILTIN_ASSUME_ALIGNED
+#define reinterpret_cast(type, value) (type) \
+    __builtin_assume_aligned((value), sizeof(*(type)NULL));
+#else
+#define reinterpret_cast(type, value) (type)value
+#endif
+
+static int
+bary_unpack_internal(BDIGIT *bdigits, size_t num_bdigits, const void *words, size_t numwords, size_t wordsize, size_t nails, int flags, int nlp_bits)
+{
+    int sign;
+    const unsigned char *buf = words;
+    BDIGIT *dp;
+    BDIGIT *de;
+
+    dp = bdigits;
+    de = dp + num_bdigits;
+
+    if (!(flags & INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION)) {
+        if (nails == 0 && numwords == 1) {
+            int need_swap = wordsize != 1 &&
+                (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_NATIVE_BYTE_ORDER &&
+                ((flags & INTEGER_PACK_MSBYTE_FIRST) ? !HOST_BIGENDIAN_P : HOST_BIGENDIAN_P);
+            if (wordsize == 1) {
+                return integer_unpack_single_bdigit(*(uint8_t *)buf, sizeof(uint8_t), flags, dp);
+            }
+#if defined(HAVE_UINT16_T) && 2 <= SIZEOF_BDIGIT
+            if (wordsize == 2 && (uintptr_t)words % RUBY_ALIGNOF(uint16_t) == 0) {
+                uint16_t u = *reinterpret_cast(const uint16_t *, buf);
+                return integer_unpack_single_bdigit(need_swap ? swap16(u) : u, sizeof(uint16_t), flags, dp);
+            }
+#endif
+#if defined(HAVE_UINT32_T) && 4 <= SIZEOF_BDIGIT
+            if (wordsize == 4 && (uintptr_t)words % RUBY_ALIGNOF(uint32_t) == 0) {
+                uint32_t u = *reinterpret_cast(const uint32_t *, buf);
+                return integer_unpack_single_bdigit(need_swap ? swap32(u) : u, sizeof(uint32_t), flags, dp);
+            }
+#endif
+#if defined(HAVE_UINT64_T) && 8 <= SIZEOF_BDIGIT
+            if (wordsize == 8 && (uintptr_t)words % RUBY_ALIGNOF(uint64_t) == 0) {
+                uint64_t u = *reinterpret_cast(const uint64_t *, buf);
+                return integer_unpack_single_bdigit(need_swap ? swap64(u) : u, sizeof(uint64_t), flags, dp);
+            }
+#endif
+#undef reinterpret_cast
+        }
+#if !defined(WORDS_BIGENDIAN)
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
+            (flags & INTEGER_PACK_WORDORDER_MASK) == INTEGER_PACK_LSWORD_FIRST &&
+            (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_MSBYTE_FIRST) {
+            size_t src_size = numwords * wordsize;
+            size_t dst_size = num_bdigits * SIZEOF_BDIGIT;
+            MEMCPY(dp, words, char, src_size);
+            if (flags & INTEGER_PACK_2COMP) {
+                if (flags & INTEGER_PACK_NEGATIVE) {
+                    int zero_p;
+                    memset((char*)dp + src_size, 0xff, dst_size - src_size);
+                    zero_p = bary_2comp(dp, num_bdigits);
+                    sign = zero_p ? -2 : -1;
+                }
+                else if (buf[src_size-1] >> (CHAR_BIT-1)) {
+                    memset((char*)dp + src_size, 0xff, dst_size - src_size);
+                    bary_2comp(dp, num_bdigits);
+                    sign = -1;
+                }
+                else {
+                    MEMZERO((char*)dp + src_size, char, dst_size - src_size);
+                    sign = 1;
+                }
+            }
+            else {
+                MEMZERO((char*)dp + src_size, char, dst_size - src_size);
+                sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+            }
+            return sign;
+        }
+#endif
+        if (nails == 0 && SIZEOF_BDIGIT == sizeof(BDIGIT) &&
+            wordsize % SIZEOF_BDIGIT == 0) {
+            size_t bdigits_per_word = wordsize / SIZEOF_BDIGIT;
+            int mswordfirst_p = (flags & INTEGER_PACK_MSWORD_FIRST) != 0;
+            int msbytefirst_p = (flags & INTEGER_PACK_NATIVE_BYTE_ORDER) ? HOST_BIGENDIAN_P :
+                (flags & INTEGER_PACK_MSBYTE_FIRST) != 0;
+            MEMCPY(dp, words, BDIGIT, numwords*bdigits_per_word);
+            if (mswordfirst_p) {
+                bary_swap(dp, num_bdigits);
+            }
+            if (mswordfirst_p ? !msbytefirst_p : msbytefirst_p) {
+                size_t i;
+                BDIGIT *p = dp;
+                for (i = 0; i < numwords; i++) {
+                    bary_swap(p, bdigits_per_word);
+                    p += bdigits_per_word;
+                }
+            }
+            if (msbytefirst_p != HOST_BIGENDIAN_P) {
+                BDIGIT *p;
+                for (p = dp; p < de; p++) {
+                    BDIGIT d = *p;
+                    *p = swap_bdigit(d);
+                }
+            }
+            if (flags & INTEGER_PACK_2COMP) {
+                if (flags & INTEGER_PACK_NEGATIVE) {
+                    int zero_p = bary_2comp(dp, num_bdigits);
+                    sign = zero_p ? -2 : -1;
+                }
+                else if (BDIGIT_MSB(de[-1])) {
+                    bary_2comp(dp, num_bdigits);
+                    sign = -1;
+                }
+                else {
+                    sign = 1;
+                }
+            }
+            else {
+                sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+            }
+            return sign;
+        }
+    }
+
+    if (num_bdigits != 0) {
+        int word_num_partialbits;
+        size_t word_num_fullbytes;
+
+        ssize_t word_step;
+        size_t byte_start;
+        int byte_step;
+
+        size_t word_start, word_last;
+        const unsigned char *wordp, *last_wordp;
+        BDIGIT_DBL dd;
+        int numbits_in_dd;
+
+        integer_pack_loop_setup(numwords, wordsize, nails, flags,
+            &word_num_fullbytes, &word_num_partialbits,
+            &word_start, &word_step, &word_last, &byte_start, &byte_step);
+
+        wordp = buf + word_start;
+        last_wordp = buf + word_last;
+
+        dd = 0;
+        numbits_in_dd = 0;
+
+#define PUSH_BITS(data, numbits) \
+        integer_unpack_push_bits(data, numbits, &dd, &numbits_in_dd, &dp)
+
+        while (1) {
+            size_t index_in_word = 0;
+            const unsigned char *bytep = wordp + byte_start;
+            while (index_in_word < word_num_fullbytes) {
+                PUSH_BITS(*bytep, CHAR_BIT);
+                bytep += byte_step;
+                index_in_word++;
+            }
+            if (word_num_partialbits) {
+                PUSH_BITS(*bytep & ((1 << word_num_partialbits) - 1), word_num_partialbits);
+                bytep += byte_step;
+                index_in_word++;
+            }
+
+            if (wordp == last_wordp)
+                break;
+
+            wordp += word_step;
+        }
+        if (dd)
+            *dp++ = (BDIGIT)dd;
+        assert(dp <= de);
+        while (dp < de)
+            *dp++ = 0;
+#undef PUSH_BITS
+    }
+
+    if (!(flags & INTEGER_PACK_2COMP)) {
+        sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+    }
+    else {
+        if (nlp_bits) {
+            if ((flags & INTEGER_PACK_NEGATIVE) ||
+                (bdigits[num_bdigits-1] >> (BITSPERDIG - nlp_bits - 1))) {
+                bdigits[num_bdigits-1] |= BIGLO(BDIGMAX << (BITSPERDIG - nlp_bits));
+                sign = -1;
+            }
+            else {
+                sign = 1;
+            }
+        }
+        else {
+            if (flags & INTEGER_PACK_NEGATIVE) {
+                sign = bary_zero_p(bdigits, num_bdigits) ? -2 : -1;
+            }
+            else {
+                if (num_bdigits != 0 && BDIGIT_MSB(bdigits[num_bdigits-1]))
+                    sign = -1;
+                else
+                    sign = 1;
+            }
+        }
+        if (sign == -1 && num_bdigits != 0) {
+            bary_2comp(bdigits, num_bdigits);
+        }
+    }
+
+    return sign;
+}
 
-    for (i = RBIGNUM_LEN(x) - 1; 0 <= i; i--) {
-	if (ds[i]) return 0;
+static void
+bary_unpack(BDIGIT *bdigits, size_t num_bdigits, const void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
+{
+    size_t num_bdigits0;
+    int nlp_bits;
+    int sign;
+
+    validate_integer_pack_format(numwords, wordsize, nails, flags,
+            INTEGER_PACK_MSWORD_FIRST|
+            INTEGER_PACK_LSWORD_FIRST|
+            INTEGER_PACK_MSBYTE_FIRST|
+            INTEGER_PACK_LSBYTE_FIRST|
+            INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP|
+            INTEGER_PACK_FORCE_BIGNUM|
+            INTEGER_PACK_NEGATIVE|
+            INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION);
+
+    num_bdigits0 = integer_unpack_num_bdigits(numwords, wordsize, nails, &nlp_bits);
+
+    assert(num_bdigits0 <= num_bdigits);
+
+    sign = bary_unpack_internal(bdigits, num_bdigits0, words, numwords, wordsize, nails, flags, nlp_bits);
+
+    if (num_bdigits0 < num_bdigits) {
+        BDIGITS_ZERO(bdigits + num_bdigits0, num_bdigits - num_bdigits0);
+        if (sign == -2) {
+            bdigits[num_bdigits0] = 1;
+        }
+    }
+}
+
+static int
+bary_subb(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, int borrow)
+{
+    BDIGIT_DBL_SIGNED num;
+    size_t i;
+    size_t sn;
+
+    assert(xn <= zn);
+    assert(yn <= zn);
+
+    sn = xn < yn ? xn : yn;
+
+    num = borrow ? -1 : 0;
+    for (i = 0; i < sn; i++) {
+        num += (BDIGIT_DBL_SIGNED)xds[i] - yds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+    }
+    if (yn <= xn) {
+        for (; i < xn; i++) {
+            if (num == 0) goto num_is_zero;
+            num += xds[i];
+            zds[i] = BIGLO(num);
+            num = BIGDN(num);
+        }
+    }
+    else {
+        for (; i < yn; i++) {
+            num -= yds[i];
+            zds[i] = BIGLO(num);
+            num = BIGDN(num);
+        }
+    }
+    if (num == 0) goto num_is_zero;
+    for (; i < zn; i++) {
+        zds[i] = BDIGMAX;
+    }
+    return 1;
+
+  num_is_zero:
+    if (xds == zds && xn == zn)
+        return 0;
+    for (; i < xn; i++) {
+        zds[i] = xds[i];
+    }
+    for (; i < zn; i++) {
+        zds[i] = 0;
+    }
+    return 0;
+}
+
+static int
+bary_sub(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    return bary_subb(zds, zn, xds, xn, yds, yn, 0);
+}
+
+static int
+bary_sub_one(BDIGIT *zds, size_t zn)
+{
+    return bary_subb(zds, zn, zds, zn, NULL, 0, 1);
+}
+
+static int
+bary_addc(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, int carry)
+{
+    BDIGIT_DBL num;
+    size_t i;
+
+    assert(xn <= zn);
+    assert(yn <= zn);
+
+    if (xn > yn) {
+        const BDIGIT *tds;
+        tds = xds; xds = yds; yds = tds;
+        i = xn; xn = yn; yn = i;
+    }
+
+    num = carry ? 1 : 0;
+    for (i = 0; i < xn; i++) {
+        num += (BDIGIT_DBL)xds[i] + yds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+    }
+    for (; i < yn; i++) {
+        if (num == 0) goto num_is_zero;
+        num += yds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+    }
+    for (; i < zn; i++) {
+        if (num == 0) goto num_is_zero;
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+    }
+    return num != 0;
+
+  num_is_zero:
+    if (yds == zds && yn == zn)
+        return 0;
+    for (; i < yn; i++) {
+        zds[i] = yds[i];
+    }
+    for (; i < zn; i++) {
+        zds[i] = 0;
+    }
+    return 0;
+}
+
+static int
+bary_add(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    return bary_addc(zds, zn, xds, xn, yds, yn, 0);
+}
+
+static int
+bary_add_one(BDIGIT *ds, size_t n)
+{
+    size_t i;
+    for (i = 0; i < n; i++) {
+        BDIGIT_DBL n = ds[i];
+        n += 1;
+        ds[i] = BIGLO(n);
+        if (ds[i] != 0)
+            return 0;
     }
     return 1;
 }
 
+static void
+bary_mul_single(BDIGIT *zds, size_t zn, BDIGIT x, BDIGIT y)
+{
+    BDIGIT_DBL n;
+
+    assert(2 <= zn);
+
+    n = (BDIGIT_DBL)x * y;
+    bdigitdbl2bary(zds, 2, n);
+    BDIGITS_ZERO(zds + 2, zn - 2);
+}
+
+static int
+bary_muladd_1xN(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
+{
+    BDIGIT_DBL n;
+    BDIGIT_DBL dd;
+    size_t j;
+
+    assert(zn > yn);
+
+    if (x == 0)
+        return 0;
+    dd = x;
+    n = 0;
+    for (j = 0; j < yn; j++) {
+        BDIGIT_DBL ee = n + dd * yds[j];
+        if (ee) {
+            n = zds[j] + ee;
+            zds[j] = BIGLO(n);
+            n = BIGDN(n);
+        }
+        else {
+            n = 0;
+        }
+
+    }
+    for (; j < zn; j++) {
+        if (n == 0)
+            break;
+        n += zds[j];
+        zds[j] = BIGLO(n);
+        n = BIGDN(n);
+    }
+    return n != 0;
+}
+
+static BDIGIT_DBL_SIGNED
+bigdivrem_mulsub(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
+{
+    size_t i;
+    BDIGIT_DBL t2;
+    BDIGIT_DBL_SIGNED num;
+
+    assert(zn == yn + 1);
+
+    num = 0;
+    t2 = 0;
+    i = 0;
+
+    do {
+        BDIGIT_DBL_SIGNED ee;
+        t2 += (BDIGIT_DBL)yds[i] * x;
+        ee = num - BIGLO(t2);
+        num = (BDIGIT_DBL_SIGNED)zds[i] + ee;
+        if (ee) zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        t2 = BIGDN(t2);
+    } while (++i < yn);
+    num -= (BDIGIT_DBL_SIGNED)t2;
+    num += (BDIGIT_DBL_SIGNED)zds[yn]; /* borrow from high digit; don't update */
+    return num;
+}
+
+static int
+bary_mulsub_1xN(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
+{
+    BDIGIT_DBL_SIGNED num;
+
+    assert(zn == yn + 1);
+
+    num = bigdivrem_mulsub(zds, zn, x, yds, yn);
+    zds[yn] = BIGLO(num);
+    if (BIGDN(num))
+        return 1;
+    return 0;
+}
+
+static void
+bary_mul_normal(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    size_t i;
+
+    assert(xn + yn <= zn);
+
+    BDIGITS_ZERO(zds, zn);
+    for (i = 0; i < xn; i++) {
+        bary_muladd_1xN(zds+i, zn-i, xds[i], yds, yn);
+    }
+}
+
+VALUE
+rb_big_mul_normal(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    bary_mul_normal(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return z;
+}
+
+/* efficient squaring (2 times faster than normal multiplication)
+ * ref: Handbook of Applied Cryptography, Algorithm 14.16
+ *      https://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf
+ */
+static void
+bary_sq_fast(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn)
+{
+    size_t i, j;
+    BDIGIT_DBL c, v, w;
+    BDIGIT vl;
+    int vh;
+
+    assert(xn * 2 <= zn);
+
+    BDIGITS_ZERO(zds, zn);
+
+    if (xn == 0)
+        return;
+
+    for (i = 0; i < xn-1; i++) {
+        v = (BDIGIT_DBL)xds[i];
+        if (!v)
+            continue;
+        c = (BDIGIT_DBL)zds[i + i] + v * v;
+        zds[i + i] = BIGLO(c);
+        c = BIGDN(c);
+        v *= 2;
+        vl = BIGLO(v);
+        vh = (int)BIGDN(v);
+        for (j = i + 1; j < xn; j++) {
+            w = (BDIGIT_DBL)xds[j];
+            c += (BDIGIT_DBL)zds[i + j] + vl * w;
+            zds[i + j] = BIGLO(c);
+            c = BIGDN(c);
+            if (vh)
+                c += w;
+        }
+        if (c) {
+            c += (BDIGIT_DBL)zds[i + xn];
+            zds[i + xn] = BIGLO(c);
+            c = BIGDN(c);
+            if (c)
+                zds[i + xn + 1] += (BDIGIT)c;
+        }
+    }
+
+    /* i == xn-1 */
+    v = (BDIGIT_DBL)xds[i];
+    if (!v)
+        return;
+    c = (BDIGIT_DBL)zds[i + i] + v * v;
+    zds[i + i] = BIGLO(c);
+    c = BIGDN(c);
+    if (c) {
+        zds[i + xn] += BIGLO(c);
+    }
+}
+
+VALUE
+rb_big_sq_fast(VALUE x)
+{
+    size_t xn = BIGNUM_LEN(x), zn = 2 * xn;
+    VALUE z = bignew(zn, 1);
+    bary_sq_fast(BDIGITS(z), zn, BDIGITS(x), xn);
+    RB_GC_GUARD(x);
+    return z;
+}
+
+static inline size_t
+max_size(size_t a, size_t b)
+{
+    return (a > b ? a : b);
+}
+
+/* balancing multiplication by slicing larger argument */
+static void
+bary_mul_balance_with_mulfunc(BDIGIT *const zds, const size_t zn,
+                              const BDIGIT *const xds, const size_t xn,
+                              const BDIGIT *const yds, const size_t yn,
+                              BDIGIT *wds, size_t wn, mulfunc_t *const mulfunc)
+{
+    VALUE work = 0;
+    size_t n;
+
+    assert(xn + yn <= zn);
+    assert(xn <= yn);
+    assert(!KARATSUBA_BALANCED(xn, yn) || !TOOM3_BALANCED(xn, yn));
+
+    BDIGITS_ZERO(zds, xn);
+
+    if (wn < xn) {
+        /* The condition when a new buffer is needed:
+         * 1. (2(xn+r) > zn-(yn-r)) => (2xn+r > zn-yn), at the last
+         *    iteration (or r == 0)
+         * 2. (2(xn+xn) > zn-(yn-r-xn)) => (3xn-r > zn-yn), at the
+         *    previous iteration.
+         */
+        const size_t r = yn % xn;
+        if (2*xn + yn + max_size(xn-r, r) > zn) {
+            wn = xn;
+            wds = ALLOCV_N(BDIGIT, work, wn);
+        }
+    }
+
+    n = 0;
+    while (yn > n) {
+        const size_t r = (xn > (yn - n) ? (yn - n) : xn);
+        const size_t tn = (xn + r);
+        if (2 * (xn + r) <= zn - n) {
+            BDIGIT *const tds = zds + n + xn + r;
+            mulfunc(tds, tn, xds, xn, yds + n, r, wds, wn);
+            BDIGITS_ZERO(zds + n + xn, r);
+            bary_add(zds + n, tn,
+                     zds + n, tn,
+                     tds, tn);
+        }
+        else {
+            BDIGIT *const tds = zds + n;
+            if (wn < xn) {
+                /* xn is invariant, only once here */
+#if 0
+                wn = xn;
+                wds = ALLOCV_N(BDIGIT, work, wn);
+#else
+                rb_bug("wds is not enough: %" PRIdSIZE " for %" PRIdSIZE, wn, xn);
+#endif
+            }
+            MEMCPY(wds, zds + n, BDIGIT, xn);
+            mulfunc(tds, tn, xds, xn, yds + n, r, wds+xn, wn-xn);
+            bary_add(zds + n, tn,
+                     zds + n, tn,
+                     wds, xn);
+        }
+        n += r;
+    }
+    BDIGITS_ZERO(zds+xn+yn, zn - (xn+yn));
+
+    if (work)
+        ALLOCV_END(work);
+}
+
+VALUE
+rb_big_mul_balance(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    bary_mul_balance_with_mulfunc(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, NULL, 0, bary_mul_toom3_start);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return z;
+}
+
+/* multiplication by karatsuba method */
+static void
+bary_mul_karatsuba(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
+{
+    VALUE work = 0;
+
+    size_t n;
+    int sub_p, borrow, carry1, carry2, carry3;
+
+    int odd_y = 0;
+    int odd_xy = 0;
+    int sq;
+
+    const BDIGIT *xds0, *xds1, *yds0, *yds1;
+    BDIGIT *zds0, *zds1, *zds2, *zds3;
+
+    assert(xn + yn <= zn);
+    assert(xn <= yn);
+    assert(yn < 2 * xn);
+
+    sq = xds == yds && xn == yn;
+
+    if (yn & 1) {
+        odd_y = 1;
+        yn--;
+        if (yn < xn) {
+            odd_xy = 1;
+            xn--;
+        }
+    }
+
+    n = yn / 2;
+
+    assert(n < xn);
+
+    if (wn < n) {
+        /* This function itself needs only n BDIGITs for work area.
+         * However this function calls bary_mul_karatsuba and
+         * bary_mul_balance recursively.
+         * 2n BDIGITs are enough to avoid allocations in
+         * the recursively called functions.
+         */
+        wn = 2*n;
+        wds = ALLOCV_N(BDIGIT, work, wn);
+    }
+
+    /* Karatsuba algorithm:
+     *
+     * x = x0 + r*x1
+     * y = y0 + r*y1
+     * z = x*y
+     *   = (x0 + r*x1) * (y0 + r*y1)
+     *   = x0*y0 + r*(x1*y0 + x0*y1) + r*r*x1*y1
+     *   = x0*y0 + r*(x0*y0 + x1*y1 - (x1-x0)*(y1-y0)) + r*r*x1*y1
+     *   = x0*y0 + r*(x0*y0 + x1*y1 - (x0-x1)*(y0-y1)) + r*r*x1*y1
+     */
+
+    xds0 = xds;
+    xds1 = xds + n;
+    yds0 = yds;
+    yds1 = yds + n;
+    zds0 = zds;
+    zds1 = zds + n;
+    zds2 = zds + 2*n;
+    zds3 = zds + 3*n;
+
+    sub_p = 1;
+
+    /* zds0:? zds1:? zds2:? zds3:? wds:? */
+
+    if (bary_sub(zds0, n, xds, n, xds+n, xn-n)) {
+        bary_2comp(zds0, n);
+        sub_p = !sub_p;
+    }
+
+    /* zds0:|x1-x0| zds1:? zds2:? zds3:? wds:? */
+
+    if (sq) {
+        sub_p = 1;
+        bary_mul_karatsuba_start(zds1, 2*n, zds0, n, zds0, n, wds, wn);
+    }
+    else {
+        if (bary_sub(wds, n, yds, n, yds+n, n)) {
+            bary_2comp(wds, n);
+            sub_p = !sub_p;
+        }
+
+        /* zds0:|x1-x0| zds1:? zds2:? zds3:? wds:|y1-y0| */
+
+        bary_mul_karatsuba_start(zds1, 2*n, zds0, n, wds, n, wds+n, wn-n);
+    }
+
+    /* zds0:|x1-x0| zds1,zds2:|x1-x0|*|y1-y0| zds3:? wds:|y1-y0| */
+
+    borrow = 0;
+    if (sub_p) {
+        borrow = !bary_2comp(zds1, 2*n);
+    }
+    /* zds0:|x1-x0| zds1,zds2:-?|x1-x0|*|y1-y0| zds3:? wds:|y1-y0| */
+
+    MEMCPY(wds, zds1, BDIGIT, n);
+
+    /* zds0:|x1-x0| zds1,zds2:-?|x1-x0|*|y1-y0| zds3:? wds:lo(-?|x1-x0|*|y1-y0|) */
+
+    bary_mul_karatsuba_start(zds0, 2*n, xds0, n, yds0, n, wds+n, wn-n);
+
+    /* zds0,zds1:x0*y0 zds2:hi(-?|x1-x0|*|y1-y0|) zds3:? wds:lo(-?|x1-x0|*|y1-y0|) */
+
+    carry1 = bary_add(wds, n, wds, n, zds0, n);
+    carry1 = bary_addc(zds2, n, zds2, n, zds1, n, carry1);
+
+    /* zds0,zds1:x0*y0 zds2:hi(x0*y0-?|x1-x0|*|y1-y0|) zds3:? wds:lo(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    carry2 = bary_add(zds1, n, zds1, n, wds, n);
+
+    /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|) zds2:hi(x0*y0-?|x1-x0|*|y1-y0|) zds3:? wds:lo(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    MEMCPY(wds, zds2, BDIGIT, n);
+
+    /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|) zds2:_ zds3:? wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    bary_mul_karatsuba_start(zds2, zn-2*n, xds1, xn-n, yds1, n, wds+n, wn-n);
+
+    /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|) zds2,zds3:x1*y1 wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    carry3 = bary_add(zds1, n, zds1, n, zds2, n);
+
+    /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|)+lo(x1*y1) zds2,zds3:x1*y1 wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    carry3 = bary_addc(zds2, n, zds2, n, zds3, (4*n < zn ? n : zn-3*n), carry3);
+
+    /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|)+lo(x1*y1) zds2,zds3:x1*y1+hi(x1*y1) wds:hi(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    bary_add(zds2, zn-2*n, zds2, zn-2*n, wds, n);
+
+    /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|)+lo(x1*y1) zds2,zds3:x1*y1+hi(x1*y1)+hi(x0*y0-?|x1-x0|*|y1-y0|) wds:_ */
+
+    if (carry2)
+        bary_add_one(zds2, zn-2*n);
+
+    if (carry1 + carry3 - borrow < 0)
+        bary_sub_one(zds3, zn-3*n);
+    else if (carry1 + carry3 - borrow > 0) {
+        BDIGIT c = carry1 + carry3 - borrow;
+        bary_add(zds3, zn-3*n, zds3, zn-3*n, &c, 1);
+    }
+
+    /*
+    if (SIZEOF_BDIGIT * zn <= 16) {
+        uint128_t z, x, y;
+        ssize_t i;
+        for (x = 0, i = xn-1; 0 <= i; i--) { x <<= SIZEOF_BDIGIT*CHAR_BIT; x |= xds[i]; }
+        for (y = 0, i = yn-1; 0 <= i; i--) { y <<= SIZEOF_BDIGIT*CHAR_BIT; y |= yds[i]; }
+        for (z = 0, i = zn-1; 0 <= i; i--) { z <<= SIZEOF_BDIGIT*CHAR_BIT; z |= zds[i]; }
+        assert(z == x * y);
+    }
+    */
+
+    if (odd_xy) {
+        bary_muladd_1xN(zds+yn, zn-yn, yds[yn], xds, xn);
+        bary_muladd_1xN(zds+xn, zn-xn, xds[xn], yds, yn+1);
+    }
+    else if (odd_y) {
+        bary_muladd_1xN(zds+yn, zn-yn, yds[yn], xds, xn);
+    }
+
+    if (work)
+        ALLOCV_END(work);
+}
+
+VALUE
+rb_big_mul_karatsuba(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    if (!((xn <= yn && yn < 2) || KARATSUBA_BALANCED(xn, yn)))
+        rb_raise(rb_eArgError, "unexpected bignum length for karatsuba");
+    bary_mul_karatsuba(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, NULL, 0);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return z;
+}
+
+static void
+bary_mul_toom3(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
+{
+    size_t n;
+    size_t wnc;
+    VALUE work = 0;
+
+    /* "p" stands for "positive".  Actually it means "non-negative", though. */
+    size_t x0n; const BDIGIT *x0ds;
+    size_t x1n; const BDIGIT *x1ds;
+    size_t x2n; const BDIGIT *x2ds;
+    size_t y0n; const BDIGIT *y0ds;
+    size_t y1n; const BDIGIT *y1ds;
+    size_t y2n; const BDIGIT *y2ds;
+
+    size_t u1n; BDIGIT *u1ds; int u1p;
+    size_t u2n; BDIGIT *u2ds; int u2p;
+    size_t u3n; BDIGIT *u3ds; int u3p;
+
+    size_t v1n; BDIGIT *v1ds; int v1p;
+    size_t v2n; BDIGIT *v2ds; int v2p;
+    size_t v3n; BDIGIT *v3ds; int v3p;
+
+    size_t t0n; BDIGIT *t0ds; int t0p;
+    size_t t1n; BDIGIT *t1ds; int t1p;
+    size_t t2n; BDIGIT *t2ds; int t2p;
+    size_t t3n; BDIGIT *t3ds; int t3p;
+    size_t t4n; BDIGIT *t4ds; int t4p;
+
+    size_t z0n; BDIGIT *z0ds;
+    size_t z1n; BDIGIT *z1ds; int z1p;
+    size_t z2n; BDIGIT *z2ds; int z2p;
+    size_t z3n; BDIGIT *z3ds; int z3p;
+    size_t z4n; BDIGIT *z4ds;
+
+    size_t zzn; BDIGIT *zzds;
+
+    int sq = xds == yds && xn == yn;
+
+    assert(xn <= yn);  /* assume y >= x */
+    assert(xn + yn <= zn);
+
+    n = (yn + 2) / 3;
+    assert(2*n < xn);
+
+    wnc = 0;
+
+    wnc += (u1n = n+1); /* BITSPERDIG*n+2 bits */
+    wnc += (u2n = n+1); /* BITSPERDIG*n+1 bits */
+    wnc += (u3n = n+1); /* BITSPERDIG*n+3 bits */
+    wnc += (v1n = n+1); /* BITSPERDIG*n+2 bits */
+    wnc += (v2n = n+1); /* BITSPERDIG*n+1 bits */
+    wnc += (v3n = n+1); /* BITSPERDIG*n+3 bits */
+
+    wnc += (t0n = 2*n); /* BITSPERDIG*2*n bits */
+    wnc += (t1n = 2*n+2); /* BITSPERDIG*2*n+4 bits but bary_mul needs u1n+v1n */
+    wnc += (t2n = 2*n+2); /* BITSPERDIG*2*n+2 bits but bary_mul needs u2n+v2n */
+    wnc += (t3n = 2*n+2); /* BITSPERDIG*2*n+6 bits but bary_mul needs u3n+v3n */
+    wnc += (t4n = 2*n); /* BITSPERDIG*2*n bits */
+
+    wnc += (z1n = 2*n+1); /* BITSPERDIG*2*n+5 bits */
+    wnc += (z2n = 2*n+1); /* BITSPERDIG*2*n+6 bits */
+    wnc += (z3n = 2*n+1); /* BITSPERDIG*2*n+8 bits */
+
+    if (wn < wnc) {
+        wn = wnc * 3 / 2; /* Allocate working memory for whole recursion at once. */
+        wds = ALLOCV_N(BDIGIT, work, wn);
+    }
+
+    u1ds = wds; wds += u1n;
+    u2ds = wds; wds += u2n;
+    u3ds = wds; wds += u3n;
+
+    v1ds = wds; wds += v1n;
+    v2ds = wds; wds += v2n;
+    v3ds = wds; wds += v3n;
+
+    t0ds = wds; wds += t0n;
+    t1ds = wds; wds += t1n;
+    t2ds = wds; wds += t2n;
+    t3ds = wds; wds += t3n;
+    t4ds = wds; wds += t4n;
+
+    z1ds = wds; wds += z1n;
+    z2ds = wds; wds += z2n;
+    z3ds = wds; wds += z3n;
+
+    wn -= wnc;
+
+    zzds = u1ds;
+    zzn = 6*n+1;
+
+    x0n = n;
+    x1n = n;
+    x2n = xn - 2*n;
+    x0ds = xds;
+    x1ds = xds + n;
+    x2ds = xds + 2*n;
+
+    if (sq) {
+        y0n = x0n;
+        y1n = x1n;
+        y2n = x2n;
+        y0ds = x0ds;
+        y1ds = x1ds;
+        y2ds = x2ds;
+    }
+    else {
+        y0n = n;
+        y1n = n;
+        y2n = yn - 2*n;
+        y0ds = yds;
+        y1ds = yds + n;
+        y2ds = yds + 2*n;
+    }
+
+    /*
+     * ref. https://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication
+     *
+     * x(b) = x0 * b^0 + x1 * b^1 + x2 * b^2
+     * y(b) = y0 * b^0 + y1 * b^1 + y2 * b^2
+     *
+     * z(b) = x(b) * y(b)
+     * z(b) = z0 * b^0 + z1 * b^1 + z2 * b^2 + z3 * b^3 + z4 * b^4
+     * where:
+     *   z0 = x0 * y0
+     *   z1 = x0 * y1 + x1 * y0
+     *   z2 = x0 * y2 + x1 * y1 + x2 * y0
+     *   z3 = x1 * y2 + x2 * y1
+     *   z4 = x2 * y2
+     *
+     * Toom3 method (a.k.a. Toom-Cook method):
+     * (Step1) calculating 5 points z(b0), z(b1), z(b2), z(b3), z(b4),
+     * where:
+     *   b0 = 0, b1 = 1, b2 = -1, b3 = -2, b4 = inf,
+     *   z(0)   = x(0)   * y(0)   = x0 * y0
+     *   z(1)   = x(1)   * y(1)   = (x0 + x1 + x2) * (y0 + y1 + y2)
+     *   z(-1)  = x(-1)  * y(-1)  = (x0 - x1 + x2) * (y0 - y1 + y2)
+     *   z(-2)  = x(-2)  * y(-2)  = (x0 - 2 * (x1 - 2 * x2)) * (y0 - 2 * (y1 - 2 * y2))
+     *   z(inf) = x(inf) * y(inf) = x2 * y2
+     *
+     * (Step2) interpolating z0, z1, z2, z3 and z4.
+     *
+     * (Step3) Substituting base value into b of the polynomial z(b),
+     */
+
+    /*
+     * [Step1] calculating 5 points z(b0), z(b1), z(b2), z(b3), z(b4)
+     */
+
+    /* u1 <- x0 + x2 */
+    bary_add(u1ds, u1n, x0ds, x0n, x2ds, x2n);
+    u1p = 1;
+
+    /* x(-1) : u2 <- u1 - x1 = x0 - x1 + x2 */
+    if (bary_sub(u2ds, u2n, u1ds, u1n, x1ds, x1n)) {
+        bary_2comp(u2ds, u2n);
+        u2p = 0;
+    }
+    else {
+        u2p = 1;
+    }
+
+    /* x(1) : u1 <- u1 + x1 = x0 + x1 + x2 */
+    bary_add(u1ds, u1n, u1ds, u1n, x1ds, x1n);
+
+    /* x(-2) : u3 <- 2 * (u2 + x2) - x0 = x0 - 2 * (x1 - 2 * x2) */
+    u3p = 1;
+    if (u2p) {
+        bary_add(u3ds, u3n, u2ds, u2n, x2ds, x2n);
+    }
+    else if (bary_sub(u3ds, u3n, x2ds, x2n, u2ds, u2n)) {
+        bary_2comp(u3ds, u3n);
+        u3p = 0;
+    }
+    bary_small_lshift(u3ds, u3ds, u3n, 1);
+    if (!u3p) {
+        bary_add(u3ds, u3n, u3ds, u3n, x0ds, x0n);
+    }
+    else if (bary_sub(u3ds, u3n, u3ds, u3n, x0ds, x0n)) {
+        bary_2comp(u3ds, u3n);
+        u3p = 0;
+    }
+
+    if (sq) {
+        v1n = u1n; v1ds = u1ds; v1p = u1p;
+        v2n = u2n; v2ds = u2ds; v2p = u2p;
+        v3n = u3n; v3ds = u3ds; v3p = u3p;
+    }
+    else {
+        /* v1 <- y0 + y2 */
+        bary_add(v1ds, v1n, y0ds, y0n, y2ds, y2n);
+        v1p = 1;
+
+        /* y(-1) : v2 <- v1 - y1 = y0 - y1 + y2 */
+        v2p = 1;
+        if (bary_sub(v2ds, v2n, v1ds, v1n, y1ds, y1n)) {
+            bary_2comp(v2ds, v2n);
+            v2p = 0;
+        }
+
+        /* y(1) : v1 <- v1 + y1 = y0 + y1 + y2 */
+        bary_add(v1ds, v1n, v1ds, v1n, y1ds, y1n);
+
+        /* y(-2) : v3 <- 2 * (v2 + y2) - y0 = y0 - 2 * (y1 - 2 * y2) */
+        v3p = 1;
+        if (v2p) {
+            bary_add(v3ds, v3n, v2ds, v2n, y2ds, y2n);
+        }
+        else if (bary_sub(v3ds, v3n, y2ds, y2n, v2ds, v2n)) {
+            bary_2comp(v3ds, v3n);
+            v3p = 0;
+        }
+        bary_small_lshift(v3ds, v3ds, v3n, 1);
+        if (!v3p) {
+            bary_add(v3ds, v3n, v3ds, v3n, y0ds, y0n);
+        }
+        else if (bary_sub(v3ds, v3n, v3ds, v3n, y0ds, y0n)) {
+            bary_2comp(v3ds, v3n);
+            v3p = 0;
+        }
+    }
+
+    /* z(0) : t0 <- x0 * y0 */
+    bary_mul_toom3_start(t0ds, t0n, x0ds, x0n, y0ds, y0n, wds, wn);
+    t0p = 1;
+
+    /* z(1) : t1 <- u1 * v1 */
+    bary_mul_toom3_start(t1ds, t1n, u1ds, u1n, v1ds, v1n, wds, wn);
+    t1p = u1p == v1p;
+    assert(t1ds[t1n-1] == 0);
+    t1n--;
+
+    /* z(-1) : t2 <- u2 * v2 */
+    bary_mul_toom3_start(t2ds, t2n, u2ds, u2n, v2ds, v2n, wds, wn);
+    t2p = u2p == v2p;
+    assert(t2ds[t2n-1] == 0);
+    t2n--;
+
+    /* z(-2) : t3 <- u3 * v3 */
+    bary_mul_toom3_start(t3ds, t3n, u3ds, u3n, v3ds, v3n, wds, wn);
+    t3p = u3p == v3p;
+    assert(t3ds[t3n-1] == 0);
+    t3n--;
+
+    /* z(inf) : t4 <- x2 * y2 */
+    bary_mul_toom3_start(t4ds, t4n, x2ds, x2n, y2ds, y2n, wds, wn);
+    t4p = 1;
+
+    /*
+     * [Step2] interpolating z0, z1, z2, z3 and z4.
+     */
+
+    /* z0 <- z(0) == t0 */
+    z0n = t0n; z0ds = t0ds;
+
+    /* z4 <- z(inf) == t4 */
+    z4n = t4n; z4ds = t4ds;
+
+    /* z3 <- (z(-2) - z(1)) / 3 == (t3 - t1) / 3 */
+    if (t3p == t1p) {
+        z3p = t3p;
+        if (bary_sub(z3ds, z3n, t3ds, t3n, t1ds, t1n)) {
+            bary_2comp(z3ds, z3n);
+            z3p = !z3p;
+        }
+    }
+    else {
+        z3p = t3p;
+        bary_add(z3ds, z3n, t3ds, t3n, t1ds, t1n);
+    }
+    bigdivrem_single(z3ds, z3ds, z3n, 3);
+
+    /* z1 <- (z(1) - z(-1)) / 2 == (t1 - t2) / 2 */
+    if (t1p == t2p) {
+        z1p = t1p;
+        if (bary_sub(z1ds, z1n, t1ds, t1n, t2ds, t2n)) {
+            bary_2comp(z1ds, z1n);
+            z1p = !z1p;
+        }
+    }
+    else {
+        z1p = t1p;
+        bary_add(z1ds, z1n, t1ds, t1n, t2ds, t2n);
+    }
+    bary_small_rshift(z1ds, z1ds, z1n, 1, 0);
+
+    /* z2 <- z(-1) - z(0) == t2 - t0 */
+    if (t2p == t0p) {
+        z2p = t2p;
+        if (bary_sub(z2ds, z2n, t2ds, t2n, t0ds, t0n)) {
+            bary_2comp(z2ds, z2n);
+            z2p = !z2p;
+        }
+    }
+    else {
+        z2p = t2p;
+        bary_add(z2ds, z2n, t2ds, t2n, t0ds, t0n);
+    }
+
+    /* z3 <- (z2 - z3) / 2 + 2 * z(inf) == (z2 - z3) / 2 + 2 * t4 */
+    if (z2p == z3p) {
+        z3p = z2p;
+        if (bary_sub(z3ds, z3n, z2ds, z2n, z3ds, z3n)) {
+            bary_2comp(z3ds, z3n);
+            z3p = !z3p;
+        }
+    }
+    else {
+        z3p = z2p;
+        bary_add(z3ds, z3n, z2ds, z2n, z3ds, z3n);
+    }
+    bary_small_rshift(z3ds, z3ds, z3n, 1, 0);
+    if (z3p == t4p) {
+        bary_muladd_1xN(z3ds, z3n, 2, t4ds, t4n);
+    }
+    else {
+        if (bary_mulsub_1xN(z3ds, z3n, 2, t4ds, t4n)) {
+            bary_2comp(z3ds, z3n);
+            z3p = !z3p;
+        }
+    }
+
+    /* z2 <- z2 + z1 - z(inf) == z2 + z1 - t4 */
+    if (z2p == z1p) {
+        bary_add(z2ds, z2n, z2ds, z2n, z1ds, z1n);
+    }
+    else {
+        if (bary_sub(z2ds, z2n, z2ds, z2n, z1ds, z1n)) {
+            bary_2comp(z2ds, z2n);
+            z2p = !z2p;
+        }
+    }
+
+    if (z2p == t4p) {
+        if (bary_sub(z2ds, z2n, z2ds, z2n, t4ds, t4n)) {
+            bary_2comp(z2ds, z2n);
+            z2p = !z2p;
+        }
+    }
+    else {
+        bary_add(z2ds, z2n, z2ds, z2n, t4ds, t4n);
+    }
+
+    /* z1 <- z1 - z3 */
+    if (z1p == z3p) {
+        if (bary_sub(z1ds, z1n, z1ds, z1n, z3ds, z3n)) {
+            bary_2comp(z1ds, z1n);
+            z1p = !z1p;
+        }
+    }
+    else {
+        bary_add(z1ds, z1n, z1ds, z1n, z3ds, z3n);
+    }
+
+    /*
+     * [Step3] Substituting base value into b of the polynomial z(b),
+     */
+
+    MEMCPY(zzds, z0ds, BDIGIT, z0n);
+    BDIGITS_ZERO(zzds + z0n, 4*n - z0n);
+    MEMCPY(zzds + 4*n, z4ds, BDIGIT, z4n);
+    BDIGITS_ZERO(zzds + 4*n + z4n, zzn - (4*n + z4n));
+    if (z1p)
+        bary_add(zzds +   n, zzn -   n, zzds +   n, zzn -   n, z1ds, z1n);
+    else
+        bary_sub(zzds +   n, zzn -   n, zzds +   n, zzn -   n, z1ds, z1n);
+    if (z2p)
+        bary_add(zzds + 2*n, zzn - 2*n, zzds + 2*n, zzn - 2*n, z2ds, z2n);
+    else
+        bary_sub(zzds + 2*n, zzn - 2*n, zzds + 2*n, zzn - 2*n, z2ds, z2n);
+    if (z3p)
+        bary_add(zzds + 3*n, zzn - 3*n, zzds + 3*n, zzn - 3*n, z3ds, z3n);
+    else
+        bary_sub(zzds + 3*n, zzn - 3*n, zzds + 3*n, zzn - 3*n, z3ds, z3n);
+
+    BARY_TRUNC(zzds, zzn);
+    MEMCPY(zds, zzds, BDIGIT, zzn);
+    BDIGITS_ZERO(zds + zzn, zn - zzn);
+
+    if (work)
+        ALLOCV_END(work);
+}
+
+VALUE
+rb_big_mul_toom3(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    if (xn > yn || yn < 3 || !TOOM3_BALANCED(xn,yn))
+        rb_raise(rb_eArgError, "unexpected bignum length for toom3");
+    bary_mul_toom3(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, NULL, 0);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return z;
+}
+
+#if USE_GMP
+static inline void
+bdigits_to_mpz(mpz_t mp, const BDIGIT *digits, size_t len)
+{
+    const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
+    mpz_import(mp, len, -1, sizeof(BDIGIT), 0, nails, digits);
+}
+
+static inline void
+bdigits_from_mpz(mpz_t mp, BDIGIT *digits, size_t *len)
+{
+    const size_t nails = (sizeof(BDIGIT)-SIZEOF_BDIGIT)*CHAR_BIT;
+    mpz_export(digits, len, -1, sizeof(BDIGIT), 0, nails, mp);
+}
+
+static void
+bary_mul_gmp(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    mpz_t x, y, z;
+    size_t count;
+
+    assert(xn + yn <= zn);
+
+    mpz_init(x);
+    mpz_init(y);
+    mpz_init(z);
+    bdigits_to_mpz(x, xds, xn);
+    if (xds == yds && xn == yn) {
+        mpz_mul(z, x, x);
+    }
+    else {
+        bdigits_to_mpz(y, yds, yn);
+        mpz_mul(z, x, y);
+    }
+    bdigits_from_mpz(z, zds, &count);
+    BDIGITS_ZERO(zds+count, zn-count);
+    mpz_clear(x);
+    mpz_clear(y);
+    mpz_clear(z);
+}
+
+VALUE
+rb_big_mul_gmp(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), zn = xn + yn;
+    VALUE z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    bary_mul_gmp(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return z;
+}
+#endif
+
+static void
+bary_short_mul(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    assert(xn + yn <= zn);
+
+    if (xn == 1 && yn == 1) {
+        bary_mul_single(zds, zn, xds[0], yds[0]);
+    }
+    else {
+        bary_mul_normal(zds, zn, xds, xn, yds, yn);
+        rb_thread_check_ints();
+    }
+}
+
+/* determine whether a bignum is sparse or not by random sampling */
+static inline int
+bary_sparse_p(const BDIGIT *ds, size_t n)
+{
+    long c = 0;
+
+    if (          ds[2 * n / 5]) c++;
+    if (c <= 1 && ds[    n / 2]) c++;
+    if (c <= 1 && ds[3 * n / 5]) c++;
+
+    return (c <= 1) ? 1 : 0;
+}
+
+static int
+bary_mul_precheck(BDIGIT **zdsp, size_t *znp, const BDIGIT **xdsp, size_t *xnp, const BDIGIT **ydsp, size_t *ynp)
+{
+    size_t nlsz; /* number of least significant zero BDIGITs */
+
+    BDIGIT *zds = *zdsp;
+    size_t zn = *znp;
+    const BDIGIT *xds = *xdsp;
+    size_t xn = *xnp;
+    const BDIGIT *yds = *ydsp;
+    size_t yn = *ynp;
+
+    assert(xn + yn <= zn);
+
+    nlsz = 0;
+
+    while (0 < xn) {
+        if (xds[xn-1] == 0) {
+            xn--;
+        }
+        else {
+            do {
+                if (xds[0] != 0)
+                    break;
+                xds++;
+                xn--;
+                nlsz++;
+            } while (0 < xn);
+            break;
+        }
+    }
+
+    while (0 < yn) {
+        if (yds[yn-1] == 0) {
+            yn--;
+        }
+        else {
+            do {
+                if (yds[0] != 0)
+                    break;
+                yds++;
+                yn--;
+                nlsz++;
+            } while (0 < yn);
+            break;
+        }
+    }
+
+    if (nlsz) {
+        BDIGITS_ZERO(zds, nlsz);
+        zds += nlsz;
+        zn -= nlsz;
+    }
+
+    /* make sure that y is longer than x */
+    if (xn > yn) {
+        const BDIGIT *tds;
+        size_t tn;
+        tds = xds; xds = yds; yds = tds;
+        tn = xn; xn = yn; yn = tn;
+    }
+    assert(xn <= yn);
+
+    if (xn <= 1) {
+        if (xn == 0) {
+            BDIGITS_ZERO(zds, zn);
+            return 1;
+        }
+
+        if (xds[0] == 1) {
+            MEMCPY(zds, yds, BDIGIT, yn);
+            BDIGITS_ZERO(zds+yn, zn-yn);
+            return 1;
+        }
+        if (POW2_P(xds[0])) {
+            zds[yn] = bary_small_lshift(zds, yds, yn, bit_length(xds[0])-1);
+            BDIGITS_ZERO(zds+yn+1, zn-yn-1);
+            return 1;
+        }
+        if (yn == 1 && yds[0] == 1) {
+            zds[0] = xds[0];
+            BDIGITS_ZERO(zds+1, zn-1);
+            return 1;
+        }
+        bary_mul_normal(zds, zn, xds, xn, yds, yn);
+        return 1;
+    }
+
+    *zdsp = zds;
+    *znp = zn;
+    *xdsp = xds;
+    *xnp = xn;
+    *ydsp = yds;
+    *ynp = yn;
+
+    return 0;
+}
+
+static void
+bary_mul_karatsuba_branch(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
+{
+    /* normal multiplication when x is small */
+    if (xn < KARATSUBA_MUL_DIGITS) {
+        goto normal;
+    }
+
+    /* normal multiplication when x or y is a sparse bignum */
+    if (bary_sparse_p(xds, xn)) goto normal;
+    if (bary_sparse_p(yds, yn)) {
+        bary_short_mul(zds, zn, yds, yn, xds, xn);
+        return;
+    }
+
+    /* balance multiplication by slicing y when x is much smaller than y */
+    if (!KARATSUBA_BALANCED(xn, yn)) {
+        bary_mul_balance_with_mulfunc(zds, zn, xds, xn, yds, yn, wds, wn, bary_mul_karatsuba_start);
+        return;
+    }
+
+    /* multiplication by karatsuba method */
+    bary_mul_karatsuba(zds, zn, xds, xn, yds, yn, wds, wn);
+    return;
+
+  normal:
+    if (xds == yds && xn == yn) {
+        bary_sq_fast(zds, zn, xds, xn);
+    }
+    else {
+        bary_short_mul(zds, zn, xds, xn, yds, yn);
+    }
+}
+
+static void
+bary_mul_karatsuba_start(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
+{
+    if (bary_mul_precheck(&zds, &zn, &xds, &xn, &yds, &yn))
+        return;
+
+    bary_mul_karatsuba_branch(zds, zn, xds, xn, yds, yn, wds, wn);
+}
+
+static void
+bary_mul_toom3_branch(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
+{
+    if (xn < TOOM3_MUL_DIGITS) {
+        bary_mul_karatsuba_branch(zds, zn, xds, xn, yds, yn, wds, wn);
+        return;
+    }
+
+    if (!TOOM3_BALANCED(xn, yn)) {
+        bary_mul_balance_with_mulfunc(zds, zn, xds, xn, yds, yn, wds, wn, bary_mul_toom3_start);
+        return;
+    }
+
+    bary_mul_toom3(zds, zn, xds, xn, yds, yn, wds, wn);
+}
+
+static void
+bary_mul_toom3_start(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
+{
+    if (bary_mul_precheck(&zds, &zn, &xds, &xn, &yds, &yn))
+        return;
+
+    bary_mul_toom3_branch(zds, zn, xds, xn, yds, yn, wds, wn);
+}
+
+static void
+bary_mul(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    if (xn <= yn) {
+        if (xn < NAIVE_MUL_DIGITS) {
+            if (xds == yds && xn == yn)
+                bary_sq_fast(zds, zn, xds, xn);
+            else
+                bary_short_mul(zds, zn, xds, xn, yds, yn);
+            return;
+        }
+    }
+    else {
+        if (yn < NAIVE_MUL_DIGITS) {
+            bary_short_mul(zds, zn, yds, yn, xds, xn);
+            return;
+        }
+    }
+
+#if USE_GMP
+    bary_mul_gmp(zds, zn, xds, xn, yds, yn);
+#else
+    bary_mul_toom3_start(zds, zn, xds, xn, yds, yn, NULL, 0);
+#endif
+}
+
+struct big_div_struct {
+    size_t yn, zn;
+    BDIGIT *yds, *zds;
+    volatile VALUE stop;
+};
+
+static void *
+bigdivrem1(void *ptr)
+{
+    struct big_div_struct *bds = (struct big_div_struct*)ptr;
+    size_t yn = bds->yn;
+    size_t zn = bds->zn;
+    BDIGIT *yds = bds->yds, *zds = bds->zds;
+    BDIGIT_DBL_SIGNED num;
+    BDIGIT q;
+
+    do {
+        if (bds->stop) {
+            bds->zn = zn;
+            return 0;
+        }
+        if (zds[zn-1] == yds[yn-1]) q = BDIGMAX;
+        else q = (BDIGIT)((BIGUP(zds[zn-1]) + zds[zn-2])/yds[yn-1]);
+        if (q) {
+            num = bigdivrem_mulsub(zds+zn-(yn+1), yn+1,
+                                   q,
+                                   yds, yn);
+            while (num) { /* "add back" required */
+                q--;
+                num = bary_add(zds+zn-(yn+1), yn,
+                               zds+zn-(yn+1), yn,
+                               yds, yn);
+                num--;
+            }
+        }
+        zn--;
+        zds[zn] = q;
+    } while (zn > yn);
+    return 0;
+}
+
+/* async-signal-safe */
+static void
+rb_big_stop(void *ptr)
+{
+    struct big_div_struct *bds = ptr;
+    bds->stop = Qtrue;
+}
+
+static BDIGIT
+bigdivrem_single1(BDIGIT *qds, const BDIGIT *xds, size_t xn, BDIGIT x_higher_bdigit, BDIGIT y)
+{
+    assert(0 < xn);
+    assert(x_higher_bdigit < y);
+    if (POW2_P(y)) {
+        BDIGIT r;
+        r = xds[0] & (y-1);
+        bary_small_rshift(qds, xds, xn, bit_length(y)-1, x_higher_bdigit);
+        return r;
+    }
+    else {
+        size_t i;
+        BDIGIT_DBL t2;
+        t2 = x_higher_bdigit;
+        for (i = 0; i < xn; i++) {
+            t2 = BIGUP(t2) + xds[xn - i - 1];
+            qds[xn - i - 1] = (BDIGIT)(t2 / y);
+            t2 %= y;
+        }
+        return (BDIGIT)t2;
+    }
+}
+
+static BDIGIT
+bigdivrem_single(BDIGIT *qds, const BDIGIT *xds, size_t xn, BDIGIT y)
+{
+    return bigdivrem_single1(qds, xds, xn, 0, y);
+}
+
+static void
+bigdivrem_restoring(BDIGIT *zds, size_t zn, BDIGIT *yds, size_t yn)
+{
+    struct big_div_struct bds;
+    size_t ynzero;
+
+    assert(yn < zn);
+    assert(BDIGIT_MSB(yds[yn-1]));
+    assert(zds[zn-1] < yds[yn-1]);
+
+    for (ynzero = 0; !yds[ynzero]; ynzero++);
+
+    if (ynzero+1 == yn) {
+        BDIGIT r;
+        r = bigdivrem_single1(zds+yn, zds+ynzero, zn-yn, zds[zn-1], yds[ynzero]);
+        zds[ynzero] = r;
+        return;
+    }
+
+    bds.yn = yn - ynzero;
+    bds.zds = zds + ynzero;
+    bds.yds = yds + ynzero;
+    bds.stop = Qfalse;
+    bds.zn = zn - ynzero;
+    if (bds.zn > 10000 || bds.yn > 10000) {
+      retry:
+        bds.stop = Qfalse;
+        rb_nogvl(bigdivrem1, &bds, rb_big_stop, &bds, RB_NOGVL_UBF_ASYNC_SAFE);
+
+        if (bds.stop == Qtrue) {
+            /* execute trap handler, but exception was not raised. */
+            goto retry;
+        }
+    }
+    else {
+        bigdivrem1(&bds);
+    }
+}
+
+static void
+bary_divmod_normal(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    int shift;
+    BDIGIT *zds, *yyds;
+    size_t zn;
+    VALUE tmpyz = 0;
+
+    assert(yn < xn || (xn == yn && yds[yn - 1] <= xds[xn - 1]));
+    assert(qds ? (xn - yn + 1) <= qn : 1);
+    assert(rds ? yn <= rn : 1);
+
+    zn = xn + BIGDIVREM_EXTRA_WORDS;
+
+    shift = nlz(yds[yn-1]);
+    if (shift) {
+        int alloc_y = !rds;
+        int alloc_z = !qds || qn < zn;
+        if (alloc_y && alloc_z) {
+            yyds = ALLOCV_N(BDIGIT, tmpyz, yn+zn);
+            zds = yyds + yn;
+        }
+        else {
+            yyds = alloc_y ? ALLOCV_N(BDIGIT, tmpyz, yn) : rds;
+            zds = alloc_z ? ALLOCV_N(BDIGIT, tmpyz, zn) : qds;
+        }
+        zds[xn] = bary_small_lshift(zds, xds, xn, shift);
+        bary_small_lshift(yyds, yds, yn, shift);
+    }
+    else {
+        if (qds && zn <= qn)
+            zds = qds;
+        else
+            zds = ALLOCV_N(BDIGIT, tmpyz, zn);
+        MEMCPY(zds, xds, BDIGIT, xn);
+        zds[xn] = 0;
+        /* bigdivrem_restoring will not modify y.
+         * So use yds directly.  */
+        yyds = (BDIGIT *)yds;
+    }
+
+    bigdivrem_restoring(zds, zn, yyds, yn);
+
+    if (rds) {
+        if (shift)
+            bary_small_rshift(rds, zds, yn, shift, 0);
+        else
+            MEMCPY(rds, zds, BDIGIT, yn);
+        BDIGITS_ZERO(rds+yn, rn-yn);
+    }
+
+    if (qds) {
+        size_t j = zn - yn;
+        MEMMOVE(qds, zds+yn, BDIGIT, j);
+        BDIGITS_ZERO(qds+j, qn-j);
+    }
+
+    if (tmpyz)
+        ALLOCV_END(tmpyz);
+}
+
+VALUE
+rb_big_divrem_normal(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), qn, rn;
+    BDIGIT *xds = BDIGITS(x), *yds = BDIGITS(y), *qds, *rds;
+    VALUE q, r;
+
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
+    BARY_TRUNC(xds, xn);
+
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1]))
+        return rb_assoc_new(LONG2FIX(0), x);
+
+    qn = xn + BIGDIVREM_EXTRA_WORDS;
+    q = bignew(qn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    qds = BDIGITS(q);
+
+    rn = yn;
+    r = bignew(rn, BIGNUM_SIGN(x));
+    rds = BDIGITS(r);
+
+    bary_divmod_normal(qds, qn, rds, rn, xds, xn, yds, yn);
+
+    bigtrunc(q);
+    bigtrunc(r);
+
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+
+    return rb_assoc_new(q, r);
+}
+
+#if USE_GMP
+static void
+bary_divmod_gmp(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    mpz_t x, y, q, r;
+    size_t count;
+
+    assert(yn < xn || (xn == yn && yds[yn - 1] <= xds[xn - 1]));
+    assert(qds ? (xn - yn + 1) <= qn : 1);
+    assert(rds ? yn <= rn : 1);
+    assert(qds || rds);
+
+    mpz_init(x);
+    mpz_init(y);
+    if (qds) mpz_init(q);
+    if (rds) mpz_init(r);
+
+    bdigits_to_mpz(x, xds, xn);
+    bdigits_to_mpz(y, yds, yn);
+
+    if (!rds) {
+        mpz_fdiv_q(q, x, y);
+    }
+    else if (!qds) {
+        mpz_fdiv_r(r, x, y);
+    }
+    else {
+        mpz_fdiv_qr(q, r, x, y);
+    }
+
+    mpz_clear(x);
+    mpz_clear(y);
+
+    if (qds) {
+        bdigits_from_mpz(q, qds, &count);
+        BDIGITS_ZERO(qds+count, qn-count);
+        mpz_clear(q);
+    }
+
+    if (rds) {
+        bdigits_from_mpz(r, rds, &count);
+        BDIGITS_ZERO(rds+count, rn-count);
+        mpz_clear(r);
+    }
+}
+
+VALUE
+rb_big_divrem_gmp(VALUE x, VALUE y)
+{
+    size_t xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y), qn, rn;
+    BDIGIT *xds = BDIGITS(x), *yds = BDIGITS(y), *qds, *rds;
+    VALUE q, r;
+
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
+    BARY_TRUNC(xds, xn);
+
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1]))
+        return rb_assoc_new(LONG2FIX(0), x);
+
+    qn = xn - yn + 1;
+    q = bignew(qn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+    qds = BDIGITS(q);
+
+    rn = yn;
+    r = bignew(rn, BIGNUM_SIGN(x));
+    rds = BDIGITS(r);
+
+    bary_divmod_gmp(qds, qn, rds, rn, xds, xn, yds, yn);
+
+    bigtrunc(q);
+    bigtrunc(r);
+
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+
+    return rb_assoc_new(q, r);
+}
+#endif
+
+static void
+bary_divmod_branch(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+#if USE_GMP
+    if (GMP_DIV_DIGITS < xn) {
+        bary_divmod_gmp(qds, qn, rds, rn, xds, xn, yds, yn);
+        return;
+    }
+#endif
+    bary_divmod_normal(qds, qn, rds, rn, xds, xn, yds, yn);
+}
+
+static void
+bary_divmod(BDIGIT *qds, size_t qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    assert(xn <= qn);
+    assert(yn <= rn);
+
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
+
+    BARY_TRUNC(xds, xn);
+    if (xn == 0) {
+        BDIGITS_ZERO(qds, qn);
+        BDIGITS_ZERO(rds, rn);
+        return;
+    }
+
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1])) {
+        MEMCPY(rds, xds, BDIGIT, xn);
+        BDIGITS_ZERO(rds+xn, rn-xn);
+        BDIGITS_ZERO(qds, qn);
+    }
+    else if (yn == 1) {
+        MEMCPY(qds, xds, BDIGIT, xn);
+        BDIGITS_ZERO(qds+xn, qn-xn);
+        rds[0] = bigdivrem_single(qds, xds, xn, yds[0]);
+        BDIGITS_ZERO(rds+1, rn-1);
+    }
+    else if (xn == 2 && yn == 2) {
+        BDIGIT_DBL x = bary2bdigitdbl(xds, 2);
+        BDIGIT_DBL y = bary2bdigitdbl(yds, 2);
+        BDIGIT_DBL q = x / y;
+        BDIGIT_DBL r = x % y;
+        qds[0] = BIGLO(q);
+        qds[1] = BIGLO(BIGDN(q));
+        BDIGITS_ZERO(qds+2, qn-2);
+        rds[0] = BIGLO(r);
+        rds[1] = BIGLO(BIGDN(r));
+        BDIGITS_ZERO(rds+2, rn-2);
+    }
+    else {
+        bary_divmod_branch(qds, qn, rds, rn, xds, xn, yds, yn);
+    }
+}
+
+
+#ifndef BIGNUM_DEBUG
+# define BIGNUM_DEBUG (0+RUBY_DEBUG)
+#endif
+
+static int
+bigzero_p(VALUE x)
+{
+    return bary_zero_p(BDIGITS(x), BIGNUM_LEN(x));
+}
+
 int
 rb_bigzero_p(VALUE x)
 {
@@ -93,7 +2953,7 @@ int
 rb_cmpint(VALUE val, VALUE a, VALUE b)
 {
     if (NIL_P(val)) {
-	rb_cmperr(a, b);
+        rb_cmperr(a, b);
     }
     if (FIXNUM_P(val)) {
         long l = FIX2LONG(val);
@@ -101,86 +2961,86 @@ rb_cmpint(VALUE val, VALUE a, VALUE b)
         if (l < 0) return -1;
         return 0;
     }
-    if (RB_TYPE_P(val, T_BIGNUM)) {
-	if (BIGZEROP(val)) return 0;
-	if (RBIGNUM_SIGN(val)) return 1;
-	return -1;
+    if (RB_BIGNUM_TYPE_P(val)) {
+        if (BIGZEROP(val)) return 0;
+        if (BIGNUM_SIGN(val)) return 1;
+        return -1;
     }
     if (RTEST(rb_funcall(val, '>', 1, INT2FIX(0)))) return 1;
     if (RTEST(rb_funcall(val, '<', 1, INT2FIX(0)))) return -1;
     return 0;
 }
 
-#define RBIGNUM_SET_LEN(b,l) \
-    ((RBASIC(b)->flags & RBIGNUM_EMBED_FLAG) ? \
+#define BIGNUM_SET_LEN(b,l) \
+    (BIGNUM_EMBED_P(b) ? \
      (void)(RBASIC(b)->flags = \
-	    (RBASIC(b)->flags & ~RBIGNUM_EMBED_LEN_MASK) | \
-	    ((l) << RBIGNUM_EMBED_LEN_SHIFT)) : \
+            (RBASIC(b)->flags & ~BIGNUM_EMBED_LEN_MASK) | \
+            ((l) << BIGNUM_EMBED_LEN_SHIFT)) : \
      (void)(RBIGNUM(b)->as.heap.len = (l)))
 
 static void
-rb_big_realloc(VALUE big, long len)
+rb_big_realloc(VALUE big, size_t len)
 {
     BDIGIT *ds;
-    if (RBASIC(big)->flags & RBIGNUM_EMBED_FLAG) {
-	if (RBIGNUM_EMBED_LEN_MAX < len) {
-	    ds = ALLOC_N(BDIGIT, len);
-	    MEMCPY(ds, RBIGNUM(big)->as.ary, BDIGIT, RBIGNUM_EMBED_LEN_MAX);
-	    RBIGNUM(big)->as.heap.len = RBIGNUM_LEN(big);
-	    RBIGNUM(big)->as.heap.digits = ds;
-	    RBASIC(big)->flags &= ~RBIGNUM_EMBED_FLAG;
-	}
-    }
-    else {
-	if (len <= RBIGNUM_EMBED_LEN_MAX) {
-	    ds = RBIGNUM(big)->as.heap.digits;
-	    RBASIC(big)->flags |= RBIGNUM_EMBED_FLAG;
-	    RBIGNUM_SET_LEN(big, len);
-	    if (ds) {
-		MEMCPY(RBIGNUM(big)->as.ary, ds, BDIGIT, len);
-		xfree(ds);
-	    }
-	}
-	else {
-	    if (RBIGNUM_LEN(big) == 0) {
-		RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len);
-	    }
-	    else {
-		REALLOC_N(RBIGNUM(big)->as.heap.digits, BDIGIT, len);
-	    }
-	}
+    if (BIGNUM_EMBED_P(big)) {
+        if (BIGNUM_EMBED_LEN_MAX < len) {
+            ds = ALLOC_N(BDIGIT, len);
+            MEMCPY(ds, RBIGNUM(big)->as.ary, BDIGIT, BIGNUM_EMBED_LEN_MAX);
+            RBIGNUM(big)->as.heap.len = BIGNUM_LEN(big);
+            RBIGNUM(big)->as.heap.digits = ds;
+            FL_UNSET_RAW(big, BIGNUM_EMBED_FLAG);
+        }
+    }
+    else {
+        if (len <= BIGNUM_EMBED_LEN_MAX) {
+            ds = RBIGNUM(big)->as.heap.digits;
+            FL_SET_RAW(big, BIGNUM_EMBED_FLAG);
+            BIGNUM_SET_LEN(big, len);
+            (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)RBIGNUM(big)->as.ary, sizeof(RBIGNUM(big)->as.ary));
+            if (ds) {
+                MEMCPY(RBIGNUM(big)->as.ary, ds, BDIGIT, len);
+                xfree(ds);
+            }
+        }
+        else {
+            if (BIGNUM_LEN(big) == 0) {
+                RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len);
+            }
+            else {
+                REALLOC_N(RBIGNUM(big)->as.heap.digits, BDIGIT, len);
+            }
+        }
     }
 }
 
 void
-rb_big_resize(VALUE big, long len)
+rb_big_resize(VALUE big, size_t len)
 {
     rb_big_realloc(big, len);
-    RBIGNUM_SET_LEN(big, len);
+    BIGNUM_SET_LEN(big, len);
 }
 
 static VALUE
-bignew_1(VALUE klass, long len, int sign)
+bignew_1(VALUE klass, size_t len, int sign)
 {
-    NEWOBJ(big, struct RBignum);
-    OBJSETUP(big, klass, T_BIGNUM);
-    RBIGNUM_SET_SIGN(big, sign?1:0);
-    if (len <= RBIGNUM_EMBED_LEN_MAX) {
-	RBASIC(big)->flags |= RBIGNUM_EMBED_FLAG;
-	RBIGNUM_SET_LEN(big, len);
+    NEWOBJ_OF(big, struct RBignum, klass, T_BIGNUM | (RGENGC_WB_PROTECTED_BIGNUM ? FL_WB_PROTECTED : 0));
+    VALUE bigv = (VALUE)big;
+    BIGNUM_SET_SIGN(bigv, sign);
+    if (len <= BIGNUM_EMBED_LEN_MAX) {
+        FL_SET_RAW(bigv, BIGNUM_EMBED_FLAG);
+        BIGNUM_SET_LEN(bigv, len);
+        (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)big->as.ary, sizeof(big->as.ary));
     }
     else {
-	RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len);
-	RBIGNUM(big)->as.heap.len = len;
+        big->as.heap.digits = ALLOC_N(BDIGIT, len);
+        big->as.heap.len = len;
     }
-
-    return (VALUE)big;
+    OBJ_FREEZE(bigv);
+    return bigv;
 }
 
-#define bignew(len,sign) bignew_1(rb_cBignum,(len),(sign))
-
 VALUE
-rb_big_new(long len, int sign)
+rb_big_new(size_t len, int sign)
 {
     return bignew(len, sign != 0);
 }
@@ -188,33 +3048,29 @@ rb_big_new(long len, int sign)
 VALUE
 rb_big_clone(VALUE x)
 {
-    long len = RBIGNUM_LEN(x);
-    VALUE z = bignew_1(CLASS_OF(x), len, RBIGNUM_SIGN(x));
+    size_t len = BIGNUM_LEN(x);
+    VALUE z = bignew_1(CLASS_OF(x), len, BIGNUM_SIGN(x));
 
     MEMCPY(BDIGITS(z), BDIGITS(x), BDIGIT, len);
     return z;
 }
 
+static void
+big_extend_carry(VALUE x)
+{
+    rb_big_resize(x, BIGNUM_LEN(x)+1);
+    BDIGITS(x)[BIGNUM_LEN(x)-1] = 1;
+}
+
 /* modify a bignum by 2's complement */
 static void
 get2comp(VALUE x)
 {
-    long i = RBIGNUM_LEN(x);
+    long i = BIGNUM_LEN(x);
     BDIGIT *ds = BDIGITS(x);
-    BDIGIT_DBL num;
 
-    if (!i) return;
-    while (i--) ds[i] = ~ds[i];
-    i = 0; num = 1;
-    do {
-	num += ds[i];
-	ds[i++] = BIGLO(num);
-	num = BIGDN(num);
-    } while (i < RBIGNUM_LEN(x));
-    if (num != 0) {
-	rb_big_resize(x, RBIGNUM_LEN(x)+1);
-	ds = BDIGITS(x);
-	ds[RBIGNUM_LEN(x)-1] = 1;
+    if (bary_2comp(ds, i)) {
+        big_extend_carry(x);
     }
 }
 
@@ -224,16 +3080,46 @@ rb_big_2comp(VALUE x)			/* get 2's complement */
     get2comp(x);
 }
 
+static BDIGIT
+abs2twocomp(VALUE *xp, long *n_ret)
+{
+    VALUE x = *xp;
+    long n = BIGNUM_LEN(x);
+    BDIGIT *ds = BDIGITS(x);
+    BDIGIT hibits = 0;
+
+    BARY_TRUNC(ds, n);
+
+    if (n != 0 && BIGNUM_NEGATIVE_P(x)) {
+        VALUE z = bignew_1(CLASS_OF(x), n, 0);
+        MEMCPY(BDIGITS(z), ds, BDIGIT, n);
+        bary_2comp(BDIGITS(z), n);
+        hibits = BDIGMAX;
+        *xp = z;
+    }
+    *n_ret = n;
+    return hibits;
+}
+
+static void
+twocomp2abs_bang(VALUE x, int hibits)
+{
+    BIGNUM_SET_SIGN(x, !hibits);
+    if (hibits) {
+        get2comp(x);
+    }
+}
+
 static inline VALUE
 bigtrunc(VALUE x)
 {
-    long len = RBIGNUM_LEN(x);
+    size_t len = BIGNUM_LEN(x);
     BDIGIT *ds = BDIGITS(x);
 
     if (len == 0) return x;
     while (--len && !ds[len]);
-    if (RBIGNUM_LEN(x) > len+1) {
-	rb_big_resize(x, len+1);
+    if (BIGNUM_LEN(x) > len+1) {
+        rb_big_resize(x, len+1);
     }
     return x;
 }
@@ -241,36 +3127,52 @@ bigtrunc(VALUE x)
 static inline VALUE
 bigfixize(VALUE x)
 {
-    long len = RBIGNUM_LEN(x);
+    size_t n = BIGNUM_LEN(x);
     BDIGIT *ds = BDIGITS(x);
-
-    if (len == 0) return INT2FIX(0);
-    if ((size_t)(len*SIZEOF_BDIGITS) <= sizeof(long)) {
-	long num = 0;
-#if 2*SIZEOF_BDIGITS > SIZEOF_LONG
-	num = (long)ds[0];
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    unsigned long u;
 #else
-	while (len--) {
-	    num = (long)(BIGUP(num) + ds[len]);
-	}
-#endif
-	if (num >= 0) {
-	    if (RBIGNUM_SIGN(x)) {
-		if (POSFIXABLE(num)) return LONG2FIX(num);
-	    }
-	    else {
-		if (NEGFIXABLE(-num)) return LONG2FIX(-num);
-	    }
-	}
+    BDIGIT u;
+#endif
+
+    BARY_TRUNC(ds, n);
+
+    if (n == 0) return INT2FIX(0);
+
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (sizeof(long)/SIZEOF_BDIGIT < n)
+        goto return_big;
+    else {
+        int i = (int)n;
+        u = 0;
+        while (i--) {
+            u = (unsigned long)(BIGUP(u) + ds[i]);
+        }
     }
+#else /* SIZEOF_BDIGIT >= SIZEOF_LONG */
+    if (1 < n)
+        goto return_big;
+    else
+        u = ds[0];
+#endif
+
+    if (BIGNUM_POSITIVE_P(x)) {
+        if (POSFIXABLE(u)) return LONG2FIX((long)u);
+    }
+    else {
+        if (u <= -FIXNUM_MIN) return LONG2FIX(-(long)u);
+    }
+
+  return_big:
+    rb_big_resize(x, n);
     return x;
 }
 
 static VALUE
 bignorm(VALUE x)
 {
-    if (RB_TYPE_P(x, T_BIGNUM)) {
-	x = bigfixize(bigtrunc(x));
+    if (RB_BIGNUM_TYPE_P(x)) {
+        x = bigfixize(x);
     }
     return x;
 }
@@ -282,542 +3184,1305 @@ rb_big_norm(VALUE x)
 }
 
 VALUE
-rb_uint2big(VALUE n)
+rb_uint2big(uintptr_t n)
 {
-    BDIGIT_DBL num = n;
-    long i = 0;
-    BDIGIT *digits;
-    VALUE big;
+    long i;
+    VALUE big = bignew(bdigit_roomof(SIZEOF_VALUE), 1);
+    BDIGIT *digits = BDIGITS(big);
 
-    big = bignew(DIGSPERLONG, 1);
-    digits = BDIGITS(big);
-    while (i < DIGSPERLONG) {
-	digits[i++] = BIGLO(num);
-	num = BIGDN(num);
+#if SIZEOF_BDIGIT >= SIZEOF_VALUE
+    digits[0] = n;
+#else
+    for (i = 0; i < bdigit_roomof(SIZEOF_VALUE); i++) {
+        digits[i] = BIGLO(n);
+        n = BIGDN(n);
     }
+#endif
 
-    i = DIGSPERLONG;
+    i = bdigit_roomof(SIZEOF_VALUE);
     while (--i && !digits[i]) ;
-    RBIGNUM_SET_LEN(big, i+1);
+    BIGNUM_SET_LEN(big, i+1);
     return big;
 }
 
 VALUE
-rb_int2big(SIGNED_VALUE n)
+rb_int2big(intptr_t n)
 {
     long neg = 0;
+    VALUE u;
     VALUE big;
 
     if (n < 0) {
-	n = -n;
-	neg = 1;
+        u = 1 + (VALUE)(-(n + 1)); /* u = -n avoiding overflow */
+        neg = 1;
     }
-    big = rb_uint2big(n);
+    else {
+        u = n;
+    }
+    big = rb_uint2big(u);
     if (neg) {
-	RBIGNUM_SET_SIGN(big, 0);
+        BIGNUM_SET_NEGATIVE_SIGN(big);
     }
     return big;
 }
 
 VALUE
-rb_uint2inum(VALUE n)
+rb_uint2inum(uintptr_t n)
 {
     if (POSFIXABLE(n)) return LONG2FIX(n);
     return rb_uint2big(n);
 }
 
 VALUE
-rb_int2inum(SIGNED_VALUE n)
+rb_int2inum(intptr_t n)
 {
     if (FIXABLE(n)) return LONG2FIX(n);
     return rb_int2big(n);
 }
 
-#if SIZEOF_LONG % SIZEOF_BDIGITS != 0
-# error unexpected SIZEOF_LONG : SIZEOF_BDIGITS ratio
-#endif
+void
+rb_big_pack(VALUE val, unsigned long *buf, long num_longs)
+{
+    rb_integer_pack(val, buf, num_longs, sizeof(long), 0,
+            INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP);
+}
+
+VALUE
+rb_big_unpack(unsigned long *buf, long num_longs)
+{
+    return rb_integer_unpack(buf, num_longs, sizeof(long), 0,
+            INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP);
+}
 
 /*
- * buf is an array of long integers.
- * buf is ordered from least significant word to most significant word.
- * buf[0] is the least significant word and
- * buf[num_longs-1] is the most significant word.
- * This means words in buf is little endian.
- * However each word in buf is native endian.
- * (buf[i]&1) is the least significant bit and
- * (buf[i]&(1<<(SIZEOF_LONG*CHAR_BIT-1))) is the most significant bit
- * for each 0 <= i < num_longs.
- * So buf is little endian at whole on a little endian machine.
- * But buf is mixed endian on a big endian machine.
+ * Calculate the number of bytes to be required to represent
+ * the absolute value of the integer given as _val_.
  *
- * The buf represents negative integers as two's complement.
- * So, the most significant bit of the most significant word,
- * (buf[num_longs-1]>>(SIZEOF_LONG*CHAR_BIT-1)),
- * is the sign bit: 1 means negative and 0 means zero or positive.
+ * [val] an integer.
+ * [nlz_bits_ret] number of leading zero bits in the most significant byte is returned if not NULL.
+ *
+ * This function returns ((val_numbits * CHAR_BIT + CHAR_BIT - 1) / CHAR_BIT)
+ * where val_numbits is the number of bits of abs(val).
+ * This function should not overflow.
+ *
+ * If nlz_bits_ret is not NULL,
+ * (return_value * CHAR_BIT - val_numbits) is stored in *nlz_bits_ret.
+ * In this case, 0 <= *nlz_bits_ret < CHAR_BIT.
  *
- * If given size of buf (num_longs) is not enough to represent val,
- * higier words (including a sign bit) are ignored.
  */
-void
-rb_big_pack(VALUE val, unsigned long *buf, long num_longs)
+size_t
+rb_absint_size(VALUE val, int *nlz_bits_ret)
 {
+    BDIGIT *dp;
+    BDIGIT *de;
+    BDIGIT fixbuf[bdigit_roomof(sizeof(long))];
+
+    int num_leading_zeros;
+
     val = rb_to_int(val);
-    if (num_longs == 0)
-        return;
+
     if (FIXNUM_P(val)) {
-        long i;
-        long tmp = FIX2LONG(val);
-        buf[0] = (unsigned long)tmp;
-        tmp = tmp < 0 ? ~0L : 0;
-        for (i = 1; i < num_longs; i++)
-            buf[i] = (unsigned long)tmp;
-        return;
-    }
-    else {
-        long len = RBIGNUM_LEN(val);
-        BDIGIT *ds = BDIGITS(val), *dend = ds + len;
-        long i, j;
-        for (i = 0; i < num_longs && ds < dend; i++) {
-            unsigned long l = 0;
-            for (j = 0; j < DIGSPERLONG && ds < dend; j++, ds++) {
-                l |= ((unsigned long)*ds << (j * BITSPERDIG));
-            }
-            buf[i] = l;
+        long v = FIX2LONG(val);
+        if (v < 0) {
+            v = -v;
         }
-        for (; i < num_longs; i++)
-            buf[i] = 0;
-        if (RBIGNUM_NEGATIVE_P(val)) {
-            for (i = 0; i < num_longs; i++) {
-                buf[i] = ~buf[i];
-            }
-            for (i = 0; i < num_longs; i++) {
-                buf[i]++;
-                if (buf[i] != 0)
-                    return;
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+        fixbuf[0] = v;
+#else
+        {
+            int i;
+            for (i = 0; i < numberof(fixbuf); i++) {
+                fixbuf[i] = BIGLO(v);
+                v = BIGDN(v);
             }
         }
+#endif
+        dp = fixbuf;
+        de = fixbuf + numberof(fixbuf);
     }
+    else {
+        dp = BDIGITS(val);
+        de = dp + BIGNUM_LEN(val);
+    }
+    while (dp < de && de[-1] == 0)
+        de--;
+    if (dp == de) {
+        if (nlz_bits_ret)
+            *nlz_bits_ret = 0;
+        return 0;
+    }
+    num_leading_zeros = nlz(de[-1]);
+    if (nlz_bits_ret)
+        *nlz_bits_ret = num_leading_zeros % CHAR_BIT;
+    return (de - dp) * SIZEOF_BDIGIT - num_leading_zeros / CHAR_BIT;
 }
 
-/* See rb_big_pack comment for endianness and sign of buf. */
-VALUE
-rb_big_unpack(unsigned long *buf, long num_longs)
+static size_t
+absint_numwords_small(size_t numbytes, int nlz_bits_in_msbyte, size_t word_numbits, size_t *nlz_bits_ret)
 {
-    while (2 <= num_longs) {
-        if (buf[num_longs-1] == 0 && (long)buf[num_longs-2] >= 0)
-            num_longs--;
-        else if (buf[num_longs-1] == ~0UL && (long)buf[num_longs-2] < 0)
-            num_longs--;
-        else
-            break;
+    size_t val_numbits = numbytes * CHAR_BIT - nlz_bits_in_msbyte;
+    size_t div = val_numbits / word_numbits;
+    size_t mod = val_numbits % word_numbits;
+    size_t numwords;
+    size_t nlz_bits;
+    numwords = mod == 0 ? div : div + 1;
+    nlz_bits = mod == 0 ? 0 : word_numbits - mod;
+    *nlz_bits_ret = nlz_bits;
+    return numwords;
+}
+
+static size_t
+absint_numwords_generic(size_t numbytes, int nlz_bits_in_msbyte, size_t word_numbits, size_t *nlz_bits_ret)
+{
+    static const BDIGIT char_bit[1] = { CHAR_BIT };
+    BDIGIT numbytes_bary[bdigit_roomof(sizeof(numbytes))];
+    BDIGIT val_numbits_bary[bdigit_roomof(sizeof(numbytes) + 1)];
+    BDIGIT nlz_bits_in_msbyte_bary[1];
+    BDIGIT word_numbits_bary[bdigit_roomof(sizeof(word_numbits))];
+    BDIGIT div_bary[numberof(val_numbits_bary) + BIGDIVREM_EXTRA_WORDS];
+    BDIGIT mod_bary[numberof(word_numbits_bary)];
+    BDIGIT one[1] = { 1 };
+    size_t nlz_bits;
+    size_t mod;
+    int sign;
+    size_t numwords;
+
+    nlz_bits_in_msbyte_bary[0] = nlz_bits_in_msbyte;
+
+    /*
+     * val_numbits = numbytes * CHAR_BIT - nlz_bits_in_msbyte
+     * div, mod = val_numbits.divmod(word_numbits)
+     * numwords = mod == 0 ? div : div + 1
+     * nlz_bits = mod == 0 ? 0 : word_numbits - mod
+     */
+
+    bary_unpack(BARY_ARGS(numbytes_bary), &numbytes, 1, sizeof(numbytes), 0,
+        INTEGER_PACK_NATIVE_BYTE_ORDER);
+    BARY_SHORT_MUL(val_numbits_bary, numbytes_bary, char_bit);
+    if (nlz_bits_in_msbyte)
+        BARY_SUB(val_numbits_bary, val_numbits_bary, nlz_bits_in_msbyte_bary);
+    bary_unpack(BARY_ARGS(word_numbits_bary), &word_numbits, 1, sizeof(word_numbits), 0,
+        INTEGER_PACK_NATIVE_BYTE_ORDER);
+    BARY_DIVMOD(div_bary, mod_bary, val_numbits_bary, word_numbits_bary);
+    if (BARY_ZERO_P(mod_bary)) {
+        nlz_bits = 0;
     }
-    if (num_longs == 0)
-        return INT2FIX(0);
-    else if (num_longs == 1)
-        return LONG2NUM((long)buf[0]);
-    else {
-        VALUE big;
-        BDIGIT *ds;
-        long len = num_longs * DIGSPERLONG;
-        long i;
-        big = bignew(len, 1);
-        ds = BDIGITS(big);
-        for (i = 0; i < num_longs; i++) {
-            unsigned long d = buf[i];
-#if SIZEOF_LONG == SIZEOF_BDIGITS
-            *ds++ = d;
-#else
-            int j;
-            for (j = 0; j < DIGSPERLONG; j++) {
-                *ds++ = BIGLO(d);
-                d = BIGDN(d);
-            }
+    else {
+        BARY_ADD(div_bary, div_bary, one);
+        bary_pack(+1, BARY_ARGS(mod_bary), &mod, 1, sizeof(mod), 0,
+            INTEGER_PACK_NATIVE_BYTE_ORDER);
+        nlz_bits = word_numbits - mod;
+    }
+    sign = bary_pack(+1, BARY_ARGS(div_bary), &numwords, 1, sizeof(numwords), 0,
+        INTEGER_PACK_NATIVE_BYTE_ORDER);
+
+    if (sign == 2) {
+#if defined __GNUC__ && (__GNUC__ == 4 && __GNUC_MINOR__ == 4)
+        *nlz_bits_ret = 0;
 #endif
-        }
-        if ((long)buf[num_longs-1] < 0) {
-            get2comp(big);
-            RBIGNUM_SET_SIGN(big, 0);
-        }
-        return bignorm(big);
+        return (size_t)-1;
     }
+    *nlz_bits_ret = nlz_bits;
+    return numwords;
 }
 
-#define QUAD_SIZE 8
+/*
+ * Calculate the number of words to be required to represent
+ * the absolute value of the integer given as _val_.
+ *
+ * [val] an integer.
+ * [word_numbits] number of bits in a word.
+ * [nlz_bits_ret] number of leading zero bits in the most significant word is returned if not NULL.
+ *
+ * This function returns ((val_numbits * CHAR_BIT + word_numbits - 1) / word_numbits)
+ * where val_numbits is the number of bits of abs(val).
+ *
+ * This function can overflow.
+ * When overflow occur, (size_t)-1 is returned.
+ *
+ * If nlz_bits_ret is not NULL and overflow is not occur,
+ * (return_value * word_numbits - val_numbits) is stored in *nlz_bits_ret.
+ * In this case, 0 <= *nlz_bits_ret < word_numbits.
+ *
+ */
+size_t
+rb_absint_numwords(VALUE val, size_t word_numbits, size_t *nlz_bits_ret)
+{
+    size_t numbytes;
+    int nlz_bits_in_msbyte;
+    size_t numwords;
+    size_t nlz_bits = 0;
+
+    if (word_numbits == 0)
+        return (size_t)-1;
+
+    numbytes = rb_absint_size(val, &nlz_bits_in_msbyte);
+
+    if (numbytes <= SIZE_MAX / CHAR_BIT) {
+        numwords = absint_numwords_small(numbytes, nlz_bits_in_msbyte, word_numbits, &nlz_bits);
+#ifdef DEBUG_INTEGER_PACK
+        {
+            size_t numwords0, nlz_bits0;
+            numwords0 = absint_numwords_generic(numbytes, nlz_bits_in_msbyte, word_numbits, &nlz_bits0);
+            assert(numwords0 == numwords);
+            assert(nlz_bits0 == nlz_bits);
+            (void)numwords0;
+        }
+#endif
+    }
+    else {
+        numwords = absint_numwords_generic(numbytes, nlz_bits_in_msbyte, word_numbits, &nlz_bits);
+    }
+    if (numwords == (size_t)-1)
+        return numwords;
+
+    if (nlz_bits_ret)
+        *nlz_bits_ret = nlz_bits;
 
-#if SIZEOF_LONG_LONG == QUAD_SIZE && SIZEOF_BDIGITS*2 == SIZEOF_LONG_LONG
+    return numwords;
+}
 
-void
-rb_quad_pack(char *buf, VALUE val)
+/* Test abs(val) consists only a bit or not.
+ *
+ * Returns 1 if abs(val) == 1 << n for some n >= 0.
+ * Returns 0 otherwise.
+ *
+ * rb_absint_singlebit_p can be used to determine required buffer size
+ * for rb_integer_pack used with INTEGER_PACK_2COMP (two's complement).
+ *
+ * Following example calculates number of bits required to
+ * represent val in two's complement number, without sign bit.
+ *
+ *   size_t size;
+ *   int neg = FIXNUM_P(val) ? FIX2LONG(val) < 0 : BIGNUM_NEGATIVE_P(val);
+ *   size = rb_absint_numwords(val, 1, NULL)
+ *   if (size == (size_t)-1) ...overflow...
+ *   if (neg && rb_absint_singlebit_p(val))
+ *     size--;
+ *
+ * Following example calculates number of bytes required to
+ * represent val in two's complement number, with sign bit.
+ *
+ *   size_t size;
+ *   int neg = FIXNUM_P(val) ? FIX2LONG(val) < 0 : BIGNUM_NEGATIVE_P(val);
+ *   int nlz_bits;
+ *   size = rb_absint_size(val, &nlz_bits);
+ *   if (nlz_bits == 0 && !(neg && rb_absint_singlebit_p(val)))
+ *     size++;
+ */
+int
+rb_absint_singlebit_p(VALUE val)
 {
-    LONG_LONG q;
+    BDIGIT *dp;
+    BDIGIT *de;
+    BDIGIT fixbuf[bdigit_roomof(sizeof(long))];
+    BDIGIT d;
 
     val = rb_to_int(val);
+
     if (FIXNUM_P(val)) {
-	q = FIX2LONG(val);
+        long v = FIX2LONG(val);
+        if (v < 0) {
+            v = -v;
+        }
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+        fixbuf[0] = v;
+#else
+        {
+            int i;
+            for (i = 0; i < numberof(fixbuf); i++) {
+                fixbuf[i] = BIGLO(v);
+                v = BIGDN(v);
+            }
+        }
+#endif
+        dp = fixbuf;
+        de = fixbuf + numberof(fixbuf);
     }
     else {
-	long len = RBIGNUM_LEN(val);
-	BDIGIT *ds;
+        dp = BDIGITS(val);
+        de = dp + BIGNUM_LEN(val);
+    }
+    while (dp < de && de[-1] == 0)
+        de--;
+    while (dp < de && dp[0] == 0)
+        dp++;
+    if (dp == de) /* no bit set. */
+        return 0;
+    if (dp != de-1) /* two non-zero words. two bits set, at least. */
+        return 0;
+    d = *dp;
+    return POW2_P(d);
+}
+
 
-	if (len > SIZEOF_LONG_LONG/SIZEOF_BDIGITS) {
-	    len = SIZEOF_LONG_LONG/SIZEOF_BDIGITS;
-	}
-	ds = BDIGITS(val);
-	q = 0;
-	while (len--) {
-	    q = BIGUP(q);
-	    q += ds[len];
-	}
-	if (!RBIGNUM_SIGN(val)) q = -q;
+/*
+ * Export an integer into a buffer.
+ *
+ * This function fills the buffer specified by _words_ and _numwords_ as
+ * val in the format specified by _wordsize_, _nails_ and _flags_.
+ *
+ * [val] Fixnum, Bignum or another integer like object which has to_int method.
+ * [words] buffer to export abs(val).
+ * [numwords] the size of given buffer as number of words.
+ * [wordsize] the size of word as number of bytes.
+ * [nails] number of padding bits in a word.
+ *   Most significant nails bits of each word are filled by zero.
+ * [flags] bitwise or of constants which name starts "INTEGER_PACK_".
+ *
+ * flags:
+ * [INTEGER_PACK_MSWORD_FIRST] Store the most significant word as the first word.
+ * [INTEGER_PACK_LSWORD_FIRST] Store the least significant word as the first word.
+ * [INTEGER_PACK_MSBYTE_FIRST] Store the most significant byte in a word as the first byte in the word.
+ * [INTEGER_PACK_LSBYTE_FIRST] Store the least significant byte in a word as the first byte in the word.
+ * [INTEGER_PACK_NATIVE_BYTE_ORDER] INTEGER_PACK_MSBYTE_FIRST or INTEGER_PACK_LSBYTE_FIRST corresponding to the host's endian.
+ * [INTEGER_PACK_2COMP] Use 2's complement representation.
+ * [INTEGER_PACK_LITTLE_ENDIAN] Same as INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_LSBYTE_FIRST
+ * [INTEGER_PACK_BIG_ENDIAN] Same as INTEGER_PACK_MSWORD_FIRST|INTEGER_PACK_MSBYTE_FIRST
+ * [INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION] Use generic implementation (for test and debug).
+ *
+ * This function fills the buffer specified by _words_
+ * as abs(val) if INTEGER_PACK_2COMP is not specified in _flags_.
+ * If INTEGER_PACK_2COMP is specified, 2's complement representation of val is
+ * filled in the buffer.
+ *
+ * This function returns the signedness and overflow condition.
+ * The overflow condition depends on INTEGER_PACK_2COMP.
+ *
+ * INTEGER_PACK_2COMP is not specified:
+ *   -2 : negative overflow.  val <= -2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   -1 : negative without overflow.  -2**(numwords*(wordsize*CHAR_BIT-nails)) < val < 0
+ *   0 : zero.  val == 0
+ *   1 : positive without overflow.  0 < val < 2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   2 : positive overflow.  2**(numwords*(wordsize*CHAR_BIT-nails)) <= val
+ *
+ * INTEGER_PACK_2COMP is specified:
+ *   -2 : negative overflow.  val < -2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   -1 : negative without overflow.  -2**(numwords*(wordsize*CHAR_BIT-nails)) <= val < 0
+ *   0 : zero.  val == 0
+ *   1 : positive without overflow.  0 < val < 2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   2 : positive overflow.  2**(numwords*(wordsize*CHAR_BIT-nails)) <= val
+ *
+ * The value, -2**(numwords*(wordsize*CHAR_BIT-nails)), is representable
+ * in 2's complement representation but not representable in absolute value.
+ * So -1 is returned for the value if INTEGER_PACK_2COMP is specified
+ * but returns -2 if INTEGER_PACK_2COMP is not specified.
+ *
+ * The least significant words are filled in the buffer when overflow occur.
+ */
+
+int
+rb_integer_pack(VALUE val, void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
+{
+    int sign;
+    BDIGIT *ds;
+    size_t num_bdigits;
+    BDIGIT fixbuf[bdigit_roomof(sizeof(long))];
+
+    RB_GC_GUARD(val) = rb_to_int(val);
+
+    if (FIXNUM_P(val)) {
+        long v = FIX2LONG(val);
+        if (v < 0) {
+            sign = -1;
+            v = -v;
+        }
+        else {
+            sign = 1;
+        }
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+        fixbuf[0] = v;
+#else
+        {
+            int i;
+            for (i = 0; i < numberof(fixbuf); i++) {
+                fixbuf[i] = BIGLO(v);
+                v = BIGDN(v);
+            }
+        }
+#endif
+        ds = fixbuf;
+        num_bdigits = numberof(fixbuf);
     }
-    memcpy(buf, (char*)&q, SIZEOF_LONG_LONG);
+    else {
+        sign = BIGNUM_POSITIVE_P(val) ? 1 : -1;
+        ds = BDIGITS(val);
+        num_bdigits = BIGNUM_LEN(val);
+    }
+
+    return bary_pack(sign, ds, num_bdigits, words, numwords, wordsize, nails, flags);
 }
 
+/*
+ * Import an integer from a buffer.
+ *
+ * [words] buffer to import.
+ * [numwords] the size of given buffer as number of words.
+ * [wordsize] the size of word as number of bytes.
+ * [nails] number of padding bits in a word.
+ *   Most significant nails bits of each word are ignored.
+ * [flags] bitwise or of constants which name starts "INTEGER_PACK_".
+ *
+ * flags:
+ * [INTEGER_PACK_MSWORD_FIRST] Interpret the first word as the most significant word.
+ * [INTEGER_PACK_LSWORD_FIRST] Interpret the first word as the least significant word.
+ * [INTEGER_PACK_MSBYTE_FIRST] Interpret the first byte in a word as the most significant byte in the word.
+ * [INTEGER_PACK_LSBYTE_FIRST] Interpret the first byte in a word as the least significant byte in the word.
+ * [INTEGER_PACK_NATIVE_BYTE_ORDER] INTEGER_PACK_MSBYTE_FIRST or INTEGER_PACK_LSBYTE_FIRST corresponding to the host's endian.
+ * [INTEGER_PACK_2COMP] Use 2's complement representation.
+ * [INTEGER_PACK_LITTLE_ENDIAN] Same as INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_LSBYTE_FIRST
+ * [INTEGER_PACK_BIG_ENDIAN] Same as INTEGER_PACK_MSWORD_FIRST|INTEGER_PACK_MSBYTE_FIRST
+ * [INTEGER_PACK_FORCE_BIGNUM] the result will be a Bignum
+ *   even if it is representable as a Fixnum.
+ * [INTEGER_PACK_NEGATIVE] Returns non-positive value.
+ *   (Returns non-negative value if not specified.)
+ * [INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION] Use generic implementation (for test and debug).
+ *
+ * This function returns the imported integer as Fixnum or Bignum.
+ *
+ * The range of the result value depends on INTEGER_PACK_2COMP and INTEGER_PACK_NEGATIVE.
+ *
+ * INTEGER_PACK_2COMP is not set:
+ *   0 <= val < 2**(numwords*(wordsize*CHAR_BIT-nails)) if !INTEGER_PACK_NEGATIVE
+ *   -2**(numwords*(wordsize*CHAR_BIT-nails)) < val <= 0 if INTEGER_PACK_NEGATIVE
+ *
+ * INTEGER_PACK_2COMP is set:
+ *   -2**(numwords*(wordsize*CHAR_BIT-nails)-1) <= val <= 2**(numwords*(wordsize*CHAR_BIT-nails)-1)-1 if !INTEGER_PACK_NEGATIVE
+ *   -2**(numwords*(wordsize*CHAR_BIT-nails)) <= val <= -1 if INTEGER_PACK_NEGATIVE
+ *
+ * INTEGER_PACK_2COMP without INTEGER_PACK_NEGATIVE means sign extension.
+ * INTEGER_PACK_2COMP with INTEGER_PACK_NEGATIVE mean assuming the higher bits are 1.
+ *
+ * Note that this function returns 0 when numwords is zero and
+ * INTEGER_PACK_2COMP is set but INTEGER_PACK_NEGATIVE is not set.
+ */
+
 VALUE
-rb_quad_unpack(const char *buf, int sign)
+rb_integer_unpack(const void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
 {
-    unsigned LONG_LONG q;
-    long neg = 0;
-    long i;
-    BDIGIT *digits;
-    VALUE big;
-
-    memcpy(&q, buf, SIZEOF_LONG_LONG);
-    if (sign) {
-	if (FIXABLE((LONG_LONG)q)) return LONG2FIX((LONG_LONG)q);
-	if ((LONG_LONG)q < 0) {
-	    q = -(LONG_LONG)q;
-	    neg = 1;
-	}
+    VALUE val;
+    size_t num_bdigits;
+    int sign;
+    int nlp_bits;
+    BDIGIT *ds;
+    BDIGIT fixbuf[2] = { 0, 0 };
+
+    validate_integer_pack_format(numwords, wordsize, nails, flags,
+            INTEGER_PACK_MSWORD_FIRST|
+            INTEGER_PACK_LSWORD_FIRST|
+            INTEGER_PACK_MSBYTE_FIRST|
+            INTEGER_PACK_LSBYTE_FIRST|
+            INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP|
+            INTEGER_PACK_FORCE_BIGNUM|
+            INTEGER_PACK_NEGATIVE|
+            INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION);
+
+    num_bdigits = integer_unpack_num_bdigits(numwords, wordsize, nails, &nlp_bits);
+
+    if (LONG_MAX-1 < num_bdigits)
+        rb_raise(rb_eArgError, "too big to unpack as an integer");
+    if (num_bdigits <= numberof(fixbuf) && !(flags & INTEGER_PACK_FORCE_BIGNUM)) {
+        val = Qfalse;
+        ds = fixbuf;
     }
     else {
-	if (POSFIXABLE(q)) return LONG2FIX(q);
+        val = bignew((long)num_bdigits, 0);
+        ds = BDIGITS(val);
     }
+    sign = bary_unpack_internal(ds, num_bdigits, words, numwords, wordsize, nails, flags, nlp_bits);
 
-    i = 0;
-    big = bignew(DIGSPERLL, 1);
-    digits = BDIGITS(big);
-    while (i < DIGSPERLL) {
-	digits[i++] = BIGLO(q);
-	q = BIGDN(q);
+    if (sign == -2) {
+        if (val) {
+            big_extend_carry(val);
+        }
+        else if (num_bdigits == numberof(fixbuf)) {
+            val = bignew((long)num_bdigits+1, 0);
+            MEMCPY(BDIGITS(val), fixbuf, BDIGIT, num_bdigits);
+            BDIGITS(val)[num_bdigits++] = 1;
+        }
+        else {
+            ds[num_bdigits++] = 1;
+        }
     }
 
-    i = DIGSPERLL;
-    while (i-- && !digits[i]) ;
-    RBIGNUM_SET_LEN(big, i+1);
-
-    if (neg) {
-	RBIGNUM_SET_SIGN(big, 0);
+    if (!val) {
+        BDIGIT_DBL u = fixbuf[0] + BIGUP(fixbuf[1]);
+        if (u == 0)
+            return LONG2FIX(0);
+        if (0 < sign && POSFIXABLE(u))
+            return LONG2FIX((long)u);
+        if (sign < 0 && BDIGIT_MSB(fixbuf[1]) == 0 &&
+                NEGFIXABLE(-(BDIGIT_DBL_SIGNED)u))
+            return LONG2FIX((long)-(BDIGIT_DBL_SIGNED)u);
+        val = bignew((long)num_bdigits, 0 <= sign);
+        MEMCPY(BDIGITS(val), fixbuf, BDIGIT, num_bdigits);
     }
-    return bignorm(big);
+
+    if ((flags & INTEGER_PACK_FORCE_BIGNUM) && sign != 0 &&
+        bary_zero_p(BDIGITS(val), BIGNUM_LEN(val)))
+        sign = 0;
+    BIGNUM_SET_SIGN(val, 0 <= sign);
+
+    if (flags & INTEGER_PACK_FORCE_BIGNUM)
+        return bigtrunc(val);
+    return bignorm(val);
 }
 
-#else
+#define conv_digit(c) (ruby_digit36_to_number_table[(unsigned char)(c)])
+
+NORETURN(static inline void invalid_radix(int base));
+NORETURN(static inline void invalid_integer(VALUE s));
+
+static inline int
+valid_radix_p(int base)
+{
+    return (1 < base && base <= 36);
+}
+
+static inline void
+invalid_radix(int base)
+{
+    rb_raise(rb_eArgError, "invalid radix %d", base);
+}
+
+static inline void
+invalid_integer(VALUE s)
+{
+    rb_raise(rb_eArgError, "invalid value for Integer(): %+"PRIsVALUE, s);
+}
 
 static int
-quad_buf_complement(char *buf, size_t len)
+str2big_scan_digits(const char *s, const char *str, int base, int badcheck, size_t *num_digits_p, ssize_t *len_p)
 {
-    size_t i;
-    for (i = 0; i < len; i++)
-        buf[i] = ~buf[i];
-    for (i = 0; i < len; i++) {
-        buf[i]++;
-        if (buf[i] != 0)
-            return 0;
+    char nondigit = 0;
+    size_t num_digits = 0;
+    const char *digits_start = str;
+    const char *digits_end = str;
+    ssize_t len = *len_p;
+
+    int c;
+
+    if (!len) {
+        *num_digits_p = 0;
+        *len_p = 0;
+        return TRUE;
     }
-    return 1;
+
+    if (badcheck && *str == '_') return FALSE;
+
+    while ((c = *str++) != 0) {
+        if (c == '_') {
+            if (nondigit) {
+                if (badcheck) return FALSE;
+                break;
+            }
+            nondigit = (char) c;
+        }
+        else if ((c = conv_digit(c)) < 0 || c >= base) {
+            break;
+        }
+        else {
+            nondigit = 0;
+            num_digits++;
+            digits_end = str;
+        }
+        if (len > 0 && !--len) break;
+    }
+    if (badcheck && nondigit) return FALSE;
+    if (badcheck && len) {
+        str--;
+        while (*str && ISSPACE(*str)) {
+            str++;
+            if (len > 0 && !--len) break;
+        }
+        if (len && *str) {
+            return FALSE;
+        }
+    }
+    *num_digits_p = num_digits;
+    *len_p = digits_end - digits_start;
+    return TRUE;
 }
 
-void
-rb_quad_pack(char *buf, VALUE val)
-{
-    long len;
+static VALUE
+str2big_poweroftwo(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_digits,
+    int bits_per_digit)
+{
+    BDIGIT *dp;
+    BDIGIT_DBL dd;
+    int numbits;
+
+    size_t num_bdigits;
+    const char *p;
+    int c;
+    VALUE z;
 
-    memset(buf, 0, QUAD_SIZE);
-    val = rb_to_int(val);
-    if (FIXNUM_P(val)) {
-	val = rb_int2big(FIX2LONG(val));
+    num_bdigits = (num_digits / BITSPERDIG) * bits_per_digit + roomof((num_digits % BITSPERDIG) * bits_per_digit, BITSPERDIG);
+    z = bignew(num_bdigits, sign);
+    dp = BDIGITS(z);
+    dd = 0;
+    numbits = 0;
+    for (p = digits_end; digits_start < p; p--) {
+        if ((c = conv_digit(p[-1])) < 0)
+            continue;
+        dd |= (BDIGIT_DBL)c << numbits;
+        numbits += bits_per_digit;
+        if (BITSPERDIG <= numbits) {
+            *dp++ = BIGLO(dd);
+            dd = BIGDN(dd);
+            numbits -= BITSPERDIG;
+        }
     }
-    len = RBIGNUM_LEN(val) * SIZEOF_BDIGITS;
-    if (len > QUAD_SIZE) {
-        len = QUAD_SIZE;
+    if (numbits) {
+        *dp++ = BIGLO(dd);
     }
-    memcpy(buf, (char*)BDIGITS(val), len);
-    if (RBIGNUM_NEGATIVE_P(val)) {
-        quad_buf_complement(buf, QUAD_SIZE);
+    assert((size_t)(dp - BDIGITS(z)) == num_bdigits);
+
+    return z;
+}
+
+static VALUE
+str2big_normal(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_bdigits,
+    int base)
+{
+    size_t blen = 1;
+    BDIGIT *zds;
+    BDIGIT_DBL num;
+
+    size_t i;
+    const char *p;
+    int c;
+    VALUE z;
+
+    z = bignew(num_bdigits, sign);
+    zds = BDIGITS(z);
+    BDIGITS_ZERO(zds, num_bdigits);
+
+    for (p = digits_start; p < digits_end; p++) {
+        if ((c = conv_digit(*p)) < 0)
+            continue;
+        num = c;
+        i = 0;
+        for (;;) {
+            while (i<blen) {
+                num += (BDIGIT_DBL)zds[i]*base;
+                zds[i++] = BIGLO(num);
+                num = BIGDN(num);
+            }
+            if (num) {
+                blen++;
+                continue;
+            }
+            break;
+        }
+        assert(blen <= num_bdigits);
     }
+
+    return z;
 }
 
-#define BNEG(b) (RSHIFT(((BDIGIT*)(b))[QUAD_SIZE/SIZEOF_BDIGITS-1],BITSPERDIG-1) != 0)
+static VALUE
+str2big_karatsuba(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_digits,
+    size_t num_bdigits,
+    int digits_per_bdigits_dbl,
+    int base)
+{
+    VALUE powerv;
+    size_t unit;
+    VALUE tmpuv = 0;
+    BDIGIT *uds, *vds, *tds;
+    BDIGIT_DBL dd;
+    BDIGIT_DBL current_base;
+    int m;
+    int power_level = 0;
 
-VALUE
-rb_quad_unpack(const char *buf, int sign)
-{
-    VALUE big = bignew(QUAD_SIZE/SIZEOF_BDIGITS, 1);
+    size_t i;
+    const char *p;
+    int c;
+    VALUE z;
+
+    uds = ALLOCV_N(BDIGIT, tmpuv, 2*num_bdigits);
+    vds = uds + num_bdigits;
 
-    memcpy((char*)BDIGITS(big), buf, QUAD_SIZE);
-    if (sign && BNEG(buf)) {
-	char *tmp = (char*)BDIGITS(big);
+    powerv = power_cache_get_power(base, power_level, NULL);
 
-	RBIGNUM_SET_SIGN(big, 0);
-        quad_buf_complement(tmp, QUAD_SIZE);
+    i = 0;
+    dd = 0;
+    current_base = 1;
+    m = digits_per_bdigits_dbl;
+    if (num_digits < (size_t)m)
+        m = (int)num_digits;
+    for (p = digits_end; digits_start < p; p--) {
+        if ((c = conv_digit(p[-1])) < 0)
+            continue;
+        dd = dd + c * current_base;
+        current_base *= base;
+        num_digits--;
+        m--;
+        if (m == 0) {
+            uds[i++] = BIGLO(dd);
+            uds[i++] = (BDIGIT)BIGDN(dd);
+            dd = 0;
+            m = digits_per_bdigits_dbl;
+            if (num_digits < (size_t)m)
+                m = (int)num_digits;
+            current_base = 1;
+        }
+    }
+    assert(i == num_bdigits);
+    for (unit = 2; unit < num_bdigits; unit *= 2) {
+        for (i = 0; i < num_bdigits; i += unit*2) {
+            if (2*unit <= num_bdigits - i) {
+                bary_mul(vds+i, unit*2, BDIGITS(powerv), BIGNUM_LEN(powerv), uds+i+unit, unit);
+                bary_add(vds+i, unit*2, vds+i, unit*2, uds+i, unit);
+            }
+            else if (unit <= num_bdigits - i) {
+                bary_mul(vds+i, num_bdigits-i, BDIGITS(powerv), BIGNUM_LEN(powerv), uds+i+unit, num_bdigits-(i+unit));
+                bary_add(vds+i, num_bdigits-i, vds+i, num_bdigits-i, uds+i, unit);
+            }
+            else {
+                MEMCPY(vds+i, uds+i, BDIGIT, num_bdigits-i);
+            }
+        }
+        power_level++;
+        powerv = power_cache_get_power(base, power_level, NULL);
+        tds = vds;
+        vds = uds;
+        uds = tds;
     }
+    BARY_TRUNC(uds, num_bdigits);
+    z = bignew(num_bdigits, sign);
+    MEMCPY(BDIGITS(z), uds, BDIGIT, num_bdigits);
 
-    return bignorm(big);
+    if (tmpuv)
+        ALLOCV_END(tmpuv);
+
+    return z;
 }
 
+#if USE_GMP
+static VALUE
+str2big_gmp(
+    int sign,
+    const char *digits_start,
+    const char *digits_end,
+    size_t num_digits,
+    size_t num_bdigits,
+    int base)
+{
+    char *buf, *p;
+    const char *q;
+    VALUE tmps;
+    mpz_t mz;
+    VALUE z;
+    BDIGIT *zds;
+    size_t zn, count;
+
+    buf = ALLOCV_N(char, tmps, num_digits+1);
+    p = buf;
+    for (q = digits_start; q < digits_end; q++) {
+        if (conv_digit(*q) < 0)
+            continue;
+        *p++ = *q;
+    }
+    *p = '\0';
+
+    mpz_init(mz);
+    mpz_set_str(mz, buf, base);
+    zn = num_bdigits;
+    z = bignew(zn, sign);
+    zds = BDIGITS(z);
+    bdigits_from_mpz(mz, BDIGITS(z), &count);
+    BDIGITS_ZERO(zds+count, zn-count);
+    mpz_clear(mz);
+
+    if (tmps)
+        ALLOCV_END(tmps);
+
+    return z;
+}
 #endif
 
+static VALUE rb_cstr_parse_inum(const char *str, ssize_t len, char **endp, int base);
+
+/*
+ * Parse +str+ as Ruby Integer, i.e., underscores, 0d and 0b prefixes.
+ *
+ * str:      pointer to the string to be parsed.
+ *	     should be NUL-terminated.
+ * base:     base of conversion, must be 2..36, or -36..0.
+ *           if +base+ > 0, the conversion is done according to the +base+
+ *           and unmatched prefix is parsed as a part of the result if
+ *           present.
+ *           if +base+ <= 0, the conversion is done according to the
+ *           prefix if present, in base <code>-base</code> if +base+ < -1,
+ *           or in base 10.
+ * badcheck: if non-zero, +ArgumentError+ is raised when +str+ is not
+ *           valid as an Integer.  if zero, Fixnum 0 is returned in
+ *           that case.
+ */
 VALUE
 rb_cstr_to_inum(const char *str, int base, int badcheck)
 {
-    const char *s = str;
     char *end;
-    char sign = 1, nondigit = 0;
-    int c;
-    BDIGIT_DBL num;
-    long len, blen = 1;
-    long i;
-    VALUE z;
-    BDIGIT *zds;
+    VALUE ret = rb_cstr_parse_inum(str, -1, (badcheck ? NULL : &end), base);
+    if (NIL_P(ret)) {
+        if (badcheck) rb_invalid_str(str, "Integer()");
+        ret = INT2FIX(0);
+    }
+    return ret;
+}
 
-#undef ISDIGIT
-#define ISDIGIT(c) ('0' <= (c) && (c) <= '9')
-#define conv_digit(c) \
-    (!ISASCII(c) ? -1 : \
-     ISDIGIT(c) ? ((c) - '0') : \
-     ISLOWER(c) ? ((c) - 'a' + 10) : \
-     ISUPPER(c) ? ((c) - 'A' + 10) : \
-     -1)
+/*
+ * Parse +str+ as Ruby Integer, i.e., underscores, 0d and 0b prefixes.
+ *
+ * str:  pointer to the string to be parsed.
+ *       should be NUL-terminated if +len+ is negative.
+ * len:  length of +str+ if >= 0.  if +len+ is negative, +str+ should
+ *       be NUL-terminated.
+ * endp: if non-NULL, the address after parsed part is stored.  if
+ *       NULL, Qnil is returned when +str+ is not valid as an Integer.
+ * ndigits: if non-NULL, the number of parsed digits is stored.
+ * base: see +rb_cstr_to_inum+
+ * flags: bitwise OR of below flags:
+ *       RB_INT_PARSE_SIGN: allow preceding spaces and +/- sign
+ *       RB_INT_PARSE_UNDERSCORE: allow an underscore between digits
+ *       RB_INT_PARSE_PREFIX: allow preceding prefix
+ */
+
+VALUE
+rb_int_parse_cstr(const char *str, ssize_t len, char **endp, size_t *ndigits,
+                  int base, int flags)
+{
+    const char *const s = str;
+    char sign = 1;
+    int c;
+    VALUE z = Qnil;
+
+    unsigned long val;
+    int ov;
+
+    const char *digits_start, *digits_end;
+    size_t num_digits = 0;
+    size_t num_bdigits;
+    const ssize_t len0 = len;
+    const int badcheck = !endp;
+
+#define ADV(n) do {\
+        if (len > 0 && len <= (n)) goto bad; \
+        str += (n); \
+        len -= (n); \
+    } while (0)
+#define ASSERT_LEN() do {\
+        assert(len != 0); \
+        if (len0 >= 0) assert(s + len0 == str + len); \
+    } while (0)
 
     if (!str) {
-	if (badcheck) goto bad;
-	return INT2FIX(0);
+        goto bad;
     }
-    while (ISSPACE(*str)) str++;
+    if (len && (flags & RB_INT_PARSE_SIGN)) {
+        while (ISSPACE(*str)) ADV(1);
 
-    if (str[0] == '+') {
-	str++;
+        if (str[0] == '+') {
+            ADV(1);
+        }
+        else if (str[0] == '-') {
+            ADV(1);
+            sign = 0;
+        }
+        ASSERT_LEN();
+    }
+    if (base <= 0) {
+        if (str[0] == '0' && len > 1) {
+            switch (str[1]) {
+              case 'x': case 'X':
+                base = 16;
+                ADV(2);
+                break;
+              case 'b': case 'B':
+                base = 2;
+                ADV(2);
+                break;
+              case 'o': case 'O':
+                base = 8;
+                ADV(2);
+                break;
+              case 'd': case 'D':
+                base = 10;
+                ADV(2);
+                break;
+              default:
+                base = 8;
+            }
+        }
+        else if (base < -1) {
+            base = -base;
+        }
+        else {
+            base = 10;
+        }
     }
-    else if (str[0] == '-') {
-	str++;
-	sign = 0;
+    else if (len == 1 || !(flags & RB_INT_PARSE_PREFIX)) {
+        /* no prefix */
     }
-    if (str[0] == '+' || str[0] == '-') {
-	if (badcheck) goto bad;
-	return INT2FIX(0);
+    else if (base == 2) {
+        if (str[0] == '0' && (str[1] == 'b'||str[1] == 'B')) {
+            ADV(2);
+        }
     }
-    if (base <= 0) {
-	if (str[0] == '0') {
-	    switch (str[1]) {
-	      case 'x': case 'X':
-		base = 16;
-		break;
-	      case 'b': case 'B':
-		base = 2;
-		break;
-	      case 'o': case 'O':
-		base = 8;
-		break;
-	      case 'd': case 'D':
-		base = 10;
-		break;
-	      default:
-		base = 8;
-	    }
-	}
-	else if (base < -1) {
-	    base = -base;
-	}
-	else {
-	    base = 10;
-	}
-    }
-    switch (base) {
-      case 2:
-	len = 1;
-	if (str[0] == '0' && (str[1] == 'b'||str[1] == 'B')) {
-	    str += 2;
-	}
-	break;
-      case 3:
-	len = 2;
-	break;
-      case 8:
-	if (str[0] == '0' && (str[1] == 'o'||str[1] == 'O')) {
-	    str += 2;
-	}
-      case 4: case 5: case 6: case 7:
-	len = 3;
-	break;
-      case 10:
-	if (str[0] == '0' && (str[1] == 'd'||str[1] == 'D')) {
-	    str += 2;
-	}
-      case 9: case 11: case 12: case 13: case 14: case 15:
-	len = 4;
-	break;
-      case 16:
-	len = 4;
-	if (str[0] == '0' && (str[1] == 'x'||str[1] == 'X')) {
-	    str += 2;
-	}
-	break;
-      default:
-	if (base < 2 || 36 < base) {
-	    rb_raise(rb_eArgError, "invalid radix %d", base);
-	}
-	if (base <= 32) {
-	    len = 5;
-	}
-	else {
-	    len = 6;
-	}
-	break;
-    }
-    if (*str == '0') {		/* squeeze preceding 0s */
-	int us = 0;
-	while ((c = *++str) == '0' || c == '_') {
-	    if (c == '_') {
-		if (++us >= 2)
-		    break;
-	    } else
-		us = 0;
-	}
-	if (!(c = *str) || ISSPACE(c)) --str;
+    else if (base == 8) {
+        if (str[0] == '0' && (str[1] == 'o'||str[1] == 'O')) {
+            ADV(2);
+        }
+    }
+    else if (base == 10) {
+        if (str[0] == '0' && (str[1] == 'd'||str[1] == 'D')) {
+            ADV(2);
+        }
+    }
+    else if (base == 16) {
+        if (str[0] == '0' && (str[1] == 'x'||str[1] == 'X')) {
+            ADV(2);
+        }
+    }
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
+    }
+    if (!len) goto bad;
+    num_digits = str - s;
+    if (*str == '0' && len != 1) { /* squeeze preceding 0s */
+        int us = 0;
+        const char *end = len < 0 ? NULL : str + len;
+        ++num_digits;
+        while ((c = *++str) == '0' ||
+               ((flags & RB_INT_PARSE_UNDERSCORE) && c == '_')) {
+            if (c == '_') {
+                if (++us >= 2)
+                    break;
+            }
+            else {
+                ++num_digits;
+                us = 0;
+            }
+            if (str == end) break;
+        }
+        if (!c || ISSPACE(c)) --str;
+        if (end) len = end - str;
     }
     c = *str;
     c = conv_digit(c);
     if (c < 0 || c >= base) {
-	if (badcheck) goto bad;
-	return INT2FIX(0);
-    }
-    len *= strlen(str)*sizeof(char);
-
-    if ((size_t)len <= (sizeof(long)*CHAR_BIT)) {
-	unsigned long val = STRTOUL(str, &end, base);
-
-	if (str < end && *end == '_') goto bigparse;
-	if (badcheck) {
-	    if (end == str) goto bad; /* no number */
-	    while (*end && ISSPACE(*end)) end++;
-	    if (*end) goto bad;	      /* trailing garbage */
-	}
-
-	if (POSFIXABLE(val)) {
-	    if (sign) return LONG2FIX(val);
-	    else {
-		long result = -(long)val;
-		return LONG2FIX(result);
-	    }
-	}
-	else {
-	    VALUE big = rb_uint2big(val);
-	    RBIGNUM_SET_SIGN(big, sign);
-	    return bignorm(big);
-	}
+        if (!badcheck && num_digits) z = INT2FIX(0);
+        goto bad;
+    }
+
+    if (ndigits) *ndigits = num_digits;
+    val = ruby_scan_digits(str, len, base, &num_digits, &ov);
+    if (!ov) {
+        const char *end = &str[num_digits];
+        if (num_digits > 0 && *end == '_' && (flags & RB_INT_PARSE_UNDERSCORE))
+            goto bigparse;
+        if (endp) *endp = (char *)end;
+        if (ndigits) *ndigits += num_digits;
+        if (badcheck) {
+            if (num_digits == 0) return Qnil; /* no number */
+            while (len < 0 ? *end : end < str + len) {
+                if (!ISSPACE(*end)) return Qnil; /* trailing garbage */
+                end++;
+            }
+        }
+
+        if (POSFIXABLE(val)) {
+            if (sign) return LONG2FIX(val);
+            else {
+                long result = -(long)val;
+                return LONG2FIX(result);
+            }
+        }
+        else {
+            VALUE big = rb_uint2big(val);
+            BIGNUM_SET_SIGN(big, sign);
+            return bignorm(big);
+        }
     }
+
   bigparse:
-    len = (len/BITSPERDIG)+1;
-    if (badcheck && *str == '_') goto bad;
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        goto bad;
+    if (endp) *endp = (char *)(str + len);
+    if (ndigits) *ndigits += num_digits;
+    digits_end = digits_start + len;
 
-    z = bignew(len, sign);
-    zds = BDIGITS(z);
-    for (i=len;i--;) zds[i]=0;
-    while ((c = *str++) != 0) {
-	if (c == '_') {
-	    if (nondigit) {
-		if (badcheck) goto bad;
-		break;
-	    }
-	    nondigit = c;
-	    continue;
-	}
-	else if ((c = conv_digit(c)) < 0) {
-	    break;
-	}
-	if (c >= base) break;
-	nondigit = 0;
-	i = 0;
-	num = c;
-	for (;;) {
-	    while (i<blen) {
-		num += (BDIGIT_DBL)zds[i]*base;
-		zds[i++] = BIGLO(num);
-		num = BIGDN(num);
-	    }
-	    if (num) {
-		blen++;
-		continue;
-	    }
-	    break;
-	}
-    }
-    if (badcheck) {
-	str--;
-	if (s+1 < str && str[-1] == '_') goto bad;
-	while (*str && ISSPACE(*str)) str++;
-	if (*str) {
-	  bad:
-	    rb_invalid_str(s, "Integer()");
-	}
+    if (POW2_P(base)) {
+        z = str2big_poweroftwo(sign, digits_start, digits_end, num_digits,
+                               bit_length(base-1));
+    }
+    else {
+        int digits_per_bdigits_dbl;
+        maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
+        num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
+
+#if USE_GMP
+        if (GMP_STR2BIG_DIGITS < num_bdigits) {
+            z = str2big_gmp(sign, digits_start, digits_end, num_digits,
+                    num_bdigits, base);
+        }
+        else
+#endif
+        if (num_bdigits < KARATSUBA_MUL_DIGITS) {
+            z = str2big_normal(sign, digits_start, digits_end,
+                    num_bdigits, base);
+        }
+        else {
+            z = str2big_karatsuba(sign, digits_start, digits_end, num_digits,
+                    num_bdigits, digits_per_bdigits_dbl, base);
+        }
     }
 
     return bignorm(z);
+
+  bad:
+    if (endp) *endp = (char *)str;
+    if (ndigits) *ndigits = num_digits;
+    return z;
+}
+
+static VALUE
+rb_cstr_parse_inum(const char *str, ssize_t len, char **endp, int base)
+{
+    return rb_int_parse_cstr(str, len, endp, NULL, base,
+                             RB_INT_PARSE_DEFAULT);
 }
 
 VALUE
-rb_str_to_inum(VALUE str, int base, int badcheck)
+rb_str_convert_to_inum(VALUE str, int base, int badcheck, int raise_exception)
 {
-    char *s;
-    long len;
-    VALUE v = 0;
     VALUE ret;
+    const char *s;
+    long len;
+    char *end;
 
     StringValue(str);
     rb_must_asciicompat(str);
-    if (badcheck) {
-	s = StringValueCStr(str);
+    RSTRING_GETMEM(str, s, len);
+    ret = rb_cstr_parse_inum(s, len, (badcheck ? NULL : &end), base);
+    if (NIL_P(ret)) {
+        if (badcheck) {
+            if (!raise_exception) return Qnil;
+            invalid_integer(str);
+        }
+        ret = INT2FIX(0);
     }
-    else {
-	s = RSTRING_PTR(str);
+    return ret;
+}
+
+VALUE
+rb_str_to_inum(VALUE str, int base, int badcheck)
+{
+    return rb_str_convert_to_inum(str, base, badcheck, TRUE);
+}
+
+VALUE
+rb_str2big_poweroftwo(VALUE arg, int base, int badcheck)
+{
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
+
+    if (!valid_radix_p(base) || !POW2_P(base)) {
+        invalid_radix(base);
     }
-    if (s) {
-	len = RSTRING_LEN(str);
-	if (s[len]) {		/* no sentinel somehow */
-	    char *p = ALLOCV(v, len+1);
 
-	    MEMCPY(p, s, char, len);
-	    p[len] = '\0';
-	    s = p;
-	}
+    rb_must_asciicompat(arg);
+    s = str = StringValueCStr(arg);
+    len = RSTRING_LEN(arg);
+    if (*str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
     }
-    ret = rb_cstr_to_inum(s, base, badcheck);
-    if (v)
-	ALLOCV_END(v);
-    return ret;
+
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    z = str2big_poweroftwo(positive_p, digits_start, digits_end, num_digits,
+            bit_length(base-1));
+
+    RB_GC_GUARD(arg);
+
+    return bignorm(z);
+}
+
+VALUE
+rb_str2big_normal(VALUE arg, int base, int badcheck)
+{
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
+
+    int digits_per_bdigits_dbl;
+    size_t num_bdigits;
+
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
+    }
+
+    rb_must_asciicompat(arg);
+    s = str = StringValuePtr(arg);
+    len = RSTRING_LEN(arg);
+    if (len > 0 && *str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
+    }
+
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
+    num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
+
+    z = str2big_normal(positive_p, digits_start, digits_end,
+            num_bdigits, base);
+
+    RB_GC_GUARD(arg);
+
+    return bignorm(z);
+}
+
+VALUE
+rb_str2big_karatsuba(VALUE arg, int base, int badcheck)
+{
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
+
+    int digits_per_bdigits_dbl;
+    size_t num_bdigits;
+
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
+    }
+
+    rb_must_asciicompat(arg);
+    s = str = StringValuePtr(arg);
+    len = RSTRING_LEN(arg);
+    if (len > 0 && *str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
+    }
+
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
+    num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
+
+    z = str2big_karatsuba(positive_p, digits_start, digits_end, num_digits,
+            num_bdigits, digits_per_bdigits_dbl, base);
+
+    RB_GC_GUARD(arg);
+
+    return bignorm(z);
+}
+
+#if USE_GMP
+VALUE
+rb_str2big_gmp(VALUE arg, int base, int badcheck)
+{
+    int positive_p = 1;
+    const char *s, *str;
+    const char *digits_start, *digits_end;
+    size_t num_digits;
+    ssize_t len;
+    VALUE z;
+
+    int digits_per_bdigits_dbl;
+    size_t num_bdigits;
+
+    if (!valid_radix_p(base)) {
+        invalid_radix(base);
+    }
+
+    rb_must_asciicompat(arg);
+    s = str = StringValuePtr(arg);
+    len = RSTRING_LEN(arg);
+    if (len > 0 && *str == '-') {
+        len--;
+        str++;
+        positive_p = 0;
+    }
+
+    digits_start = str;
+    if (!str2big_scan_digits(s, str, base, badcheck, &num_digits, &len))
+        invalid_integer(arg);
+    digits_end = digits_start + len;
+
+    maxpow_in_bdigit_dbl(base, &digits_per_bdigits_dbl);
+    num_bdigits = roomof(num_digits, digits_per_bdigits_dbl)*2;
+
+    z = str2big_gmp(positive_p, digits_start, digits_end, num_digits, num_bdigits, base);
+
+    RB_GC_GUARD(arg);
+
+    return bignorm(z);
 }
+#endif
 
 #if HAVE_LONG_LONG
 
 static VALUE
 rb_ull2big(unsigned LONG_LONG n)
 {
-    BDIGIT_DBL num = n;
-    long i = 0;
-    BDIGIT *digits;
-    VALUE big;
+    long i;
+    VALUE big = bignew(bdigit_roomof(SIZEOF_LONG_LONG), 1);
+    BDIGIT *digits = BDIGITS(big);
 
-    big = bignew(DIGSPERLL, 1);
-    digits = BDIGITS(big);
-    while (i < DIGSPERLL) {
-	digits[i++] = BIGLO(num);
-	num = BIGDN(num);
+#if SIZEOF_BDIGIT >= SIZEOF_LONG_LONG
+    digits[0] = n;
+#else
+    for (i = 0; i < bdigit_roomof(SIZEOF_LONG_LONG); i++) {
+        digits[i] = BIGLO(n);
+        n = BIGDN(n);
     }
+#endif
 
-    i = DIGSPERLL;
+    i = bdigit_roomof(SIZEOF_LONG_LONG);
     while (i-- && !digits[i]) ;
-    RBIGNUM_SET_LEN(big, i+1);
+    BIGNUM_SET_LEN(big, i+1);
     return big;
 }
 
@@ -825,15 +4490,19 @@ static VALUE
 rb_ll2big(LONG_LONG n)
 {
     long neg = 0;
+    unsigned LONG_LONG u;
     VALUE big;
 
     if (n < 0) {
-	n = -n;
-	neg = 1;
+        u = 1 + (unsigned LONG_LONG)(-(n + 1)); /* u = -n avoiding overflow */
+        neg = 1;
+    }
+    else {
+        u = n;
     }
-    big = rb_ull2big(n);
+    big = rb_ull2big(u);
     if (neg) {
-	RBIGNUM_SET_SIGN(big, 0);
+        BIGNUM_SET_NEGATIVE_SIGN(big);
     }
     return big;
 }
@@ -841,19 +4510,59 @@ rb_ll2big(LONG_LONG n)
 VALUE
 rb_ull2inum(unsigned LONG_LONG n)
 {
-    if (POSFIXABLE(n)) return LONG2FIX(n);
+    if (POSFIXABLE(n)) return LONG2FIX((long)n);
     return rb_ull2big(n);
 }
 
 VALUE
 rb_ll2inum(LONG_LONG n)
 {
-    if (FIXABLE(n)) return LONG2FIX(n);
+    if (FIXABLE(n)) return LONG2FIX((long)n);
     return rb_ll2big(n);
 }
 
 #endif  /* HAVE_LONG_LONG */
 
+#ifdef HAVE_INT128_T
+static VALUE
+rb_uint128t2big(uint128_t n)
+{
+    long i;
+    VALUE big = bignew(bdigit_roomof(SIZEOF_INT128_T), 1);
+    BDIGIT *digits = BDIGITS(big);
+
+    for (i = 0; i < bdigit_roomof(SIZEOF_INT128_T); i++) {
+        digits[i] = BIGLO(RSHIFT(n ,BITSPERDIG*i));
+    }
+
+    i = bdigit_roomof(SIZEOF_INT128_T);
+    while (i-- && !digits[i]) ;
+    BIGNUM_SET_LEN(big, i+1);
+    return big;
+}
+
+MJIT_FUNC_EXPORTED VALUE
+rb_int128t2big(int128_t n)
+{
+    int neg = 0;
+    uint128_t u;
+    VALUE big;
+
+    if (n < 0) {
+        u = 1 + (uint128_t)(-(n + 1)); /* u = -n avoiding overflow */
+        neg = 1;
+    }
+    else {
+        u = n;
+    }
+    big = rb_uint128t2big(u);
+    if (neg) {
+        BIGNUM_SET_NEGATIVE_SIGN(big);
+    }
+    return big;
+}
+#endif
+
 VALUE
 rb_cstr2inum(const char *str, int base)
 {
@@ -866,379 +4575,606 @@ rb_str2inum(VALUE str, int base)
     return rb_str_to_inum(str, base, base==0);
 }
 
-const char ruby_digitmap[] = "0123456789abcdefghijklmnopqrstuvwxyz";
-
-static VALUE bigsqr(VALUE x);
-static void bigdivmod(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp);
-
-#define POW2_P(x) (((x)&((x)-1))==0)
-
-static inline int
-ones(register unsigned long x)
+static VALUE
+big_shift3(VALUE x, int lshift_p, size_t shift_numdigits, int shift_numbits)
 {
-#if SIZEOF_LONG == 8
-# define MASK_55 0x5555555555555555UL
-# define MASK_33 0x3333333333333333UL
-# define MASK_0f 0x0f0f0f0f0f0f0f0fUL
-#else
-# define MASK_55 0x55555555UL
-# define MASK_33 0x33333333UL
-# define MASK_0f 0x0f0f0f0fUL
-#endif
-    x -= (x >> 1) & MASK_55;
-    x = ((x >> 2) & MASK_33) + (x & MASK_33);
-    x = ((x >> 4) + x) & MASK_0f;
-    x += (x >> 8);
-    x += (x >> 16);
-#if SIZEOF_LONG == 8
-    x += (x >> 32);
-#endif
-    return (int)(x & 0x7f);
-#undef MASK_0f
-#undef MASK_33
-#undef MASK_55
+    BDIGIT *xds, *zds;
+    long s1;
+    int s2;
+    VALUE z;
+    long xn;
+
+    if (lshift_p) {
+        if (LONG_MAX < shift_numdigits) {
+          too_big:
+            rb_raise(rb_eRangeError, "shift width too big");
+        }
+        s1 = shift_numdigits;
+        s2 = shift_numbits;
+        if ((size_t)s1 != shift_numdigits) goto too_big;
+        xn = BIGNUM_LEN(x);
+        if (LONG_MAX/SIZEOF_BDIGIT <= xn+s1) goto too_big;
+        z = bignew(xn+s1+1, BIGNUM_SIGN(x));
+        zds = BDIGITS(z);
+        BDIGITS_ZERO(zds, s1);
+        xds = BDIGITS(x);
+        zds[xn+s1] = bary_small_lshift(zds+s1, xds, xn, s2);
+    }
+    else {
+        long zn;
+        BDIGIT hibitsx;
+        if (LONG_MAX < shift_numdigits || (size_t)BIGNUM_LEN(x) <= shift_numdigits) {
+            if (BIGNUM_POSITIVE_P(x) ||
+                bary_zero_p(BDIGITS(x), BIGNUM_LEN(x)))
+                return INT2FIX(0);
+            else
+                return INT2FIX(-1);
+        }
+        s1 = shift_numdigits;
+        s2 = shift_numbits;
+        hibitsx = abs2twocomp(&x, &xn);
+        xds = BDIGITS(x);
+        if (xn <= s1) {
+            return hibitsx ? INT2FIX(-1) : INT2FIX(0);
+        }
+        zn = xn - s1;
+        z = bignew(zn, 0);
+        zds = BDIGITS(z);
+        bary_small_rshift(zds, xds+s1, zn, s2, hibitsx != 0 ? BDIGMAX : 0);
+        twocomp2abs_bang(z, hibitsx != 0);
+    }
+    RB_GC_GUARD(x);
+    return z;
 }
 
-static inline unsigned long
-next_pow2(register unsigned long x)
+static VALUE
+big_shift2(VALUE x, int lshift_p, VALUE y)
 {
-    x |= x >> 1;
-    x |= x >> 2;
-    x |= x >> 4;
-    x |= x >> 8;
-    x |= x >> 16;
-#if SIZEOF_LONG == 8
-    x |= x >> 32;
-#endif
-    return x + 1;
+    int sign;
+    size_t lens[2];
+    size_t shift_numdigits;
+    int shift_numbits;
+
+    assert(POW2_P(CHAR_BIT));
+    assert(POW2_P(BITSPERDIG));
+
+    if (BIGZEROP(x))
+        return INT2FIX(0);
+    sign = rb_integer_pack(y, lens, numberof(lens), sizeof(size_t), 0,
+        INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER);
+    if (sign < 0) {
+        lshift_p = !lshift_p;
+        sign = -sign;
+    }
+    if (lshift_p) {
+        if (1 < sign || CHAR_BIT <= lens[1])
+            rb_raise(rb_eRangeError, "shift width too big");
+    }
+    else {
+        if (1 < sign || CHAR_BIT <= lens[1])
+            return BIGNUM_POSITIVE_P(x) ? INT2FIX(0) : INT2FIX(-1);
+    }
+    shift_numbits = (int)(lens[0] & (BITSPERDIG-1));
+    shift_numdigits = (lens[0] >> bit_length(BITSPERDIG-1)) |
+      (lens[1] << (CHAR_BIT*SIZEOF_SIZE_T - bit_length(BITSPERDIG-1)));
+    return big_shift3(x, lshift_p, shift_numdigits, shift_numbits);
 }
 
-static inline int
-floor_log2(register unsigned long x)
+static VALUE
+big_lshift(VALUE x, unsigned long shift)
 {
-    x |= x >> 1;
-    x |= x >> 2;
-    x |= x >> 4;
-    x |= x >> 8;
-    x |= x >> 16;
-#if SIZEOF_LONG == 8
-    x |= x >> 32;
-#endif
-    return (int)ones(x) - 1;
+    long s1 = shift/BITSPERDIG;
+    int s2 = (int)(shift%BITSPERDIG);
+    return big_shift3(x, 1, s1, s2);
 }
 
-static inline int
-ceil_log2(register unsigned long x)
+static VALUE
+big_rshift(VALUE x, unsigned long shift)
 {
-    return floor_log2(x) + !POW2_P(x);
+    long s1 = shift/BITSPERDIG;
+    int s2 = (int)(shift%BITSPERDIG);
+    return big_shift3(x, 0, s1, s2);
 }
 
-#define LOG2_KARATSUBA_DIGITS 7
-#define KARATSUBA_DIGITS (1L<<LOG2_KARATSUBA_DIGITS)
-#define MAX_BIG2STR_TABLE_ENTRIES 64
+#define MAX_BASE36_POWER_TABLE_ENTRIES (SIZEOF_SIZE_T * CHAR_BIT + 1)
 
-static VALUE big2str_power_cache[35][MAX_BIG2STR_TABLE_ENTRIES];
+static VALUE base36_power_cache[35][MAX_BASE36_POWER_TABLE_ENTRIES];
+static size_t base36_numdigits_cache[35][MAX_BASE36_POWER_TABLE_ENTRIES];
 
 static void
 power_cache_init(void)
 {
-    int i, j;
-    for (i = 0; i < 35; ++i) {
-	for (j = 0; j < MAX_BIG2STR_TABLE_ENTRIES; ++j) {
-	    big2str_power_cache[i][j] = Qnil;
-	}
-    }
 }
 
 static inline VALUE
-power_cache_get_power0(int base, int i)
+power_cache_get_power(int base, int power_level, size_t *numdigits_ret)
 {
-    if (NIL_P(big2str_power_cache[base - 2][i])) {
-	big2str_power_cache[base - 2][i] =
-	    i == 0 ? rb_big_pow(rb_int2big(base), INT2FIX(KARATSUBA_DIGITS))
-		   : bigsqr(power_cache_get_power0(base, i - 1));
-	rb_gc_register_mark_object(big2str_power_cache[base - 2][i]);
+    /*
+     * MAX_BASE36_POWER_TABLE_ENTRIES is big enough to that
+     * base36_power_cache[base][MAX_BASE36_POWER_TABLE_ENTRIES-1] fills whole memory.
+     * So MAX_BASE36_POWER_TABLE_ENTRIES <= power_level is not possible to calculate.
+     *
+     * number-of-bytes =
+     * log256(base36_power_cache[base][MAX_BASE36_POWER_TABLE_ENTRIES-1]) =
+     * log256(maxpow_in_bdigit_dbl(base)**(2**(MAX_BASE36_POWER_TABLE_ENTRIES-1))) =
+     * log256(maxpow_in_bdigit_dbl(base)**(2**(SIZEOF_SIZE_T*CHAR_BIT))) =
+     * (2**(SIZEOF_SIZE_T*CHAR_BIT))*log256(maxpow_in_bdigit_dbl(base)) =
+     * (256**SIZEOF_SIZE_T)*log256(maxpow_in_bdigit_dbl(base)) >
+     * (256**SIZEOF_SIZE_T)*(sizeof(BDIGIT_DBL)-1) >
+     * 256**SIZEOF_SIZE_T
+     */
+    if (MAX_BASE36_POWER_TABLE_ENTRIES <= power_level)
+        rb_bug("too big power number requested: maxpow_in_bdigit_dbl(%d)**(2**%d)", base, power_level);
+
+    VALUE power = base36_power_cache[base - 2][power_level];
+    if (!power) {
+        size_t numdigits;
+        if (power_level == 0) {
+            int numdigits0;
+            BDIGIT_DBL dd = maxpow_in_bdigit_dbl(base, &numdigits0);
+            power = bignew(2, 1);
+            bdigitdbl2bary(BDIGITS(power), 2, dd);
+            numdigits = numdigits0;
+        }
+        else {
+            power = bigtrunc(bigsq(power_cache_get_power(base, power_level - 1, &numdigits)));
+            numdigits *= 2;
+        }
+        rb_obj_hide(power);
+        base36_power_cache[base - 2][power_level] = power;
+        base36_numdigits_cache[base - 2][power_level] = numdigits;
+        rb_gc_register_mark_object(power);
     }
-    return big2str_power_cache[base - 2][i];
+    if (numdigits_ret)
+        *numdigits_ret = base36_numdigits_cache[base - 2][power_level];
+    return power;
 }
 
-static VALUE
-power_cache_get_power(int base, long n1, long* m1)
+struct big2str_struct {
+    int negative;
+    int base;
+    BDIGIT_DBL hbase2;
+    int hbase2_numdigits;
+    VALUE result;
+    char *ptr;
+};
+
+static void
+big2str_alloc(struct big2str_struct *b2s, size_t len)
 {
-    int i, m;
-    long j;
-    VALUE t;
+    if (LONG_MAX-1 < len)
+        rb_raise(rb_eArgError, "too big number");
+    b2s->result = rb_usascii_str_new(0, (long)(len + 1)); /* plus one for sign */
+    b2s->ptr = RSTRING_PTR(b2s->result);
+    if (b2s->negative)
+        *b2s->ptr++ = '-';
+}
 
-    if (n1 <= KARATSUBA_DIGITS)
-	rb_bug("n1 > KARATSUBA_DIGITS");
+static void
+big2str_2bdigits(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t taillen)
+{
+    size_t j;
+    BDIGIT_DBL num;
+    char buf[SIZEOF_BDIGIT_DBL*CHAR_BIT], *p;
+    int beginning = !b2s->ptr;
+    size_t len = 0;
+
+    assert(xn <= 2);
+    num = bary2bdigitdbl(xds, xn);
+
+    if (beginning) {
+        if (num == 0)
+            return;
+        p = buf;
+        j = sizeof(buf);
+        do {
+            BDIGIT_DBL idx = num % b2s->base;
+            num /= b2s->base;
+            p[--j] = ruby_digitmap[idx];
+        } while (num);
+        len = sizeof(buf) - j;
+        big2str_alloc(b2s, len + taillen);
+        MEMCPY(b2s->ptr, buf + j, char, len);
+    }
+    else {
+        p = b2s->ptr;
+        j = b2s->hbase2_numdigits;
+        do {
+            BDIGIT_DBL idx = num % b2s->base;
+            num /= b2s->base;
+            p[--j] = ruby_digitmap[idx];
+        } while (j);
+        len = b2s->hbase2_numdigits;
+    }
+    b2s->ptr += len;
+}
 
-    m = ceil_log2(n1);
-    if (m1) *m1 = 1 << m;
-    i = m - LOG2_KARATSUBA_DIGITS;
-    if (i >= MAX_BIG2STR_TABLE_ENTRIES)
-	i = MAX_BIG2STR_TABLE_ENTRIES - 1;
-    t = power_cache_get_power0(base, i);
+static void
+big2str_karatsuba(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t wn,
+                  int power_level, size_t taillen)
+{
+    VALUE b;
+    size_t half_numdigits, lower_numdigits;
+    int lower_power_level;
+    size_t bn;
+    const BDIGIT *bds;
+    size_t len;
+
+    /*
+     * Precondition:
+     * abs(x) < maxpow**(2**power_level)
+     * where
+     *   maxpow = maxpow_in_bdigit_dbl(base, &numdigits)
+     *
+     * This function generates sequence of zeros, and then stringized abs(x) into b2s->ptr.
+     *
+     * b2s->ptr can be NULL.
+     * It is allocated when the first character is generated via big2str_alloc.
+     *
+     * The prefix zeros should be generated if and only if b2s->ptr is not NULL.
+     * When the zeros are generated, the zeros and abs(x) consists
+     * numdigits*(2**power_level) characters at total.
+     *
+     * Note:
+     * power_cache_get_power(base, power_level, &len) may not be cached yet. It should not be called.
+     * power_cache_get_power(base, power_level-1, &len) should be cached already if 0 <= power_level-1.
+     */
 
-    j = KARATSUBA_DIGITS*(1 << i);
-    while (n1 > j) {
-	t = bigsqr(t);
-	j *= 2;
+    if (xn == 0 || bary_zero_p(xds, xn)) {
+        if (b2s->ptr) {
+            /* When x is zero, power_cache_get_power(base, power_level) should be cached already. */
+            power_cache_get_power(b2s->base, power_level, &len);
+            memset(b2s->ptr, '0', len);
+            b2s->ptr += len;
+        }
+        return;
     }
-    return t;
-}
 
-/* big2str_muraken_find_n1
- *
- * Let a natural number x is given by:
- * x = 2^0 * x_0 + 2^1 * x_1 + ... + 2^(B*n_0 - 1) * x_{B*n_0 - 1},
- * where B is BITSPERDIG (i.e. BDIGITS*CHAR_BIT) and n_0 is
- * RBIGNUM_LEN(x).
- *
- * Now, we assume n_1 = min_n \{ n | 2^(B*n_0/2) <= b_1^(n_1) \}, so
- * it is realized that 2^(B*n_0) <= {b_1}^{2*n_1}, where b_1 is a
- * given radix number. And then, we have n_1 <= (B*n_0) /
- * (2*log_2(b_1)), therefore n_1 is given by ceil((B*n_0) /
- * (2*log_2(b_1))).
- */
-static long
-big2str_find_n1(VALUE x, int base)
-{
-    static const double log_2[] = {
-	1.0,              1.58496250072116, 2.0,
-	2.32192809488736, 2.58496250072116, 2.8073549220576,
-	3.0,              3.16992500144231, 3.32192809488736,
-	3.4594316186373,  3.58496250072116, 3.70043971814109,
-	3.8073549220576,  3.90689059560852, 4.0,
-	4.08746284125034, 4.16992500144231, 4.24792751344359,
-	4.32192809488736, 4.39231742277876, 4.4594316186373,
-	4.52356195605701, 4.58496250072116, 4.64385618977472,
-	4.70043971814109, 4.75488750216347, 4.8073549220576,
-	4.85798099512757, 4.90689059560852, 4.95419631038688,
-	5.0,              5.04439411935845, 5.08746284125034,
-	5.12928301694497, 5.16992500144231
-    };
-    long bits;
-
-    if (base < 2 || 36 < base)
-	rb_bug("invalid radix %d", base);
+    if (power_level == 0) {
+        big2str_2bdigits(b2s, xds, xn, taillen);
+        return;
+    }
 
-    if (FIXNUM_P(x)) {
-	bits = (SIZEOF_LONG*CHAR_BIT - 1)/2 + 1;
+    lower_power_level = power_level-1;
+    b = power_cache_get_power(b2s->base, lower_power_level, &lower_numdigits);
+    bn = BIGNUM_LEN(b);
+    bds = BDIGITS(b);
+
+    half_numdigits = lower_numdigits;
+
+    while (0 < lower_power_level &&
+            (xn < bn ||
+             (xn == bn && bary_cmp(xds, xn, bds, bn) < 0))) {
+        lower_power_level--;
+        b = power_cache_get_power(b2s->base, lower_power_level, &lower_numdigits);
+        bn = BIGNUM_LEN(b);
+        bds = BDIGITS(b);
     }
-    else if (BIGZEROP(x)) {
-	return 0;
+
+    if (lower_power_level == 0 &&
+            (xn < bn ||
+             (xn == bn && bary_cmp(xds, xn, bds, bn) < 0))) {
+        if (b2s->ptr) {
+            len = half_numdigits * 2 - lower_numdigits;
+            memset(b2s->ptr, '0', len);
+            b2s->ptr += len;
+        }
+        big2str_2bdigits(b2s, xds, xn, taillen);
+    }
+    else {
+        BDIGIT *qds, *rds;
+        size_t qn, rn;
+        BDIGIT *tds;
+        int shift;
+
+        if (lower_power_level != power_level-1 && b2s->ptr) {
+            len = (half_numdigits - lower_numdigits) * 2;
+            memset(b2s->ptr, '0', len);
+            b2s->ptr += len;
+        }
+
+        shift = nlz(bds[bn-1]);
+
+        qn = xn + BIGDIVREM_EXTRA_WORDS;
+
+        if (shift == 0) {
+            /* bigdivrem_restoring will not modify y.
+             * So use bds directly.  */
+            tds = (BDIGIT *)bds;
+            xds[xn] = 0;
+        }
+        else {
+            /* bigdivrem_restoring will modify y.
+             * So use temporary buffer.  */
+            tds = xds + qn;
+            assert(qn + bn <= xn + wn);
+            bary_small_lshift(tds, bds, bn, shift);
+            xds[xn] = bary_small_lshift(xds, xds, xn, shift);
+        }
+
+        bigdivrem_restoring(xds, qn, tds, bn);
+
+        rds = xds;
+        rn = bn;
+
+        qds = xds + bn;
+        qn = qn - bn;
+
+        if (shift) {
+            bary_small_rshift(rds, rds, rn, shift, 0);
+        }
+
+        BARY_TRUNC(qds, qn);
+        assert(qn <= bn);
+        big2str_karatsuba(b2s, qds, qn, xn+wn - (rn+qn), lower_power_level, lower_numdigits+taillen);
+        BARY_TRUNC(rds, rn);
+        big2str_karatsuba(b2s, rds, rn, xn+wn - rn, lower_power_level, taillen);
     }
-    else if (RBIGNUM_LEN(x) >= LONG_MAX/BITSPERDIG) {
-	rb_raise(rb_eRangeError, "bignum too big to convert into `string'");
+}
+
+static VALUE
+big2str_base_poweroftwo(VALUE x, int base)
+{
+    int word_numbits = ffs(base) - 1;
+    size_t numwords;
+    VALUE result;
+    char *ptr;
+    numwords = rb_absint_numwords(x, word_numbits, NULL);
+    if (BIGNUM_NEGATIVE_P(x)) {
+        if (LONG_MAX-1 < numwords)
+            rb_raise(rb_eArgError, "too big number");
+        result = rb_usascii_str_new(0, 1+numwords);
+        ptr = RSTRING_PTR(result);
+        *ptr++ = BIGNUM_POSITIVE_P(x) ? '+' : '-';
     }
     else {
-	bits = BITSPERDIG*RBIGNUM_LEN(x);
+        if (LONG_MAX < numwords)
+            rb_raise(rb_eArgError, "too big number");
+        result = rb_usascii_str_new(0, numwords);
+        ptr = RSTRING_PTR(result);
+    }
+    rb_integer_pack(x, ptr, numwords, 1, CHAR_BIT-word_numbits,
+                    INTEGER_PACK_BIG_ENDIAN);
+    while (0 < numwords) {
+        *ptr = ruby_digitmap[*(unsigned char *)ptr];
+        ptr++;
+        numwords--;
     }
+    return result;
+}
 
-    return (long)ceil(bits/log_2[base - 2]);
+VALUE
+rb_big2str_poweroftwo(VALUE x, int base)
+{
+    return big2str_base_poweroftwo(x, base);
 }
 
-static long
-big2str_orig(VALUE x, int base, char* ptr, long len, long hbase, int trim)
+static VALUE
+big2str_generic(VALUE x, int base)
 {
-    long i = RBIGNUM_LEN(x), j = len;
-    BDIGIT* ds = BDIGITS(x);
+    BDIGIT *xds;
+    size_t xn;
+    struct big2str_struct b2s_data;
+    int power_level;
+    VALUE power;
 
-    while (i && j > 0) {
-	long k = i;
-	BDIGIT_DBL num = 0;
+    xds = BDIGITS(x);
+    xn = BIGNUM_LEN(x);
+    BARY_TRUNC(xds, xn);
 
-	while (k--) {               /* x / hbase */
-	    num = BIGUP(num) + ds[k];
-	    ds[k] = (BDIGIT)(num / hbase);
-	    num %= hbase;
-	}
-	if (trim && ds[i-1] == 0) i--;
-	k = SIZEOF_BDIGITS;
-	while (k--) {
-	    ptr[--j] = ruby_digitmap[num % base];
-	    num /= base;
-	    if (j <= 0) break;
-	    if (trim && i == 0 && num == 0) break;
-	}
+    if (xn == 0) {
+        return rb_usascii_str_new2("0");
     }
-    if (trim) {
-	while (j < len && ptr[j] == '0') j++;
-	MEMMOVE(ptr, ptr + j, char, len - j);
-	len -= j;
+
+    if (!valid_radix_p(base))
+        invalid_radix(base);
+
+    if (xn >= LONG_MAX/BITSPERDIG) {
+        rb_raise(rb_eRangeError, "bignum too big to convert into `string'");
     }
-    return len;
-}
 
-static long
-big2str_karatsuba(VALUE x, int base, char* ptr,
-		  long n1, long len, long hbase, int trim)
-{
-    long lh, ll, m1;
-    VALUE b, q, r;
+    power_level = 0;
+    power = power_cache_get_power(base, power_level, NULL);
+    while (power_level < MAX_BASE36_POWER_TABLE_ENTRIES &&
+           (size_t)BIGNUM_LEN(power) <= (xn+1)/2) {
+        power_level++;
+        power = power_cache_get_power(base, power_level, NULL);
+    }
+    assert(power_level != MAX_BASE36_POWER_TABLE_ENTRIES);
 
-    if (BIGZEROP(x)) {
-	if (trim) return 0;
-	else {
-	    memset(ptr, '0', len);
-	    return len;
-	}
+    if ((size_t)BIGNUM_LEN(power) <= xn) {
+        /*
+         * This increment guarantees x < power_cache_get_power(base, power_level)
+         * without invoking it actually.
+         * (power_cache_get_power(base, power_level) can be slow and not used
+         * in big2str_karatsuba.)
+         *
+         * Although it is possible that x < power_cache_get_power(base, power_level-1),
+         * it is no problem because big2str_karatsuba checks it and
+         * doesn't affect the result when b2s_data.ptr is NULL.
+         */
+        power_level++;
     }
 
-    if (n1 <= KARATSUBA_DIGITS) {
-	return big2str_orig(x, base, ptr, len, hbase, trim);
+    b2s_data.negative = BIGNUM_NEGATIVE_P(x);
+    b2s_data.base = base;
+    b2s_data.hbase2 = maxpow_in_bdigit_dbl(base, &b2s_data.hbase2_numdigits);
+
+    b2s_data.result = Qnil;
+    b2s_data.ptr = NULL;
+
+    if (power_level == 0) {
+        big2str_2bdigits(&b2s_data, xds, xn, 0);
+    }
+    else {
+        VALUE tmpw = 0;
+        BDIGIT *wds;
+        size_t wn;
+        wn = power_level * BIGDIVREM_EXTRA_WORDS + BIGNUM_LEN(power);
+        wds = ALLOCV_N(BDIGIT, tmpw, xn + wn);
+        MEMCPY(wds, xds, BDIGIT, xn);
+        big2str_karatsuba(&b2s_data, wds, xn, wn, power_level, 0);
+        if (tmpw)
+            ALLOCV_END(tmpw);
     }
+    RB_GC_GUARD(x);
 
-    b = power_cache_get_power(base, n1, &m1);
-    bigdivmod(x, b, &q, &r);
-    lh = big2str_karatsuba(q, base, ptr, (len - m1)/2,
-			   len - m1, hbase, trim);
-    rb_big_resize(q, 0);
-    ll = big2str_karatsuba(r, base, ptr + lh, m1/2,
-			   m1, hbase, !lh && trim);
-    rb_big_resize(r, 0);
+    *b2s_data.ptr = '\0';
+    rb_str_resize(b2s_data.result, (long)(b2s_data.ptr - RSTRING_PTR(b2s_data.result)));
 
-    return lh + ll;
+    RB_GC_GUARD(x);
+    return b2s_data.result;
 }
 
 VALUE
-rb_big2str0(VALUE x, int base, int trim)
+rb_big2str_generic(VALUE x, int base)
 {
-    int off;
-    VALUE ss, xx;
-    long n1, n2, len, hbase;
-    char* ptr;
+    return big2str_generic(x, base);
+}
 
-    if (FIXNUM_P(x)) {
-	return rb_fix2str(x, base);
-    }
-    if (BIGZEROP(x)) {
-	return rb_usascii_str_new2("0");
-    }
+#if USE_GMP
+static VALUE
+big2str_gmp(VALUE x, int base)
+{
+    mpz_t mx;
+    size_t size;
+    VALUE str;
+    BDIGIT *xds = BDIGITS(x);
+    size_t xn = BIGNUM_LEN(x);
 
-    if (base < 2 || 36 < base)
-	rb_raise(rb_eArgError, "invalid radix %d", base);
+    mpz_init(mx);
+    bdigits_to_mpz(mx, xds, xn);
 
-    n2 = big2str_find_n1(x, base);
-    n1 = (n2 + 1) / 2;
-    ss = rb_usascii_str_new(0, n2 + 1); /* plus one for sign */
-    ptr = RSTRING_PTR(ss);
-    ptr[0] = RBIGNUM_SIGN(x) ? '+' : '-';
+    size = mpz_sizeinbase(mx, base);
 
-    hbase = base*base;
-#if SIZEOF_BDIGITS > 2
-    hbase *= hbase;
-#endif
-    off = !(trim && RBIGNUM_SIGN(x)); /* erase plus sign if trim */
-    xx = rb_big_clone(x);
-    RBIGNUM_SET_SIGN(xx, 1);
-    if (n1 <= KARATSUBA_DIGITS) {
-	len = off + big2str_orig(xx, base, ptr + off, n2, hbase, trim);
+    if (BIGNUM_NEGATIVE_P(x)) {
+        mpz_neg(mx, mx);
+        str = rb_usascii_str_new(0, size+1);
     }
     else {
-	len = off + big2str_karatsuba(xx, base, ptr + off, n1,
-				      n2, hbase, trim);
+        str = rb_usascii_str_new(0, size);
     }
-    rb_big_resize(xx, 0);
+    mpz_get_str(RSTRING_PTR(str), base, mx);
+    mpz_clear(mx);
 
-    ptr[len] = '\0';
-    rb_str_resize(ss, len);
+    if (RSTRING_PTR(str)[RSTRING_LEN(str)-1] == '\0') {
+        rb_str_set_len(str, RSTRING_LEN(str)-1);
+    }
 
-    return ss;
+    RB_GC_GUARD(x);
+    return str;
 }
 
 VALUE
-rb_big2str(VALUE x, int base)
+rb_big2str_gmp(VALUE x, int base)
 {
-    return rb_big2str0(x, base, 1);
+    return big2str_gmp(x, base);
 }
-
-/*
- *  call-seq:
- *     big.to_s(base=10)   ->  string
- *
- *  Returns a string containing the representation of <i>big</i> radix
- *  <i>base</i> (2 through 36).
- *
- *     12345654321.to_s         #=> "12345654321"
- *     12345654321.to_s(2)      #=> "1011011111110110111011110000110001"
- *     12345654321.to_s(8)      #=> "133766736061"
- *     12345654321.to_s(16)     #=> "2dfdbbc31"
- *     78546939656932.to_s(36)  #=> "rubyrules"
- */
+#endif
 
 static VALUE
-rb_big_to_s(int argc, VALUE *argv, VALUE x)
+rb_big2str1(VALUE x, int base)
 {
-    int base;
+    BDIGIT *xds;
+    size_t xn;
 
-    if (argc == 0) base = 10;
-    else {
-	VALUE b;
+    if (FIXNUM_P(x)) {
+        return rb_fix2str(x, base);
+    }
 
-	rb_scan_args(argc, argv, "01", &b);
-	base = NUM2INT(b);
+    bigtrunc(x);
+    xds = BDIGITS(x);
+    xn = BIGNUM_LEN(x);
+    BARY_TRUNC(xds, xn);
+
+    if (xn == 0) {
+        return rb_usascii_str_new2("0");
     }
-    return rb_big2str(x, base);
-}
 
-static VALUE
-big2ulong(VALUE x, const char *type, int check)
-{
-    long len = RBIGNUM_LEN(x);
-    BDIGIT_DBL num;
-    BDIGIT *ds;
+    if (!valid_radix_p(base))
+        invalid_radix(base);
 
-    if (len > DIGSPERLONG) {
-	if (check)
-	    rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
-	len = DIGSPERLONG;
+    if (xn >= LONG_MAX/BITSPERDIG) {
+        rb_raise(rb_eRangeError, "bignum too big to convert into `string'");
     }
-    ds = BDIGITS(x);
-    num = 0;
-    while (len--) {
-	num = BIGUP(num);
-	num += ds[len];
+
+    if (POW2_P(base)) {
+        /* base == 2 || base == 4 || base == 8 || base == 16 || base == 32 */
+        return big2str_base_poweroftwo(x, base);
     }
-    return (VALUE)num;
+
+#if USE_GMP
+    if (GMP_BIG2STR_DIGITS < xn) {
+        return big2str_gmp(x, base);
+    }
+#endif
+
+    return big2str_generic(x, base);
 }
 
 VALUE
-rb_big2ulong_pack(VALUE x)
+rb_big2str(VALUE x, int base)
 {
-    VALUE num = big2ulong(x, "unsigned long", FALSE);
-    if (!RBIGNUM_SIGN(x)) {
-	return (VALUE)(-(SIGNED_VALUE)num);
+    return rb_big2str1(x, base);
+}
+
+static unsigned long
+big2ulong(VALUE x, const char *type)
+{
+#if SIZEOF_LONG > SIZEOF_BDIGIT
+    size_t i;
+#endif
+    size_t len = BIGNUM_LEN(x);
+    unsigned long num;
+    BDIGIT *ds;
+
+    if (len == 0)
+        return 0;
+    if (BIGSIZE(x) > sizeof(long)) {
+        rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
+    }
+    ds = BDIGITS(x);
+#if SIZEOF_LONG <= SIZEOF_BDIGIT
+    num = (unsigned long)ds[0];
+#else
+    num = 0;
+    for (i = 0; i < len; i++) {
+        num <<= BITSPERDIG;
+        num += (unsigned long)ds[len - i - 1]; /* overflow is already checked */
     }
+#endif
     return num;
 }
 
-VALUE
+unsigned long
 rb_big2ulong(VALUE x)
 {
-    VALUE num = big2ulong(x, "unsigned long", TRUE);
+    unsigned long num = big2ulong(x, "unsigned long");
 
-    if (!RBIGNUM_SIGN(x)) {
-	unsigned long v = (unsigned long)(-(long)num);
-
-	if (v <= LONG_MAX)
-	    rb_raise(rb_eRangeError, "bignum out of range of unsigned long");
-	return (VALUE)v;
+    if (BIGNUM_POSITIVE_P(x)) {
+        return num;
     }
-    return num;
+    else {
+        if (num <= 1+(unsigned long)(-(LONG_MIN+1)))
+            return -(long)(num-1)-1;
+    }
+    rb_raise(rb_eRangeError, "bignum out of range of unsigned long");
 }
 
-SIGNED_VALUE
+long
 rb_big2long(VALUE x)
 {
-    VALUE num = big2ulong(x, "long", TRUE);
+    unsigned long num = big2ulong(x, "long");
 
-    if ((long)num < 0 &&
-	(RBIGNUM_SIGN(x) || (long)num != LONG_MIN)) {
-	rb_raise(rb_eRangeError, "bignum too big to convert into `long'");
+    if (BIGNUM_POSITIVE_P(x)) {
+        if (num <= LONG_MAX)
+            return num;
     }
-    if (!RBIGNUM_SIGN(x)) return -(SIGNED_VALUE)num;
-    return num;
+    else {
+        if (num <= 1+(unsigned long)(-(LONG_MIN+1)))
+            return -(long)(num-1)-1;
+    }
+    rb_raise(rb_eRangeError, "bignum too big to convert into `long'");
 }
 
 #if HAVE_LONG_LONG
@@ -1246,18 +5182,26 @@ rb_big2long(VALUE x)
 static unsigned LONG_LONG
 big2ull(VALUE x, const char *type)
 {
-    long len = RBIGNUM_LEN(x);
-    BDIGIT_DBL num;
-    BDIGIT *ds;
+#if SIZEOF_LONG_LONG > SIZEOF_BDIGIT
+    size_t i;
+#endif
+    size_t len = BIGNUM_LEN(x);
+    unsigned LONG_LONG num;
+    BDIGIT *ds = BDIGITS(x);
 
-    if (len > SIZEOF_LONG_LONG/SIZEOF_BDIGITS)
-	rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
-    ds = BDIGITS(x);
+    if (len == 0)
+        return 0;
+    if (BIGSIZE(x) > SIZEOF_LONG_LONG)
+        rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
+#if SIZEOF_LONG_LONG <= SIZEOF_BDIGIT
+    num = (unsigned LONG_LONG)ds[0];
+#else
     num = 0;
-    while (len--) {
-	num = BIGUP(num);
-	num += ds[len];
+    for (i = 0; i < len; i++) {
+        num = BIGUP(num);
+        num += ds[len - i - 1];
     }
+#endif
     return num;
 }
 
@@ -1266,15 +5210,14 @@ rb_big2ull(VALUE x)
 {
     unsigned LONG_LONG num = big2ull(x, "unsigned long long");
 
-    if (!RBIGNUM_SIGN(x)) {
-	LONG_LONG v = -(LONG_LONG)num;
-
-	/* FIXNUM_MIN-1 .. LLONG_MIN mapped into 0xbfffffffffffffff .. LONG_MAX+1 */
-	if ((unsigned LONG_LONG)v <= LLONG_MAX)
-	    rb_raise(rb_eRangeError, "bignum out of range of unsigned long long");
-	return v;
+    if (BIGNUM_POSITIVE_P(x)) {
+        return num;
     }
-    return num;
+    else {
+        if (num <= 1+(unsigned LONG_LONG)(-(LLONG_MIN+1)))
+            return -(LONG_LONG)(num-1)-1;
+    }
+    rb_raise(rb_eRangeError, "bignum out of range of unsigned long long");
 }
 
 LONG_LONG
@@ -1282,12 +5225,15 @@ rb_big2ll(VALUE x)
 {
     unsigned LONG_LONG num = big2ull(x, "long long");
 
-    if ((LONG_LONG)num < 0 && (RBIGNUM_SIGN(x)
-			       || (LONG_LONG)num != LLONG_MIN)) {
-	rb_raise(rb_eRangeError, "bignum too big to convert into `long long'");
+    if (BIGNUM_POSITIVE_P(x)) {
+        if (num <= LLONG_MAX)
+            return num;
     }
-    if (!RBIGNUM_SIGN(x)) return -(LONG_LONG)num;
-    return num;
+    else {
+        if (num <= 1+(unsigned LONG_LONG)(-(LLONG_MIN+1)))
+            return -(LONG_LONG)(num-1)-1;
+    }
+    rb_raise(rb_eRangeError, "bignum too big to convert into `long long'");
 }
 
 #endif  /* HAVE_LONG_LONG */
@@ -1302,23 +5248,23 @@ dbl2big(double d)
     double u = (d < 0)?-d:d;
 
     if (isinf(d)) {
-	rb_raise(rb_eFloatDomainError, d < 0 ? "-Infinity" : "Infinity");
+        rb_raise(rb_eFloatDomainError, d < 0 ? "-Infinity" : "Infinity");
     }
     if (isnan(d)) {
-	rb_raise(rb_eFloatDomainError, "NaN");
+        rb_raise(rb_eFloatDomainError, "NaN");
     }
 
-    while (!POSFIXABLE(u) || 0 != (long)u) {
-	u /= (double)(BIGRAD);
-	i++;
+    while (1.0 <= u) {
+        u /= (double)(BIGRAD);
+        i++;
     }
     z = bignew(i, d>=0);
     digits = BDIGITS(z);
     while (i--) {
-	u *= BIGRAD;
-	c = (BDIGIT)u;
-	u -= c;
-	digits[i] = c;
+        u *= BIGRAD;
+        c = (BDIGIT)u;
+        u -= c;
+        digits[i] = c;
     }
 
     return z;
@@ -1330,73 +5276,58 @@ rb_dbl2big(double d)
     return bignorm(dbl2big(d));
 }
 
-static int
-nlz(BDIGIT x)
-{
-    BDIGIT y;
-    int n = BITSPERDIG;
-#if BITSPERDIG > 64
-    y = x >> 64; if (y) {n -= 64; x = y;}
-#endif
-#if BITSPERDIG > 32
-    y = x >> 32; if (y) {n -= 32; x = y;}
-#endif
-#if BITSPERDIG > 16
-    y = x >> 16; if (y) {n -= 16; x = y;}
-#endif
-    y = x >>  8; if (y) {n -=  8; x = y;}
-    y = x >>  4; if (y) {n -=  4; x = y;}
-    y = x >>  2; if (y) {n -=  2; x = y;}
-    y = x >>  1; if (y) {return n - 2;}
-    return n - x;
-}
-
 static double
 big2dbl(VALUE x)
 {
     double d = 0.0;
-    long i = (bigtrunc(x), RBIGNUM_LEN(x)), lo = 0, bits;
+    long i = (bigtrunc(x), BIGNUM_LEN(x)), lo = 0, bits;
     BDIGIT *ds = BDIGITS(x), dl;
 
     if (i) {
-	bits = i * BITSPERDIG - nlz(ds[i-1]);
-	if (bits > DBL_MANT_DIG+DBL_MAX_EXP) {
-	    d = HUGE_VAL;
-	}
-	else {
-	    if (bits > DBL_MANT_DIG+1)
-		lo = (bits -= DBL_MANT_DIG+1) / BITSPERDIG;
-	    else
-		bits = 0;
-	    while (--i > lo) {
-		d = ds[i] + BIGRAD*d;
-	    }
-	    dl = ds[i];
-	    if (bits && (dl & (1UL << (bits %= BITSPERDIG)))) {
-		int carry = dl & ~(~(BDIGIT)0 << bits);
-		if (!carry) {
-		    while (i-- > 0) {
-			if ((carry = ds[i]) != 0) break;
-		    }
-		}
-		if (carry) {
-		    dl &= (BDIGIT)~0 << bits;
-		    dl += (BDIGIT)1 << bits;
-		    if (!dl) d += 1;
-		}
-	    }
-	    d = dl + BIGRAD*d;
-	    if (lo) {
-		if (lo > INT_MAX / BITSPERDIG)
-		    d = HUGE_VAL;
-		else if (lo < INT_MIN / BITSPERDIG)
-		    d = 0.0;
-		else
-		    d = ldexp(d, (int)(lo * BITSPERDIG));
-	    }
-	}
-    }
-    if (!RBIGNUM_SIGN(x)) d = -d;
+        bits = i * BITSPERDIG - nlz(ds[i-1]);
+        if (bits > DBL_MANT_DIG+DBL_MAX_EXP) {
+            d = HUGE_VAL;
+        }
+        else {
+            if (bits > DBL_MANT_DIG+1)
+                lo = (bits -= DBL_MANT_DIG+1) / BITSPERDIG;
+            else
+                bits = 0;
+            while (--i > lo) {
+                d = ds[i] + BIGRAD*d;
+            }
+            dl = ds[i];
+            if (bits && (dl & ((BDIGIT)1 << (bits %= BITSPERDIG)))) {
+                int carry = (dl & ~(BDIGMAX << bits)) != 0;
+                if (!carry) {
+                    while (i-- > 0) {
+                        carry = ds[i] != 0;
+                        if (carry) break;
+                    }
+                }
+                if (carry) {
+                    BDIGIT mask = BDIGMAX;
+                    BDIGIT bit = 1;
+                    mask <<= bits;
+                    bit <<= bits;
+                    dl &= mask;
+                    dl += bit;
+                    dl = BIGLO(dl);
+                    if (!dl) d += 1;
+                }
+            }
+            d = dl + BIGRAD*d;
+            if (lo) {
+                if (lo > INT_MAX / BITSPERDIG)
+                    d = HUGE_VAL;
+                else if (lo < INT_MIN / BITSPERDIG)
+                    d = 0.0;
+                else
+                    d = ldexp(d, (int)(lo * BITSPERDIG));
+            }
+        }
+    }
+    if (BIGNUM_NEGATIVE_P(x)) d = -d;
     return d;
 }
 
@@ -1406,190 +5337,195 @@ rb_big2dbl(VALUE x)
     double d = big2dbl(x);
 
     if (isinf(d)) {
-	rb_warning("Bignum out of Float range");
-	if (d < 0.0)
-	    d = -HUGE_VAL;
-	else
-	    d = HUGE_VAL;
+        rb_warning("Integer out of Float range");
+        if (d < 0.0)
+            d = -HUGE_VAL;
+        else
+            d = HUGE_VAL;
     }
     return d;
 }
 
-/*
- *  call-seq:
- *     big.to_f -> float
- *
- *  Converts <i>big</i> to a <code>Float</code>. If <i>big</i> doesn't
- *  fit in a <code>Float</code>, the result is infinity.
- *
- */
-
-static VALUE
-rb_big_to_f(VALUE x)
+VALUE
+rb_integer_float_cmp(VALUE x, VALUE y)
 {
-    return DBL2NUM(rb_big2dbl(x));
+    double yd = RFLOAT_VALUE(y);
+    double yi, yf;
+    VALUE rel;
+
+    if (isnan(yd))
+        return Qnil;
+    if (isinf(yd)) {
+        if (yd > 0.0) return INT2FIX(-1);
+        else return INT2FIX(1);
+    }
+    yf = modf(yd, &yi);
+    if (FIXNUM_P(x)) {
+#if SIZEOF_LONG * CHAR_BIT < DBL_MANT_DIG /* assume FLT_RADIX == 2 */
+        double xd = (double)FIX2LONG(x);
+        if (xd < yd)
+            return INT2FIX(-1);
+        if (xd > yd)
+            return INT2FIX(1);
+        return INT2FIX(0);
+#else
+        long xn, yn;
+        if (yi < FIXNUM_MIN)
+            return INT2FIX(1);
+        if (FIXNUM_MAX+1 <= yi)
+            return INT2FIX(-1);
+        xn = FIX2LONG(x);
+        yn = (long)yi;
+        if (xn < yn)
+            return INT2FIX(-1);
+        if (xn > yn)
+            return INT2FIX(1);
+        if (yf < 0.0)
+            return INT2FIX(1);
+        if (0.0 < yf)
+            return INT2FIX(-1);
+        return INT2FIX(0);
+#endif
+    }
+    y = rb_dbl2big(yi);
+    rel = rb_big_cmp(x, y);
+    if (yf == 0.0 || rel != INT2FIX(0))
+        return rel;
+    if (yf < 0.0)
+        return INT2FIX(1);
+    return INT2FIX(-1);
 }
 
-/*
- *  call-seq:
- *     big <=> numeric   -> -1, 0, +1 or nil
- *
- *  Comparison---Returns -1, 0, or +1 depending on whether <i>big</i> is
- *  less than, equal to, or greater than <i>numeric</i>. This is the
- *  basis for the tests in <code>Comparable</code>.
- *
- */
+#if SIZEOF_LONG * CHAR_BIT >= DBL_MANT_DIG /* assume FLT_RADIX == 2 */
+COMPILER_WARNING_PUSH
+#if __has_warning("-Wimplicit-int-float-conversion")
+COMPILER_WARNING_IGNORED(-Wimplicit-int-float-conversion)
+#endif
+static const double LONG_MAX_as_double = LONG_MAX;
+COMPILER_WARNING_POP
+#endif
 
 VALUE
-rb_big_cmp(VALUE x, VALUE y)
+rb_integer_float_eq(VALUE x, VALUE y)
 {
-    long xlen = RBIGNUM_LEN(x);
-    BDIGIT *xds, *yds;
-
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
+    double yd = RFLOAT_VALUE(y);
+    double yi, yf;
 
-      case T_FLOAT:
-	{
-	    double a = RFLOAT_VALUE(y);
-
-	    if (isinf(a)) {
-		if (a > 0.0) return INT2FIX(-1);
-		else return INT2FIX(1);
-	    }
-	    return rb_dbl_cmp(rb_big2dbl(x), a);
-	}
-
-      default:
-	return rb_num_coerce_cmp(x, y, rb_intern("<=>"));
+    if (!isfinite(yd))
+        return Qfalse;
+    yf = modf(yd, &yi);
+    if (yf != 0)
+        return Qfalse;
+    if (FIXNUM_P(x)) {
+#if SIZEOF_LONG * CHAR_BIT < DBL_MANT_DIG /* assume FLT_RADIX == 2 */
+        double xd = (double)FIX2LONG(x);
+        return RBOOL(xd == yd);
+#else
+        long xn, yn;
+        if (yi < LONG_MIN || LONG_MAX_as_double <= yi)
+            return Qfalse;
+        xn = FIX2LONG(x);
+        yn = (long)yi;
+        return RBOOL(xn == yn);
+#endif
     }
+    y = rb_dbl2big(yi);
+    return rb_big_eq(x, y);
+}
 
-    if (RBIGNUM_SIGN(x) > RBIGNUM_SIGN(y)) return INT2FIX(1);
-    if (RBIGNUM_SIGN(x) < RBIGNUM_SIGN(y)) return INT2FIX(-1);
-    if (xlen < RBIGNUM_LEN(y))
-	return (RBIGNUM_SIGN(x)) ? INT2FIX(-1) : INT2FIX(1);
-    if (xlen > RBIGNUM_LEN(y))
-	return (RBIGNUM_SIGN(x)) ? INT2FIX(1) : INT2FIX(-1);
 
-    xds = BDIGITS(x);
-    yds = BDIGITS(y);
-
-    while(xlen-- && (xds[xlen]==yds[xlen]));
-    if (-1 == xlen) return INT2FIX(0);
-    return (xds[xlen] > yds[xlen]) ?
-	(RBIGNUM_SIGN(x) ? INT2FIX(1) : INT2FIX(-1)) :
-	    (RBIGNUM_SIGN(x) ? INT2FIX(-1) : INT2FIX(1));
+VALUE
+rb_big_cmp(VALUE x, VALUE y)
+{
+    if (FIXNUM_P(y)) {
+        x = bigfixize(x);
+        if (FIXNUM_P(x)) {
+            /* SIGNED_VALUE and Fixnum have same sign-bits, same
+             * order */
+            SIGNED_VALUE sx = (SIGNED_VALUE)x, sy = (SIGNED_VALUE)y;
+            if (sx < sy) return INT2FIX(-1);
+            return INT2FIX(sx > sy);
+        }
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        if (BIGNUM_SIGN(x) == BIGNUM_SIGN(y)) {
+            int cmp = bary_cmp(BDIGITS(x), BIGNUM_LEN(x), BDIGITS(y), BIGNUM_LEN(y));
+            return INT2FIX(BIGNUM_SIGN(x) ? cmp : -cmp);
+        }
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return rb_integer_float_cmp(x, y);
+    }
+    else {
+        return rb_num_coerce_cmp(x, y, idCmp);
+    }
+    return INT2FIX(BIGNUM_SIGN(x) ? 1 : -1);
 }
 
+enum big_op_t {
+    big_op_gt,
+    big_op_ge,
+    big_op_lt,
+    big_op_le
+};
+
 static VALUE
-big_op(VALUE x, VALUE y, int op)
+big_op(VALUE x, VALUE y, enum big_op_t op)
 {
     VALUE rel;
     int n;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-      case T_BIGNUM:
-	rel = rb_big_cmp(x, y);
-	break;
-
-      case T_FLOAT:
-	{
-	    double a = RFLOAT_VALUE(y);
-
-	    if (isinf(a)) {
-		if (a > 0.0) rel = INT2FIX(-1);
-		else rel = INT2FIX(1);
-		break;
-	    }
-	    rel = rb_dbl_cmp(rb_big2dbl(x), a);
-	    break;
-	}
-
-      default:
-	{
-	    ID id = 0;
-	    switch (op) {
-		case 0: id = '>'; break;
-		case 1: id = rb_intern(">="); break;
-		case 2: id = '<'; break;
-		case 3: id = rb_intern("<="); break;
-	    }
-	    return rb_num_coerce_relop(x, y, id);
-	}
+    if (RB_INTEGER_TYPE_P(y)) {
+        rel = rb_big_cmp(x, y);
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        rel = rb_integer_float_cmp(x, y);
+    }
+    else {
+        ID id = 0;
+        switch (op) {
+          case big_op_gt: id = '>'; break;
+          case big_op_ge: id = idGE; break;
+          case big_op_lt: id = '<'; break;
+          case big_op_le: id = idLE; break;
+        }
+        return rb_num_coerce_relop(x, y, id);
     }
 
     if (NIL_P(rel)) return Qfalse;
     n = FIX2INT(rel);
 
     switch (op) {
-	case 0: return n >  0 ? Qtrue : Qfalse;
-	case 1: return n >= 0 ? Qtrue : Qfalse;
-	case 2: return n <  0 ? Qtrue : Qfalse;
-	case 3: return n <= 0 ? Qtrue : Qfalse;
+        case big_op_gt: return RBOOL(n >  0);
+        case big_op_ge: return RBOOL(n >= 0);
+        case big_op_lt: return RBOOL(n <  0);
+        case big_op_le: return RBOOL(n <= 0);
     }
     return Qundef;
 }
 
-/*
- * call-seq:
- *   big > real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * greater than that of <code>real</code>.
- */
-
-static VALUE
-big_gt(VALUE x, VALUE y)
+VALUE
+rb_big_gt(VALUE x, VALUE y)
 {
-    return big_op(x, y, 0);
+    return big_op(x, y, big_op_gt);
 }
 
-/*
- * call-seq:
- *   big >= real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * greater than or equal to that of <code>real</code>.
- */
-
-static VALUE
-big_ge(VALUE x, VALUE y)
+VALUE
+rb_big_ge(VALUE x, VALUE y)
 {
-    return big_op(x, y, 1);
+    return big_op(x, y, big_op_ge);
 }
 
-/*
- * call-seq:
- *   big < real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * less than that of <code>real</code>.
- */
-
-static VALUE
-big_lt(VALUE x, VALUE y)
+VALUE
+rb_big_lt(VALUE x, VALUE y)
 {
-    return big_op(x, y, 2);
+    return big_op(x, y, big_op_lt);
 }
 
-/*
- * call-seq:
- *   big <= real  ->  true or false
- *
- * Returns <code>true</code> if the value of <code>big</code> is
- * less than or equal to that of <code>real</code>.
- */
-
-static VALUE
-big_le(VALUE x, VALUE y)
+VALUE
+rb_big_le(VALUE x, VALUE y)
 {
-    return big_op(x, y, 3);
+    return big_op(x, y, big_op_le);
 }
 
 /*
@@ -1597,8 +5533,8 @@ big_le(VALUE x, VALUE y)
  *     big == obj  -> true or false
  *
  *  Returns <code>true</code> only if <i>obj</i> has the same value
- *  as <i>big</i>. Contrast this with <code>Bignum#eql?</code>, which
- *  requires <i>obj</i> to be a <code>Bignum</code>.
+ *  as <i>big</i>. Contrast this with Integer#eql?, which requires
+ *  <i>obj</i> to be an Integer.
  *
  *     68719476736 == 68719476736.0   #=> true
  */
@@ -1606,156 +5542,88 @@ big_le(VALUE x, VALUE y)
 VALUE
 rb_big_eq(VALUE x, VALUE y)
 {
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-      case T_BIGNUM:
-	break;
-      case T_FLOAT:
-	{
-	    volatile double a, b;
-
-	    a = RFLOAT_VALUE(y);
-	    if (isnan(a) || isinf(a)) return Qfalse;
-	    b = rb_big2dbl(x);
-	    return (a == b)?Qtrue:Qfalse;
-	}
-      default:
-	return rb_equal(y, x);
-    }
-    if (RBIGNUM_SIGN(x) != RBIGNUM_SIGN(y)) return Qfalse;
-    if (RBIGNUM_LEN(x) != RBIGNUM_LEN(y)) return Qfalse;
-    if (MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,RBIGNUM_LEN(y)) != 0) return Qfalse;
-    return Qtrue;
+    if (FIXNUM_P(y)) {
+        return RBOOL(bignorm(x) == y);
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return rb_integer_float_eq(x, y);
+    }
+    else {
+        return rb_equal(y, x);
+    }
+    if (BIGNUM_SIGN(x) != BIGNUM_SIGN(y)) return Qfalse;
+    if (BIGNUM_LEN(x) != BIGNUM_LEN(y)) return Qfalse;
+    return RBOOL(MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,BIGNUM_LEN(y)) == 0);
 }
 
-/*
- *  call-seq:
- *     big.eql?(obj)   -> true or false
- *
- *  Returns <code>true</code> only if <i>obj</i> is a
- *  <code>Bignum</code> with the same value as <i>big</i>. Contrast this
- *  with <code>Bignum#==</code>, which performs type conversions.
- *
- *     68719476736.eql?(68719476736.0)   #=> false
- */
-
-static VALUE
+VALUE
 rb_big_eql(VALUE x, VALUE y)
 {
-    if (!RB_TYPE_P(y, T_BIGNUM)) return Qfalse;
-    if (RBIGNUM_SIGN(x) != RBIGNUM_SIGN(y)) return Qfalse;
-    if (RBIGNUM_LEN(x) != RBIGNUM_LEN(y)) return Qfalse;
-    if (MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,RBIGNUM_LEN(y)) != 0) return Qfalse;
-    return Qtrue;
+    if (!RB_BIGNUM_TYPE_P(y)) return Qfalse;
+    if (BIGNUM_SIGN(x) != BIGNUM_SIGN(y)) return Qfalse;
+    if (BIGNUM_LEN(x) != BIGNUM_LEN(y)) return Qfalse;
+    return RBOOL(MEMCMP(BDIGITS(x),BDIGITS(y),BDIGIT,BIGNUM_LEN(y)) == 0);
 }
 
-/*
- * call-seq:
- *    -big   ->  integer
- *
- * Unary minus (returns an integer whose value is 0-big)
- */
-
 VALUE
 rb_big_uminus(VALUE x)
 {
     VALUE z = rb_big_clone(x);
 
-    RBIGNUM_SET_SIGN(z, !RBIGNUM_SIGN(x));
+    BIGNUM_NEGATE(z);
 
     return bignorm(z);
 }
 
-/*
- * call-seq:
- *     ~big  ->  integer
- *
- * Inverts the bits in big. As Bignums are conceptually infinite
- * length, the result acts as if it had an infinite number of one
- * bits to the left. In hex representations, this is displayed
- * as two periods to the left of the digits.
- *
- *   sprintf("%X", ~0x1122334455)    #=> "..FEEDDCCBBAA"
- */
-
-static VALUE
-rb_big_neg(VALUE x)
+VALUE
+rb_big_comp(VALUE x)
 {
     VALUE z = rb_big_clone(x);
-    BDIGIT *ds;
-    long i;
-
-    if (!RBIGNUM_SIGN(x)) get2comp(z);
-    ds = BDIGITS(z);
-    i = RBIGNUM_LEN(x);
-    if (!i) return INT2FIX(~(SIGNED_VALUE)0);
-    while (i--) {
-	ds[i] = ~ds[i];
-    }
-    RBIGNUM_SET_SIGN(z, !RBIGNUM_SIGN(z));
-    if (RBIGNUM_SIGN(x)) get2comp(z);
+    BDIGIT *ds = BDIGITS(z);
+    long n = BIGNUM_LEN(z);
 
-    return bignorm(z);
-}
-
-static void
-bigsub_core(BDIGIT *xds, long xn, BDIGIT *yds, long yn, BDIGIT *zds, long zn)
-{
-    BDIGIT_DBL_SIGNED num;
-    long i;
+    if (!n) return INT2FIX(-1);
 
-    for (i = 0, num = 0; i < yn; i++) {
-	num += (BDIGIT_DBL_SIGNED)xds[i] - yds[i];
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
-    }
-    while (num && i < xn) {
-	num += xds[i];
-	zds[i++] = BIGLO(num);
-	num = BIGDN(num);
-    }
-    while (i < xn) {
-	zds[i] = xds[i];
-	i++;
+    if (BIGNUM_POSITIVE_P(z)) {
+        if (bary_add_one(ds, n)) {
+            big_extend_carry(z);
+        }
+        BIGNUM_SET_NEGATIVE_SIGN(z);
     }
-    assert(i <= zn);
-    while (i < zn) {
-	zds[i++] = 0;
+    else {
+        bary_neg(ds, n);
+        if (bary_add_one(ds, n))
+            return INT2FIX(-1);
+        bary_neg(ds, n);
+        BIGNUM_SET_POSITIVE_SIGN(z);
     }
+
+    return bignorm(z);
 }
 
 static VALUE
 bigsub(VALUE x, VALUE y)
 {
-    VALUE z = 0;
-    long i = RBIGNUM_LEN(x);
-    BDIGIT *xds, *yds;
-
-    /* if x is smaller than y, swap */
-    if (RBIGNUM_LEN(x) < RBIGNUM_LEN(y)) {
-	z = x; x = y; y = z;	/* swap x y */
-    }
-    else if (RBIGNUM_LEN(x) == RBIGNUM_LEN(y)) {
-	xds = BDIGITS(x);
-	yds = BDIGITS(y);
-	while (i > 0) {
-	    i--;
-	    if (xds[i] > yds[i]) {
-		break;
-	    }
-	    if (xds[i] < yds[i]) {
-		z = x; x = y; y = z;	/* swap x y */
-		break;
-	    }
-	}
-    }
-
-    z = bignew(RBIGNUM_LEN(x), z==0);
-    bigsub_core(BDIGITS(x), RBIGNUM_LEN(x),
-		BDIGITS(y), RBIGNUM_LEN(y),
-		BDIGITS(z), RBIGNUM_LEN(z));
+    VALUE z;
+    BDIGIT *xds, *yds, *zds;
+    long xn, yn, zn;
+
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
+    zn = xn < yn ? yn : xn;
+
+    z = bignew(zn, 1);
+
+    xds = BDIGITS(x);
+    yds = BDIGITS(y);
+    zds = BDIGITS(z);
+
+    if (bary_sub(zds, zn, xds, xn, yds, yn)) {
+        bary_2comp(zds, zn);
+        BIGNUM_SET_NEGATIVE_SIGN(z);
+    }
 
     return z;
 }
@@ -1767,48 +5635,93 @@ bigsub_int(VALUE x, long y0)
 {
     VALUE z;
     BDIGIT *xds, *zds;
-    long xn;
+    long xn, zn;
     BDIGIT_DBL_SIGNED num;
     long i, y;
 
     y = y0;
     xds = BDIGITS(x);
-    xn = RBIGNUM_LEN(x);
+    xn = BIGNUM_LEN(x);
 
-    z = bignew(xn, RBIGNUM_SIGN(x));
+    if (xn == 0)
+        return LONG2NUM(-y0);
+
+    zn = xn;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+    z = bignew(zn, BIGNUM_SIGN(x));
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS == SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+    assert(xn == zn);
     num = (BDIGIT_DBL_SIGNED)xds[0] - y;
     if (xn == 1 && num < 0) {
-	RBIGNUM_SET_SIGN(z, !RBIGNUM_SIGN(x));
-	zds[0] = (BDIGIT)-num;
-	RB_GC_GUARD(x);
-	return bignorm(z);
+        BIGNUM_NEGATE(z);
+        zds[0] = (BDIGIT)-num;
+        RB_GC_GUARD(x);
+        return bignorm(z);
     }
     zds[0] = BIGLO(num);
     num = BIGDN(num);
     i = 1;
+    if (i < xn)
+        goto y_is_zero_x;
+    goto finish;
 #else
     num = 0;
-    for (i=0; i<(int)(sizeof(y)/sizeof(BDIGIT)); i++) {
-	num += (BDIGIT_DBL_SIGNED)xds[i] - BIGLO(y);
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
-	y = BIGDN(y);
+    for (i=0; i < xn; i++) {
+        if (y == 0) goto y_is_zero_x;
+        num += (BDIGIT_DBL_SIGNED)xds[i] - BIGLO(y);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        y = BIGDN(y);
+    }
+    for (; i < zn; i++) {
+        if (y == 0) goto y_is_zero_z;
+        num -= BIGLO(y);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        y = BIGDN(y);
+    }
+    goto finish;
+#endif
+
+    for (; i < xn; i++) {
+      y_is_zero_x:
+        if (num == 0) goto num_is_zero_x;
+        num += xds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+    }
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    for (; i < zn; i++) {
+      y_is_zero_z:
+        if (num == 0) goto num_is_zero_z;
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
 #endif
-    while (num && i < xn) {
-	num += xds[i];
-	zds[i++] = BIGLO(num);
-	num = BIGDN(num);
+    goto finish;
+
+    for (; i < xn; i++) {
+      num_is_zero_x:
+        zds[i] = xds[i];
     }
-    while (i < xn) {
-	zds[i] = xds[i];
-	i++;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    for (; i < zn; i++) {
+      num_is_zero_z:
+        zds[i] = 0;
     }
+#endif
+    goto finish;
+
+  finish:
+    assert(num == 0 || num == -1);
     if (num < 0) {
-	z = bigsub(x, rb_int2big(y0));
+        get2comp(z);
+        BIGNUM_NEGATE(z);
     }
     RB_GC_GUARD(x);
     return bignorm(z);
@@ -1824,953 +5737,338 @@ bigadd_int(VALUE x, long y)
     long i;
 
     xds = BDIGITS(x);
-    xn = RBIGNUM_LEN(x);
+    xn = BIGNUM_LEN(x);
 
-    if (xn < 2) {
-	zn = 3;
-    }
-    else {
-	zn = xn + 1;
-    }
-    z = bignew(zn, RBIGNUM_SIGN(x));
+    if (xn == 0)
+        return LONG2NUM(y);
+
+    zn = xn;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+    zn++;
+
+    z = bignew(zn, BIGNUM_SIGN(x));
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS == SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     num = (BDIGIT_DBL)xds[0] + y;
     zds[0] = BIGLO(num);
     num = BIGDN(num);
     i = 1;
+    if (i < xn)
+        goto y_is_zero_x;
+    goto y_is_zero_z;
 #else
     num = 0;
-    for (i=0; i<(int)(sizeof(y)/sizeof(BDIGIT)); i++) {
-	num += (BDIGIT_DBL)xds[i] + BIGLO(y);
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
-	y = BIGDN(y);
-    }
-#endif
-    while (num && i < xn) {
-	num += xds[i];
-	zds[i++] = BIGLO(num);
-	num = BIGDN(num);
-    }
-    if (num) zds[i++] = (BDIGIT)num;
-    else while (i < xn) {
-	zds[i] = xds[i];
-	i++;
-    }
-    assert(i <= zn);
-    while (i < zn) {
-	zds[i++] = 0;
-    }
-    RB_GC_GUARD(x);
-    return bignorm(z);
-}
+    for (i=0; i < xn; i++) {
+        if (y == 0) goto y_is_zero_x;
+        num += (BDIGIT_DBL)xds[i] + BIGLO(y);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        y = BIGDN(y);
+    }
+    for (; i < zn; i++) {
+        if (y == 0) goto y_is_zero_z;
+        num += BIGLO(y);
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        y = BIGDN(y);
+    }
+    goto finish;
 
-static void
-bigadd_core(BDIGIT *xds, long xn, BDIGIT *yds, long yn, BDIGIT *zds, long zn)
-{
-    BDIGIT_DBL num = 0;
-    long i;
-
-    if (xn > yn) {
-	BDIGIT *tds;
-	tds = xds; xds = yds; yds = tds;
-	i = xn; xn = yn; yn = i;
-    }
+#endif
 
-    i = 0;
-    while (i < xn) {
-	num += (BDIGIT_DBL)xds[i] + yds[i];
-	zds[i++] = BIGLO(num);
-	num = BIGDN(num);
+    for (;i < xn; i++) {
+      y_is_zero_x:
+        if (num == 0) goto num_is_zero_x;
+        num += (BDIGIT_DBL)xds[i];
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
-    while (num && i < yn) {
-	num += yds[i];
-	zds[i++] = BIGLO(num);
-	num = BIGDN(num);
+    for (; i < zn; i++) {
+      y_is_zero_z:
+        if (num == 0) goto num_is_zero_z;
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
-    while (i < yn) {
-	zds[i] = yds[i];
-	i++;
+    goto finish;
+
+    for (;i < xn; i++) {
+      num_is_zero_x:
+        zds[i] = xds[i];
     }
-    if (num) zds[i++] = (BDIGIT)num;
-    assert(i <= zn);
-    while (i < zn) {
-	zds[i++] = 0;
+    for (; i < zn; i++) {
+      num_is_zero_z:
+        zds[i] = 0;
     }
+    goto finish;
+
+  finish:
+    RB_GC_GUARD(x);
+    return bignorm(z);
 }
 
 static VALUE
 bigadd(VALUE x, VALUE y, int sign)
 {
     VALUE z;
-    long len;
+    size_t len;
 
-    sign = (sign == RBIGNUM_SIGN(y));
-    if (RBIGNUM_SIGN(x) != sign) {
-	if (sign) return bigsub(y, x);
-	return bigsub(x, y);
+    sign = (sign == BIGNUM_SIGN(y));
+    if (BIGNUM_SIGN(x) != sign) {
+        if (sign) return bigsub(y, x);
+        return bigsub(x, y);
     }
 
-    if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
-	len = RBIGNUM_LEN(x) + 1;
+    if (BIGNUM_LEN(x) > BIGNUM_LEN(y)) {
+        len = BIGNUM_LEN(x) + 1;
     }
     else {
-	len = RBIGNUM_LEN(y) + 1;
+        len = BIGNUM_LEN(y) + 1;
     }
     z = bignew(len, sign);
 
-    bigadd_core(BDIGITS(x), RBIGNUM_LEN(x),
-		BDIGITS(y), RBIGNUM_LEN(y),
-		BDIGITS(z), RBIGNUM_LEN(z));
+    bary_add(BDIGITS(z), BIGNUM_LEN(z),
+             BDIGITS(x), BIGNUM_LEN(x),
+             BDIGITS(y), BIGNUM_LEN(y));
 
     return z;
 }
 
-/*
- *  call-seq:
- *     big + other  -> Numeric
- *
- *  Adds big and other, returning the result.
- */
-
 VALUE
 rb_big_plus(VALUE x, VALUE y)
 {
     long n;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	n = FIX2LONG(y);
-	if ((n > 0) != RBIGNUM_SIGN(x)) {
-	    if (n < 0) {
-		n = -n;
-	    }
-	    return bigsub_int(x, n);
-	}
-	if (n < 0) {
-	    n = -n;
-	}
-	return bigadd_int(x, n);
-
-      case T_BIGNUM:
-	return bignorm(bigadd(x, y, 1));
-
-      case T_FLOAT:
-	return DBL2NUM(rb_big2dbl(x) + RFLOAT_VALUE(y));
-
-      default:
-	return rb_num_coerce_bin(x, y, '+');
+    if (FIXNUM_P(y)) {
+        n = FIX2LONG(y);
+        if ((n > 0) != BIGNUM_SIGN(x)) {
+            if (n < 0) {
+                n = -n;
+            }
+            return bigsub_int(x, n);
+        }
+        if (n < 0) {
+            n = -n;
+        }
+        return bigadd_int(x, n);
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        return bignorm(bigadd(x, y, 1));
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return DBL2NUM(rb_big2dbl(x) + RFLOAT_VALUE(y));
+    }
+    else {
+        return rb_num_coerce_bin(x, y, '+');
     }
 }
 
-/*
- *  call-seq:
- *     big - other  -> Numeric
- *
- *  Subtracts other from big, returning the result.
- */
-
 VALUE
 rb_big_minus(VALUE x, VALUE y)
 {
     long n;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	n = FIX2LONG(y);
-	if ((n > 0) != RBIGNUM_SIGN(x)) {
-	    if (n < 0) {
-		n = -n;
-	    }
-	    return bigadd_int(x, n);
-	}
-	if (n < 0) {
-	    n = -n;
-	}
-	return bigsub_int(x, n);
-
-      case T_BIGNUM:
-	return bignorm(bigadd(x, y, 0));
-
-      case T_FLOAT:
-	return DBL2NUM(rb_big2dbl(x) - RFLOAT_VALUE(y));
-
-      default:
-	return rb_num_coerce_bin(x, y, '-');
+    if (FIXNUM_P(y)) {
+        n = FIX2LONG(y);
+        if ((n > 0) != BIGNUM_SIGN(x)) {
+            if (n < 0) {
+                n = -n;
+            }
+            return bigadd_int(x, n);
+        }
+        if (n < 0) {
+            n = -n;
+        }
+        return bigsub_int(x, n);
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        return bignorm(bigadd(x, y, 0));
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return DBL2NUM(rb_big2dbl(x) - RFLOAT_VALUE(y));
+    }
+    else {
+        return rb_num_coerce_bin(x, y, '-');
     }
-}
-
-static long
-big_real_len(VALUE x)
-{
-    long i = RBIGNUM_LEN(x);
-    BDIGIT *xds = BDIGITS(x);
-    while (--i && !xds[i]);
-    return i + 1;
 }
 
 static VALUE
-bigmul1_single(VALUE x, VALUE y)
+bigsq(VALUE x)
 {
-    BDIGIT_DBL n;
-    VALUE z = bignew(2, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-    BDIGIT *xds, *yds, *zds;
+    long xn, zn;
+    VALUE z;
+    BDIGIT *xds, *zds;
+
+    xn = BIGNUM_LEN(x);
+    zn = 2 * xn;
+
+    z = bignew(zn, 1);
 
     xds = BDIGITS(x);
-    yds = BDIGITS(y);
     zds = BDIGITS(z);
 
-    n = (BDIGIT_DBL)xds[0] * yds[0];
-    zds[0] = BIGLO(n);
-    zds[1] = (BDIGIT)BIGDN(n);
+    if (xn < NAIVE_MUL_DIGITS)
+        bary_sq_fast(zds, zn, xds, xn);
+    else
+        bary_mul(zds, zn, xds, xn, xds, xn);
 
+    RB_GC_GUARD(x);
     return z;
 }
 
 static VALUE
-bigmul1_normal(VALUE x, VALUE y)
+bigmul0(VALUE x, VALUE y)
 {
-    long xl = RBIGNUM_LEN(x), yl = RBIGNUM_LEN(y), i, j = xl + yl + 1;
-    BDIGIT_DBL n = 0;
-    VALUE z = bignew(j, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
+    long xn, yn, zn;
+    VALUE z;
     BDIGIT *xds, *yds, *zds;
 
-    xds = BDIGITS(x);
-    yds = BDIGITS(y);
-    zds = BDIGITS(z);
-    while (j--) zds[j] = 0;
-    for (i = 0; i < xl; i++) {
-	BDIGIT_DBL dd;
-	dd = xds[i];
-	if (dd == 0) continue;
-	n = 0;
-	for (j = 0; j < yl; j++) {
-	    BDIGIT_DBL ee = n + (BDIGIT_DBL)dd * yds[j];
-	    n = zds[i + j] + ee;
-	    if (ee) zds[i + j] = BIGLO(n);
-	    n = BIGDN(n);
-	}
-	if (n) {
-	    zds[i + j] = (BDIGIT)n;
-	}
-    }
-    rb_thread_check_ints();
-    return z;
-}
-
-static VALUE bigmul0(VALUE x, VALUE y);
+    if (x == y)
+        return bigsq(x);
 
-/* balancing multiplication by slicing larger argument */
-static VALUE
-bigmul1_balance(VALUE x, VALUE y)
-{
-    VALUE z, t1, t2;
-    long i, xn, yn, r, n;
-    BDIGIT *yds, *zds, *t1ds;
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
+    zn = xn + yn;
 
-    xn = RBIGNUM_LEN(x);
-    yn = RBIGNUM_LEN(y);
-    assert(2 * xn <= yn || 3 * xn <= 2*(yn+2));
-
-    z = bignew(xn + yn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-    t1 = bignew(xn, 1);
+    z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
 
+    xds = BDIGITS(x);
     yds = BDIGITS(y);
     zds = BDIGITS(z);
-    t1ds = BDIGITS(t1);
-
-    for (i = 0; i < xn + yn; i++) zds[i] = 0;
 
-    n = 0;
-    while (yn > 0) {
-	r = xn > yn ? yn : xn;
-	MEMCPY(t1ds, yds + n, BDIGIT, r);
-	RBIGNUM_SET_LEN(t1, r);
-	t2 = bigmul0(x, t1);
-	bigadd_core(zds + n, RBIGNUM_LEN(z) - n,
-		    BDIGITS(t2), big_real_len(t2),
-		    zds + n, RBIGNUM_LEN(z) - n);
-	yn -= r;
-	n += r;
-    }
+    bary_mul(zds, zn, xds, xn, yds, yn);
 
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
     return z;
 }
 
-/* split a bignum into high and low bignums */
-static void
-big_split(VALUE v, long n, volatile VALUE *ph, volatile VALUE *pl)
+VALUE
+rb_big_mul(VALUE x, VALUE y)
 {
-    long hn = 0, ln = RBIGNUM_LEN(v);
-    VALUE h, l;
-    BDIGIT *vds = BDIGITS(v);
-
-    if (ln > n) {
-	hn = ln - n;
-	ln = n;
-    }
-
-    if (!hn) {
-	h = rb_uint2big(0);
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
     }
-    else {
-	while (--hn && !vds[hn + ln]);
-	h = bignew(hn += 2, 1);
-	MEMCPY(BDIGITS(h), vds + ln, BDIGIT, hn - 1);
-	BDIGITS(h)[hn - 1] = 0; /* margin for carry */
+    else if (RB_BIGNUM_TYPE_P(y)) {
     }
-
-    while (--ln && !vds[ln]);
-    l = bignew(ln += 2, 1);
-    MEMCPY(BDIGITS(l), vds, BDIGIT, ln - 1);
-    BDIGITS(l)[ln - 1] = 0; /* margin for carry */
-
-    *pl = l;
-    *ph = h;
-}
-
-/* multiplication by karatsuba method */
-static VALUE
-bigmul1_karatsuba(VALUE x, VALUE y)
-{
-    long i, n, xn, yn, t1n, t2n;
-    VALUE xh, xl, yh, yl, z, t1, t2, t3;
-    BDIGIT *zds;
-
-    xn = RBIGNUM_LEN(x);
-    yn = RBIGNUM_LEN(y);
-    n = yn / 2;
-    big_split(x, n, &xh, &xl);
-    if (x == y) {
-	yh = xh; yl = xl;
-    }
-    else big_split(y, n, &yh, &yl);
-
-    /* x = xh * b + xl
-     * y = yh * b + yl
-     *
-     * Karatsuba method:
-     *   x * y = z2 * b^2 + z1 * b + z0
-     *   where
-     *     z2 = xh * yh
-     *     z0 = xl * yl
-     *     z1 = (xh + xl) * (yh + yl) - z2 - z0
-     *
-     *  ref: http://en.wikipedia.org/wiki/Karatsuba_algorithm
-     */
-
-    /* allocate a result bignum */
-    z = bignew(xn + yn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-    zds = BDIGITS(z);
-
-    /* t1 <- xh * yh */
-    t1 = bigmul0(xh, yh);
-    t1n = big_real_len(t1);
-
-    /* copy t1 into high bytes of the result (z2) */
-    MEMCPY(zds + 2 * n, BDIGITS(t1), BDIGIT, t1n);
-    for (i = 2 * n + t1n; i < xn + yn; i++) zds[i] = 0;
-
-    if (!BIGZEROP(xl) && !BIGZEROP(yl)) {
-	/* t2 <- xl * yl */
-	t2 = bigmul0(xl, yl);
-	t2n = big_real_len(t2);
-
-	/* copy t2 into low bytes of the result (z0) */
-	MEMCPY(zds, BDIGITS(t2), BDIGIT, t2n);
-	for (i = t2n; i < 2 * n; i++) zds[i] = 0;
+    else if (RB_FLOAT_TYPE_P(y)) {
+        return DBL2NUM(rb_big2dbl(x) * RFLOAT_VALUE(y));
     }
     else {
-	t2 = Qundef;
-	t2n = 0;
-
-	/* copy 0 into low bytes of the result (z0) */
-	for (i = 0; i < 2 * n; i++) zds[i] = 0;
-    }
-
-    /* xh <- xh + xl */
-    if (RBIGNUM_LEN(xl) > RBIGNUM_LEN(xh)) {
-	t3 = xl; xl = xh; xh = t3;
+        return rb_num_coerce_bin(x, y, '*');
     }
-    /* xh has a margin for carry */
-    bigadd_core(BDIGITS(xh), RBIGNUM_LEN(xh),
-		BDIGITS(xl), RBIGNUM_LEN(xl),
-		BDIGITS(xh), RBIGNUM_LEN(xh));
-
-    /* yh <- yh + yl */
-    if (x != y) {
-	if (RBIGNUM_LEN(yl) > RBIGNUM_LEN(yh)) {
-	    t3 = yl; yl = yh; yh = t3;
-	}
-	/* yh has a margin for carry */
-	bigadd_core(BDIGITS(yh), RBIGNUM_LEN(yh),
-		    BDIGITS(yl), RBIGNUM_LEN(yl),
-		    BDIGITS(yh), RBIGNUM_LEN(yh));
-    }
-    else yh = xh;
-
-    /* t3 <- xh * yh */
-    t3 = bigmul0(xh, yh);
-
-    i = xn + yn - n;
-    /* subtract t1 from t3 */
-    bigsub_core(BDIGITS(t3), big_real_len(t3), BDIGITS(t1), t1n, BDIGITS(t3), big_real_len(t3));
-
-    /* subtract t2 from t3; t3 is now the middle term of the product */
-    if (t2 != Qundef) bigsub_core(BDIGITS(t3), big_real_len(t3), BDIGITS(t2), t2n, BDIGITS(t3), big_real_len(t3));
-
-    /* add t3 to middle bytes of the result (z1) */
-    bigadd_core(zds + n, i, BDIGITS(t3), big_real_len(t3), zds + n, i);
-
-    return z;
-}
-
-static void
-biglsh_bang(BDIGIT *xds, long xn, unsigned long shift)
-{
-    long const s1 = shift/BITSPERDIG;
-    int const s2 = (int)(shift%BITSPERDIG);
-    int const s3 = BITSPERDIG-s2;
-    BDIGIT* zds;
-    BDIGIT num;
-    long i;
-    if (s1 >= xn) {
-	MEMZERO(xds, BDIGIT, xn);
-	return;
-    }
-    zds = xds + xn - 1;
-    xn -= s1 + 1;
-    num = xds[xn]<<s2;
-    do {
-	*zds-- = num | xds[--xn]>>s3;
-	num = xds[xn]<<s2;
-    }
-    while (xn > 0);
-    *zds = num;
-    for (i = s1; i > 0; --i)
-	*zds-- = 0;
-}
-
-static void
-bigrsh_bang(BDIGIT* xds, long xn, unsigned long shift)
-{
-    long s1 = shift/BITSPERDIG;
-    int s2 = (int)(shift%BITSPERDIG);
-    int s3 = BITSPERDIG - s2;
-    int i;
-    BDIGIT num;
-    BDIGIT* zds;
-    if (s1 >= xn) {
-	MEMZERO(xds, BDIGIT, xn);
-	return;
-    }
-
-    i = 0;
-    zds = xds + s1;
-    num = *zds++>>s2;
-    do {
-	xds[i++] = (BDIGIT)(*zds<<s3) | num;
-	num = *zds++>>s2;
-    }
-    while (i < xn - s1 - 1);
-    xds[i] = num;
-    MEMZERO(xds + xn - s1, BDIGIT, s1);
-}
 
-static void
-big_split3(VALUE v, long n, volatile VALUE* p0, volatile VALUE* p1, volatile VALUE* p2)
-{
-    VALUE v0, v12, v1, v2;
-
-    big_split(v, n, &v12, &v0);
-    big_split(v12, n, &v2, &v1);
-
-    *p0 = bigtrunc(v0);
-    *p1 = bigtrunc(v1);
-    *p2 = bigtrunc(v2);
+    return bignorm(bigmul0(x, y));
 }
 
-static VALUE big_lshift(VALUE, unsigned long);
-static VALUE big_rshift(VALUE, unsigned long);
-static VALUE bigdivrem(VALUE, VALUE, volatile VALUE*, volatile VALUE*);
-
 static VALUE
-bigmul1_toom3(VALUE x, VALUE y)
+bigdivrem(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
 {
-    long n, xn, yn, zn;
-    VALUE x0, x1, x2, y0, y1, y2;
-    VALUE u0, u1, u2, u3, u4, v1, v2, v3;
-    VALUE z0, z1, z2, z3, z4, z, t;
-    BDIGIT* zds;
-
-    xn = RBIGNUM_LEN(x);
-    yn = RBIGNUM_LEN(y);
-    assert(xn <= yn);  /* assume y >= x */
-
-    n = (yn + 2) / 3;
-    big_split3(x, n, &x0, &x1, &x2);
-    if (x == y) {
-	y0 = x0; y1 = x1; y2 = x2;
-    }
-    else big_split3(y, n, &y0, &y1, &y2);
-
-    /*
-     * ref. http://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication
-     *
-     * x(b) = x0 * b^0 + x1 * b^1 + x2 * b^2
-     * y(b) = y0 * b^0 + y1 * b^1 + y2 * b^2
-     *
-     * z(b) = x(b) * y(b)
-     * z(b) = z0 * b^0 + z1 * b^1 + z2 * b^2 + z3 * b^3 + z4 * b^4
-     * where:
-     *   z0 = x0 * y0
-     *   z1 = x0 * y1 + x1 * y0
-     *   z2 = x0 * y2 + x1 * y1 + x2 * y0
-     *   z3 = x1 * y2 + x2 * y1
-     *   z4 = x2 * y2
-     *
-     * Toom3 method (a.k.a. Toom-Cook method):
-     * (Step1) calculating 5 points z(b0), z(b1), z(b2), z(b3), z(b4),
-     * where:
-     *   b0 = 0, b1 = 1, b2 = -1, b3 = -2, b4 = inf,
-     *   z(0)   = x(0)   * y(0)   = x0 * y0
-     *   z(1)   = x(1)   * y(1)   = (x0 + x1 + x2) * (y0 + y1 + y2)
-     *   z(-1)  = x(-1)  * y(-1)  = (x0 - x1 + x2) * (y0 - y1 + y2)
-     *   z(-2)  = x(-2)  * y(-2)  = (x0 - 2 * (x1 - 2 * x2)) * (y0 - 2 * (y1 - 2 * y2))
-     *   z(inf) = x(inf) * y(inf) = x2 * y2
-     *
-     * (Step2) interpolating z0, z1, z2, z3, z4, and z5.
-     *
-     * (Step3) Substituting base value into b of the polynomial z(b),
-     */
-
-    /*
-     * [Step1] calculating 5 points z(b0), z(b1), z(b2), z(b3), z(b4)
-     */
-
-    /* u1 <- x0 + x2 */
-    u1 = bigtrunc(bigadd(x0, x2, 1));
+    long xn = BIGNUM_LEN(x), yn = BIGNUM_LEN(y);
+    VALUE z;
+    BDIGIT *xds, *yds, *zds;
+    BDIGIT dd;
 
-    /* x(-1) : u2 <- u1 - x1 = x0 - x1 + x2 */
-    u2 = bigtrunc(bigsub(u1, x1));
+    VALUE q = Qnil, r = Qnil;
+    BDIGIT *qds, *rds;
+    long qn, rn;
 
-    /* x(1) : u1 <- u1 + x1 = x0 + x1 + x2 */
-    u1 = bigtrunc(bigadd(u1, x1, 1));
+    yds = BDIGITS(y);
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
 
-    /* x(-2) : u3 <- 2 * (u2 + x2) - x0 = x0 - 2 * (x1 - 2 * x2) */
-    u3 = bigadd(u2, x2, 1);
-    if (BDIGITS(u3)[RBIGNUM_LEN(u3)-1] & BIGRAD_HALF) {
-	rb_big_resize(u3, RBIGNUM_LEN(u3) + 1);
-	BDIGITS(u3)[RBIGNUM_LEN(u3)-1] = 0;
+    xds = BDIGITS(x);
+    BARY_TRUNC(xds, xn);
+
+    if (xn < yn || (xn == yn && xds[xn - 1] < yds[yn - 1])) {
+        if (divp) *divp = rb_int2big(0);
+        if (modp) *modp = x;
+        return Qnil;
+    }
+    if (yn == 1) {
+        dd = yds[0];
+        z = bignew(xn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+        zds = BDIGITS(z);
+        dd = bigdivrem_single(zds, xds, xn, dd);
+        if (modp) {
+            *modp = rb_uint2big((uintptr_t)dd);
+            BIGNUM_SET_SIGN(*modp, BIGNUM_SIGN(x));
+        }
+        if (divp) *divp = z;
+        return Qnil;
+    }
+    if (xn == 2 && yn == 2) {
+        BDIGIT_DBL x0 = bary2bdigitdbl(xds, 2);
+        BDIGIT_DBL y0 = bary2bdigitdbl(yds, 2);
+        BDIGIT_DBL q0 = x0 / y0;
+        BDIGIT_DBL r0 = x0 % y0;
+        if (divp) {
+            z = bignew(bdigit_roomof(sizeof(BDIGIT_DBL)), BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+            zds = BDIGITS(z);
+            zds[0] = BIGLO(q0);
+            zds[1] = BIGLO(BIGDN(q0));
+            *divp = z;
+        }
+        if (modp) {
+            z = bignew(bdigit_roomof(sizeof(BDIGIT_DBL)), BIGNUM_SIGN(x));
+            zds = BDIGITS(z);
+            zds[0] = BIGLO(r0);
+            zds[1] = BIGLO(BIGDN(r0));
+            *modp = z;
+        }
+        return Qnil;
     }
-    biglsh_bang(BDIGITS(u3), RBIGNUM_LEN(u3), 1);
-    u3 = bigtrunc(bigadd(bigtrunc(u3), x0, 0));
 
-    if (x == y) {
-	v1 = u1; v2 = u2; v3 = u3;
+    if (divp) {
+        qn = xn + BIGDIVREM_EXTRA_WORDS;
+        q = bignew(qn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+        qds = BDIGITS(q);
     }
     else {
-	/* v1 <- y0 + y2 */
-	v1 = bigtrunc(bigadd(y0, y2, 1));
-
-	/* y(-1) : v2 <- v1 - y1 = y0 - y1 + y2 */
-	v2 = bigtrunc(bigsub(v1, y1));
-
-	/* y(1) : v1 <- v1 + y1 = y0 + y1 + y2 */
-	v1 = bigtrunc(bigadd(v1, y1, 1));
-
-	/* y(-2) : v3 <- 2 * (v2 + y2) - y0 = y0 - 2 * (y1 - 2 * y2) */
-	v3 = bigadd(v2, y2, 1);
-	if (BDIGITS(v3)[RBIGNUM_LEN(v3)-1] & BIGRAD_HALF) {
-	    rb_big_resize(v3, RBIGNUM_LEN(v3) + 1);
-	    BDIGITS(v3)[RBIGNUM_LEN(v3)-1] = 0;
-	}
-	biglsh_bang(BDIGITS(v3), RBIGNUM_LEN(v3), 1);
-	v3 = bigtrunc(bigadd(bigtrunc(v3), y0, 0));
-    }
-
-    /* z(0) : u0 <- x0 * y0 */
-    u0 = bigtrunc(bigmul0(x0, y0));
-
-    /* z(1) : u1 <- u1 * v1 */
-    u1 = bigtrunc(bigmul0(u1, v1));
-
-    /* z(-1) : u2 <- u2 * v2 */
-    u2 = bigtrunc(bigmul0(u2, v2));
-
-    /* z(-2) : u3 <- u3 * v3 */
-    u3 = bigtrunc(bigmul0(u3, v3));
-
-    /* z(inf) : u4 <- x2 * y2 */
-    u4 = bigtrunc(bigmul0(x2, y2));
-
-    /* for GC */
-    v1 = v2 = v3 = Qnil;
-
-    /*
-     * [Step2] interpolating z0, z1, z2, z3, z4, and z5.
-     */
-
-    /* z0 <- z(0) == u0 */
-    z0 = u0;
-
-    /* z4 <- z(inf) == u4 */
-    z4 = u4;
-
-    /* z3 <- (z(-2) - z(1)) / 3 == (u3 - u1) / 3 */
-    z3 = bigadd(u3, u1, 0);
-    bigdivrem(z3, big_three, &z3, NULL); /* TODO: optimize */
-    bigtrunc(z3);
-
-    /* z1 <- (z(1) - z(-1)) / 2 == (u1 - u2) / 2 */
-    z1 = bigtrunc(bigadd(u1, u2, 0));
-    bigrsh_bang(BDIGITS(z1), RBIGNUM_LEN(z1), 1);
-
-    /* z2 <- z(-1) - z(0) == u2 - u0 */
-    z2 = bigtrunc(bigadd(u2, u0, 0));
-
-    /* z3 <- (z2 - z3) / 2 + 2 * z(inf) == (z2 - z3) / 2 + 2 * u4 */
-    z3 = bigadd(z2, z3, 0);
-    bigrsh_bang(BDIGITS(z3), RBIGNUM_LEN(z3), 1);
-    t = big_lshift(u4, 1); /* TODO: combining with next addition */
-    z3 = bigtrunc(bigadd(z3, t, 1));
-
-    /* z2 <- z2 + z1 - z(inf) == z2 + z1 - u4 */
-    z2 = bigtrunc(bigadd(z2, z1, 1));
-    z2 = bigtrunc(bigadd(z2, u4, 0));
-
-    /* z1 <- z1 - z3 */
-    z1 = bigtrunc(bigadd(z1, z3, 0));
-
-    /*
-     * [Step3] Substituting base value into b of the polynomial z(b),
-     */
-
-    zn = 6*n + 1;
-    z = bignew(zn, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-    zds = BDIGITS(z);
-    MEMCPY(zds, BDIGITS(z0), BDIGIT, RBIGNUM_LEN(z0));
-    MEMZERO(zds + RBIGNUM_LEN(z0), BDIGIT, zn - RBIGNUM_LEN(z0));
-    bigadd_core(zds +   n, zn -   n, BDIGITS(z1), big_real_len(z1), zds +   n, zn -   n);
-    bigadd_core(zds + 2*n, zn - 2*n, BDIGITS(z2), big_real_len(z2), zds + 2*n, zn - 2*n);
-    bigadd_core(zds + 3*n, zn - 3*n, BDIGITS(z3), big_real_len(z3), zds + 3*n, zn - 3*n);
-    bigadd_core(zds + 4*n, zn - 4*n, BDIGITS(z4), big_real_len(z4), zds + 4*n, zn - 4*n);
-    z = bignorm(z);
-
-    return bignorm(z);
-}
-
-/* efficient squaring (2 times faster than normal multiplication)
- * ref: Handbook of Applied Cryptography, Algorithm 14.16
- *      http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf
- */
-static VALUE
-bigsqr_fast(VALUE x)
-{
-    long len = RBIGNUM_LEN(x), i, j;
-    VALUE z = bignew(2 * len + 1, 1);
-    BDIGIT *xds = BDIGITS(x), *zds = BDIGITS(z);
-    BDIGIT_DBL c, v, w;
-
-    for (i = 2 * len + 1; i--; ) zds[i] = 0;
-    for (i = 0; i < len; i++) {
-	v = (BDIGIT_DBL)xds[i];
-	if (!v) continue;
-	c = (BDIGIT_DBL)zds[i + i] + v * v;
-	zds[i + i] = BIGLO(c);
-	c = BIGDN(c);
-	v *= 2;
-	for (j = i + 1; j < len; j++) {
-	    w = (BDIGIT_DBL)xds[j];
-	    c += (BDIGIT_DBL)zds[i + j] + BIGLO(v) * w;
-	    zds[i + j] = BIGLO(c);
-	    c = BIGDN(c);
-	    if (BIGDN(v)) c += w;
-	}
-	if (c) {
-	    c += (BDIGIT_DBL)zds[i + len];
-	    zds[i + len] = BIGLO(c);
-	    c = BIGDN(c);
-	}
-	if (c) zds[i + len + 1] += (BDIGIT)c;
+        qn = 0;
+        qds = NULL;
     }
-    return z;
-}
 
-#define KARATSUBA_MUL_DIGITS 70
-#define TOOM3_MUL_DIGITS 150
-
-
-/* determine whether a bignum is sparse or not by random sampling */
-static inline VALUE
-big_sparse_p(VALUE x)
-{
-    long c = 0, n = RBIGNUM_LEN(x);
-
-    if (          BDIGITS(x)[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
-    if (c <= 1 && BDIGITS(x)[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
-    if (c <= 1 && BDIGITS(x)[rb_genrand_ulong_limited(n / 2) + n / 4]) c++;
-
-    return (c <= 1) ? Qtrue : Qfalse;
-}
-
-static VALUE
-bigmul0(VALUE x, VALUE y)
-{
-    long xn, yn;
-
-    xn = RBIGNUM_LEN(x);
-    yn = RBIGNUM_LEN(y);
-
-    /* make sure that y is longer than x */
-    if (xn > yn) {
-	VALUE t;
-	long tn;
-	t = x; x = y; y = t;
-	tn = xn; xn = yn; yn = tn;
+    if (modp) {
+        rn = yn;
+        r = bignew(rn, BIGNUM_SIGN(x));
+        rds = BDIGITS(r);
     }
-    assert(xn <= yn);
-
-    /* normal multiplication when x is small */
-    if (xn < KARATSUBA_MUL_DIGITS) {
-      normal:
-	if (x == y) return bigsqr_fast(x);
-	if (xn == 1 && yn == 1) return bigmul1_single(x, y);
-	return bigmul1_normal(x, y);
+    else {
+        rn = 0;
+        rds = NULL;
     }
 
-    /* normal multiplication when x or y is a sparse bignum */
-    if (big_sparse_p(x)) goto normal;
-    if (big_sparse_p(y)) return bigmul1_normal(y, x);
-
-    /* balance multiplication by slicing y when x is much smaller than y */
-    if (2 * xn <= yn) return bigmul1_balance(x, y);
+    bary_divmod_branch(qds, qn, rds, rn, xds, xn, yds, yn);
 
-    if (xn < TOOM3_MUL_DIGITS) {
-	/* multiplication by karatsuba method */
-	return bigmul1_karatsuba(x, y);
+    if (divp) {
+        bigtrunc(q);
+        *divp = q;
     }
-    else if (3*xn <= 2*(yn + 2))
-	return bigmul1_balance(x, y);
-    return bigmul1_toom3(x, y);
-}
-
-/*
- *  call-seq:
- *     big * other  -> Numeric
- *
- *  Multiplies big and other, returning the result.
- */
-
-VALUE
-rb_big_mul(VALUE x, VALUE y)
-{
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      case T_FLOAT:
-	return DBL2NUM(rb_big2dbl(x) * RFLOAT_VALUE(y));
-
-      default:
-	return rb_num_coerce_bin(x, y, '*');
+    if (modp) {
+        bigtrunc(r);
+        *modp = r;
     }
 
-    return bignorm(bigmul0(x, y));
-}
-
-struct big_div_struct {
-    long nx, ny;
-    BDIGIT *yds, *zds;
-    VALUE stop;
-};
-
-static VALUE
-bigdivrem1(void *ptr)
-{
-    struct big_div_struct *bds = (struct big_div_struct*)ptr;
-    long nx = bds->nx, ny = bds->ny;
-    long i, j, nyzero;
-    BDIGIT *yds = bds->yds, *zds = bds->zds;
-    BDIGIT_DBL t2;
-    BDIGIT_DBL_SIGNED num;
-    BDIGIT q;
-
-    j = nx==ny?nx+1:nx;
-    for (nyzero = 0; !yds[nyzero]; nyzero++);
-    do {
-	if (bds->stop) return Qnil;
-	if (zds[j] ==  yds[ny-1]) q = (BDIGIT)BIGRAD-1;
-	else q = (BDIGIT)((BIGUP(zds[j]) + zds[j-1])/yds[ny-1]);
-	if (q) {
-           i = nyzero; num = 0; t2 = 0;
-	    do {			/* multiply and subtract */
-		BDIGIT_DBL ee;
-		t2 += (BDIGIT_DBL)yds[i] * q;
-		ee = num - BIGLO(t2);
-		num = (BDIGIT_DBL)zds[j - ny + i] + ee;
-		if (ee) zds[j - ny + i] = BIGLO(num);
-		num = BIGDN(num);
-		t2 = BIGDN(t2);
-	    } while (++i < ny);
-	    num += zds[j - ny + i] - t2;/* borrow from high digit; don't update */
-	    while (num) {		/* "add back" required */
-		i = 0; num = 0; q--;
-		do {
-		    BDIGIT_DBL ee = num + yds[i];
-		    num = (BDIGIT_DBL)zds[j - ny + i] + ee;
-		    if (ee) zds[j - ny + i] = BIGLO(num);
-		    num = BIGDN(num);
-		} while (++i < ny);
-		num--;
-	    }
-	}
-	zds[j] = q;
-    } while (--j >= ny);
     return Qnil;
 }
 
 static void
-rb_big_stop(void *ptr)
-{
-    VALUE *stop = (VALUE*)ptr;
-    *stop = Qtrue;
-}
-
-static VALUE
-bigdivrem(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
-{
-    struct big_div_struct bds;
-    long nx = RBIGNUM_LEN(x), ny = RBIGNUM_LEN(y);
-    long i, j;
-    VALUE z, yy, zz;
-    BDIGIT *xds, *yds, *zds, *tds;
-    BDIGIT_DBL t2;
-    BDIGIT dd, q;
-
-    if (BIGZEROP(y)) rb_num_zerodiv();
-    xds = BDIGITS(x);
-    yds = BDIGITS(y);
-    if (nx < ny || (nx == ny && xds[nx - 1] < yds[ny - 1])) {
-	if (divp) *divp = rb_int2big(0);
-	if (modp) *modp = x;
-	return Qnil;
-    }
-    if (ny == 1) {
-	dd = yds[0];
-	z = rb_big_clone(x);
-	zds = BDIGITS(z);
-	t2 = 0; i = nx;
-	while (i--) {
-	    t2 = BIGUP(t2) + zds[i];
-	    zds[i] = (BDIGIT)(t2 / dd);
-	    t2 %= dd;
-	}
-	RBIGNUM_SET_SIGN(z, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-	if (modp) {
-	    *modp = rb_uint2big((VALUE)t2);
-	    RBIGNUM_SET_SIGN(*modp, RBIGNUM_SIGN(x));
-	}
-	if (divp) *divp = z;
-	return Qnil;
-    }
-
-    z = bignew(nx==ny?nx+2:nx+1, RBIGNUM_SIGN(x)==RBIGNUM_SIGN(y));
-    zds = BDIGITS(z);
-    if (nx==ny) zds[nx+1] = 0;
-    while (!yds[ny-1]) ny--;
-
-    dd = 0;
-    q = yds[ny-1];
-    while ((q & (BDIGIT)(1UL<<(BITSPERDIG-1))) == 0) {
-	q <<= 1UL;
-	dd++;
-    }
-    if (dd) {
-	yy = rb_big_clone(y);
-	tds = BDIGITS(yy);
-	j = 0;
-	t2 = 0;
-	while (j<ny) {
-	    t2 += (BDIGIT_DBL)yds[j]<<dd;
-	    tds[j++] = BIGLO(t2);
-	    t2 = BIGDN(t2);
-	}
-	yds = tds;
-	RB_GC_GUARD(y) = yy;
-	j = 0;
-	t2 = 0;
-	while (j<nx) {
-	    t2 += (BDIGIT_DBL)xds[j]<<dd;
-	    zds[j++] = BIGLO(t2);
-	    t2 = BIGDN(t2);
-	}
-	zds[j] = (BDIGIT)t2;
-    }
-    else {
-	zds[nx] = 0;
-	j = nx;
-	while (j--) zds[j] = xds[j];
-    }
-
-    bds.nx = nx;
-    bds.ny = ny;
-    bds.zds = zds;
-    bds.yds = yds;
-    bds.stop = Qfalse;
-    if (nx > 10000 || ny > 10000) {
-	rb_thread_blocking_region(bigdivrem1, &bds, rb_big_stop, &bds.stop);
-    }
-    else {
-	bigdivrem1(&bds);
-    }
-
-    if (divp) {			/* move quotient down in z */
-	*divp = zz = rb_big_clone(z);
-	zds = BDIGITS(zz);
-	j = (nx==ny ? nx+2 : nx+1) - ny;
-	for (i = 0;i < j;i++) zds[i] = zds[i+ny];
-	if (!zds[i-1]) i--;
-	RBIGNUM_SET_LEN(zz, i);
-    }
-    if (modp) {			/* normalize remainder */
-	*modp = zz = rb_big_clone(z);
-	zds = BDIGITS(zz);
-	while (--ny && !zds[ny]); ++ny;
-	if (dd) {
-	    t2 = 0; i = ny;
-	    while(i--) {
-		t2 = (t2 | zds[i]) >> dd;
-		q = zds[i];
-		zds[i] = BIGLO(t2);
-		t2 = BIGUP(q);
-	    }
-	}
-	if (!zds[ny-1]) ny--;
-	RBIGNUM_SET_LEN(zz, ny);
-	RBIGNUM_SET_SIGN(zz, RBIGNUM_SIGN(x));
-    }
-    return z;
-}
-
-static void
 bigdivmod(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
 {
     VALUE mod;
 
     bigdivrem(x, y, divp, &mod);
-    if (RBIGNUM_SIGN(x) != RBIGNUM_SIGN(y) && !BIGZEROP(mod)) {
-	if (divp) *divp = bigadd(*divp, rb_int2big(1), 0);
-	if (modp) *modp = bigadd(mod, y, 1);
+    if (BIGNUM_SIGN(x) != BIGNUM_SIGN(y) && !BIGZEROP(mod)) {
+        if (divp) *divp = bigadd(*divp, rb_int2big(1), 0);
+        if (modp) *modp = bigadd(mod, y, 1);
     }
     else if (modp) {
-	*modp = mod;
+        *modp = mod;
     }
 }
 
@@ -2780,970 +6078,1095 @@ rb_big_divide(VALUE x, VALUE y, ID op)
 {
     VALUE z;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      case T_FLOAT:
-	{
-	    if (op == '/') {
-		return DBL2NUM(rb_big2dbl(x) / RFLOAT_VALUE(y));
-	    }
-	    else {
-		double dy = RFLOAT_VALUE(y);
-		if (dy == 0.0) rb_num_zerodiv();
-		return rb_dbl2big(rb_big2dbl(x) / dy);
-	    }
-	}
-
-      default:
-	return rb_num_coerce_bin(x, y, op);
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        if (op == '/') {
+            double dx = rb_big2dbl(x);
+            return rb_flo_div_flo(DBL2NUM(dx), y);
+        }
+        else {
+            VALUE v;
+            double dy = RFLOAT_VALUE(y);
+            if (dy == 0.0) rb_num_zerodiv();
+            v = rb_big_divide(x, y, '/');
+            return rb_dbl2big(RFLOAT_VALUE(v));
+        }
+    }
+    else {
+        return rb_num_coerce_bin(x, y, op);
     }
     bigdivmod(x, y, &z, 0);
 
     return bignorm(z);
 }
 
-/*
- *  call-seq:
- *     big / other     -> Numeric
- *
- * Performs division: the class of the resulting object depends on
- * the class of <code>numeric</code> and on the magnitude of the
- * result.
- */
-
 VALUE
 rb_big_div(VALUE x, VALUE y)
 {
     return rb_big_divide(x, y, '/');
 }
 
-/*
- *  call-seq:
- *     big.div(other)  -> integer
- *
- * Performs integer division: returns integer value.
- */
-
 VALUE
 rb_big_idiv(VALUE x, VALUE y)
 {
-    return rb_big_divide(x, y, rb_intern("div"));
+    return rb_big_divide(x, y, idDiv);
 }
 
-/*
- *  call-seq:
- *     big % other         -> Numeric
- *     big.modulo(other)   -> Numeric
- *
- *  Returns big modulo other. See Numeric.divmod for more
- *  information.
- */
-
 VALUE
 rb_big_modulo(VALUE x, VALUE y)
 {
     VALUE z;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, '%');
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (!RB_BIGNUM_TYPE_P(y)) {
+        return rb_num_coerce_bin(x, y, '%');
     }
     bigdivmod(x, y, 0, &z);
 
     return bignorm(z);
 }
 
-/*
- *  call-seq:
- *     big.remainder(numeric)    -> number
- *
- *  Returns the remainder after dividing <i>big</i> by <i>numeric</i>.
- *
- *     -1234567890987654321.remainder(13731)      #=> -6966
- *     -1234567890987654321.remainder(13731.24)   #=> -9906.22531493148
- */
-static VALUE
+VALUE
 rb_big_remainder(VALUE x, VALUE y)
 {
     VALUE z;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("remainder"));
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (!RB_BIGNUM_TYPE_P(y)) {
+        return rb_num_coerce_bin(x, y, rb_intern("remainder"));
     }
     bigdivrem(x, y, 0, &z);
 
     return bignorm(z);
 }
 
-/*
- *  call-seq:
- *     big.divmod(numeric)   -> array
- *
- *  See <code>Numeric#divmod</code>.
- *
- */
 VALUE
 rb_big_divmod(VALUE x, VALUE y)
 {
     VALUE div, mod;
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-
-      case T_BIGNUM:
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("divmod"));
+    if (FIXNUM_P(y)) {
+        y = rb_int2big(FIX2LONG(y));
+    }
+    else if (!RB_BIGNUM_TYPE_P(y)) {
+        return rb_num_coerce_bin(x, y, idDivmod);
     }
     bigdivmod(x, y, &div, &mod);
 
     return rb_assoc_new(bignorm(div), bignorm(mod));
 }
 
-static int
-bdigbitsize(BDIGIT x)
-{
-    int size = 1;
-    int nb = BITSPERDIG / 2;
-    BDIGIT bits = (~0 << nb);
-
-    if (!x) return 0;
-    while (x > 1) {
-	if (x & bits) {
-	    size += nb;
-	    x >>= nb;
-	}
-	x &= ~bits;
-	nb /= 2;
-	bits >>= nb;
-    }
-
-    return size;
-}
-
-static VALUE big_lshift(VALUE, unsigned long);
-static VALUE big_rshift(VALUE, unsigned long);
-
 static VALUE
 big_shift(VALUE x, long n)
 {
     if (n < 0)
-	return big_lshift(x, (unsigned long)-n);
+        return big_lshift(x, 1+(unsigned long)(-(n+1)));
     else if (n > 0)
-	return big_rshift(x, (unsigned long)n);
+        return big_rshift(x, (unsigned long)n);
     return x;
 }
 
-static VALUE
-big_fdiv(VALUE x, VALUE y)
+enum {DBL_BIGDIG = ((DBL_MANT_DIG + BITSPERDIG) / BITSPERDIG)};
+
+static double
+big_fdiv(VALUE x, VALUE y, long ey)
 {
-#define DBL_BIGDIG ((DBL_MANT_DIG + BITSPERDIG) / BITSPERDIG)
     VALUE z;
-    long l, ex, ey;
-    int i;
+    long l, ex;
 
     bigtrunc(x);
-    l = RBIGNUM_LEN(x) - 1;
-    ex = l * BITSPERDIG;
-    ex += bdigbitsize(BDIGITS(x)[l]);
+    l = BIGNUM_LEN(x);
+    ex = l * BITSPERDIG - nlz(BDIGITS(x)[l-1]);
     ex -= 2 * DBL_BIGDIG * BITSPERDIG;
+    if (ex > BITSPERDIG) ex -= BITSPERDIG;
+    else if (ex > 0) ex = 0;
     if (ex) x = big_shift(x, ex);
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-      case T_BIGNUM: {
-	bigtrunc(y);
-	l = RBIGNUM_LEN(y) - 1;
-	ey = l * BITSPERDIG;
-	ey += bdigbitsize(BDIGITS(y)[l]);
-	ey -= DBL_BIGDIG * BITSPERDIG;
-	if (ey) y = big_shift(y, ey);
-      bignum:
-	bigdivrem(x, y, &z, 0);
-	l = ex - ey;
+    bigdivrem(x, y, &z, 0);
+    l = ex - ey;
 #if SIZEOF_LONG > SIZEOF_INT
-	{
-	    /* Visual C++ can't be here */
-	    if (l > INT_MAX) return DBL2NUM(INFINITY);
-	    if (l < INT_MIN) return DBL2NUM(0.0);
-	}
-#endif
-	return DBL2NUM(ldexp(big2dbl(z), (int)l));
-      }
-      case T_FLOAT:
-	y = dbl2big(ldexp(frexp(RFLOAT_VALUE(y), &i), DBL_MANT_DIG));
-	ey = i - DBL_MANT_DIG;
-	goto bignum;
+    {
+        /* Visual C++ can't be here */
+        if (l > INT_MAX) return HUGE_VAL;
+        if (l < INT_MIN) return 0.0;
     }
-    rb_bug("big_fdiv");
-    /* NOTREACHED */
+#endif
+    return ldexp(big2dbl(z), (int)l);
 }
 
-/*
- *  call-seq:
-  *     big.fdiv(numeric) -> float
- *
- *  Returns the floating point result of dividing <i>big</i> by
- *  <i>numeric</i>.
- *
- *     -1234567890987654321.fdiv(13731)      #=> -89910996357705.5
- *     -1234567890987654321.fdiv(13731.24)   #=> -89909424858035.7
- *
- */
+static double
+big_fdiv_int(VALUE x, VALUE y)
+{
+    long l, ey;
+    bigtrunc(y);
+    l = BIGNUM_LEN(y);
+    ey = l * BITSPERDIG - nlz(BDIGITS(y)[l-1]);
+    ey -= DBL_BIGDIG * BITSPERDIG;
+    if (ey) y = big_shift(y, ey);
+    return big_fdiv(x, y, ey);
+}
 
+static double
+big_fdiv_float(VALUE x, VALUE y)
+{
+    int i;
+    y = dbl2big(ldexp(frexp(RFLOAT_VALUE(y), &i), DBL_MANT_DIG));
+    return big_fdiv(x, y, i - DBL_MANT_DIG);
+}
 
-VALUE
-rb_big_fdiv(VALUE x, VALUE y)
+double
+rb_big_fdiv_double(VALUE x, VALUE y)
 {
     double dx, dy;
+    VALUE v;
 
     dx = big2dbl(x);
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	dy = (double)FIX2LONG(y);
-	if (isinf(dx))
-	    return big_fdiv(x, y);
-	break;
-
-      case T_BIGNUM:
-	dy = rb_big2dbl(y);
-	if (isinf(dx) || isinf(dy))
-	    return big_fdiv(x, y);
-	break;
-
-      case T_FLOAT:
-	dy = RFLOAT_VALUE(y);
-	if (isnan(dy))
-	    return y;
-	if (isinf(dx))
-	    return big_fdiv(x, y);
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("fdiv"));
+    if (FIXNUM_P(y)) {
+        dy = (double)FIX2LONG(y);
+        if (isinf(dx))
+            return big_fdiv_int(x, rb_int2big(FIX2LONG(y)));
+    }
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        return big_fdiv_int(x, y);
+    }
+    else if (RB_FLOAT_TYPE_P(y)) {
+        dy = RFLOAT_VALUE(y);
+        if (isnan(dy))
+            return dy;
+        if (isinf(dx))
+            return big_fdiv_float(x, y);
     }
-    return DBL2NUM(dx / dy);
+    else {
+        return NUM2DBL(rb_num_coerce_bin(x, y, idFdiv));
+    }
+    v = rb_flo_div_flo(DBL2NUM(dx), DBL2NUM(dy));
+    return NUM2DBL(v);
 }
 
-static VALUE
-bigsqr(VALUE x)
+VALUE
+rb_big_fdiv(VALUE x, VALUE y)
 {
-    return bigtrunc(bigmul0(x, x));
+    return DBL2NUM(rb_big_fdiv_double(x, y));
 }
 
-/*
- *  call-seq:
- *     big ** exponent   -> numeric
- *
- *  Raises _big_ to the _exponent_ power (which may be an integer, float,
- *  or anything that will coerce to a number). The result may be
- *  a Fixnum, Bignum, or Float
- *
- *    123456789 ** 2      #=> 15241578750190521
- *    123456789 ** 1.2    #=> 5126464716.09932
- *    123456789 ** -2     #=> 6.5610001194102e-17
- */
-
 VALUE
 rb_big_pow(VALUE x, VALUE y)
 {
     double d;
     SIGNED_VALUE yy;
 
+  again:
     if (y == INT2FIX(0)) return INT2FIX(1);
-    switch (TYPE(y)) {
-      case T_FLOAT:
-	d = RFLOAT_VALUE(y);
-	if ((!RBIGNUM_SIGN(x) && !BIGZEROP(x)) && d != round(d))
-	    return rb_funcall(rb_complex_raw1(x), rb_intern("**"), 1, y);
-	break;
-
-      case T_BIGNUM:
-	rb_warn("in a**b, b may be too big");
-	d = rb_big2dbl(y);
-	break;
-
-      case T_FIXNUM:
-	yy = FIX2LONG(y);
-
-	if (yy < 0)
-	    return rb_funcall(rb_rational_raw1(x), rb_intern("**"), 1, y);
-	else {
-	    VALUE z = 0;
-	    SIGNED_VALUE mask;
-	    const long xlen = RBIGNUM_LEN(x) - 1;
-	    const long xbits = ffs(RBIGNUM_DIGITS(x)[xlen]) + SIZEOF_BDIGITS*BITSPERDIG*xlen;
-	    const long BIGLEN_LIMIT = BITSPERDIG*1024*1024;
-
-	    if ((xbits > BIGLEN_LIMIT) || (xbits * yy > BIGLEN_LIMIT)) {
-		rb_warn("in a**b, b may be too big");
-		d = (double)yy;
-		break;
-	    }
-	    for (mask = FIXNUM_MAX + 1; mask; mask >>= 1) {
-		if (z) z = bigsqr(z);
-		if (yy & mask) {
-		    z = z ? bigtrunc(bigmul0(z, x)) : x;
-		}
-	    }
-	    return bignorm(z);
-	}
-	/* NOTREACHED */
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y, rb_intern("**"));
+    if (y == INT2FIX(1)) return x;
+    if (RB_FLOAT_TYPE_P(y)) {
+        d = RFLOAT_VALUE(y);
+        if ((BIGNUM_NEGATIVE_P(x) && !BIGZEROP(x))) {
+            return rb_dbl_complex_new_polar_pi(pow(-rb_big2dbl(x), d), d);
+        }
     }
-    return DBL2NUM(pow(rb_big2dbl(x), d));
-}
-
-static inline VALUE
-bit_coerce(VALUE x)
-{
-    while (!FIXNUM_P(x) && !RB_TYPE_P(x, T_BIGNUM)) {
-	rb_raise(rb_eTypeError,
-		 "can't convert %s into Integer for bitwise arithmetic",
-		 rb_obj_classname(x));
-	x = rb_to_int(x);
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        y = bignorm(y);
+        if (FIXNUM_P(y))
+            goto again;
+        rb_warn("in a**b, b may be too big");
+        d = rb_big2dbl(y);
+    }
+    else if (FIXNUM_P(y)) {
+        yy = FIX2LONG(y);
+
+        if (yy < 0) {
+            x = rb_big_pow(x, LONG2NUM(-yy));
+            if (RB_INTEGER_TYPE_P(x))
+                return rb_rational_raw(INT2FIX(1), x);
+            else
+                return DBL2NUM(1.0 / NUM2DBL(x));
+        }
+        else {
+            VALUE z = 0;
+            SIGNED_VALUE mask;
+            const size_t xbits = rb_absint_numwords(x, 1, NULL);
+            const size_t BIGLEN_LIMIT = 32*1024*1024;
+
+            if (xbits == (size_t)-1 ||
+                (xbits > BIGLEN_LIMIT) ||
+                (xbits * yy > BIGLEN_LIMIT)) {
+                rb_warn("in a**b, b may be too big");
+                d = (double)yy;
+            }
+            else {
+                for (mask = FIXNUM_MAX + 1; mask; mask >>= 1) {
+                    if (z) z = bigsq(z);
+                    if (yy & mask) {
+                        z = z ? bigtrunc(bigmul0(z, x)) : x;
+                    }
+                }
+                return bignorm(z);
+            }
+        }
     }
-    return x;
+    else {
+        return rb_num_coerce_bin(x, y, idPow);
+    }
+    return DBL2NUM(pow(rb_big2dbl(x), d));
 }
 
 static VALUE
-bigand_int(VALUE x, long y)
+bigand_int(VALUE x, long xn, BDIGIT hibitsx, long y)
 {
     VALUE z;
     BDIGIT *xds, *zds;
-    long xn, zn;
+    long zn;
     long i;
-    char sign;
+    BDIGIT hibitsy;
 
     if (y == 0) return INT2FIX(0);
-    sign = (y > 0);
+    if (xn == 0) return hibitsx ? LONG2NUM(y) : 0;
+    hibitsy = 0 <= y ? 0 : BDIGMAX;
     xds = BDIGITS(x);
-    zn = xn = RBIGNUM_LEN(x);
-#if SIZEOF_BDIGITS == SIZEOF_LONG
-    if (sign) {
-	y &= xds[0];
-	return LONG2NUM(y);
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+    if (!hibitsy) {
+        y &= xds[0];
+        return LONG2NUM(y);
     }
 #endif
 
-    z = bignew(zn, RBIGNUM_SIGN(x) || sign);
+    zn = xn;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (hibitsx && zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+
+    z = bignew(zn, 0);
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS == SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     i = 1;
-    zds[0] = xds[0] & y;
+    zds[0] = xds[0] & BIGLO(y);
 #else
-    {
-	BDIGIT_DBL num = y;
-
-	for (i=0; i<(int)(sizeof(y)/sizeof(BDIGIT)); i++) {
-	    zds[i] = xds[i] & BIGLO(num);
-	    num = BIGDN(num);
-	}
+    for (i=0; i < xn; i++) {
+        if (y == 0 || y == -1) break;
+        zds[i] = xds[i] & BIGLO(y);
+        y = BIGDN(y);
+    }
+    for (; i < zn; i++) {
+        if (y == 0 || y == -1) break;
+        zds[i] = hibitsx & BIGLO(y);
+        y = BIGDN(y);
     }
 #endif
-    while (i < xn) {
-	zds[i] = sign?0:xds[i];
-	i++;
+    for (;i < xn; i++) {
+        zds[i] = xds[i] & hibitsy;
+    }
+    for (;i < zn; i++) {
+        zds[i] = hibitsx & hibitsy;
     }
-    if (!RBIGNUM_SIGN(z)) get2comp(z);
+    twocomp2abs_bang(z, hibitsx && hibitsy);
+    RB_GC_GUARD(x);
     return bignorm(z);
 }
 
-/*
- * call-seq:
- *     big & numeric   ->  integer
- *
- * Performs bitwise +and+ between _big_ and _numeric_.
- */
-
 VALUE
-rb_big_and(VALUE xx, VALUE yy)
+rb_big_and(VALUE x, VALUE y)
 {
-    volatile VALUE x, y, z;
+    VALUE z;
     BDIGIT *ds1, *ds2, *zds;
-    long i, l1, l2;
-    char sign;
+    long i, xn, yn, n1, n2;
+    BDIGIT hibitsx, hibitsy;
+    BDIGIT hibits1, hibits2;
+    VALUE tmpv;
+    BDIGIT tmph;
+    long tmpn;
 
-    x = xx;
-    y = bit_coerce(yy);
-    if (!RBIGNUM_SIGN(x)) {
-	x = rb_big_clone(x);
-	get2comp(x);
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '&');
     }
+
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	return bigand_int(x, FIX2LONG(y));
-    }
-    if (!RBIGNUM_SIGN(y)) {
-	y = rb_big_clone(y);
-	get2comp(y);
-    }
-    if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
-	l1 = RBIGNUM_LEN(y);
-	l2 = RBIGNUM_LEN(x);
-	ds1 = BDIGITS(y);
-	ds2 = BDIGITS(x);
-	sign = RBIGNUM_SIGN(y);
+        return bigand_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    else {
-	l1 = RBIGNUM_LEN(x);
-	l2 = RBIGNUM_LEN(y);
-	ds1 = BDIGITS(x);
-	ds2 = BDIGITS(y);
-	sign = RBIGNUM_SIGN(x);
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
+        tmpv = x; x = y; y = tmpv;
+        tmpn = xn; xn = yn; yn = tmpn;
+        tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
     }
-    z = bignew(l2, RBIGNUM_SIGN(x) || RBIGNUM_SIGN(y));
+    n1 = xn;
+    n2 = yn;
+    ds1 = BDIGITS(x);
+    ds2 = BDIGITS(y);
+    hibits1 = hibitsx;
+    hibits2 = hibitsy;
+
+    if (!hibits1)
+        n2 = n1;
+
+    z = bignew(n2, 0);
     zds = BDIGITS(z);
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] & ds2[i];
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] & ds2[i];
     }
-    for (; i<l2; i++) {
-	zds[i] = sign?0:ds2[i];
+    for (; i<n2; i++) {
+        zds[i] = hibits1 & ds2[i];
     }
-    if (!RBIGNUM_SIGN(z)) get2comp(z);
+    twocomp2abs_bang(z, hibits1 && hibits2);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
     return bignorm(z);
 }
 
 static VALUE
-bigor_int(VALUE x, long y)
+bigor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
 {
     VALUE z;
     BDIGIT *xds, *zds;
-    long xn, zn;
+    long zn;
     long i;
-    char sign;
+    BDIGIT hibitsy;
 
-    sign = (y >= 0);
+    if (y == -1) return INT2FIX(-1);
+    if (xn == 0) return hibitsx ? INT2FIX(-1) : LONG2FIX(y);
+    hibitsy = 0 <= y ? 0 : BDIGMAX;
     xds = BDIGITS(x);
-    zn = xn = RBIGNUM_LEN(x);
-    z = bignew(zn, RBIGNUM_SIGN(x) && sign);
+
+    zn = BIGNUM_LEN(x);
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+    z = bignew(zn, 0);
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS == SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     i = 1;
-    zds[0] = xds[0] | y;
+    zds[0] = xds[0] | BIGLO(y);
+    if (i < zn)
+        goto y_is_fixed_point;
+    goto finish;
 #else
-    {
-	BDIGIT_DBL num = y;
+    for (i=0; i < xn; i++) {
+        if (y == 0 || y == -1) goto y_is_fixed_point;
+        zds[i] = xds[i] | BIGLO(y);
+        y = BIGDN(y);
+    }
+    if (hibitsx)
+        goto fill_hibits;
+    for (; i < zn; i++) {
+        if (y == 0 || y == -1) goto y_is_fixed_point;
+        zds[i] = BIGLO(y);
+        y = BIGDN(y);
+    }
+  goto finish;
+#endif
 
-	for (i=0; i<(int)(sizeof(y)/sizeof(BDIGIT)); i++) {
-	    zds[i] = xds[i] | BIGLO(num);
-	    num = BIGDN(num);
-	}
+  y_is_fixed_point:
+    if (hibitsy)
+        goto fill_hibits;
+    for (; i < xn; i++) {
+        zds[i] = xds[i];
     }
-#endif
-    while (i < xn) {
-	zds[i] = sign?xds[i]:(BDIGIT)(BIGRAD-1);
-	i++;
+    if (hibitsx)
+        goto fill_hibits;
+    for (; i < zn; i++) {
+        zds[i] = 0;
     }
-    if (!RBIGNUM_SIGN(z)) get2comp(z);
+  goto finish;
+
+  fill_hibits:
+    for (; i < zn; i++) {
+        zds[i] = BDIGMAX;
+    }
+
+  finish:
+    twocomp2abs_bang(z, hibitsx || hibitsy);
+    RB_GC_GUARD(x);
     return bignorm(z);
 }
 
-/*
- * call-seq:
- *     big | numeric   ->  integer
- *
- * Performs bitwise +or+ between _big_ and _numeric_.
- */
-
 VALUE
-rb_big_or(VALUE xx, VALUE yy)
+rb_big_or(VALUE x, VALUE y)
 {
-    volatile VALUE x, y, z;
+    VALUE z;
     BDIGIT *ds1, *ds2, *zds;
-    long i, l1, l2;
-    char sign;
+    long i, xn, yn, n1, n2;
+    BDIGIT hibitsx, hibitsy;
+    BDIGIT hibits1, hibits2;
+    VALUE tmpv;
+    BDIGIT tmph;
+    long tmpn;
 
-    x = xx;
-    y = bit_coerce(yy);
-
-    if (!RBIGNUM_SIGN(x)) {
-	x = rb_big_clone(x);
-	get2comp(x);
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '|');
     }
+
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	return bigor_int(x, FIX2LONG(y));
-    }
-    if (!RBIGNUM_SIGN(y)) {
-	y = rb_big_clone(y);
-	get2comp(y);
+        return bigor_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
-	l1 = RBIGNUM_LEN(y);
-	l2 = RBIGNUM_LEN(x);
-	ds1 = BDIGITS(y);
-	ds2 = BDIGITS(x);
-	sign = RBIGNUM_SIGN(y);
-    }
-    else {
-	l1 = RBIGNUM_LEN(x);
-	l2 = RBIGNUM_LEN(y);
-	ds1 = BDIGITS(x);
-	ds2 = BDIGITS(y);
-	sign = RBIGNUM_SIGN(x);
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
+        tmpv = x; x = y; y = tmpv;
+        tmpn = xn; xn = yn; yn = tmpn;
+        tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
     }
-    z = bignew(l2, RBIGNUM_SIGN(x) && RBIGNUM_SIGN(y));
+    n1 = xn;
+    n2 = yn;
+    ds1 = BDIGITS(x);
+    ds2 = BDIGITS(y);
+    hibits1 = hibitsx;
+    hibits2 = hibitsy;
+
+    if (hibits1)
+        n2 = n1;
+
+    z = bignew(n2, 0);
     zds = BDIGITS(z);
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] | ds2[i];
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] | ds2[i];
     }
-    for (; i<l2; i++) {
-	zds[i] = sign?ds2[i]:(BDIGIT)(BIGRAD-1);
+    for (; i<n2; i++) {
+        zds[i] = hibits1 | ds2[i];
     }
-    if (!RBIGNUM_SIGN(z)) get2comp(z);
+    twocomp2abs_bang(z, hibits1 || hibits2);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
     return bignorm(z);
 }
 
 static VALUE
-bigxor_int(VALUE x, long y)
+bigxor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
 {
     VALUE z;
     BDIGIT *xds, *zds;
-    long xn, zn;
+    long zn;
     long i;
-    char sign;
+    BDIGIT hibitsy;
 
-    sign = (y >= 0) ? 1 : 0;
+    hibitsy = 0 <= y ? 0 : BDIGMAX;
     xds = BDIGITS(x);
-    zn = xn = RBIGNUM_LEN(x);
-    z = bignew(zn, !(RBIGNUM_SIGN(x) ^ sign));
+    zn = BIGNUM_LEN(x);
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+    z = bignew(zn, 0);
     zds = BDIGITS(z);
 
-#if SIZEOF_BDIGITS == SIZEOF_LONG
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
     i = 1;
-    zds[0] = xds[0] ^ y;
+    zds[0] = xds[0] ^ BIGLO(y);
 #else
-    {
-	BDIGIT_DBL num = y;
-
-	for (i=0; i<(int)(sizeof(y)/sizeof(BDIGIT)); i++) {
-	    zds[i] = xds[i] ^ BIGLO(num);
-	    num = BIGDN(num);
-	}
+    for (i = 0; i < xn; i++) {
+        zds[i] = xds[i] ^ BIGLO(y);
+        y = BIGDN(y);
+    }
+    for (; i < zn; i++) {
+        zds[i] = hibitsx ^ BIGLO(y);
+        y = BIGDN(y);
     }
 #endif
-    while (i < xn) {
-	zds[i] = sign?xds[i]:~xds[i];
-	i++;
+    for (; i < xn; i++) {
+        zds[i] = xds[i] ^ hibitsy;
+    }
+    for (; i < zn; i++) {
+        zds[i] = hibitsx ^ hibitsy;
     }
-    if (!RBIGNUM_SIGN(z)) get2comp(z);
+    twocomp2abs_bang(z, (hibitsx ^ hibitsy) != 0);
+    RB_GC_GUARD(x);
     return bignorm(z);
 }
-/*
- * call-seq:
- *     big ^ numeric   ->  integer
- *
- * Performs bitwise +exclusive or+ between _big_ and _numeric_.
- */
 
 VALUE
-rb_big_xor(VALUE xx, VALUE yy)
+rb_big_xor(VALUE x, VALUE y)
 {
-    volatile VALUE x, y;
     VALUE z;
     BDIGIT *ds1, *ds2, *zds;
-    long i, l1, l2;
-    char sign;
+    long i, xn, yn, n1, n2;
+    BDIGIT hibitsx, hibitsy;
+    BDIGIT hibits1, hibits2;
+    VALUE tmpv;
+    BDIGIT tmph;
+    long tmpn;
 
-    x = xx;
-    y = bit_coerce(yy);
-
-    if (!RBIGNUM_SIGN(x)) {
-	x = rb_big_clone(x);
-	get2comp(x);
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '^');
     }
+
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	return bigxor_int(x, FIX2LONG(y));
-    }
-    if (!RBIGNUM_SIGN(y)) {
-	y = rb_big_clone(y);
-	get2comp(y);
+        return bigxor_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    if (RBIGNUM_LEN(x) > RBIGNUM_LEN(y)) {
-	l1 = RBIGNUM_LEN(y);
-	l2 = RBIGNUM_LEN(x);
-	ds1 = BDIGITS(y);
-	ds2 = BDIGITS(x);
-	sign = RBIGNUM_SIGN(y);
-    }
-    else {
-	l1 = RBIGNUM_LEN(x);
-	l2 = RBIGNUM_LEN(y);
-	ds1 = BDIGITS(x);
-	ds2 = BDIGITS(y);
-	sign = RBIGNUM_SIGN(x);
-    }
-    RBIGNUM_SET_SIGN(x, RBIGNUM_SIGN(x)?1:0);
-    RBIGNUM_SET_SIGN(y, RBIGNUM_SIGN(y)?1:0);
-    z = bignew(l2, !(RBIGNUM_SIGN(x) ^ RBIGNUM_SIGN(y)));
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
+        tmpv = x; x = y; y = tmpv;
+        tmpn = xn; xn = yn; yn = tmpn;
+        tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
+    }
+    n1 = xn;
+    n2 = yn;
+    ds1 = BDIGITS(x);
+    ds2 = BDIGITS(y);
+    hibits1 = hibitsx;
+    hibits2 = hibitsy;
+
+    z = bignew(n2, 0);
     zds = BDIGITS(z);
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] ^ ds2[i];
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] ^ ds2[i];
     }
-    for (; i<l2; i++) {
-	zds[i] = sign?ds2[i]:~ds2[i];
+    for (; i<n2; i++) {
+        zds[i] = hibitsx ^ ds2[i];
     }
-    if (!RBIGNUM_SIGN(z)) get2comp(z);
-
+    twocomp2abs_bang(z, (hibits1 ^ hibits2) != 0);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
     return bignorm(z);
 }
 
-static VALUE
-check_shiftdown(VALUE y, VALUE x)
+VALUE
+rb_big_lshift(VALUE x, VALUE y)
 {
-    if (!RBIGNUM_LEN(x)) return INT2FIX(0);
-    if (RBIGNUM_LEN(y) > SIZEOF_LONG / SIZEOF_BDIGITS) {
-	return RBIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(-1);
+    int lshift_p;
+    size_t shift_numdigits;
+    int shift_numbits;
+
+    for (;;) {
+        if (FIXNUM_P(y)) {
+            long l = FIX2LONG(y);
+            unsigned long shift;
+            if (0 <= l) {
+                lshift_p = 1;
+                shift = l;
+            }
+            else {
+                lshift_p = 0;
+                shift = 1+(unsigned long)(-(l+1));
+            }
+            shift_numbits = (int)(shift & (BITSPERDIG-1));
+            shift_numdigits = shift >> bit_length(BITSPERDIG-1);
+            return bignorm(big_shift3(x, lshift_p, shift_numdigits, shift_numbits));
+        }
+        else if (RB_BIGNUM_TYPE_P(y)) {
+            return bignorm(big_shift2(x, 1, y));
+        }
+        y = rb_to_int(y);
     }
-    return Qnil;
 }
 
-/*
- * call-seq:
- *     big << numeric   ->  integer
- *
- * Shifts big left _numeric_ positions (right if _numeric_ is negative).
- */
-
 VALUE
-rb_big_lshift(VALUE x, VALUE y)
+rb_big_rshift(VALUE x, VALUE y)
 {
-    long shift;
-    int neg = 0;
+    int lshift_p;
+    size_t shift_numdigits;
+    int shift_numbits;
 
     for (;;) {
-	if (FIXNUM_P(y)) {
-	    shift = FIX2LONG(y);
-	    if (shift < 0) {
-		neg = 1;
-		shift = -shift;
-	    }
-	    break;
-	}
-	else if (RB_TYPE_P(y, T_BIGNUM)) {
-	    if (!RBIGNUM_SIGN(y)) {
-		VALUE t = check_shiftdown(y, x);
-		if (!NIL_P(t)) return t;
-		neg = 1;
-	    }
-	    shift = big2ulong(y, "long", TRUE);
-	    break;
-	}
-	y = rb_to_int(y);
-    }
-
-    x = neg ? big_rshift(x, shift) : big_lshift(x, shift);
-    return bignorm(x);
+        if (FIXNUM_P(y)) {
+            long l = FIX2LONG(y);
+            unsigned long shift;
+            if (0 <= l) {
+                lshift_p = 0;
+                shift = l;
+            }
+            else {
+                lshift_p = 1;
+                shift = 1+(unsigned long)(-(l+1));
+            }
+            shift_numbits = (int)(shift & (BITSPERDIG-1));
+            shift_numdigits = shift >> bit_length(BITSPERDIG-1);
+            return bignorm(big_shift3(x, lshift_p, shift_numdigits, shift_numbits));
+        }
+        else if (RB_BIGNUM_TYPE_P(y)) {
+            return bignorm(big_shift2(x, 0, y));
+        }
+        y = rb_to_int(y);
+    }
 }
 
-static VALUE
-big_lshift(VALUE x, unsigned long shift)
+VALUE
+rb_big_aref(VALUE x, VALUE y)
 {
-    BDIGIT *xds, *zds;
-    long s1 = shift/BITSPERDIG;
-    int s2 = (int)(shift%BITSPERDIG);
-    VALUE z;
-    BDIGIT_DBL num = 0;
-    long len, i;
-
-    len = RBIGNUM_LEN(x);
-    z = bignew(len+s1+1, RBIGNUM_SIGN(x));
-    zds = BDIGITS(z);
-    for (i=0; i<s1; i++) {
-	*zds++ = 0;
+    BDIGIT *xds;
+    size_t shift;
+    size_t i, s1, s2;
+    long l;
+    BDIGIT bit;
+
+    if (RB_BIGNUM_TYPE_P(y)) {
+        if (BIGNUM_NEGATIVE_P(y))
+            return INT2FIX(0);
+        bigtrunc(y);
+        if (BIGSIZE(y) > sizeof(size_t)) {
+            return BIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1);
+        }
+#if SIZEOF_SIZE_T <= SIZEOF_LONG
+        shift = big2ulong(y, "long");
+#else
+        shift = big2ull(y, "long long");
+#endif
     }
-    xds = BDIGITS(x);
-    for (i=0; i<len; i++) {
-	num = num | (BDIGIT_DBL)*xds++<<s2;
-	*zds++ = BIGLO(num);
-	num = BIGDN(num);
+    else {
+        l = NUM2LONG(y);
+        if (l < 0) return INT2FIX(0);
+        shift = (size_t)l;
     }
-    *zds = BIGLO(num);
-    return z;
+    s1 = shift/BITSPERDIG;
+    s2 = shift%BITSPERDIG;
+    bit = (BDIGIT)1 << s2;
+
+    if (s1 >= BIGNUM_LEN(x))
+        return BIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1);
+
+    xds = BDIGITS(x);
+    if (BIGNUM_POSITIVE_P(x))
+        return (xds[s1] & bit) ? INT2FIX(1) : INT2FIX(0);
+    if (xds[s1] & (bit-1))
+        return (xds[s1] & bit) ? INT2FIX(0) : INT2FIX(1);
+    for (i = 0; i < s1; i++)
+        if (xds[i])
+            return (xds[s1] & bit) ? INT2FIX(0) : INT2FIX(1);
+    return (xds[s1] & bit) ? INT2FIX(1) : INT2FIX(0);
+}
+
+VALUE
+rb_big_hash(VALUE x)
+{
+    st_index_t hash;
+
+    hash = rb_memhash(BDIGITS(x), sizeof(BDIGIT)*BIGNUM_LEN(x)) ^ BIGNUM_SIGN(x);
+    return ST2FIX(hash);
 }
 
 /*
  * call-seq:
- *     big >> numeric   ->  integer
+ *   int.coerce(numeric)  ->  array
  *
- * Shifts big right _numeric_ positions (left if _numeric_ is negative).
+ * Returns an array with both a +numeric+ and a +int+ represented as
+ * Integer objects or Float objects.
+ *
+ * This is achieved by converting +numeric+ to an Integer or a Float.
+ *
+ * A TypeError is raised if the +numeric+ is not an Integer or a Float
+ * type.
+ *
+ *     (0x3FFFFFFFFFFFFFFF+1).coerce(42)   #=> [42, 4611686018427387904]
  */
 
+static VALUE
+rb_int_coerce(VALUE x, VALUE y)
+{
+    if (RB_INTEGER_TYPE_P(y)) {
+        return rb_assoc_new(y, x);
+    }
+    else {
+        x = rb_Float(x);
+        y = rb_Float(y);
+        return rb_assoc_new(y, x);
+    }
+}
+
 VALUE
-rb_big_rshift(VALUE x, VALUE y)
+rb_big_abs(VALUE x)
 {
-    long shift;
-    int neg = 0;
+    if (BIGNUM_NEGATIVE_P(x)) {
+        x = rb_big_clone(x);
+        BIGNUM_SET_POSITIVE_SIGN(x);
+    }
+    return x;
+}
 
-    for (;;) {
-	if (FIXNUM_P(y)) {
-	    shift = FIX2LONG(y);
-	    if (shift < 0) {
-		neg = 1;
-		shift = -shift;
-	    }
-	    break;
-	}
-	else if (RB_TYPE_P(y, T_BIGNUM)) {
-	    if (RBIGNUM_SIGN(y)) {
-		VALUE t = check_shiftdown(y, x);
-		if (!NIL_P(t)) return t;
-	    }
-	    else {
-		neg = 1;
-	    }
-	    shift = big2ulong(y, "long", TRUE);
-	    break;
-	}
-	y = rb_to_int(y);
-    }
-
-    x = neg ? big_lshift(x, shift) : big_rshift(x, shift);
-    return bignorm(x);
+int
+rb_big_sign(VALUE x)
+{
+    return BIGNUM_SIGN(x);
 }
 
-static VALUE
-big_rshift(VALUE x, unsigned long shift)
+size_t
+rb_big_size(VALUE big)
 {
-    BDIGIT *xds, *zds;
-    long s1 = shift/BITSPERDIG;
-    int s2 = (int)(shift%BITSPERDIG);
-    VALUE z;
-    BDIGIT_DBL num = 0;
-    long i, j;
-    volatile VALUE save_x;
+    return BIGSIZE(big);
+}
 
-    if (s1 > RBIGNUM_LEN(x)) {
-	if (RBIGNUM_SIGN(x))
-	    return INT2FIX(0);
-	else
-	    return INT2FIX(-1);
-    }
-    if (!RBIGNUM_SIGN(x)) {
-	x = rb_big_clone(x);
-	get2comp(x);
-    }
-    save_x = x;
-    xds = BDIGITS(x);
-    i = RBIGNUM_LEN(x); j = i - s1;
-    if (j == 0) {
-	if (RBIGNUM_SIGN(x)) return INT2FIX(0);
-	else return INT2FIX(-1);
-    }
-    z = bignew(j, RBIGNUM_SIGN(x));
-    if (!RBIGNUM_SIGN(x)) {
-	num = ((BDIGIT_DBL)~0) << BITSPERDIG;
+VALUE
+rb_big_size_m(VALUE big)
+{
+    return SIZET2NUM(rb_big_size(big));
+}
+
+VALUE
+rb_big_bit_length(VALUE big)
+{
+    int nlz_bits;
+    size_t numbytes;
+
+    static const BDIGIT char_bit[1] = { CHAR_BIT };
+    BDIGIT numbytes_bary[bdigit_roomof(sizeof(size_t))];
+    BDIGIT nlz_bary[1];
+    BDIGIT result_bary[bdigit_roomof(sizeof(size_t)+1)];
+
+    numbytes = rb_absint_size(big, &nlz_bits);
+
+    if (numbytes == 0)
+        return LONG2FIX(0);
+
+    if (BIGNUM_NEGATIVE_P(big) && rb_absint_singlebit_p(big)) {
+        if (nlz_bits != CHAR_BIT-1) {
+            nlz_bits++;
+        }
+        else {
+            nlz_bits = 0;
+            numbytes--;
+        }
     }
-    zds = BDIGITS(z);
-    while (i--, j--) {
-	num = (num | xds[i]) >> s2;
-	zds[j] = BIGLO(num);
-	num = BIGUP(xds[i]);
+
+    if (numbytes <= SIZE_MAX / CHAR_BIT) {
+        return SIZET2NUM(numbytes * CHAR_BIT - nlz_bits);
     }
-    if (!RBIGNUM_SIGN(x)) {
-	get2comp(z);
+
+    nlz_bary[0] = nlz_bits;
+
+    bary_unpack(BARY_ARGS(numbytes_bary), &numbytes, 1, sizeof(numbytes), 0,
+            INTEGER_PACK_NATIVE_BYTE_ORDER);
+    BARY_SHORT_MUL(result_bary, numbytes_bary, char_bit);
+    BARY_SUB(result_bary, result_bary, nlz_bary);
+
+    return rb_integer_unpack(result_bary, numberof(result_bary), sizeof(BDIGIT), 0,
+            INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER);
+}
+
+VALUE
+rb_big_odd_p(VALUE num)
+{
+    return RBOOL(BIGNUM_LEN(num) != 0 && BDIGITS(num)[0] & 1);
+}
+
+VALUE
+rb_big_even_p(VALUE num)
+{
+    if (BIGNUM_LEN(num) != 0 && BDIGITS(num)[0] & 1) {
+        return Qfalse;
     }
-    RB_GC_GUARD(save_x);
-    return z;
+    return Qtrue;
 }
 
-/*
- *  call-seq:
- *     big[n] -> 0, 1
- *
- *  Bit Reference---Returns the <em>n</em>th bit in the (assumed) binary
- *  representation of <i>big</i>, where <i>big</i>[0] is the least
- *  significant bit.
- *
- *     a = 9**15
- *     50.downto(0) do |n|
- *       print a[n]
- *     end
- *
- *  <em>produces:</em>
- *
- *     000101110110100000111000011110010100111100010111001
- *
- */
+unsigned long rb_ulong_isqrt(unsigned long);
+#if SIZEOF_BDIGIT*2 > SIZEOF_LONG
+BDIGIT rb_bdigit_dbl_isqrt(BDIGIT_DBL);
+# ifdef ULL_TO_DOUBLE
+#   define BDIGIT_DBL_TO_DOUBLE(n) ULL_TO_DOUBLE(n)
+# endif
+#else
+# define rb_bdigit_dbl_isqrt(x) (BDIGIT)rb_ulong_isqrt(x)
+#endif
+#ifndef BDIGIT_DBL_TO_DOUBLE
+# define BDIGIT_DBL_TO_DOUBLE(n) (double)(n)
+#endif
 
-static VALUE
-rb_big_aref(VALUE x, VALUE y)
+static BDIGIT *
+estimate_initial_sqrt(VALUE *xp, const size_t xn, const BDIGIT *nds, size_t len)
 {
-    BDIGIT *xds;
-    BDIGIT_DBL num;
-    VALUE shift;
-    long i, s1, s2;
+    enum {dbl_per_bdig = roomof(DBL_MANT_DIG,BITSPERDIG)};
+    const int zbits = nlz(nds[len-1]);
+    VALUE x = *xp = bignew_1(0, xn, 1); /* division may release the GVL */
+    BDIGIT *xds = BDIGITS(x);
+    BDIGIT_DBL d = bary2bdigitdbl(nds+len-dbl_per_bdig, dbl_per_bdig);
+    BDIGIT lowbits = 1;
+    int rshift = (int)((BITSPERDIG*2-zbits+(len&BITSPERDIG&1) - DBL_MANT_DIG + 1) & ~1);
+    double f;
 
-    if (RB_TYPE_P(y, T_BIGNUM)) {
-	if (!RBIGNUM_SIGN(y))
-	    return INT2FIX(0);
-	bigtrunc(y);
-	if (RBIGNUM_LEN(y) > DIGSPERLONG) {
-	  out_of_range:
-	    return RBIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1);
-	}
-	shift = big2ulong(y, "long", FALSE);
+    if (rshift > 0) {
+        lowbits = (BDIGIT)d & ~(~(BDIGIT)1U << rshift);
+        d >>= rshift;
     }
-    else {
-	i = NUM2LONG(y);
-	if (i < 0) return INT2FIX(0);
-	shift = (VALUE)i;
+    else if (rshift < 0) {
+        d <<= -rshift;
+        d |= nds[len-dbl_per_bdig-1] >> (BITSPERDIG+rshift);
     }
-    s1 = shift/BITSPERDIG;
-    s2 = shift%BITSPERDIG;
-
-    if (s1 >= RBIGNUM_LEN(x)) goto out_of_range;
-    if (!RBIGNUM_SIGN(x)) {
-	xds = BDIGITS(x);
-	i = 0; num = 1;
-	while (num += ~xds[i], ++i <= s1) {
-	    num = BIGDN(num);
-	}
+    f = sqrt(BDIGIT_DBL_TO_DOUBLE(d));
+    d = (BDIGIT_DBL)ceil(f);
+    if (BDIGIT_DBL_TO_DOUBLE(d) == f) {
+        if (lowbits || (lowbits = !bary_zero_p(nds, len-dbl_per_bdig)))
+            ++d;
     }
     else {
-	num = BDIGITS(x)[s1];
+        lowbits = 1;
+    }
+    rshift /= 2;
+    rshift += (2-(len&1))*BITSPERDIG/2;
+    if (rshift >= 0) {
+        if (nlz((BDIGIT)d) + rshift >= BITSPERDIG) {
+            /* (d << rshift) does cause overflow.
+             * example: Integer.sqrt(0xffff_ffff_ffff_ffff ** 2)
+             */
+            d = ~(BDIGIT_DBL)0;
+        }
+        else {
+            d <<= rshift;
+        }
     }
-    if (num & ((BDIGIT_DBL)1<<s2))
-	return INT2FIX(1);
-    return INT2FIX(0);
-}
+    BDIGITS_ZERO(xds, xn-2);
+    bdigitdbl2bary(&xds[xn-2], 2, d);
 
-/*
- * call-seq:
- *   big.hash   -> fixnum
- *
- * Compute a hash based on the value of _big_.
- */
+    if (!lowbits) return NULL; /* special case, exact result */
+    return xds;
+}
 
-static VALUE
-rb_big_hash(VALUE x)
+VALUE
+rb_big_isqrt(VALUE n)
 {
-    st_index_t hash;
+    BDIGIT *nds = BDIGITS(n);
+    size_t len = BIGNUM_LEN(n);
+    size_t xn = (len+1) / 2;
+    VALUE x;
+    BDIGIT *xds;
 
-    hash = rb_memhash(BDIGITS(x), sizeof(BDIGIT)*RBIGNUM_LEN(x)) ^ RBIGNUM_SIGN(x);
-    return INT2FIX(hash);
+    if (len <= 2) {
+        BDIGIT sq = rb_bdigit_dbl_isqrt(bary2bdigitdbl(nds, len));
+#if SIZEOF_BDIGIT > SIZEOF_LONG
+        return ULL2NUM(sq);
+#else
+        return ULONG2NUM(sq);
+#endif
+    }
+    else if ((xds = estimate_initial_sqrt(&x, xn, nds, len)) != 0) {
+        size_t tn = xn + BIGDIVREM_EXTRA_WORDS;
+        VALUE t = bignew_1(0, tn, 1);
+        BDIGIT *tds = BDIGITS(t);
+        tn = BIGNUM_LEN(t);
+
+        /* t = n/x */
+        while (bary_divmod_branch(tds, tn, NULL, 0, nds, len, xds, xn),
+               bary_cmp(tds, tn, xds, xn) < 0) {
+            int carry;
+            BARY_TRUNC(tds, tn);
+            /* x = (x+t)/2 */
+            carry = bary_add(xds, xn, xds, xn, tds, tn);
+            bary_small_rshift(xds, xds, xn, 1, carry);
+            tn = BIGNUM_LEN(t);
+        }
+    }
+    RBASIC_SET_CLASS_RAW(x, rb_cInteger);
+    return x;
 }
 
-/*
- * MISSING: documentation
- */
+#if USE_GMP
+static void
+bary_powm_gmp(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, const BDIGIT *mds, size_t mn)
+{
+    mpz_t z, x, y, m;
+    size_t count;
+    mpz_init(x);
+    mpz_init(y);
+    mpz_init(m);
+    mpz_init(z);
+    bdigits_to_mpz(x, xds, xn);
+    bdigits_to_mpz(y, yds, yn);
+    bdigits_to_mpz(m, mds, mn);
+    mpz_powm(z, x, y, m);
+    bdigits_from_mpz(z, zds, &count);
+    BDIGITS_ZERO(zds+count, zn-count);
+    mpz_clear(x);
+    mpz_clear(y);
+    mpz_clear(m);
+    mpz_clear(z);
+}
+#endif
 
 static VALUE
-rb_big_coerce(VALUE x, VALUE y)
+int_pow_tmp3(VALUE x, VALUE y, VALUE m, int nega_flg)
 {
+#if USE_GMP
+    VALUE z;
+    size_t xn, yn, mn, zn;
+
+    if (FIXNUM_P(x)) {
+       x = rb_int2big(FIX2LONG(x));
+    }
     if (FIXNUM_P(y)) {
-	return rb_assoc_new(rb_int2big(FIX2LONG(y)), x);
+       y = rb_int2big(FIX2LONG(y));
+    }
+    assert(RB_BIGNUM_TYPE_P(m));
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
+    mn = BIGNUM_LEN(m);
+    zn = mn;
+    z = bignew(zn, 1);
+    bary_powm_gmp(BDIGITS(z), zn, BDIGITS(x), xn, BDIGITS(y), yn, BDIGITS(m), mn);
+    if (nega_flg & BIGNUM_POSITIVE_P(z)) {
+        z = rb_big_minus(z, m);
+    }
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    RB_GC_GUARD(m);
+    return rb_big_norm(z);
+#else
+    VALUE tmp = LONG2FIX(1L);
+    long yy;
+
+    for (/*NOP*/; ! FIXNUM_P(y); y = rb_big_rshift(y, LONG2FIX(1L))) {
+        if (RTEST(rb_int_odd_p(y))) {
+            tmp = rb_int_mul(tmp, x);
+            tmp = rb_int_modulo(tmp, m);
+        }
+        x = rb_int_mul(x, x);
+        x = rb_int_modulo(x, m);
     }
-    else if (RB_TYPE_P(y, T_BIGNUM)) {
-       return rb_assoc_new(y, x);
+    for (yy = FIX2LONG(y); yy; yy >>= 1L) {
+        if (yy & 1L) {
+            tmp = rb_int_mul(tmp, x);
+            tmp = rb_int_modulo(tmp, m);
+        }
+        x = rb_int_mul(x, x);
+        x = rb_int_modulo(x, m);
     }
-    else {
-	rb_raise(rb_eTypeError, "can't coerce %s to Bignum",
-		 rb_obj_classname(y));
+
+    if (nega_flg && rb_int_positive_p(tmp)) {
+        tmp = rb_int_minus(tmp, m);
     }
-    /* not reached */
-    return Qnil;
+    return tmp;
+#endif
 }
 
 /*
- *  call-seq:
- *     big.abs -> aBignum
- *
- *  Returns the absolute value of <i>big</i>.
- *
- *     -1234567890987654321.abs   #=> 1234567890987654321
+ * Integer#pow
  */
 
 static VALUE
-rb_big_abs(VALUE x)
+int_pow_tmp1(VALUE x, VALUE y, long mm, int nega_flg)
 {
-    if (!RBIGNUM_SIGN(x)) {
-	x = rb_big_clone(x);
-	RBIGNUM_SET_SIGN(x, 1);
+    long xx = FIX2LONG(x);
+    long tmp = 1L;
+    long yy;
+
+    for (/*NOP*/; ! FIXNUM_P(y); y = rb_big_rshift(y, LONG2FIX(1L))) {
+        if (RTEST(rb_int_odd_p(y))) {
+            tmp = (tmp * xx) % mm;
+        }
+        xx = (xx * xx) % mm;
+    }
+    for (yy = FIX2LONG(y); yy; yy >>= 1L) {
+        if (yy & 1L) {
+            tmp = (tmp * xx) % mm;
+        }
+        xx = (xx * xx) % mm;
     }
-    return x;
-}
 
-/*
- *  call-seq:
- *     big.size -> integer
- *
- *  Returns the number of bytes in the machine representation of
- *  <i>big</i>.
- *
- *     (256**10 - 1).size   #=> 12
- *     (256**20 - 1).size   #=> 20
- *     (256**40 - 1).size   #=> 40
- */
+    if (nega_flg && tmp) {
+        tmp -= mm;
+    }
+    return LONG2FIX(tmp);
+}
 
 static VALUE
-rb_big_size(VALUE big)
-{
-    return LONG2FIX(RBIGNUM_LEN(big)*SIZEOF_BDIGITS);
-}
+int_pow_tmp2(VALUE x, VALUE y, long mm, int nega_flg)
+{
+    long tmp = 1L;
+    long yy;
+#ifdef DLONG
+    const DLONG m = mm;
+    long tmp2 = tmp;
+    long xx = FIX2LONG(x);
+# define MUL_MODULO(a, b, c) (long)(((DLONG)(a) * (DLONG)(b)) % (c))
+#else
+    const VALUE m = LONG2FIX(mm);
+    VALUE tmp2 = LONG2FIX(tmp);
+    VALUE xx = x;
+# define MUL_MODULO(a, b, c) rb_int_modulo(rb_fix_mul_fix((a), (b)), (c))
+#endif
 
-/*
- *  call-seq:
- *     big.odd? -> true or false
- *
- *  Returns <code>true</code> if <i>big</i> is an odd number.
- */
+    for (/*NOP*/; ! FIXNUM_P(y); y = rb_big_rshift(y, LONG2FIX(1L))) {
+        if (RTEST(rb_int_odd_p(y))) {
+            tmp2 = MUL_MODULO(tmp2, xx, m);
+        }
+        xx = MUL_MODULO(xx, xx, m);
+    }
+    for (yy = FIX2LONG(y); yy; yy >>= 1L) {
+        if (yy & 1L) {
+            tmp2 = MUL_MODULO(tmp2, xx, m);
+        }
+        xx = MUL_MODULO(xx, xx, m);
+    }
 
-static VALUE
-rb_big_odd_p(VALUE num)
-{
-    if (BDIGITS(num)[0] & 1) {
-	return Qtrue;
+#ifdef DLONG
+    tmp = tmp2;
+#else
+    tmp = FIX2LONG(tmp2);
+#endif
+    if (nega_flg && tmp) {
+        tmp -= mm;
     }
-    return Qfalse;
+    return LONG2FIX(tmp);
 }
 
 /*
- *  call-seq:
- *     big.even? -> true or false
+ * Document-method: Integer#pow
+ * call-seq:
+ *    integer.pow(numeric)           ->  numeric
+ *    integer.pow(integer, integer)  ->  integer
+ *
+ * Returns (modular) exponentiation as:
  *
- *  Returns <code>true</code> if <i>big</i> is an even number.
+ *   a.pow(b)     #=> same as a**b
+ *   a.pow(b, m)  #=> same as (a**b) % m, but avoids huge temporary values
  */
-
-static VALUE
-rb_big_even_p(VALUE num)
+VALUE
+rb_int_powm(int const argc, VALUE * const argv, VALUE const num)
 {
-    if (BDIGITS(num)[0] & 1) {
-	return Qfalse;
+    rb_check_arity(argc, 1, 2);
+
+    if (argc == 1) {
+        return rb_int_pow(num, argv[0]);
     }
-    return Qtrue;
+    else {
+        VALUE const a = num;
+        VALUE const b = argv[0];
+        VALUE m = argv[1];
+        int nega_flg = 0;
+        if ( ! RB_INTEGER_TYPE_P(b)) {
+            rb_raise(rb_eTypeError, "Integer#pow() 2nd argument not allowed unless a 1st argument is integer");
+        }
+        if (rb_int_negative_p(b)) {
+            rb_raise(rb_eRangeError, "Integer#pow() 1st argument cannot be negative when 2nd argument specified");
+        }
+        if (!RB_INTEGER_TYPE_P(m)) {
+            rb_raise(rb_eTypeError, "Integer#pow() 2nd argument not allowed unless all arguments are integers");
+        }
+
+        if (rb_int_negative_p(m)) {
+            m = rb_int_uminus(m);
+            nega_flg = 1;
+        }
+
+        if (FIXNUM_P(m)) {
+            long const half_val = (long)HALF_LONG_MSB;
+            long const mm = FIX2LONG(m);
+            if (!mm) rb_num_zerodiv();
+            if (mm == 1) return INT2FIX(0);
+            if (mm <= half_val) {
+                return int_pow_tmp1(rb_int_modulo(a, m), b, mm, nega_flg);
+            }
+            else {
+                return int_pow_tmp2(rb_int_modulo(a, m), b, mm, nega_flg);
+            }
+        }
+        else {
+            if (rb_bigzero_p(m)) rb_num_zerodiv();
+            if (bignorm(m) == INT2FIX(1)) return INT2FIX(0);
+            return int_pow_tmp3(rb_int_modulo(a, m), b, m, nega_flg);
+        }
+    }
+    UNREACHABLE_RETURN(Qnil);
 }
 
 /*
@@ -3767,48 +7190,12 @@ rb_big_even_p(VALUE num)
 void
 Init_Bignum(void)
 {
-    rb_cBignum = rb_define_class("Bignum", rb_cInteger);
-
-    rb_define_method(rb_cBignum, "to_s", rb_big_to_s, -1);
-    rb_define_method(rb_cBignum, "coerce", rb_big_coerce, 1);
-    rb_define_method(rb_cBignum, "-@", rb_big_uminus, 0);
-    rb_define_method(rb_cBignum, "+", rb_big_plus, 1);
-    rb_define_method(rb_cBignum, "-", rb_big_minus, 1);
-    rb_define_method(rb_cBignum, "*", rb_big_mul, 1);
-    rb_define_method(rb_cBignum, "/", rb_big_div, 1);
-    rb_define_method(rb_cBignum, "%", rb_big_modulo, 1);
-    rb_define_method(rb_cBignum, "div", rb_big_idiv, 1);
-    rb_define_method(rb_cBignum, "divmod", rb_big_divmod, 1);
-    rb_define_method(rb_cBignum, "modulo", rb_big_modulo, 1);
-    rb_define_method(rb_cBignum, "remainder", rb_big_remainder, 1);
-    rb_define_method(rb_cBignum, "fdiv", rb_big_fdiv, 1);
-    rb_define_method(rb_cBignum, "**", rb_big_pow, 1);
-    rb_define_method(rb_cBignum, "&", rb_big_and, 1);
-    rb_define_method(rb_cBignum, "|", rb_big_or, 1);
-    rb_define_method(rb_cBignum, "^", rb_big_xor, 1);
-    rb_define_method(rb_cBignum, "~", rb_big_neg, 0);
-    rb_define_method(rb_cBignum, "<<", rb_big_lshift, 1);
-    rb_define_method(rb_cBignum, ">>", rb_big_rshift, 1);
-    rb_define_method(rb_cBignum, "[]", rb_big_aref, 1);
-
-    rb_define_method(rb_cBignum, "<=>", rb_big_cmp, 1);
-    rb_define_method(rb_cBignum, "==", rb_big_eq, 1);
-    rb_define_method(rb_cBignum, ">", big_gt, 1);
-    rb_define_method(rb_cBignum, ">=", big_ge, 1);
-    rb_define_method(rb_cBignum, "<", big_lt, 1);
-    rb_define_method(rb_cBignum, "<=", big_le, 1);
-    rb_define_method(rb_cBignum, "===", rb_big_eq, 1);
-    rb_define_method(rb_cBignum, "eql?", rb_big_eql, 1);
-    rb_define_method(rb_cBignum, "hash", rb_big_hash, 0);
-    rb_define_method(rb_cBignum, "to_f", rb_big_to_f, 0);
-    rb_define_method(rb_cBignum, "abs", rb_big_abs, 0);
-    rb_define_method(rb_cBignum, "magnitude", rb_big_abs, 0);
-    rb_define_method(rb_cBignum, "size", rb_big_size, 0);
-    rb_define_method(rb_cBignum, "odd?", rb_big_odd_p, 0);
-    rb_define_method(rb_cBignum, "even?", rb_big_even_p, 0);
+    rb_define_method(rb_cInteger, "coerce", rb_int_coerce, 1);
 
-    power_cache_init();
+#if USE_GMP
+    /* The version of loaded GMP. */
+    rb_define_const(rb_cInteger, "GMP_VERSION", rb_sprintf("GMP %s", gmp_version));
+#endif
 
-    big_three = rb_uint2big(3);
-    rb_gc_register_mark_object(big_three);
+    power_cache_init();
 }
diff --git a/bin/erb b/bin/erb
deleted file mode 100755
index 6b92ac2284..0000000000
--- a/bin/erb
+++ /dev/null
@@ -1,155 +0,0 @@
-#!/usr/bin/env ruby
-# Tiny eRuby --- ERB2
-# Copyright (c) 1999-2000,2002 Masatoshi SEKI
-# You can redistribute it and/or modify it under the same terms as Ruby.
-
-require 'erb'
-
-class ERB
-  module Main
-    def ARGV.switch
-      return nil if self.empty?
-      arg = self.shift
-      return nil if arg == '--'
-      if arg =~ /^-(.)(.*)/
-        if $1 == '-'
-          arg, @maybe_arg = arg.split(/=/, 2)
-          return arg
-        end
-        raise 'unknown switch "-"' if $2[0] == ?- and $1 != 'T'
-        if $2.size > 0
-          self.unshift "-#{$2}"
-          @maybe_arg = $2
-        else
-          @maybe_arg = nil
-        end
-        "-#{$1}"
-      else
-        self.unshift arg
-        nil
-      end
-    end
-
-    def ARGV.req_arg
-      (@maybe_arg || self.shift || raise('missing argument')).tap {
-        @maybe_arg = nil
-      }
-    end
-
-    def trim_mode_opt(trim_mode, disable_percent)
-      return trim_mode if disable_percent
-      case trim_mode
-      when 0
-        return '%'
-      when 1
-        return '%>'
-      when 2
-        return '%<>'
-      when '-'
-        return '%-'
-      end
-    end
-    module_function :trim_mode_opt
-
-    def run(factory=ERB)
-      trim_mode = 0
-      disable_percent = false
-      begin
-        while switch = ARGV.switch
-          case switch
-          when '-x'                        # ruby source
-            output = true
-          when '-n'                        # line number
-            number = true
-          when '-v'                        # verbose
-            $VERBOSE = true
-          when '--version'                 # version
-            STDERR.puts factory.version
-            exit
-          when '-d', '--debug'             # debug
-            $DEBUG = true
-          when '-r'                        # require
-            require ARGV.req_arg
-          when '-S'                        # security level
-            arg = ARGV.req_arg
-            raise "invalid safe_level #{arg.dump}" unless arg =~ /^[0-4]$/
-            safe_level = arg.to_i
-          when '-T'                        # trim mode
-            arg = ARGV.req_arg
-            if arg == '-'
-              trim_mode = arg
-              next
-            end
-            raise "invalid trim mode #{arg.dump}" unless arg =~ /^[0-2]$/
-            trim_mode = arg.to_i
-          when '-E', '--encoding'
-            arg = ARGV.req_arg
-            set_encoding(*arg.split(/:/, 2))
-          when '-U'
-            set_encoding(Encoding::UTF_8, Encoding::UTF_8)
-          when '-P'
-            disable_percent = true
-          when '--help'
-            raise "print this help"
-          else
-            raise "unknown switch #{switch.dump}"
-          end
-        end
-      rescue                               # usage
-        STDERR.puts $!.to_s
-        STDERR.puts File.basename($0) +
-          " [switches] [inputfile]"
-        STDERR.puts <<EOU
-  -x               print ruby script
-  -n               print ruby script with line number
-  -v               enable verbose mode
-  -d               set $DEBUG to true
-  -r library       load a library
-  -S safe_level    set $SAFE (0..4)
-  -E ex[:in]       set default external/internal encodings
-  -U               set default encoding to UTF-8.
-  -T trim_mode     specify trim_mode (0..2, -)
-  -P               ignore lines which start with "%"
-EOU
-        exit 1
-      end
-
-      $<.set_encoding(Encoding::ASCII_8BIT, nil)
-      src = $<.read
-      filename = $FILENAME
-      exit 2 unless src
-      trim = trim_mode_opt(trim_mode, disable_percent)
-      erb = factory.new(src.untaint, safe_level, trim)
-      erb.filename = filename
-      if output
-        if number
-          erb.src.each_line.with_index do |line, l|
-            puts "%3d %s"%[l+1, line]
-          end
-        else
-          puts erb.src
-        end
-      else
-        erb.run(TOPLEVEL_BINDING.taint)
-      end
-    end
-    module_function :run
-
-    def set_encoding(extern, intern = nil)
-      verbose, $VERBOSE = $VERBOSE, nil
-      Encoding.default_external = extern unless extern.nil? || extern.empty?
-      Encoding.default_internal = intern unless intern.nil? || intern.empty?
-      [$stdin, $stdout, $stderr].each do |io|
-        io.set_encoding(extern, intern)
-      end
-    ensure
-      $VERBOSE = verbose
-    end
-    module_function :set_encoding
-    class << self; private :set_encoding; end
-  end
-end
-
-if __FILE__ == $0
-  ERB::Main.run
-end
diff --git a/bin/gem b/bin/gem
index a4ec754abb..1c16ea7ddd 100755
--- a/bin/gem
+++ b/bin/gem
@@ -5,21 +5,6 @@
 # See LICENSE.txt for permissions.
 #++
 
-require 'rubygems'
-require 'rubygems/gem_runner'
-require 'rubygems/exceptions'
-
-required_version = Gem::Requirement.new ">= 1.8.7"
-
-unless required_version.satisfied_by? Gem.ruby_version then
-  abort "Expected Ruby Version #{required_version}, is #{Gem.ruby_version}"
-end
-
-args = ARGV.clone
-
-begin
-  Gem::GemRunner.new.run args
-rescue Gem::SystemExitException => e
-  exit e.exit_code
-end
+require "rubygems/gem_runner"
 
+Gem::GemRunner.new.run ARGV.clone
diff --git a/bin/irb b/bin/irb
deleted file mode 100755
index 6c8465c802..0000000000
--- a/bin/irb
+++ /dev/null
@@ -1,20 +0,0 @@
-#!/usr/bin/env ruby
-#
-#   irb.rb - interactive ruby
-#   	$Release Version: 0.9.6 $
-#   	$Revision$
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require "irb"
-
-if __FILE__ == $0
-  IRB.start(__FILE__)
-else
-  # check -e option
-  if /^-e$/ =~ $0
-    IRB.start(__FILE__)
-  else
-    IRB.setup(__FILE__)
-  end
-end
diff --git a/bin/rake b/bin/rake
deleted file mode 100755
index 0de43c97ec..0000000000
--- a/bin/rake
+++ /dev/null
@@ -1,32 +0,0 @@
-#!/usr/bin/env ruby
-
-#--
-# Copyright (c) 2003, 2004, 2005, 2006, 2007  Jim Weirich
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to
-# deal in the Software without restriction, including without limitation the
-# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-# sell copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-#
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
-# IN THE SOFTWARE.
-#++
-
-begin
-  require 'rubygems'
-rescue LoadError
-end
-
-require 'rake'
-
-Rake.application.run
diff --git a/bin/rdoc b/bin/rdoc
deleted file mode 100755
index 64601a819e..0000000000
--- a/bin/rdoc
+++ /dev/null
@@ -1,42 +0,0 @@
-#!/usr/bin/env ruby
-#
-#  RDoc: Documentation tool for source code
-#        (see lib/rdoc/rdoc.rb for more information)
-#
-#  Copyright (c) 2003 Dave Thomas
-#  Released under the same terms as Ruby
-#
-#  $Revision$
-
-begin
-  gem 'rdoc'
-rescue NameError => e # --disable-gems
-  raise unless e.name == :gem
-rescue Gem::LoadError
-end
-
-require 'rdoc/rdoc'
-
-begin
-  r = RDoc::RDoc.new
-  r.document ARGV
-rescue SystemExit
-  raise
-rescue Exception => e
-  if $DEBUG_RDOC then
-    $stderr.puts e.message
-    $stderr.puts "#{e.backtrace.join "\n\t"}"
-    $stderr.puts
-  elsif Interrupt === e then
-    $stderr.puts
-    $stderr.puts 'Interrupted'
-  else
-    $stderr.puts "uh-oh! RDoc had a problem:"
-    $stderr.puts e.message
-    $stderr.puts
-    $stderr.puts "run with --debug for full backtrace"
-  end
-
-  exit 1
-end
-
diff --git a/bin/testrb b/bin/testrb
deleted file mode 100755
index e9046eb147..0000000000
--- a/bin/testrb
+++ /dev/null
@@ -1,10 +0,0 @@
-#!/usr/bin/env ruby
-require 'test/unit'
-tests = Test::Unit::AutoRunner.new(true)
-tests.options.banner.sub!(/\[options\]/, '\& tests...')
-unless tests.process_args(ARGV)
-  abort tests.options.banner
-end
-files = tests.to_run
-$0 = files.size == 1 ? File.basename(files[0]) : files.to_s
-exit tests.run
diff --git a/bootstraptest/pending.rb b/bootstraptest/pending.rb
index 744c0adac1..2c4b85a419 100644
--- a/bootstraptest/pending.rb
+++ b/bootstraptest/pending.rb
@@ -1,19 +1,3 @@
-assert_equal 'A', %q{
-  class A
-    @@a = 'A'
-    def a=(x)
-      @@a = x
-    end
-    def a
-      @@a
-    end
-  end
-
-  B = A.dup
-  B.new.a = 'B'
-  A.new.a
-}, '[ruby-core:17019]'
-
 assert_equal 'ok', %q{
   def m
     lambda{
@@ -31,9 +15,7 @@ assert_equal 'ok', %q{
   end
 }
 
-assert_normal_exit %q{
-  r = Range.allocate
-  def r.<=>(o) true end
-  r.instance_eval { initialize r, r }
-  r.inspect
+# This randomly fails on mswin.
+assert_equal %q{[]}, %q{
+  Thread.new{sleep}.backtrace
 }
diff --git a/bootstraptest/runner.rb b/bootstraptest/runner.rb
index eaed292e50..f9b3e919b8 100755
--- a/bootstraptest/runner.rb
+++ b/bootstraptest/runner.rb
@@ -1,4 +1,4 @@
-"exec" "${RUBY-ruby}" "-x" "$0" "$@"; true # -*- mode: ruby; coding: utf-8 -*-
+"exec" "${RUBY-ruby}" "-x" "$0" "$@" || true # -*- Ruby -*-
 #!./ruby
 # $Id$
 
@@ -6,6 +6,9 @@
 # Never use optparse in this file.
 # Never use test/unit in this file.
 # Never use Ruby extensions in this file.
+# Maintain Ruby 1.8 compatibility for now
+
+$start_time = Time.now
 
 begin
   require 'fileutils'
@@ -57,20 +60,114 @@ if !Dir.respond_to?(:mktmpdir)
   end
 end
 
+# Configuration
+bt = Struct.new(:ruby,
+                :verbose,
+                :color,
+                :tty,
+                :quiet,
+                :wn,
+                :progress,
+                :progress_bs,
+                :passed,
+                :failed,
+                :reset,
+                :columns,
+                :window_width,
+                :width,
+                :indent,
+                :platform,
+                )
+BT = Class.new(bt) do
+  def indent=(n)
+    super
+    if (self.columns ||= 0) < n
+      $stderr.print(' ' * (n - self.columns))
+    end
+    self.columns = indent
+  end
+
+  def putc(c)
+    unless self.quiet
+      if self.window_width == nil
+        unless w = ENV["COLUMNS"] and (w = w.to_i) > 0
+          w = 80
+        end
+        w -= 1
+        self.window_width = w
+      end
+      if self.window_width and self.columns >= self.window_width
+        $stderr.print "\n", " " * (self.indent ||= 0)
+        self.columns = indent
+      end
+      $stderr.print c
+      $stderr.flush
+      self.columns += 1
+    end
+  end
+
+  def wn=(wn)
+    unless wn == 1
+      if /(?:\A|\s)--jobserver-(?:auth|fds)=(?:(\d+),(\d+)|fifo:((?:\\.|\S)+))/ =~ ENV.delete("MAKEFLAGS")
+        begin
+          if fifo = $3
+            fifo.gsub!(/\\(?=.)/, '')
+            r = File.open(fifo, IO::RDONLY|IO::NONBLOCK|IO::BINARY)
+            w = File.open(fifo, IO::WRONLY|IO::NONBLOCK|IO::BINARY)
+          else
+            r = IO.for_fd($1.to_i(10), "rb", autoclose: false)
+            w = IO.for_fd($2.to_i(10), "wb", autoclose: false)
+          end
+        rescue => e
+          r.close if r
+        else
+          r.close_on_exec = true
+          w.close_on_exec = true
+          tokens = r.read_nonblock(wn > 0 ? wn : 1024, exception: false)
+          r.close
+          if String === tokens
+            tokens.freeze
+            auth = w
+            w = nil
+            at_exit {auth << tokens; auth.close}
+            wn = tokens.size + 1
+          else
+            w.close
+            wn = 1
+          end
+        end
+      end
+      if wn <= 0
+        require 'etc'
+        wn = [Etc.nprocessors / 2, 1].max
+      end
+    end
+    super wn
+  end
+end.new
+
+BT_STATE = Struct.new(:count, :error).new
+
 def main
-  @ruby = File.expand_path('miniruby')
-  @verbose = false
+  BT.ruby = File.expand_path('miniruby')
+  BT.verbose = false
+  $VERBOSE = false
   $stress = false
+  BT.color = nil
+  BT.tty = nil
+  BT.quiet = false
+  # BT.wn = 1
   dir = nil
   quiet = false
   tests = nil
   ARGV.delete_if {|arg|
     case arg
     when /\A--ruby=(.*)/
-      @ruby = $1
-      @ruby.gsub!(/^([^ ]*)/){File.expand_path($1)}
-      @ruby.gsub!(/(\s+-I\s*)((?!(?:\.\/)*-(?:\s|\z))\S+)/){$1+File.expand_path($2)}
-      @ruby.gsub!(/(\s+-r\s*)(\.\.?\/\S+)/){$1+File.expand_path($2)}
+      ruby = $1
+      ruby.gsub!(/^([^ ]*)/){File.expand_path($1)}
+      ruby.gsub!(/(\s+-I\s*)((?!(?:\.\/)*-(?:\s|\z))\S+)/){$1+File.expand_path($2)}
+      ruby.gsub!(/(\s+-r\s*)(\.\.?\/\S+)/){$1+File.expand_path($2)}
+      BT.ruby = ruby
       true
     when /\A--sets=(.*)/
       tests = Dir.glob("#{File.dirname($0)}/test_{#{$1}}*.rb").sort
@@ -81,37 +178,81 @@ def main
       true
     when /\A(--stress|-s)/
       $stress = true
+    when /\A--color(?:=(?:always|(auto)|(never)|(.*)))?\z/
+      warn "unknown --color argument: #$3" if $3
+      BT.color = color = $1 ? nil : !$2
+      true
+    when /\A--tty(=(?:yes|(no)|(.*)))?\z/
+      warn "unknown --tty argument: #$3" if $3
+      BT.tty = !$1 || !$2
+      true
     when /\A(-q|--q(uiet))\z/
       quiet = true
+      BT.quiet = true
+      true
+    when /\A-j(\d+)?/
+      BT.wn = $1.to_i
       true
     when /\A(-v|--v(erbose))\z/
-      @verbose = true
+      BT.verbose = true
+      BT.quiet = false
+      true
     when /\A(-h|--h(elp)?)\z/
       puts(<<-End)
 Usage: #{File.basename($0, '.*')} --ruby=PATH [--sets=NAME,NAME,...]
         --sets=NAME,NAME,...        Name of test sets.
         --dir=DIRECTORY             Working directory.
                                     default: /tmp/bootstraptestXXXXX.tmpwd
+        --color[=WHEN]              Colorize the output.  WHEN defaults to 'always'
+                                    or can be 'never' or 'auto'.
     -s, --stress                    stress test.
     -v, --verbose                   Output test name before exec.
     -q, --quiet                     Don\'t print header message.
     -h, --help                      Print this message and quit.
 End
       exit true
+    when /\A-j/
+      true
     else
       false
     end
   }
   if tests and not ARGV.empty?
-    $stderr.puts "--tests and arguments are exclusive"
-    exit false
+    abort "--sets and arguments are exclusive"
   end
   tests ||= ARGV
   tests = Dir.glob("#{File.dirname($0)}/test_*.rb").sort if tests.empty?
   pathes = tests.map {|path| File.expand_path(path) }
 
+  BT.progress = %w[- \\ | /]
+  BT.progress_bs = "\b" * BT.progress[0].size
+  BT.tty = $stderr.tty? if BT.tty.nil?
+  BT.wn ||= /-j(\d+)?/ =~ (ENV["MAKEFLAGS"] || ENV["MFLAGS"]) ? $1.to_i : 1
+
+  case BT.color
+  when nil
+    BT.color = BT.tty && /dumb/ !~ ENV["TERM"]
+  end
+  BT.tty &&= !BT.verbose
+  if BT.color
+    # dircolors-like style
+    colors = (colors = ENV['TEST_COLORS']) ? Hash[colors.scan(/(\w+)=([^:\n]*)/)] : {}
+    begin
+      File.read(File.join(__dir__, "../tool/colors")).scan(/(\w+)=([^:\n]*)/) do |n, c|
+        colors[n] ||= c
+      end
+    rescue
+    end
+    BT.passed = "\e[;#{colors["pass"] || "32"}m"
+    BT.failed = "\e[;#{colors["fail"] || "31"}m"
+    BT.reset = "\e[m"
+  else
+    BT.passed = BT.failed = BT.reset = ""
+  end
+  target_version = `#{BT.ruby} -v`.chomp
+  BT.platform = target_version[/\[(.*)\]\z/, 1]
   unless quiet
-    puts Time.now
+    puts $start_time
     if defined?(RUBY_DESCRIPTION)
       puts "Driver is #{RUBY_DESCRIPTION}"
     elsif defined?(RUBY_PATCHLEVEL)
@@ -119,250 +260,486 @@ End
     else
       puts "Driver is ruby #{RUBY_VERSION} (#{RUBY_RELEASE_DATE}) [#{RUBY_PLATFORM}]"
     end
-    puts "Target is #{`#{@ruby} -v`.chomp}"
+    puts "Target is #{target_version}"
     puts
     $stdout.flush
   end
 
-  in_temporary_working_directory(dir) {
+  in_temporary_working_directory(dir) do
     exec_test pathes
-  }
+  end
 end
 
-def exec_test(pathes)
-  @count = 0
-  @error = 0
-  @errbuf = []
-  @location = nil
+def erase(e = true)
+  if e and BT.columns > 0 and BT.tty and !BT.verbose
+    "\e[1K\r"
+  else
+    ""
+  end
+end
+
+def load_test pathes
   pathes.each do |path|
-    $stderr.print "\n#{File.basename(path)} "
-    $stderr.puts if @verbose
     load File.expand_path(path)
   end
-  $stderr.puts
-  if @error == 0
-    if @count == 0
-      $stderr.puts "No tests, no problem"
-    else
-      $stderr.puts "PASS all #{@count} tests"
+end
+
+def concurrent_exec_test
+  aq = Queue.new
+  rq = Queue.new
+
+  ts = BT.wn.times.map do
+    Thread.new do
+      while as = aq.pop
+        as.call
+        rq << as
+      end
+    ensure
+      rq << nil
     end
-    exit true
-  else
-    @errbuf.each do |msg|
-      $stderr.puts msg
+  end
+
+  Assertion.all.to_a.shuffle.each do |path, assertions|
+    assertions.each do |as|
+      aq << as
+    end
+  end
+
+  BT.indent = 1
+  aq.close
+  i = 1
+  term_wn = 0
+  begin
+    while BT.wn != term_wn
+      if r = rq.pop
+        case
+        when BT.quiet
+        when BT.tty
+          $stderr.print "#{BT.progress_bs}#{BT.progress[(i+=1) % BT.progress.size]}"
+        else
+          BT.putc '.'
+        end
+      else
+        term_wn += 1
+      end
     end
-    $stderr.puts "FAIL #{@error}/#{@count} tests failed"
-    exit false
+  ensure
+    ts.each(&:kill)
+    ts.each(&:join)
   end
 end
 
-def show_progress(message = '')
-  if @verbose
-    $stderr.print "\##{@count} #{@location} "
+def exec_test(pathes)
+  # setup
+  load_test pathes
+  BT_STATE.count = 0
+  BT_STATE.error = 0
+  BT.columns = 0
+  BT.width = pathes.map {|path| File.basename(path).size}.max + 2
+
+  # execute tests
+  if BT.wn > 1
+    concurrent_exec_test
+  else
+    prev_basename = nil
+    Assertion.all.each do |basename, assertions|
+      if !BT.quiet && basename != prev_basename
+        prev_basename = basename
+        $stderr.printf("%s%-*s ", erase(BT.quiet), BT.width, basename)
+        $stderr.flush
+      end
+      BT.columns = BT.width + 1
+      $stderr.puts if BT.verbose
+      count = BT_STATE.count
+      error = BT_STATE.error
+
+      assertions.each do |assertion|
+        BT_STATE.count += 1
+        assertion.call
+      end
+
+      if BT.tty
+        if BT_STATE.error == error
+          msg = "PASS #{BT_STATE.count-count}"
+          BT.columns += msg.size - 1
+          $stderr.print "#{BT.progress_bs}#{BT.passed}#{msg}#{BT.reset}" unless BT.quiet
+        else
+          msg = "FAIL #{BT_STATE.error-error}/#{BT_STATE.count-count}"
+          $stderr.print "#{BT.progress_bs}#{BT.failed}#{msg}#{BT.reset}"
+          BT.columns = 0
+        end
+      end
+      $stderr.puts if !BT.quiet and (BT.tty or BT_STATE.error == error)
+    end
   end
-  faildesc = yield
-  if !faildesc
-    $stderr.print '.'
-    $stderr.puts if @verbose
+
+  # show results
+  unless BT.quiet
+    $stderr.puts(erase)
+
+    sec = Time.now - $start_time
+    $stderr.puts "Finished in #{'%.2f' % sec} sec\n\n" if Assertion.count > 0
+  end
+
+  Assertion.errbuf.each do |msg|
+    $stderr.puts msg
+  end
+
+  out = BT.quiet ? $stdout : $stderr
+
+  if BT_STATE.error == 0
+    if Assertion.count == 0
+      out.puts "No tests, no problem" unless BT.quiet
+    else
+      out.puts "#{BT.passed}PASS#{BT.reset} all #{Assertion.count} tests"
+    end
+    true
   else
-    $stderr.print 'F'
-    $stderr.puts if @verbose
-    error faildesc, message
-  end
-rescue Interrupt
-  raise Interrupt
-rescue Exception => err
-  $stderr.print 'E'
-  $stderr.puts if @verbose
-  error err.message, message
+    $stderr.puts "#{BT.failed}FAIL#{BT.reset} #{BT_STATE.error}/#{BT_STATE.count} tests failed"
+    false
+  end
 end
 
-def assert_check(testsrc, message = '', opt = '')
-  show_progress(message) {
-    result = get_result_string(testsrc, opt)
-    check_coredump
-    yield(result)
-  }
+def target_platform
+  BT.platform or RUBY_PLATFORM
 end
 
-def assert_equal(expected, testsrc, message = '')
-  newtest
-  assert_check(testsrc, message) {|result|
-    if expected == result
-      nil
+class Assertion < Struct.new(:src, :path, :lineno, :proc)
+  @count = 0
+  @all = Hash.new{|h, k| h[k] = []}
+  @errbuf = []
+
+  class << self
+    attr_reader :count, :errbuf
+
+    def all
+      @all
+    end
+
+    def add as
+      @all[as.path] << as
+      as.id = (@count += 1)
+    end
+  end
+
+  attr_accessor :id
+  attr_reader :err, :category
+
+  def initialize(*args)
+    super
+    self.class.add self
+    @category = self.path.match(/test_(.+)\.rb/)[1]
+  end
+
+  def call
+    self.proc.call self
+  end
+
+  def assert_check(message = '', opt = '', **argh)
+    show_progress(message) {
+      result = get_result_string(opt, **argh)
+      yield(result)
+    }
+  end
+
+  def with_stderr
+    out = err = nil
+    r, w = IO.pipe
+    @err = w
+    err_reader = Thread.new{ r.read }
+
+    begin
+      out = yield
+    ensure
+      w.close
+      err = err_reader.value
+      r.close rescue nil
+    end
+
+    return out, err
+  end
+
+  def show_error(msg, additional_message)
+    msg = "#{BT.failed}\##{self.id} #{self.path}:#{self.lineno}#{BT.reset}: #{msg}  #{additional_message}"
+    if BT.tty
+      $stderr.puts "#{erase}#{msg}"
     else
-      desc = "#{result.inspect} (expected #{expected.inspect})"
-      pretty(testsrc, desc, result)
+      Assertion.errbuf << msg
     end
-  }
-end
+    BT_STATE.error += 1
+  end
 
-def assert_match(expected_pattern, testsrc, message = '')
-  newtest
-  assert_check(testsrc, message) {|result|
-    if expected_pattern =~ result
-      nil
+
+  def show_progress(message = '')
+    if BT.quiet || BT.wn > 1
+      # do nothing
+    elsif BT.verbose
+      $stderr.print "\##{@id} #{self.path}:#{self.lineno} "
+    elsif BT.tty
+      $stderr.print "#{BT.progress_bs}#{BT.progress[BT_STATE.count % BT.progress.size]}"
+    end
+
+    t = Time.now if BT.verbose
+    faildesc, errout = with_stderr {yield}
+    t = Time.now - t if BT.verbose
+
+    if !faildesc
+      # success
+      if BT.quiet || BT.wn > 1
+        # do nothing
+      elsif BT.tty
+        $stderr.print "#{BT.progress_bs}#{BT.progress[BT_STATE.count % BT.progress.size]}"
+      elsif BT.verbose
+        $stderr.printf(". %.3f\n", t)
+      else
+        BT.putc '.'
+      end
     else
-      desc = "#{expected_pattern.inspect} expected to be =~\n#{result.inspect}"
-      pretty(testsrc, desc, result)
+      $stderr.print "#{BT.failed}F"
+      $stderr.printf(" %.3f", t) if BT.verbose
+      $stderr.print BT.reset
+      $stderr.puts if BT.verbose
+      show_error faildesc, message
+      unless errout.empty?
+        $stderr.print "#{BT.failed}stderr output is not empty#{BT.reset}\n", adjust_indent(errout)
+      end
+
+      if BT.tty and !BT.verbose and BT.wn == 1
+        $stderr.printf("%-*s%s", BT.width, path, BT.progress[BT_STATE.count % BT.progress.size])
+      end
     end
-  }
-end
+  rescue Interrupt
+    $stderr.puts "\##{@id} #{path}:#{lineno}"
+    raise
+  rescue Exception => err
+    $stderr.print 'E'
+    $stderr.puts if BT.verbose
+    show_error err.message, message
+  ensure
+    begin
+      check_coredump
+    rescue CoreDumpError => err
+      $stderr.print 'E'
+      $stderr.puts if BT.verbose
+      show_error err.message, message
+      cleanup_coredump
+    end
+  end
 
-def assert_not_match(unexpected_pattern, testsrc, message = '')
-  newtest
-  assert_check(testsrc, message) {|result|
-    if unexpected_pattern !~ result
-      nil
+  def get_result_string(opt = '', **argh)
+    if BT.ruby
+      filename = make_srcfile(**argh)
+      begin
+        kw = self.err ? {err: self.err} : {}
+        out = IO.popen("#{BT.ruby} -W0 #{opt} #{filename}", **kw)
+        pid = out.pid
+        out.read.tap{ Process.waitpid(pid); out.close }
+      ensure
+        raise Interrupt if $? and $?.signaled? && $?.termsig == Signal.list["INT"]
+
+        begin
+          Process.kill :KILL, pid
+        rescue Errno::ESRCH
+          # OK
+        end
+      end
     else
-      desc = "#{unexpected_pattern.inspect} expected to be !~\n#{result.inspect}"
-      pretty(testsrc, desc, result)
+      eval(src).to_s
     end
-  }
+  end
+
+  def make_srcfile(frozen_string_literal: nil)
+    filename = "bootstraptest.#{self.path}_#{self.lineno}_#{self.id}.rb"
+    File.open(filename, 'w') {|f|
+      f.puts "#frozen_string_literal:true" if frozen_string_literal
+      f.puts "GC.stress = true" if $stress
+      f.puts "print(begin; #{self.src}; end)"
+    }
+    filename
+  end
 end
 
-def assert_valid_syntax(testsrc, message = '')
-  newtest
-  assert_check(testsrc, message, '-c') {|result|
-    result if /Syntax OK/ !~ result
-  }
+def add_assertion src, pr
+  loc = caller_locations(2, 1).first
+  lineno = loc.lineno
+  path = File.basename(loc.path)
+
+  Assertion.new(src, path, lineno, pr)
 end
 
-def assert_normal_exit(testsrc, *rest)
-  newtest
-  opt = {}
-  opt = rest.pop if Hash === rest.last
-  message, ignore_signals = rest
-  message ||= ''
-  timeout = opt[:timeout]
-  show_progress(message) {
-    faildesc = nil
-    filename = make_srcfile(testsrc)
-    old_stderr = $stderr.dup
-    timeout_signaled = false
-    begin
-      $stderr.reopen("assert_normal_exit.log", "w")
-      io = IO.popen("#{@ruby} -W0 #{filename}")
-      pid = io.pid
-      th = Thread.new {
-        io.read
-        io.close
-        $?
-      }
-      if !th.join(timeout)
-        Process.kill :KILL, pid
-        timeout_signaled = true
+def assert_equal(expected, testsrc, message = '', opt = '', **argh)
+  add_assertion testsrc, -> as do
+    as.assert_check(message, opt, **argh) {|result|
+      if expected == result
+        nil
+      else
+        desc = "#{result.inspect} (expected #{expected.inspect})"
+        pretty(testsrc, desc, result)
       end
-      status = th.value
-    ensure
-      $stderr.reopen(old_stderr)
-      old_stderr.close
-    end
-    if status.signaled?
-      signo = status.termsig
-      signame = Signal.list.invert[signo]
-      unless ignore_signals and ignore_signals.include?(signame)
-        sigdesc = "signal #{signo}"
-        if signame
-          sigdesc = "SIG#{signame} (#{sigdesc})"
-        end
-        if timeout_signaled
-          sigdesc << " (timeout)"
+    }
+  end
+end
+
+def assert_match(expected_pattern, testsrc, message = '')
+  add_assertion testsrc, -> as do
+    as.assert_check(message) {|result|
+      if expected_pattern =~ result
+        nil
+      else
+        desc = "#{expected_pattern.inspect} expected to be =~\n#{result.inspect}"
+        pretty(testsrc, desc, result)
+      end
+    }
+  end
+end
+
+def assert_not_match(unexpected_pattern, testsrc, message = '')
+  add_assertion testsrc, -> as do
+    as.assert_check(message) {|result|
+      if unexpected_pattern !~ result
+        nil
+      else
+        desc = "#{unexpected_pattern.inspect} expected to be !~\n#{result.inspect}"
+        pretty(testsrc, desc, result)
+      end
+    }
+  end
+end
+
+def assert_valid_syntax(testsrc, message = '')
+  add_assertion testsrc, -> as do
+    as.assert_check(message, '-c') {|result|
+      result if /Syntax OK/ !~ result
+    }
+  end
+end
+
+def assert_normal_exit(testsrc, *rest, timeout: nil, **opt)
+  add_assertion testsrc, -> as do
+    message, ignore_signals = rest
+    message ||= ''
+    as.show_progress(message) {
+      faildesc = nil
+      filename = as.make_srcfile
+      timeout_signaled = false
+      logfile = "assert_normal_exit.#{as.path}.#{as.lineno}.log"
+
+      begin
+        err = open(logfile, "w")
+        io = IO.popen("#{BT.ruby} -W0 #{filename}", err: err)
+        pid = io.pid
+        th = Thread.new {
+          io.read
+          io.close
+          $?
+        }
+        if !th.join(timeout)
+          Process.kill :KILL, pid
+          timeout_signaled = true
         end
-        faildesc = pretty(testsrc, "killed by #{sigdesc}", nil)
-        stderr_log = File.read("assert_normal_exit.log")
-        if !stderr_log.empty?
-          faildesc << "\n" if /\n\z/ !~ faildesc
-          stderr_log << "\n" if /\n\z/ !~ stderr_log
-          stderr_log.gsub!(/^.*\n/) { '| ' + $& }
-          faildesc << stderr_log
+        status = th.value
+      ensure
+        err.close
+      end
+      if status && status.signaled?
+        signo = status.termsig
+        signame = Signal.list.invert[signo]
+        unless ignore_signals and ignore_signals.include?(signame)
+          sigdesc = "signal #{signo}"
+          if signame
+            sigdesc = "SIG#{signame} (#{sigdesc})"
+          end
+          if timeout_signaled
+            sigdesc << " (timeout)"
+          end
+          faildesc = pretty(testsrc, "killed by #{sigdesc}", nil)
+          stderr_log = File.read(logfile)
+          if !stderr_log.empty?
+            faildesc << "\n" if /\n\z/ !~ faildesc
+            stderr_log << "\n" if /\n\z/ !~ stderr_log
+            stderr_log.gsub!(/^.*\n/) { '| ' + $& }
+            faildesc << stderr_log
+          end
         end
       end
-    end
-    faildesc
-  }
+      faildesc
+    }
+  end
 end
 
 def assert_finish(timeout_seconds, testsrc, message = '')
-  newtest
-  show_progress(message) {
-    faildesc = nil
-    filename = make_srcfile(testsrc)
-    io = IO.popen("#{@ruby} -W0 #{filename}")
-    pid = io.pid
-    waited = false
-    tlimit = Time.now + timeout_seconds
-    while Time.now < tlimit
-      if Process.waitpid pid, Process::WNOHANG
-        waited = true
-        break
-      end
-      sleep 0.1
-    end
-    if !waited
-      Process.kill(:KILL, pid)
-      Process.waitpid pid
-      faildesc = pretty(testsrc, "not finished in #{timeout_seconds} seconds", nil)
+  add_assertion testsrc, -> as do
+    if defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # for --jit-wait
+      timeout_seconds *= 3
     end
-    io.close
-    faildesc
-  }
+
+    as.show_progress(message) {
+      faildesc = nil
+      filename = as.make_srcfile
+      io = IO.popen("#{BT.ruby} -W0 #{filename}", err: as.err)
+      pid = io.pid
+      waited = false
+      tlimit = Time.now + timeout_seconds
+      diff = timeout_seconds
+      while diff > 0
+        if Process.waitpid pid, Process::WNOHANG
+          waited = true
+          break
+        end
+        if io.respond_to?(:read_nonblock)
+          if IO.select([io], nil, nil, diff)
+            begin
+              io.read_nonblock(1024)
+            rescue Errno::EAGAIN, IO::WaitReadable, EOFError
+              break
+            end while true
+          end
+        else
+          sleep 0.1
+        end
+        diff = tlimit - Time.now
+      end
+      if !waited
+        Process.kill(:KILL, pid)
+        Process.waitpid pid
+        faildesc = pretty(testsrc, "not finished in #{timeout_seconds} seconds", nil)
+      end
+      io.close
+      faildesc
+    }
+  end
 end
 
 def flunk(message = '')
-  newtest
-  show_progress('') { message }
+  add_assertion '', -> as do
+    as.show_progress('') { message }
+  end
+end
+
+def show_limit(testsrc, opt = '', **argh)
+  return if BT.quiet
+
+  add_assertion testsrc, -> as do
+    result = as.get_result_string(opt, **argh)
+    Assertion.errbuf << result
+  end
 end
 
 def pretty(src, desc, result)
-  src = src.sub(/\A.*\n/, '')
+  src = src.sub(/\A\s*\n/, '')
   (/\n/ =~ src ? "\n#{adjust_indent(src)}" : src) + "  #=> #{desc}"
 end
 
 INDENT = 27
 
 def adjust_indent(src)
-  untabify(src).gsub(/^ {#{INDENT}}/o, '').gsub(/^/, '   ')
+  untabify(src).gsub(/^ {#{INDENT}}/o, '').gsub(/^/, '   ').sub(/\s*\z/, "\n")
 end
 
 def untabify(str)
   str.gsub(/^\t+/) {' ' * (8 * $&.size) }
 end
 
-def make_srcfile(src)
-  filename = 'bootstraptest.tmp.rb'
-  File.open(filename, 'w') {|f|
-    f.puts "GC.stress = true" if $stress
-    f.puts "print(begin; #{src}; end)"
-  }
-  filename
-end
-
-def get_result_string(src, opt = '')
-  if @ruby
-    filename = make_srcfile(src)
-    begin
-      `#{@ruby} -W0 #{opt} #{filename}`
-    ensure
-      raise Interrupt if $?.signaled? && $?.termsig == Signal.list["INT"]
-      raise CoreDumpError, "core dumped" if $? and $?.coredump?
-    end
-  else
-    eval(src).to_s
-  end
-end
-
-def newtest
-  @location = File.basename(caller(2).first)
-  @count += 1
-  cleanup_coredump
-end
-
-def error(msg, additional_message)
-  @errbuf.push "\##{@count} #{@location}: #{msg}  #{additional_message}"
-  @error += 1
-end
-
 def in_temporary_working_directory(dir)
   if dir
     Dir.mkdir dir
@@ -379,18 +756,32 @@ def in_temporary_working_directory(dir)
 end
 
 def cleanup_coredump
-  FileUtils.rm_f 'core'
+  if File.file?('core')
+    require 'time'
+    Dir.glob('/tmp/bootstraptest-core.*').each do |f|
+      if Time.now - File.mtime(f) > 7 * 24 * 60 * 60 # 7 days
+        warn "Deleting an old core file: #{f}"
+        FileUtils.rm(f)
+      end
+    end
+    core_path = "/tmp/bootstraptest-core.#{Time.now.utc.iso8601}"
+    warn "A core file is found. Saving it at: #{core_path.dump}"
+    FileUtils.mv('core', core_path)
+    cmd = ['gdb', BT.ruby, '-c', core_path, '-ex', 'bt', '-batch']
+    p cmd # debugging why it's not working
+    system(*cmd)
+  end
   FileUtils.rm_f Dir.glob('core.*')
-  FileUtils.rm_f @ruby+'.stackdump' if @ruby
+  FileUtils.rm_f BT.ruby+'.stackdump' if BT.ruby
 end
 
 class CoreDumpError < StandardError; end
 
 def check_coredump
   if File.file?('core') or not Dir.glob('core.*').empty? or
-      (@ruby and File.exist?(@ruby+'.stackdump'))
+      (BT.ruby and File.exist?(BT.ruby+'.stackdump'))
     raise CoreDumpError, "core dumped"
   end
 end
 
-main
+exit main
diff --git a/bootstraptest/test_attr.rb b/bootstraptest/test_attr.rb
index 721a847145..3cb9d3eb39 100644
--- a/bootstraptest/test_attr.rb
+++ b/bootstraptest/test_attr.rb
@@ -34,3 +34,19 @@ assert_equal %{ok}, %{
     print "ok"
   end
 }, '[ruby-core:15120]'
+
+assert_equal %{ok}, %{
+  class Big
+    attr_reader :foo
+    def initialize
+      @foo = "ok"
+    end
+  end
+
+  obj = Big.new
+  100.times do |i|
+    obj.instance_variable_set(:"@ivar_\#{i}", i)
+  end
+
+  Big.new.foo
+}
diff --git a/bootstraptest/test_autoload.rb b/bootstraptest/test_autoload.rb
index e8df6684b6..9e0850bc52 100644
--- a/bootstraptest/test_autoload.rb
+++ b/bootstraptest/test_autoload.rb
@@ -1,7 +1,7 @@
 assert_equal 'ok', %q{
-  File.unlink('zzz.rb') if File.file?('zzz.rb')
+  File.unlink('zzz1.rb') if File.file?('zzz1.rb')
   instance_eval do
-    autoload :ZZZ, './zzz.rb'
+    autoload :ZZZ, './zzz1.rb'
     begin
       ZZZ
     rescue LoadError
@@ -11,9 +11,9 @@ assert_equal 'ok', %q{
 }, '[ruby-dev:43816]'
 
 assert_equal 'ok', %q{
-  open('zzz.rb', 'w') {|f| f.puts '' }
+  open('zzz2.rb', 'w') {|f| f.puts '' }
   instance_eval do
-    autoload :ZZZ, './zzz.rb'
+    autoload :ZZZ, './zzz2.rb'
     begin
       ZZZ
     rescue NameError
@@ -23,69 +23,29 @@ assert_equal 'ok', %q{
 }, '[ruby-dev:43816]'
 
 assert_equal 'ok', %q{
-  open('zzz.rb', 'w') {|f| f.puts 'class ZZZ; def self.ok;:ok;end;end'}
+  open('zzz3.rb', 'w') {|f| f.puts 'class ZZZ; def self.ok;:ok;end;end'}
   instance_eval do
-    autoload :ZZZ, './zzz.rb'
+    autoload :ZZZ, './zzz3.rb'
     ZZZ.ok
   end
 }, '[ruby-dev:43816]'
 
 assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
+  open("zzz4.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
+  autoload :ZZZ, "./zzz4.rb"
   ZZZ.ok
 }
 
 assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
-  require "./zzz.rb"
+  open("zzz5.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
+  autoload :ZZZ, "./zzz5.rb"
+  require "./zzz5.rb"
   ZZZ.ok
 }
 
-assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
-  proc{$SAFE=4; ZZZ.ok}.call
-}
-
-assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
-  require "./zzz.rb"
-  proc{$SAFE=4; ZZZ.ok}.call
-}
-
-assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def hoge;:ok;end;end"}
-  autoload :ZZZ, File.join(Dir.pwd, 'zzz.rb')
-  module M; end
-  Thread.new{M.instance_eval('$SAFE=4; ZZZ.new.hoge')}.value
-}
-
-assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def hoge;:ok;end;end"}
-  autoload :ZZZ, File.join(Dir.pwd, 'zzz.rb')
-  module M; end
-  Thread.new{$SAFE=4; M.instance_eval('ZZZ.new.hoge')}.value
-}
-
-assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def hoge;:ok;end;end"}
-  autoload :ZZZ, File.join(Dir.pwd, 'zzz.rb')
-  Thread.new{$SAFE=4; eval('ZZZ.new.hoge')}.value
-}
-
-assert_equal 'ok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def hoge;:ok;end;end"}
-  autoload :ZZZ, File.join(Dir.pwd, 'zzz.rb')
-  module M; end
-  Thread.new{eval('$SAFE=4; ZZZ.new.hoge')}.value
-}
-
 assert_equal 'okok', %q{
-  open("zzz.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
-  autoload :ZZZ, "./zzz.rb"
+  open("zzz6.rb", "w") {|f| f.puts "class ZZZ; def self.ok;:ok;end;end"}
+  autoload :ZZZ, "./zzz6.rb"
   t1 = Thread.new {ZZZ.ok}
   t2 = Thread.new {ZZZ.ok}
   [t1.value, t2.value].join
@@ -100,9 +60,9 @@ assert_finish 5, %q{
 }, '[ruby-core:21696]'
 
 assert_equal 'A::C', %q{
-  open("zzz.rb", "w") {}
+  open("zzz7.rb", "w") {}
   class A
-    autoload :C, "./zzz"
+    autoload :C, "./zzz7"
     class C
     end
     C
diff --git a/bootstraptest/test_block.rb b/bootstraptest/test_block.rb
index ea6768cc25..cdc5960a59 100644
--- a/bootstraptest/test_block.rb
+++ b/bootstraptest/test_block.rb
@@ -565,3 +565,49 @@ assert_normal_exit %q{
   t.test_for_bug
 }, '[ruby-core:14395]'
 
+assert_equal 'true', %q{
+  class C0
+    def foo
+      block_given?
+    end
+  end
+
+  class C1 < C0
+    def foo
+      super
+    end
+  end
+
+  C1.new.foo{}
+}
+
+assert_equal 'true', %q{
+  class C0
+    def foo
+      block_given?
+    end
+  end
+
+  class C1 < C0
+    def foo
+      super()
+    end
+  end
+
+  C1.new.foo{}
+}
+
+assert_equal 'ok', %q{
+  1.times do
+    begin
+      raise
+    rescue
+      begin
+        raise
+      rescue
+        break
+      end
+    end
+  end
+  'ok'
+}
diff --git a/bootstraptest/test_class.rb b/bootstraptest/test_class.rb
index 664dd2f166..b7fe0a1acd 100644
--- a/bootstraptest/test_class.rb
+++ b/bootstraptest/test_class.rb
@@ -11,6 +11,16 @@ assert_equal 'C',       %q( class C; end
                             C.new.class.name )
 assert_equal 'Class',   %q( class C; end
                             C.new.class.class )
+assert_equal 'true',    %q( Object.__send__(:remove_const, :TrueClass)
+                            GC.start
+                            true.inspect)
+assert_equal 'false',   %q( Object.__send__(:remove_const, :FalseClass)
+                            GC.start
+                            false.inspect)
+assert_equal 'nil',     %q( Object.__send__(:remove_const, :NilClass)
+                            GC.start
+                            nil.inspect)
+
 
 # inherited class
 assert_equal 'true',    %q( class A; end
diff --git a/bootstraptest/test_constant_cache.rb b/bootstraptest/test_constant_cache.rb
new file mode 100644
index 0000000000..1fa83256ed
--- /dev/null
+++ b/bootstraptest/test_constant_cache.rb
@@ -0,0 +1,187 @@
+# Constant lookup is cached.
+assert_equal '1', %q{
+  CONST = 1
+
+  def const
+    CONST
+  end
+
+  const
+  const
+}
+
+# Invalidate when a constant is set.
+assert_equal '2', %q{
+  CONST = 1
+
+  def const
+    CONST
+  end
+
+  const
+
+  CONST = 2
+
+  const
+}
+
+# Invalidate when a constant of the same name is set.
+assert_equal '1', %q{
+  CONST = 1
+
+  def const
+    CONST
+  end
+
+  const
+
+  class Container
+    CONST = 2
+  end
+
+  const
+}
+
+# Invalidate when a constant is removed.
+assert_equal 'missing', %q{
+  class Container
+    CONST = 1
+
+    def const
+      CONST
+    end
+
+    def self.const_missing(name)
+      'missing'
+    end
+
+    new.const
+    remove_const :CONST
+  end
+
+  Container.new.const
+}
+
+# Invalidate when a constant's visibility changes.
+assert_equal 'missing', %q{
+  class Container
+    CONST = 1
+
+    def self.const_missing(name)
+      'missing'
+    end
+  end
+
+  def const
+    Container::CONST
+  end
+
+  const
+
+  Container.private_constant :CONST
+
+  const
+}
+
+# Invalidate when a constant's visibility changes even if the call to the
+# visibility change method fails.
+assert_equal 'missing', %q{
+  class Container
+    CONST1 = 1
+
+    def self.const_missing(name)
+      'missing'
+    end
+  end
+
+  def const1
+    Container::CONST1
+  end
+
+  const1
+
+  begin
+    Container.private_constant :CONST1, :CONST2
+  rescue NameError
+  end
+
+  const1
+}
+
+# Invalidate when a module is included.
+assert_equal 'INCLUDE', %q{
+  module Include
+    CONST = :INCLUDE
+  end
+
+  class Parent
+    CONST = :PARENT
+  end
+
+  class Child < Parent
+    def const
+      CONST
+    end
+
+    new.const
+
+    include Include
+  end
+
+  Child.new.const
+}
+
+# Invalidate when const_missing is hit.
+assert_equal '2', %q{
+  module Container
+    Foo = 1
+    Bar = 2
+
+    class << self
+      attr_accessor :count
+
+      def const_missing(name)
+        @count += 1
+        @count == 1 ? Foo : Bar
+      end
+    end
+
+    @count = 0
+  end
+
+  def const
+    Container::Baz
+  end
+
+  const
+  const
+}
+
+# Invalidate when the iseq gets cleaned up.
+assert_equal '2', %q{
+  CONSTANT = 1
+
+  iseq = RubyVM::InstructionSequence.compile(<<~RUBY)
+    CONSTANT
+  RUBY
+
+  iseq.eval
+  iseq = nil
+
+  GC.start
+  CONSTANT = 2
+}
+
+# Invalidate when the iseq gets cleaned up even if it was never in the cache.
+assert_equal '2', %q{
+  CONSTANT = 1
+
+  iseq = RubyVM::InstructionSequence.compile(<<~RUBY)
+    CONSTANT
+  RUBY
+
+  iseq = nil
+
+  GC.start
+  CONSTANT = 2
+}
diff --git a/bootstraptest/test_env.rb b/bootstraptest/test_env.rb
new file mode 100644
index 0000000000..7d1b45b75e
--- /dev/null
+++ b/bootstraptest/test_env.rb
@@ -0,0 +1,12 @@
+assert_equal "true", %q{
+  ENV["ENVTEST"] = "\u{e9 3042 d76c}"
+  env = ENV["ENVTEST"]
+  env.valid_encoding?
+}
+
+# different encoding is used for PATH
+assert_equal "true", %q{
+  ENV["PATH"] = "\u{e9 3042 d76c}"
+  env = ENV["PATH"]
+  env.valid_encoding?
+}
diff --git a/bootstraptest/test_eval.rb b/bootstraptest/test_eval.rb
index c347d50ac9..a9f389c673 100644
--- a/bootstraptest/test_eval.rb
+++ b/bootstraptest/test_eval.rb
@@ -109,13 +109,40 @@ assert_equal %q{foo}, %q{
   }
 }
 assert_equal %q{1}, %q{
-  class Fixnum
+  class Integer
     Const = 1
   end
   1.instance_eval %{
     Const
   }
 }
+assert_equal %q{1}, %q{
+  class TrueClass
+    Const = 1
+  end
+  true.instance_eval %{
+    Const
+  }
+}
+assert_equal %q{[:Const]}, %q{
+  mod = Module.new
+  mod.instance_eval %{
+    Const = 1
+  }
+  raise if defined?(Module::Const)
+  mod.singleton_class.constants
+}
+assert_equal %q{can't define singleton}, %q{
+  begin
+    123.instance_eval %{
+      Const = 1
+    }
+    "bad"
+  rescue TypeError => e
+    raise "bad" if defined?(Integer::Const)
+    e.message
+  end
+}
 assert_equal %q{top}, %q{
   Const = :top
   class C
@@ -190,7 +217,8 @@ assert_equal %q{[10, main]}, %q{
 }
 
 %w[break next redo].each do |keyword|
-  assert_match %r"Can't escape from eval with #{keyword}\z", %{
+  assert_match %r"Can't escape from eval with #{keyword}\b", %{
+    $stderr = STDOUT
     begin
       eval "0 rescue #{keyword}"
     rescue SyntaxError => e
@@ -200,7 +228,7 @@ assert_equal %q{[10, main]}, %q{
 end
 
 assert_normal_exit %q{
-  STDERR.reopen(STDOUT)
+  $stderr = STDOUT
   class Foo
      def self.add_method
        class_eval("def some-bad-name; puts 'hello' unless @some_variable.some_function(''); end")
@@ -249,7 +277,9 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   begin
-    12.instance_eval { @@a }
+    class A
+      12.instance_eval { @@a }
+    end
   rescue NameError
     :ok
   end
@@ -257,31 +287,27 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   begin
-    12.instance_exec { @@a }
+    class A
+      12.instance_exec { @@a }
+    end
   rescue NameError
     :ok
   end
 }, '[ruby-core:16794]'
 
 assert_equal 'ok', %q{
-  begin
-    nil.instance_eval {
-      def a() :a end
-    }
-  rescue TypeError
-    :ok
-  end
-}, '[ruby-core:16796]'
+  nil.instance_eval {
+    def defd_using_instance_eval() :ok end
+  }
+  nil.defd_using_instance_eval
+}, '[ruby-core:28324]'
 
 assert_equal 'ok', %q{
-  begin
-    nil.instance_exec {
-      def a() :a end
-    }
-  rescue TypeError
-    :ok
-  end
-}, '[ruby-core:16796]'
+  nil.instance_exec {
+    def defd_using_instance_exec() :ok end
+  }
+  nil.defd_using_instance_exec
+}, '[ruby-core:28324]'
 
 assert_normal_exit %q{
   eval("", method(:proc).call {}.binding)
@@ -316,6 +342,15 @@ assert_normal_exit %q{
   end
   begin
     eval "class C; @@h = #{hash.inspect}; end"
-  rescue SystemStackError
   end
 }, '[ruby-core:25714]'
+
+assert_normal_exit %q{
+  begin
+    eval("# encoding:utf-16le\nfoo")
+  rescue Exception => e
+    p e
+    RubyVM::InstructionSequence.compile("p:hello")
+  end
+}, 'check escaping the internal value th->base_block'
+
diff --git a/bootstraptest/test_exception.rb b/bootstraptest/test_exception.rb
index f7d5eeaa07..0fb6f552b8 100644
--- a/bootstraptest/test_exception.rb
+++ b/bootstraptest/test_exception.rb
@@ -402,7 +402,7 @@ assert_equal 'nil', %q{
   exc.inspect
 }, '[ruby-dev:32608]'
 
-assert_equal 'exception class/object expected', %q{
+assert_equal 'divided by 0', %q{
   class ZeroDivisionError
     def self.new(message)
       42
@@ -414,3 +414,19 @@ assert_equal 'exception class/object expected', %q{
     e.message
   end
 }, '[ruby-core:24767]'
+
+assert_equal 'ok', %q{
+  class C
+    def ===(o)
+      true
+    end
+  end
+  begin
+    begin
+      raise
+    rescue C.new
+    end
+  rescue TypeError
+    :ok
+  end
+}
diff --git a/bootstraptest/test_fiber.rb b/bootstraptest/test_fiber.rb
new file mode 100644
index 0000000000..2614dd13bf
--- /dev/null
+++ b/bootstraptest/test_fiber.rb
@@ -0,0 +1,39 @@
+show_limit %q{
+  fibers = []
+  begin
+    fiber = Fiber.new{Fiber.yield}
+    fiber.resume
+    fibers << fiber
+
+    raise Exception, "skipping" if fibers.count >= 10_000
+  rescue Exception => error
+    puts "Fiber count: #{fibers.count} (#{error})"
+    break
+  end while true
+}
+
+assert_equal %q{ok}, %q{
+  Fiber.new{
+  }.resume
+  :ok
+}
+
+assert_equal %q{ok}, %q{
+  100.times.collect{Fiber.new{}}
+  :ok
+}
+
+assert_equal %q{ok}, %q{
+  fibers = 1000.times.collect{Fiber.new{Fiber.yield}}
+  fibers.each(&:resume)
+  fibers.each(&:resume)
+  :ok
+}
+
+assert_normal_exit %q{
+  at_exit { Fiber.new{}.resume }
+}
+
+assert_normal_exit %q{
+  Fiber.new(&Object.method(:class_eval)).resume("foo")
+}, '[ruby-dev:34128]'
diff --git a/bootstraptest/test_flow.rb b/bootstraptest/test_flow.rb
index d40d814fbc..35f19db588 100644
--- a/bootstraptest/test_flow.rb
+++ b/bootstraptest/test_flow.rb
@@ -534,18 +534,68 @@ assert_equal %Q{ENSURE\n}, %q{
  ['[ruby-core:39125]', %q{
   class Bug5234
     include Enumerable
-    def each
+    def each(&block)
       begin
         yield :foo
       ensure
-        proc
+        proc(&block)
       end
     end
   end
   e = Bug5234.new
+}],
+ ['[ruby-dev:45656]', %q{
+  class Bug6460
+    include Enumerable
+    def each(&block)
+      begin
+        yield :foo
+      ensure
+        1.times { Proc.new(&block) }
+      end
+    end
+  end
+  e = Bug6460.new
 }]].each do |bug, src|
   assert_equal "foo", src + %q{e.detect {true}}, bug
   assert_equal "true", src + %q{e.any? {true}}, bug
   assert_equal "false", src + %q{e.all? {false}}, bug
   assert_equal "true", src + %q{e.include?(:foo)}, bug
 end
+
+assert_equal "foo", %q{
+  class Bug6460
+    def m1
+      m2 {|e|
+        return e
+      }
+    end
+
+    def m2
+      begin
+        yield :foo
+      ensure
+        begin
+          begin
+            yield :foo
+          ensure
+            Proc.new
+            raise ''
+          end
+        rescue
+        end
+      end
+    end
+  end
+  Bug6460.new.m1
+}, '[ruby-dev:46372]'
+
+assert_equal "foo", %q{
+  obj = "foo"
+  if obj || any1
+    any2 = any2
+  else
+    raise obj.inspect
+  end
+  obj
+}, '[ruby-core:87830]'
diff --git a/bootstraptest/test_fork.rb b/bootstraptest/test_fork.rb
index 384294727f..83923dad97 100644
--- a/bootstraptest/test_fork.rb
+++ b/bootstraptest/test_fork.rb
@@ -21,27 +21,35 @@ assert_finish 10, %q{
   end
 }, '[ruby-core:22158]'
 
-assert_normal_exit(<<'End', '[ruby-dev:37934]')
-  Thread.new { sleep 1; Thread.kill Thread.main }
-  Process.setrlimit(:NPROC, 1)
+# temporarily stop this test to enable explicit failure when
+# timer thread couldn't be created (r61706 and r61717).
+assert_normal_exit(<<'End', '[ruby-dev:37934]') if false
+  main = Thread.current
+  Thread.new { sleep 0.01 until main.stop?; Thread.kill main }
+  Process.setrlimit(:NPROC, 1) if defined?(Process::RLIMIT_NPROC)
   fork {}
 End
 
 assert_equal 'ok', %q{
   begin
+    r, w = IO.pipe
     if pid1 = fork
-      sleep 1
+      w.close
+      r.read(1)
       Process.kill("USR1", pid1)
       _, s = Process.wait2(pid1)
       s.success? ? :ok : :ng
     else
+      r.close
       if pid2 = fork
-        trap("USR1") { Time.now.to_s }
+        trap("USR1") { Time.now.to_s; Process.kill("USR2", pid2) }
+        w.close
         Process.wait2(pid2)
       else
-        sleep 2
+        w.close
+        sleep 0.2
       end
-      exit 0
+      exit true
     end
   rescue NotImplementedError
     :ok
@@ -50,17 +58,17 @@ assert_equal 'ok', %q{
 
 assert_equal '[1, 2]', %q{
   a = []
-  trap(:INT) { a.push(1) }
-  trap(:TERM) { a.push(2) }
+  main = Thread.current
+  trap(:INT) { a.push(1).size == 2 and main.wakeup }
+  trap(:TERM) { a.push(2).size == 2 and main.wakeup }
   pid = $$
   begin
-    fork do
-      sleep 0.5
+    pid = fork do
       Process.kill(:INT, pid)
       Process.kill(:TERM, pid)
     end
-
-    sleep 1
+    Process.wait(pid)
+    100.times {break if a.size > 1; sleep 0.001}
     a.sort
   rescue NotImplementedError
     [1, 2]
diff --git a/bootstraptest/test_insns.rb b/bootstraptest/test_insns.rb
new file mode 100644
index 0000000000..91fba9b011
--- /dev/null
+++ b/bootstraptest/test_insns.rb
@@ -0,0 +1,440 @@
+# C0 coverage of each instructions
+
+# :NOTE: This is for development purpose; never consider this file as
+# ISeq compilation specification.
+
+begin
+  # This library brings some additional coverage.
+  # Not mandatory.
+  require 'rbconfig/sizeof'
+rescue LoadError
+  # OK, just skip
+else
+  if defined? RbConfig::LIMITS
+    $FIXNUM_MAX = RbConfig::LIMITS["FIXNUM_MAX"]
+    $FIXNUM_MIN = RbConfig::LIMITS["FIXNUM_MIN"]
+  end
+end
+
+fsl   = { frozen_string_literal: true } # used later
+tests = [
+  # insn ,   expression to generate such insn
+  [ 'nop',   %q{ raise rescue true }, ],
+
+  [ 'setlocal *, 0', %q{ x = true }, ],
+  [ 'setlocal *, 1', %q{ x = nil; -> { x = true }.call }, ],
+  [ 'setlocal',      %q{ x = nil; -> { -> { x = true }.() }.() }, ],
+  [ 'getlocal *, 0', %q{ x = true; x }, ],
+  [ 'getlocal *, 1', %q{ x = true; -> { x }.call }, ],
+  [ 'getlocal',      %q{ x = true; -> { -> { x }.() }.() }, ],
+
+  [ 'setblockparam', <<-'},', ], # {
+    def m&b
+      b = # here
+        proc { true }
+    end
+    m { false }.call
+  },
+  [ 'getblockparam', <<-'},', ], # {
+    def m&b
+      b # here
+    end
+    m { true }.call
+  },
+  [ 'getblockparamproxy', <<-'},', ], # {
+    def m&b
+      b # here
+        .call
+    end
+    m { true }
+  },
+
+  [ 'setspecial', %q{ true if true..true }, ],
+  [ 'getspecial', %q{ $&.nil? }, ],
+  [ 'getspecial', %q{ $`.nil? }, ],
+  [ 'getspecial', %q{ $'.nil? }, ],
+  [ 'getspecial', %q{ $+.nil? }, ],
+  [ 'getspecial', %q{ $1.nil? }, ],
+  [ 'getspecial', %q{ $128.nil? }, ],
+
+  [ 'getglobal', %q{ String === $0 }, ],
+  [ 'getglobal', %q{ $_.nil? }, ],
+  [ 'setglobal', %q{ $0 = "true" }, ],
+
+  [ 'setinstancevariable', %q{ @x = true }, ],
+  [ 'getinstancevariable', %q{ @x = true; @x }, ],
+
+  [ 'setclassvariable', %q{ class A; @@x = true; end }, ],
+  [ 'getclassvariable', %q{ class A; @@x = true; @@x end }, ],
+
+  [ 'setconstant', %q{ X = true }, ],
+  [ 'setconstant', %q{ Object::X = true }, ],
+  [ 'getconstant', %q{ X = true; X }, ],
+  [ 'getconstant', %q{ X = true; Object::X }, ],
+
+  [ 'getinlinecache / setinlinecache', %q{ def x; X; end; X = true; x; x; x }, ],
+
+  [ 'putnil',               %q{ $~ == nil }, ],
+  [ 'putself',              %q{ $~ != self }, ],
+  [ 'putobject INT2FIX(0)', %q{ $~ != 0 }, ],
+  [ 'putobject INT2FIX(1)', %q{ $~ != 1 }, ],
+  [ 'putobject',            %q{ $~ != -1 }, ],
+  [ 'putobject',            %q{ $~ != /x/ }, ],
+  [ 'putobject',            %q{ $~ != :x }, ],
+  [ 'putobject',            %q{ $~ != (1..2) }, ],
+  [ 'putobject',            %q{ $~ != true }, ],
+  [ 'putobject',            %q{ /(?<x>x)/ =~ "x"; x == "x" }, ],
+
+  [ 'putspecialobject',         %q{ {//=>true}[//] }, ],
+  [ 'putstring',                %q{ "true" }, ],
+  [ 'tostring / concatstrings', %q{ "#{true}" }, ],
+  [ 'toregexp',                 %q{ /#{true}/ =~ "true" && $~ }, ],
+  [ 'intern',                   %q{ :"#{true}" }, ],
+
+  [ 'newarray',    %q{ ["true"][0] }, ],
+  [ 'newarraykwsplat', %q{ [**{x:'true'}][0][:x] }, ],
+  [ 'duparray',    %q{ [ true ][0] }, ],
+  [ 'expandarray', %q{ y = [ true, false, nil ]; x, = y; x }, ],
+  [ 'expandarray', %q{ y = [ true, false, nil ]; x, *z = y; x }, ],
+  [ 'expandarray', %q{ y = [ true, false, nil ]; x, *z, w = y; x }, ],
+  [ 'splatarray',  %q{ x, = *(y = true), false; x }, ],
+  [ 'concatarray', %q{ ["t", "r", *x = "u", "e"].join }, ],
+  [ 'concatarray', <<-'},', ],  # {
+    class X; def to_a; ['u']; end; end
+    ['t', 'r', *X.new, 'e'].join
+  },
+  [ 'concatarray', <<-'},', ],  # {
+    r = false
+    t = [true, nil]
+    q, w, e = r, *t             # here
+    w
+  },
+
+  [ 'newhash',  %q{ x = {}; x[x] = true }, ],
+  [ 'newhash',  %q{ x = true; { x => x }[x] }, ],
+  [ 'newhashfromarray', %q{ { a: true }[:a] }, ],
+  [ 'newrange', %q{ x = 1; [*(0..x)][0] == 0 }, ],
+  [ 'newrange', %q{ x = 1; [*(0...x)][0] == 0 }, ],
+
+  [ 'pop',     %q{ def x; true; end; x }, ],
+  [ 'dup',     %q{ x = y = true; x }, ],
+  [ 'dupn',    %q{ Object::X ||= true }, ],
+  [ 'reverse', %q{ q, (w, e), r = 1, [2, 3], 4; e == 3 }, ],
+  [ 'swap',    %q{ !!defined?([[]]) }, ],
+  [ 'swap',    <<-'},', ],      # {
+    x = [[false, true]]
+    for i, j in x               # here
+      ;
+    end
+    j
+  },
+
+  [ 'topn',        %q{ x, y = [], 0; x[*y], = [true, false]; x[0] }, ],
+  [ 'setn',        %q{ x, y = [], 0; x[*y]  =  true        ; x[0] }, ],
+  [ 'adjuststack', %q{ x = [true]; x[0] ||= nil; x[0] }, ],
+
+  [ 'defined',      %q{ !defined?(x) }, ],
+  [ 'checkkeyword', %q{ def x x:rand;x end; x x: true }, ],
+  [ 'checktype',    %q{ x = true; "#{x}" }, ],
+  [ 'checkmatch',   <<-'},', ], # {
+    x = y = true
+    case x
+    when false
+      y = false
+    when true                   # here
+      y = nil
+    end
+    y == nil
+  },
+  [ 'checkmatch',   <<-'},', ], # {
+    x, y = true, [false]
+    case x
+    when *y                     # here
+      z = false
+    else
+      z = true
+    end
+    z
+  },
+  [ 'checkmatch',   <<-'},', ], # {
+    x = false
+    begin
+      raise
+    rescue                      # here
+      x = true
+    end
+    x
+  },
+
+  [ 'defineclass', %q{                 module X;    true end }, ],
+  [ 'defineclass', %q{ X = Module.new; module X;    true end }, ],
+  [ 'defineclass', %q{                 class X;     true end }, ],
+  [ 'defineclass', %q{ X = Class.new;  class X;     true end }, ],
+  [ 'defineclass', %q{ X = Class.new;  class Y < X; true end }, ],
+  [ 'defineclass', %q{ X = Class.new;  class << X;  true end }, ],
+  [ 'defineclass', <<-'},', ], # {
+    X = Class.new
+    Y = Class.new(X)
+    class Y < X
+      true
+    end
+  },
+
+  [ 'opt_send_without_block', %q{ true.to_s }, ],
+  [ 'send',                   %q{ true.tap {|i| i.to_s } }, ],
+  [ 'leave',                  %q{ def x; true; end; x }, ],
+  [ 'invokesuper',            <<-'},', ], # {
+    class X < String
+      def empty?
+        super                   # here
+      end
+    end
+   X.new.empty?
+  },
+  [ 'invokeblock',            <<-'},', ], # {
+    def x
+      return yield self         # here
+    end
+    x do
+      true
+    end
+  },
+
+  [ 'opt_str_freeze', %q{ 'true'.freeze }, ],
+  [ 'opt_nil_p',      %q{ nil.nil? }, ],
+  [ 'opt_nil_p',      %q{ !Object.nil? }, ],
+  [ 'opt_nil_p',      %q{ Class.new{def nil?; true end}.new.nil? }, ],
+  [ 'opt_str_uminus', %q{ -'true' }, ],
+  [ 'opt_str_freeze', <<-'},', ], # {
+    class String
+      def freeze
+        true
+      end
+    end
+    'true'.freeze
+  },
+
+  [ 'opt_newarray_max', %q{ [ ].max.nil? }, ],
+  [ 'opt_newarray_max', %q{ [1, x = 2, 3].max == 3 }, ],
+  [ 'opt_newarray_max', <<-'},', ], # {
+    class Array
+      def max
+        true
+      end
+    end
+    [1, x = 2, 3].max
+  },
+  [ 'opt_newarray_min', %q{ [ ].min.nil? }, ],
+  [ 'opt_newarray_min', %q{ [3, x = 2, 1].min == 1 }, ],
+  [ 'opt_newarray_min', <<-'},', ], # {
+    class Array
+      def min
+        true
+      end
+    end
+    [3, x = 2, 1].min
+  },
+
+  [ 'throw',        %q{ false.tap { break true } }, ],
+  [ 'branchif',     %q{ x = nil;  x ||= true }, ],
+  [ 'branchif',     %q{ x = true; x ||= nil; x }, ],
+  [ 'branchunless', %q{ x = 1;    x &&= true }, ],
+  [ 'branchunless', %q{ x = nil;  x &&= true; x.nil? }, ],
+  [ 'branchnil',    %q{ x = true; x&.to_s }, ],
+  [ 'branchnil',    %q{ x = nil;  (x&.to_s).nil? }, ],
+  [ 'jump',         <<-'},', ], # {
+    y = 1
+    x = if y == 0 then nil elsif y == 1 then true else nil end
+    x
+  },
+  [ 'jump',         <<-'},', ], # {
+    # ultra complicated situation: this ||= assignment only generates
+    # 15 instructions, not including the class definition.
+    class X; attr_accessor :x; end
+    x = X.new
+    x&.x ||= true               # here
+  },
+
+  [ 'once', %q{ /#{true}/o =~ "true" && $~ }, ],
+  [ 'once', <<-'},', ],         # {
+    def once expr
+      return /#{expr}/o         # here
+    end
+    x = once(true); x = once(false); x = once(nil);
+    x =~ "true" && $~
+  },
+  [ 'once', <<-'},', ],         # {
+    # recursive once
+    def once n
+      return %r/#{
+        if n == 0
+          true
+        else
+          once(n-1)             # here
+        end
+      }/ox
+    end
+    x = once(128); x = once(7); x = once(16);
+    x =~ "true" && $~
+  },
+  [ 'once', <<-'},', ],         # {
+    # inter-thread lockup situation
+    def once n
+      return Thread.start n do |m|
+        Thread.pass
+        next %r/#{
+          sleep m               # here
+          true
+        }/ox
+      end
+    end
+    x = once(1); y = once(0.1); z = y.value
+    z =~ "true" && $~
+  },
+
+  [ 'opt_case_dispatch', %q{ case   0 when 1.1 then false else true end }, ],
+  [ 'opt_case_dispatch', %q{ case 1.0 when 1.1 then false else true end }, ],
+
+  [ 'opt_plus',    %q{ 1 + 1 == 2 }, ],
+  if defined? $FIXNUM_MAX then
+    [ 'opt_plus',  %Q{ #{ $FIXNUM_MAX } + 1 == #{ $FIXNUM_MAX + 1 } }, ]
+  end,
+  [ 'opt_plus',    %q{ 1.0 + 1.0 == 2.0 }, ],
+  [ 'opt_plus',    %q{ x = +0.0.next_float; x + x >= x }, ],
+  [ 'opt_plus',    %q{ 't' + 'rue' }, ],
+  [ 'opt_plus',    %q{ ( ['t'] + ['r', ['u', ['e'], ], ] ).join }, ],
+  [ 'opt_plus',    %q{ Time.at(1) + 1 == Time.at(2) }, ],
+  [ 'opt_minus',   %q{ 1 - 1 == 0 }, ],
+  if defined? $FIXNUM_MIN then
+    [ 'opt_minus', %Q{ #{ $FIXNUM_MIN } - 1 == #{ $FIXNUM_MIN - 1 } }, ]
+  end,
+  [ 'opt_minus',   %q{ 1.0 - 1.0 == 0.0 }, ],
+  [ 'opt_minus',   %q{ x = -0.0.prev_float; x - x == 0.0 }, ],
+  [ 'opt_minus',   %q{ ( [false, true] - [false] )[0] }, ],
+  [ 'opt_mult',    %q{ 1 * 1 == 1 }, ],
+  [ 'opt_mult',    %q{ 1.0 * 1.0 == 1.0 }, ],
+  [ 'opt_mult',    %q{ x = +0.0.next_float; x * x <= x }, ],
+  [ 'opt_mult',    %q{ ( "ruet" * 3 )[7,4] }, ],
+  [ 'opt_div',     %q{ 1 / 1 == 1 }, ],
+  [ 'opt_div',     %q{ 1.0 / 1.0 == 1.0 }, ],
+  [ 'opt_div',     %q{ x = +0.0.next_float; x / x >= x }, ],
+  [ 'opt_div',     %q{ x = 1/2r; x / x == 1 }, ],
+  [ 'opt_mod',     %q{ 1 % 1 == 0 }, ],
+  [ 'opt_mod',     %q{ 1.0 % 1.0 == 0.0 }, ],
+  [ 'opt_mod',     %q{ x = +0.0.next_float; x % x == 0.0 }, ],
+  [ 'opt_mod',     %q{ '%s' % [ true ] }, ],
+
+  [ 'opt_eq', %q{ 1 == 1 }, ],
+  [ 'opt_eq', <<-'},', ],       # {
+    class X; def == other; true; end; end
+    X.new == true
+  },
+  [ 'opt_neq', %q{ 1 != 0 }, ],
+  [ 'opt_neq', <<-'},', ],       # {
+    class X; def != other; true; end; end
+    X.new != true
+  },
+
+  [ 'opt_lt', %q{            -1   <  0 }, ],
+  [ 'opt_lt', %q{            -1.0 <  0.0 }, ],
+  [ 'opt_lt', %q{ -0.0.prev_float <  0.0 }, ],
+  [ 'opt_lt', %q{              ?a <  ?z }, ],
+  [ 'opt_le', %q{            -1   <= 0 }, ],
+  [ 'opt_le', %q{            -1.0 <= 0.0 }, ],
+  [ 'opt_le', %q{ -0.0.prev_float <= 0.0 }, ],
+  [ 'opt_le', %q{              ?a <= ?z }, ],
+  [ 'opt_gt', %q{             1   >  0 }, ],
+  [ 'opt_gt', %q{             1.0 >  0.0 }, ],
+  [ 'opt_gt', %q{ +0.0.next_float >  0.0 }, ],
+  [ 'opt_gt', %q{              ?z >  ?a }, ],
+  [ 'opt_ge', %q{             1   >= 0 }, ],
+  [ 'opt_ge', %q{             1.0 >= 0.0 }, ],
+  [ 'opt_ge', %q{ +0.0.next_float >= 0.0 }, ],
+  [ 'opt_ge', %q{              ?z >= ?a }, ],
+
+  [ 'opt_ltlt', %q{  '' << 'true' }, ],
+  [ 'opt_ltlt', %q{ ([] << 'true').join }, ],
+  [ 'opt_ltlt', %q{ (1 << 31) == 2147483648 }, ],
+
+  [ 'opt_aref', %q{ ['true'][0] }, ],
+  [ 'opt_aref', %q{ { 0 => 'true'}[0] }, ],
+  [ 'opt_aref', %q{ 'true'[0] == ?t }, ],
+  [ 'opt_aset', %q{ [][0] = true }, ],
+  [ 'opt_aset', %q{ {}[0] = true }, ],
+  [ 'opt_aset', %q{ x = 'frue'; x[0] = 't'; x }, ],
+  [ 'opt_aset', <<-'},', ], # {
+    # opt_aref / opt_aset mixup situation
+    class X; def x; {}; end; end
+    x = X.new
+    x&.x[true] ||= true         # here
+  },
+
+  [ 'opt_aref_with', %q{ { 'true' => true }['true'] }, ],
+  [ 'opt_aref_with', %q{ Struct.new(:nil).new['nil'].nil? }, ],
+  [ 'opt_aset_with', %q{ {}['true'] = true }, ],
+  [ 'opt_aset_with', %q{ Struct.new(:true).new['true'] = true }, ],
+
+  [ 'opt_length',  %q{   'true'       .length == 4 }, ],
+  [ 'opt_length',  %q{   :true        .length == 4 }, ],
+  [ 'opt_length',  %q{ [ 'true' ]     .length == 1 }, ],
+  [ 'opt_length',  %q{ { 'true' => 1 }.length == 1 }, ],
+  [ 'opt_size',    %q{   'true'       .size   == 4 }, ],
+  [ 'opt_size',    %q{               1.size   >= 4 }, ],
+  [ 'opt_size',    %q{ [ 'true' ]     .size   == 1 }, ],
+  [ 'opt_size',    %q{ { 'true' => 1 }.size   == 1 }, ],
+  [ 'opt_empty_p', %q{ ''.empty? }, ],
+  [ 'opt_empty_p', %q{ [].empty? }, ],
+  [ 'opt_empty_p', %q{ {}.empty? }, ],
+  [ 'opt_empty_p', %q{ Thread::Queue.new.empty? }, ],
+
+  [ 'opt_succ',  %q{ 1.succ == 2 }, ],
+  if defined? $FIXNUM_MAX then
+    [ 'opt_succ',%Q{ #{ $FIXNUM_MAX }.succ == #{ $FIXNUM_MAX + 1 } }, ]
+  end,
+  [ 'opt_succ',  %q{ '1'.succ == '2' }, ],
+
+  [ 'opt_not',  %q{ ! false }, ],
+  [ 'opt_neq', <<-'},', ],       # {
+    class X; def !; true; end; end
+    ! X.new
+  },
+
+  [ 'opt_regexpmatch2',  %q{ /true/ =~ 'true' && $~ }, ],
+  [ 'opt_regexpmatch2', <<-'},', ],       # {
+    class Regexp; def =~ other; true; end; end
+    /true/ =~ 'true'
+  },
+  [ 'opt_regexpmatch2',  %q{ 'true' =~ /true/ && $~ }, ],
+  [ 'opt_regexpmatch2', <<-'},', ],       # {
+    class String; def =~ other; true; end; end
+    'true' =~ /true/
+  },
+]
+
+# normal path
+tests.compact.each do |(insn, expr, *a)|
+  if a.last.is_a?(Hash)
+    a = a.dup
+    kw = a.pop
+    assert_equal 'true', expr, insn, *a, **kw
+  else
+    assert_equal 'true', expr, insn, *a
+  end
+end
+
+# with trace
+tests.compact.each {|(insn, expr, *a)|
+  progn = "set_trace_func(proc{})\n" + expr
+  if a.last.is_a?(Hash)
+    a = a.dup
+    kw = a.pop
+    assert_equal 'true', progn, 'trace_' + insn, *a, **kw
+  else
+    assert_equal 'true', progn, 'trace_' + insn, *a
+  end
+}
+
+assert_normal_exit("#{<<-"begin;"}\n#{<<-'end;'}")
+begin;
+  RubyVM::InstructionSequence.compile("", debug_level: 5)
+end;
diff --git a/bootstraptest/test_io.rb b/bootstraptest/test_io.rb
index 7304aebc26..666e5a011b 100644
--- a/bootstraptest/test_io.rb
+++ b/bootstraptest/test_io.rb
@@ -1,10 +1,10 @@
+/freebsd/ =~ RUBY_PLATFORM or
 assert_finish 5, %q{
   r, w = IO.pipe
   t1 = Thread.new { r.sysread(1) }
   t2 = Thread.new { r.sysread(1) }
-  sleep 0.1
+  sleep 0.01 until t1.stop? and t2.stop?
   w.write "a"
-  sleep 0.1
   w.write "a"
 }, '[ruby-dev:31866]'
 
@@ -27,16 +27,17 @@ assert_finish 10, %q{
       t1.join
       t2.join
     end
-  rescue LoadError, TimeoutError, NotImplementedError
+  rescue LoadError, Timeout::Error, NotImplementedError
   end
 }, '[ruby-dev:32566]'
 
-assert_finish 1, %q{
+/freebsd/ =~ RUBY_PLATFORM or
+assert_finish 5, %q{
   r, w = IO.pipe
   Thread.new {
-  w << "ab"
-  sleep 0.1
-  w << "ab"
+    w << "ab"
+    sleep 0.01
+    w << "ab"
   }
   r.gets("abab")
 }
@@ -74,10 +75,17 @@ assert_equal 'ok', %q{
   :ok
 }
 
+assert_equal 'ok', %q{
+  dup = STDIN.dup
+  dupfd = dup.fileno
+  dupfd == STDIN.dup.fileno ? :ng : :ok
+}, '[ruby-dev:46834]'
+
 assert_normal_exit %q{
   ARGF.set_encoding "foo"
 }
 
+/freebsd/ =~ RUBY_PLATFORM or
 10.times do
   assert_normal_exit %q{
     at_exit { p :foo }
@@ -85,7 +93,8 @@ assert_normal_exit %q{
     megacontent = "abc" * 12345678
     #File.open("megasrc", "w") {|f| f << megacontent }
 
-    Thread.new { sleep rand*0.2; Process.kill(:INT, $$) }
+    t0 = Thread.main
+    Thread.new { sleep 0.001 until t0.stop?; Process.kill(:INT, $$) }
 
     r1, w1 = IO.pipe
     r2, w2 = IO.pipe
diff --git a/bootstraptest/test_jump.rb b/bootstraptest/test_jump.rb
index 595aaa7c4b..d07c47a56d 100644
--- a/bootstraptest/test_jump.rb
+++ b/bootstraptest/test_jump.rb
@@ -146,15 +146,16 @@ assert_equal %q{131}, %q{
     end
   }
 }
-assert_equal %q{ok}, %q{
+assert_match %r{Invalid retry}, %q{
+$stderr = STDOUT
 begin
   eval %q{
     1.times{
       retry
     }
   }
-rescue SyntaxError
-  :ok
+rescue SyntaxError => e
+  e.message
 end
 }
 assert_equal %q{3}, %q{
@@ -295,14 +296,19 @@ assert_equal "true", %q{
   s.return_eigenclass == class << s; self; end
 }, '[ruby-core:21379]'
 
-assert_equal "true", %q{
-  class Object
-    def yield_eigenclass
-      class << self
-        yield self
+assert_match %r{Invalid yield}, %q{
+$stderr = STDOUT
+begin
+  eval %q{
+    class Object
+      def yield_eigenclass
+        class << self
+          yield self
+        end
       end
     end
-  end
-  s = "foo"
-  s.yield_eigenclass {|c| c == class << s; self; end }
-}, '[ruby-dev:40975]'
+  }
+rescue SyntaxError => e
+  e.message
+end
+}
diff --git a/bootstraptest/test_literal.rb b/bootstraptest/test_literal.rb
index ab028e2c1e..a0d4ee08c6 100644
--- a/bootstraptest/test_literal.rb
+++ b/bootstraptest/test_literal.rb
@@ -15,17 +15,17 @@ assert_equal 'sym',             ':sym'
 assert_equal ':sym',            ':sym.inspect'
 assert_equal 'Symbol',          ':sym.class'
 assert_equal '1234',            '1234'
-assert_equal 'Fixnum',          '1234.class'
+assert_equal 'Integer',         '1234.class'
 assert_equal '1234',            '1_2_3_4'
-assert_equal 'Fixnum',          '1_2_3_4.class'
+assert_equal 'Integer',         '1_2_3_4.class'
 assert_equal '18',              '0x12'
-assert_equal 'Fixnum',          '0x12.class'
+assert_equal 'Integer',         '0x12.class'
 assert_equal '15',              '0o17'
-assert_equal 'Fixnum',          '0o17.class'
+assert_equal 'Integer',         '0o17.class'
 assert_equal '5',               '0b101'
-assert_equal 'Fixnum',          '0b101.class'
+assert_equal 'Integer',         '0b101.class'
 assert_equal '123456789012345678901234567890', '123456789012345678901234567890'
-assert_equal 'Bignum',          '123456789012345678901234567890.class'
+assert_equal 'Integer',         '123456789012345678901234567890.class'
 assert_equal '2.0',             '2.0'
 assert_equal 'Float',           '1.3.class'
 
@@ -65,8 +65,11 @@ assert_equal ':a3c',            ':"a#{1+2}c".inspect'
 assert_equal 'Symbol',          ':"a#{1+2}c".class'
 
 # xstring
-assert_equal "foo\n",           %q(`echo foo`)
-assert_equal "foo\n",           %q(s = "foo"; `echo #{s}`)
+# WASI doesn't support spawning a new process for now.
+if /wasi/ !~ target_platform
+  assert_equal "foo\n",           %q(`echo foo`)
+  assert_equal "foo\n",           %q(s = "foo"; `echo #{s}`)
+end
 
 # regexp
 assert_equal '',                '//.source'
@@ -82,7 +85,7 @@ assert_equal '0',               're = /test/; re =~ "test"'
 assert_equal '0',               'str = "test"; /test/ =~ str'
 assert_equal '0',               're = /test/; str = "test"; re =~ str'
 
-# dynacmi regexp
+# dynamic regexp
 assert_equal 'regexp',          %q(/re#{'ge'}xp/.source)
 assert_equal 'Regexp',          %q(/re#{'ge'}xp/.class)
 
@@ -97,7 +100,7 @@ assert_equal '[3]',             '[3].inspect'
 assert_equal '3',               'a = [3]; a[0]'
 assert_equal 'Array',           '[1,2].class'
 assert_equal '2',               '[1,2].size'
-assert_equal '[1, 2]',           '[1,2].inspect'
+assert_equal '[1, 2]',          '[1,2].inspect'
 assert_equal 'Array',           '[1,2,3,4,5].class'
 assert_equal '5',               '[1,2,3,4,5].size'
 assert_equal '[1, 2, 3, 4, 5]', '[1,2,3,4,5].inspect'
@@ -167,7 +170,7 @@ assert_equal 'a',               'r = ("a".."c"); r.begin'
 assert_equal 'c',               'r = ("a".."c"); r.end'
 
 assert_equal 'String',          '__FILE__.class'
-assert_equal 'Fixnum',          '__LINE__.class'
+assert_equal 'Integer',         '__LINE__.class'
 
 ###
 
@@ -200,3 +203,48 @@ assert_equal 'ok', %q{
 assert_equal 'ok', %q{
   "#{}o""#{}k""#{}"
 }, '[ruby-core:25284]'
+
+assert_equal 'ok', %q{ #  long array literal
+  x = nil
+  eval "a = [#{(1..10_000).map{'x'}.join(", ")}]"
+  :ok
+}
+
+assert_equal 'ok', %q{ #  long array literal (optimized)
+  eval "a = [#{(1..10_000).to_a.join(", ")}]"
+  :ok
+}
+
+assert_equal 'ok', %q{ #  long hash literal
+  x = nil
+  eval "a = {#{(1..10_000).map{|n| "#{n} => x"}.join(', ')}}"
+  :ok
+}
+
+assert_equal 'ok', %q{ #  long hash literal (optimized)
+  eval "a = {#{(1..10_000).map{|n| "#{n} => #{n}"}.join(', ')}}"
+  :ok
+}
+
+assert_equal 'ok', %q{ #  Bug #15536
+  eval <<-END
+    {
+      **{
+        a0: nil, a1: nil, a2: nil, a3: nil, a4: nil, a5: nil, a6: nil, a7: nil, a8: nil,
+      },
+      a0: nil, a1: nil, a2: nil, a3: nil, a4: nil, a5: nil, a6: nil, a7: nil, a8: nil,
+      **{
+        c: nil
+      },
+      b0: nil, b1: nil, b2: nil, b3: nil, b4: nil, b5: nil, b6: nil, b7: nil, b8: nil,
+      b9: nil, b10: nil, b11: nil, b12: nil, b13: nil, b14: nil, b15: nil, b16: nil,
+      b17: nil, b18: nil, b19: nil, b20: nil, b21: nil,
+    }
+  END
+  :ok
+}
+
+assert_equal 'ok', %q{
+  [print(:ok), exit] # void literal with side-effect
+  :dummy
+}
diff --git a/bootstraptest/test_literal_suffix.rb b/bootstraptest/test_literal_suffix.rb
new file mode 100644
index 0000000000..c36fa7078f
--- /dev/null
+++ b/bootstraptest/test_literal_suffix.rb
@@ -0,0 +1,54 @@
+# numbers with suffix
+assert_equal '0/1',             '0r'
+assert_equal 'Rational',        '0r.class'
+assert_equal '1/1',             '1r'
+assert_equal 'Rational',        '1r.class'
+assert_equal '-1/1',            '-1r'
+assert_equal 'Rational',        '(-1r).class'
+assert_equal '1/1',             '0x1r'
+assert_equal 'Rational',        '0x1r.class'
+assert_equal '1/1',             '0b1r'
+assert_equal 'Rational',        '0b1r.class'
+assert_equal '1/1',             '0d1r'
+assert_equal 'Rational',        '0d1r.class'
+assert_equal '1/1',             '0o1r'
+assert_equal 'Rational',        '0o1r.class'
+assert_equal '1/1',             '01r'
+assert_equal 'Rational',        '01r.class'
+assert_equal '6/5',             '1.2r'
+assert_equal 'Rational',        '1.2r.class'
+assert_equal '-6/5',            '-1.2r'
+assert_equal 'Rational',        '(-1.2r).class'
+assert_equal '0+0i',            '0i'
+assert_equal 'Complex',         '0i.class'
+assert_equal '0+1i',            '1i'
+assert_equal 'Complex',         '1i.class'
+assert_equal '0+1i',            '0x1i'
+assert_equal 'Complex',         '0x1i.class'
+assert_equal '0+1i',            '0b1i'
+assert_equal 'Complex',         '0b1i.class'
+assert_equal '0+1i',            '0d1i'
+assert_equal 'Complex',         '0d1i.class'
+assert_equal '0+1i',            '0o1i'
+assert_equal 'Complex',         '0o1i.class'
+assert_equal '0+1i',            '01i'
+assert_equal 'Complex',         '01i.class'
+assert_equal '0+1.2i',          '1.2i'
+assert_equal 'Complex',         '1.2i.class'
+assert_equal '0+1/1i',          '1ri'
+assert_equal 'Complex',         '1ri.class'
+assert_equal '0+6/5i',          '1.2ri'
+assert_equal 'Complex',         '1.2ri.class'
+assert_equal '0+10.0i',         '1e1i'
+assert_equal 'Complex',         '1e1i.class'
+assert_equal '1',               '1if true'
+assert_equal '1',               '1rescue nil'
+assert_equal '10000000000000000001/10000000000000000000',
+             '1.0000000000000000001r'
+
+assert_equal 'syntax error, unexpected local variable or method, expecting end-of-input',
+             %q{begin eval('1ir', nil, '', 0); rescue SyntaxError => e; e.message[/\A:(?:\d+:)? (.*)/, 1] end}
+assert_equal 'syntax error, unexpected local variable or method, expecting end-of-input',
+             %q{begin eval('1.2ir', nil, '', 0); rescue SyntaxError => e; e.message[/\A:(?:\d+:)? (.*)/, 1] end}
+assert_equal 'syntax error, unexpected local variable or method, expecting end-of-input',
+             %q{begin eval('1e1r', nil, '', 0); rescue SyntaxError => e; e.message[/\A:(?:\d+:)? (.*)/, 1] end}
diff --git a/bootstraptest/test_method.rb b/bootstraptest/test_method.rb
index 2baf33539d..04c9eb2d11 100644
--- a/bootstraptest/test_method.rb
+++ b/bootstraptest/test_method.rb
@@ -3,7 +3,7 @@ assert_equal '1',       'def m() 1 end; m()'
 assert_equal '1',       'def m(a) a end; m(1)'
 assert_equal '[1, 2]',  'def m(a,b) [a, b] end; m(1,2)'
 assert_equal '[1, 2, 3]', 'def m(a,b,c) [a, b, c] end; m(1,2,3)'
-assert_equal 'wrong number of arguments (1 for 0)', %q{
+assert_match /\Awrong number of arguments \(.*\b1\b.* 0\)\z/, %q{
   def m; end
   begin
     m(1)
@@ -12,7 +12,7 @@ assert_equal 'wrong number of arguments (1 for 0)', %q{
   end
 }
 
-assert_equal 'wrong number of arguments (0 for 1)', %q{
+assert_match /\Awrong number of arguments \(.*\b0\b.* 1\)\z/, %q{
   def m a; end
   begin
     m
@@ -22,7 +22,7 @@ assert_equal 'wrong number of arguments (0 for 1)', %q{
 }
 
 # default argument
-assert_equal '1',       'def m(x=1) x end; m()'
+assert_equal '1',       'def m(x=1) x end; m();'
 assert_equal '1',       'def m(x=7) x end; m(1)'
 assert_equal '1',       'def m(a,x=1) x end; m(7)'
 assert_equal '1',       'def m(a,x=7) x end; m(7,1)'
@@ -886,50 +886,6 @@ class C0; def m *args; [:C0_m, args]; end; end
 class C1 < C0; def m a, o=:o; super; end; end
 ; C1.new.m 1, 2}
 
-assert_equal %q{[:ok, :ok, :ok, :ok, :ok, :ok, :ng, :ng]}, %q{
-  $ans = []
-  class Foo
-    def m
-    end
-  end
-
-  c1 = c2 = nil
-
-  lambda{
-    $SAFE = 4
-    c1 = Class.new{
-      def m
-      end
-    }
-    c2 = Class.new(Foo){
-      alias mm m
-    }
-  }.call
-
-  def test
-    begin
-      yield
-    rescue SecurityError
-      $ans << :ok
-    else
-      $ans << :ng
-    end
-  end
-
-  o1 = c1.new
-  o2 = c2.new
-
-  test{o1.m}
-  test{o2.mm}
-  test{o1.send :m}
-  test{o2.send :mm}
-  test{o1.public_send :m}
-  test{o2.public_send :mm}
-  test{o1.method(:m).call}
-  test{o2.method(:mm).call}
-  $ans
-}
-
 assert_equal 'ok', %q{
   class C
     def x=(n)
@@ -954,34 +910,6 @@ assert_equal 'ok', %q{
 }, '[ruby-core:11998]'
 
 assert_equal 'ok', %q{
-  proc{
-    $SAFE = 2
-    class C
-      def m
-        :ok
-      end
-    end
-  }.call
-  C.new.m
-}, '[ruby-core:11998]'
-
-assert_equal 'ok', %q{
-  proc{
-    $SAFE = 3
-    class C
-      def m
-        :ng
-      end
-    end
-  }.call
-  begin
-    C.new.m
-  rescue SecurityError
-    :ok
-  end
-}, '[ruby-core:11998]'
-
-assert_equal 'ok', %q{
   class B
     def m() :fail end
   end
@@ -1001,8 +929,8 @@ assert_equal 'ok', %q{
 
 assert_normal_exit %q{
   begin
-    Process.setrlimit(Process::RLIMIT_STACK, 4_202_496)
-    # FreeBSD fails this less than 4M + 8K bytes.
+    Process.setrlimit(Process::RLIMIT_STACK, 4_206_592)
+    # FreeBSD SEGVs this less than 4M + 12K bytes.
   rescue Exception
     exit
   end
@@ -1184,3 +1112,81 @@ assert_equal 'ok', %q{
   'ok'
 }, '[ruby-core:30534]'
 
+# should not cache when splat
+assert_equal 'ok', %q{
+  class C
+    attr_reader :a
+    def initialize
+      @a = 1
+    end
+  end
+
+  def m *args
+    C.new.a(*args)
+  end
+
+  m()
+  begin
+    m(1)
+  rescue ArgumentError
+    'ok'
+  end
+}
+
+assert_equal 'DC', %q{
+  $result = []
+
+  class C
+    def foo *args
+      $result << 'C'
+    end
+  end
+  class D
+    def foo *args
+      $result << 'D'
+    end
+  end
+
+  o1 = $o1 = C.new
+  o2 = $o2 = D.new
+
+  args = Object.new
+  def args.to_a
+    test1 $o2, nil
+    []
+  end
+  def test1 o, args
+    o.foo(*args)
+  end
+  test1 o1, args
+  $result.join
+}
+
+assert_equal 'DC', %q{
+  $result = []
+
+  class C
+    def foo *args
+      $result << 'C'
+    end
+  end
+  class D
+    def foo *args
+      $result << 'D'
+    end
+  end
+
+  o1 = $o1 = C.new
+  o2 = $o2 = D.new
+
+  block = Object.new
+  def block.to_proc
+    test2 $o2, %w(a, b, c), nil
+    Proc.new{}
+  end
+  def test2 o, args, block
+    o.foo(*args, &block)
+  end
+  test2 o1, [], block
+  $result.join
+}
diff --git a/bootstraptest/test_objectspace.rb b/bootstraptest/test_objectspace.rb
index 862a94e376..63a8d99322 100644
--- a/bootstraptest/test_objectspace.rb
+++ b/bootstraptest/test_objectspace.rb
@@ -35,7 +35,7 @@ assert_normal_exit %q{
 
 assert_normal_exit %q{
   ObjectSpace.define_finalizer("") do
-    Mutex.new.lock
+    Thread::Mutex.new.lock
   end
 }, '[ruby-dev:44049]'
 
@@ -44,3 +44,12 @@ assert_normal_exit %q{
     Thread.new {}
   end
 }, '[ruby-core:37858]'
+
+assert_equal 'ok', %q{
+  objects_and_ids = 1000.times.map { o = Object.new; [o, o.object_id] }
+  objects_and_ids.each { |expected, id|
+    actual = ObjectSpace._id2ref(id)
+    raise "expected #{expected.inspect}, got #{actual.inspect}" unless actual.equal?(expected)
+  }
+  'ok'
+}
diff --git a/bootstraptest/test_proc.rb b/bootstraptest/test_proc.rb
index 3d347004ea..637603243d 100644
--- a/bootstraptest/test_proc.rb
+++ b/bootstraptest/test_proc.rb
@@ -224,19 +224,6 @@ assert_equal %q{[[nil, []], [1, []], [1, [2]], [1, [2, 3]]]}, %q{
   Proc.new{|a, *b| [a, b]}.call(1, 2, 3),
   ]
 }
-assert_equal %q{0}, %q{
-  pr = proc{
-    $SAFE
-  }
-  $SAFE = 1
-  pr.call
-}
-assert_equal %q{[1, 0]}, %q{
-  pr = proc{
-    $SAFE += 1
-  }
-  [pr.call, $SAFE]
-}
 assert_equal %q{1}, %q{
   def m(&b)
     b
@@ -380,8 +367,8 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   class Foo
-    def call_it
-      p = Proc.new
+    def call_it(&block)
+      p = Proc.new(&block)
       p.call
     end
   end
@@ -456,3 +443,28 @@ assert_equal 'ok', %q{
   end
 }
 
+assert_equal 'ok', %q{
+  def x
+    binding
+  end
+  b = x{|a| a }
+  b.eval('yield("ok")')
+}, '[Bug #5634]'
+
+assert_equal 'ok', %q{
+  def x
+    binding
+  end
+  eval("x { 'ok' }").eval "yield"
+}, '[Bug #5634]'
+
+assert_equal 'ok', %q{
+  def x
+    binding
+  end
+  def m
+    x{ 'ok' }
+  end
+  eval('yield', m)
+}, '[Bug #5634]'
+
diff --git a/bootstraptest/test_ractor.rb b/bootstraptest/test_ractor.rb
new file mode 100644
index 0000000000..67e66b03ee
--- /dev/null
+++ b/bootstraptest/test_ractor.rb
@@ -0,0 +1,1628 @@
+# Ractor.current returns a current ractor
+assert_equal 'Ractor', %q{
+  Ractor.current.class
+}
+
+# Ractor.new returns new Ractor
+assert_equal 'Ractor', %q{
+  Ractor.new{}.class
+}
+
+# Ractor.allocate is not supported
+assert_equal "[:ok, :ok]", %q{
+  rs = []
+  begin
+    Ractor.allocate
+  rescue => e
+    rs << :ok if e.message == 'allocator undefined for Ractor'
+  end
+
+  begin
+    Ractor.new{}.dup
+  rescue
+    rs << :ok if e.message == 'allocator undefined for Ractor'
+  end
+
+  rs
+}
+
+# A Ractor can have a name
+assert_equal 'test-name', %q{
+  r = Ractor.new name: 'test-name' do
+  end
+  r.name
+}
+
+# If Ractor doesn't have a name, Ractor#name returns nil.
+assert_equal 'nil', %q{
+  r = Ractor.new do
+  end
+  r.name.inspect
+}
+
+# Raises exceptions if initialize with an invalid name
+assert_equal 'ok', %q{
+  begin
+    r = Ractor.new(name: [{}]) {}
+  rescue TypeError => e
+    'ok'
+  end
+}
+
+# Ractor.new must call with a block
+assert_equal "must be called with a block", %q{
+  begin
+    Ractor.new
+  rescue ArgumentError => e
+    e.message
+  end
+}
+
+# Ractor#inspect
+# Return only id and status for main ractor
+assert_equal "#<Ractor:#1 running>", %q{
+  Ractor.current.inspect
+}
+
+# Return id, loc, and status for no-name ractor
+assert_match /^#<Ractor:#([^ ]*?) .+:[0-9]+ terminated>$/, %q{
+  r = Ractor.new { '' }
+  r.take
+  sleep 0.1 until r.inspect =~ /terminated/
+  r.inspect
+}
+
+# Return id, name, loc, and status for named ractor
+assert_match /^#<Ractor:#([^ ]*?) Test Ractor .+:[0-9]+ terminated>$/, %q{
+  r = Ractor.new(name: 'Test Ractor') { '' }
+  r.take
+  sleep 0.1 until r.inspect =~ /terminated/
+  r.inspect
+}
+
+# A return value of a Ractor block will be a message from the Ractor.
+assert_equal 'ok', %q{
+  # join
+  r = Ractor.new do
+    'ok'
+  end
+  r.take
+}
+
+# Passed arguments to Ractor.new will be a block parameter
+# The values are passed with Ractor-communication pass.
+assert_equal 'ok', %q{
+  # ping-pong with arg
+  r = Ractor.new 'ok' do |msg|
+    msg
+  end
+  r.take
+}
+
+# Pass multiple arguments to Ractor.new
+assert_equal 'ok', %q{
+  # ping-pong with two args
+  r =  Ractor.new 'ping', 'pong' do |msg, msg2|
+    [msg, msg2]
+  end
+  'ok' if r.take == ['ping', 'pong']
+}
+
+# Ractor#send passes an object with copy to a Ractor
+# and Ractor.receive in the Ractor block can receive the passed value.
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    msg = Ractor.receive
+  end
+  r.send 'ok'
+  r.take
+}
+
+# Ractor#receive_if can filter the message
+assert_equal '[2, 3, 1]', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+  end
+  a = []
+  a << Ractor.receive_if{|msg| msg == 2}
+  a << Ractor.receive_if{|msg| msg == 3}
+  a << Ractor.receive
+}
+
+# Ractor#receive_if with break
+assert_equal '[2, [1, :break], 3]', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+  end
+
+  a = []
+  a << Ractor.receive_if{|msg| msg == 2}
+  a << Ractor.receive_if{|msg| break [msg, :break]}
+  a << Ractor.receive
+}
+
+# Ractor#receive_if can't be called recursively
+assert_equal '[[:e1, 1], [:e2, 2]]', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+  end
+
+  a = []
+
+  Ractor.receive_if do |msg|
+    begin
+      Ractor.receive
+    rescue Ractor::Error
+      a << [:e1, msg]
+    end
+    true # delete 1 from queue
+  end
+
+  Ractor.receive_if do |msg|
+    begin
+      Ractor.receive_if{}
+    rescue Ractor::Error
+      a << [:e2, msg]
+    end
+    true # delete 2 from queue
+  end
+
+  a #
+}
+
+# dtoa race condition
+assert_equal '[:ok, :ok, :ok]', %q{
+  n = 3
+  n.times.map{
+    Ractor.new{
+      10_000.times{ rand.to_s }
+      :ok
+    }
+  }.map(&:take)
+}
+
+# Ractor.make_shareable issue for locals in proc [Bug #18023]
+assert_equal '[:a, :b, :c, :d, :e]', %q{
+  v1, v2, v3, v4, v5 = :a, :b, :c, :d, :e
+  closure = Ractor.current.instance_eval{ Proc.new { [v1, v2, v3, v4, v5] } }
+
+  Ractor.make_shareable(closure).call
+}
+
+# Ractor.make_shareable issue for locals in proc [Bug #18023]
+assert_equal '[:a, :b, :c, :d, :e, :f, :g]', %q{
+  a = :a
+  closure = Ractor.current.instance_eval do
+    -> {
+      b, c, d = :b, :c, :d
+      -> {
+        e, f, g = :e, :f, :g
+        -> { [a, b, c, d, e, f, g] }
+      }.call
+    }.call
+  end
+
+  Ractor.make_shareable(closure).call
+}
+
+# Now autoload in non-main Ractor is not supported
+assert_equal 'ok', %q{
+  autoload :Foo, 'foo.rb'
+  r = Ractor.new do
+    p Foo
+  rescue Ractor::UnsafeError
+    :ok
+  end
+  r.take
+}
+
+###
+###
+# Ractor still has several memory corruption so skip huge number of tests
+if ENV['GITHUB_WORKFLOW'] &&
+   ENV['GITHUB_WORKFLOW'] == 'Compilations'
+   # ignore the follow
+else
+
+# Ractor.select(*ractors) receives a values from a ractors.
+# It is similar to select(2) and Go's select syntax.
+# The return value is [ch, received_value]
+assert_equal 'ok', %q{
+  # select 1
+  r1 = Ractor.new{'r1'}
+  r, obj = Ractor.select(r1)
+  'ok' if r == r1 and obj == 'r1'
+}
+
+# Ractor.select from two ractors.
+assert_equal '["r1", "r2"]', %q{
+  # select 2
+  r1 = Ractor.new{'r1'}
+  r2 = Ractor.new{'r2'}
+  rs = [r1, r2]
+  as = []
+  r, obj = Ractor.select(*rs)
+  rs.delete(r)
+  as << obj
+  r, obj = Ractor.select(*rs)
+  as << obj
+  as.sort #=> ["r1", "r2"]
+}
+
+# Ractor.select from multiple ractors.
+assert_equal 30.times.map { 'ok' }.to_s, %q{
+  def test n
+    rs = (1..n).map do |i|
+      Ractor.new(i) do |i|
+        "r#{i}"
+      end
+    end
+    as = []
+    all_rs = rs.dup
+
+    n.times{
+      r, obj = Ractor.select(*rs)
+      as << [r, obj]
+      rs.delete(r)
+    }
+
+    if as.map{|r, o| r.object_id}.sort == all_rs.map{|r| r.object_id}.sort &&
+       as.map{|r, o| o}.sort == (1..n).map{|i| "r#{i}"}.sort
+      'ok'
+    else
+      'ng'
+    end
+  end
+
+  30.times.map{|i|
+    test i
+  }
+} unless ENV['RUN_OPTS'] =~ /--mjit-call-threshold=5/ || # This always fails with --mjit-wait --mjit-call-threshold=5
+  (ENV.key?('TRAVIS') && ENV['TRAVIS_CPU_ARCH'] == 'arm64') || # https://bugs.ruby-lang.org/issues/17878
+  true # too flaky everywhere http://ci.rvm.jp/results/trunk@ruby-sp1/4321096
+
+# Exception for empty select
+assert_match /specify at least one ractor/, %q{
+  begin
+    Ractor.select
+  rescue ArgumentError => e
+    e.message
+  end
+}
+
+# Outgoing port of a ractor will be closed when the Ractor is terminated.
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    'finish'
+  end
+
+  r.take
+  sleep 0.1 until r.inspect =~ /terminated/
+
+  begin
+    o = r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    "ng: #{o}"
+  end
+}
+
+# Raise Ractor::ClosedError when try to send into a terminated ractor
+assert_equal 'ok', %q{
+  r = Ractor.new do
+  end
+
+  r.take # closed
+  sleep 0.1 until r.inspect =~ /terminated/
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Raise Ractor::ClosedError when try to send into a closed actor
+assert_equal 'ok', %q{
+  r = Ractor.new { Ractor.receive }
+  r.close_incoming
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Raise Ractor::ClosedError when try to take from closed actor
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Ractor.yield 1
+    Ractor.receive
+  end
+
+  r.close_outgoing
+  begin
+    r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Can mix with Thread#interrupt and Ractor#take [Bug #17366]
+assert_equal 'err', %q{
+  Ractor.new{
+    t = Thread.current
+    begin
+      Thread.new{ t.raise "err" }.join
+    rescue => e
+      e.message
+    end
+  }.take
+}
+
+# Killed Ractor's thread yields nil
+assert_equal 'nil', %q{
+  Ractor.new{
+    t = Thread.current
+    Thread.new{ t.kill }.join
+  }.take.inspect #=> nil
+}
+
+# Ractor.yield raises Ractor::ClosedError when outgoing port is closed.
+assert_equal 'ok', %q{
+  r = Ractor.new Ractor.current do |main|
+    Ractor.receive
+    main << true
+    Ractor.yield 1
+  end
+
+  r.close_outgoing
+  r << true
+  Ractor.receive
+
+  begin
+    r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Raise Ractor::ClosedError when try to send into a ractor with closed incoming port
+assert_equal 'ok', %q{
+  r = Ractor.new { Ractor.receive }
+  r.close_incoming
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# A ractor with closed incoming port still can send messages out
+assert_equal '[1, 2]', %q{
+  r = Ractor.new do
+    Ractor.yield 1
+    2
+  end
+  r.close_incoming
+
+  [r.take, r.take]
+}
+
+# Raise Ractor::ClosedError when try to take from a ractor with closed outgoing port
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Ractor.yield 1
+    Ractor.receive
+  end
+
+  sleep 0.01 # wait for Ractor.yield in r
+  r.close_outgoing
+  begin
+    r.take
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# A ractor with closed outgoing port still can receive messages from incoming port
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Ractor.receive
+  end
+
+  r.close_outgoing
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ng'
+  else
+    'ok'
+  end
+}
+
+# Ractor.main returns main ractor
+assert_equal 'true', %q{
+  Ractor.new{
+    Ractor.main
+  }.take == Ractor.current
+}
+
+# a ractor with closed outgoing port should terminate
+assert_equal 'ok', %q{
+  Ractor.new do
+    close_outgoing
+  end
+
+  true until Ractor.count == 1
+  :ok
+}
+
+# multiple Ractors can receive (wait) from one Ractor
+assert_equal '[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]', %q{
+  pipe = Ractor.new do
+    loop do
+      Ractor.yield Ractor.receive
+    end
+  end
+
+  RN = 10
+  rs = RN.times.map{|i|
+    Ractor.new pipe, i do |pipe, i|
+      msg = pipe.take
+      msg # ping-pong
+    end
+  }
+  RN.times{|i|
+    pipe << i
+  }
+  RN.times.map{
+    r, n = Ractor.select(*rs)
+    rs.delete r
+    n
+  }.sort
+} unless /mswin/ =~ RUBY_PLATFORM # randomly hangs on mswin https://github.com/ruby/ruby/actions/runs/3753871445/jobs/6377551069#step:20:131
+
+# Ractor.select also support multiple take, receive and yield
+assert_equal '[true, true, true]', %q{
+  RN = 10
+  CR = Ractor.current
+
+  rs = (1..RN).map{
+    Ractor.new do
+      CR.send 'send' + CR.take #=> 'sendyield'
+      'take'
+    end
+  }
+  received = []
+  take = []
+  yielded = []
+  until rs.empty?
+    r, v = Ractor.select(CR, *rs, yield_value: 'yield')
+    case r
+    when :receive
+      received << v
+    when :yield
+      yielded << v
+    else
+      take << v
+      rs.delete r
+    end
+  end
+  [received.all?('sendyield'), yielded.all?(nil), take.all?('take')]
+}
+
+# multiple Ractors can send to one Ractor
+assert_equal '[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]', %q{
+  pipe = Ractor.new do
+    loop do
+      Ractor.yield Ractor.receive
+    end
+  end
+
+  RN = 10
+  RN.times.map{|i|
+    Ractor.new pipe, i do |pipe, i|
+      pipe << i
+    end
+  }
+  RN.times.map{
+    pipe.take
+  }.sort
+}
+
+# an exception in a Ractor will be re-raised at Ractor#receive
+assert_equal '[RuntimeError, "ok", true]', %q{
+  r = Ractor.new do
+    raise 'ok' # exception will be transferred receiver
+  end
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    [e.cause.class,   #=> RuntimeError
+     e.cause.message, #=> 'ok'
+     e.ractor == r]   #=> true
+  end
+}
+
+# threads in a ractor will killed
+assert_equal '{:ok=>3}', %q{
+  Ractor.new Ractor.current do |main|
+    q = Thread::Queue.new
+    Thread.new do
+      q << true
+      loop{}
+    ensure
+      main << :ok
+    end
+
+    Thread.new do
+      q << true
+      while true
+      end
+    ensure
+      main << :ok
+    end
+
+    Thread.new do
+      q << true
+      sleep 1
+    ensure
+      main << :ok
+    end
+
+    # wait for the start of all threads
+    3.times{q.pop}
+  end
+
+  3.times.map{Ractor.receive}.tally
+}
+
+# unshareable object are copied
+assert_equal 'false', %q{
+  obj = 'str'.dup
+  r = Ractor.new obj do |msg|
+    msg.object_id
+  end
+
+  obj.object_id == r.take
+}
+
+# To copy the object, now Marshal#dump is used
+assert_equal "allocator undefined for Thread", %q{
+  obj = Thread.new{}
+  begin
+    r = Ractor.new obj do |msg|
+      msg
+    end
+  rescue TypeError => e
+    e.message #=> no _dump_data is defined for class Thread
+  else
+    'ng'
+  end
+}
+
+# send shareable and unshareable objects
+assert_equal "ok", %q{
+  echo_ractor = Ractor.new do
+    loop do
+      v = Ractor.receive
+      Ractor.yield v
+    end
+  end
+
+  class C; end
+  module M; end
+  S = Struct.new(:a, :b, :c, :d)
+
+  shareable_objects = [
+    true,
+    false,
+    nil,
+    1,
+    1.1,    # Float
+    1+2r,   # Rational
+    3+4i,   # Complex
+    2**128, # Bignum
+    :sym,   # Symbol
+    'xyzzy'.to_sym, # dynamic symbol
+    'frozen'.freeze, # frozen String
+    /regexp/, # regexp literal
+    /reg{true}exp/.freeze, # frozen dregexp
+    [1, 2].freeze,   # frozen Array which only refers to shareable
+    {a: 1}.freeze,   # frozen Hash which only refers to shareable
+    [{a: 1}.freeze, 'str'.freeze].freeze, # nested frozen container
+    S.new(1, 2).freeze, # frozen Struct
+    S.new(1, 2, 3, 4).freeze, # frozen Struct
+    (1..2), # Range on Struct
+    (1..),  # Range on Struct
+    (..1),  # Range on Struct
+    C, # class
+    M, # module
+    Ractor.current, # Ractor
+  ]
+
+  unshareable_objects = [
+    'mutable str'.dup,
+    [:array],
+    {hash: true},
+    S.new(1, 2),
+    S.new(1, 2, 3, 4),
+    S.new("a", 2).freeze, # frozen, but refers to an unshareable object
+  ]
+
+  results = []
+
+  shareable_objects.map{|o|
+    echo_ractor << o
+    o2 = echo_ractor.take
+    results << "#{o} is copied" unless o.object_id == o2.object_id
+  }
+
+  unshareable_objects.map{|o|
+    echo_ractor << o
+    o2 = echo_ractor.take
+    results << "#{o.inspect} is not copied" if o.object_id == o2.object_id
+  }
+
+  if results.empty?
+    :ok
+  else
+    results.inspect
+  end
+}
+
+# frozen Objects are shareable
+assert_equal [false, true, false].inspect, %q{
+  class C
+    def initialize freeze
+      @a = 1
+      @b = :sym
+      @c = 'frozen_str'
+      @c.freeze if freeze
+      @d = true
+    end
+  end
+
+  def check obj1
+    obj2 = Ractor.new obj1 do |obj|
+      obj
+    end.take
+
+    obj1.object_id == obj2.object_id
+  end
+
+  results = []
+  results << check(C.new(true))         # false
+  results << check(C.new(true).freeze)  # true
+  results << check(C.new(false).freeze) # false
+}
+
+# move example2: String
+# touching moved object causes an error
+assert_equal 'hello world', %q{
+  # move
+  r = Ractor.new do
+    obj = Ractor.receive
+    obj << ' world'
+  end
+
+  str = 'hello'
+  r.send str, move: true
+  modified = r.take
+
+  begin
+    str << ' exception' # raise Ractor::MovedError
+  rescue Ractor::MovedError
+    modified #=> 'hello world'
+  else
+    raise 'unreachable'
+  end
+}
+
+# move example2: Array
+assert_equal '[0, 1]', %q{
+  r = Ractor.new do
+    ary = Ractor.receive
+    ary << 1
+  end
+
+  a1 = [0]
+  r.send a1, move: true
+  a2 = r.take
+  begin
+    a1 << 2 # raise Ractor::MovedError
+  rescue Ractor::MovedError
+    a2.inspect
+  end
+}
+
+# move with yield
+assert_equal 'hello', %q{
+  r = Ractor.new do
+    Thread.current.report_on_exception = false
+    obj = 'hello'
+    Ractor.yield obj, move: true
+    obj << 'world'
+  end
+
+  str = r.take
+  begin
+    r.take
+  rescue Ractor::RemoteError
+    str #=> "hello"
+  end
+}
+
+# yield/move should not make moved object when the yield is not succeeded
+assert_equal '"str"', %q{
+  R = Ractor.new{}
+  M = Ractor.current
+  r = Ractor.new do
+    s = 'str'
+    selected_r, v = Ractor.select R, yield_value: s, move: true
+    raise if selected_r != R # taken from R
+    M.send s.inspect # s should not be a moved object
+  end
+
+  Ractor.receive
+}
+
+# yield/move can fail
+assert_equal "allocator undefined for Thread", %q{
+  r = Ractor.new do
+    obj = Thread.new{}
+    Ractor.yield obj
+  rescue => e
+    e.message
+  end
+  r.take
+}
+
+# Access to global-variables are prohibited
+assert_equal 'can not access global variables $gv from non-main Ractors', %q{
+  $gv = 1
+  r = Ractor.new do
+    $gv
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Access to global-variables are prohibited
+assert_equal 'can not access global variables $gv from non-main Ractors', %q{
+  r = Ractor.new do
+    $gv = 1
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# $stdin,out,err is Ractor local, but shared fds
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    [$stdin, $stdout, $stderr].map{|io|
+      [io.object_id, io.fileno]
+    }
+  end
+
+  [$stdin, $stdout, $stderr].zip(r.take){|io, (oid, fno)|
+    raise "should not be different object" if io.object_id == oid
+    raise "fd should be same" unless io.fileno == fno
+  }
+  'ok'
+}
+
+# $stdin,out,err belong to Ractor
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    $stdin.itself
+    $stdout.itself
+    $stderr.itself
+    'ok'
+  end
+
+  r.take
+}
+
+# $DEBUG, $VERBOSE are Ractor local
+assert_equal 'true', %q{
+  $DEBUG = true
+  $VERBOSE = true
+
+  def ractor_local_globals
+    /a(b)(c)d/ =~ 'abcd' # for $~
+    `echo foo` unless  /solaris/ =~ RUBY_PLATFORM
+
+    {
+     # ractor-local (derived from created ractor): debug
+     '$DEBUG' => $DEBUG,
+     '$-d' => $-d,
+
+     # ractor-local (derived from created ractor): verbose
+     '$VERBOSE' => $VERBOSE,
+     '$-w' => $-w,
+     '$-W' => $-W,
+     '$-v' => $-v,
+
+     # process-local (readonly): other commandline parameters
+     '$-p' => $-p,
+     '$-l' => $-l,
+     '$-a' => $-a,
+
+     # process-local (readonly): getpid
+     '$$'  => $$,
+
+     # thread local: process result
+     '$?'  => $?,
+
+     # scope local: match
+     '$~'  => $~.inspect,
+     '$&'  => $&,
+     '$`'  => $`,
+     '$\''  => $',
+     '$+'  => $+,
+     '$1'  => $1,
+
+     # scope local: last line
+     '$_' => $_,
+
+     # scope local: last backtrace
+     '$@' => $@,
+     '$!' => $!,
+
+     # ractor local: stdin, out, err
+     '$stdin'  => $stdin.inspect,
+     '$stdout' => $stdout.inspect,
+     '$stderr' => $stderr.inspect,
+    }
+  end
+
+  h = Ractor.new do
+    ractor_local_globals
+  end.take
+  ractor_local_globals == h #=> true
+}
+
+# selfs are different objects
+assert_equal 'false', %q{
+  r = Ractor.new do
+    self.object_id
+  end
+  r.take == self.object_id #=> false
+}
+
+# self is a Ractor instance
+assert_equal 'true', %q{
+  r = Ractor.new do
+    self.object_id
+  end
+  r.object_id == r.take #=> true
+}
+
+# given block Proc will be isolated, so can not access outer variables.
+assert_equal 'ArgumentError', %q{
+  begin
+    a = true
+    r = Ractor.new do
+      a
+    end
+  rescue => e
+    e.class
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal "can not get unshareable values from instance variables of classes/modules from non-main Ractors", %q{
+  class C
+    @iv = 'str'
+  end
+
+  r = Ractor.new do
+    class C
+      p @iv
+    end
+  end
+
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal 'can not access instance variables of shareable objects from non-main Ractors', %q{
+  shared = Ractor.new{}
+  shared.instance_variable_set(:@iv, 'str')
+
+  r = Ractor.new shared do |shared|
+    p shared.instance_variable_get(:@iv)
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor, by @iv (get)
+assert_equal 'can not access instance variables of shareable objects from non-main Ractors', %q{
+  class Ractor
+    def setup
+      @foo = ''
+    end
+
+    def foo
+      @foo
+    end
+  end
+
+  shared = Ractor.new{}
+  shared.setup
+
+  r = Ractor.new shared do |shared|
+    p shared.foo
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# ivar in shareable-objects are not allowed to access from non-main Ractor, by @iv (set)
+assert_equal 'can not access instance variables of shareable objects from non-main Ractors', %q{
+  class Ractor
+    def setup
+      @foo = ''
+    end
+  end
+
+  shared = Ractor.new{}
+
+  r = Ractor.new shared do |shared|
+    p shared.setup
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# But a shareable object is frozen, it is allowed to access ivars from non-main Ractor
+assert_equal '11', %q{
+  [Object.new, [], ].map{|obj|
+    obj.instance_variable_set('@a', 1)
+    Ractor.make_shareable obj = obj.freeze
+
+    Ractor.new obj do |obj|
+      obj.instance_variable_get('@a')
+    end.take.to_s
+  }.join
+}
+
+# and instance variables of classes/modules are accessible if they refer shareable objects
+assert_equal '333', %q{
+  class C
+    @int = 1
+    @str = '-1000'.dup
+    @fstr = '100'.freeze
+
+    def self.int = @int
+    def self.str = @str
+    def self.fstr = @fstr
+  end
+
+  module M
+    @int = 2
+    @str = '-2000'.dup
+    @fstr = '200'.freeze
+
+    def self.int = @int
+    def self.str = @str
+    def self.fstr = @fstr
+  end
+
+  a = Ractor.new{ C.int }.take
+  b = Ractor.new do
+    C.str.to_i
+  rescue Ractor::IsolationError
+    10
+  end.take
+  c = Ractor.new do
+    C.fstr.to_i
+  end.take
+
+  d = Ractor.new{ M.int }.take
+  e = Ractor.new do
+    M.str.to_i
+  rescue Ractor::IsolationError
+    20
+  end.take
+  f = Ractor.new do
+    M.fstr.to_i
+  end.take
+
+
+  # 1 + 10 + 100 + 2 + 20 + 200
+  a + b + c + d + e + f
+}
+
+# cvar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal 'can not access class variables from non-main Ractors', %q{
+  class C
+    @@cv = 'str'
+  end
+
+  r = Ractor.new do
+    class C
+      p @@cv
+    end
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# also cached cvar in shareable-objects are not allowed to access from non-main Ractor
+assert_equal 'can not access class variables from non-main Ractors', %q{
+  class C
+    @@cv = 'str'
+    def self.cv
+      @@cv
+    end
+  end
+
+  C.cv # cache
+
+  r = Ractor.new do
+    C.cv
+  end
+
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Getting non-shareable objects via constants by other Ractors is not allowed
+assert_equal 'can not access non-shareable objects in constant C::CONST by non-main Ractor.', %q{
+  class C
+    CONST = 'str'
+  end
+  r = Ractor.new do
+    C::CONST
+  end
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Constant cache should care about non-sharable constants
+assert_equal "can not access non-shareable objects in constant Object::STR by non-main Ractor.", %q{
+  STR = "hello"
+  def str; STR; end
+  s = str() # fill const cache
+  begin
+    Ractor.new{ str() }.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Setting non-shareable objects into constants by other Ractors is not allowed
+assert_equal 'can not set constants with non-shareable objects by non-main Ractors', %q{
+  class C
+  end
+  r = Ractor.new do
+    C::CONST = 'str'
+  end
+  begin
+    r.take
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# define_method is not allowed
+assert_equal "defined with an un-shareable Proc in a different Ractor", %q{
+  str = "foo"
+  define_method(:buggy){|i| str << "#{i}"}
+  begin
+    Ractor.new{buggy(10)}.take
+  rescue => e
+    e.cause.message
+  end
+}
+
+# Immutable Array and Hash are shareable, so it can be shared with constants
+assert_equal '[1000, 3]', %q{
+  A = Array.new(1000).freeze # [nil, ...]
+  H = {a: 1, b: 2, c: 3}.freeze
+
+  Ractor.new{ [A.size, H.size] }.take
+}
+
+# Ractor.count
+assert_equal '[1, 4, 3, 2, 1]', %q{
+  counts = []
+  counts << Ractor.count
+  ractors = (1..3).map { Ractor.new { Ractor.receive } }
+  counts << Ractor.count
+
+  ractors[0].send('End 0').take
+  sleep 0.1 until ractors[0].inspect =~ /terminated/
+  counts << Ractor.count
+
+  ractors[1].send('End 1').take
+  sleep 0.1 until ractors[1].inspect =~ /terminated/
+  counts << Ractor.count
+
+  ractors[2].send('End 2').take
+  sleep 0.1 until ractors[2].inspect =~ /terminated/
+  counts << Ractor.count
+
+  counts.inspect
+}
+
+# ObjectSpace.each_object can not handle unshareable objects with Ractors
+assert_equal '0', %q{
+  Ractor.new{
+    n = 0
+    ObjectSpace.each_object{|o| n += 1 unless Ractor.shareable?(o)}
+    n
+  }.take
+}
+
+# ObjectSpace._id2ref can not handle unshareable objects with Ractors
+assert_equal 'ok', %q{
+  s = 'hello'
+
+  Ractor.new s.object_id do |id ;s|
+    begin
+      s = ObjectSpace._id2ref(id)
+    rescue => e
+      :ok
+    end
+  end.take
+}
+
+# Ractor.make_shareable(obj)
+assert_equal 'true', %q{
+  class C
+    def initialize
+      @a = 'foo'
+      @b = 'bar'
+    end
+
+    def freeze
+      @c = [:freeze_called]
+      super
+    end
+
+    attr_reader :a, :b, :c
+  end
+  S = Struct.new(:s1, :s2)
+  str = "hello"
+  str.instance_variable_set("@iv", "hello")
+  /a/ =~ 'a'
+  m = $~
+  class N < Numeric
+    def /(other)
+      1
+    end
+  end
+  ary = []; ary << ary
+
+  a = [[1, ['2', '3']],
+       {Object.new => "hello"},
+       C.new,
+       S.new("x", "y"),
+       ("a".."b"),
+       str,
+       ary,             # cycle
+       /regexp/,
+       /#{'r'.upcase}/,
+       m,
+       Complex(N.new,0),
+       Rational(N.new,0),
+       true,
+       false,
+       nil,
+       1, 1.2, 1+3r, 1+4i, # Numeric
+  ]
+  Ractor.make_shareable(a)
+
+  # check all frozen
+  a.each{|o|
+    raise o.inspect unless o.frozen?
+
+    case o
+    when C
+      raise o.a.inspect unless o.a.frozen?
+      raise o.b.inspect unless o.b.frozen?
+      raise o.c.inspect unless o.c.frozen? && o.c == [:freeze_called]
+    when Rational
+      raise o.numerator.inspect unless o.numerator.frozen?
+    when Complex
+      raise o.real.inspect unless o.real.frozen?
+    when Array
+      if o[0] == 1
+        raise o[1][1].inspect unless o[1][1].frozen?
+      end
+    when Hash
+      o.each{|k, v|
+        raise k.inspect unless k.frozen?
+        raise v.inspect unless v.frozen?
+      }
+    end
+  }
+
+  Ractor.shareable?(a)
+}
+
+# Ractor.make_shareable(obj) doesn't freeze shareable objects
+assert_equal 'true', %q{
+  r = Ractor.new{}
+  Ractor.make_shareable(a = [r])
+  [a.frozen?, a[0].frozen?] == [true, false]
+}
+
+# Ractor.make_shareable(a_proc) makes a proc shareable.
+assert_equal 'true', %q{
+  a = [1, [2, 3], {a: "4"}]
+
+  pr = Ractor.current.instance_eval do
+    Proc.new do
+      a
+    end
+  end
+
+  Ractor.make_shareable(a) # referred value should be shareable
+  Ractor.make_shareable(pr)
+  Ractor.shareable?(pr)
+}
+
+# Ractor.shareable?(recursive_objects)
+assert_equal '[false, false]', %q{
+  y = []
+  x = [y, {}].freeze
+  y << x
+  y.freeze
+  [Ractor.shareable?(x), Ractor.shareable?(y)]
+}
+
+# Ractor.make_shareable(recursive_objects)
+assert_equal '[:ok, false, false]', %q{
+  o = Object.new
+  def o.freeze; raise; end
+  y = []
+  x = [y, o].freeze
+  y << x
+  y.freeze
+  [(Ractor.make_shareable(x) rescue :ok), Ractor.shareable?(x), Ractor.shareable?(y)]
+}
+
+# Ractor.make_shareable with Class/Module
+assert_equal '[C, M]', %q{
+  class C; end
+  module M; end
+
+  Ractor.make_shareable(ary = [C, M])
+}
+
+# define_method() can invoke different Ractor's proc if the proc is shareable.
+assert_equal '1', %q{
+  class C
+    a = 1
+    define_method "foo", Ractor.make_shareable(Proc.new{ a })
+    a = 2
+  end
+
+  Ractor.new{ C.new.foo }.take
+}
+
+# Ractor.make_shareable(a_proc) makes a proc shareable.
+assert_equal 'can not make a Proc shareable because it accesses outer variables (a).', %q{
+  a = b = nil
+  pr = Ractor.current.instance_eval do
+    Proc.new do
+      c = b # assign to a is okay because c is block local variable
+      # reading b is okay
+      a = b # assign to a is not allowed #=> Ractor::Error
+    end
+  end
+
+  begin
+    Ractor.make_shareable(pr)
+  rescue => e
+    e.message
+  end
+}
+
+# Ractor.make_shareable(obj, copy: true) makes copied shareable object.
+assert_equal '[false, false, true, true]', %q{
+  r = []
+  o1 = [1, 2, ["3"]]
+
+  o2 = Ractor.make_shareable(o1, copy: true)
+  r << Ractor.shareable?(o1) # false
+  r << (o1.object_id == o2.object_id) # false
+
+  o3 = Ractor.make_shareable(o1)
+  r << Ractor.shareable?(o1) # true
+  r << (o1.object_id == o3.object_id) # false
+  r
+}
+
+# TracePoint with normal Proc should be Ractor local
+assert_equal '[4, 8]', %q{
+  rs = []
+  TracePoint.new(:line){|tp| rs << tp.lineno if tp.path == __FILE__}.enable do
+    Ractor.new{ # line 4
+      a = 1
+      b = 2
+    }.take
+    c = 3       # line 8
+  end
+  rs
+}
+
+# Ractor deep copies frozen objects (ary)
+assert_equal '[true, false]', %q{
+  Ractor.new([[]].freeze) { |ary|
+    [ary.frozen?, ary.first.frozen? ]
+  }.take
+}
+
+# Ractor deep copies frozen objects (str)
+assert_equal '[true, false]', %q{
+  s = String.new.instance_eval { @x = []; freeze}
+  Ractor.new(s) { |s|
+    [s.frozen?, s.instance_variable_get(:@x).frozen?]
+  }.take
+}
+
+# Can not trap with not isolated Proc on non-main ractor
+assert_equal '[:ok, :ok]', %q{
+  a = []
+  Ractor.new{
+    trap(:INT){p :ok}
+  }.take
+  a << :ok
+
+  begin
+    Ractor.new{
+      s = 'str'
+      trap(:INT){p s}
+    }.take
+  rescue => Ractor::RemoteError
+    a << :ok
+  end
+}
+
+# Ractor-local storage
+assert_equal '[nil, "b", "a"]', %q{
+  ans = []
+  Ractor.current[:key] = 'a'
+  r = Ractor.new{
+    Ractor.yield self[:key]
+    self[:key] = 'b'
+    self[:key]
+  }
+  ans << r.take
+  ans << r.take
+  ans << Ractor.current[:key]
+}
+
+###
+### Synchronization tests
+###
+
+N = 100_000
+
+# fstring pool
+assert_equal "#{N}#{N}", %Q{
+  N = #{N}
+  2.times.map{
+    Ractor.new{
+      N.times{|i| -(i.to_s)}
+    }
+  }.map{|r| r.take}.join
+}
+
+# enc_table
+assert_equal "100", %Q{
+  Ractor.new do
+    loop do
+      Encoding.find("test-enc-#{rand(5_000)}").inspect
+    rescue ArgumentError => e
+    end
+  end
+
+  src = Encoding.find("UTF-8")
+  100.times{|i|
+    src.replicate("test-enc-\#{i}")
+  }
+}
+
+# Generic ivtbl
+n = N/2
+assert_equal "#{n}#{n}", %Q{
+  2.times.map{
+    Ractor.new do
+      #{n}.times do
+        obj = ''
+        obj.instance_variable_set("@a", 1)
+        obj.instance_variable_set("@b", 1)
+        obj.instance_variable_set("@c", 1)
+        obj.instance_variable_defined?("@a")
+      end
+    end
+  }.map{|r| r.take}.join
+}
+
+# NameError
+assert_equal "ok", %q{
+  begin
+    bar
+  rescue => err
+  end
+  begin
+    Ractor.new{} << err
+  rescue TypeError
+    'ok'
+  end
+}
+
+assert_equal "ok", %q{
+  GC.disable
+  Ractor.new {}
+  raise "not ok" unless GC.disable
+
+  foo = []
+  10.times { foo << 1 }
+
+  GC.start
+
+  'ok'
+}
+
+# Can yield back values while GC is sweeping [Bug #18117]
+assert_equal "ok", %q{
+  workers = (0...8).map do
+    Ractor.new do
+      loop do
+        10_000.times.map { Object.new }
+        Ractor.yield Time.now
+      end
+    end
+  end
+
+  1_000.times { idle_worker, tmp_reporter = Ractor.select(*workers) }
+  "ok"
+}
+
+assert_equal "ok", %q{
+  def foo(*); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo)
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  def foo(**); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo)
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  def foo(...); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo)
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  def foo((x), (y)); ->{ super }; end
+  begin
+    Ractor.make_shareable(foo([], []))
+  rescue Ractor::IsolationError
+    "ok"
+  end
+}
+
+assert_equal "ok", %q{
+  module M
+    def foo
+      @foo
+    end
+  end
+
+  class A
+    include M
+
+    def initialize
+      100.times { |i| instance_variable_set(:"@var_#{i}", "bad: #{i}") }
+      @foo = 2
+    end
+  end
+
+  class B
+    include M
+
+    def initialize
+      @foo = 1
+    end
+  end
+
+  Ractor.new do
+    b = B.new
+    100_000.times do
+      raise unless b.foo == 1
+    end
+  end
+
+  a = A.new
+  100_000.times do
+    raise unless a.foo == 2
+  end
+
+  "ok"
+}
+
+assert_match /\Atest_ractor\.rb:1:\s+warning:\s+Ractor is experimental/, %q{
+  Warning[:experimental] = $VERBOSE = true
+  STDERR.reopen(STDOUT)
+  eval("Ractor.new{}.take", nil, "test_ractor.rb", 1)
+}
+
+end # if !ENV['GITHUB_WORKFLOW']
diff --git a/bootstraptest/test_string.rb b/bootstraptest/test_string.rb
new file mode 100644
index 0000000000..849dcd45b0
--- /dev/null
+++ b/bootstraptest/test_string.rb
@@ -0,0 +1,3 @@
+assert_normal_exit %q{
+  inspect.clear
+}, '[ruby-core:68110]'
diff --git a/bootstraptest/test_syntax.rb b/bootstraptest/test_syntax.rb
index ef1c622ace..948e2d7809 100644
--- a/bootstraptest/test_syntax.rb
+++ b/bootstraptest/test_syntax.rb
@@ -268,8 +268,10 @@ assert_equal %q{}, %q{
   defined?(@@a)
 }
 assert_equal %q{class variable}, %q{
-  @@a = 1
-  defined?(@@a)
+  class A
+    @@a = 1
+    defined?(@@a)
+  end
 }
 assert_equal %q{}, %q{
   defined?($a)
@@ -376,6 +378,8 @@ assert_equal %q{1}, %q{1 or 2 or 3 or 4}
 assert_equal %q{1}, %q{1 or false or 3 or 4}
 assert_equal %q{2}, %q{nil or 2 or 3 or 4}
 assert_equal %q{2}, %q{false or 2 or 3 or 4}
+assert_equal %q{1}, %q{if true && ""; then 1; end}
+assert_equal %q{1}, %q{if nil || true; then 1; end}
 assert_equal %q{false}, %q{nil or false or nil or false}
 assert_equal %q{elseng}, %q{
   case
@@ -529,7 +533,7 @@ def assert_syntax_error expected, code, message = ''
 end
 assert_syntax_error "unterminated string meets end of file", '().."', '[ruby-dev:29732]'
 assert_equal %q{[]}, %q{$&;[]}, '[ruby-dev:31068]'
-assert_syntax_error "syntax error, unexpected tSTAR, expecting '}'", %q{{*0}}, '[ruby-dev:31072]'
+assert_syntax_error "syntax error, unexpected *, expecting '}'", %q{{*0}}, '[ruby-dev:31072]'
 assert_syntax_error "`@0' is not allowed as an instance variable name", %q{@0..0}, '[ruby-dev:31095]'
 assert_syntax_error "identifier $00 is not valid to get", %q{$00..0}, '[ruby-dev:31100]'
 assert_syntax_error "identifier $00 is not valid to set", %q{0..$00=1}
@@ -541,7 +545,7 @@ assert_equal %q{1}, %q{
 assert_syntax_error "Can't set variable $1", %q{0..$1=1}, '[ruby-dev:31118]'
 assert_valid_syntax %q{1.times{1+(1&&next)}}, '[ruby-dev:31119]'
 assert_valid_syntax %q{x=-1;loop{x+=1&&redo if (x+=1).zero?}}, '[ruby-dev:31119]'
-assert_syntax_error %q{syntax error, unexpected $end}, %q{!}, '[ruby-dev:31243]'
+assert_syntax_error %q{syntax error, unexpected end-of-input}, %q{!}, '[ruby-dev:31243]'
 assert_equal %q{[nil]}, %q{[()]}, '[ruby-dev:31252]'
 assert_equal %q{true}, %q{!_=()}, '[ruby-dev:31263]'
 assert_equal 'ok', %q{while true; redo; end if 1 == 2; :ok}, '[ruby-dev:31360]'
@@ -624,7 +628,7 @@ assert_equal '2', %q{
 }
 
 assert_match /invalid multibyte char/, %q{
-  STDERR.reopen(STDOUT)
+  $stderr = STDOUT
   eval("\"\xf0".force_encoding("utf-8"))
 }, '[ruby-dev:32429]'
 
diff --git a/bootstraptest/test_thread.rb b/bootstraptest/test_thread.rb
index 2494cccbf3..5361828403 100644
--- a/bootstraptest/test_thread.rb
+++ b/bootstraptest/test_thread.rb
@@ -1,4 +1,14 @@
-# Thread and Fiber
+show_limit %q{
+  threads = []
+  begin
+    threads << Thread.new{sleep}
+
+    raise Exception, "skipping" if threads.count >= 10_000
+  rescue Exception => error
+    puts "Thread count: #{threads.count} (#{error})"
+    break
+  end while true
+} if false # disable to pass CI
 
 assert_equal %q{ok}, %q{
   Thread.new{
@@ -10,7 +20,8 @@ assert_equal %q{ok}, %q{
     :ok
   }.value
 }
-assert_equal %q{20100}, %q{
+assert_equal %q{ok}, %q{
+begin
   v = 0
   (1..200).map{|i|
     Thread.new{
@@ -19,10 +30,14 @@ assert_equal %q{20100}, %q{
   }.each{|t|
     v += t.value
   }
-  v
+  v == 20100 ? :ok : v
+rescue ThreadError => e
+  :ok if /can't create Thread/ =~ e.message
+end
 }
-assert_equal %q{5000}, %q{
-  5000.times{|e|
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{|e|
     (1..2).map{
       Thread.new{
       }
@@ -30,9 +45,13 @@ assert_equal %q{5000}, %q{
       e.join()
     }
   }
+rescue ThreadError => e
+  /can't create Thread/ =~ e.message ? :ok : e.message
+end
 }
-assert_equal %q{5000}, %q{
-  5000.times{|e|
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{|e|
     (1..2).map{
       Thread.new{
       }
@@ -40,14 +59,21 @@ assert_equal %q{5000}, %q{
       e.join(1000000000)
     }
   }
+rescue ThreadError => e
+  /can't create Thread/ =~ e.message ? :ok : e.message
+end
 }
-assert_equal %q{5000}, %q{
-  5000.times{
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{
     t = Thread.new{}
     while t.alive?
       Thread.pass
     end
   }
+rescue NoMemoryError
+  :ok
+end
 }
 assert_equal %q{100}, %q{
   100.times{
@@ -77,7 +103,7 @@ assert_equal %q{ok}, %q{
       ans = :ok
     end
   }
-  Thread.pass
+  Thread.pass until t.stop?
   t.kill
   t.join
   ans
@@ -189,18 +215,18 @@ assert_equal %q{11}, %q{
   }.value + Thread.current[:a]
 }
 assert_normal_exit %q{
-begin
-  100.times do |i|
-    begin
-      th = Thread.start(Thread.current) {|u| u.raise }
-      raise
-    rescue
-    ensure
-      th.join
+  begin
+    100.times do |i|
+      begin
+        th = Thread.start(Thread.current) {|u| u.raise }
+        raise
+      rescue
+      ensure
+        th.join
+      end
     end
+  rescue
   end
-rescue
-end
 }, '[ruby-dev:31371]'
 
 assert_equal 'true', %{
@@ -217,7 +243,7 @@ assert_equal 'true', %{
 }
 
 assert_equal 'ok', %{
-  open("zzz.rb", "w") do |f|
+  open("zzz_t1.rb", "w") do |f|
     f.puts <<-END
       begin
         Thread.new { fork { GC.start } }.join
@@ -228,21 +254,21 @@ assert_equal 'ok', %{
       end
     END
   end
-  require "./zzz.rb"
+  require "./zzz_t1.rb"
   $result
 }
 
 assert_finish 3, %{
-  th = Thread.new {sleep 2}
-  th.join(1)
+  th = Thread.new {sleep 0.2}
+  th.join(0.1)
   th.join
 }
 
 assert_finish 3, %{
   require 'timeout'
-  th = Thread.new {sleep 2}
+  th = Thread.new {sleep 0.2}
   begin
-    Timeout.timeout(1) {th.join}
+    Timeout.timeout(0.1) {th.join}
   rescue Timeout::Error
   end
   th.join
@@ -267,8 +293,8 @@ assert_normal_exit %q{
 
 assert_equal 'ok', %q{
   def m
-    t = Thread.new { while true do // =~ "" end }
-    sleep 0.1
+    t = Thread.new { while true; // =~ "" end }
+    sleep 0.01
     10.times {
       if /((ab)*(ab)*)*(b)/ =~ "ab"*7
         return :ng if !$4
@@ -283,10 +309,6 @@ assert_equal 'ok', %q{
 }, '[ruby-dev:34492]'
 
 assert_normal_exit %q{
-  at_exit { Fiber.new{}.resume }
-}
-
-assert_normal_exit %q{
   g = enum_for(:local_variables)
   loop { g.next }
 }, '[ruby-dev:34128]'
@@ -312,10 +334,6 @@ assert_normal_exit %q{
 }, '[ruby-dev:34128]'
 
 assert_normal_exit %q{
-  Fiber.new(&Object.method(:class_eval)).resume("foo")
-}, '[ruby-dev:34128]'
-
-assert_normal_exit %q{
   Thread.new("foo", &Object.method(:class_eval)).join
 }, '[ruby-dev:34128]'
 
@@ -331,9 +349,10 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   begin
-    m1, m2 = Mutex.new, Mutex.new
-    Thread.new { m1.lock; sleep 1; m2.lock }
-    m2.lock; sleep 1; m1.lock
+    m1, m2 = Thread::Mutex.new, Thread::Mutex.new
+    f1 = f2 = false
+    Thread.new { m1.lock; f2 = true; sleep 0.001 until f1; m2.lock }
+    m2.lock; f1 = true; sleep 0.001 until f2; m1.lock
     :ng
   rescue Exception
     :ok
@@ -341,34 +360,34 @@ assert_equal 'ok', %q{
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
-  Thread.new { m.lock }; sleep 1; m.lock
+  m = Thread::Mutex.new
+  Thread.new { m.lock }; sleep 0.1; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
+  m = Thread::Mutex.new
   Thread.new { m.lock }; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
+  m = Thread::Mutex.new
   Thread.new { m.lock }.join; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
-  Thread.new { m.lock; sleep 2 }
-  sleep 1; m.lock
+  m = Thread::Mutex.new
+  Thread.new { m.lock; sleep 0.2 }
+  sleep 0.1; m.lock
   :ok
 }
 
 assert_equal 'ok', %q{
-  m = Mutex.new
-  Thread.new { m.lock; sleep 2; m.unlock }
-  sleep 1; m.lock
+  m = Thread::Mutex.new
+  Thread.new { m.lock; sleep 0.2; m.unlock }
+  sleep 0.1; m.lock
   :ok
 }
 
@@ -380,27 +399,30 @@ assert_equal 'ok', %q{
 
 assert_equal 'ok', %q{
   begin
-    10000.times { Thread.new(true) {|x| x == false } }
+    100.times{
+      (1..100).map{ Thread.new(true) {|x| x == false } }.each{|th| th.join}
+    }
   rescue NoMemoryError, StandardError
   end
   :ok
 }
 
 assert_equal 'ok', %{
-  open("zzz.rb", "w") do |f|
-    f.puts <<-END
+  open("zzz_t2.rb", "w") do |f|
+    f.puts <<-'end;' # do
       begin
-        m = Mutex.new
-        Thread.new { m.lock; sleep 1 }
-        sleep 0.3
+        m = Thread::Mutex.new
         parent = Thread.current
+        th1 = Thread.new { m.lock; sleep }
+        sleep 0.01 until th1.stop?
         Thread.new do
-          sleep 0.3
+          sleep 0.01 until parent.stop?
           begin
             fork { GC.start }
           rescue Exception
             parent.raise $!
           end
+          th1.run
         end
         m.lock
         pid, status = Process.wait2
@@ -408,17 +430,17 @@ assert_equal 'ok', %{
       rescue NotImplementedError
         $result = :ok
       end
-    END
+    end;
   end
-  require "./zzz.rb"
+  require "./zzz_t2.rb"
   $result
 }
 
 assert_finish 3, %q{
   require 'thread'
 
-  lock = Mutex.new
-  cond = ConditionVariable.new
+  lock = Thread::Mutex.new
+  cond = Thread::ConditionVariable.new
   t = Thread.new do
     lock.synchronize do
       cond.wait(lock)
@@ -438,17 +460,41 @@ assert_finish 3, %q{
 
 assert_equal 'ok', %q{
   begin
-    Process.waitpid2(fork {sleep 1})[1].success? ? 'ok' : 'ng'
+    Process.waitpid2(fork {})[1].success? ? 'ok' : 'ng'
   rescue NotImplementedError
     'ok'
   end
 }
 
 assert_equal 'foo', %q{
-  f = proc {|s| /#{ sleep 1; s }/o }
-  [ Thread.new {            f.call("foo"); nil },
-    Thread.new { sleep 0.5; f.call("bar"); nil },
-  ].each {|t| t.join }
+  i = 0
+  Thread.start {sleep 1; exit!}
+  f = proc {|s, c| /#{c.call; s}/o }
+  th2 = Thread.new {
+    sleep 0.01 until i == 1
+    i = 2
+    f.call("bar", proc {sleep 2});
+    nil
+  }
+  th1 = Thread.new {
+    f.call("foo", proc {i = 1; sleep 0.01 until i == 2; sleep 0.01})
+    nil
+  }
+  [th1, th2].each {|t| t.join }
   GC.start
   f.call.source
 }
+assert_normal_exit %q{
+  class C
+    def inspect
+      sleep 0.5
+      'C!!'
+    end
+  end
+  Thread.new{
+    loop{
+      p C.new
+    }
+  }
+  sleep 0.1
+}, timeout: 5
diff --git a/bootstraptest/test_yjit.rb b/bootstraptest/test_yjit.rb
new file mode 100644
index 0000000000..5c655b8f25
--- /dev/null
+++ b/bootstraptest/test_yjit.rb
@@ -0,0 +1,3530 @@
+# Regression test for yielding with autosplat to block with
+# optional parameters. https://github.com/Shopify/yjit/issues/313
+assert_equal '[:a, :b, :a, :b]', %q{
+  def yielder(arg) = yield(arg) + yield(arg)
+
+  yielder([:a, :b]) do |c = :c, d = :d|
+    [c, d]
+  end
+}
+
+# Regression test for GC mishap while doing shape transition
+assert_equal '[:ok]', %q{
+  # [Bug #19601]
+  class RegressionTest
+    def initialize
+      @a = @b = @fourth_ivar_does_shape_transition = nil
+    end
+
+    def extender
+      @first_extended_ivar = [:ok]
+    end
+  end
+
+  GC.stress = true
+
+  # Used to crash due to GC run in rb_ensure_iv_list_size()
+  # not marking the newly allocated [:ok].
+  RegressionTest.new.extender.itself
+}
+
+assert_equal 'true', %q{
+  # regression test for tracking type of locals for too long
+  def local_setting_cmp(five)
+    victim = 5
+    five.define_singleton_method(:respond_to?) do |_, _|
+      victim = nil
+    end
+
+    # +1 makes YJIT track that victim is a number and
+    # defined? calls respond_to? from above indirectly
+    unless (victim + 1) && defined?(five.something)
+      # Would return wrong result if we still think `five` is a number
+      victim.nil?
+    end
+  end
+
+  local_setting_cmp(Object.new)
+  local_setting_cmp(Object.new)
+}
+
+assert_equal '18374962167983112447', %q{
+  # regression test for incorrectly discarding 32 bits of a pointer when it
+  # comes to default values.
+  def large_literal_default(n: 0xff00_fabcafe0_00ff)
+    n
+  end
+
+  def call_graph_root
+    large_literal_default
+  end
+
+  call_graph_root
+  call_graph_root
+}
+
+assert_normal_exit %q{
+  # regression test for a leak caught by an assert on --yjit-call-threshold=2
+  Foo = 1
+
+  eval("def foo = [#{(['Foo,']*256).join}]")
+
+  foo
+  foo
+
+  Object.send(:remove_const, :Foo)
+}
+
+assert_normal_exit %q{
+  # Test to ensure send on overriden c functions
+  # doesn't corrupt the stack
+  class Bar
+    def bar(x)
+      x
+    end
+  end
+
+  class Foo
+    def bar
+      Bar.new
+    end
+  end
+
+  foo = Foo.new
+  # before this change, this line would error
+  # because "s" would still be on the stack
+  # String.to_s is the overridden method here
+  p foo.bar.bar("s".__send__(:to_s))
+}
+
+
+assert_equal '[nil, nil, nil, nil, nil, nil]', %q{
+  [NilClass, TrueClass, FalseClass, Integer, Float, Symbol].each do |klass|
+    klass.class_eval("def foo = @foo")
+  end
+
+  [nil, true, false, 0xFABCAFE, 0.42, :cake].map do |instance|
+    instance.foo
+    instance.foo
+  end
+}
+
+assert_equal '0', %q{
+  # This is a regression test for incomplete invalidation from
+  # opt_setinlinecache. This test might be brittle, so
+  # feel free to remove it in the future if it's too annoying.
+  # This test assumes --yjit-call-threshold=2.
+  module M
+    Foo = 1
+    def foo
+      Foo
+    end
+
+    def pin_self_type_then_foo
+      _ = @foo
+      foo
+    end
+
+    def only_ints
+      1 + self
+      foo
+    end
+  end
+
+  class Integer
+    include M
+  end
+
+  class Sub
+    include M
+  end
+
+  foo_method = M.instance_method(:foo)
+
+  dbg = ->(message) do
+    return # comment this out to get printouts
+
+    $stderr.puts RubyVM::YJIT.disasm(foo_method)
+    $stderr.puts message
+  end
+
+  2.times { 42.only_ints }
+
+  dbg["There should be two versions of getinlineache"]
+
+  module M
+    remove_const(:Foo)
+  end
+
+  dbg["There should be no getinlinecaches"]
+
+  2.times do
+    42.only_ints
+  rescue NameError => err
+    _ = "caught name error #{err}"
+  end
+
+  dbg["There should be one version of getinlineache"]
+
+  2.times do
+    Sub.new.pin_self_type_then_foo
+  rescue NameError
+    _ = 'second specialization'
+  end
+
+  dbg["There should be two versions of getinlineache"]
+
+  module M
+    Foo = 1
+  end
+
+  dbg["There should still be two versions of getinlineache"]
+
+  42.only_ints
+
+  dbg["There should be no getinlinecaches"]
+
+  # Find name of the first VM instruction in M#foo.
+  insns = RubyVM::InstructionSequence.of(foo_method).to_a
+  if defined?(RubyVM::YJIT.blocks_for) && (insns.last.find { Array === _1 }&.first == :opt_getinlinecache)
+    RubyVM::YJIT.blocks_for(RubyVM::InstructionSequence.of(foo_method))
+      .filter { _1.iseq_start_index == 0 }.count
+  else
+    0 # skip the test
+  end
+}
+
+# Check that frozen objects are respected
+assert_equal 'great', %q{
+  class Foo
+    attr_accessor :bar
+    def initialize
+      @bar = 1
+      freeze
+    end
+  end
+
+  foo = Foo.new
+
+  5.times do
+    begin
+      foo.bar = 2
+    rescue FrozenError
+    end
+  end
+
+  foo.bar == 1 ? "great" : "NG"
+}
+
+# Check that global variable set works
+assert_equal 'string', %q{
+  def foo
+    $foo = "string"
+  end
+
+  foo
+}
+
+# Check that exceptions work when setting global variables
+assert_equal 'rescued', %q{
+  def set_var
+    $var = 100
+  rescue
+    :rescued
+  end
+
+  set_var
+  trace_var(:$var) { raise }
+  set_var
+}
+
+# Check that global variables work
+assert_equal 'string', %q{
+  $foo = "string"
+
+  def foo
+    $foo
+  end
+
+  foo
+}
+
+# Check that exceptions work when getting global variable
+assert_equal 'rescued', %q{
+  Warning[:deprecated] = true
+
+  module Warning
+    def warn(message)
+      raise
+    end
+  end
+
+  def get_var
+    $=
+  rescue
+    :rescued
+  end
+
+  $VERBOSE = true
+  get_var
+  get_var
+}
+
+# Check that global tracepoints work
+assert_equal 'true', %q{
+  def foo
+    1
+  end
+
+  foo
+  foo
+  foo
+
+  called = false
+
+  tp = TracePoint.new(:return) { |event|
+    if event.method_id == :foo
+      called = true
+    end
+  }
+  tp.enable
+  foo
+  tp.disable
+  called
+}
+
+# Check that local tracepoints work
+assert_equal 'true', %q{
+  def foo
+    1
+  end
+
+  foo
+  foo
+  foo
+
+  called = false
+
+  tp = TracePoint.new(:return) { |_| called = true }
+  tp.enable(target: method(:foo))
+  foo
+  tp.disable
+  called
+}
+
+# Make sure that optional param methods return the correct value
+assert_equal '1', %q{
+  def m(ary = [])
+    yield(ary)
+  end
+
+  # Warm the JIT with a 0 param call
+  2.times { m { } }
+  m(1) { |v| v }
+}
+
+# Test for topn
+assert_equal 'array', %q{
+  def threequals(a)
+    case a
+    when Array
+      "array"
+    when Hash
+      "hash"
+    else
+      "unknown"
+    end
+  end
+
+  threequals([])
+  threequals([])
+  threequals([])
+}
+
+# Test for opt_mod
+assert_equal '2', %q{
+  def mod(a, b)
+    a % b
+  end
+
+  mod(7, 5)
+  mod(7, 5)
+}
+
+# Test for opt_mult
+assert_equal '12', %q{
+  def mult(a, b)
+    a * b
+  end
+
+  mult(6, 2)
+  mult(6, 2)
+}
+
+# Test for opt_div
+assert_equal '3', %q{
+  def div(a, b)
+    a / b
+  end
+
+  div(6, 2)
+  div(6, 2)
+}
+
+# BOP redefined methods work when JIT compiled
+assert_equal 'false', %q{
+  def less_than x
+    x < 10
+  end
+
+  class Integer
+    def < x
+      false
+    end
+  end
+
+  less_than 2
+  less_than 2
+  less_than 2
+}
+
+# BOP redefinition works on Integer#<
+assert_equal 'false', %q{
+  def less_than x
+    x < 10
+  end
+
+  less_than 2
+  less_than 2
+
+  class Integer
+    def < x
+      false
+    end
+  end
+
+  less_than 2
+}
+
+# Putobject, less-than operator, fixnums
+assert_equal '2', %q{
+    def check_index(index)
+        if 0x40000000 < index
+            raise "wat? #{index}"
+        end
+        index
+    end
+    check_index 2
+    check_index 2
+}
+
+# foo leaves a temp on the stack before the call
+assert_equal '6', %q{
+    def bar
+        return 5
+    end
+
+    def foo
+        return 1 + bar
+    end
+
+    foo()
+    retval = foo()
+}
+
+# Method with one arguments
+# foo leaves a temp on the stack before the call
+assert_equal '7', %q{
+    def bar(a)
+        return a + 1
+    end
+
+    def foo
+        return 1 + bar(5)
+    end
+
+    foo()
+    retval = foo()
+}
+
+# Method with two arguments
+# foo leaves a temp on the stack before the call
+assert_equal '0', %q{
+    def bar(a, b)
+        return a - b
+    end
+
+    def foo
+        return 1 + bar(1, 2)
+    end
+
+    foo()
+    retval = foo()
+}
+
+# Passing argument types to callees
+assert_equal '8.5', %q{
+    def foo(x, y)
+        x + y
+    end
+
+    def bar
+        foo(7, 1.5)
+    end
+
+    bar
+    bar
+}
+
+# Recursive Ruby-to-Ruby calls
+assert_equal '21', %q{
+    def fib(n)
+        if n < 2
+            return n
+        end
+
+        return fib(n-1) + fib(n-2)
+    end
+
+    r = fib(8)
+}
+
+# Ruby-to-Ruby call and C call
+assert_normal_exit %q{
+  def bar
+    puts('hi!')
+  end
+
+  def foo
+    bar
+  end
+
+  foo()
+  foo()
+}
+
+# Method aliasing
+assert_equal '42', %q{
+  class Foo
+    def method_a
+      42
+    end
+
+    alias method_b method_a
+
+    def method_a
+        :somethingelse
+    end
+  end
+
+  @obj = Foo.new
+
+  def test
+    @obj.method_b
+  end
+
+  test
+  test
+}
+
+# Method aliasing with method from parent class
+assert_equal '777', %q{
+  class A
+    def method_a
+      777
+    end
+  end
+
+  class B < A
+    alias method_b method_a
+  end
+
+  @obj = B.new
+
+  def test
+    @obj.method_b
+  end
+
+  test
+  test
+}
+
+# The hash method is a C function and uses the self argument
+assert_equal 'true', %q{
+    def lehashself
+        hash
+    end
+
+    a = lehashself
+    b = lehashself
+    a == b
+}
+
+# Method redefinition (code invalidation) test
+assert_equal '1', %q{
+    def ret1
+        return 1
+    end
+
+    klass = Class.new do
+        def alias_then_hash(klass, method_to_redefine)
+            # Redefine the method to be ret1
+            klass.alias_method(method_to_redefine, :ret1)
+            hash
+        end
+    end
+
+    instance = klass.new
+
+    i = 0
+    while i < 12
+        if i < 11
+            # Redefine the bar method
+            instance.alias_then_hash(klass, :bar)
+        else
+            # Redefine the hash method to be ret1
+            retval = instance.alias_then_hash(klass, :hash)
+        end
+        i += 1
+    end
+
+    retval
+}
+
+# Code invalidation and opt_getinlinecache
+assert_normal_exit %q{
+  class Foo; end
+
+  # Uses the class constant Foo
+  def use_constant(arg)
+    [Foo.new, arg]
+  end
+
+  def propagate_type
+    i = Array.new
+    i.itself # make it remember that i is on-heap
+    use_constant(i)
+  end
+
+  propagate_type
+  propagate_type
+  use_constant(Foo.new)
+  class Jo; end # bump global constant state
+  use_constant(3)
+}
+
+# Method redefinition (code invalidation) and GC
+assert_equal '7', %q{
+    def bar()
+        return 5
+    end
+
+    def foo()
+        bar()
+    end
+
+    foo()
+    foo()
+
+    def bar()
+        return 7
+    end
+
+    4.times { GC.start }
+
+    foo()
+    foo()
+}
+
+# Method redefinition with two block versions
+assert_equal '7', %q{
+    def bar()
+        return 5
+    end
+
+    def foo(n)
+        return ((n < 5)? 5:false), bar()
+    end
+
+    foo(4)
+    foo(4)
+    foo(10)
+    foo(10)
+
+    def bar()
+        return 7
+    end
+
+    4.times { GC.start }
+
+    foo(4)
+    foo(4)[1]
+}
+
+# Method redefinition while the method is on the stack
+assert_equal '[777, 1]', %q{
+    def foo
+        redef()
+        777
+    end
+
+    def redef
+        # Redefine the global foo
+        eval("def foo; 1; end", TOPLEVEL_BINDING)
+
+        # Collect dead code
+        GC.stress = true
+        GC.start
+
+        # But we will return to the original foo,
+        # which remains alive because it's on the stack
+    end
+
+    # Must produce [777, 1]
+    [foo, foo]
+}
+
+# Test for GC safety. Don't invalidate dead iseqs.
+assert_normal_exit %q{
+  Class.new do
+    def foo
+      itself
+    end
+
+    new.foo
+    new.foo
+    new.foo
+    new.foo
+  end
+
+  4.times { GC.start }
+  def itself
+    self
+  end
+}
+
+# test setinstancevariable on extended objects
+assert_equal '1', %q{
+  class Extended
+    attr_reader :one
+
+    def write_many
+      @a = 1
+      @b = 2
+      @c = 3
+      @d = 4
+      @one = 1
+    end
+  end
+
+  foo = Extended.new
+  foo.write_many
+  foo.write_many
+  foo.write_many
+}
+
+# test setinstancevariable on embedded objects
+assert_equal '1', %q{
+  class Embedded
+    attr_reader :one
+
+    def write_one
+      @one = 1
+    end
+  end
+
+  foo = Embedded.new
+  foo.write_one
+  foo.write_one
+  foo.write_one
+}
+
+# test setinstancevariable after extension
+assert_equal '[10, 11, 12, 13, 1]', %q{
+  class WillExtend
+    attr_reader :one
+
+    def make_extended
+      @foo1 = 10
+      @foo2 = 11
+      @foo3 = 12
+      @foo4 = 13
+    end
+
+    def write_one
+      @one = 1
+    end
+
+    def read_all
+      [@foo1, @foo2, @foo3, @foo4, @one]
+    end
+  end
+
+  foo = WillExtend.new
+  foo.write_one
+  foo.write_one
+  foo.make_extended
+  foo.write_one
+  foo.read_all
+}
+
+# test setinstancevariable on frozen object
+assert_equal 'object was not modified', %q{
+  class WillFreeze
+    def write
+      @ivar = 1
+    end
+  end
+
+  wf = WillFreeze.new
+  wf.write
+  wf.write
+  wf.freeze
+
+  begin
+    wf.write
+  rescue FrozenError
+    "object was not modified"
+  end
+}
+
+# Test getinstancevariable and inline caches
+assert_equal '6', %q{
+  class Foo
+    def initialize
+      @x1 = 1
+      @x2 = 1
+      @x2 = 1
+      @x3 = 1
+      @x4 = 3
+    end
+
+    def bar
+      x = 1
+      @x4 + @x4
+    end
+  end
+
+  f = Foo.new
+  f.bar
+  f.bar
+}
+
+# Test that getinstancevariable codegen checks for extended table size
+assert_equal "nil\n", %q{
+  class A
+    def read
+      @ins1000
+    end
+  end
+
+  ins = A.new
+  other = A.new
+  10.times { other.instance_variable_set(:"@otr#{_1}", 'value') }
+  1001.times { ins.instance_variable_set(:"@ins#{_1}", 'value') }
+
+  ins.read
+  ins.read
+  ins.read
+
+  p other.read
+}
+
+# Test that opt_aref checks the class of the receiver
+assert_equal 'special', %q{
+  def foo(array)
+    array[30]
+  end
+
+  foo([])
+  foo([])
+
+  special = []
+  def special.[](idx)
+    'special'
+  end
+
+  foo(special)
+}
+
+# Test that object references in generated code get marked and moved
+assert_equal "good", %q{
+  def bar
+    "good"
+  end
+
+  def foo
+    bar
+  end
+
+  foo
+  foo
+
+  begin
+    GC.verify_compaction_references(expand_heap: true, toward: :empty)
+  rescue NotImplementedError
+    # in case compaction isn't supported
+  end
+
+  foo
+}
+
+# Test polymorphic getinstancevariable. T_OBJECT -> T_STRING
+assert_equal 'ok', %q{
+  @hello = @h1 = @h2 = @h3 = @h4 = 'ok'
+  str = ""
+  str.instance_variable_set(:@hello, 'ok')
+
+  public def get
+    @hello
+  end
+
+  get
+  get
+  str.get
+  str.get
+}
+
+# Test polymorphic getinstancevariable, two different classes
+assert_equal 'ok', %q{
+  class Embedded
+    def initialize
+      @ivar = 0
+    end
+
+    def get
+      @ivar
+    end
+  end
+
+  class Extended < Embedded
+    def initialize
+      @v1 = @v2 = @v3 = @v4 = @ivar = 'ok'
+    end
+  end
+
+  embed = Embedded.new
+  extend = Extended.new
+
+  embed.get
+  embed.get
+  extend.get
+  extend.get
+}
+
+# Test megamorphic getinstancevariable
+assert_equal 'ok', %q{
+  parent = Class.new do
+    def initialize
+      @hello = @h1 = @h2 = @h3 = @h4 = 'ok'
+    end
+
+    def get
+      @hello
+    end
+  end
+
+  subclasses = 300.times.map { Class.new(parent) }
+  subclasses.each { _1.new.get }
+  parent.new.get
+}
+
+# Test polymorphic opt_aref. array -> hash
+assert_equal '[42, :key]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  index([], 0) # get over compilation threshold
+
+  [
+    index([42], 0),
+    index({0=>:key}, 0),
+  ]
+}
+
+# Test polymorphic opt_aref. hash -> array -> custom class
+assert_equal '[nil, nil, :custom]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  custom = Object.new
+  def custom.[](_idx)
+    :custom
+  end
+
+  index({}, 0) # get over compilation threshold
+
+  [
+    index({}, 0),
+    index([], 0),
+    index(custom, 0)
+  ]
+}
+
+# Test polymorphic opt_aref. array -> custom class
+assert_equal '[42, :custom]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  custom = Object.new
+  def custom.[](_idx)
+    :custom
+  end
+
+  index([], 0) # get over compilation threshold
+
+  [
+    index([42], 0),
+    index(custom, 0)
+  ]
+}
+
+# Test custom hash method with opt_aref
+assert_equal '[nil, :ok]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  custom = Object.new
+  def custom.hash
+    42
+  end
+
+  h = {custom => :ok}
+
+  [
+    index(h, 0),
+    index(h, custom)
+  ]
+}
+
+# Test default value block for Hash with opt_aref
+assert_equal '[42, :default]', %q{
+  def index(obj, idx)
+    obj[idx]
+  end
+
+  h = Hash.new { :default }
+  h[0] = 42
+
+  [
+    index(h, 0),
+    index(h, 1)
+  ]
+}
+
+# A regression test for making sure cfp->sp is proper when
+# hitting stubs. See :stub-sp-flush:
+assert_equal 'ok', %q{
+  class D
+    def foo
+      Object.new
+    end
+  end
+
+  GC.stress = true
+  10.times do
+    D.new.foo
+    #    ^
+    #  This hits a stub with sp_offset > 0
+  end
+
+  :ok
+}
+
+# Test polymorphic callsite, cfunc -> iseq
+assert_equal '[Cfunc, Iseq]', %q{
+  public def call_itself
+    itself # the polymorphic callsite
+  end
+
+  class Cfunc; end
+
+  class Iseq
+    def itself
+      self
+    end
+  end
+
+  call_itself # cross threshold
+
+  [Cfunc.call_itself, Iseq.call_itself]
+}
+
+# Test polymorphic callsite, iseq -> cfunc
+assert_equal '[Iseq, Cfunc]', %q{
+  public def call_itself
+    itself # the polymorphic callsite
+  end
+
+  class Cfunc; end
+
+  class Iseq
+    def itself
+      self
+    end
+  end
+
+  call_itself # cross threshold
+
+  [Iseq.call_itself, Cfunc.call_itself]
+}
+
+# attr_reader method
+assert_equal '[100, 299]', %q{
+  class A
+    attr_reader :foo
+
+    def initialize
+      @foo = 100
+    end
+
+    # Make it extended
+    def fill!
+      @bar = @jojo = @as = @sdfsdf = @foo = 299
+    end
+  end
+
+  def bar(ins)
+    ins.foo
+  end
+
+  ins = A.new
+  oth = A.new
+  oth.fill!
+
+  bar(ins)
+  bar(oth)
+
+  [bar(ins), bar(oth)]
+}
+
+# get ivar on object, then on hash
+assert_equal '[42, 100]', %q{
+  class Hash
+    attr_accessor :foo
+  end
+
+  class A
+    attr_reader :foo
+
+    def initialize
+      @foo = 42
+    end
+  end
+
+  def use(val)
+    val.foo
+  end
+
+
+  h = {}
+  h.foo = 100
+  obj = A.new
+
+  use(obj)
+  [use(obj), use(h)]
+}
+
+# get ivar on String
+assert_equal '[nil, nil, 42, 42]', %q{
+  # @foo to exercise the getinstancevariable instruction
+  public def get_foo
+    @foo
+  end
+
+  get_foo
+  get_foo # compile it for the top level object
+
+  class String
+    attr_reader :foo
+  end
+
+  def run
+    str = String.new
+
+    getter = str.foo
+    insn = str.get_foo
+
+    str.instance_variable_set(:@foo, 42)
+
+    [getter, insn, str.foo, str.get_foo]
+  end
+
+  run
+  run
+}
+
+# splatting an empty array on a getter
+assert_equal '42', %q{
+  @foo = 42
+  module Kernel
+    attr_reader :foo
+  end
+
+  def run
+    foo(*[])
+  end
+
+  run
+  run
+}
+
+# splatting an empty array on a specialized method
+assert_equal 'ok', %q{
+  def run
+    "ok".to_s(*[])
+  end
+
+  run
+  run
+}
+
+# splatting an single element array on a specialized method
+assert_equal '[1]', %q{
+  def run
+    [].<<(*[1])
+  end
+
+  run
+  run
+}
+
+# specialized method with wrong args
+assert_equal 'ok', %q{
+  def run(x)
+    "bad".to_s(123) if x
+  rescue
+    :ok
+  end
+
+  run(false)
+  run(true)
+}
+
+# getinstancevariable on Symbol
+assert_equal '[nil, nil]', %q{
+  # @foo to exercise the getinstancevariable instruction
+  public def get_foo
+    @foo
+  end
+
+  dyn_sym = ("a" + "b").to_sym
+  sym = :static
+
+  # compile get_foo
+  dyn_sym.get_foo
+  dyn_sym.get_foo
+
+  [dyn_sym.get_foo, sym.get_foo]
+}
+
+# attr_reader on Symbol
+assert_equal '[nil, nil]', %q{
+  class Symbol
+    attr_reader :foo
+  end
+
+  public def get_foo
+    foo
+  end
+
+  dyn_sym = ("a" + "b").to_sym
+  sym = :static
+
+  # compile get_foo
+  dyn_sym.get_foo
+  dyn_sym.get_foo
+
+  [dyn_sym.get_foo, sym.get_foo]
+}
+
+# passing too few arguments to method with optional parameters
+assert_equal 'raised', %q{
+  def opt(a, b = 0)
+  end
+
+  def use
+    opt
+  end
+
+  use rescue nil
+  begin
+    use
+    :ng
+  rescue ArgumentError
+    :raised
+  end
+}
+
+# passing too many arguments to method with optional parameters
+assert_equal 'raised', %q{
+  def opt(a, b = 0)
+  end
+
+  def use
+    opt(1, 2, 3, 4)
+  end
+
+  use rescue nil
+  begin
+    use
+    :ng
+  rescue ArgumentError
+    :raised
+  end
+}
+
+# test calling Ruby method with a block
+assert_equal '[1, 2, 42]', %q{
+  def thing(a, b)
+    [a, b, yield]
+  end
+
+  def use
+    thing(1,2) { 42 }
+  end
+
+  use
+  use
+}
+
+# test calling C method with a block
+assert_equal '[42, 42]', %q{
+  def use(array, initial)
+    array.reduce(initial) { |a, b| a + b }
+  end
+
+  use([], 0)
+  [use([2, 2], 38), use([14, 14, 14], 0)]
+}
+
+# test calling block param
+assert_equal '[1, 2, 42]', %q{
+  def foo(&block)
+    block.call
+  end
+
+  [foo {1}, foo {2}, foo {42}]
+}
+
+# test calling without block param
+assert_equal '[1, false, 2, false]', %q{
+  def bar
+    block_given? && yield
+  end
+
+  def foo(&block)
+    bar(&block)
+  end
+
+  [foo { 1 }, foo, foo { 2 }, foo]
+}
+
+# test calling block param failing
+assert_equal '42', %q{
+  def foo(&block)
+    block.call
+  end
+
+  foo {} # warmup
+
+  begin
+    foo
+  rescue NoMethodError => e
+    42 if nil == e.receiver
+  end
+}
+
+# test calling method taking block param
+assert_equal '[Proc, 1, 2, 3, Proc]', %q{
+  def three(a, b, c, &block)
+    [a, b, c, block.class]
+  end
+
+  def zero(&block)
+    block.class
+  end
+
+  def use_three
+    three(1, 2, 3) {}
+  end
+
+  def use_zero
+    zero {}
+  end
+
+  use_three
+  use_zero
+
+  [use_zero] + use_three
+}
+
+# test building empty array
+assert_equal '[]', %q{
+  def build_arr
+    []
+  end
+
+  build_arr
+  build_arr
+}
+
+# test building array of one element
+assert_equal '[5]', %q{
+  def build_arr(val)
+    [val]
+  end
+
+  build_arr(5)
+  build_arr(5)
+}
+
+# test building array of several element
+assert_equal '[5, 5, 5, 5, 5]', %q{
+  def build_arr(val)
+    [val, val, val, val, val]
+  end
+
+  build_arr(5)
+  build_arr(5)
+}
+
+# test building empty hash
+assert_equal '{}', %q{
+  def build_hash
+    {}
+  end
+
+  build_hash
+  build_hash
+}
+
+# test building hash with values
+assert_equal '{:foo=>:bar}', %q{
+  def build_hash(val)
+    { foo: val }
+  end
+
+  build_hash(:bar)
+  build_hash(:bar)
+}
+
+# test string interpolation with known types
+assert_equal 'foobar', %q{
+  def make_str
+    foo = -"foo"
+    bar = -"bar"
+    "#{foo}#{bar}"
+  end
+
+  make_str
+  make_str
+}
+
+# test string interpolation with unknown types
+assert_equal 'foobar', %q{
+  def make_str(foo, bar)
+    "#{foo}#{bar}"
+  end
+
+  make_str("foo", "bar")
+  make_str("foo", "bar")
+}
+
+# test string interpolation with known non-strings
+assert_equal 'foo123', %q{
+  def make_str
+    foo = -"foo"
+    bar = 123
+    "#{foo}#{bar}"
+  end
+
+  make_str
+  make_str
+}
+
+# test string interpolation with unknown non-strings
+assert_equal 'foo123', %q{
+  def make_str(foo, bar)
+    "#{foo}#{bar}"
+  end
+
+  make_str("foo", 123)
+  make_str("foo", 123)
+}
+
+# test that invalidation of String#to_s doesn't crash
+assert_equal 'meh', %q{
+  def inval_method
+    "".to_s
+  end
+
+  inval_method
+
+  class String
+    def to_s
+      "meh"
+    end
+  end
+
+  inval_method
+}
+
+# test that overriding to_s on a String subclass works consistently
+assert_equal 'meh', %q{
+  class MyString < String
+    def to_s
+      "meh"
+    end
+  end
+
+  def test_to_s(obj)
+    obj.to_s
+  end
+
+  OBJ = MyString.new
+
+  # Should return '' both times
+  test_to_s("")
+  test_to_s("")
+
+  # Can return '' if YJIT optimises String#to_s too aggressively
+  test_to_s(OBJ)
+  test_to_s(OBJ)
+}
+
+# test string interpolation with overridden to_s
+assert_equal 'foo', %q{
+  class String
+    def to_s
+      "bad"
+    end
+  end
+
+  def make_str(foo)
+    "#{foo}"
+  end
+
+  make_str("foo")
+  make_str("foo")
+}
+
+# Test that String unary plus returns the same object ID for an unfrozen string.
+assert_equal 'true', %q{
+  def jittable_method
+    str = "bar"
+
+    old_obj_id = str.object_id
+    uplus_str = +str
+
+    uplus_str.object_id == old_obj_id
+  end
+  jittable_method
+}
+
+# Test that String unary plus returns a different unfrozen string when given a frozen string
+assert_equal 'false', %q{
+  # Logic needs to be inside an ISEQ, such as a method, for YJIT to compile it
+  def jittable_method
+    frozen_str = "foo".freeze
+
+    old_obj_id = frozen_str.object_id
+    uplus_str = +frozen_str
+
+    uplus_str.object_id == old_obj_id || uplus_str.frozen?
+  end
+
+  jittable_method
+}
+
+# String-subclass objects should behave as expected inside string-interpolation via concatstrings
+assert_equal 'monkeys / monkeys, yo!', %q{
+  class MyString < String
+    # This is a terrible idea in production code, but we'd like YJIT to match CRuby
+    def to_s
+      super + ", yo!"
+    end
+  end
+
+  def jittable_method
+    m = MyString.new('monkeys')
+    "#{m} / #{m.to_s}"
+  end
+
+  jittable_method
+}
+
+# String-subclass objects should behave as expected for string equality
+assert_equal 'false', %q{
+  class MyString < String
+    # This is a terrible idea in production code, but we'd like YJIT to match CRuby
+    def ==(b)
+      "#{self}_" == b
+    end
+  end
+
+  def jittable_method
+    ma = MyString.new("a")
+
+    # Check equality with string-subclass receiver
+    ma == "a" || ma != "a_" ||
+      # Check equality with string receiver
+      "a_" == ma || "a" != ma ||
+      # Check equality between string subclasses
+      ma != MyString.new("a_") ||
+      # Make sure "string always equals itself" check isn't used with overridden equality
+      ma == ma
+  end
+  jittable_method
+}
+
+# Test to_s duplicates a string subclass object but not a string
+assert_equal 'false', %q{
+  class MyString < String; end
+
+  def jittable_method
+    a = "a"
+    ma = MyString.new("a")
+
+    a.object_id != a.to_s.object_id ||
+      ma.object_id == ma.to_s.object_id
+  end
+  jittable_method
+}
+
+# Test freeze on string subclass
+assert_equal 'true', %q{
+  class MyString < String; end
+
+  def jittable_method
+    fma = MyString.new("a").freeze
+
+    # Freezing a string subclass should not duplicate it
+    fma.object_id == fma.freeze.object_id
+  end
+  jittable_method
+}
+
+# Test unary minus on string subclass
+assert_equal 'true', %q{
+  class MyString < String; end
+
+  def jittable_method
+    ma = MyString.new("a")
+    fma = MyString.new("a").freeze
+
+    # Unary minus on frozen string subclass should not duplicate it
+    fma.object_id == (-fma).object_id &&
+      # Unary minus on unfrozen string subclass should duplicate it
+      ma.object_id != (-ma).object_id
+  end
+  jittable_method
+}
+
+# Test unary plus on string subclass
+assert_equal 'true', %q{
+  class MyString < String; end
+
+  def jittable_method
+    fma = MyString.new("a").freeze
+
+    # Unary plus on frozen string subclass should not duplicate it
+    fma.object_id != (+fma).object_id
+  end
+  jittable_method
+}
+
+# Test << operator on string subclass
+assert_equal 'abab', %q{
+  class MyString < String; end
+
+  def jittable_method
+    a = -"a"
+    mb = MyString.new("b")
+
+    buf = String.new
+    mbuf = MyString.new
+
+    buf << a << mb
+    mbuf << a << mb
+
+    buf + mbuf
+  end
+  jittable_method
+}
+
+# test invokebuiltin as used in struct assignment
+assert_equal '123', %q{
+  def foo(obj)
+    obj.foo = 123
+  end
+
+  struct = Struct.new(:foo)
+  obj = struct.new
+  foo(obj)
+  foo(obj)
+}
+
+# test invokebuiltin_delegate as used inside Dir.open
+assert_equal '.', %q{
+  def foo(path)
+    Dir.open(path).path
+  end
+
+  foo(".")
+  foo(".")
+}
+
+# test invokebuiltin_delegate_leave in method called from jit
+assert_normal_exit %q{
+  def foo(obj)
+    obj.clone
+  end
+
+  foo(Object.new)
+  foo(Object.new)
+}
+
+# test invokebuiltin_delegate_leave in method called from cfunc
+assert_normal_exit %q{
+  def foo(obj)
+    [obj].map(&:clone)
+  end
+
+  foo(Object.new)
+  foo(Object.new)
+}
+
+# defining TrueClass#!
+assert_equal '[false, false, :ok]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  x = foo(true)
+  y = foo(true)
+
+  class TrueClass
+    def !
+      :ok
+    end
+  end
+
+  z = foo(true)
+
+  [x, y, z]
+}
+
+# defining FalseClass#!
+assert_equal '[true, true, :ok]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  x = foo(false)
+  y = foo(false)
+
+  class FalseClass
+    def !
+      :ok
+    end
+  end
+
+  z = foo(false)
+
+  [x, y, z]
+}
+
+# defining NilClass#!
+assert_equal '[true, true, :ok]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  x = foo(nil)
+  y = foo(nil)
+
+  class NilClass
+    def !
+      :ok
+    end
+  end
+
+  z = foo(nil)
+
+  [x, y, z]
+}
+
+# polymorphic opt_not
+assert_equal '[true, true, false, false, false, false, false]', %q{
+  def foo(obj)
+    !obj
+  end
+
+  foo(0)
+  [foo(nil), foo(false), foo(true), foo([]), foo(0), foo(4.2), foo(:sym)]
+}
+
+# getlocal with 2 levels
+assert_equal '7', %q{
+  def foo(foo, bar)
+    while foo > 0
+      while bar > 0
+        return foo + bar
+      end
+    end
+  end
+
+  foo(5,2)
+  foo(5,2)
+}
+
+# test pattern matching
+assert_equal '[:ok, :ok]', %q{
+  class C
+    def destructure_keys
+      {}
+    end
+  end
+
+  pattern_match = ->(i) do
+    case i
+    in a: 0
+      :ng
+    else
+      :ok
+    end
+  end
+
+  [{}, C.new].map(&pattern_match)
+}
+
+# Call to object with singleton
+assert_equal '123', %q{
+  obj = Object.new
+  def obj.foo
+    123
+  end
+
+  def foo(obj)
+    obj.foo()
+  end
+
+  foo(obj)
+  foo(obj)
+}
+
+# Call method on an object that has a non-material
+# singleton class.
+# TODO: assert that it takes no side exits? This
+# test case revealed that we were taking exits unnecessarily.
+assert_normal_exit %q{
+  def foo(obj)
+    obj.itself
+  end
+
+  o = Object.new.singleton_class
+  foo(o)
+  foo(o)
+}
+
+# Call to singleton class
+assert_equal '123', %q{
+  class Foo
+    def self.foo
+      123
+    end
+  end
+
+  def foo(obj)
+    obj.foo()
+  end
+
+  foo(Foo)
+  foo(Foo)
+}
+
+# invokesuper edge case
+assert_equal '[:A, [:A, :B]]', %q{
+  class B
+    def foo = :B
+  end
+
+  class A < B
+    def foo = [:A, super()]
+  end
+
+  A.new.foo
+  A.new.foo # compile A#foo
+
+  class C < A
+    define_method(:bar, A.instance_method(:foo))
+  end
+
+  C.new.bar
+}
+
+# Same invokesuper bytecode, multiple destinations
+assert_equal '[:Forward, :SecondTerminus]', %q{
+  module Terminus
+    def foo = :Terminus
+  end
+
+  module SecondTerminus
+    def foo = :SecondTerminus
+  end
+
+
+  module Forward
+    def foo = [:Forward, super]
+  end
+
+  class B
+    include SecondTerminus
+  end
+
+  class A < B
+    include Terminus
+    include Forward
+  end
+
+  A.new.foo
+  A.new.foo # compile
+
+  class B
+    include Forward
+    alias bar foo
+  end
+
+  # A.ancestors.take(5) == [A, Forward, Terminus, B, Forward, SecondTerminus]
+
+  A.new.bar
+}
+
+# invokesuper calling into itself
+assert_equal '[:B, [:B, :m]]', %q{
+  module M
+    def foo = :m
+  end
+
+  class B
+    include M
+    def foo = [:B, super]
+  end
+
+  ins = B.new
+  ins.singleton_class # materialize the singleton class
+  ins.foo
+  ins.foo # compile
+
+  ins.singleton_class.define_method(:bar, B.instance_method(:foo))
+  ins.bar
+}
+
+# invokesuper changed ancestor
+assert_equal '[:A, [:M, :B]]', %q{
+  class B
+    def foo
+      :B
+    end
+  end
+
+  class A < B
+    def foo
+      [:A, super]
+    end
+  end
+
+  module M
+    def foo
+      [:M, super]
+    end
+  end
+
+  ins = A.new
+  ins.foo
+  ins.foo
+  A.include(M)
+  ins.foo
+}
+
+# invokesuper changed ancestor via prepend
+assert_equal '[:A, [:M, :B]]', %q{
+  class B
+    def foo
+      :B
+    end
+  end
+
+  class A < B
+    def foo
+      [:A, super]
+    end
+  end
+
+  module M
+    def foo
+      [:M, super]
+    end
+  end
+
+  ins = A.new
+  ins.foo
+  ins.foo
+  B.prepend(M)
+  ins.foo
+}
+
+# invokesuper replaced method
+assert_equal '[:A, :Btwo]', %q{
+  class B
+    def foo
+      :B
+    end
+  end
+
+  class A < B
+    def foo
+      [:A, super]
+    end
+  end
+
+  ins = A.new
+  ins.foo
+  ins.foo
+  class B
+    def foo
+      :Btwo
+    end
+  end
+  ins.foo
+}
+
+# Call to fixnum
+assert_equal '[true, false]', %q{
+  def is_odd(obj)
+    obj.odd?
+  end
+
+  is_odd(1)
+  is_odd(1)
+
+  [is_odd(123), is_odd(456)]
+}
+
+# Call to bignum
+assert_equal '[true, false]', %q{
+  def is_odd(obj)
+    obj.odd?
+  end
+
+  bignum = 99999999999999999999
+  is_odd(bignum)
+  is_odd(bignum)
+
+  [is_odd(bignum), is_odd(bignum+1)]
+}
+
+# Call to fixnum and bignum
+assert_equal '[true, false, true, false]', %q{
+  def is_odd(obj)
+    obj.odd?
+  end
+
+  bignum = 99999999999999999999
+  is_odd(bignum)
+  is_odd(bignum)
+  is_odd(123)
+  is_odd(123)
+
+  [is_odd(123), is_odd(456), is_odd(bignum), is_odd(bignum+1)]
+}
+
+# Call to static and dynamic symbol
+assert_equal 'bar', %q{
+  def to_string(obj)
+    obj.to_s
+  end
+
+  to_string(:foo)
+  to_string(:foo)
+  to_string((-"bar").to_sym)
+  to_string((-"bar").to_sym)
+}
+
+# Call to flonum and heap float
+assert_equal '[nil, nil, nil, 1]', %q{
+  def is_inf(obj)
+    obj.infinite?
+  end
+
+  is_inf(0.0)
+  is_inf(0.0)
+  is_inf(1e256)
+  is_inf(1e256)
+
+  [
+    is_inf(0.0),
+    is_inf(1.0),
+    is_inf(1e256),
+    is_inf(1.0/0.0)
+  ]
+}
+
+assert_equal '[1, 2, 3, 4, 5]', %q{
+  def splatarray
+    [*(1..5)]
+  end
+
+  splatarray
+  splatarray
+}
+
+assert_equal '[1, 1, 2, 1, 2, 3]', %q{
+  def expandarray
+    arr = [1, 2, 3]
+
+    a, = arr
+    b, c, = arr
+    d, e, f = arr
+
+    [a, b, c, d, e, f]
+  end
+
+  expandarray
+  expandarray
+}
+
+assert_equal '[1, 1]', %q{
+  def expandarray_useless_splat
+    arr = (1..10).to_a
+
+    a, * = arr
+    b, (*) = arr
+
+    [a, b]
+  end
+
+  expandarray_useless_splat
+  expandarray_useless_splat
+}
+
+assert_equal '[:not_heap, nil, nil]', %q{
+  def expandarray_not_heap
+    a, b, c = :not_heap
+    [a, b, c]
+  end
+
+  expandarray_not_heap
+  expandarray_not_heap
+}
+
+assert_equal '[:not_array, nil, nil]', %q{
+  def expandarray_not_array(obj)
+    a, b, c = obj
+    [a, b, c]
+  end
+
+  obj = Object.new
+  def obj.to_ary
+    [:not_array]
+  end
+
+  expandarray_not_array(obj)
+  expandarray_not_array(obj)
+}
+
+assert_equal '[1, 2, nil]', %q{
+  def expandarray_rhs_too_small
+    a, b, c = [1, 2]
+    [a, b, c]
+  end
+
+  expandarray_rhs_too_small
+  expandarray_rhs_too_small
+}
+
+assert_equal '[1, [2]]', %q{
+  def expandarray_splat
+    a, *b = [1, 2]
+    [a, b]
+  end
+
+  expandarray_splat
+  expandarray_splat
+}
+
+assert_equal '2', %q{
+  def expandarray_postarg
+    *, a = [1, 2]
+    a
+  end
+
+  expandarray_postarg
+  expandarray_postarg
+}
+
+assert_equal '10', %q{
+  obj = Object.new
+  val = nil
+  obj.define_singleton_method(:to_ary) { val = 10; [] }
+
+  def expandarray_always_call_to_ary(object)
+    * = object
+  end
+
+  expandarray_always_call_to_ary(obj)
+  expandarray_always_call_to_ary(obj)
+
+  val
+}
+
+# regression test of local type change
+assert_equal '1.1', %q{
+def bar(baz, quux)
+  if baz.integer?
+    baz, quux = quux, nil
+  end
+  baz.to_s
+end
+
+bar(123, 1.1)
+bar(123, 1.1)
+}
+
+# test enabling a line TracePoint in a C method call
+assert_equal '[[:line, true]]', %q{
+  events = []
+  events.instance_variable_set(
+    :@tp,
+    TracePoint.new(:line) { |tp| events << [tp.event, tp.lineno] if tp.path == __FILE__ }
+  )
+  def events.to_str
+    @tp.enable; ''
+  end
+
+  # Stay in generated code while enabling tracing
+  def events.compiled(obj)
+    String(obj)
+    @tp.disable; __LINE__
+  end
+
+  line = events.compiled(events)
+  events[0][-1] = (events[0][-1] == line)
+
+  events
+}
+
+# test enabling a c_return TracePoint in a C method call
+assert_equal '[[:c_return, :String, :string_alias, "events_to_str"]]', %q{
+  events = []
+  events.instance_variable_set(:@tp, TracePoint.new(:c_return) { |tp| events << [tp.event, tp.method_id, tp.callee_id, tp.return_value] })
+  def events.to_str
+    @tp.enable; 'events_to_str'
+  end
+
+  # Stay in generated code while enabling tracing
+  alias string_alias String
+  def events.compiled(obj)
+    string_alias(obj)
+    @tp.disable
+  end
+
+  events.compiled(events)
+
+  events
+} unless defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # MJIT calls extra Ruby methods
+
+# test enabling a TracePoint that targets a particular line in a C method call
+assert_equal '[true]', %q{
+  events = []
+  events.instance_variable_set(:@tp, TracePoint.new(:line) { |tp| events << tp.lineno })
+  def events.to_str
+    @tp.enable(target: method(:compiled))
+    ''
+  end
+
+  # Stay in generated code while enabling tracing
+  def events.compiled(obj)
+    String(obj)
+    __LINE__
+  end
+
+  line = events.compiled(events)
+  events[0] = (events[0] == line)
+
+  events
+}
+
+# test enabling tracing in the middle of splatarray
+assert_equal '[true]', %q{
+  events = []
+  obj = Object.new
+  obj.instance_variable_set(:@tp, TracePoint.new(:line) { |tp| events << tp.lineno })
+  def obj.to_a
+    @tp.enable(target: method(:compiled))
+    []
+  end
+
+  # Enable tracing in the middle of the splatarray instruction
+  def obj.compiled(obj)
+    * = *obj
+    __LINE__
+  end
+
+  obj.compiled([])
+  line = obj.compiled(obj)
+  events[0] = (events[0] == line)
+
+  events
+}
+
+# test enabling tracing in the middle of opt_aref. Different since the codegen
+# for it ends in a jump.
+assert_equal '[true]', %q{
+  def lookup(hash, tp)
+    hash[42]
+    tp.disable; __LINE__
+  end
+
+  lines = []
+  tp = TracePoint.new(:line) { lines << _1.lineno if _1.path == __FILE__ }
+
+  lookup(:foo, tp)
+  lookup({}, tp)
+
+  enable_tracing_on_missing = Hash.new { tp.enable }
+
+  expected_line = lookup(enable_tracing_on_missing, tp)
+
+  lines[0] = true if lines[0] == expected_line
+
+  lines
+}
+
+# test enabling c_call tracing before compiling
+assert_equal '[[:c_call, :itself]]', %q{
+  def shouldnt_compile
+    itself
+  end
+
+  events = []
+  tp = TracePoint.new(:c_call) { |tp| events << [tp.event, tp.method_id] }
+
+  # assume first call compiles
+  tp.enable { shouldnt_compile }
+
+  events
+} unless defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # MJIT calls extra Ruby methods
+
+# test enabling c_return tracing before compiling
+assert_equal '[[:c_return, :itself, main]]', %q{
+  def shouldnt_compile
+    itself
+  end
+
+  events = []
+  tp = TracePoint.new(:c_return) { |tp| events << [tp.event, tp.method_id, tp.return_value] }
+
+  # assume first call compiles
+  tp.enable { shouldnt_compile }
+
+  events
+} unless defined?(RubyVM::MJIT) && RubyVM::MJIT.enabled? # MJIT calls extra Ruby methods
+
+# test c_call invalidation
+assert_equal '[[:c_call, :itself]]', %q{
+  # enable the event once to make sure invalidation
+  # happens the second time we enable it
+  TracePoint.new(:c_call) {}.enable{}
+
+  def compiled
+    itself
+  end
+
+  # assume first call compiles
+  compiled
+
+  events = []
+  tp = TracePoint.new(:c_call) { |tp| events << [tp.event, tp.method_id] }
+  tp.enable { compiled }
+
+  events
+}
+
+# test enabling tracing for a suspended fiber
+assert_equal '[[:return, 42]]', %q{
+  def traced_method
+    Fiber.yield
+    42
+  end
+
+  events = []
+  tp = TracePoint.new(:return) { events << [_1.event, _1.return_value] }
+  # assume first call compiles
+  fiber = Fiber.new { traced_method }
+  fiber.resume
+  tp.enable(target: method(:traced_method))
+  fiber.resume
+
+  events
+}
+
+# test compiling on non-tracing ractor then running on a tracing one
+assert_equal '[:itself]', %q{
+  def traced_method
+    itself
+  end
+
+  tracing_ractor = Ractor.new do
+    # 1: start tracing
+    events = []
+    tp = TracePoint.new(:c_call) { events << _1.method_id }
+    tp.enable
+    Ractor.yield(nil)
+
+    # 3: run compiled method on tracing ractor
+    Ractor.yield(nil)
+    traced_method
+
+    events
+  ensure
+    tp&.disable
+  end
+
+  tracing_ractor.take
+
+  # 2: compile on non tracing ractor
+  traced_method
+
+  tracing_ractor.take
+  tracing_ractor.take
+}
+
+# Try to hit a lazy branch stub while another ractor enables tracing
+assert_equal '42', %q{
+  def compiled(arg)
+    if arg
+      arg + 1
+    else
+      itself
+      itself
+    end
+  end
+
+  ractor = Ractor.new do
+    compiled(false)
+    Ractor.yield(nil)
+    compiled(41)
+  end
+
+  tp = TracePoint.new(:line) { itself }
+  ractor.take
+  tp.enable
+
+  ractor.take
+}
+
+# Test equality with changing types
+assert_equal '[true, false, false, false]', %q{
+  def eq(a, b)
+    a == b
+  end
+
+  [
+    eq("foo", "foo"),
+    eq("foo", "bar"),
+    eq(:foo, "bar"),
+    eq("foo", :bar)
+  ]
+}
+
+# Redefined String eq
+assert_equal 'true', %q{
+  class String
+    def ==(other)
+      true
+    end
+  end
+
+  def eq(a, b)
+    a == b
+  end
+
+  eq("foo", "bar")
+  eq("foo", "bar")
+}
+
+# Redefined Integer eq
+assert_equal 'true', %q{
+  class Integer
+    def ==(other)
+      true
+    end
+  end
+
+  def eq(a, b)
+    a == b
+  end
+
+  eq(1, 2)
+  eq(1, 2)
+}
+
+# aset on array with invalid key
+assert_normal_exit %q{
+  def foo(arr)
+    arr[:foo] = 123
+  end
+
+  foo([1]) rescue nil
+  foo([1]) rescue nil
+}
+
+# test ractor exception on when setting ivar
+assert_equal '42',  %q{
+  class A
+    def self.foo
+      _foo = 1
+      _bar = 2
+      begin
+        @bar = _foo + _bar
+      rescue Ractor::IsolationError
+        42
+      end
+    end
+  end
+
+  A.foo
+  A.foo
+
+  Ractor.new { A.foo }.take
+}
+
+assert_equal '["plain", "special", "sub", "plain"]', %q{
+  def foo(arg)
+    arg.to_s
+  end
+
+  class Sub < String
+  end
+
+  special = String.new("special")
+  special.singleton_class
+
+  [
+    foo("plain"),
+    foo(special),
+    foo(Sub.new("sub")),
+    foo("plain")
+  ]
+}
+
+assert_equal '["sub", "sub"]', %q{
+  def foo(arg)
+    arg.to_s
+  end
+
+  class Sub < String
+    def to_s
+      super
+    end
+  end
+
+  sub = Sub.new("sub")
+
+  [foo(sub), foo(sub)]
+}
+
+assert_equal '[1]', %q{
+  def kwargs(value:)
+    value
+  end
+
+  5.times.map { kwargs(value: 1) }.uniq
+}
+
+assert_equal '[:ok]', %q{
+  def kwargs(value:)
+    value
+  end
+
+  5.times.map { kwargs() rescue :ok }.uniq
+}
+
+assert_equal '[:ok]', %q{
+  def kwargs(a:, b: nil)
+    value
+  end
+
+  5.times.map { kwargs(b: 123) rescue :ok }.uniq
+}
+
+assert_equal '[[1, 2]]', %q{
+  def kwargs(left:, right:)
+    [left, right]
+  end
+
+  5.times.flat_map do
+    [
+      kwargs(left: 1, right: 2),
+      kwargs(right: 2, left: 1)
+    ]
+  end.uniq
+}
+
+assert_equal '[[1, 2]]', %q{
+  def kwargs(lead, kwarg:)
+    [lead, kwarg]
+  end
+
+  5.times.map { kwargs(1, kwarg: 2) }.uniq
+}
+
+# optional and keyword args
+assert_equal '[[1, 2, 3]]', %q{
+  def opt_and_kwargs(a, b=2, c: nil)
+    [a,b,c]
+  end
+
+  5.times.map { opt_and_kwargs(1, c: 3) }.uniq
+}
+
+assert_equal '[[1, 2, 3]]', %q{
+  def opt_and_kwargs(a, b=nil, c: nil)
+    [a,b,c]
+  end
+
+  5.times.map { opt_and_kwargs(1, 2, c: 3) }.uniq
+}
+
+# Bug #18453
+assert_equal '[[1, nil, 2]]', %q{
+  def opt_and_kwargs(a = {}, b: nil, c: nil)
+    [a, b, c]
+  end
+
+  5.times.map { opt_and_kwargs(1, c: 2) }.uniq
+}
+
+assert_equal '[[{}, nil, 1]]', %q{
+  def opt_and_kwargs(a = {}, b: nil, c: nil)
+    [a, b, c]
+  end
+
+  5.times.map { opt_and_kwargs(c: 1) }.uniq
+}
+
+# leading and keyword arguments are swapped into the right order
+assert_equal '[[1, 2, 3, 4, 5, 6]]', %q{
+  def kwargs(five, six, a:, b:, c:, d:)
+    [a, b, c, d, five, six]
+  end
+
+  5.times.flat_map do
+    [
+      kwargs(5, 6, a: 1, b: 2, c: 3, d: 4),
+      kwargs(5, 6, a: 1, b: 2, d: 4, c: 3),
+      kwargs(5, 6, a: 1, c: 3, b: 2, d: 4),
+      kwargs(5, 6, a: 1, c: 3, d: 4, b: 2),
+      kwargs(5, 6, a: 1, d: 4, b: 2, c: 3),
+      kwargs(5, 6, a: 1, d: 4, c: 3, b: 2),
+      kwargs(5, 6, b: 2, a: 1, c: 3, d: 4),
+      kwargs(5, 6, b: 2, a: 1, d: 4, c: 3),
+      kwargs(5, 6, b: 2, c: 3, a: 1, d: 4),
+      kwargs(5, 6, b: 2, c: 3, d: 4, a: 1),
+      kwargs(5, 6, b: 2, d: 4, a: 1, c: 3),
+      kwargs(5, 6, b: 2, d: 4, c: 3, a: 1),
+      kwargs(5, 6, c: 3, a: 1, b: 2, d: 4),
+      kwargs(5, 6, c: 3, a: 1, d: 4, b: 2),
+      kwargs(5, 6, c: 3, b: 2, a: 1, d: 4),
+      kwargs(5, 6, c: 3, b: 2, d: 4, a: 1),
+      kwargs(5, 6, c: 3, d: 4, a: 1, b: 2),
+      kwargs(5, 6, c: 3, d: 4, b: 2, a: 1),
+      kwargs(5, 6, d: 4, a: 1, b: 2, c: 3),
+      kwargs(5, 6, d: 4, a: 1, c: 3, b: 2),
+      kwargs(5, 6, d: 4, b: 2, a: 1, c: 3),
+      kwargs(5, 6, d: 4, b: 2, c: 3, a: 1),
+      kwargs(5, 6, d: 4, c: 3, a: 1, b: 2),
+      kwargs(5, 6, d: 4, c: 3, b: 2, a: 1)
+    ]
+  end.uniq
+}
+
+# implicit hashes get skipped and don't break compilation
+assert_equal '[[:key]]', %q{
+  def implicit(hash)
+    hash.keys
+  end
+
+  5.times.map { implicit(key: :value) }.uniq
+}
+
+# default values on keywords don't mess up argument order
+assert_equal '[2]', %q{
+  def default_value
+    1
+  end
+
+  def default_expression(value: default_value)
+    value
+  end
+
+  5.times.map { default_expression(value: 2) }.uniq
+}
+
+# constant default values on keywords
+assert_equal '[3]', %q{
+  def default_expression(value: 3)
+    value
+  end
+
+  5.times.map { default_expression }.uniq
+}
+
+# non-constant default values on keywords
+assert_equal '[3]', %q{
+  def default_value
+    3
+  end
+
+  def default_expression(value: default_value)
+    value
+  end
+
+  5.times.map { default_expression }.uniq
+}
+
+# reordered optional kwargs
+assert_equal '[[100, 1]]', %q{
+  def foo(capacity: 100, max: nil)
+    [capacity, max]
+  end
+
+  5.times.map { foo(max: 1) }.uniq
+}
+
+# invalid lead param
+assert_equal 'ok', %q{
+  def bar(baz: 2)
+    baz
+  end
+
+  def foo
+    bar(1, baz: 123)
+  end
+
+  begin
+    foo
+    foo
+  rescue ArgumentError => e
+    print "ok"
+  end
+}
+
+# reordered required kwargs
+assert_equal '[[1, 2, 3, 4]]', %q{
+  def foo(default1: 1, required1:, default2: 3, required2:)
+    [default1, required1, default2, required2]
+  end
+
+  5.times.map { foo(required1: 2, required2: 4) }.uniq
+}
+
+# reordered default expression kwargs
+assert_equal '[[:one, :two, 3]]', %q{
+  def foo(arg1: (1+0), arg2: (2+0), arg3: (3+0))
+    [arg1, arg2, arg3]
+  end
+
+  5.times.map { foo(arg2: :two, arg1: :one) }.uniq
+}
+
+# complex kwargs
+assert_equal '[[1, 2, 3, 4]]', %q{
+  def foo(required:, specified: 999, simple_default: 3, complex_default: "4".to_i)
+    [required, specified, simple_default, complex_default]
+  end
+
+  5.times.map { foo(specified: 2, required: 1) }.uniq
+}
+
+# cfunc kwargs
+assert_equal '{:foo=>123}', %q{
+  def foo(bar)
+    bar.store(:value, foo: 123)
+    bar[:value]
+  end
+
+  foo({})
+  foo({})
+}
+
+# cfunc kwargs
+assert_equal '{:foo=>123}', %q{
+  def foo(bar)
+    bar.replace(foo: 123)
+  end
+
+  foo({})
+  foo({})
+}
+
+# cfunc kwargs
+assert_equal '{:foo=>123, :bar=>456}', %q{
+  def foo(bar)
+    bar.replace(foo: 123, bar: 456)
+  end
+
+  foo({})
+  foo({})
+}
+
+# variadic cfunc kwargs
+assert_equal '{:foo=>123}', %q{
+  def foo(bar)
+    bar.merge(foo: 123)
+  end
+
+  foo({})
+  foo({})
+}
+
+# optimized cfunc kwargs
+assert_equal 'false', %q{
+  def foo
+    :foo.eql?(foo: :foo)
+  end
+
+  foo
+  foo
+}
+
+# attr_reader on frozen object
+assert_equal 'false', %q{
+  class Foo
+    attr_reader :exception
+
+    def failed?
+      !exception.nil?
+    end
+  end
+
+  foo = Foo.new.freeze
+  foo.failed?
+  foo.failed?
+}
+
+# regression test for doing kwarg shuffle before checking for interrupts
+assert_equal 'ok', %q{
+  def new_media_drop(attributes:, product_drop:, context:, sources:)
+    nil.nomethod rescue nil # force YJIT to bail to side exit
+
+    [attributes, product_drop, context, sources]
+  end
+
+  def load_medias(product_drop: nil, raw_medias:, context:)
+    raw_medias.map do |raw_media|
+      case new_media_drop(context: context, attributes: raw_media, product_drop: product_drop, sources: [])
+      in [Hash, ProductDrop, Context, Array]
+      else
+        raise "bad shuffle"
+      end
+    end
+  end
+
+  class Context; end
+
+  class ProductDrop
+    attr_reader :title
+    def initialize(title)
+      @title = title
+    end
+  end
+
+  # Make a thread so we have thread switching interrupts
+  th = Thread.new do
+    while true; end
+  end
+  1_000.times do |i|
+    load_medias(product_drop: ProductDrop.new("foo"), raw_medias: [{}, {}], context: Context.new)
+  end
+  th.kill.join
+
+  :ok
+}
+
+# regression test for tracing attr_accessor methods.
+assert_equal "true", %q{
+    c = Class.new do
+      attr_accessor :x
+      alias y x
+      alias y= x=
+    end
+    obj = c.new
+
+    ar_meth = obj.method(:x)
+    aw_meth = obj.method(:x=)
+    aar_meth = obj.method(:y)
+    aaw_meth = obj.method(:y=)
+    events = []
+    trace = TracePoint.new(:c_call, :c_return){|tp|
+      next if tp.path != __FILE__
+      next if tp.method_id == :call
+      case tp.event
+      when :c_call
+        events << [tp.event, tp.method_id, tp.callee_id]
+      when :c_return
+        events << [tp.event, tp.method_id, tp.callee_id, tp.return_value]
+      end
+    }
+    test_proc = proc do
+      obj.x = 1
+      obj.x
+      obj.y = 2
+      obj.y
+      aw_meth.call(1)
+      ar_meth.call
+      aaw_meth.call(2)
+      aar_meth.call
+    end
+    test_proc.call # populate call caches
+    trace.enable(&test_proc)
+    expected = [
+      [:c_call, :x=, :x=],
+      [:c_return, :x=, :x=, 1],
+      [:c_call, :x, :x],
+      [:c_return, :x, :x, 1],
+      [:c_call, :x=, :y=],
+      [:c_return, :x=, :y=, 2],
+      [:c_call, :x, :y],
+      [:c_return, :x, :y, 2],
+    ] * 2
+
+    expected == events
+}
+
+# duphash
+assert_equal '{:foo=>123}', %q{
+  def foo
+    {foo: 123}
+  end
+
+  foo
+  foo
+}
+
+# newhash
+assert_equal '{:foo=>2}', %q{
+  def foo
+    {foo: 1+1}
+  end
+
+  foo
+  foo
+}
+
+# block invalidation edge case
+assert_equal 'undef', %q{
+  class A
+    def foo(arg)
+      arg.times { A.remove_method(:bar) }
+      self
+    end
+
+    def bar
+      4
+    end
+
+    def use(arg)
+      # two consecutive sends. When bar is removed, the return address
+      # for calling it is already on foo's control frame
+      foo(arg).bar
+    rescue NoMethodError
+      :undef
+    end
+  end
+
+  A.new.use 0
+  A.new.use 0
+  A.new.use 1
+}
+
+# block invalidation edge case
+assert_equal 'ok', %q{
+  class A
+    Good = :ng
+    def foo(arg)
+      arg.times { A.const_set(:Good, :ok) }
+      self
+    end
+
+    def id(arg)
+      arg
+    end
+
+    def use(arg)
+      # send followed by an opt_getinlinecache.
+      # The return address remains on the control frame
+      # when opt_getinlinecache is invalidated.
+      foo(arg).id(Good)
+    end
+  end
+
+  A.new.use 0
+  A.new.use 0
+  A.new.use 1
+}
+
+assert_equal 'ok', %q{
+  # test hitting a branch stub when out of memory
+  def nimai(jita)
+    if jita
+      :ng
+    else
+      :ok
+    end
+  end
+
+  nimai(true)
+  nimai(true)
+
+  RubyVM::YJIT.simulate_oom! if defined?(RubyVM::YJIT)
+
+  nimai(false)
+}
+
+assert_equal 'new', %q{
+  # test block invalidation while out of memory
+  def foo
+    :old
+  end
+
+  def test
+    foo
+  end
+
+  def bar
+    :bar
+  end
+
+
+  test
+  test
+
+  RubyVM::YJIT.simulate_oom! if defined?(RubyVM::YJIT)
+
+  # Old simulat_omm! leaves one byte of space and this fills it up
+  bar
+  bar
+
+  def foo
+    :new
+  end
+
+  test
+}
+
+assert_equal 'ok', %q{
+  # Try to compile new method while OOM
+  def foo
+    :ok
+  end
+
+  RubyVM::YJIT.simulate_oom! if defined?(RubyVM::YJIT)
+
+  foo
+  foo
+}
+
+# struct aref embedded
+assert_equal '2', %q{
+  def foo(s)
+    s.foo
+  end
+
+  S = Struct.new(:foo)
+  foo(S.new(1))
+  foo(S.new(2))
+}
+
+# struct aref non-embedded
+assert_equal '4', %q{
+  def foo(s)
+    s.d
+  end
+
+  S = Struct.new(:a, :b, :c, :d, :e)
+  foo(S.new(1,2,3,4,5))
+  foo(S.new(1,2,3,4,5))
+}
+
+# struct aset embedded
+assert_equal '123', %q{
+  def foo(s)
+    s.foo = 123
+  end
+
+  s = Struct.new(:foo).new
+  foo(s)
+  s = Struct.new(:foo).new
+  foo(s)
+  s.foo
+}
+
+# struct aset non-embedded
+assert_equal '[1, 2, 3, 4, 5]', %q{
+  def foo(s)
+    s.a = 1
+    s.b = 2
+    s.c = 3
+    s.d = 4
+    s.e = 5
+  end
+
+  S = Struct.new(:a, :b, :c, :d, :e)
+  s = S.new
+  foo(s)
+  s = S.new
+  foo(s)
+  [s.a, s.b, s.c, s.d, s.e]
+}
+
+# struct aref too many args
+assert_equal 'ok', %q{
+  def foo(s)
+    s.foo(:bad)
+  end
+
+  s = Struct.new(:foo).new
+  foo(s) rescue :ok
+  foo(s) rescue :ok
+}
+
+# struct aset too many args
+assert_equal 'ok', %q{
+  def foo(s)
+    s.set_foo(123, :bad)
+  end
+
+  s = Struct.new(:foo) do
+    alias :set_foo :foo=
+  end
+  foo(s) rescue :ok
+  foo(s) rescue :ok
+}
+
+# File.join is a cfunc accepting variable arguments as a Ruby array (argc = -2)
+assert_equal 'foo/bar', %q{
+  def foo
+    File.join("foo", "bar")
+  end
+
+  foo
+  foo
+}
+
+# File.join is a cfunc accepting variable arguments as a Ruby array (argc = -2)
+assert_equal '', %q{
+  def foo
+    File.join()
+  end
+
+  foo
+  foo
+}
+
+# Make sure we're correctly reading RStruct's as.ary union for embedded RStructs
+assert_equal '3,12', %q{
+  pt_struct = Struct.new(:x, :y)
+  p = pt_struct.new(3, 12)
+  def pt_inspect(pt)
+    "#{pt.x},#{pt.y}"
+  end
+
+  # Make sure pt_inspect is JITted
+  10.times { pt_inspect(p) }
+
+  # Make sure it's returning '3,12' instead of e.g. '3,false'
+  pt_inspect(p)
+}
+
+# Regression test for deadlock between branch_stub_hit and ractor_receive_if
+assert_equal '10', %q{
+  r = Ractor.new Ractor.current do |main|
+    main << 1
+    main << 2
+    main << 3
+    main << 4
+    main << 5
+    main << 6
+    main << 7
+    main << 8
+    main << 9
+    main << 10
+  end
+
+  a = []
+  a << Ractor.receive_if{|msg| msg == 10}
+  a << Ractor.receive_if{|msg| msg == 9}
+  a << Ractor.receive_if{|msg| msg == 8}
+  a << Ractor.receive_if{|msg| msg == 7}
+  a << Ractor.receive_if{|msg| msg == 6}
+  a << Ractor.receive_if{|msg| msg == 5}
+  a << Ractor.receive_if{|msg| msg == 4}
+  a << Ractor.receive_if{|msg| msg == 3}
+  a << Ractor.receive_if{|msg| msg == 2}
+  a << Ractor.receive_if{|msg| msg == 1}
+
+  a.length
+}
+
+# checktype
+assert_equal 'false', %q{
+    def function()
+        [1, 2] in [Integer, String]
+    end
+    function()
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_ATTRSET)
+assert_equal 'foo', %q{
+    class Foo
+      attr_writer :foo
+
+      def foo()
+        self.foo = "foo"
+      end
+    end
+    foo = Foo.new
+    foo.foo
+}
+
+# anytostring, intern
+assert_equal 'true', %q{
+    def foo()
+      :"#{true}"
+    end
+    foo()
+}
+
+# toregexp, objtostring
+assert_equal '/true/', %q{
+    def foo()
+      /#{true}/
+    end
+    foo().inspect
+}
+
+# concatstrings, objtostring
+assert_equal '9001', %q{
+    def foo()
+      "#{9001}"
+    end
+    foo()
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_CFUNC)
+assert_equal 'nil', %q{
+    def foo
+      nil.inspect # argc: 0
+    end
+    foo
+}
+assert_equal '4', %q{
+    def foo
+      2.pow(2) # argc: 1
+    end
+    foo
+}
+assert_equal 'aba', %q{
+    def foo
+      "abc".tr("c", "a") # argc: 2
+    end
+    foo
+}
+assert_equal 'true', %q{
+    def foo
+      respond_to?(:inspect) # argc: -1
+    end
+    foo
+}
+assert_equal '["a", "b"]', %q{
+    def foo
+      "a\nb".lines(chomp: true) # kwargs
+    end
+    foo
+}
+
+# invokebuiltin
+assert_equal '123', %q{
+  def foo(obj)
+    obj.foo = 123
+  end
+
+  struct = Struct.new(:foo)
+  obj = struct.new
+  foo(obj)
+}
+
+# invokebuiltin_delegate
+assert_equal '.', %q{
+  def foo(path)
+    Dir.open(path).path
+  end
+  foo(".")
+}
+
+# opt_invokebuiltin_delegate_leave
+assert_equal '[0]', %q{"\x00".unpack("c")}
+
+# opt_send_without_block (VM_METHOD_TYPE_ISEQ)
+assert_equal '1', %q{
+  def foo = 1
+  def bar = foo
+  bar
+}
+assert_equal '[1, 2, 3]', %q{
+  def foo(a, b) = [1, a, b]
+  def bar = foo(2, 3)
+  bar
+}
+assert_equal '[1, 2, 3, 4, 5, 6]', %q{
+  def foo(a, b, c:, d:, e: 0, f: 6) = [a, b, c, d, e, f]
+  def bar = foo(1, 2, c: 3, d: 4, e: 5)
+  bar
+}
+assert_equal '[1, 2, 3, 4]', %q{
+  def foo(a, b = 2) = [a, b]
+  def bar = foo(1) + foo(3, 4)
+  bar
+}
+
+assert_equal '1', %q{
+  def foo(a) = a
+  def bar = foo(1) { 2 }
+  bar
+}
+assert_equal '[1, 2]', %q{
+  def foo(a, &block) = [a, block.call]
+  def bar = foo(1) { 2 }
+  bar
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_IVAR)
+assert_equal 'foo', %q{
+  class Foo
+    attr_reader :foo
+
+    def initialize
+      @foo = "foo"
+    end
+  end
+  Foo.new.foo
+}
+
+# opt_send_without_block (VM_METHOD_TYPE_OPTIMIZED)
+assert_equal 'foo', %q{
+  Foo = Struct.new(:bar)
+  Foo.new("bar").bar = "foo"
+}
+assert_equal 'foo', %q{
+  Foo = Struct.new(:bar)
+  Foo.new("foo").bar
+}
+
+# getblockparamproxy
+assert_equal 'foo', %q{
+  def foo(&block)
+    block.call
+  end
+  foo { "foo" }
+}
+
+# getblockparam
+assert_equal 'foo', %q{
+  def foo(&block)
+    block
+  end
+  foo { "foo" }.call
+}
+
+assert_equal '[1, 2]', %q{
+  def foo
+    x = [2]
+    [1, *x]
+  end
+
+  foo
+  foo
+}
+
+# respond_to? with changing symbol
+assert_equal 'false', %q{
+  def foo(name)
+    :sym.respond_to?(name)
+  end
+  foo(:to_s)
+  foo(:to_s)
+  foo(:not_exist)
+}
+
+# respond_to? with method being defined
+assert_equal 'true', %q{
+  def foo
+    :sym.respond_to?(:not_yet_defined)
+  end
+  foo
+  foo
+  module Kernel
+    def not_yet_defined = true
+  end
+  foo
+}
+
+# respond_to? with undef method
+assert_equal 'false', %q{
+  module Kernel
+    def to_be_removed = true
+  end
+  def foo
+    :sym.respond_to?(:to_be_removed)
+  end
+  foo
+  foo
+  class Object
+    undef_method :to_be_removed
+  end
+  foo
+}
+
+# respond_to? with respond_to_missing?
+assert_equal 'true', %q{
+  class Foo
+  end
+  def foo(x)
+    x.respond_to?(:bar)
+  end
+  foo(Foo.new)
+  foo(Foo.new)
+  class Foo
+    def respond_to_missing?(*) = true
+  end
+  foo(Foo.new)
+}
+
+# bmethod
+assert_equal '[1, 2, 3]', %q{
+  one = 1
+  define_method(:foo) do
+    one
+  end
+
+  3.times.map { |i| foo + i }
+}
+
+# return inside bmethod
+assert_equal 'ok', %q{
+  define_method(:foo) do
+    1.tap { return :ok }
+  end
+
+  foo
+}
+
+# bmethod optional and keywords
+assert_equal '[[1, nil, 2]]', %q{
+  define_method(:opt_and_kwargs) do |a = {}, b: nil, c: nil|
+    [a, b, c]
+  end
+
+  5.times.map { opt_and_kwargs(1, c: 2) }.uniq
+}
+
+# bmethod with forwarded block
+assert_equal '2', %q{
+  define_method(:foo) do |&block|
+    block.call
+  end
+
+  def bar(&block)
+    foo(&block)
+  end
+
+  bar { 1 }
+  bar { 2 }
+}
+
+# bmethod with forwarded block and arguments
+assert_equal '5', %q{
+  define_method(:foo) do |n, &block|
+    n + block.call
+  end
+
+  def bar(n, &block)
+    foo(n, &block)
+  end
+
+  bar(0) { 1 }
+  bar(3) { 2 }
+}
+
+# bmethod with forwarded unwanted block
+assert_equal '1', %q{
+  one = 1
+  define_method(:foo) do
+    one
+  end
+
+  def bar(&block)
+    foo(&block)
+  end
+
+  bar { }
+  bar { }
+}
+
+# test for return stub lifetime issue
+assert_equal '1', %q{
+  def foo(n)
+    if n == 2
+      return 1.times { Object.define_method(:foo) {} }
+    end
+
+    foo(n + 1)
+  end
+
+  foo(1)
+}
+
+# case-when with redefined ===
+assert_equal 'ok', %q{
+  class Symbol
+    def ===(a)
+      true
+    end
+  end
+
+  def cw(arg)
+    case arg
+    when :b
+      :ok
+    when 4
+      :ng
+    end
+  end
+
+  cw(4)
+}
+
+assert_normal_exit %{
+  class Bug20997
+    def foo(&) = self.class.name(&)
+
+    new.foo
+  end
+}
diff --git a/bootstraptest/test_yjit_30k_ifelse.rb b/bootstraptest/test_yjit_30k_ifelse.rb
new file mode 100644
index 0000000000..c3afa95e4d
--- /dev/null
+++ b/bootstraptest/test_yjit_30k_ifelse.rb
@@ -0,0 +1,241023 @@
+# This is a torture test for the JIT.
+# There are 30K tiny methods with if-else statements in a 30-deep call hierarchy.
+assert_equal '100000', %q{
+
+def fun_l0_n0(x)
+    if (x < 1)
+        fun_l1_n310(x)
+    else
+        fun_l1_n485(x)
+    end
+end
+
+def fun_l0_n1(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n418(x)
+    end
+end
+
+def fun_l0_n2(x)
+    if (x < 1)
+        fun_l1_n549(x)
+    else
+        fun_l1_n44(x)
+    end
+end
+
+def fun_l0_n3(x)
+    if (x < 1)
+        fun_l1_n394(x)
+    else
+        fun_l1_n447(x)
+    end
+end
+
+def fun_l0_n4(x)
+    if (x < 1)
+        fun_l1_n683(x)
+    else
+        fun_l1_n547(x)
+    end
+end
+
+def fun_l0_n5(x)
+    if (x < 1)
+        fun_l1_n320(x)
+    else
+        fun_l1_n896(x)
+    end
+end
+
+def fun_l0_n6(x)
+    if (x < 1)
+        fun_l1_n649(x)
+    else
+        fun_l1_n243(x)
+    end
+end
+
+def fun_l0_n7(x)
+    if (x < 1)
+        fun_l1_n100(x)
+    else
+        fun_l1_n243(x)
+    end
+end
+
+def fun_l0_n8(x)
+    if (x < 1)
+        fun_l1_n839(x)
+    else
+        fun_l1_n720(x)
+    end
+end
+
+def fun_l0_n9(x)
+    if (x < 1)
+        fun_l1_n177(x)
+    else
+        fun_l1_n555(x)
+    end
+end
+
+def fun_l0_n10(x)
+    if (x < 1)
+        fun_l1_n814(x)
+    else
+        fun_l1_n900(x)
+    end
+end
+
+def fun_l0_n11(x)
+    if (x < 1)
+        fun_l1_n585(x)
+    else
+        fun_l1_n901(x)
+    end
+end
+
+def fun_l0_n12(x)
+    if (x < 1)
+        fun_l1_n952(x)
+    else
+        fun_l1_n270(x)
+    end
+end
+
+def fun_l0_n13(x)
+    if (x < 1)
+        fun_l1_n172(x)
+    else
+        fun_l1_n209(x)
+    end
+end
+
+def fun_l0_n14(x)
+    if (x < 1)
+        fun_l1_n514(x)
+    else
+        fun_l1_n414(x)
+    end
+end
+
+def fun_l0_n15(x)
+    if (x < 1)
+        fun_l1_n190(x)
+    else
+        fun_l1_n100(x)
+    end
+end
+
+def fun_l0_n16(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n997(x)
+    end
+end
+
+def fun_l0_n17(x)
+    if (x < 1)
+        fun_l1_n568(x)
+    else
+        fun_l1_n820(x)
+    end
+end
+
+def fun_l0_n18(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n588(x)
+    end
+end
+
+def fun_l0_n19(x)
+    if (x < 1)
+        fun_l1_n206(x)
+    else
+        fun_l1_n126(x)
+    end
+end
+
+def fun_l0_n20(x)
+    if (x < 1)
+        fun_l1_n317(x)
+    else
+        fun_l1_n722(x)
+    end
+end
+
+def fun_l0_n21(x)
+    if (x < 1)
+        fun_l1_n614(x)
+    else
+        fun_l1_n372(x)
+    end
+end
+
+def fun_l0_n22(x)
+    if (x < 1)
+        fun_l1_n530(x)
+    else
+        fun_l1_n862(x)
+    end
+end
+
+def fun_l0_n23(x)
+    if (x < 1)
+        fun_l1_n889(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n24(x)
+    if (x < 1)
+        fun_l1_n996(x)
+    else
+        fun_l1_n717(x)
+    end
+end
+
+def fun_l0_n25(x)
+    if (x < 1)
+        fun_l1_n726(x)
+    else
+        fun_l1_n939(x)
+    end
+end
+
+def fun_l0_n26(x)
+    if (x < 1)
+        fun_l1_n316(x)
+    else
+        fun_l1_n293(x)
+    end
+end
+
+def fun_l0_n27(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n596(x)
+    end
+end
+
+def fun_l0_n28(x)
+    if (x < 1)
+        fun_l1_n743(x)
+    else
+        fun_l1_n782(x)
+    end
+end
+
+def fun_l0_n29(x)
+    if (x < 1)
+        fun_l1_n896(x)
+    else
+        fun_l1_n247(x)
+    end
+end
+
+def fun_l0_n30(x)
+    if (x < 1)
+        fun_l1_n2(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n31(x)
+    if (x < 1)
+        fun_l1_n380(x)
+    else
+        fun_l1_n655(x)
+    end
+end
+
+def fun_l0_n32(x)
+    if (x < 1)
+        fun_l1_n572(x)
+    else
+        fun_l1_n778(x)
+    end
+end
+
+def fun_l0_n33(x)
+    if (x < 1)
+        fun_l1_n485(x)
+    else
+        fun_l1_n282(x)
+    end
+end
+
+def fun_l0_n34(x)
+    if (x < 1)
+        fun_l1_n703(x)
+    else
+        fun_l1_n179(x)
+    end
+end
+
+def fun_l0_n35(x)
+    if (x < 1)
+        fun_l1_n281(x)
+    else
+        fun_l1_n572(x)
+    end
+end
+
+def fun_l0_n36(x)
+    if (x < 1)
+        fun_l1_n48(x)
+    else
+        fun_l1_n286(x)
+    end
+end
+
+def fun_l0_n37(x)
+    if (x < 1)
+        fun_l1_n539(x)
+    else
+        fun_l1_n86(x)
+    end
+end
+
+def fun_l0_n38(x)
+    if (x < 1)
+        fun_l1_n918(x)
+    else
+        fun_l1_n778(x)
+    end
+end
+
+def fun_l0_n39(x)
+    if (x < 1)
+        fun_l1_n832(x)
+    else
+        fun_l1_n94(x)
+    end
+end
+
+def fun_l0_n40(x)
+    if (x < 1)
+        fun_l1_n213(x)
+    else
+        fun_l1_n580(x)
+    end
+end
+
+def fun_l0_n41(x)
+    if (x < 1)
+        fun_l1_n413(x)
+    else
+        fun_l1_n793(x)
+    end
+end
+
+def fun_l0_n42(x)
+    if (x < 1)
+        fun_l1_n451(x)
+    else
+        fun_l1_n779(x)
+    end
+end
+
+def fun_l0_n43(x)
+    if (x < 1)
+        fun_l1_n118(x)
+    else
+        fun_l1_n778(x)
+    end
+end
+
+def fun_l0_n44(x)
+    if (x < 1)
+        fun_l1_n162(x)
+    else
+        fun_l1_n901(x)
+    end
+end
+
+def fun_l0_n45(x)
+    if (x < 1)
+        fun_l1_n157(x)
+    else
+        fun_l1_n280(x)
+    end
+end
+
+def fun_l0_n46(x)
+    if (x < 1)
+        fun_l1_n748(x)
+    else
+        fun_l1_n881(x)
+    end
+end
+
+def fun_l0_n47(x)
+    if (x < 1)
+        fun_l1_n529(x)
+    else
+        fun_l1_n732(x)
+    end
+end
+
+def fun_l0_n48(x)
+    if (x < 1)
+        fun_l1_n417(x)
+    else
+        fun_l1_n483(x)
+    end
+end
+
+def fun_l0_n49(x)
+    if (x < 1)
+        fun_l1_n743(x)
+    else
+        fun_l1_n525(x)
+    end
+end
+
+def fun_l0_n50(x)
+    if (x < 1)
+        fun_l1_n14(x)
+    else
+        fun_l1_n309(x)
+    end
+end
+
+def fun_l0_n51(x)
+    if (x < 1)
+        fun_l1_n436(x)
+    else
+        fun_l1_n304(x)
+    end
+end
+
+def fun_l0_n52(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n590(x)
+    end
+end
+
+def fun_l0_n53(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n53(x)
+    end
+end
+
+def fun_l0_n54(x)
+    if (x < 1)
+        fun_l1_n807(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n55(x)
+    if (x < 1)
+        fun_l1_n607(x)
+    else
+        fun_l1_n609(x)
+    end
+end
+
+def fun_l0_n56(x)
+    if (x < 1)
+        fun_l1_n721(x)
+    else
+        fun_l1_n994(x)
+    end
+end
+
+def fun_l0_n57(x)
+    if (x < 1)
+        fun_l1_n472(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n58(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n954(x)
+    end
+end
+
+def fun_l0_n59(x)
+    if (x < 1)
+        fun_l1_n223(x)
+    else
+        fun_l1_n148(x)
+    end
+end
+
+def fun_l0_n60(x)
+    if (x < 1)
+        fun_l1_n761(x)
+    else
+        fun_l1_n40(x)
+    end
+end
+
+def fun_l0_n61(x)
+    if (x < 1)
+        fun_l1_n57(x)
+    else
+        fun_l1_n858(x)
+    end
+end
+
+def fun_l0_n62(x)
+    if (x < 1)
+        fun_l1_n114(x)
+    else
+        fun_l1_n767(x)
+    end
+end
+
+def fun_l0_n63(x)
+    if (x < 1)
+        fun_l1_n287(x)
+    else
+        fun_l1_n752(x)
+    end
+end
+
+def fun_l0_n64(x)
+    if (x < 1)
+        fun_l1_n16(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n65(x)
+    if (x < 1)
+        fun_l1_n230(x)
+    else
+        fun_l1_n954(x)
+    end
+end
+
+def fun_l0_n66(x)
+    if (x < 1)
+        fun_l1_n98(x)
+    else
+        fun_l1_n320(x)
+    end
+end
+
+def fun_l0_n67(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n985(x)
+    end
+end
+
+def fun_l0_n68(x)
+    if (x < 1)
+        fun_l1_n32(x)
+    else
+        fun_l1_n648(x)
+    end
+end
+
+def fun_l0_n69(x)
+    if (x < 1)
+        fun_l1_n453(x)
+    else
+        fun_l1_n466(x)
+    end
+end
+
+def fun_l0_n70(x)
+    if (x < 1)
+        fun_l1_n787(x)
+    else
+        fun_l1_n802(x)
+    end
+end
+
+def fun_l0_n71(x)
+    if (x < 1)
+        fun_l1_n656(x)
+    else
+        fun_l1_n347(x)
+    end
+end
+
+def fun_l0_n72(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n336(x)
+    end
+end
+
+def fun_l0_n73(x)
+    if (x < 1)
+        fun_l1_n291(x)
+    else
+        fun_l1_n536(x)
+    end
+end
+
+def fun_l0_n74(x)
+    if (x < 1)
+        fun_l1_n795(x)
+    else
+        fun_l1_n606(x)
+    end
+end
+
+def fun_l0_n75(x)
+    if (x < 1)
+        fun_l1_n21(x)
+    else
+        fun_l1_n720(x)
+    end
+end
+
+def fun_l0_n76(x)
+    if (x < 1)
+        fun_l1_n513(x)
+    else
+        fun_l1_n300(x)
+    end
+end
+
+def fun_l0_n77(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n332(x)
+    end
+end
+
+def fun_l0_n78(x)
+    if (x < 1)
+        fun_l1_n712(x)
+    else
+        fun_l1_n906(x)
+    end
+end
+
+def fun_l0_n79(x)
+    if (x < 1)
+        fun_l1_n555(x)
+    else
+        fun_l1_n850(x)
+    end
+end
+
+def fun_l0_n80(x)
+    if (x < 1)
+        fun_l1_n320(x)
+    else
+        fun_l1_n892(x)
+    end
+end
+
+def fun_l0_n81(x)
+    if (x < 1)
+        fun_l1_n191(x)
+    else
+        fun_l1_n187(x)
+    end
+end
+
+def fun_l0_n82(x)
+    if (x < 1)
+        fun_l1_n457(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n83(x)
+    if (x < 1)
+        fun_l1_n314(x)
+    else
+        fun_l1_n697(x)
+    end
+end
+
+def fun_l0_n84(x)
+    if (x < 1)
+        fun_l1_n459(x)
+    else
+        fun_l1_n500(x)
+    end
+end
+
+def fun_l0_n85(x)
+    if (x < 1)
+        fun_l1_n912(x)
+    else
+        fun_l1_n992(x)
+    end
+end
+
+def fun_l0_n86(x)
+    if (x < 1)
+        fun_l1_n523(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n87(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n829(x)
+    end
+end
+
+def fun_l0_n88(x)
+    if (x < 1)
+        fun_l1_n223(x)
+    else
+        fun_l1_n799(x)
+    end
+end
+
+def fun_l0_n89(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n289(x)
+    end
+end
+
+def fun_l0_n90(x)
+    if (x < 1)
+        fun_l1_n961(x)
+    else
+        fun_l1_n694(x)
+    end
+end
+
+def fun_l0_n91(x)
+    if (x < 1)
+        fun_l1_n423(x)
+    else
+        fun_l1_n848(x)
+    end
+end
+
+def fun_l0_n92(x)
+    if (x < 1)
+        fun_l1_n612(x)
+    else
+        fun_l1_n358(x)
+    end
+end
+
+def fun_l0_n93(x)
+    if (x < 1)
+        fun_l1_n148(x)
+    else
+        fun_l1_n312(x)
+    end
+end
+
+def fun_l0_n94(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n205(x)
+    end
+end
+
+def fun_l0_n95(x)
+    if (x < 1)
+        fun_l1_n573(x)
+    else
+        fun_l1_n692(x)
+    end
+end
+
+def fun_l0_n96(x)
+    if (x < 1)
+        fun_l1_n66(x)
+    else
+        fun_l1_n936(x)
+    end
+end
+
+def fun_l0_n97(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n949(x)
+    end
+end
+
+def fun_l0_n98(x)
+    if (x < 1)
+        fun_l1_n737(x)
+    else
+        fun_l1_n338(x)
+    end
+end
+
+def fun_l0_n99(x)
+    if (x < 1)
+        fun_l1_n335(x)
+    else
+        fun_l1_n739(x)
+    end
+end
+
+def fun_l0_n100(x)
+    if (x < 1)
+        fun_l1_n989(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n101(x)
+    if (x < 1)
+        fun_l1_n559(x)
+    else
+        fun_l1_n478(x)
+    end
+end
+
+def fun_l0_n102(x)
+    if (x < 1)
+        fun_l1_n261(x)
+    else
+        fun_l1_n162(x)
+    end
+end
+
+def fun_l0_n103(x)
+    if (x < 1)
+        fun_l1_n400(x)
+    else
+        fun_l1_n156(x)
+    end
+end
+
+def fun_l0_n104(x)
+    if (x < 1)
+        fun_l1_n747(x)
+    else
+        fun_l1_n361(x)
+    end
+end
+
+def fun_l0_n105(x)
+    if (x < 1)
+        fun_l1_n717(x)
+    else
+        fun_l1_n522(x)
+    end
+end
+
+def fun_l0_n106(x)
+    if (x < 1)
+        fun_l1_n513(x)
+    else
+        fun_l1_n150(x)
+    end
+end
+
+def fun_l0_n107(x)
+    if (x < 1)
+        fun_l1_n710(x)
+    else
+        fun_l1_n602(x)
+    end
+end
+
+def fun_l0_n108(x)
+    if (x < 1)
+        fun_l1_n866(x)
+    else
+        fun_l1_n111(x)
+    end
+end
+
+def fun_l0_n109(x)
+    if (x < 1)
+        fun_l1_n725(x)
+    else
+        fun_l1_n448(x)
+    end
+end
+
+def fun_l0_n110(x)
+    if (x < 1)
+        fun_l1_n703(x)
+    else
+        fun_l1_n127(x)
+    end
+end
+
+def fun_l0_n111(x)
+    if (x < 1)
+        fun_l1_n420(x)
+    else
+        fun_l1_n666(x)
+    end
+end
+
+def fun_l0_n112(x)
+    if (x < 1)
+        fun_l1_n647(x)
+    else
+        fun_l1_n567(x)
+    end
+end
+
+def fun_l0_n113(x)
+    if (x < 1)
+        fun_l1_n543(x)
+    else
+        fun_l1_n992(x)
+    end
+end
+
+def fun_l0_n114(x)
+    if (x < 1)
+        fun_l1_n12(x)
+    else
+        fun_l1_n470(x)
+    end
+end
+
+def fun_l0_n115(x)
+    if (x < 1)
+        fun_l1_n25(x)
+    else
+        fun_l1_n917(x)
+    end
+end
+
+def fun_l0_n116(x)
+    if (x < 1)
+        fun_l1_n201(x)
+    else
+        fun_l1_n110(x)
+    end
+end
+
+def fun_l0_n117(x)
+    if (x < 1)
+        fun_l1_n222(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n118(x)
+    if (x < 1)
+        fun_l1_n990(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n119(x)
+    if (x < 1)
+        fun_l1_n712(x)
+    else
+        fun_l1_n5(x)
+    end
+end
+
+def fun_l0_n120(x)
+    if (x < 1)
+        fun_l1_n28(x)
+    else
+        fun_l1_n89(x)
+    end
+end
+
+def fun_l0_n121(x)
+    if (x < 1)
+        fun_l1_n341(x)
+    else
+        fun_l1_n983(x)
+    end
+end
+
+def fun_l0_n122(x)
+    if (x < 1)
+        fun_l1_n123(x)
+    else
+        fun_l1_n452(x)
+    end
+end
+
+def fun_l0_n123(x)
+    if (x < 1)
+        fun_l1_n514(x)
+    else
+        fun_l1_n949(x)
+    end
+end
+
+def fun_l0_n124(x)
+    if (x < 1)
+        fun_l1_n280(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n125(x)
+    if (x < 1)
+        fun_l1_n512(x)
+    else
+        fun_l1_n772(x)
+    end
+end
+
+def fun_l0_n126(x)
+    if (x < 1)
+        fun_l1_n911(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n127(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n574(x)
+    end
+end
+
+def fun_l0_n128(x)
+    if (x < 1)
+        fun_l1_n318(x)
+    else
+        fun_l1_n266(x)
+    end
+end
+
+def fun_l0_n129(x)
+    if (x < 1)
+        fun_l1_n677(x)
+    else
+        fun_l1_n10(x)
+    end
+end
+
+def fun_l0_n130(x)
+    if (x < 1)
+        fun_l1_n994(x)
+    else
+        fun_l1_n48(x)
+    end
+end
+
+def fun_l0_n131(x)
+    if (x < 1)
+        fun_l1_n335(x)
+    else
+        fun_l1_n473(x)
+    end
+end
+
+def fun_l0_n132(x)
+    if (x < 1)
+        fun_l1_n641(x)
+    else
+        fun_l1_n48(x)
+    end
+end
+
+def fun_l0_n133(x)
+    if (x < 1)
+        fun_l1_n914(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n134(x)
+    if (x < 1)
+        fun_l1_n479(x)
+    else
+        fun_l1_n761(x)
+    end
+end
+
+def fun_l0_n135(x)
+    if (x < 1)
+        fun_l1_n186(x)
+    else
+        fun_l1_n692(x)
+    end
+end
+
+def fun_l0_n136(x)
+    if (x < 1)
+        fun_l1_n325(x)
+    else
+        fun_l1_n279(x)
+    end
+end
+
+def fun_l0_n137(x)
+    if (x < 1)
+        fun_l1_n493(x)
+    else
+        fun_l1_n293(x)
+    end
+end
+
+def fun_l0_n138(x)
+    if (x < 1)
+        fun_l1_n788(x)
+    else
+        fun_l1_n364(x)
+    end
+end
+
+def fun_l0_n139(x)
+    if (x < 1)
+        fun_l1_n565(x)
+    else
+        fun_l1_n63(x)
+    end
+end
+
+def fun_l0_n140(x)
+    if (x < 1)
+        fun_l1_n128(x)
+    else
+        fun_l1_n299(x)
+    end
+end
+
+def fun_l0_n141(x)
+    if (x < 1)
+        fun_l1_n782(x)
+    else
+        fun_l1_n195(x)
+    end
+end
+
+def fun_l0_n142(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n117(x)
+    end
+end
+
+def fun_l0_n143(x)
+    if (x < 1)
+        fun_l1_n263(x)
+    else
+        fun_l1_n683(x)
+    end
+end
+
+def fun_l0_n144(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n92(x)
+    end
+end
+
+def fun_l0_n145(x)
+    if (x < 1)
+        fun_l1_n626(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n146(x)
+    if (x < 1)
+        fun_l1_n296(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n147(x)
+    if (x < 1)
+        fun_l1_n395(x)
+    else
+        fun_l1_n750(x)
+    end
+end
+
+def fun_l0_n148(x)
+    if (x < 1)
+        fun_l1_n164(x)
+    else
+        fun_l1_n580(x)
+    end
+end
+
+def fun_l0_n149(x)
+    if (x < 1)
+        fun_l1_n904(x)
+    else
+        fun_l1_n264(x)
+    end
+end
+
+def fun_l0_n150(x)
+    if (x < 1)
+        fun_l1_n383(x)
+    else
+        fun_l1_n558(x)
+    end
+end
+
+def fun_l0_n151(x)
+    if (x < 1)
+        fun_l1_n522(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n152(x)
+    if (x < 1)
+        fun_l1_n496(x)
+    else
+        fun_l1_n562(x)
+    end
+end
+
+def fun_l0_n153(x)
+    if (x < 1)
+        fun_l1_n374(x)
+    else
+        fun_l1_n561(x)
+    end
+end
+
+def fun_l0_n154(x)
+    if (x < 1)
+        fun_l1_n314(x)
+    else
+        fun_l1_n368(x)
+    end
+end
+
+def fun_l0_n155(x)
+    if (x < 1)
+        fun_l1_n456(x)
+    else
+        fun_l1_n189(x)
+    end
+end
+
+def fun_l0_n156(x)
+    if (x < 1)
+        fun_l1_n46(x)
+    else
+        fun_l1_n620(x)
+    end
+end
+
+def fun_l0_n157(x)
+    if (x < 1)
+        fun_l1_n259(x)
+    else
+        fun_l1_n742(x)
+    end
+end
+
+def fun_l0_n158(x)
+    if (x < 1)
+        fun_l1_n881(x)
+    else
+        fun_l1_n786(x)
+    end
+end
+
+def fun_l0_n159(x)
+    if (x < 1)
+        fun_l1_n607(x)
+    else
+        fun_l1_n177(x)
+    end
+end
+
+def fun_l0_n160(x)
+    if (x < 1)
+        fun_l1_n824(x)
+    else
+        fun_l1_n415(x)
+    end
+end
+
+def fun_l0_n161(x)
+    if (x < 1)
+        fun_l1_n443(x)
+    else
+        fun_l1_n787(x)
+    end
+end
+
+def fun_l0_n162(x)
+    if (x < 1)
+        fun_l1_n124(x)
+    else
+        fun_l1_n529(x)
+    end
+end
+
+def fun_l0_n163(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n96(x)
+    end
+end
+
+def fun_l0_n164(x)
+    if (x < 1)
+        fun_l1_n775(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n165(x)
+    if (x < 1)
+        fun_l1_n860(x)
+    else
+        fun_l1_n212(x)
+    end
+end
+
+def fun_l0_n166(x)
+    if (x < 1)
+        fun_l1_n378(x)
+    else
+        fun_l1_n904(x)
+    end
+end
+
+def fun_l0_n167(x)
+    if (x < 1)
+        fun_l1_n15(x)
+    else
+        fun_l1_n640(x)
+    end
+end
+
+def fun_l0_n168(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n861(x)
+    end
+end
+
+def fun_l0_n169(x)
+    if (x < 1)
+        fun_l1_n468(x)
+    else
+        fun_l1_n586(x)
+    end
+end
+
+def fun_l0_n170(x)
+    if (x < 1)
+        fun_l1_n477(x)
+    else
+        fun_l1_n674(x)
+    end
+end
+
+def fun_l0_n171(x)
+    if (x < 1)
+        fun_l1_n509(x)
+    else
+        fun_l1_n64(x)
+    end
+end
+
+def fun_l0_n172(x)
+    if (x < 1)
+        fun_l1_n612(x)
+    else
+        fun_l1_n828(x)
+    end
+end
+
+def fun_l0_n173(x)
+    if (x < 1)
+        fun_l1_n440(x)
+    else
+        fun_l1_n204(x)
+    end
+end
+
+def fun_l0_n174(x)
+    if (x < 1)
+        fun_l1_n259(x)
+    else
+        fun_l1_n947(x)
+    end
+end
+
+def fun_l0_n175(x)
+    if (x < 1)
+        fun_l1_n402(x)
+    else
+        fun_l1_n588(x)
+    end
+end
+
+def fun_l0_n176(x)
+    if (x < 1)
+        fun_l1_n245(x)
+    else
+        fun_l1_n540(x)
+    end
+end
+
+def fun_l0_n177(x)
+    if (x < 1)
+        fun_l1_n869(x)
+    else
+        fun_l1_n249(x)
+    end
+end
+
+def fun_l0_n178(x)
+    if (x < 1)
+        fun_l1_n830(x)
+    else
+        fun_l1_n210(x)
+    end
+end
+
+def fun_l0_n179(x)
+    if (x < 1)
+        fun_l1_n692(x)
+    else
+        fun_l1_n222(x)
+    end
+end
+
+def fun_l0_n180(x)
+    if (x < 1)
+        fun_l1_n220(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n181(x)
+    if (x < 1)
+        fun_l1_n523(x)
+    else
+        fun_l1_n618(x)
+    end
+end
+
+def fun_l0_n182(x)
+    if (x < 1)
+        fun_l1_n44(x)
+    else
+        fun_l1_n422(x)
+    end
+end
+
+def fun_l0_n183(x)
+    if (x < 1)
+        fun_l1_n944(x)
+    else
+        fun_l1_n230(x)
+    end
+end
+
+def fun_l0_n184(x)
+    if (x < 1)
+        fun_l1_n678(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n185(x)
+    if (x < 1)
+        fun_l1_n73(x)
+    else
+        fun_l1_n398(x)
+    end
+end
+
+def fun_l0_n186(x)
+    if (x < 1)
+        fun_l1_n121(x)
+    else
+        fun_l1_n689(x)
+    end
+end
+
+def fun_l0_n187(x)
+    if (x < 1)
+        fun_l1_n946(x)
+    else
+        fun_l1_n613(x)
+    end
+end
+
+def fun_l0_n188(x)
+    if (x < 1)
+        fun_l1_n987(x)
+    else
+        fun_l1_n785(x)
+    end
+end
+
+def fun_l0_n189(x)
+    if (x < 1)
+        fun_l1_n181(x)
+    else
+        fun_l1_n644(x)
+    end
+end
+
+def fun_l0_n190(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n679(x)
+    end
+end
+
+def fun_l0_n191(x)
+    if (x < 1)
+        fun_l1_n784(x)
+    else
+        fun_l1_n274(x)
+    end
+end
+
+def fun_l0_n192(x)
+    if (x < 1)
+        fun_l1_n71(x)
+    else
+        fun_l1_n773(x)
+    end
+end
+
+def fun_l0_n193(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n194(x)
+    if (x < 1)
+        fun_l1_n608(x)
+    else
+        fun_l1_n460(x)
+    end
+end
+
+def fun_l0_n195(x)
+    if (x < 1)
+        fun_l1_n25(x)
+    else
+        fun_l1_n437(x)
+    end
+end
+
+def fun_l0_n196(x)
+    if (x < 1)
+        fun_l1_n410(x)
+    else
+        fun_l1_n674(x)
+    end
+end
+
+def fun_l0_n197(x)
+    if (x < 1)
+        fun_l1_n949(x)
+    else
+        fun_l1_n708(x)
+    end
+end
+
+def fun_l0_n198(x)
+    if (x < 1)
+        fun_l1_n714(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n199(x)
+    if (x < 1)
+        fun_l1_n41(x)
+    else
+        fun_l1_n865(x)
+    end
+end
+
+def fun_l0_n200(x)
+    if (x < 1)
+        fun_l1_n383(x)
+    else
+        fun_l1_n90(x)
+    end
+end
+
+def fun_l0_n201(x)
+    if (x < 1)
+        fun_l1_n581(x)
+    else
+        fun_l1_n273(x)
+    end
+end
+
+def fun_l0_n202(x)
+    if (x < 1)
+        fun_l1_n350(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n203(x)
+    if (x < 1)
+        fun_l1_n259(x)
+    else
+        fun_l1_n922(x)
+    end
+end
+
+def fun_l0_n204(x)
+    if (x < 1)
+        fun_l1_n448(x)
+    else
+        fun_l1_n741(x)
+    end
+end
+
+def fun_l0_n205(x)
+    if (x < 1)
+        fun_l1_n86(x)
+    else
+        fun_l1_n618(x)
+    end
+end
+
+def fun_l0_n206(x)
+    if (x < 1)
+        fun_l1_n412(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n207(x)
+    if (x < 1)
+        fun_l1_n196(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n208(x)
+    if (x < 1)
+        fun_l1_n777(x)
+    else
+        fun_l1_n150(x)
+    end
+end
+
+def fun_l0_n209(x)
+    if (x < 1)
+        fun_l1_n20(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n210(x)
+    if (x < 1)
+        fun_l1_n934(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n211(x)
+    if (x < 1)
+        fun_l1_n803(x)
+    else
+        fun_l1_n636(x)
+    end
+end
+
+def fun_l0_n212(x)
+    if (x < 1)
+        fun_l1_n93(x)
+    else
+        fun_l1_n791(x)
+    end
+end
+
+def fun_l0_n213(x)
+    if (x < 1)
+        fun_l1_n76(x)
+    else
+        fun_l1_n172(x)
+    end
+end
+
+def fun_l0_n214(x)
+    if (x < 1)
+        fun_l1_n103(x)
+    else
+        fun_l1_n381(x)
+    end
+end
+
+def fun_l0_n215(x)
+    if (x < 1)
+        fun_l1_n433(x)
+    else
+        fun_l1_n349(x)
+    end
+end
+
+def fun_l0_n216(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n740(x)
+    end
+end
+
+def fun_l0_n217(x)
+    if (x < 1)
+        fun_l1_n927(x)
+    else
+        fun_l1_n886(x)
+    end
+end
+
+def fun_l0_n218(x)
+    if (x < 1)
+        fun_l1_n804(x)
+    else
+        fun_l1_n6(x)
+    end
+end
+
+def fun_l0_n219(x)
+    if (x < 1)
+        fun_l1_n921(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n220(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n224(x)
+    end
+end
+
+def fun_l0_n221(x)
+    if (x < 1)
+        fun_l1_n818(x)
+    else
+        fun_l1_n105(x)
+    end
+end
+
+def fun_l0_n222(x)
+    if (x < 1)
+        fun_l1_n162(x)
+    else
+        fun_l1_n700(x)
+    end
+end
+
+def fun_l0_n223(x)
+    if (x < 1)
+        fun_l1_n57(x)
+    else
+        fun_l1_n734(x)
+    end
+end
+
+def fun_l0_n224(x)
+    if (x < 1)
+        fun_l1_n283(x)
+    else
+        fun_l1_n87(x)
+    end
+end
+
+def fun_l0_n225(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n363(x)
+    end
+end
+
+def fun_l0_n226(x)
+    if (x < 1)
+        fun_l1_n962(x)
+    else
+        fun_l1_n660(x)
+    end
+end
+
+def fun_l0_n227(x)
+    if (x < 1)
+        fun_l1_n255(x)
+    else
+        fun_l1_n536(x)
+    end
+end
+
+def fun_l0_n228(x)
+    if (x < 1)
+        fun_l1_n377(x)
+    else
+        fun_l1_n249(x)
+    end
+end
+
+def fun_l0_n229(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n691(x)
+    end
+end
+
+def fun_l0_n230(x)
+    if (x < 1)
+        fun_l1_n781(x)
+    else
+        fun_l1_n494(x)
+    end
+end
+
+def fun_l0_n231(x)
+    if (x < 1)
+        fun_l1_n889(x)
+    else
+        fun_l1_n967(x)
+    end
+end
+
+def fun_l0_n232(x)
+    if (x < 1)
+        fun_l1_n509(x)
+    else
+        fun_l1_n910(x)
+    end
+end
+
+def fun_l0_n233(x)
+    if (x < 1)
+        fun_l1_n354(x)
+    else
+        fun_l1_n5(x)
+    end
+end
+
+def fun_l0_n234(x)
+    if (x < 1)
+        fun_l1_n423(x)
+    else
+        fun_l1_n788(x)
+    end
+end
+
+def fun_l0_n235(x)
+    if (x < 1)
+        fun_l1_n632(x)
+    else
+        fun_l1_n705(x)
+    end
+end
+
+def fun_l0_n236(x)
+    if (x < 1)
+        fun_l1_n955(x)
+    else
+        fun_l1_n908(x)
+    end
+end
+
+def fun_l0_n237(x)
+    if (x < 1)
+        fun_l1_n329(x)
+    else
+        fun_l1_n2(x)
+    end
+end
+
+def fun_l0_n238(x)
+    if (x < 1)
+        fun_l1_n767(x)
+    else
+        fun_l1_n766(x)
+    end
+end
+
+def fun_l0_n239(x)
+    if (x < 1)
+        fun_l1_n304(x)
+    else
+        fun_l1_n507(x)
+    end
+end
+
+def fun_l0_n240(x)
+    if (x < 1)
+        fun_l1_n845(x)
+    else
+        fun_l1_n777(x)
+    end
+end
+
+def fun_l0_n241(x)
+    if (x < 1)
+        fun_l1_n69(x)
+    else
+        fun_l1_n260(x)
+    end
+end
+
+def fun_l0_n242(x)
+    if (x < 1)
+        fun_l1_n194(x)
+    else
+        fun_l1_n412(x)
+    end
+end
+
+def fun_l0_n243(x)
+    if (x < 1)
+        fun_l1_n974(x)
+    else
+        fun_l1_n922(x)
+    end
+end
+
+def fun_l0_n244(x)
+    if (x < 1)
+        fun_l1_n532(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n245(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n656(x)
+    end
+end
+
+def fun_l0_n246(x)
+    if (x < 1)
+        fun_l1_n253(x)
+    else
+        fun_l1_n235(x)
+    end
+end
+
+def fun_l0_n247(x)
+    if (x < 1)
+        fun_l1_n754(x)
+    else
+        fun_l1_n775(x)
+    end
+end
+
+def fun_l0_n248(x)
+    if (x < 1)
+        fun_l1_n89(x)
+    else
+        fun_l1_n129(x)
+    end
+end
+
+def fun_l0_n249(x)
+    if (x < 1)
+        fun_l1_n284(x)
+    else
+        fun_l1_n642(x)
+    end
+end
+
+def fun_l0_n250(x)
+    if (x < 1)
+        fun_l1_n67(x)
+    else
+        fun_l1_n867(x)
+    end
+end
+
+def fun_l0_n251(x)
+    if (x < 1)
+        fun_l1_n926(x)
+    else
+        fun_l1_n442(x)
+    end
+end
+
+def fun_l0_n252(x)
+    if (x < 1)
+        fun_l1_n196(x)
+    else
+        fun_l1_n583(x)
+    end
+end
+
+def fun_l0_n253(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n810(x)
+    end
+end
+
+def fun_l0_n254(x)
+    if (x < 1)
+        fun_l1_n984(x)
+    else
+        fun_l1_n752(x)
+    end
+end
+
+def fun_l0_n255(x)
+    if (x < 1)
+        fun_l1_n941(x)
+    else
+        fun_l1_n744(x)
+    end
+end
+
+def fun_l0_n256(x)
+    if (x < 1)
+        fun_l1_n785(x)
+    else
+        fun_l1_n610(x)
+    end
+end
+
+def fun_l0_n257(x)
+    if (x < 1)
+        fun_l1_n622(x)
+    else
+        fun_l1_n730(x)
+    end
+end
+
+def fun_l0_n258(x)
+    if (x < 1)
+        fun_l1_n453(x)
+    else
+        fun_l1_n641(x)
+    end
+end
+
+def fun_l0_n259(x)
+    if (x < 1)
+        fun_l1_n407(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n260(x)
+    if (x < 1)
+        fun_l1_n252(x)
+    else
+        fun_l1_n205(x)
+    end
+end
+
+def fun_l0_n261(x)
+    if (x < 1)
+        fun_l1_n940(x)
+    else
+        fun_l1_n678(x)
+    end
+end
+
+def fun_l0_n262(x)
+    if (x < 1)
+        fun_l1_n350(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n263(x)
+    if (x < 1)
+        fun_l1_n688(x)
+    else
+        fun_l1_n193(x)
+    end
+end
+
+def fun_l0_n264(x)
+    if (x < 1)
+        fun_l1_n366(x)
+    else
+        fun_l1_n790(x)
+    end
+end
+
+def fun_l0_n265(x)
+    if (x < 1)
+        fun_l1_n592(x)
+    else
+        fun_l1_n93(x)
+    end
+end
+
+def fun_l0_n266(x)
+    if (x < 1)
+        fun_l1_n189(x)
+    else
+        fun_l1_n467(x)
+    end
+end
+
+def fun_l0_n267(x)
+    if (x < 1)
+        fun_l1_n813(x)
+    else
+        fun_l1_n7(x)
+    end
+end
+
+def fun_l0_n268(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n269(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n270(x)
+    if (x < 1)
+        fun_l1_n634(x)
+    else
+        fun_l1_n726(x)
+    end
+end
+
+def fun_l0_n271(x)
+    if (x < 1)
+        fun_l1_n192(x)
+    else
+        fun_l1_n468(x)
+    end
+end
+
+def fun_l0_n272(x)
+    if (x < 1)
+        fun_l1_n278(x)
+    else
+        fun_l1_n355(x)
+    end
+end
+
+def fun_l0_n273(x)
+    if (x < 1)
+        fun_l1_n354(x)
+    else
+        fun_l1_n87(x)
+    end
+end
+
+def fun_l0_n274(x)
+    if (x < 1)
+        fun_l1_n643(x)
+    else
+        fun_l1_n806(x)
+    end
+end
+
+def fun_l0_n275(x)
+    if (x < 1)
+        fun_l1_n389(x)
+    else
+        fun_l1_n559(x)
+    end
+end
+
+def fun_l0_n276(x)
+    if (x < 1)
+        fun_l1_n283(x)
+    else
+        fun_l1_n539(x)
+    end
+end
+
+def fun_l0_n277(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n351(x)
+    end
+end
+
+def fun_l0_n278(x)
+    if (x < 1)
+        fun_l1_n813(x)
+    else
+        fun_l1_n513(x)
+    end
+end
+
+def fun_l0_n279(x)
+    if (x < 1)
+        fun_l1_n501(x)
+    else
+        fun_l1_n967(x)
+    end
+end
+
+def fun_l0_n280(x)
+    if (x < 1)
+        fun_l1_n727(x)
+    else
+        fun_l1_n232(x)
+    end
+end
+
+def fun_l0_n281(x)
+    if (x < 1)
+        fun_l1_n946(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n282(x)
+    if (x < 1)
+        fun_l1_n260(x)
+    else
+        fun_l1_n525(x)
+    end
+end
+
+def fun_l0_n283(x)
+    if (x < 1)
+        fun_l1_n957(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n284(x)
+    if (x < 1)
+        fun_l1_n91(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n285(x)
+    if (x < 1)
+        fun_l1_n71(x)
+    else
+        fun_l1_n24(x)
+    end
+end
+
+def fun_l0_n286(x)
+    if (x < 1)
+        fun_l1_n594(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n287(x)
+    if (x < 1)
+        fun_l1_n869(x)
+    else
+        fun_l1_n414(x)
+    end
+end
+
+def fun_l0_n288(x)
+    if (x < 1)
+        fun_l1_n182(x)
+    else
+        fun_l1_n835(x)
+    end
+end
+
+def fun_l0_n289(x)
+    if (x < 1)
+        fun_l1_n188(x)
+    else
+        fun_l1_n949(x)
+    end
+end
+
+def fun_l0_n290(x)
+    if (x < 1)
+        fun_l1_n35(x)
+    else
+        fun_l1_n259(x)
+    end
+end
+
+def fun_l0_n291(x)
+    if (x < 1)
+        fun_l1_n593(x)
+    else
+        fun_l1_n810(x)
+    end
+end
+
+def fun_l0_n292(x)
+    if (x < 1)
+        fun_l1_n680(x)
+    else
+        fun_l1_n564(x)
+    end
+end
+
+def fun_l0_n293(x)
+    if (x < 1)
+        fun_l1_n57(x)
+    else
+        fun_l1_n91(x)
+    end
+end
+
+def fun_l0_n294(x)
+    if (x < 1)
+        fun_l1_n945(x)
+    else
+        fun_l1_n807(x)
+    end
+end
+
+def fun_l0_n295(x)
+    if (x < 1)
+        fun_l1_n442(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n296(x)
+    if (x < 1)
+        fun_l1_n536(x)
+    else
+        fun_l1_n987(x)
+    end
+end
+
+def fun_l0_n297(x)
+    if (x < 1)
+        fun_l1_n519(x)
+    else
+        fun_l1_n657(x)
+    end
+end
+
+def fun_l0_n298(x)
+    if (x < 1)
+        fun_l1_n204(x)
+    else
+        fun_l1_n437(x)
+    end
+end
+
+def fun_l0_n299(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n385(x)
+    end
+end
+
+def fun_l0_n300(x)
+    if (x < 1)
+        fun_l1_n629(x)
+    else
+        fun_l1_n803(x)
+    end
+end
+
+def fun_l0_n301(x)
+    if (x < 1)
+        fun_l1_n576(x)
+    else
+        fun_l1_n921(x)
+    end
+end
+
+def fun_l0_n302(x)
+    if (x < 1)
+        fun_l1_n466(x)
+    else
+        fun_l1_n475(x)
+    end
+end
+
+def fun_l0_n303(x)
+    if (x < 1)
+        fun_l1_n658(x)
+    else
+        fun_l1_n333(x)
+    end
+end
+
+def fun_l0_n304(x)
+    if (x < 1)
+        fun_l1_n728(x)
+    else
+        fun_l1_n749(x)
+    end
+end
+
+def fun_l0_n305(x)
+    if (x < 1)
+        fun_l1_n68(x)
+    else
+        fun_l1_n552(x)
+    end
+end
+
+def fun_l0_n306(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n958(x)
+    end
+end
+
+def fun_l0_n307(x)
+    if (x < 1)
+        fun_l1_n79(x)
+    else
+        fun_l1_n386(x)
+    end
+end
+
+def fun_l0_n308(x)
+    if (x < 1)
+        fun_l1_n831(x)
+    else
+        fun_l1_n176(x)
+    end
+end
+
+def fun_l0_n309(x)
+    if (x < 1)
+        fun_l1_n770(x)
+    else
+        fun_l1_n334(x)
+    end
+end
+
+def fun_l0_n310(x)
+    if (x < 1)
+        fun_l1_n21(x)
+    else
+        fun_l1_n643(x)
+    end
+end
+
+def fun_l0_n311(x)
+    if (x < 1)
+        fun_l1_n673(x)
+    else
+        fun_l1_n298(x)
+    end
+end
+
+def fun_l0_n312(x)
+    if (x < 1)
+        fun_l1_n753(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n313(x)
+    if (x < 1)
+        fun_l1_n299(x)
+    else
+        fun_l1_n350(x)
+    end
+end
+
+def fun_l0_n314(x)
+    if (x < 1)
+        fun_l1_n190(x)
+    else
+        fun_l1_n519(x)
+    end
+end
+
+def fun_l0_n315(x)
+    if (x < 1)
+        fun_l1_n934(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n316(x)
+    if (x < 1)
+        fun_l1_n695(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n317(x)
+    if (x < 1)
+        fun_l1_n194(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n318(x)
+    if (x < 1)
+        fun_l1_n145(x)
+    else
+        fun_l1_n761(x)
+    end
+end
+
+def fun_l0_n319(x)
+    if (x < 1)
+        fun_l1_n223(x)
+    else
+        fun_l1_n237(x)
+    end
+end
+
+def fun_l0_n320(x)
+    if (x < 1)
+        fun_l1_n907(x)
+    else
+        fun_l1_n653(x)
+    end
+end
+
+def fun_l0_n321(x)
+    if (x < 1)
+        fun_l1_n216(x)
+    else
+        fun_l1_n67(x)
+    end
+end
+
+def fun_l0_n322(x)
+    if (x < 1)
+        fun_l1_n658(x)
+    else
+        fun_l1_n948(x)
+    end
+end
+
+def fun_l0_n323(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n926(x)
+    end
+end
+
+def fun_l0_n324(x)
+    if (x < 1)
+        fun_l1_n533(x)
+    else
+        fun_l1_n252(x)
+    end
+end
+
+def fun_l0_n325(x)
+    if (x < 1)
+        fun_l1_n284(x)
+    else
+        fun_l1_n670(x)
+    end
+end
+
+def fun_l0_n326(x)
+    if (x < 1)
+        fun_l1_n327(x)
+    else
+        fun_l1_n298(x)
+    end
+end
+
+def fun_l0_n327(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n890(x)
+    end
+end
+
+def fun_l0_n328(x)
+    if (x < 1)
+        fun_l1_n941(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n329(x)
+    if (x < 1)
+        fun_l1_n859(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n330(x)
+    if (x < 1)
+        fun_l1_n282(x)
+    else
+        fun_l1_n569(x)
+    end
+end
+
+def fun_l0_n331(x)
+    if (x < 1)
+        fun_l1_n33(x)
+    else
+        fun_l1_n525(x)
+    end
+end
+
+def fun_l0_n332(x)
+    if (x < 1)
+        fun_l1_n847(x)
+    else
+        fun_l1_n540(x)
+    end
+end
+
+def fun_l0_n333(x)
+    if (x < 1)
+        fun_l1_n485(x)
+    else
+        fun_l1_n756(x)
+    end
+end
+
+def fun_l0_n334(x)
+    if (x < 1)
+        fun_l1_n396(x)
+    else
+        fun_l1_n781(x)
+    end
+end
+
+def fun_l0_n335(x)
+    if (x < 1)
+        fun_l1_n225(x)
+    else
+        fun_l1_n417(x)
+    end
+end
+
+def fun_l0_n336(x)
+    if (x < 1)
+        fun_l1_n906(x)
+    else
+        fun_l1_n301(x)
+    end
+end
+
+def fun_l0_n337(x)
+    if (x < 1)
+        fun_l1_n863(x)
+    else
+        fun_l1_n409(x)
+    end
+end
+
+def fun_l0_n338(x)
+    if (x < 1)
+        fun_l1_n103(x)
+    else
+        fun_l1_n460(x)
+    end
+end
+
+def fun_l0_n339(x)
+    if (x < 1)
+        fun_l1_n787(x)
+    else
+        fun_l1_n434(x)
+    end
+end
+
+def fun_l0_n340(x)
+    if (x < 1)
+        fun_l1_n308(x)
+    else
+        fun_l1_n875(x)
+    end
+end
+
+def fun_l0_n341(x)
+    if (x < 1)
+        fun_l1_n146(x)
+    else
+        fun_l1_n566(x)
+    end
+end
+
+def fun_l0_n342(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n770(x)
+    end
+end
+
+def fun_l0_n343(x)
+    if (x < 1)
+        fun_l1_n668(x)
+    else
+        fun_l1_n60(x)
+    end
+end
+
+def fun_l0_n344(x)
+    if (x < 1)
+        fun_l1_n305(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n345(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n920(x)
+    end
+end
+
+def fun_l0_n346(x)
+    if (x < 1)
+        fun_l1_n257(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n347(x)
+    if (x < 1)
+        fun_l1_n740(x)
+    else
+        fun_l1_n372(x)
+    end
+end
+
+def fun_l0_n348(x)
+    if (x < 1)
+        fun_l1_n698(x)
+    else
+        fun_l1_n63(x)
+    end
+end
+
+def fun_l0_n349(x)
+    if (x < 1)
+        fun_l1_n4(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n350(x)
+    if (x < 1)
+        fun_l1_n186(x)
+    else
+        fun_l1_n352(x)
+    end
+end
+
+def fun_l0_n351(x)
+    if (x < 1)
+        fun_l1_n619(x)
+    else
+        fun_l1_n583(x)
+    end
+end
+
+def fun_l0_n352(x)
+    if (x < 1)
+        fun_l1_n2(x)
+    else
+        fun_l1_n275(x)
+    end
+end
+
+def fun_l0_n353(x)
+    if (x < 1)
+        fun_l1_n843(x)
+    else
+        fun_l1_n986(x)
+    end
+end
+
+def fun_l0_n354(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n64(x)
+    end
+end
+
+def fun_l0_n355(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n332(x)
+    end
+end
+
+def fun_l0_n356(x)
+    if (x < 1)
+        fun_l1_n642(x)
+    else
+        fun_l1_n559(x)
+    end
+end
+
+def fun_l0_n357(x)
+    if (x < 1)
+        fun_l1_n385(x)
+    else
+        fun_l1_n532(x)
+    end
+end
+
+def fun_l0_n358(x)
+    if (x < 1)
+        fun_l1_n672(x)
+    else
+        fun_l1_n721(x)
+    end
+end
+
+def fun_l0_n359(x)
+    if (x < 1)
+        fun_l1_n663(x)
+    else
+        fun_l1_n590(x)
+    end
+end
+
+def fun_l0_n360(x)
+    if (x < 1)
+        fun_l1_n240(x)
+    else
+        fun_l1_n743(x)
+    end
+end
+
+def fun_l0_n361(x)
+    if (x < 1)
+        fun_l1_n301(x)
+    else
+        fun_l1_n943(x)
+    end
+end
+
+def fun_l0_n362(x)
+    if (x < 1)
+        fun_l1_n108(x)
+    else
+        fun_l1_n975(x)
+    end
+end
+
+def fun_l0_n363(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n135(x)
+    end
+end
+
+def fun_l0_n364(x)
+    if (x < 1)
+        fun_l1_n360(x)
+    else
+        fun_l1_n821(x)
+    end
+end
+
+def fun_l0_n365(x)
+    if (x < 1)
+        fun_l1_n992(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n366(x)
+    if (x < 1)
+        fun_l1_n439(x)
+    else
+        fun_l1_n506(x)
+    end
+end
+
+def fun_l0_n367(x)
+    if (x < 1)
+        fun_l1_n229(x)
+    else
+        fun_l1_n714(x)
+    end
+end
+
+def fun_l0_n368(x)
+    if (x < 1)
+        fun_l1_n459(x)
+    else
+        fun_l1_n874(x)
+    end
+end
+
+def fun_l0_n369(x)
+    if (x < 1)
+        fun_l1_n799(x)
+    else
+        fun_l1_n406(x)
+    end
+end
+
+def fun_l0_n370(x)
+    if (x < 1)
+        fun_l1_n791(x)
+    else
+        fun_l1_n669(x)
+    end
+end
+
+def fun_l0_n371(x)
+    if (x < 1)
+        fun_l1_n99(x)
+    else
+        fun_l1_n344(x)
+    end
+end
+
+def fun_l0_n372(x)
+    if (x < 1)
+        fun_l1_n585(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n373(x)
+    if (x < 1)
+        fun_l1_n35(x)
+    else
+        fun_l1_n369(x)
+    end
+end
+
+def fun_l0_n374(x)
+    if (x < 1)
+        fun_l1_n41(x)
+    else
+        fun_l1_n378(x)
+    end
+end
+
+def fun_l0_n375(x)
+    if (x < 1)
+        fun_l1_n372(x)
+    else
+        fun_l1_n406(x)
+    end
+end
+
+def fun_l0_n376(x)
+    if (x < 1)
+        fun_l1_n247(x)
+    else
+        fun_l1_n563(x)
+    end
+end
+
+def fun_l0_n377(x)
+    if (x < 1)
+        fun_l1_n998(x)
+    else
+        fun_l1_n302(x)
+    end
+end
+
+def fun_l0_n378(x)
+    if (x < 1)
+        fun_l1_n955(x)
+    else
+        fun_l1_n333(x)
+    end
+end
+
+def fun_l0_n379(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n863(x)
+    end
+end
+
+def fun_l0_n380(x)
+    if (x < 1)
+        fun_l1_n248(x)
+    else
+        fun_l1_n297(x)
+    end
+end
+
+def fun_l0_n381(x)
+    if (x < 1)
+        fun_l1_n85(x)
+    else
+        fun_l1_n726(x)
+    end
+end
+
+def fun_l0_n382(x)
+    if (x < 1)
+        fun_l1_n75(x)
+    else
+        fun_l1_n990(x)
+    end
+end
+
+def fun_l0_n383(x)
+    if (x < 1)
+        fun_l1_n353(x)
+    else
+        fun_l1_n218(x)
+    end
+end
+
+def fun_l0_n384(x)
+    if (x < 1)
+        fun_l1_n103(x)
+    else
+        fun_l1_n192(x)
+    end
+end
+
+def fun_l0_n385(x)
+    if (x < 1)
+        fun_l1_n659(x)
+    else
+        fun_l1_n996(x)
+    end
+end
+
+def fun_l0_n386(x)
+    if (x < 1)
+        fun_l1_n528(x)
+    else
+        fun_l1_n654(x)
+    end
+end
+
+def fun_l0_n387(x)
+    if (x < 1)
+        fun_l1_n857(x)
+    else
+        fun_l1_n638(x)
+    end
+end
+
+def fun_l0_n388(x)
+    if (x < 1)
+        fun_l1_n311(x)
+    else
+        fun_l1_n877(x)
+    end
+end
+
+def fun_l0_n389(x)
+    if (x < 1)
+        fun_l1_n406(x)
+    else
+        fun_l1_n191(x)
+    end
+end
+
+def fun_l0_n390(x)
+    if (x < 1)
+        fun_l1_n464(x)
+    else
+        fun_l1_n684(x)
+    end
+end
+
+def fun_l0_n391(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n635(x)
+    end
+end
+
+def fun_l0_n392(x)
+    if (x < 1)
+        fun_l1_n863(x)
+    else
+        fun_l1_n486(x)
+    end
+end
+
+def fun_l0_n393(x)
+    if (x < 1)
+        fun_l1_n587(x)
+    else
+        fun_l1_n387(x)
+    end
+end
+
+def fun_l0_n394(x)
+    if (x < 1)
+        fun_l1_n553(x)
+    else
+        fun_l1_n789(x)
+    end
+end
+
+def fun_l0_n395(x)
+    if (x < 1)
+        fun_l1_n420(x)
+    else
+        fun_l1_n148(x)
+    end
+end
+
+def fun_l0_n396(x)
+    if (x < 1)
+        fun_l1_n802(x)
+    else
+        fun_l1_n845(x)
+    end
+end
+
+def fun_l0_n397(x)
+    if (x < 1)
+        fun_l1_n749(x)
+    else
+        fun_l1_n742(x)
+    end
+end
+
+def fun_l0_n398(x)
+    if (x < 1)
+        fun_l1_n929(x)
+    else
+        fun_l1_n458(x)
+    end
+end
+
+def fun_l0_n399(x)
+    if (x < 1)
+        fun_l1_n908(x)
+    else
+        fun_l1_n188(x)
+    end
+end
+
+def fun_l0_n400(x)
+    if (x < 1)
+        fun_l1_n932(x)
+    else
+        fun_l1_n854(x)
+    end
+end
+
+def fun_l0_n401(x)
+    if (x < 1)
+        fun_l1_n29(x)
+    else
+        fun_l1_n666(x)
+    end
+end
+
+def fun_l0_n402(x)
+    if (x < 1)
+        fun_l1_n877(x)
+    else
+        fun_l1_n518(x)
+    end
+end
+
+def fun_l0_n403(x)
+    if (x < 1)
+        fun_l1_n639(x)
+    else
+        fun_l1_n618(x)
+    end
+end
+
+def fun_l0_n404(x)
+    if (x < 1)
+        fun_l1_n177(x)
+    else
+        fun_l1_n487(x)
+    end
+end
+
+def fun_l0_n405(x)
+    if (x < 1)
+        fun_l1_n536(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n406(x)
+    if (x < 1)
+        fun_l1_n626(x)
+    else
+        fun_l1_n894(x)
+    end
+end
+
+def fun_l0_n407(x)
+    if (x < 1)
+        fun_l1_n533(x)
+    else
+        fun_l1_n367(x)
+    end
+end
+
+def fun_l0_n408(x)
+    if (x < 1)
+        fun_l1_n146(x)
+    else
+        fun_l1_n546(x)
+    end
+end
+
+def fun_l0_n409(x)
+    if (x < 1)
+        fun_l1_n872(x)
+    else
+        fun_l1_n387(x)
+    end
+end
+
+def fun_l0_n410(x)
+    if (x < 1)
+        fun_l1_n726(x)
+    else
+        fun_l1_n973(x)
+    end
+end
+
+def fun_l0_n411(x)
+    if (x < 1)
+        fun_l1_n168(x)
+    else
+        fun_l1_n783(x)
+    end
+end
+
+def fun_l0_n412(x)
+    if (x < 1)
+        fun_l1_n895(x)
+    else
+        fun_l1_n901(x)
+    end
+end
+
+def fun_l0_n413(x)
+    if (x < 1)
+        fun_l1_n235(x)
+    else
+        fun_l1_n593(x)
+    end
+end
+
+def fun_l0_n414(x)
+    if (x < 1)
+        fun_l1_n328(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n415(x)
+    if (x < 1)
+        fun_l1_n882(x)
+    else
+        fun_l1_n290(x)
+    end
+end
+
+def fun_l0_n416(x)
+    if (x < 1)
+        fun_l1_n433(x)
+    else
+        fun_l1_n220(x)
+    end
+end
+
+def fun_l0_n417(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n74(x)
+    end
+end
+
+def fun_l0_n418(x)
+    if (x < 1)
+        fun_l1_n750(x)
+    else
+        fun_l1_n547(x)
+    end
+end
+
+def fun_l0_n419(x)
+    if (x < 1)
+        fun_l1_n94(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n420(x)
+    if (x < 1)
+        fun_l1_n68(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n421(x)
+    if (x < 1)
+        fun_l1_n663(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n422(x)
+    if (x < 1)
+        fun_l1_n686(x)
+    else
+        fun_l1_n67(x)
+    end
+end
+
+def fun_l0_n423(x)
+    if (x < 1)
+        fun_l1_n210(x)
+    else
+        fun_l1_n64(x)
+    end
+end
+
+def fun_l0_n424(x)
+    if (x < 1)
+        fun_l1_n375(x)
+    else
+        fun_l1_n205(x)
+    end
+end
+
+def fun_l0_n425(x)
+    if (x < 1)
+        fun_l1_n832(x)
+    else
+        fun_l1_n325(x)
+    end
+end
+
+def fun_l0_n426(x)
+    if (x < 1)
+        fun_l1_n819(x)
+    else
+        fun_l1_n601(x)
+    end
+end
+
+def fun_l0_n427(x)
+    if (x < 1)
+        fun_l1_n588(x)
+    else
+        fun_l1_n875(x)
+    end
+end
+
+def fun_l0_n428(x)
+    if (x < 1)
+        fun_l1_n682(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n429(x)
+    if (x < 1)
+        fun_l1_n972(x)
+    else
+        fun_l1_n891(x)
+    end
+end
+
+def fun_l0_n430(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n655(x)
+    end
+end
+
+def fun_l0_n431(x)
+    if (x < 1)
+        fun_l1_n393(x)
+    else
+        fun_l1_n454(x)
+    end
+end
+
+def fun_l0_n432(x)
+    if (x < 1)
+        fun_l1_n435(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n433(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n246(x)
+    end
+end
+
+def fun_l0_n434(x)
+    if (x < 1)
+        fun_l1_n216(x)
+    else
+        fun_l1_n78(x)
+    end
+end
+
+def fun_l0_n435(x)
+    if (x < 1)
+        fun_l1_n357(x)
+    else
+        fun_l1_n61(x)
+    end
+end
+
+def fun_l0_n436(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n507(x)
+    end
+end
+
+def fun_l0_n437(x)
+    if (x < 1)
+        fun_l1_n182(x)
+    else
+        fun_l1_n289(x)
+    end
+end
+
+def fun_l0_n438(x)
+    if (x < 1)
+        fun_l1_n69(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n439(x)
+    if (x < 1)
+        fun_l1_n275(x)
+    else
+        fun_l1_n723(x)
+    end
+end
+
+def fun_l0_n440(x)
+    if (x < 1)
+        fun_l1_n469(x)
+    else
+        fun_l1_n243(x)
+    end
+end
+
+def fun_l0_n441(x)
+    if (x < 1)
+        fun_l1_n595(x)
+    else
+        fun_l1_n624(x)
+    end
+end
+
+def fun_l0_n442(x)
+    if (x < 1)
+        fun_l1_n655(x)
+    else
+        fun_l1_n896(x)
+    end
+end
+
+def fun_l0_n443(x)
+    if (x < 1)
+        fun_l1_n926(x)
+    else
+        fun_l1_n503(x)
+    end
+end
+
+def fun_l0_n444(x)
+    if (x < 1)
+        fun_l1_n875(x)
+    else
+        fun_l1_n110(x)
+    end
+end
+
+def fun_l0_n445(x)
+    if (x < 1)
+        fun_l1_n832(x)
+    else
+        fun_l1_n154(x)
+    end
+end
+
+def fun_l0_n446(x)
+    if (x < 1)
+        fun_l1_n538(x)
+    else
+        fun_l1_n75(x)
+    end
+end
+
+def fun_l0_n447(x)
+    if (x < 1)
+        fun_l1_n183(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n448(x)
+    if (x < 1)
+        fun_l1_n680(x)
+    else
+        fun_l1_n93(x)
+    end
+end
+
+def fun_l0_n449(x)
+    if (x < 1)
+        fun_l1_n147(x)
+    else
+        fun_l1_n924(x)
+    end
+end
+
+def fun_l0_n450(x)
+    if (x < 1)
+        fun_l1_n702(x)
+    else
+        fun_l1_n830(x)
+    end
+end
+
+def fun_l0_n451(x)
+    if (x < 1)
+        fun_l1_n750(x)
+    else
+        fun_l1_n447(x)
+    end
+end
+
+def fun_l0_n452(x)
+    if (x < 1)
+        fun_l1_n520(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n453(x)
+    if (x < 1)
+        fun_l1_n132(x)
+    else
+        fun_l1_n877(x)
+    end
+end
+
+def fun_l0_n454(x)
+    if (x < 1)
+        fun_l1_n247(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n455(x)
+    if (x < 1)
+        fun_l1_n180(x)
+    else
+        fun_l1_n645(x)
+    end
+end
+
+def fun_l0_n456(x)
+    if (x < 1)
+        fun_l1_n658(x)
+    else
+        fun_l1_n487(x)
+    end
+end
+
+def fun_l0_n457(x)
+    if (x < 1)
+        fun_l1_n276(x)
+    else
+        fun_l1_n528(x)
+    end
+end
+
+def fun_l0_n458(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n456(x)
+    end
+end
+
+def fun_l0_n459(x)
+    if (x < 1)
+        fun_l1_n986(x)
+    else
+        fun_l1_n552(x)
+    end
+end
+
+def fun_l0_n460(x)
+    if (x < 1)
+        fun_l1_n874(x)
+    else
+        fun_l1_n396(x)
+    end
+end
+
+def fun_l0_n461(x)
+    if (x < 1)
+        fun_l1_n524(x)
+    else
+        fun_l1_n335(x)
+    end
+end
+
+def fun_l0_n462(x)
+    if (x < 1)
+        fun_l1_n471(x)
+    else
+        fun_l1_n578(x)
+    end
+end
+
+def fun_l0_n463(x)
+    if (x < 1)
+        fun_l1_n173(x)
+    else
+        fun_l1_n456(x)
+    end
+end
+
+def fun_l0_n464(x)
+    if (x < 1)
+        fun_l1_n872(x)
+    else
+        fun_l1_n745(x)
+    end
+end
+
+def fun_l0_n465(x)
+    if (x < 1)
+        fun_l1_n387(x)
+    else
+        fun_l1_n776(x)
+    end
+end
+
+def fun_l0_n466(x)
+    if (x < 1)
+        fun_l1_n119(x)
+    else
+        fun_l1_n428(x)
+    end
+end
+
+def fun_l0_n467(x)
+    if (x < 1)
+        fun_l1_n416(x)
+    else
+        fun_l1_n738(x)
+    end
+end
+
+def fun_l0_n468(x)
+    if (x < 1)
+        fun_l1_n762(x)
+    else
+        fun_l1_n694(x)
+    end
+end
+
+def fun_l0_n469(x)
+    if (x < 1)
+        fun_l1_n27(x)
+    else
+        fun_l1_n562(x)
+    end
+end
+
+def fun_l0_n470(x)
+    if (x < 1)
+        fun_l1_n12(x)
+    else
+        fun_l1_n812(x)
+    end
+end
+
+def fun_l0_n471(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n94(x)
+    end
+end
+
+def fun_l0_n472(x)
+    if (x < 1)
+        fun_l1_n346(x)
+    else
+        fun_l1_n39(x)
+    end
+end
+
+def fun_l0_n473(x)
+    if (x < 1)
+        fun_l1_n309(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n474(x)
+    if (x < 1)
+        fun_l1_n828(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n475(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n121(x)
+    end
+end
+
+def fun_l0_n476(x)
+    if (x < 1)
+        fun_l1_n818(x)
+    else
+        fun_l1_n390(x)
+    end
+end
+
+def fun_l0_n477(x)
+    if (x < 1)
+        fun_l1_n88(x)
+    else
+        fun_l1_n73(x)
+    end
+end
+
+def fun_l0_n478(x)
+    if (x < 1)
+        fun_l1_n709(x)
+    else
+        fun_l1_n680(x)
+    end
+end
+
+def fun_l0_n479(x)
+    if (x < 1)
+        fun_l1_n271(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n480(x)
+    if (x < 1)
+        fun_l1_n493(x)
+    else
+        fun_l1_n562(x)
+    end
+end
+
+def fun_l0_n481(x)
+    if (x < 1)
+        fun_l1_n642(x)
+    else
+        fun_l1_n221(x)
+    end
+end
+
+def fun_l0_n482(x)
+    if (x < 1)
+        fun_l1_n838(x)
+    else
+        fun_l1_n345(x)
+    end
+end
+
+def fun_l0_n483(x)
+    if (x < 1)
+        fun_l1_n411(x)
+    else
+        fun_l1_n266(x)
+    end
+end
+
+def fun_l0_n484(x)
+    if (x < 1)
+        fun_l1_n916(x)
+    else
+        fun_l1_n791(x)
+    end
+end
+
+def fun_l0_n485(x)
+    if (x < 1)
+        fun_l1_n392(x)
+    else
+        fun_l1_n68(x)
+    end
+end
+
+def fun_l0_n486(x)
+    if (x < 1)
+        fun_l1_n834(x)
+    else
+        fun_l1_n783(x)
+    end
+end
+
+def fun_l0_n487(x)
+    if (x < 1)
+        fun_l1_n398(x)
+    else
+        fun_l1_n627(x)
+    end
+end
+
+def fun_l0_n488(x)
+    if (x < 1)
+        fun_l1_n904(x)
+    else
+        fun_l1_n167(x)
+    end
+end
+
+def fun_l0_n489(x)
+    if (x < 1)
+        fun_l1_n54(x)
+    else
+        fun_l1_n28(x)
+    end
+end
+
+def fun_l0_n490(x)
+    if (x < 1)
+        fun_l1_n24(x)
+    else
+        fun_l1_n9(x)
+    end
+end
+
+def fun_l0_n491(x)
+    if (x < 1)
+        fun_l1_n497(x)
+    else
+        fun_l1_n297(x)
+    end
+end
+
+def fun_l0_n492(x)
+    if (x < 1)
+        fun_l1_n951(x)
+    else
+        fun_l1_n534(x)
+    end
+end
+
+def fun_l0_n493(x)
+    if (x < 1)
+        fun_l1_n213(x)
+    else
+        fun_l1_n808(x)
+    end
+end
+
+def fun_l0_n494(x)
+    if (x < 1)
+        fun_l1_n904(x)
+    else
+        fun_l1_n94(x)
+    end
+end
+
+def fun_l0_n495(x)
+    if (x < 1)
+        fun_l1_n799(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n496(x)
+    if (x < 1)
+        fun_l1_n45(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n497(x)
+    if (x < 1)
+        fun_l1_n482(x)
+    else
+        fun_l1_n783(x)
+    end
+end
+
+def fun_l0_n498(x)
+    if (x < 1)
+        fun_l1_n78(x)
+    else
+        fun_l1_n785(x)
+    end
+end
+
+def fun_l0_n499(x)
+    if (x < 1)
+        fun_l1_n174(x)
+    else
+        fun_l1_n87(x)
+    end
+end
+
+def fun_l0_n500(x)
+    if (x < 1)
+        fun_l1_n608(x)
+    else
+        fun_l1_n7(x)
+    end
+end
+
+def fun_l0_n501(x)
+    if (x < 1)
+        fun_l1_n157(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n502(x)
+    if (x < 1)
+        fun_l1_n823(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n503(x)
+    if (x < 1)
+        fun_l1_n13(x)
+    else
+        fun_l1_n502(x)
+    end
+end
+
+def fun_l0_n504(x)
+    if (x < 1)
+        fun_l1_n119(x)
+    else
+        fun_l1_n191(x)
+    end
+end
+
+def fun_l0_n505(x)
+    if (x < 1)
+        fun_l1_n503(x)
+    else
+        fun_l1_n974(x)
+    end
+end
+
+def fun_l0_n506(x)
+    if (x < 1)
+        fun_l1_n893(x)
+    else
+        fun_l1_n582(x)
+    end
+end
+
+def fun_l0_n507(x)
+    if (x < 1)
+        fun_l1_n403(x)
+    else
+        fun_l1_n228(x)
+    end
+end
+
+def fun_l0_n508(x)
+    if (x < 1)
+        fun_l1_n640(x)
+    else
+        fun_l1_n362(x)
+    end
+end
+
+def fun_l0_n509(x)
+    if (x < 1)
+        fun_l1_n629(x)
+    else
+        fun_l1_n824(x)
+    end
+end
+
+def fun_l0_n510(x)
+    if (x < 1)
+        fun_l1_n84(x)
+    else
+        fun_l1_n330(x)
+    end
+end
+
+def fun_l0_n511(x)
+    if (x < 1)
+        fun_l1_n91(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n512(x)
+    if (x < 1)
+        fun_l1_n696(x)
+    else
+        fun_l1_n126(x)
+    end
+end
+
+def fun_l0_n513(x)
+    if (x < 1)
+        fun_l1_n905(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n514(x)
+    if (x < 1)
+        fun_l1_n766(x)
+    else
+        fun_l1_n523(x)
+    end
+end
+
+def fun_l0_n515(x)
+    if (x < 1)
+        fun_l1_n798(x)
+    else
+        fun_l1_n698(x)
+    end
+end
+
+def fun_l0_n516(x)
+    if (x < 1)
+        fun_l1_n124(x)
+    else
+        fun_l1_n356(x)
+    end
+end
+
+def fun_l0_n517(x)
+    if (x < 1)
+        fun_l1_n289(x)
+    else
+        fun_l1_n782(x)
+    end
+end
+
+def fun_l0_n518(x)
+    if (x < 1)
+        fun_l1_n483(x)
+    else
+        fun_l1_n586(x)
+    end
+end
+
+def fun_l0_n519(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n37(x)
+    end
+end
+
+def fun_l0_n520(x)
+    if (x < 1)
+        fun_l1_n48(x)
+    else
+        fun_l1_n216(x)
+    end
+end
+
+def fun_l0_n521(x)
+    if (x < 1)
+        fun_l1_n805(x)
+    else
+        fun_l1_n846(x)
+    end
+end
+
+def fun_l0_n522(x)
+    if (x < 1)
+        fun_l1_n422(x)
+    else
+        fun_l1_n190(x)
+    end
+end
+
+def fun_l0_n523(x)
+    if (x < 1)
+        fun_l1_n168(x)
+    else
+        fun_l1_n272(x)
+    end
+end
+
+def fun_l0_n524(x)
+    if (x < 1)
+        fun_l1_n766(x)
+    else
+        fun_l1_n125(x)
+    end
+end
+
+def fun_l0_n525(x)
+    if (x < 1)
+        fun_l1_n56(x)
+    else
+        fun_l1_n224(x)
+    end
+end
+
+def fun_l0_n526(x)
+    if (x < 1)
+        fun_l1_n540(x)
+    else
+        fun_l1_n303(x)
+    end
+end
+
+def fun_l0_n527(x)
+    if (x < 1)
+        fun_l1_n846(x)
+    else
+        fun_l1_n955(x)
+    end
+end
+
+def fun_l0_n528(x)
+    if (x < 1)
+        fun_l1_n571(x)
+    else
+        fun_l1_n640(x)
+    end
+end
+
+def fun_l0_n529(x)
+    if (x < 1)
+        fun_l1_n650(x)
+    else
+        fun_l1_n107(x)
+    end
+end
+
+def fun_l0_n530(x)
+    if (x < 1)
+        fun_l1_n240(x)
+    else
+        fun_l1_n139(x)
+    end
+end
+
+def fun_l0_n531(x)
+    if (x < 1)
+        fun_l1_n975(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n532(x)
+    if (x < 1)
+        fun_l1_n753(x)
+    else
+        fun_l1_n147(x)
+    end
+end
+
+def fun_l0_n533(x)
+    if (x < 1)
+        fun_l1_n269(x)
+    else
+        fun_l1_n292(x)
+    end
+end
+
+def fun_l0_n534(x)
+    if (x < 1)
+        fun_l1_n791(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n535(x)
+    if (x < 1)
+        fun_l1_n469(x)
+    else
+        fun_l1_n58(x)
+    end
+end
+
+def fun_l0_n536(x)
+    if (x < 1)
+        fun_l1_n526(x)
+    else
+        fun_l1_n265(x)
+    end
+end
+
+def fun_l0_n537(x)
+    if (x < 1)
+        fun_l1_n681(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n538(x)
+    if (x < 1)
+        fun_l1_n377(x)
+    else
+        fun_l1_n969(x)
+    end
+end
+
+def fun_l0_n539(x)
+    if (x < 1)
+        fun_l1_n935(x)
+    else
+        fun_l1_n556(x)
+    end
+end
+
+def fun_l0_n540(x)
+    if (x < 1)
+        fun_l1_n498(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n541(x)
+    if (x < 1)
+        fun_l1_n451(x)
+    else
+        fun_l1_n35(x)
+    end
+end
+
+def fun_l0_n542(x)
+    if (x < 1)
+        fun_l1_n32(x)
+    else
+        fun_l1_n795(x)
+    end
+end
+
+def fun_l0_n543(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n544(x)
+    if (x < 1)
+        fun_l1_n176(x)
+    else
+        fun_l1_n735(x)
+    end
+end
+
+def fun_l0_n545(x)
+    if (x < 1)
+        fun_l1_n34(x)
+    else
+        fun_l1_n989(x)
+    end
+end
+
+def fun_l0_n546(x)
+    if (x < 1)
+        fun_l1_n534(x)
+    else
+        fun_l1_n705(x)
+    end
+end
+
+def fun_l0_n547(x)
+    if (x < 1)
+        fun_l1_n997(x)
+    else
+        fun_l1_n883(x)
+    end
+end
+
+def fun_l0_n548(x)
+    if (x < 1)
+        fun_l1_n379(x)
+    else
+        fun_l1_n33(x)
+    end
+end
+
+def fun_l0_n549(x)
+    if (x < 1)
+        fun_l1_n454(x)
+    else
+        fun_l1_n516(x)
+    end
+end
+
+def fun_l0_n550(x)
+    if (x < 1)
+        fun_l1_n678(x)
+    else
+        fun_l1_n652(x)
+    end
+end
+
+def fun_l0_n551(x)
+    if (x < 1)
+        fun_l1_n13(x)
+    else
+        fun_l1_n864(x)
+    end
+end
+
+def fun_l0_n552(x)
+    if (x < 1)
+        fun_l1_n178(x)
+    else
+        fun_l1_n996(x)
+    end
+end
+
+def fun_l0_n553(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n703(x)
+    end
+end
+
+def fun_l0_n554(x)
+    if (x < 1)
+        fun_l1_n306(x)
+    else
+        fun_l1_n24(x)
+    end
+end
+
+def fun_l0_n555(x)
+    if (x < 1)
+        fun_l1_n110(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n556(x)
+    if (x < 1)
+        fun_l1_n367(x)
+    else
+        fun_l1_n117(x)
+    end
+end
+
+def fun_l0_n557(x)
+    if (x < 1)
+        fun_l1_n967(x)
+    else
+        fun_l1_n662(x)
+    end
+end
+
+def fun_l0_n558(x)
+    if (x < 1)
+        fun_l1_n68(x)
+    else
+        fun_l1_n47(x)
+    end
+end
+
+def fun_l0_n559(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n344(x)
+    end
+end
+
+def fun_l0_n560(x)
+    if (x < 1)
+        fun_l1_n835(x)
+    else
+        fun_l1_n577(x)
+    end
+end
+
+def fun_l0_n561(x)
+    if (x < 1)
+        fun_l1_n393(x)
+    else
+        fun_l1_n419(x)
+    end
+end
+
+def fun_l0_n562(x)
+    if (x < 1)
+        fun_l1_n632(x)
+    else
+        fun_l1_n630(x)
+    end
+end
+
+def fun_l0_n563(x)
+    if (x < 1)
+        fun_l1_n9(x)
+    else
+        fun_l1_n109(x)
+    end
+end
+
+def fun_l0_n564(x)
+    if (x < 1)
+        fun_l1_n65(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n565(x)
+    if (x < 1)
+        fun_l1_n156(x)
+    else
+        fun_l1_n921(x)
+    end
+end
+
+def fun_l0_n566(x)
+    if (x < 1)
+        fun_l1_n88(x)
+    else
+        fun_l1_n743(x)
+    end
+end
+
+def fun_l0_n567(x)
+    if (x < 1)
+        fun_l1_n92(x)
+    else
+        fun_l1_n27(x)
+    end
+end
+
+def fun_l0_n568(x)
+    if (x < 1)
+        fun_l1_n462(x)
+    else
+        fun_l1_n988(x)
+    end
+end
+
+def fun_l0_n569(x)
+    if (x < 1)
+        fun_l1_n241(x)
+    else
+        fun_l1_n199(x)
+    end
+end
+
+def fun_l0_n570(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n571(x)
+    if (x < 1)
+        fun_l1_n412(x)
+    else
+        fun_l1_n530(x)
+    end
+end
+
+def fun_l0_n572(x)
+    if (x < 1)
+        fun_l1_n100(x)
+    else
+        fun_l1_n270(x)
+    end
+end
+
+def fun_l0_n573(x)
+    if (x < 1)
+        fun_l1_n326(x)
+    else
+        fun_l1_n191(x)
+    end
+end
+
+def fun_l0_n574(x)
+    if (x < 1)
+        fun_l1_n151(x)
+    else
+        fun_l1_n354(x)
+    end
+end
+
+def fun_l0_n575(x)
+    if (x < 1)
+        fun_l1_n322(x)
+    else
+        fun_l1_n534(x)
+    end
+end
+
+def fun_l0_n576(x)
+    if (x < 1)
+        fun_l1_n995(x)
+    else
+        fun_l1_n658(x)
+    end
+end
+
+def fun_l0_n577(x)
+    if (x < 1)
+        fun_l1_n193(x)
+    else
+        fun_l1_n444(x)
+    end
+end
+
+def fun_l0_n578(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n517(x)
+    end
+end
+
+def fun_l0_n579(x)
+    if (x < 1)
+        fun_l1_n885(x)
+    else
+        fun_l1_n218(x)
+    end
+end
+
+def fun_l0_n580(x)
+    if (x < 1)
+        fun_l1_n789(x)
+    else
+        fun_l1_n711(x)
+    end
+end
+
+def fun_l0_n581(x)
+    if (x < 1)
+        fun_l1_n848(x)
+    else
+        fun_l1_n321(x)
+    end
+end
+
+def fun_l0_n582(x)
+    if (x < 1)
+        fun_l1_n389(x)
+    else
+        fun_l1_n360(x)
+    end
+end
+
+def fun_l0_n583(x)
+    if (x < 1)
+        fun_l1_n319(x)
+    else
+        fun_l1_n972(x)
+    end
+end
+
+def fun_l0_n584(x)
+    if (x < 1)
+        fun_l1_n421(x)
+    else
+        fun_l1_n659(x)
+    end
+end
+
+def fun_l0_n585(x)
+    if (x < 1)
+        fun_l1_n462(x)
+    else
+        fun_l1_n302(x)
+    end
+end
+
+def fun_l0_n586(x)
+    if (x < 1)
+        fun_l1_n122(x)
+    else
+        fun_l1_n50(x)
+    end
+end
+
+def fun_l0_n587(x)
+    if (x < 1)
+        fun_l1_n795(x)
+    else
+        fun_l1_n622(x)
+    end
+end
+
+def fun_l0_n588(x)
+    if (x < 1)
+        fun_l1_n719(x)
+    else
+        fun_l1_n390(x)
+    end
+end
+
+def fun_l0_n589(x)
+    if (x < 1)
+        fun_l1_n916(x)
+    else
+        fun_l1_n925(x)
+    end
+end
+
+def fun_l0_n590(x)
+    if (x < 1)
+        fun_l1_n541(x)
+    else
+        fun_l1_n139(x)
+    end
+end
+
+def fun_l0_n591(x)
+    if (x < 1)
+        fun_l1_n610(x)
+    else
+        fun_l1_n509(x)
+    end
+end
+
+def fun_l0_n592(x)
+    if (x < 1)
+        fun_l1_n217(x)
+    else
+        fun_l1_n452(x)
+    end
+end
+
+def fun_l0_n593(x)
+    if (x < 1)
+        fun_l1_n456(x)
+    else
+        fun_l1_n888(x)
+    end
+end
+
+def fun_l0_n594(x)
+    if (x < 1)
+        fun_l1_n987(x)
+    else
+        fun_l1_n462(x)
+    end
+end
+
+def fun_l0_n595(x)
+    if (x < 1)
+        fun_l1_n571(x)
+    else
+        fun_l1_n429(x)
+    end
+end
+
+def fun_l0_n596(x)
+    if (x < 1)
+        fun_l1_n751(x)
+    else
+        fun_l1_n773(x)
+    end
+end
+
+def fun_l0_n597(x)
+    if (x < 1)
+        fun_l1_n181(x)
+    else
+        fun_l1_n340(x)
+    end
+end
+
+def fun_l0_n598(x)
+    if (x < 1)
+        fun_l1_n6(x)
+    else
+        fun_l1_n39(x)
+    end
+end
+
+def fun_l0_n599(x)
+    if (x < 1)
+        fun_l1_n814(x)
+    else
+        fun_l1_n320(x)
+    end
+end
+
+def fun_l0_n600(x)
+    if (x < 1)
+        fun_l1_n931(x)
+    else
+        fun_l1_n535(x)
+    end
+end
+
+def fun_l0_n601(x)
+    if (x < 1)
+        fun_l1_n99(x)
+    else
+        fun_l1_n154(x)
+    end
+end
+
+def fun_l0_n602(x)
+    if (x < 1)
+        fun_l1_n981(x)
+    else
+        fun_l1_n817(x)
+    end
+end
+
+def fun_l0_n603(x)
+    if (x < 1)
+        fun_l1_n975(x)
+    else
+        fun_l1_n364(x)
+    end
+end
+
+def fun_l0_n604(x)
+    if (x < 1)
+        fun_l1_n112(x)
+    else
+        fun_l1_n226(x)
+    end
+end
+
+def fun_l0_n605(x)
+    if (x < 1)
+        fun_l1_n995(x)
+    else
+        fun_l1_n95(x)
+    end
+end
+
+def fun_l0_n606(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n77(x)
+    end
+end
+
+def fun_l0_n607(x)
+    if (x < 1)
+        fun_l1_n899(x)
+    else
+        fun_l1_n957(x)
+    end
+end
+
+def fun_l0_n608(x)
+    if (x < 1)
+        fun_l1_n844(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n609(x)
+    if (x < 1)
+        fun_l1_n861(x)
+    else
+        fun_l1_n74(x)
+    end
+end
+
+def fun_l0_n610(x)
+    if (x < 1)
+        fun_l1_n521(x)
+    else
+        fun_l1_n46(x)
+    end
+end
+
+def fun_l0_n611(x)
+    if (x < 1)
+        fun_l1_n258(x)
+    else
+        fun_l1_n208(x)
+    end
+end
+
+def fun_l0_n612(x)
+    if (x < 1)
+        fun_l1_n620(x)
+    else
+        fun_l1_n427(x)
+    end
+end
+
+def fun_l0_n613(x)
+    if (x < 1)
+        fun_l1_n583(x)
+    else
+        fun_l1_n400(x)
+    end
+end
+
+def fun_l0_n614(x)
+    if (x < 1)
+        fun_l1_n933(x)
+    else
+        fun_l1_n810(x)
+    end
+end
+
+def fun_l0_n615(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n879(x)
+    end
+end
+
+def fun_l0_n616(x)
+    if (x < 1)
+        fun_l1_n715(x)
+    else
+        fun_l1_n862(x)
+    end
+end
+
+def fun_l0_n617(x)
+    if (x < 1)
+        fun_l1_n178(x)
+    else
+        fun_l1_n285(x)
+    end
+end
+
+def fun_l0_n618(x)
+    if (x < 1)
+        fun_l1_n458(x)
+    else
+        fun_l1_n217(x)
+    end
+end
+
+def fun_l0_n619(x)
+    if (x < 1)
+        fun_l1_n655(x)
+    else
+        fun_l1_n405(x)
+    end
+end
+
+def fun_l0_n620(x)
+    if (x < 1)
+        fun_l1_n470(x)
+    else
+        fun_l1_n306(x)
+    end
+end
+
+def fun_l0_n621(x)
+    if (x < 1)
+        fun_l1_n755(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n622(x)
+    if (x < 1)
+        fun_l1_n426(x)
+    else
+        fun_l1_n737(x)
+    end
+end
+
+def fun_l0_n623(x)
+    if (x < 1)
+        fun_l1_n79(x)
+    else
+        fun_l1_n55(x)
+    end
+end
+
+def fun_l0_n624(x)
+    if (x < 1)
+        fun_l1_n437(x)
+    else
+        fun_l1_n79(x)
+    end
+end
+
+def fun_l0_n625(x)
+    if (x < 1)
+        fun_l1_n691(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n626(x)
+    if (x < 1)
+        fun_l1_n703(x)
+    else
+        fun_l1_n585(x)
+    end
+end
+
+def fun_l0_n627(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n425(x)
+    end
+end
+
+def fun_l0_n628(x)
+    if (x < 1)
+        fun_l1_n516(x)
+    else
+        fun_l1_n744(x)
+    end
+end
+
+def fun_l0_n629(x)
+    if (x < 1)
+        fun_l1_n40(x)
+    else
+        fun_l1_n942(x)
+    end
+end
+
+def fun_l0_n630(x)
+    if (x < 1)
+        fun_l1_n528(x)
+    else
+        fun_l1_n440(x)
+    end
+end
+
+def fun_l0_n631(x)
+    if (x < 1)
+        fun_l1_n139(x)
+    else
+        fun_l1_n403(x)
+    end
+end
+
+def fun_l0_n632(x)
+    if (x < 1)
+        fun_l1_n421(x)
+    else
+        fun_l1_n510(x)
+    end
+end
+
+def fun_l0_n633(x)
+    if (x < 1)
+        fun_l1_n718(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n634(x)
+    if (x < 1)
+        fun_l1_n67(x)
+    else
+        fun_l1_n342(x)
+    end
+end
+
+def fun_l0_n635(x)
+    if (x < 1)
+        fun_l1_n943(x)
+    else
+        fun_l1_n941(x)
+    end
+end
+
+def fun_l0_n636(x)
+    if (x < 1)
+        fun_l1_n170(x)
+    else
+        fun_l1_n527(x)
+    end
+end
+
+def fun_l0_n637(x)
+    if (x < 1)
+        fun_l1_n336(x)
+    else
+        fun_l1_n496(x)
+    end
+end
+
+def fun_l0_n638(x)
+    if (x < 1)
+        fun_l1_n730(x)
+    else
+        fun_l1_n10(x)
+    end
+end
+
+def fun_l0_n639(x)
+    if (x < 1)
+        fun_l1_n939(x)
+    else
+        fun_l1_n940(x)
+    end
+end
+
+def fun_l0_n640(x)
+    if (x < 1)
+        fun_l1_n73(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n641(x)
+    if (x < 1)
+        fun_l1_n460(x)
+    else
+        fun_l1_n828(x)
+    end
+end
+
+def fun_l0_n642(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n113(x)
+    end
+end
+
+def fun_l0_n643(x)
+    if (x < 1)
+        fun_l1_n972(x)
+    else
+        fun_l1_n15(x)
+    end
+end
+
+def fun_l0_n644(x)
+    if (x < 1)
+        fun_l1_n417(x)
+    else
+        fun_l1_n228(x)
+    end
+end
+
+def fun_l0_n645(x)
+    if (x < 1)
+        fun_l1_n876(x)
+    else
+        fun_l1_n152(x)
+    end
+end
+
+def fun_l0_n646(x)
+    if (x < 1)
+        fun_l1_n404(x)
+    else
+        fun_l1_n147(x)
+    end
+end
+
+def fun_l0_n647(x)
+    if (x < 1)
+        fun_l1_n802(x)
+    else
+        fun_l1_n824(x)
+    end
+end
+
+def fun_l0_n648(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n421(x)
+    end
+end
+
+def fun_l0_n649(x)
+    if (x < 1)
+        fun_l1_n807(x)
+    else
+        fun_l1_n955(x)
+    end
+end
+
+def fun_l0_n650(x)
+    if (x < 1)
+        fun_l1_n221(x)
+    else
+        fun_l1_n367(x)
+    end
+end
+
+def fun_l0_n651(x)
+    if (x < 1)
+        fun_l1_n955(x)
+    else
+        fun_l1_n401(x)
+    end
+end
+
+def fun_l0_n652(x)
+    if (x < 1)
+        fun_l1_n203(x)
+    else
+        fun_l1_n909(x)
+    end
+end
+
+def fun_l0_n653(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n535(x)
+    end
+end
+
+def fun_l0_n654(x)
+    if (x < 1)
+        fun_l1_n420(x)
+    else
+        fun_l1_n393(x)
+    end
+end
+
+def fun_l0_n655(x)
+    if (x < 1)
+        fun_l1_n232(x)
+    else
+        fun_l1_n981(x)
+    end
+end
+
+def fun_l0_n656(x)
+    if (x < 1)
+        fun_l1_n873(x)
+    else
+        fun_l1_n510(x)
+    end
+end
+
+def fun_l0_n657(x)
+    if (x < 1)
+        fun_l1_n919(x)
+    else
+        fun_l1_n706(x)
+    end
+end
+
+def fun_l0_n658(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n112(x)
+    end
+end
+
+def fun_l0_n659(x)
+    if (x < 1)
+        fun_l1_n547(x)
+    else
+        fun_l1_n712(x)
+    end
+end
+
+def fun_l0_n660(x)
+    if (x < 1)
+        fun_l1_n498(x)
+    else
+        fun_l1_n695(x)
+    end
+end
+
+def fun_l0_n661(x)
+    if (x < 1)
+        fun_l1_n801(x)
+    else
+        fun_l1_n659(x)
+    end
+end
+
+def fun_l0_n662(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n663(x)
+    if (x < 1)
+        fun_l1_n11(x)
+    else
+        fun_l1_n620(x)
+    end
+end
+
+def fun_l0_n664(x)
+    if (x < 1)
+        fun_l1_n652(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n665(x)
+    if (x < 1)
+        fun_l1_n655(x)
+    else
+        fun_l1_n331(x)
+    end
+end
+
+def fun_l0_n666(x)
+    if (x < 1)
+        fun_l1_n846(x)
+    else
+        fun_l1_n1(x)
+    end
+end
+
+def fun_l0_n667(x)
+    if (x < 1)
+        fun_l1_n55(x)
+    else
+        fun_l1_n32(x)
+    end
+end
+
+def fun_l0_n668(x)
+    if (x < 1)
+        fun_l1_n241(x)
+    else
+        fun_l1_n627(x)
+    end
+end
+
+def fun_l0_n669(x)
+    if (x < 1)
+        fun_l1_n234(x)
+    else
+        fun_l1_n996(x)
+    end
+end
+
+def fun_l0_n670(x)
+    if (x < 1)
+        fun_l1_n235(x)
+    else
+        fun_l1_n761(x)
+    end
+end
+
+def fun_l0_n671(x)
+    if (x < 1)
+        fun_l1_n990(x)
+    else
+        fun_l1_n236(x)
+    end
+end
+
+def fun_l0_n672(x)
+    if (x < 1)
+        fun_l1_n970(x)
+    else
+        fun_l1_n595(x)
+    end
+end
+
+def fun_l0_n673(x)
+    if (x < 1)
+        fun_l1_n294(x)
+    else
+        fun_l1_n440(x)
+    end
+end
+
+def fun_l0_n674(x)
+    if (x < 1)
+        fun_l1_n597(x)
+    else
+        fun_l1_n956(x)
+    end
+end
+
+def fun_l0_n675(x)
+    if (x < 1)
+        fun_l1_n942(x)
+    else
+        fun_l1_n352(x)
+    end
+end
+
+def fun_l0_n676(x)
+    if (x < 1)
+        fun_l1_n309(x)
+    else
+        fun_l1_n294(x)
+    end
+end
+
+def fun_l0_n677(x)
+    if (x < 1)
+        fun_l1_n752(x)
+    else
+        fun_l1_n447(x)
+    end
+end
+
+def fun_l0_n678(x)
+    if (x < 1)
+        fun_l1_n890(x)
+    else
+        fun_l1_n497(x)
+    end
+end
+
+def fun_l0_n679(x)
+    if (x < 1)
+        fun_l1_n808(x)
+    else
+        fun_l1_n881(x)
+    end
+end
+
+def fun_l0_n680(x)
+    if (x < 1)
+        fun_l1_n966(x)
+    else
+        fun_l1_n460(x)
+    end
+end
+
+def fun_l0_n681(x)
+    if (x < 1)
+        fun_l1_n104(x)
+    else
+        fun_l1_n262(x)
+    end
+end
+
+def fun_l0_n682(x)
+    if (x < 1)
+        fun_l1_n425(x)
+    else
+        fun_l1_n177(x)
+    end
+end
+
+def fun_l0_n683(x)
+    if (x < 1)
+        fun_l1_n15(x)
+    else
+        fun_l1_n458(x)
+    end
+end
+
+def fun_l0_n684(x)
+    if (x < 1)
+        fun_l1_n760(x)
+    else
+        fun_l1_n997(x)
+    end
+end
+
+def fun_l0_n685(x)
+    if (x < 1)
+        fun_l1_n496(x)
+    else
+        fun_l1_n223(x)
+    end
+end
+
+def fun_l0_n686(x)
+    if (x < 1)
+        fun_l1_n363(x)
+    else
+        fun_l1_n543(x)
+    end
+end
+
+def fun_l0_n687(x)
+    if (x < 1)
+        fun_l1_n758(x)
+    else
+        fun_l1_n473(x)
+    end
+end
+
+def fun_l0_n688(x)
+    if (x < 1)
+        fun_l1_n854(x)
+    else
+        fun_l1_n999(x)
+    end
+end
+
+def fun_l0_n689(x)
+    if (x < 1)
+        fun_l1_n336(x)
+    else
+        fun_l1_n388(x)
+    end
+end
+
+def fun_l0_n690(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n478(x)
+    end
+end
+
+def fun_l0_n691(x)
+    if (x < 1)
+        fun_l1_n423(x)
+    else
+        fun_l1_n83(x)
+    end
+end
+
+def fun_l0_n692(x)
+    if (x < 1)
+        fun_l1_n797(x)
+    else
+        fun_l1_n427(x)
+    end
+end
+
+def fun_l0_n693(x)
+    if (x < 1)
+        fun_l1_n907(x)
+    else
+        fun_l1_n1(x)
+    end
+end
+
+def fun_l0_n694(x)
+    if (x < 1)
+        fun_l1_n601(x)
+    else
+        fun_l1_n809(x)
+    end
+end
+
+def fun_l0_n695(x)
+    if (x < 1)
+        fun_l1_n252(x)
+    else
+        fun_l1_n233(x)
+    end
+end
+
+def fun_l0_n696(x)
+    if (x < 1)
+        fun_l1_n36(x)
+    else
+        fun_l1_n796(x)
+    end
+end
+
+def fun_l0_n697(x)
+    if (x < 1)
+        fun_l1_n893(x)
+    else
+        fun_l1_n926(x)
+    end
+end
+
+def fun_l0_n698(x)
+    if (x < 1)
+        fun_l1_n511(x)
+    else
+        fun_l1_n88(x)
+    end
+end
+
+def fun_l0_n699(x)
+    if (x < 1)
+        fun_l1_n573(x)
+    else
+        fun_l1_n718(x)
+    end
+end
+
+def fun_l0_n700(x)
+    if (x < 1)
+        fun_l1_n475(x)
+    else
+        fun_l1_n539(x)
+    end
+end
+
+def fun_l0_n701(x)
+    if (x < 1)
+        fun_l1_n238(x)
+    else
+        fun_l1_n253(x)
+    end
+end
+
+def fun_l0_n702(x)
+    if (x < 1)
+        fun_l1_n731(x)
+    else
+        fun_l1_n225(x)
+    end
+end
+
+def fun_l0_n703(x)
+    if (x < 1)
+        fun_l1_n594(x)
+    else
+        fun_l1_n16(x)
+    end
+end
+
+def fun_l0_n704(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n354(x)
+    end
+end
+
+def fun_l0_n705(x)
+    if (x < 1)
+        fun_l1_n812(x)
+    else
+        fun_l1_n218(x)
+    end
+end
+
+def fun_l0_n706(x)
+    if (x < 1)
+        fun_l1_n731(x)
+    else
+        fun_l1_n343(x)
+    end
+end
+
+def fun_l0_n707(x)
+    if (x < 1)
+        fun_l1_n134(x)
+    else
+        fun_l1_n752(x)
+    end
+end
+
+def fun_l0_n708(x)
+    if (x < 1)
+        fun_l1_n899(x)
+    else
+        fun_l1_n854(x)
+    end
+end
+
+def fun_l0_n709(x)
+    if (x < 1)
+        fun_l1_n120(x)
+    else
+        fun_l1_n193(x)
+    end
+end
+
+def fun_l0_n710(x)
+    if (x < 1)
+        fun_l1_n22(x)
+    else
+        fun_l1_n254(x)
+    end
+end
+
+def fun_l0_n711(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n921(x)
+    end
+end
+
+def fun_l0_n712(x)
+    if (x < 1)
+        fun_l1_n820(x)
+    else
+        fun_l1_n96(x)
+    end
+end
+
+def fun_l0_n713(x)
+    if (x < 1)
+        fun_l1_n145(x)
+    else
+        fun_l1_n226(x)
+    end
+end
+
+def fun_l0_n714(x)
+    if (x < 1)
+        fun_l1_n643(x)
+    else
+        fun_l1_n407(x)
+    end
+end
+
+def fun_l0_n715(x)
+    if (x < 1)
+        fun_l1_n349(x)
+    else
+        fun_l1_n450(x)
+    end
+end
+
+def fun_l0_n716(x)
+    if (x < 1)
+        fun_l1_n954(x)
+    else
+        fun_l1_n707(x)
+    end
+end
+
+def fun_l0_n717(x)
+    if (x < 1)
+        fun_l1_n723(x)
+    else
+        fun_l1_n762(x)
+    end
+end
+
+def fun_l0_n718(x)
+    if (x < 1)
+        fun_l1_n299(x)
+    else
+        fun_l1_n332(x)
+    end
+end
+
+def fun_l0_n719(x)
+    if (x < 1)
+        fun_l1_n493(x)
+    else
+        fun_l1_n521(x)
+    end
+end
+
+def fun_l0_n720(x)
+    if (x < 1)
+        fun_l1_n39(x)
+    else
+        fun_l1_n17(x)
+    end
+end
+
+def fun_l0_n721(x)
+    if (x < 1)
+        fun_l1_n297(x)
+    else
+        fun_l1_n800(x)
+    end
+end
+
+def fun_l0_n722(x)
+    if (x < 1)
+        fun_l1_n758(x)
+    else
+        fun_l1_n135(x)
+    end
+end
+
+def fun_l0_n723(x)
+    if (x < 1)
+        fun_l1_n471(x)
+    else
+        fun_l1_n351(x)
+    end
+end
+
+def fun_l0_n724(x)
+    if (x < 1)
+        fun_l1_n381(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n725(x)
+    if (x < 1)
+        fun_l1_n624(x)
+    else
+        fun_l1_n162(x)
+    end
+end
+
+def fun_l0_n726(x)
+    if (x < 1)
+        fun_l1_n143(x)
+    else
+        fun_l1_n417(x)
+    end
+end
+
+def fun_l0_n727(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n19(x)
+    end
+end
+
+def fun_l0_n728(x)
+    if (x < 1)
+        fun_l1_n687(x)
+    else
+        fun_l1_n574(x)
+    end
+end
+
+def fun_l0_n729(x)
+    if (x < 1)
+        fun_l1_n225(x)
+    else
+        fun_l1_n871(x)
+    end
+end
+
+def fun_l0_n730(x)
+    if (x < 1)
+        fun_l1_n830(x)
+    else
+        fun_l1_n273(x)
+    end
+end
+
+def fun_l0_n731(x)
+    if (x < 1)
+        fun_l1_n95(x)
+    else
+        fun_l1_n864(x)
+    end
+end
+
+def fun_l0_n732(x)
+    if (x < 1)
+        fun_l1_n902(x)
+    else
+        fun_l1_n522(x)
+    end
+end
+
+def fun_l0_n733(x)
+    if (x < 1)
+        fun_l1_n564(x)
+    else
+        fun_l1_n55(x)
+    end
+end
+
+def fun_l0_n734(x)
+    if (x < 1)
+        fun_l1_n481(x)
+    else
+        fun_l1_n880(x)
+    end
+end
+
+def fun_l0_n735(x)
+    if (x < 1)
+        fun_l1_n87(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n736(x)
+    if (x < 1)
+        fun_l1_n72(x)
+    else
+        fun_l1_n396(x)
+    end
+end
+
+def fun_l0_n737(x)
+    if (x < 1)
+        fun_l1_n920(x)
+    else
+        fun_l1_n852(x)
+    end
+end
+
+def fun_l0_n738(x)
+    if (x < 1)
+        fun_l1_n342(x)
+    else
+        fun_l1_n959(x)
+    end
+end
+
+def fun_l0_n739(x)
+    if (x < 1)
+        fun_l1_n682(x)
+    else
+        fun_l1_n714(x)
+    end
+end
+
+def fun_l0_n740(x)
+    if (x < 1)
+        fun_l1_n264(x)
+    else
+        fun_l1_n325(x)
+    end
+end
+
+def fun_l0_n741(x)
+    if (x < 1)
+        fun_l1_n621(x)
+    else
+        fun_l1_n339(x)
+    end
+end
+
+def fun_l0_n742(x)
+    if (x < 1)
+        fun_l1_n46(x)
+    else
+        fun_l1_n766(x)
+    end
+end
+
+def fun_l0_n743(x)
+    if (x < 1)
+        fun_l1_n333(x)
+    else
+        fun_l1_n353(x)
+    end
+end
+
+def fun_l0_n744(x)
+    if (x < 1)
+        fun_l1_n930(x)
+    else
+        fun_l1_n964(x)
+    end
+end
+
+def fun_l0_n745(x)
+    if (x < 1)
+        fun_l1_n785(x)
+    else
+        fun_l1_n114(x)
+    end
+end
+
+def fun_l0_n746(x)
+    if (x < 1)
+        fun_l1_n402(x)
+    else
+        fun_l1_n803(x)
+    end
+end
+
+def fun_l0_n747(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n870(x)
+    end
+end
+
+def fun_l0_n748(x)
+    if (x < 1)
+        fun_l1_n683(x)
+    else
+        fun_l1_n287(x)
+    end
+end
+
+def fun_l0_n749(x)
+    if (x < 1)
+        fun_l1_n816(x)
+    else
+        fun_l1_n849(x)
+    end
+end
+
+def fun_l0_n750(x)
+    if (x < 1)
+        fun_l1_n523(x)
+    else
+        fun_l1_n555(x)
+    end
+end
+
+def fun_l0_n751(x)
+    if (x < 1)
+        fun_l1_n270(x)
+    else
+        fun_l1_n660(x)
+    end
+end
+
+def fun_l0_n752(x)
+    if (x < 1)
+        fun_l1_n786(x)
+    else
+        fun_l1_n749(x)
+    end
+end
+
+def fun_l0_n753(x)
+    if (x < 1)
+        fun_l1_n567(x)
+    else
+        fun_l1_n325(x)
+    end
+end
+
+def fun_l0_n754(x)
+    if (x < 1)
+        fun_l1_n502(x)
+    else
+        fun_l1_n610(x)
+    end
+end
+
+def fun_l0_n755(x)
+    if (x < 1)
+        fun_l1_n336(x)
+    else
+        fun_l1_n354(x)
+    end
+end
+
+def fun_l0_n756(x)
+    if (x < 1)
+        fun_l1_n435(x)
+    else
+        fun_l1_n484(x)
+    end
+end
+
+def fun_l0_n757(x)
+    if (x < 1)
+        fun_l1_n849(x)
+    else
+        fun_l1_n42(x)
+    end
+end
+
+def fun_l0_n758(x)
+    if (x < 1)
+        fun_l1_n294(x)
+    else
+        fun_l1_n483(x)
+    end
+end
+
+def fun_l0_n759(x)
+    if (x < 1)
+        fun_l1_n14(x)
+    else
+        fun_l1_n9(x)
+    end
+end
+
+def fun_l0_n760(x)
+    if (x < 1)
+        fun_l1_n860(x)
+    else
+        fun_l1_n645(x)
+    end
+end
+
+def fun_l0_n761(x)
+    if (x < 1)
+        fun_l1_n577(x)
+    else
+        fun_l1_n0(x)
+    end
+end
+
+def fun_l0_n762(x)
+    if (x < 1)
+        fun_l1_n28(x)
+    else
+        fun_l1_n834(x)
+    end
+end
+
+def fun_l0_n763(x)
+    if (x < 1)
+        fun_l1_n147(x)
+    else
+        fun_l1_n177(x)
+    end
+end
+
+def fun_l0_n764(x)
+    if (x < 1)
+        fun_l1_n429(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n765(x)
+    if (x < 1)
+        fun_l1_n474(x)
+    else
+        fun_l1_n22(x)
+    end
+end
+
+def fun_l0_n766(x)
+    if (x < 1)
+        fun_l1_n264(x)
+    else
+        fun_l1_n549(x)
+    end
+end
+
+def fun_l0_n767(x)
+    if (x < 1)
+        fun_l1_n351(x)
+    else
+        fun_l1_n813(x)
+    end
+end
+
+def fun_l0_n768(x)
+    if (x < 1)
+        fun_l1_n798(x)
+    else
+        fun_l1_n684(x)
+    end
+end
+
+def fun_l0_n769(x)
+    if (x < 1)
+        fun_l1_n202(x)
+    else
+        fun_l1_n982(x)
+    end
+end
+
+def fun_l0_n770(x)
+    if (x < 1)
+        fun_l1_n611(x)
+    else
+        fun_l1_n52(x)
+    end
+end
+
+def fun_l0_n771(x)
+    if (x < 1)
+        fun_l1_n754(x)
+    else
+        fun_l1_n7(x)
+    end
+end
+
+def fun_l0_n772(x)
+    if (x < 1)
+        fun_l1_n98(x)
+    else
+        fun_l1_n149(x)
+    end
+end
+
+def fun_l0_n773(x)
+    if (x < 1)
+        fun_l1_n358(x)
+    else
+        fun_l1_n603(x)
+    end
+end
+
+def fun_l0_n774(x)
+    if (x < 1)
+        fun_l1_n604(x)
+    else
+        fun_l1_n318(x)
+    end
+end
+
+def fun_l0_n775(x)
+    if (x < 1)
+        fun_l1_n831(x)
+    else
+        fun_l1_n635(x)
+    end
+end
+
+def fun_l0_n776(x)
+    if (x < 1)
+        fun_l1_n738(x)
+    else
+        fun_l1_n563(x)
+    end
+end
+
+def fun_l0_n777(x)
+    if (x < 1)
+        fun_l1_n570(x)
+    else
+        fun_l1_n671(x)
+    end
+end
+
+def fun_l0_n778(x)
+    if (x < 1)
+        fun_l1_n945(x)
+    else
+        fun_l1_n840(x)
+    end
+end
+
+def fun_l0_n779(x)
+    if (x < 1)
+        fun_l1_n116(x)
+    else
+        fun_l1_n942(x)
+    end
+end
+
+def fun_l0_n780(x)
+    if (x < 1)
+        fun_l1_n835(x)
+    else
+        fun_l1_n244(x)
+    end
+end
+
+def fun_l0_n781(x)
+    if (x < 1)
+        fun_l1_n427(x)
+    else
+        fun_l1_n556(x)
+    end
+end
+
+def fun_l0_n782(x)
+    if (x < 1)
+        fun_l1_n280(x)
+    else
+        fun_l1_n926(x)
+    end
+end
+
+def fun_l0_n783(x)
+    if (x < 1)
+        fun_l1_n674(x)
+    else
+        fun_l1_n560(x)
+    end
+end
+
+def fun_l0_n784(x)
+    if (x < 1)
+        fun_l1_n978(x)
+    else
+        fun_l1_n139(x)
+    end
+end
+
+def fun_l0_n785(x)
+    if (x < 1)
+        fun_l1_n928(x)
+    else
+        fun_l1_n11(x)
+    end
+end
+
+def fun_l0_n786(x)
+    if (x < 1)
+        fun_l1_n829(x)
+    else
+        fun_l1_n239(x)
+    end
+end
+
+def fun_l0_n787(x)
+    if (x < 1)
+        fun_l1_n732(x)
+    else
+        fun_l1_n829(x)
+    end
+end
+
+def fun_l0_n788(x)
+    if (x < 1)
+        fun_l1_n968(x)
+    else
+        fun_l1_n596(x)
+    end
+end
+
+def fun_l0_n789(x)
+    if (x < 1)
+        fun_l1_n214(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n790(x)
+    if (x < 1)
+        fun_l1_n566(x)
+    else
+        fun_l1_n390(x)
+    end
+end
+
+def fun_l0_n791(x)
+    if (x < 1)
+        fun_l1_n936(x)
+    else
+        fun_l1_n31(x)
+    end
+end
+
+def fun_l0_n792(x)
+    if (x < 1)
+        fun_l1_n291(x)
+    else
+        fun_l1_n835(x)
+    end
+end
+
+def fun_l0_n793(x)
+    if (x < 1)
+        fun_l1_n300(x)
+    else
+        fun_l1_n658(x)
+    end
+end
+
+def fun_l0_n794(x)
+    if (x < 1)
+        fun_l1_n609(x)
+    else
+        fun_l1_n156(x)
+    end
+end
+
+def fun_l0_n795(x)
+    if (x < 1)
+        fun_l1_n419(x)
+    else
+        fun_l1_n534(x)
+    end
+end
+
+def fun_l0_n796(x)
+    if (x < 1)
+        fun_l1_n401(x)
+    else
+        fun_l1_n281(x)
+    end
+end
+
+def fun_l0_n797(x)
+    if (x < 1)
+        fun_l1_n538(x)
+    else
+        fun_l1_n905(x)
+    end
+end
+
+def fun_l0_n798(x)
+    if (x < 1)
+        fun_l1_n427(x)
+    else
+        fun_l1_n978(x)
+    end
+end
+
+def fun_l0_n799(x)
+    if (x < 1)
+        fun_l1_n851(x)
+    else
+        fun_l1_n57(x)
+    end
+end
+
+def fun_l0_n800(x)
+    if (x < 1)
+        fun_l1_n836(x)
+    else
+        fun_l1_n306(x)
+    end
+end
+
+def fun_l0_n801(x)
+    if (x < 1)
+        fun_l1_n414(x)
+    else
+        fun_l1_n679(x)
+    end
+end
+
+def fun_l0_n802(x)
+    if (x < 1)
+        fun_l1_n645(x)
+    else
+        fun_l1_n115(x)
+    end
+end
+
+def fun_l0_n803(x)
+    if (x < 1)
+        fun_l1_n884(x)
+    else
+        fun_l1_n801(x)
+    end
+end
+
+def fun_l0_n804(x)
+    if (x < 1)
+        fun_l1_n713(x)
+    else
+        fun_l1_n974(x)
+    end
+end
+
+def fun_l0_n805(x)
+    if (x < 1)
+        fun_l1_n301(x)
+    else
+        fun_l1_n589(x)
+    end
+end
+
+def fun_l0_n806(x)
+    if (x < 1)
+        fun_l1_n912(x)
+    else
+        fun_l1_n766(x)
+    end
+end
+
+def fun_l0_n807(x)
+    if (x < 1)
+        fun_l1_n656(x)
+    else
+        fun_l1_n765(x)
+    end
+end
+
+def fun_l0_n808(x)
+    if (x < 1)
+        fun_l1_n517(x)
+    else
+        fun_l1_n964(x)
+    end
+end
+
+def fun_l0_n809(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n69(x)
+    end
+end
+
+def fun_l0_n810(x)
+    if (x < 1)
+        fun_l1_n527(x)
+    else
+        fun_l1_n841(x)
+    end
+end
+
+def fun_l0_n811(x)
+    if (x < 1)
+        fun_l1_n564(x)
+    else
+        fun_l1_n541(x)
+    end
+end
+
+def fun_l0_n812(x)
+    if (x < 1)
+        fun_l1_n754(x)
+    else
+        fun_l1_n681(x)
+    end
+end
+
+def fun_l0_n813(x)
+    if (x < 1)
+        fun_l1_n21(x)
+    else
+        fun_l1_n561(x)
+    end
+end
+
+def fun_l0_n814(x)
+    if (x < 1)
+        fun_l1_n547(x)
+    else
+        fun_l1_n631(x)
+    end
+end
+
+def fun_l0_n815(x)
+    if (x < 1)
+        fun_l1_n956(x)
+    else
+        fun_l1_n889(x)
+    end
+end
+
+def fun_l0_n816(x)
+    if (x < 1)
+        fun_l1_n817(x)
+    else
+        fun_l1_n957(x)
+    end
+end
+
+def fun_l0_n817(x)
+    if (x < 1)
+        fun_l1_n622(x)
+    else
+        fun_l1_n827(x)
+    end
+end
+
+def fun_l0_n818(x)
+    if (x < 1)
+        fun_l1_n7(x)
+    else
+        fun_l1_n208(x)
+    end
+end
+
+def fun_l0_n819(x)
+    if (x < 1)
+        fun_l1_n411(x)
+    else
+        fun_l1_n742(x)
+    end
+end
+
+def fun_l0_n820(x)
+    if (x < 1)
+        fun_l1_n676(x)
+    else
+        fun_l1_n144(x)
+    end
+end
+
+def fun_l0_n821(x)
+    if (x < 1)
+        fun_l1_n489(x)
+    else
+        fun_l1_n963(x)
+    end
+end
+
+def fun_l0_n822(x)
+    if (x < 1)
+        fun_l1_n645(x)
+    else
+        fun_l1_n953(x)
+    end
+end
+
+def fun_l0_n823(x)
+    if (x < 1)
+        fun_l1_n974(x)
+    else
+        fun_l1_n75(x)
+    end
+end
+
+def fun_l0_n824(x)
+    if (x < 1)
+        fun_l1_n295(x)
+    else
+        fun_l1_n249(x)
+    end
+end
+
+def fun_l0_n825(x)
+    if (x < 1)
+        fun_l1_n141(x)
+    else
+        fun_l1_n633(x)
+    end
+end
+
+def fun_l0_n826(x)
+    if (x < 1)
+        fun_l1_n317(x)
+    else
+        fun_l1_n152(x)
+    end
+end
+
+def fun_l0_n827(x)
+    if (x < 1)
+        fun_l1_n570(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n828(x)
+    if (x < 1)
+        fun_l1_n392(x)
+    else
+        fun_l1_n477(x)
+    end
+end
+
+def fun_l0_n829(x)
+    if (x < 1)
+        fun_l1_n277(x)
+    else
+        fun_l1_n276(x)
+    end
+end
+
+def fun_l0_n830(x)
+    if (x < 1)
+        fun_l1_n579(x)
+    else
+        fun_l1_n648(x)
+    end
+end
+
+def fun_l0_n831(x)
+    if (x < 1)
+        fun_l1_n8(x)
+    else
+        fun_l1_n25(x)
+    end
+end
+
+def fun_l0_n832(x)
+    if (x < 1)
+        fun_l1_n724(x)
+    else
+        fun_l1_n617(x)
+    end
+end
+
+def fun_l0_n833(x)
+    if (x < 1)
+        fun_l1_n771(x)
+    else
+        fun_l1_n619(x)
+    end
+end
+
+def fun_l0_n834(x)
+    if (x < 1)
+        fun_l1_n23(x)
+    else
+        fun_l1_n127(x)
+    end
+end
+
+def fun_l0_n835(x)
+    if (x < 1)
+        fun_l1_n322(x)
+    else
+        fun_l1_n327(x)
+    end
+end
+
+def fun_l0_n836(x)
+    if (x < 1)
+        fun_l1_n7(x)
+    else
+        fun_l1_n600(x)
+    end
+end
+
+def fun_l0_n837(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n782(x)
+    end
+end
+
+def fun_l0_n838(x)
+    if (x < 1)
+        fun_l1_n937(x)
+    else
+        fun_l1_n899(x)
+    end
+end
+
+def fun_l0_n839(x)
+    if (x < 1)
+        fun_l1_n16(x)
+    else
+        fun_l1_n349(x)
+    end
+end
+
+def fun_l0_n840(x)
+    if (x < 1)
+        fun_l1_n622(x)
+    else
+        fun_l1_n960(x)
+    end
+end
+
+def fun_l0_n841(x)
+    if (x < 1)
+        fun_l1_n295(x)
+    else
+        fun_l1_n176(x)
+    end
+end
+
+def fun_l0_n842(x)
+    if (x < 1)
+        fun_l1_n302(x)
+    else
+        fun_l1_n639(x)
+    end
+end
+
+def fun_l0_n843(x)
+    if (x < 1)
+        fun_l1_n342(x)
+    else
+        fun_l1_n373(x)
+    end
+end
+
+def fun_l0_n844(x)
+    if (x < 1)
+        fun_l1_n5(x)
+    else
+        fun_l1_n787(x)
+    end
+end
+
+def fun_l0_n845(x)
+    if (x < 1)
+        fun_l1_n89(x)
+    else
+        fun_l1_n951(x)
+    end
+end
+
+def fun_l0_n846(x)
+    if (x < 1)
+        fun_l1_n954(x)
+    else
+        fun_l1_n982(x)
+    end
+end
+
+def fun_l0_n847(x)
+    if (x < 1)
+        fun_l1_n971(x)
+    else
+        fun_l1_n917(x)
+    end
+end
+
+def fun_l0_n848(x)
+    if (x < 1)
+        fun_l1_n845(x)
+    else
+        fun_l1_n343(x)
+    end
+end
+
+def fun_l0_n849(x)
+    if (x < 1)
+        fun_l1_n684(x)
+    else
+        fun_l1_n683(x)
+    end
+end
+
+def fun_l0_n850(x)
+    if (x < 1)
+        fun_l1_n670(x)
+    else
+        fun_l1_n256(x)
+    end
+end
+
+def fun_l0_n851(x)
+    if (x < 1)
+        fun_l1_n405(x)
+    else
+        fun_l1_n123(x)
+    end
+end
+
+def fun_l0_n852(x)
+    if (x < 1)
+        fun_l1_n809(x)
+    else
+        fun_l1_n691(x)
+    end
+end
+
+def fun_l0_n853(x)
+    if (x < 1)
+        fun_l1_n937(x)
+    else
+        fun_l1_n92(x)
+    end
+end
+
+def fun_l0_n854(x)
+    if (x < 1)
+        fun_l1_n735(x)
+    else
+        fun_l1_n948(x)
+    end
+end
+
+def fun_l0_n855(x)
+    if (x < 1)
+        fun_l1_n684(x)
+    else
+        fun_l1_n566(x)
+    end
+end
+
+def fun_l0_n856(x)
+    if (x < 1)
+        fun_l1_n508(x)
+    else
+        fun_l1_n35(x)
+    end
+end
+
+def fun_l0_n857(x)
+    if (x < 1)
+        fun_l1_n865(x)
+    else
+        fun_l1_n930(x)
+    end
+end
+
+def fun_l0_n858(x)
+    if (x < 1)
+        fun_l1_n937(x)
+    else
+        fun_l1_n241(x)
+    end
+end
+
+def fun_l0_n859(x)
+    if (x < 1)
+        fun_l1_n938(x)
+    else
+        fun_l1_n108(x)
+    end
+end
+
+def fun_l0_n860(x)
+    if (x < 1)
+        fun_l1_n491(x)
+    else
+        fun_l1_n119(x)
+    end
+end
+
+def fun_l0_n861(x)
+    if (x < 1)
+        fun_l1_n991(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n862(x)
+    if (x < 1)
+        fun_l1_n846(x)
+    else
+        fun_l1_n513(x)
+    end
+end
+
+def fun_l0_n863(x)
+    if (x < 1)
+        fun_l1_n279(x)
+    else
+        fun_l1_n229(x)
+    end
+end
+
+def fun_l0_n864(x)
+    if (x < 1)
+        fun_l1_n52(x)
+    else
+        fun_l1_n765(x)
+    end
+end
+
+def fun_l0_n865(x)
+    if (x < 1)
+        fun_l1_n35(x)
+    else
+        fun_l1_n572(x)
+    end
+end
+
+def fun_l0_n866(x)
+    if (x < 1)
+        fun_l1_n4(x)
+    else
+        fun_l1_n645(x)
+    end
+end
+
+def fun_l0_n867(x)
+    if (x < 1)
+        fun_l1_n112(x)
+    else
+        fun_l1_n758(x)
+    end
+end
+
+def fun_l0_n868(x)
+    if (x < 1)
+        fun_l1_n924(x)
+    else
+        fun_l1_n251(x)
+    end
+end
+
+def fun_l0_n869(x)
+    if (x < 1)
+        fun_l1_n558(x)
+    else
+        fun_l1_n818(x)
+    end
+end
+
+def fun_l0_n870(x)
+    if (x < 1)
+        fun_l1_n804(x)
+    else
+        fun_l1_n746(x)
+    end
+end
+
+def fun_l0_n871(x)
+    if (x < 1)
+        fun_l1_n111(x)
+    else
+        fun_l1_n407(x)
+    end
+end
+
+def fun_l0_n872(x)
+    if (x < 1)
+        fun_l1_n973(x)
+    else
+        fun_l1_n384(x)
+    end
+end
+
+def fun_l0_n873(x)
+    if (x < 1)
+        fun_l1_n102(x)
+    else
+        fun_l1_n199(x)
+    end
+end
+
+def fun_l0_n874(x)
+    if (x < 1)
+        fun_l1_n735(x)
+    else
+        fun_l1_n903(x)
+    end
+end
+
+def fun_l0_n875(x)
+    if (x < 1)
+        fun_l1_n95(x)
+    else
+        fun_l1_n720(x)
+    end
+end
+
+def fun_l0_n876(x)
+    if (x < 1)
+        fun_l1_n864(x)
+    else
+        fun_l1_n970(x)
+    end
+end
+
+def fun_l0_n877(x)
+    if (x < 1)
+        fun_l1_n729(x)
+    else
+        fun_l1_n207(x)
+    end
+end
+
+def fun_l0_n878(x)
+    if (x < 1)
+        fun_l1_n104(x)
+    else
+        fun_l1_n209(x)
+    end
+end
+
+def fun_l0_n879(x)
+    if (x < 1)
+        fun_l1_n566(x)
+    else
+        fun_l1_n918(x)
+    end
+end
+
+def fun_l0_n880(x)
+    if (x < 1)
+        fun_l1_n457(x)
+    else
+        fun_l1_n104(x)
+    end
+end
+
+def fun_l0_n881(x)
+    if (x < 1)
+        fun_l1_n745(x)
+    else
+        fun_l1_n476(x)
+    end
+end
+
+def fun_l0_n882(x)
+    if (x < 1)
+        fun_l1_n346(x)
+    else
+        fun_l1_n642(x)
+    end
+end
+
+def fun_l0_n883(x)
+    if (x < 1)
+        fun_l1_n78(x)
+    else
+        fun_l1_n210(x)
+    end
+end
+
+def fun_l0_n884(x)
+    if (x < 1)
+        fun_l1_n864(x)
+    else
+        fun_l1_n439(x)
+    end
+end
+
+def fun_l0_n885(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n414(x)
+    end
+end
+
+def fun_l0_n886(x)
+    if (x < 1)
+        fun_l1_n217(x)
+    else
+        fun_l1_n444(x)
+    end
+end
+
+def fun_l0_n887(x)
+    if (x < 1)
+        fun_l1_n193(x)
+    else
+        fun_l1_n788(x)
+    end
+end
+
+def fun_l0_n888(x)
+    if (x < 1)
+        fun_l1_n30(x)
+    else
+        fun_l1_n793(x)
+    end
+end
+
+def fun_l0_n889(x)
+    if (x < 1)
+        fun_l1_n222(x)
+    else
+        fun_l1_n936(x)
+    end
+end
+
+def fun_l0_n890(x)
+    if (x < 1)
+        fun_l1_n758(x)
+    else
+        fun_l1_n52(x)
+    end
+end
+
+def fun_l0_n891(x)
+    if (x < 1)
+        fun_l1_n796(x)
+    else
+        fun_l1_n424(x)
+    end
+end
+
+def fun_l0_n892(x)
+    if (x < 1)
+        fun_l1_n627(x)
+    else
+        fun_l1_n284(x)
+    end
+end
+
+def fun_l0_n893(x)
+    if (x < 1)
+        fun_l1_n42(x)
+    else
+        fun_l1_n193(x)
+    end
+end
+
+def fun_l0_n894(x)
+    if (x < 1)
+        fun_l1_n90(x)
+    else
+        fun_l1_n158(x)
+    end
+end
+
+def fun_l0_n895(x)
+    if (x < 1)
+        fun_l1_n878(x)
+    else
+        fun_l1_n396(x)
+    end
+end
+
+def fun_l0_n896(x)
+    if (x < 1)
+        fun_l1_n665(x)
+    else
+        fun_l1_n731(x)
+    end
+end
+
+def fun_l0_n897(x)
+    if (x < 1)
+        fun_l1_n618(x)
+    else
+        fun_l1_n152(x)
+    end
+end
+
+def fun_l0_n898(x)
+    if (x < 1)
+        fun_l1_n64(x)
+    else
+        fun_l1_n697(x)
+    end
+end
+
+def fun_l0_n899(x)
+    if (x < 1)
+        fun_l1_n354(x)
+    else
+        fun_l1_n657(x)
+    end
+end
+
+def fun_l0_n900(x)
+    if (x < 1)
+        fun_l1_n79(x)
+    else
+        fun_l1_n794(x)
+    end
+end
+
+def fun_l0_n901(x)
+    if (x < 1)
+        fun_l1_n623(x)
+    else
+        fun_l1_n392(x)
+    end
+end
+
+def fun_l0_n902(x)
+    if (x < 1)
+        fun_l1_n529(x)
+    else
+        fun_l1_n708(x)
+    end
+end
+
+def fun_l0_n903(x)
+    if (x < 1)
+        fun_l1_n900(x)
+    else
+        fun_l1_n830(x)
+    end
+end
+
+def fun_l0_n904(x)
+    if (x < 1)
+        fun_l1_n424(x)
+    else
+        fun_l1_n564(x)
+    end
+end
+
+def fun_l0_n905(x)
+    if (x < 1)
+        fun_l1_n557(x)
+    else
+        fun_l1_n612(x)
+    end
+end
+
+def fun_l0_n906(x)
+    if (x < 1)
+        fun_l1_n725(x)
+    else
+        fun_l1_n166(x)
+    end
+end
+
+def fun_l0_n907(x)
+    if (x < 1)
+        fun_l1_n534(x)
+    else
+        fun_l1_n159(x)
+    end
+end
+
+def fun_l0_n908(x)
+    if (x < 1)
+        fun_l1_n50(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n909(x)
+    if (x < 1)
+        fun_l1_n568(x)
+    else
+        fun_l1_n276(x)
+    end
+end
+
+def fun_l0_n910(x)
+    if (x < 1)
+        fun_l1_n0(x)
+    else
+        fun_l1_n324(x)
+    end
+end
+
+def fun_l0_n911(x)
+    if (x < 1)
+        fun_l1_n926(x)
+    else
+        fun_l1_n524(x)
+    end
+end
+
+def fun_l0_n912(x)
+    if (x < 1)
+        fun_l1_n498(x)
+    else
+        fun_l1_n650(x)
+    end
+end
+
+def fun_l0_n913(x)
+    if (x < 1)
+        fun_l1_n593(x)
+    else
+        fun_l1_n860(x)
+    end
+end
+
+def fun_l0_n914(x)
+    if (x < 1)
+        fun_l1_n726(x)
+    else
+        fun_l1_n440(x)
+    end
+end
+
+def fun_l0_n915(x)
+    if (x < 1)
+        fun_l1_n422(x)
+    else
+        fun_l1_n627(x)
+    end
+end
+
+def fun_l0_n916(x)
+    if (x < 1)
+        fun_l1_n346(x)
+    else
+        fun_l1_n932(x)
+    end
+end
+
+def fun_l0_n917(x)
+    if (x < 1)
+        fun_l1_n403(x)
+    else
+        fun_l1_n58(x)
+    end
+end
+
+def fun_l0_n918(x)
+    if (x < 1)
+        fun_l1_n989(x)
+    else
+        fun_l1_n579(x)
+    end
+end
+
+def fun_l0_n919(x)
+    if (x < 1)
+        fun_l1_n933(x)
+    else
+        fun_l1_n434(x)
+    end
+end
+
+def fun_l0_n920(x)
+    if (x < 1)
+        fun_l1_n899(x)
+    else
+        fun_l1_n377(x)
+    end
+end
+
+def fun_l0_n921(x)
+    if (x < 1)
+        fun_l1_n17(x)
+    else
+        fun_l1_n637(x)
+    end
+end
+
+def fun_l0_n922(x)
+    if (x < 1)
+        fun_l1_n551(x)
+    else
+        fun_l1_n693(x)
+    end
+end
+
+def fun_l0_n923(x)
+    if (x < 1)
+        fun_l1_n861(x)
+    else
+        fun_l1_n248(x)
+    end
+end
+
+def fun_l0_n924(x)
+    if (x < 1)
+        fun_l1_n171(x)
+    else
+        fun_l1_n75(x)
+    end
+end
+
+def fun_l0_n925(x)
+    if (x < 1)
+        fun_l1_n233(x)
+    else
+        fun_l1_n444(x)
+    end
+end
+
+def fun_l0_n926(x)
+    if (x < 1)
+        fun_l1_n310(x)
+    else
+        fun_l1_n941(x)
+    end
+end
+
+def fun_l0_n927(x)
+    if (x < 1)
+        fun_l1_n363(x)
+    else
+        fun_l1_n567(x)
+    end
+end
+
+def fun_l0_n928(x)
+    if (x < 1)
+        fun_l1_n632(x)
+    else
+        fun_l1_n840(x)
+    end
+end
+
+def fun_l0_n929(x)
+    if (x < 1)
+        fun_l1_n368(x)
+    else
+        fun_l1_n713(x)
+    end
+end
+
+def fun_l0_n930(x)
+    if (x < 1)
+        fun_l1_n37(x)
+    else
+        fun_l1_n355(x)
+    end
+end
+
+def fun_l0_n931(x)
+    if (x < 1)
+        fun_l1_n907(x)
+    else
+        fun_l1_n784(x)
+    end
+end
+
+def fun_l0_n932(x)
+    if (x < 1)
+        fun_l1_n591(x)
+    else
+        fun_l1_n844(x)
+    end
+end
+
+def fun_l0_n933(x)
+    if (x < 1)
+        fun_l1_n996(x)
+    else
+        fun_l1_n943(x)
+    end
+end
+
+def fun_l0_n934(x)
+    if (x < 1)
+        fun_l1_n631(x)
+    else
+        fun_l1_n643(x)
+    end
+end
+
+def fun_l0_n935(x)
+    if (x < 1)
+        fun_l1_n875(x)
+    else
+        fun_l1_n89(x)
+    end
+end
+
+def fun_l0_n936(x)
+    if (x < 1)
+        fun_l1_n842(x)
+    else
+        fun_l1_n595(x)
+    end
+end
+
+def fun_l0_n937(x)
+    if (x < 1)
+        fun_l1_n921(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n938(x)
+    if (x < 1)
+        fun_l1_n222(x)
+    else
+        fun_l1_n170(x)
+    end
+end
+
+def fun_l0_n939(x)
+    if (x < 1)
+        fun_l1_n567(x)
+    else
+        fun_l1_n463(x)
+    end
+end
+
+def fun_l0_n940(x)
+    if (x < 1)
+        fun_l1_n456(x)
+    else
+        fun_l1_n192(x)
+    end
+end
+
+def fun_l0_n941(x)
+    if (x < 1)
+        fun_l1_n32(x)
+    else
+        fun_l1_n951(x)
+    end
+end
+
+def fun_l0_n942(x)
+    if (x < 1)
+        fun_l1_n14(x)
+    else
+        fun_l1_n135(x)
+    end
+end
+
+def fun_l0_n943(x)
+    if (x < 1)
+        fun_l1_n15(x)
+    else
+        fun_l1_n234(x)
+    end
+end
+
+def fun_l0_n944(x)
+    if (x < 1)
+        fun_l1_n119(x)
+    else
+        fun_l1_n33(x)
+    end
+end
+
+def fun_l0_n945(x)
+    if (x < 1)
+        fun_l1_n859(x)
+    else
+        fun_l1_n497(x)
+    end
+end
+
+def fun_l0_n946(x)
+    if (x < 1)
+        fun_l1_n178(x)
+    else
+        fun_l1_n369(x)
+    end
+end
+
+def fun_l0_n947(x)
+    if (x < 1)
+        fun_l1_n64(x)
+    else
+        fun_l1_n356(x)
+    end
+end
+
+def fun_l0_n948(x)
+    if (x < 1)
+        fun_l1_n279(x)
+    else
+        fun_l1_n244(x)
+    end
+end
+
+def fun_l0_n949(x)
+    if (x < 1)
+        fun_l1_n728(x)
+    else
+        fun_l1_n548(x)
+    end
+end
+
+def fun_l0_n950(x)
+    if (x < 1)
+        fun_l1_n3(x)
+    else
+        fun_l1_n698(x)
+    end
+end
+
+def fun_l0_n951(x)
+    if (x < 1)
+        fun_l1_n665(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n952(x)
+    if (x < 1)
+        fun_l1_n812(x)
+    else
+        fun_l1_n964(x)
+    end
+end
+
+def fun_l0_n953(x)
+    if (x < 1)
+        fun_l1_n851(x)
+    else
+        fun_l1_n877(x)
+    end
+end
+
+def fun_l0_n954(x)
+    if (x < 1)
+        fun_l1_n415(x)
+    else
+        fun_l1_n379(x)
+    end
+end
+
+def fun_l0_n955(x)
+    if (x < 1)
+        fun_l1_n806(x)
+    else
+        fun_l1_n919(x)
+    end
+end
+
+def fun_l0_n956(x)
+    if (x < 1)
+        fun_l1_n207(x)
+    else
+        fun_l1_n798(x)
+    end
+end
+
+def fun_l0_n957(x)
+    if (x < 1)
+        fun_l1_n269(x)
+    else
+        fun_l1_n416(x)
+    end
+end
+
+def fun_l0_n958(x)
+    if (x < 1)
+        fun_l1_n654(x)
+    else
+        fun_l1_n236(x)
+    end
+end
+
+def fun_l0_n959(x)
+    if (x < 1)
+        fun_l1_n392(x)
+    else
+        fun_l1_n623(x)
+    end
+end
+
+def fun_l0_n960(x)
+    if (x < 1)
+        fun_l1_n889(x)
+    else
+        fun_l1_n279(x)
+    end
+end
+
+def fun_l0_n961(x)
+    if (x < 1)
+        fun_l1_n476(x)
+    else
+        fun_l1_n201(x)
+    end
+end
+
+def fun_l0_n962(x)
+    if (x < 1)
+        fun_l1_n799(x)
+    else
+        fun_l1_n570(x)
+    end
+end
+
+def fun_l0_n963(x)
+    if (x < 1)
+        fun_l1_n802(x)
+    else
+        fun_l1_n114(x)
+    end
+end
+
+def fun_l0_n964(x)
+    if (x < 1)
+        fun_l1_n197(x)
+    else
+        fun_l1_n422(x)
+    end
+end
+
+def fun_l0_n965(x)
+    if (x < 1)
+        fun_l1_n37(x)
+    else
+        fun_l1_n691(x)
+    end
+end
+
+def fun_l0_n966(x)
+    if (x < 1)
+        fun_l1_n775(x)
+    else
+        fun_l1_n854(x)
+    end
+end
+
+def fun_l0_n967(x)
+    if (x < 1)
+        fun_l1_n373(x)
+    else
+        fun_l1_n306(x)
+    end
+end
+
+def fun_l0_n968(x)
+    if (x < 1)
+        fun_l1_n154(x)
+    else
+        fun_l1_n122(x)
+    end
+end
+
+def fun_l0_n969(x)
+    if (x < 1)
+        fun_l1_n497(x)
+    else
+        fun_l1_n456(x)
+    end
+end
+
+def fun_l0_n970(x)
+    if (x < 1)
+        fun_l1_n621(x)
+    else
+        fun_l1_n931(x)
+    end
+end
+
+def fun_l0_n971(x)
+    if (x < 1)
+        fun_l1_n963(x)
+    else
+        fun_l1_n613(x)
+    end
+end
+
+def fun_l0_n972(x)
+    if (x < 1)
+        fun_l1_n613(x)
+    else
+        fun_l1_n508(x)
+    end
+end
+
+def fun_l0_n973(x)
+    if (x < 1)
+        fun_l1_n466(x)
+    else
+        fun_l1_n929(x)
+    end
+end
+
+def fun_l0_n974(x)
+    if (x < 1)
+        fun_l1_n247(x)
+    else
+        fun_l1_n610(x)
+    end
+end
+
+def fun_l0_n975(x)
+    if (x < 1)
+        fun_l1_n674(x)
+    else
+        fun_l1_n609(x)
+    end
+end
+
+def fun_l0_n976(x)
+    if (x < 1)
+        fun_l1_n963(x)
+    else
+        fun_l1_n601(x)
+    end
+end
+
+def fun_l0_n977(x)
+    if (x < 1)
+        fun_l1_n728(x)
+    else
+        fun_l1_n242(x)
+    end
+end
+
+def fun_l0_n978(x)
+    if (x < 1)
+        fun_l1_n515(x)
+    else
+        fun_l1_n113(x)
+    end
+end
+
+def fun_l0_n979(x)
+    if (x < 1)
+        fun_l1_n734(x)
+    else
+        fun_l1_n271(x)
+    end
+end
+
+def fun_l0_n980(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n733(x)
+    end
+end
+
+def fun_l0_n981(x)
+    if (x < 1)
+        fun_l1_n326(x)
+    else
+        fun_l1_n213(x)
+    end
+end
+
+def fun_l0_n982(x)
+    if (x < 1)
+        fun_l1_n733(x)
+    else
+        fun_l1_n198(x)
+    end
+end
+
+def fun_l0_n983(x)
+    if (x < 1)
+        fun_l1_n989(x)
+    else
+        fun_l1_n700(x)
+    end
+end
+
+def fun_l0_n984(x)
+    if (x < 1)
+        fun_l1_n266(x)
+    else
+        fun_l1_n348(x)
+    end
+end
+
+def fun_l0_n985(x)
+    if (x < 1)
+        fun_l1_n931(x)
+    else
+        fun_l1_n646(x)
+    end
+end
+
+def fun_l0_n986(x)
+    if (x < 1)
+        fun_l1_n435(x)
+    else
+        fun_l1_n747(x)
+    end
+end
+
+def fun_l0_n987(x)
+    if (x < 1)
+        fun_l1_n474(x)
+    else
+        fun_l1_n638(x)
+    end
+end
+
+def fun_l0_n988(x)
+    if (x < 1)
+        fun_l1_n615(x)
+    else
+        fun_l1_n283(x)
+    end
+end
+
+def fun_l0_n989(x)
+    if (x < 1)
+        fun_l1_n410(x)
+    else
+        fun_l1_n289(x)
+    end
+end
+
+def fun_l0_n990(x)
+    if (x < 1)
+        fun_l1_n633(x)
+    else
+        fun_l1_n77(x)
+    end
+end
+
+def fun_l0_n991(x)
+    if (x < 1)
+        fun_l1_n153(x)
+    else
+        fun_l1_n255(x)
+    end
+end
+
+def fun_l0_n992(x)
+    if (x < 1)
+        fun_l1_n447(x)
+    else
+        fun_l1_n239(x)
+    end
+end
+
+def fun_l0_n993(x)
+    if (x < 1)
+        fun_l1_n837(x)
+    else
+        fun_l1_n582(x)
+    end
+end
+
+def fun_l0_n994(x)
+    if (x < 1)
+        fun_l1_n385(x)
+    else
+        fun_l1_n939(x)
+    end
+end
+
+def fun_l0_n995(x)
+    if (x < 1)
+        fun_l1_n236(x)
+    else
+        fun_l1_n497(x)
+    end
+end
+
+def fun_l0_n996(x)
+    if (x < 1)
+        fun_l1_n63(x)
+    else
+        fun_l1_n721(x)
+    end
+end
+
+def fun_l0_n997(x)
+    if (x < 1)
+        fun_l1_n457(x)
+    else
+        fun_l1_n376(x)
+    end
+end
+
+def fun_l0_n998(x)
+    if (x < 1)
+        fun_l1_n362(x)
+    else
+        fun_l1_n478(x)
+    end
+end
+
+def fun_l0_n999(x)
+    if (x < 1)
+        fun_l1_n554(x)
+    else
+        fun_l1_n422(x)
+    end
+end
+
+def fun_l1_n0(x)
+    if (x < 1)
+        fun_l2_n498(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n1(x)
+    if (x < 1)
+        fun_l2_n424(x)
+    else
+        fun_l2_n137(x)
+    end
+end
+
+def fun_l1_n2(x)
+    if (x < 1)
+        fun_l2_n325(x)
+    else
+        fun_l2_n95(x)
+    end
+end
+
+def fun_l1_n3(x)
+    if (x < 1)
+        fun_l2_n917(x)
+    else
+        fun_l2_n469(x)
+    end
+end
+
+def fun_l1_n4(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n147(x)
+    end
+end
+
+def fun_l1_n5(x)
+    if (x < 1)
+        fun_l2_n796(x)
+    else
+        fun_l2_n907(x)
+    end
+end
+
+def fun_l1_n6(x)
+    if (x < 1)
+        fun_l2_n555(x)
+    else
+        fun_l2_n309(x)
+    end
+end
+
+def fun_l1_n7(x)
+    if (x < 1)
+        fun_l2_n475(x)
+    else
+        fun_l2_n193(x)
+    end
+end
+
+def fun_l1_n8(x)
+    if (x < 1)
+        fun_l2_n317(x)
+    else
+        fun_l2_n284(x)
+    end
+end
+
+def fun_l1_n9(x)
+    if (x < 1)
+        fun_l2_n297(x)
+    else
+        fun_l2_n370(x)
+    end
+end
+
+def fun_l1_n10(x)
+    if (x < 1)
+        fun_l2_n66(x)
+    else
+        fun_l2_n959(x)
+    end
+end
+
+def fun_l1_n11(x)
+    if (x < 1)
+        fun_l2_n833(x)
+    else
+        fun_l2_n250(x)
+    end
+end
+
+def fun_l1_n12(x)
+    if (x < 1)
+        fun_l2_n640(x)
+    else
+        fun_l2_n588(x)
+    end
+end
+
+def fun_l1_n13(x)
+    if (x < 1)
+        fun_l2_n91(x)
+    else
+        fun_l2_n294(x)
+    end
+end
+
+def fun_l1_n14(x)
+    if (x < 1)
+        fun_l2_n166(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n15(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n363(x)
+    end
+end
+
+def fun_l1_n16(x)
+    if (x < 1)
+        fun_l2_n84(x)
+    else
+        fun_l2_n278(x)
+    end
+end
+
+def fun_l1_n17(x)
+    if (x < 1)
+        fun_l2_n308(x)
+    else
+        fun_l2_n341(x)
+    end
+end
+
+def fun_l1_n18(x)
+    if (x < 1)
+        fun_l2_n713(x)
+    else
+        fun_l2_n575(x)
+    end
+end
+
+def fun_l1_n19(x)
+    if (x < 1)
+        fun_l2_n81(x)
+    else
+        fun_l2_n301(x)
+    end
+end
+
+def fun_l1_n20(x)
+    if (x < 1)
+        fun_l2_n516(x)
+    else
+        fun_l2_n164(x)
+    end
+end
+
+def fun_l1_n21(x)
+    if (x < 1)
+        fun_l2_n900(x)
+    else
+        fun_l2_n963(x)
+    end
+end
+
+def fun_l1_n22(x)
+    if (x < 1)
+        fun_l2_n472(x)
+    else
+        fun_l2_n288(x)
+    end
+end
+
+def fun_l1_n23(x)
+    if (x < 1)
+        fun_l2_n587(x)
+    else
+        fun_l2_n515(x)
+    end
+end
+
+def fun_l1_n24(x)
+    if (x < 1)
+        fun_l2_n506(x)
+    else
+        fun_l2_n711(x)
+    end
+end
+
+def fun_l1_n25(x)
+    if (x < 1)
+        fun_l2_n935(x)
+    else
+        fun_l2_n177(x)
+    end
+end
+
+def fun_l1_n26(x)
+    if (x < 1)
+        fun_l2_n485(x)
+    else
+        fun_l2_n368(x)
+    end
+end
+
+def fun_l1_n27(x)
+    if (x < 1)
+        fun_l2_n984(x)
+    else
+        fun_l2_n290(x)
+    end
+end
+
+def fun_l1_n28(x)
+    if (x < 1)
+        fun_l2_n36(x)
+    else
+        fun_l2_n837(x)
+    end
+end
+
+def fun_l1_n29(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n311(x)
+    end
+end
+
+def fun_l1_n30(x)
+    if (x < 1)
+        fun_l2_n215(x)
+    else
+        fun_l2_n376(x)
+    end
+end
+
+def fun_l1_n31(x)
+    if (x < 1)
+        fun_l2_n533(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n32(x)
+    if (x < 1)
+        fun_l2_n386(x)
+    else
+        fun_l2_n283(x)
+    end
+end
+
+def fun_l1_n33(x)
+    if (x < 1)
+        fun_l2_n268(x)
+    else
+        fun_l2_n256(x)
+    end
+end
+
+def fun_l1_n34(x)
+    if (x < 1)
+        fun_l2_n348(x)
+    else
+        fun_l2_n464(x)
+    end
+end
+
+def fun_l1_n35(x)
+    if (x < 1)
+        fun_l2_n25(x)
+    else
+        fun_l2_n33(x)
+    end
+end
+
+def fun_l1_n36(x)
+    if (x < 1)
+        fun_l2_n387(x)
+    else
+        fun_l2_n341(x)
+    end
+end
+
+def fun_l1_n37(x)
+    if (x < 1)
+        fun_l2_n580(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n38(x)
+    if (x < 1)
+        fun_l2_n33(x)
+    else
+        fun_l2_n33(x)
+    end
+end
+
+def fun_l1_n39(x)
+    if (x < 1)
+        fun_l2_n861(x)
+    else
+        fun_l2_n52(x)
+    end
+end
+
+def fun_l1_n40(x)
+    if (x < 1)
+        fun_l2_n740(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n41(x)
+    if (x < 1)
+        fun_l2_n956(x)
+    else
+        fun_l2_n159(x)
+    end
+end
+
+def fun_l1_n42(x)
+    if (x < 1)
+        fun_l2_n445(x)
+    else
+        fun_l2_n775(x)
+    end
+end
+
+def fun_l1_n43(x)
+    if (x < 1)
+        fun_l2_n667(x)
+    else
+        fun_l2_n282(x)
+    end
+end
+
+def fun_l1_n44(x)
+    if (x < 1)
+        fun_l2_n185(x)
+    else
+        fun_l2_n210(x)
+    end
+end
+
+def fun_l1_n45(x)
+    if (x < 1)
+        fun_l2_n490(x)
+    else
+        fun_l2_n21(x)
+    end
+end
+
+def fun_l1_n46(x)
+    if (x < 1)
+        fun_l2_n751(x)
+    else
+        fun_l2_n639(x)
+    end
+end
+
+def fun_l1_n47(x)
+    if (x < 1)
+        fun_l2_n431(x)
+    else
+        fun_l2_n917(x)
+    end
+end
+
+def fun_l1_n48(x)
+    if (x < 1)
+        fun_l2_n187(x)
+    else
+        fun_l2_n170(x)
+    end
+end
+
+def fun_l1_n49(x)
+    if (x < 1)
+        fun_l2_n780(x)
+    else
+        fun_l2_n77(x)
+    end
+end
+
+def fun_l1_n50(x)
+    if (x < 1)
+        fun_l2_n546(x)
+    else
+        fun_l2_n759(x)
+    end
+end
+
+def fun_l1_n51(x)
+    if (x < 1)
+        fun_l2_n453(x)
+    else
+        fun_l2_n951(x)
+    end
+end
+
+def fun_l1_n52(x)
+    if (x < 1)
+        fun_l2_n989(x)
+    else
+        fun_l2_n716(x)
+    end
+end
+
+def fun_l1_n53(x)
+    if (x < 1)
+        fun_l2_n652(x)
+    else
+        fun_l2_n36(x)
+    end
+end
+
+def fun_l1_n54(x)
+    if (x < 1)
+        fun_l2_n187(x)
+    else
+        fun_l2_n760(x)
+    end
+end
+
+def fun_l1_n55(x)
+    if (x < 1)
+        fun_l2_n706(x)
+    else
+        fun_l2_n927(x)
+    end
+end
+
+def fun_l1_n56(x)
+    if (x < 1)
+        fun_l2_n666(x)
+    else
+        fun_l2_n295(x)
+    end
+end
+
+def fun_l1_n57(x)
+    if (x < 1)
+        fun_l2_n424(x)
+    else
+        fun_l2_n447(x)
+    end
+end
+
+def fun_l1_n58(x)
+    if (x < 1)
+        fun_l2_n408(x)
+    else
+        fun_l2_n337(x)
+    end
+end
+
+def fun_l1_n59(x)
+    if (x < 1)
+        fun_l2_n567(x)
+    else
+        fun_l2_n765(x)
+    end
+end
+
+def fun_l1_n60(x)
+    if (x < 1)
+        fun_l2_n241(x)
+    else
+        fun_l2_n701(x)
+    end
+end
+
+def fun_l1_n61(x)
+    if (x < 1)
+        fun_l2_n831(x)
+    else
+        fun_l2_n382(x)
+    end
+end
+
+def fun_l1_n62(x)
+    if (x < 1)
+        fun_l2_n634(x)
+    else
+        fun_l2_n908(x)
+    end
+end
+
+def fun_l1_n63(x)
+    if (x < 1)
+        fun_l2_n696(x)
+    else
+        fun_l2_n48(x)
+    end
+end
+
+def fun_l1_n64(x)
+    if (x < 1)
+        fun_l2_n528(x)
+    else
+        fun_l2_n110(x)
+    end
+end
+
+def fun_l1_n65(x)
+    if (x < 1)
+        fun_l2_n767(x)
+    else
+        fun_l2_n973(x)
+    end
+end
+
+def fun_l1_n66(x)
+    if (x < 1)
+        fun_l2_n963(x)
+    else
+        fun_l2_n673(x)
+    end
+end
+
+def fun_l1_n67(x)
+    if (x < 1)
+        fun_l2_n927(x)
+    else
+        fun_l2_n309(x)
+    end
+end
+
+def fun_l1_n68(x)
+    if (x < 1)
+        fun_l2_n851(x)
+    else
+        fun_l2_n160(x)
+    end
+end
+
+def fun_l1_n69(x)
+    if (x < 1)
+        fun_l2_n575(x)
+    else
+        fun_l2_n800(x)
+    end
+end
+
+def fun_l1_n70(x)
+    if (x < 1)
+        fun_l2_n396(x)
+    else
+        fun_l2_n382(x)
+    end
+end
+
+def fun_l1_n71(x)
+    if (x < 1)
+        fun_l2_n508(x)
+    else
+        fun_l2_n763(x)
+    end
+end
+
+def fun_l1_n72(x)
+    if (x < 1)
+        fun_l2_n360(x)
+    else
+        fun_l2_n848(x)
+    end
+end
+
+def fun_l1_n73(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n83(x)
+    end
+end
+
+def fun_l1_n74(x)
+    if (x < 1)
+        fun_l2_n573(x)
+    else
+        fun_l2_n284(x)
+    end
+end
+
+def fun_l1_n75(x)
+    if (x < 1)
+        fun_l2_n999(x)
+    else
+        fun_l2_n954(x)
+    end
+end
+
+def fun_l1_n76(x)
+    if (x < 1)
+        fun_l2_n182(x)
+    else
+        fun_l2_n997(x)
+    end
+end
+
+def fun_l1_n77(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n409(x)
+    end
+end
+
+def fun_l1_n78(x)
+    if (x < 1)
+        fun_l2_n163(x)
+    else
+        fun_l2_n417(x)
+    end
+end
+
+def fun_l1_n79(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n688(x)
+    end
+end
+
+def fun_l1_n80(x)
+    if (x < 1)
+        fun_l2_n699(x)
+    else
+        fun_l2_n356(x)
+    end
+end
+
+def fun_l1_n81(x)
+    if (x < 1)
+        fun_l2_n44(x)
+    else
+        fun_l2_n302(x)
+    end
+end
+
+def fun_l1_n82(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n892(x)
+    end
+end
+
+def fun_l1_n83(x)
+    if (x < 1)
+        fun_l2_n494(x)
+    else
+        fun_l2_n547(x)
+    end
+end
+
+def fun_l1_n84(x)
+    if (x < 1)
+        fun_l2_n631(x)
+    else
+        fun_l2_n922(x)
+    end
+end
+
+def fun_l1_n85(x)
+    if (x < 1)
+        fun_l2_n797(x)
+    else
+        fun_l2_n874(x)
+    end
+end
+
+def fun_l1_n86(x)
+    if (x < 1)
+        fun_l2_n209(x)
+    else
+        fun_l2_n365(x)
+    end
+end
+
+def fun_l1_n87(x)
+    if (x < 1)
+        fun_l2_n516(x)
+    else
+        fun_l2_n371(x)
+    end
+end
+
+def fun_l1_n88(x)
+    if (x < 1)
+        fun_l2_n654(x)
+    else
+        fun_l2_n88(x)
+    end
+end
+
+def fun_l1_n89(x)
+    if (x < 1)
+        fun_l2_n70(x)
+    else
+        fun_l2_n521(x)
+    end
+end
+
+def fun_l1_n90(x)
+    if (x < 1)
+        fun_l2_n666(x)
+    else
+        fun_l2_n749(x)
+    end
+end
+
+def fun_l1_n91(x)
+    if (x < 1)
+        fun_l2_n504(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n92(x)
+    if (x < 1)
+        fun_l2_n734(x)
+    else
+        fun_l2_n277(x)
+    end
+end
+
+def fun_l1_n93(x)
+    if (x < 1)
+        fun_l2_n300(x)
+    else
+        fun_l2_n826(x)
+    end
+end
+
+def fun_l1_n94(x)
+    if (x < 1)
+        fun_l2_n733(x)
+    else
+        fun_l2_n560(x)
+    end
+end
+
+def fun_l1_n95(x)
+    if (x < 1)
+        fun_l2_n834(x)
+    else
+        fun_l2_n644(x)
+    end
+end
+
+def fun_l1_n96(x)
+    if (x < 1)
+        fun_l2_n183(x)
+    else
+        fun_l2_n238(x)
+    end
+end
+
+def fun_l1_n97(x)
+    if (x < 1)
+        fun_l2_n372(x)
+    else
+        fun_l2_n753(x)
+    end
+end
+
+def fun_l1_n98(x)
+    if (x < 1)
+        fun_l2_n208(x)
+    else
+        fun_l2_n543(x)
+    end
+end
+
+def fun_l1_n99(x)
+    if (x < 1)
+        fun_l2_n38(x)
+    else
+        fun_l2_n974(x)
+    end
+end
+
+def fun_l1_n100(x)
+    if (x < 1)
+        fun_l2_n620(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n101(x)
+    if (x < 1)
+        fun_l2_n248(x)
+    else
+        fun_l2_n189(x)
+    end
+end
+
+def fun_l1_n102(x)
+    if (x < 1)
+        fun_l2_n489(x)
+    else
+        fun_l2_n390(x)
+    end
+end
+
+def fun_l1_n103(x)
+    if (x < 1)
+        fun_l2_n452(x)
+    else
+        fun_l2_n22(x)
+    end
+end
+
+def fun_l1_n104(x)
+    if (x < 1)
+        fun_l2_n542(x)
+    else
+        fun_l2_n135(x)
+    end
+end
+
+def fun_l1_n105(x)
+    if (x < 1)
+        fun_l2_n988(x)
+    else
+        fun_l2_n118(x)
+    end
+end
+
+def fun_l1_n106(x)
+    if (x < 1)
+        fun_l2_n817(x)
+    else
+        fun_l2_n534(x)
+    end
+end
+
+def fun_l1_n107(x)
+    if (x < 1)
+        fun_l2_n812(x)
+    else
+        fun_l2_n206(x)
+    end
+end
+
+def fun_l1_n108(x)
+    if (x < 1)
+        fun_l2_n514(x)
+    else
+        fun_l2_n300(x)
+    end
+end
+
+def fun_l1_n109(x)
+    if (x < 1)
+        fun_l2_n482(x)
+    else
+        fun_l2_n376(x)
+    end
+end
+
+def fun_l1_n110(x)
+    if (x < 1)
+        fun_l2_n571(x)
+    else
+        fun_l2_n758(x)
+    end
+end
+
+def fun_l1_n111(x)
+    if (x < 1)
+        fun_l2_n971(x)
+    else
+        fun_l2_n811(x)
+    end
+end
+
+def fun_l1_n112(x)
+    if (x < 1)
+        fun_l2_n23(x)
+    else
+        fun_l2_n844(x)
+    end
+end
+
+def fun_l1_n113(x)
+    if (x < 1)
+        fun_l2_n865(x)
+    else
+        fun_l2_n149(x)
+    end
+end
+
+def fun_l1_n114(x)
+    if (x < 1)
+        fun_l2_n930(x)
+    else
+        fun_l2_n327(x)
+    end
+end
+
+def fun_l1_n115(x)
+    if (x < 1)
+        fun_l2_n67(x)
+    else
+        fun_l2_n442(x)
+    end
+end
+
+def fun_l1_n116(x)
+    if (x < 1)
+        fun_l2_n278(x)
+    else
+        fun_l2_n653(x)
+    end
+end
+
+def fun_l1_n117(x)
+    if (x < 1)
+        fun_l2_n457(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n118(x)
+    if (x < 1)
+        fun_l2_n384(x)
+    else
+        fun_l2_n594(x)
+    end
+end
+
+def fun_l1_n119(x)
+    if (x < 1)
+        fun_l2_n361(x)
+    else
+        fun_l2_n770(x)
+    end
+end
+
+def fun_l1_n120(x)
+    if (x < 1)
+        fun_l2_n24(x)
+    else
+        fun_l2_n269(x)
+    end
+end
+
+def fun_l1_n121(x)
+    if (x < 1)
+        fun_l2_n57(x)
+    else
+        fun_l2_n2(x)
+    end
+end
+
+def fun_l1_n122(x)
+    if (x < 1)
+        fun_l2_n421(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n123(x)
+    if (x < 1)
+        fun_l2_n623(x)
+    else
+        fun_l2_n985(x)
+    end
+end
+
+def fun_l1_n124(x)
+    if (x < 1)
+        fun_l2_n609(x)
+    else
+        fun_l2_n530(x)
+    end
+end
+
+def fun_l1_n125(x)
+    if (x < 1)
+        fun_l2_n565(x)
+    else
+        fun_l2_n155(x)
+    end
+end
+
+def fun_l1_n126(x)
+    if (x < 1)
+        fun_l2_n135(x)
+    else
+        fun_l2_n971(x)
+    end
+end
+
+def fun_l1_n127(x)
+    if (x < 1)
+        fun_l2_n691(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n128(x)
+    if (x < 1)
+        fun_l2_n555(x)
+    else
+        fun_l2_n67(x)
+    end
+end
+
+def fun_l1_n129(x)
+    if (x < 1)
+        fun_l2_n95(x)
+    else
+        fun_l2_n192(x)
+    end
+end
+
+def fun_l1_n130(x)
+    if (x < 1)
+        fun_l2_n432(x)
+    else
+        fun_l2_n771(x)
+    end
+end
+
+def fun_l1_n131(x)
+    if (x < 1)
+        fun_l2_n993(x)
+    else
+        fun_l2_n539(x)
+    end
+end
+
+def fun_l1_n132(x)
+    if (x < 1)
+        fun_l2_n809(x)
+    else
+        fun_l2_n902(x)
+    end
+end
+
+def fun_l1_n133(x)
+    if (x < 1)
+        fun_l2_n95(x)
+    else
+        fun_l2_n928(x)
+    end
+end
+
+def fun_l1_n134(x)
+    if (x < 1)
+        fun_l2_n781(x)
+    else
+        fun_l2_n832(x)
+    end
+end
+
+def fun_l1_n135(x)
+    if (x < 1)
+        fun_l2_n231(x)
+    else
+        fun_l2_n392(x)
+    end
+end
+
+def fun_l1_n136(x)
+    if (x < 1)
+        fun_l2_n102(x)
+    else
+        fun_l2_n449(x)
+    end
+end
+
+def fun_l1_n137(x)
+    if (x < 1)
+        fun_l2_n196(x)
+    else
+        fun_l2_n909(x)
+    end
+end
+
+def fun_l1_n138(x)
+    if (x < 1)
+        fun_l2_n449(x)
+    else
+        fun_l2_n190(x)
+    end
+end
+
+def fun_l1_n139(x)
+    if (x < 1)
+        fun_l2_n638(x)
+    else
+        fun_l2_n149(x)
+    end
+end
+
+def fun_l1_n140(x)
+    if (x < 1)
+        fun_l2_n523(x)
+    else
+        fun_l2_n297(x)
+    end
+end
+
+def fun_l1_n141(x)
+    if (x < 1)
+        fun_l2_n476(x)
+    else
+        fun_l2_n161(x)
+    end
+end
+
+def fun_l1_n142(x)
+    if (x < 1)
+        fun_l2_n893(x)
+    else
+        fun_l2_n686(x)
+    end
+end
+
+def fun_l1_n143(x)
+    if (x < 1)
+        fun_l2_n958(x)
+    else
+        fun_l2_n899(x)
+    end
+end
+
+def fun_l1_n144(x)
+    if (x < 1)
+        fun_l2_n104(x)
+    else
+        fun_l2_n912(x)
+    end
+end
+
+def fun_l1_n145(x)
+    if (x < 1)
+        fun_l2_n332(x)
+    else
+        fun_l2_n579(x)
+    end
+end
+
+def fun_l1_n146(x)
+    if (x < 1)
+        fun_l2_n40(x)
+    else
+        fun_l2_n468(x)
+    end
+end
+
+def fun_l1_n147(x)
+    if (x < 1)
+        fun_l2_n771(x)
+    else
+        fun_l2_n314(x)
+    end
+end
+
+def fun_l1_n148(x)
+    if (x < 1)
+        fun_l2_n340(x)
+    else
+        fun_l2_n203(x)
+    end
+end
+
+def fun_l1_n149(x)
+    if (x < 1)
+        fun_l2_n952(x)
+    else
+        fun_l2_n265(x)
+    end
+end
+
+def fun_l1_n150(x)
+    if (x < 1)
+        fun_l2_n11(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n151(x)
+    if (x < 1)
+        fun_l2_n394(x)
+    else
+        fun_l2_n317(x)
+    end
+end
+
+def fun_l1_n152(x)
+    if (x < 1)
+        fun_l2_n140(x)
+    else
+        fun_l2_n906(x)
+    end
+end
+
+def fun_l1_n153(x)
+    if (x < 1)
+        fun_l2_n75(x)
+    else
+        fun_l2_n485(x)
+    end
+end
+
+def fun_l1_n154(x)
+    if (x < 1)
+        fun_l2_n842(x)
+    else
+        fun_l2_n370(x)
+    end
+end
+
+def fun_l1_n155(x)
+    if (x < 1)
+        fun_l2_n346(x)
+    else
+        fun_l2_n833(x)
+    end
+end
+
+def fun_l1_n156(x)
+    if (x < 1)
+        fun_l2_n433(x)
+    else
+        fun_l2_n373(x)
+    end
+end
+
+def fun_l1_n157(x)
+    if (x < 1)
+        fun_l2_n978(x)
+    else
+        fun_l2_n99(x)
+    end
+end
+
+def fun_l1_n158(x)
+    if (x < 1)
+        fun_l2_n540(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n159(x)
+    if (x < 1)
+        fun_l2_n785(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n160(x)
+    if (x < 1)
+        fun_l2_n282(x)
+    else
+        fun_l2_n222(x)
+    end
+end
+
+def fun_l1_n161(x)
+    if (x < 1)
+        fun_l2_n29(x)
+    else
+        fun_l2_n946(x)
+    end
+end
+
+def fun_l1_n162(x)
+    if (x < 1)
+        fun_l2_n314(x)
+    else
+        fun_l2_n758(x)
+    end
+end
+
+def fun_l1_n163(x)
+    if (x < 1)
+        fun_l2_n861(x)
+    else
+        fun_l2_n799(x)
+    end
+end
+
+def fun_l1_n164(x)
+    if (x < 1)
+        fun_l2_n403(x)
+    else
+        fun_l2_n413(x)
+    end
+end
+
+def fun_l1_n165(x)
+    if (x < 1)
+        fun_l2_n160(x)
+    else
+        fun_l2_n794(x)
+    end
+end
+
+def fun_l1_n166(x)
+    if (x < 1)
+        fun_l2_n114(x)
+    else
+        fun_l2_n238(x)
+    end
+end
+
+def fun_l1_n167(x)
+    if (x < 1)
+        fun_l2_n806(x)
+    else
+        fun_l2_n233(x)
+    end
+end
+
+def fun_l1_n168(x)
+    if (x < 1)
+        fun_l2_n871(x)
+    else
+        fun_l2_n53(x)
+    end
+end
+
+def fun_l1_n169(x)
+    if (x < 1)
+        fun_l2_n644(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n170(x)
+    if (x < 1)
+        fun_l2_n172(x)
+    else
+        fun_l2_n289(x)
+    end
+end
+
+def fun_l1_n171(x)
+    if (x < 1)
+        fun_l2_n920(x)
+    else
+        fun_l2_n851(x)
+    end
+end
+
+def fun_l1_n172(x)
+    if (x < 1)
+        fun_l2_n552(x)
+    else
+        fun_l2_n822(x)
+    end
+end
+
+def fun_l1_n173(x)
+    if (x < 1)
+        fun_l2_n747(x)
+    else
+        fun_l2_n265(x)
+    end
+end
+
+def fun_l1_n174(x)
+    if (x < 1)
+        fun_l2_n287(x)
+    else
+        fun_l2_n762(x)
+    end
+end
+
+def fun_l1_n175(x)
+    if (x < 1)
+        fun_l2_n627(x)
+    else
+        fun_l2_n951(x)
+    end
+end
+
+def fun_l1_n176(x)
+    if (x < 1)
+        fun_l2_n459(x)
+    else
+        fun_l2_n962(x)
+    end
+end
+
+def fun_l1_n177(x)
+    if (x < 1)
+        fun_l2_n214(x)
+    else
+        fun_l2_n145(x)
+    end
+end
+
+def fun_l1_n178(x)
+    if (x < 1)
+        fun_l2_n620(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n179(x)
+    if (x < 1)
+        fun_l2_n136(x)
+    else
+        fun_l2_n283(x)
+    end
+end
+
+def fun_l1_n180(x)
+    if (x < 1)
+        fun_l2_n377(x)
+    else
+        fun_l2_n672(x)
+    end
+end
+
+def fun_l1_n181(x)
+    if (x < 1)
+        fun_l2_n218(x)
+    else
+        fun_l2_n434(x)
+    end
+end
+
+def fun_l1_n182(x)
+    if (x < 1)
+        fun_l2_n522(x)
+    else
+        fun_l2_n525(x)
+    end
+end
+
+def fun_l1_n183(x)
+    if (x < 1)
+        fun_l2_n648(x)
+    else
+        fun_l2_n725(x)
+    end
+end
+
+def fun_l1_n184(x)
+    if (x < 1)
+        fun_l2_n579(x)
+    else
+        fun_l2_n974(x)
+    end
+end
+
+def fun_l1_n185(x)
+    if (x < 1)
+        fun_l2_n10(x)
+    else
+        fun_l2_n514(x)
+    end
+end
+
+def fun_l1_n186(x)
+    if (x < 1)
+        fun_l2_n829(x)
+    else
+        fun_l2_n754(x)
+    end
+end
+
+def fun_l1_n187(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n401(x)
+    end
+end
+
+def fun_l1_n188(x)
+    if (x < 1)
+        fun_l2_n839(x)
+    else
+        fun_l2_n453(x)
+    end
+end
+
+def fun_l1_n189(x)
+    if (x < 1)
+        fun_l2_n553(x)
+    else
+        fun_l2_n553(x)
+    end
+end
+
+def fun_l1_n190(x)
+    if (x < 1)
+        fun_l2_n972(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n191(x)
+    if (x < 1)
+        fun_l2_n275(x)
+    else
+        fun_l2_n11(x)
+    end
+end
+
+def fun_l1_n192(x)
+    if (x < 1)
+        fun_l2_n1(x)
+    else
+        fun_l2_n927(x)
+    end
+end
+
+def fun_l1_n193(x)
+    if (x < 1)
+        fun_l2_n569(x)
+    else
+        fun_l2_n557(x)
+    end
+end
+
+def fun_l1_n194(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n195(x)
+    if (x < 1)
+        fun_l2_n297(x)
+    else
+        fun_l2_n813(x)
+    end
+end
+
+def fun_l1_n196(x)
+    if (x < 1)
+        fun_l2_n565(x)
+    else
+        fun_l2_n514(x)
+    end
+end
+
+def fun_l1_n197(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n64(x)
+    end
+end
+
+def fun_l1_n198(x)
+    if (x < 1)
+        fun_l2_n182(x)
+    else
+        fun_l2_n363(x)
+    end
+end
+
+def fun_l1_n199(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n506(x)
+    end
+end
+
+def fun_l1_n200(x)
+    if (x < 1)
+        fun_l2_n834(x)
+    else
+        fun_l2_n348(x)
+    end
+end
+
+def fun_l1_n201(x)
+    if (x < 1)
+        fun_l2_n403(x)
+    else
+        fun_l2_n432(x)
+    end
+end
+
+def fun_l1_n202(x)
+    if (x < 1)
+        fun_l2_n115(x)
+    else
+        fun_l2_n145(x)
+    end
+end
+
+def fun_l1_n203(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n4(x)
+    end
+end
+
+def fun_l1_n204(x)
+    if (x < 1)
+        fun_l2_n951(x)
+    else
+        fun_l2_n753(x)
+    end
+end
+
+def fun_l1_n205(x)
+    if (x < 1)
+        fun_l2_n703(x)
+    else
+        fun_l2_n563(x)
+    end
+end
+
+def fun_l1_n206(x)
+    if (x < 1)
+        fun_l2_n614(x)
+    else
+        fun_l2_n563(x)
+    end
+end
+
+def fun_l1_n207(x)
+    if (x < 1)
+        fun_l2_n210(x)
+    else
+        fun_l2_n139(x)
+    end
+end
+
+def fun_l1_n208(x)
+    if (x < 1)
+        fun_l2_n471(x)
+    else
+        fun_l2_n346(x)
+    end
+end
+
+def fun_l1_n209(x)
+    if (x < 1)
+        fun_l2_n922(x)
+    else
+        fun_l2_n54(x)
+    end
+end
+
+def fun_l1_n210(x)
+    if (x < 1)
+        fun_l2_n494(x)
+    else
+        fun_l2_n41(x)
+    end
+end
+
+def fun_l1_n211(x)
+    if (x < 1)
+        fun_l2_n87(x)
+    else
+        fun_l2_n190(x)
+    end
+end
+
+def fun_l1_n212(x)
+    if (x < 1)
+        fun_l2_n458(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n213(x)
+    if (x < 1)
+        fun_l2_n48(x)
+    else
+        fun_l2_n225(x)
+    end
+end
+
+def fun_l1_n214(x)
+    if (x < 1)
+        fun_l2_n706(x)
+    else
+        fun_l2_n694(x)
+    end
+end
+
+def fun_l1_n215(x)
+    if (x < 1)
+        fun_l2_n116(x)
+    else
+        fun_l2_n233(x)
+    end
+end
+
+def fun_l1_n216(x)
+    if (x < 1)
+        fun_l2_n279(x)
+    else
+        fun_l2_n857(x)
+    end
+end
+
+def fun_l1_n217(x)
+    if (x < 1)
+        fun_l2_n643(x)
+    else
+        fun_l2_n289(x)
+    end
+end
+
+def fun_l1_n218(x)
+    if (x < 1)
+        fun_l2_n535(x)
+    else
+        fun_l2_n833(x)
+    end
+end
+
+def fun_l1_n219(x)
+    if (x < 1)
+        fun_l2_n478(x)
+    else
+        fun_l2_n793(x)
+    end
+end
+
+def fun_l1_n220(x)
+    if (x < 1)
+        fun_l2_n57(x)
+    else
+        fun_l2_n64(x)
+    end
+end
+
+def fun_l1_n221(x)
+    if (x < 1)
+        fun_l2_n36(x)
+    else
+        fun_l2_n74(x)
+    end
+end
+
+def fun_l1_n222(x)
+    if (x < 1)
+        fun_l2_n438(x)
+    else
+        fun_l2_n616(x)
+    end
+end
+
+def fun_l1_n223(x)
+    if (x < 1)
+        fun_l2_n900(x)
+    else
+        fun_l2_n744(x)
+    end
+end
+
+def fun_l1_n224(x)
+    if (x < 1)
+        fun_l2_n780(x)
+    else
+        fun_l2_n213(x)
+    end
+end
+
+def fun_l1_n225(x)
+    if (x < 1)
+        fun_l2_n916(x)
+    else
+        fun_l2_n471(x)
+    end
+end
+
+def fun_l1_n226(x)
+    if (x < 1)
+        fun_l2_n236(x)
+    else
+        fun_l2_n980(x)
+    end
+end
+
+def fun_l1_n227(x)
+    if (x < 1)
+        fun_l2_n28(x)
+    else
+        fun_l2_n291(x)
+    end
+end
+
+def fun_l1_n228(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n353(x)
+    end
+end
+
+def fun_l1_n229(x)
+    if (x < 1)
+        fun_l2_n404(x)
+    else
+        fun_l2_n254(x)
+    end
+end
+
+def fun_l1_n230(x)
+    if (x < 1)
+        fun_l2_n641(x)
+    else
+        fun_l2_n464(x)
+    end
+end
+
+def fun_l1_n231(x)
+    if (x < 1)
+        fun_l2_n592(x)
+    else
+        fun_l2_n646(x)
+    end
+end
+
+def fun_l1_n232(x)
+    if (x < 1)
+        fun_l2_n162(x)
+    else
+        fun_l2_n215(x)
+    end
+end
+
+def fun_l1_n233(x)
+    if (x < 1)
+        fun_l2_n219(x)
+    else
+        fun_l2_n772(x)
+    end
+end
+
+def fun_l1_n234(x)
+    if (x < 1)
+        fun_l2_n304(x)
+    else
+        fun_l2_n963(x)
+    end
+end
+
+def fun_l1_n235(x)
+    if (x < 1)
+        fun_l2_n610(x)
+    else
+        fun_l2_n716(x)
+    end
+end
+
+def fun_l1_n236(x)
+    if (x < 1)
+        fun_l2_n151(x)
+    else
+        fun_l2_n498(x)
+    end
+end
+
+def fun_l1_n237(x)
+    if (x < 1)
+        fun_l2_n288(x)
+    else
+        fun_l2_n261(x)
+    end
+end
+
+def fun_l1_n238(x)
+    if (x < 1)
+        fun_l2_n139(x)
+    else
+        fun_l2_n18(x)
+    end
+end
+
+def fun_l1_n239(x)
+    if (x < 1)
+        fun_l2_n559(x)
+    else
+        fun_l2_n148(x)
+    end
+end
+
+def fun_l1_n240(x)
+    if (x < 1)
+        fun_l2_n520(x)
+    else
+        fun_l2_n250(x)
+    end
+end
+
+def fun_l1_n241(x)
+    if (x < 1)
+        fun_l2_n42(x)
+    else
+        fun_l2_n196(x)
+    end
+end
+
+def fun_l1_n242(x)
+    if (x < 1)
+        fun_l2_n16(x)
+    else
+        fun_l2_n540(x)
+    end
+end
+
+def fun_l1_n243(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n890(x)
+    end
+end
+
+def fun_l1_n244(x)
+    if (x < 1)
+        fun_l2_n559(x)
+    else
+        fun_l2_n423(x)
+    end
+end
+
+def fun_l1_n245(x)
+    if (x < 1)
+        fun_l2_n110(x)
+    else
+        fun_l2_n711(x)
+    end
+end
+
+def fun_l1_n246(x)
+    if (x < 1)
+        fun_l2_n151(x)
+    else
+        fun_l2_n407(x)
+    end
+end
+
+def fun_l1_n247(x)
+    if (x < 1)
+        fun_l2_n118(x)
+    else
+        fun_l2_n209(x)
+    end
+end
+
+def fun_l1_n248(x)
+    if (x < 1)
+        fun_l2_n764(x)
+    else
+        fun_l2_n932(x)
+    end
+end
+
+def fun_l1_n249(x)
+    if (x < 1)
+        fun_l2_n991(x)
+    else
+        fun_l2_n828(x)
+    end
+end
+
+def fun_l1_n250(x)
+    if (x < 1)
+        fun_l2_n354(x)
+    else
+        fun_l2_n53(x)
+    end
+end
+
+def fun_l1_n251(x)
+    if (x < 1)
+        fun_l2_n63(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n252(x)
+    if (x < 1)
+        fun_l2_n874(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n253(x)
+    if (x < 1)
+        fun_l2_n336(x)
+    else
+        fun_l2_n57(x)
+    end
+end
+
+def fun_l1_n254(x)
+    if (x < 1)
+        fun_l2_n302(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n255(x)
+    if (x < 1)
+        fun_l2_n122(x)
+    else
+        fun_l2_n888(x)
+    end
+end
+
+def fun_l1_n256(x)
+    if (x < 1)
+        fun_l2_n326(x)
+    else
+        fun_l2_n616(x)
+    end
+end
+
+def fun_l1_n257(x)
+    if (x < 1)
+        fun_l2_n77(x)
+    else
+        fun_l2_n622(x)
+    end
+end
+
+def fun_l1_n258(x)
+    if (x < 1)
+        fun_l2_n785(x)
+    else
+        fun_l2_n229(x)
+    end
+end
+
+def fun_l1_n259(x)
+    if (x < 1)
+        fun_l2_n504(x)
+    else
+        fun_l2_n766(x)
+    end
+end
+
+def fun_l1_n260(x)
+    if (x < 1)
+        fun_l2_n857(x)
+    else
+        fun_l2_n823(x)
+    end
+end
+
+def fun_l1_n261(x)
+    if (x < 1)
+        fun_l2_n72(x)
+    else
+        fun_l2_n875(x)
+    end
+end
+
+def fun_l1_n262(x)
+    if (x < 1)
+        fun_l2_n215(x)
+    else
+        fun_l2_n549(x)
+    end
+end
+
+def fun_l1_n263(x)
+    if (x < 1)
+        fun_l2_n232(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n264(x)
+    if (x < 1)
+        fun_l2_n183(x)
+    else
+        fun_l2_n351(x)
+    end
+end
+
+def fun_l1_n265(x)
+    if (x < 1)
+        fun_l2_n906(x)
+    else
+        fun_l2_n154(x)
+    end
+end
+
+def fun_l1_n266(x)
+    if (x < 1)
+        fun_l2_n234(x)
+    else
+        fun_l2_n547(x)
+    end
+end
+
+def fun_l1_n267(x)
+    if (x < 1)
+        fun_l2_n882(x)
+    else
+        fun_l2_n802(x)
+    end
+end
+
+def fun_l1_n268(x)
+    if (x < 1)
+        fun_l2_n844(x)
+    else
+        fun_l2_n430(x)
+    end
+end
+
+def fun_l1_n269(x)
+    if (x < 1)
+        fun_l2_n781(x)
+    else
+        fun_l2_n738(x)
+    end
+end
+
+def fun_l1_n270(x)
+    if (x < 1)
+        fun_l2_n88(x)
+    else
+        fun_l2_n439(x)
+    end
+end
+
+def fun_l1_n271(x)
+    if (x < 1)
+        fun_l2_n334(x)
+    else
+        fun_l2_n508(x)
+    end
+end
+
+def fun_l1_n272(x)
+    if (x < 1)
+        fun_l2_n871(x)
+    else
+        fun_l2_n562(x)
+    end
+end
+
+def fun_l1_n273(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n356(x)
+    end
+end
+
+def fun_l1_n274(x)
+    if (x < 1)
+        fun_l2_n654(x)
+    else
+        fun_l2_n511(x)
+    end
+end
+
+def fun_l1_n275(x)
+    if (x < 1)
+        fun_l2_n309(x)
+    else
+        fun_l2_n840(x)
+    end
+end
+
+def fun_l1_n276(x)
+    if (x < 1)
+        fun_l2_n729(x)
+    else
+        fun_l2_n72(x)
+    end
+end
+
+def fun_l1_n277(x)
+    if (x < 1)
+        fun_l2_n993(x)
+    else
+        fun_l2_n858(x)
+    end
+end
+
+def fun_l1_n278(x)
+    if (x < 1)
+        fun_l2_n664(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n279(x)
+    if (x < 1)
+        fun_l2_n225(x)
+    else
+        fun_l2_n403(x)
+    end
+end
+
+def fun_l1_n280(x)
+    if (x < 1)
+        fun_l2_n780(x)
+    else
+        fun_l2_n396(x)
+    end
+end
+
+def fun_l1_n281(x)
+    if (x < 1)
+        fun_l2_n114(x)
+    else
+        fun_l2_n114(x)
+    end
+end
+
+def fun_l1_n282(x)
+    if (x < 1)
+        fun_l2_n568(x)
+    else
+        fun_l2_n610(x)
+    end
+end
+
+def fun_l1_n283(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n990(x)
+    end
+end
+
+def fun_l1_n284(x)
+    if (x < 1)
+        fun_l2_n773(x)
+    else
+        fun_l2_n622(x)
+    end
+end
+
+def fun_l1_n285(x)
+    if (x < 1)
+        fun_l2_n695(x)
+    else
+        fun_l2_n101(x)
+    end
+end
+
+def fun_l1_n286(x)
+    if (x < 1)
+        fun_l2_n239(x)
+    else
+        fun_l2_n242(x)
+    end
+end
+
+def fun_l1_n287(x)
+    if (x < 1)
+        fun_l2_n191(x)
+    else
+        fun_l2_n839(x)
+    end
+end
+
+def fun_l1_n288(x)
+    if (x < 1)
+        fun_l2_n246(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n289(x)
+    if (x < 1)
+        fun_l2_n300(x)
+    else
+        fun_l2_n975(x)
+    end
+end
+
+def fun_l1_n290(x)
+    if (x < 1)
+        fun_l2_n436(x)
+    else
+        fun_l2_n14(x)
+    end
+end
+
+def fun_l1_n291(x)
+    if (x < 1)
+        fun_l2_n33(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n292(x)
+    if (x < 1)
+        fun_l2_n462(x)
+    else
+        fun_l2_n399(x)
+    end
+end
+
+def fun_l1_n293(x)
+    if (x < 1)
+        fun_l2_n782(x)
+    else
+        fun_l2_n521(x)
+    end
+end
+
+def fun_l1_n294(x)
+    if (x < 1)
+        fun_l2_n995(x)
+    else
+        fun_l2_n944(x)
+    end
+end
+
+def fun_l1_n295(x)
+    if (x < 1)
+        fun_l2_n700(x)
+    else
+        fun_l2_n250(x)
+    end
+end
+
+def fun_l1_n296(x)
+    if (x < 1)
+        fun_l2_n866(x)
+    else
+        fun_l2_n566(x)
+    end
+end
+
+def fun_l1_n297(x)
+    if (x < 1)
+        fun_l2_n373(x)
+    else
+        fun_l2_n881(x)
+    end
+end
+
+def fun_l1_n298(x)
+    if (x < 1)
+        fun_l2_n382(x)
+    else
+        fun_l2_n729(x)
+    end
+end
+
+def fun_l1_n299(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n192(x)
+    end
+end
+
+def fun_l1_n300(x)
+    if (x < 1)
+        fun_l2_n65(x)
+    else
+        fun_l2_n434(x)
+    end
+end
+
+def fun_l1_n301(x)
+    if (x < 1)
+        fun_l2_n513(x)
+    else
+        fun_l2_n617(x)
+    end
+end
+
+def fun_l1_n302(x)
+    if (x < 1)
+        fun_l2_n972(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n303(x)
+    if (x < 1)
+        fun_l2_n533(x)
+    else
+        fun_l2_n774(x)
+    end
+end
+
+def fun_l1_n304(x)
+    if (x < 1)
+        fun_l2_n439(x)
+    else
+        fun_l2_n351(x)
+    end
+end
+
+def fun_l1_n305(x)
+    if (x < 1)
+        fun_l2_n181(x)
+    else
+        fun_l2_n74(x)
+    end
+end
+
+def fun_l1_n306(x)
+    if (x < 1)
+        fun_l2_n117(x)
+    else
+        fun_l2_n962(x)
+    end
+end
+
+def fun_l1_n307(x)
+    if (x < 1)
+        fun_l2_n499(x)
+    else
+        fun_l2_n183(x)
+    end
+end
+
+def fun_l1_n308(x)
+    if (x < 1)
+        fun_l2_n358(x)
+    else
+        fun_l2_n226(x)
+    end
+end
+
+def fun_l1_n309(x)
+    if (x < 1)
+        fun_l2_n227(x)
+    else
+        fun_l2_n425(x)
+    end
+end
+
+def fun_l1_n310(x)
+    if (x < 1)
+        fun_l2_n724(x)
+    else
+        fun_l2_n278(x)
+    end
+end
+
+def fun_l1_n311(x)
+    if (x < 1)
+        fun_l2_n784(x)
+    else
+        fun_l2_n888(x)
+    end
+end
+
+def fun_l1_n312(x)
+    if (x < 1)
+        fun_l2_n952(x)
+    else
+        fun_l2_n849(x)
+    end
+end
+
+def fun_l1_n313(x)
+    if (x < 1)
+        fun_l2_n921(x)
+    else
+        fun_l2_n31(x)
+    end
+end
+
+def fun_l1_n314(x)
+    if (x < 1)
+        fun_l2_n469(x)
+    else
+        fun_l2_n856(x)
+    end
+end
+
+def fun_l1_n315(x)
+    if (x < 1)
+        fun_l2_n89(x)
+    else
+        fun_l2_n949(x)
+    end
+end
+
+def fun_l1_n316(x)
+    if (x < 1)
+        fun_l2_n216(x)
+    else
+        fun_l2_n410(x)
+    end
+end
+
+def fun_l1_n317(x)
+    if (x < 1)
+        fun_l2_n591(x)
+    else
+        fun_l2_n203(x)
+    end
+end
+
+def fun_l1_n318(x)
+    if (x < 1)
+        fun_l2_n19(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n319(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n996(x)
+    end
+end
+
+def fun_l1_n320(x)
+    if (x < 1)
+        fun_l2_n696(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n321(x)
+    if (x < 1)
+        fun_l2_n708(x)
+    else
+        fun_l2_n150(x)
+    end
+end
+
+def fun_l1_n322(x)
+    if (x < 1)
+        fun_l2_n324(x)
+    else
+        fun_l2_n814(x)
+    end
+end
+
+def fun_l1_n323(x)
+    if (x < 1)
+        fun_l2_n427(x)
+    else
+        fun_l2_n472(x)
+    end
+end
+
+def fun_l1_n324(x)
+    if (x < 1)
+        fun_l2_n847(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n325(x)
+    if (x < 1)
+        fun_l2_n335(x)
+    else
+        fun_l2_n854(x)
+    end
+end
+
+def fun_l1_n326(x)
+    if (x < 1)
+        fun_l2_n635(x)
+    else
+        fun_l2_n276(x)
+    end
+end
+
+def fun_l1_n327(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n328(x)
+    if (x < 1)
+        fun_l2_n979(x)
+    else
+        fun_l2_n558(x)
+    end
+end
+
+def fun_l1_n329(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n696(x)
+    end
+end
+
+def fun_l1_n330(x)
+    if (x < 1)
+        fun_l2_n483(x)
+    else
+        fun_l2_n218(x)
+    end
+end
+
+def fun_l1_n331(x)
+    if (x < 1)
+        fun_l2_n3(x)
+    else
+        fun_l2_n324(x)
+    end
+end
+
+def fun_l1_n332(x)
+    if (x < 1)
+        fun_l2_n396(x)
+    else
+        fun_l2_n718(x)
+    end
+end
+
+def fun_l1_n333(x)
+    if (x < 1)
+        fun_l2_n973(x)
+    else
+        fun_l2_n663(x)
+    end
+end
+
+def fun_l1_n334(x)
+    if (x < 1)
+        fun_l2_n441(x)
+    else
+        fun_l2_n468(x)
+    end
+end
+
+def fun_l1_n335(x)
+    if (x < 1)
+        fun_l2_n511(x)
+    else
+        fun_l2_n455(x)
+    end
+end
+
+def fun_l1_n336(x)
+    if (x < 1)
+        fun_l2_n732(x)
+    else
+        fun_l2_n14(x)
+    end
+end
+
+def fun_l1_n337(x)
+    if (x < 1)
+        fun_l2_n484(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n338(x)
+    if (x < 1)
+        fun_l2_n604(x)
+    else
+        fun_l2_n683(x)
+    end
+end
+
+def fun_l1_n339(x)
+    if (x < 1)
+        fun_l2_n334(x)
+    else
+        fun_l2_n710(x)
+    end
+end
+
+def fun_l1_n340(x)
+    if (x < 1)
+        fun_l2_n233(x)
+    else
+        fun_l2_n394(x)
+    end
+end
+
+def fun_l1_n341(x)
+    if (x < 1)
+        fun_l2_n948(x)
+    else
+        fun_l2_n473(x)
+    end
+end
+
+def fun_l1_n342(x)
+    if (x < 1)
+        fun_l2_n858(x)
+    else
+        fun_l2_n466(x)
+    end
+end
+
+def fun_l1_n343(x)
+    if (x < 1)
+        fun_l2_n647(x)
+    else
+        fun_l2_n604(x)
+    end
+end
+
+def fun_l1_n344(x)
+    if (x < 1)
+        fun_l2_n872(x)
+    else
+        fun_l2_n965(x)
+    end
+end
+
+def fun_l1_n345(x)
+    if (x < 1)
+        fun_l2_n845(x)
+    else
+        fun_l2_n701(x)
+    end
+end
+
+def fun_l1_n346(x)
+    if (x < 1)
+        fun_l2_n75(x)
+    else
+        fun_l2_n332(x)
+    end
+end
+
+def fun_l1_n347(x)
+    if (x < 1)
+        fun_l2_n873(x)
+    else
+        fun_l2_n575(x)
+    end
+end
+
+def fun_l1_n348(x)
+    if (x < 1)
+        fun_l2_n303(x)
+    else
+        fun_l2_n445(x)
+    end
+end
+
+def fun_l1_n349(x)
+    if (x < 1)
+        fun_l2_n45(x)
+    else
+        fun_l2_n312(x)
+    end
+end
+
+def fun_l1_n350(x)
+    if (x < 1)
+        fun_l2_n751(x)
+    else
+        fun_l2_n316(x)
+    end
+end
+
+def fun_l1_n351(x)
+    if (x < 1)
+        fun_l2_n781(x)
+    else
+        fun_l2_n165(x)
+    end
+end
+
+def fun_l1_n352(x)
+    if (x < 1)
+        fun_l2_n120(x)
+    else
+        fun_l2_n595(x)
+    end
+end
+
+def fun_l1_n353(x)
+    if (x < 1)
+        fun_l2_n221(x)
+    else
+        fun_l2_n827(x)
+    end
+end
+
+def fun_l1_n354(x)
+    if (x < 1)
+        fun_l2_n290(x)
+    else
+        fun_l2_n27(x)
+    end
+end
+
+def fun_l1_n355(x)
+    if (x < 1)
+        fun_l2_n377(x)
+    else
+        fun_l2_n28(x)
+    end
+end
+
+def fun_l1_n356(x)
+    if (x < 1)
+        fun_l2_n474(x)
+    else
+        fun_l2_n811(x)
+    end
+end
+
+def fun_l1_n357(x)
+    if (x < 1)
+        fun_l2_n90(x)
+    else
+        fun_l2_n559(x)
+    end
+end
+
+def fun_l1_n358(x)
+    if (x < 1)
+        fun_l2_n66(x)
+    else
+        fun_l2_n234(x)
+    end
+end
+
+def fun_l1_n359(x)
+    if (x < 1)
+        fun_l2_n526(x)
+    else
+        fun_l2_n674(x)
+    end
+end
+
+def fun_l1_n360(x)
+    if (x < 1)
+        fun_l2_n449(x)
+    else
+        fun_l2_n364(x)
+    end
+end
+
+def fun_l1_n361(x)
+    if (x < 1)
+        fun_l2_n790(x)
+    else
+        fun_l2_n835(x)
+    end
+end
+
+def fun_l1_n362(x)
+    if (x < 1)
+        fun_l2_n335(x)
+    else
+        fun_l2_n22(x)
+    end
+end
+
+def fun_l1_n363(x)
+    if (x < 1)
+        fun_l2_n982(x)
+    else
+        fun_l2_n449(x)
+    end
+end
+
+def fun_l1_n364(x)
+    if (x < 1)
+        fun_l2_n980(x)
+    else
+        fun_l2_n861(x)
+    end
+end
+
+def fun_l1_n365(x)
+    if (x < 1)
+        fun_l2_n673(x)
+    else
+        fun_l2_n267(x)
+    end
+end
+
+def fun_l1_n366(x)
+    if (x < 1)
+        fun_l2_n862(x)
+    else
+        fun_l2_n559(x)
+    end
+end
+
+def fun_l1_n367(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n275(x)
+    end
+end
+
+def fun_l1_n368(x)
+    if (x < 1)
+        fun_l2_n370(x)
+    else
+        fun_l2_n763(x)
+    end
+end
+
+def fun_l1_n369(x)
+    if (x < 1)
+        fun_l2_n680(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n370(x)
+    if (x < 1)
+        fun_l2_n799(x)
+    else
+        fun_l2_n724(x)
+    end
+end
+
+def fun_l1_n371(x)
+    if (x < 1)
+        fun_l2_n331(x)
+    else
+        fun_l2_n927(x)
+    end
+end
+
+def fun_l1_n372(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n350(x)
+    end
+end
+
+def fun_l1_n373(x)
+    if (x < 1)
+        fun_l2_n734(x)
+    else
+        fun_l2_n172(x)
+    end
+end
+
+def fun_l1_n374(x)
+    if (x < 1)
+        fun_l2_n657(x)
+    else
+        fun_l2_n765(x)
+    end
+end
+
+def fun_l1_n375(x)
+    if (x < 1)
+        fun_l2_n950(x)
+    else
+        fun_l2_n85(x)
+    end
+end
+
+def fun_l1_n376(x)
+    if (x < 1)
+        fun_l2_n276(x)
+    else
+        fun_l2_n892(x)
+    end
+end
+
+def fun_l1_n377(x)
+    if (x < 1)
+        fun_l2_n430(x)
+    else
+        fun_l2_n173(x)
+    end
+end
+
+def fun_l1_n378(x)
+    if (x < 1)
+        fun_l2_n376(x)
+    else
+        fun_l2_n876(x)
+    end
+end
+
+def fun_l1_n379(x)
+    if (x < 1)
+        fun_l2_n981(x)
+    else
+        fun_l2_n314(x)
+    end
+end
+
+def fun_l1_n380(x)
+    if (x < 1)
+        fun_l2_n680(x)
+    else
+        fun_l2_n600(x)
+    end
+end
+
+def fun_l1_n381(x)
+    if (x < 1)
+        fun_l2_n54(x)
+    else
+        fun_l2_n158(x)
+    end
+end
+
+def fun_l1_n382(x)
+    if (x < 1)
+        fun_l2_n692(x)
+    else
+        fun_l2_n673(x)
+    end
+end
+
+def fun_l1_n383(x)
+    if (x < 1)
+        fun_l2_n393(x)
+    else
+        fun_l2_n723(x)
+    end
+end
+
+def fun_l1_n384(x)
+    if (x < 1)
+        fun_l2_n899(x)
+    else
+        fun_l2_n940(x)
+    end
+end
+
+def fun_l1_n385(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n846(x)
+    end
+end
+
+def fun_l1_n386(x)
+    if (x < 1)
+        fun_l2_n291(x)
+    else
+        fun_l2_n864(x)
+    end
+end
+
+def fun_l1_n387(x)
+    if (x < 1)
+        fun_l2_n174(x)
+    else
+        fun_l2_n466(x)
+    end
+end
+
+def fun_l1_n388(x)
+    if (x < 1)
+        fun_l2_n883(x)
+    else
+        fun_l2_n613(x)
+    end
+end
+
+def fun_l1_n389(x)
+    if (x < 1)
+        fun_l2_n808(x)
+    else
+        fun_l2_n169(x)
+    end
+end
+
+def fun_l1_n390(x)
+    if (x < 1)
+        fun_l2_n94(x)
+    else
+        fun_l2_n93(x)
+    end
+end
+
+def fun_l1_n391(x)
+    if (x < 1)
+        fun_l2_n874(x)
+    else
+        fun_l2_n400(x)
+    end
+end
+
+def fun_l1_n392(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n393(x)
+    if (x < 1)
+        fun_l2_n64(x)
+    else
+        fun_l2_n760(x)
+    end
+end
+
+def fun_l1_n394(x)
+    if (x < 1)
+        fun_l2_n947(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n395(x)
+    if (x < 1)
+        fun_l2_n833(x)
+    else
+        fun_l2_n563(x)
+    end
+end
+
+def fun_l1_n396(x)
+    if (x < 1)
+        fun_l2_n429(x)
+    else
+        fun_l2_n280(x)
+    end
+end
+
+def fun_l1_n397(x)
+    if (x < 1)
+        fun_l2_n132(x)
+    else
+        fun_l2_n486(x)
+    end
+end
+
+def fun_l1_n398(x)
+    if (x < 1)
+        fun_l2_n28(x)
+    else
+        fun_l2_n135(x)
+    end
+end
+
+def fun_l1_n399(x)
+    if (x < 1)
+        fun_l2_n804(x)
+    else
+        fun_l2_n406(x)
+    end
+end
+
+def fun_l1_n400(x)
+    if (x < 1)
+        fun_l2_n661(x)
+    else
+        fun_l2_n216(x)
+    end
+end
+
+def fun_l1_n401(x)
+    if (x < 1)
+        fun_l2_n681(x)
+    else
+        fun_l2_n849(x)
+    end
+end
+
+def fun_l1_n402(x)
+    if (x < 1)
+        fun_l2_n13(x)
+    else
+        fun_l2_n205(x)
+    end
+end
+
+def fun_l1_n403(x)
+    if (x < 1)
+        fun_l2_n911(x)
+    else
+        fun_l2_n63(x)
+    end
+end
+
+def fun_l1_n404(x)
+    if (x < 1)
+        fun_l2_n518(x)
+    else
+        fun_l2_n845(x)
+    end
+end
+
+def fun_l1_n405(x)
+    if (x < 1)
+        fun_l2_n699(x)
+    else
+        fun_l2_n963(x)
+    end
+end
+
+def fun_l1_n406(x)
+    if (x < 1)
+        fun_l2_n373(x)
+    else
+        fun_l2_n485(x)
+    end
+end
+
+def fun_l1_n407(x)
+    if (x < 1)
+        fun_l2_n402(x)
+    else
+        fun_l2_n582(x)
+    end
+end
+
+def fun_l1_n408(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n420(x)
+    end
+end
+
+def fun_l1_n409(x)
+    if (x < 1)
+        fun_l2_n728(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n410(x)
+    if (x < 1)
+        fun_l2_n189(x)
+    else
+        fun_l2_n588(x)
+    end
+end
+
+def fun_l1_n411(x)
+    if (x < 1)
+        fun_l2_n51(x)
+    else
+        fun_l2_n23(x)
+    end
+end
+
+def fun_l1_n412(x)
+    if (x < 1)
+        fun_l2_n548(x)
+    else
+        fun_l2_n200(x)
+    end
+end
+
+def fun_l1_n413(x)
+    if (x < 1)
+        fun_l2_n763(x)
+    else
+        fun_l2_n581(x)
+    end
+end
+
+def fun_l1_n414(x)
+    if (x < 1)
+        fun_l2_n650(x)
+    else
+        fun_l2_n535(x)
+    end
+end
+
+def fun_l1_n415(x)
+    if (x < 1)
+        fun_l2_n500(x)
+    else
+        fun_l2_n579(x)
+    end
+end
+
+def fun_l1_n416(x)
+    if (x < 1)
+        fun_l2_n573(x)
+    else
+        fun_l2_n154(x)
+    end
+end
+
+def fun_l1_n417(x)
+    if (x < 1)
+        fun_l2_n685(x)
+    else
+        fun_l2_n14(x)
+    end
+end
+
+def fun_l1_n418(x)
+    if (x < 1)
+        fun_l2_n849(x)
+    else
+        fun_l2_n91(x)
+    end
+end
+
+def fun_l1_n419(x)
+    if (x < 1)
+        fun_l2_n629(x)
+    else
+        fun_l2_n698(x)
+    end
+end
+
+def fun_l1_n420(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n421(x)
+    if (x < 1)
+        fun_l2_n8(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n422(x)
+    if (x < 1)
+        fun_l2_n294(x)
+    else
+        fun_l2_n338(x)
+    end
+end
+
+def fun_l1_n423(x)
+    if (x < 1)
+        fun_l2_n408(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n424(x)
+    if (x < 1)
+        fun_l2_n349(x)
+    else
+        fun_l2_n896(x)
+    end
+end
+
+def fun_l1_n425(x)
+    if (x < 1)
+        fun_l2_n950(x)
+    else
+        fun_l2_n186(x)
+    end
+end
+
+def fun_l1_n426(x)
+    if (x < 1)
+        fun_l2_n817(x)
+    else
+        fun_l2_n605(x)
+    end
+end
+
+def fun_l1_n427(x)
+    if (x < 1)
+        fun_l2_n317(x)
+    else
+        fun_l2_n31(x)
+    end
+end
+
+def fun_l1_n428(x)
+    if (x < 1)
+        fun_l2_n804(x)
+    else
+        fun_l2_n547(x)
+    end
+end
+
+def fun_l1_n429(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n711(x)
+    end
+end
+
+def fun_l1_n430(x)
+    if (x < 1)
+        fun_l2_n822(x)
+    else
+        fun_l2_n749(x)
+    end
+end
+
+def fun_l1_n431(x)
+    if (x < 1)
+        fun_l2_n412(x)
+    else
+        fun_l2_n366(x)
+    end
+end
+
+def fun_l1_n432(x)
+    if (x < 1)
+        fun_l2_n462(x)
+    else
+        fun_l2_n601(x)
+    end
+end
+
+def fun_l1_n433(x)
+    if (x < 1)
+        fun_l2_n971(x)
+    else
+        fun_l2_n878(x)
+    end
+end
+
+def fun_l1_n434(x)
+    if (x < 1)
+        fun_l2_n551(x)
+    else
+        fun_l2_n172(x)
+    end
+end
+
+def fun_l1_n435(x)
+    if (x < 1)
+        fun_l2_n914(x)
+    else
+        fun_l2_n640(x)
+    end
+end
+
+def fun_l1_n436(x)
+    if (x < 1)
+        fun_l2_n957(x)
+    else
+        fun_l2_n846(x)
+    end
+end
+
+def fun_l1_n437(x)
+    if (x < 1)
+        fun_l2_n622(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n438(x)
+    if (x < 1)
+        fun_l2_n830(x)
+    else
+        fun_l2_n537(x)
+    end
+end
+
+def fun_l1_n439(x)
+    if (x < 1)
+        fun_l2_n415(x)
+    else
+        fun_l2_n863(x)
+    end
+end
+
+def fun_l1_n440(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n441(x)
+    if (x < 1)
+        fun_l2_n525(x)
+    else
+        fun_l2_n656(x)
+    end
+end
+
+def fun_l1_n442(x)
+    if (x < 1)
+        fun_l2_n284(x)
+    else
+        fun_l2_n722(x)
+    end
+end
+
+def fun_l1_n443(x)
+    if (x < 1)
+        fun_l2_n485(x)
+    else
+        fun_l2_n794(x)
+    end
+end
+
+def fun_l1_n444(x)
+    if (x < 1)
+        fun_l2_n268(x)
+    else
+        fun_l2_n443(x)
+    end
+end
+
+def fun_l1_n445(x)
+    if (x < 1)
+        fun_l2_n743(x)
+    else
+        fun_l2_n723(x)
+    end
+end
+
+def fun_l1_n446(x)
+    if (x < 1)
+        fun_l2_n651(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n447(x)
+    if (x < 1)
+        fun_l2_n936(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n448(x)
+    if (x < 1)
+        fun_l2_n473(x)
+    else
+        fun_l2_n749(x)
+    end
+end
+
+def fun_l1_n449(x)
+    if (x < 1)
+        fun_l2_n218(x)
+    else
+        fun_l2_n266(x)
+    end
+end
+
+def fun_l1_n450(x)
+    if (x < 1)
+        fun_l2_n686(x)
+    else
+        fun_l2_n629(x)
+    end
+end
+
+def fun_l1_n451(x)
+    if (x < 1)
+        fun_l2_n648(x)
+    else
+        fun_l2_n322(x)
+    end
+end
+
+def fun_l1_n452(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n720(x)
+    end
+end
+
+def fun_l1_n453(x)
+    if (x < 1)
+        fun_l2_n53(x)
+    else
+        fun_l2_n830(x)
+    end
+end
+
+def fun_l1_n454(x)
+    if (x < 1)
+        fun_l2_n315(x)
+    else
+        fun_l2_n742(x)
+    end
+end
+
+def fun_l1_n455(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n111(x)
+    end
+end
+
+def fun_l1_n456(x)
+    if (x < 1)
+        fun_l2_n924(x)
+    else
+        fun_l2_n109(x)
+    end
+end
+
+def fun_l1_n457(x)
+    if (x < 1)
+        fun_l2_n249(x)
+    else
+        fun_l2_n865(x)
+    end
+end
+
+def fun_l1_n458(x)
+    if (x < 1)
+        fun_l2_n650(x)
+    else
+        fun_l2_n960(x)
+    end
+end
+
+def fun_l1_n459(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n460(x)
+    if (x < 1)
+        fun_l2_n120(x)
+    else
+        fun_l2_n322(x)
+    end
+end
+
+def fun_l1_n461(x)
+    if (x < 1)
+        fun_l2_n366(x)
+    else
+        fun_l2_n534(x)
+    end
+end
+
+def fun_l1_n462(x)
+    if (x < 1)
+        fun_l2_n380(x)
+    else
+        fun_l2_n25(x)
+    end
+end
+
+def fun_l1_n463(x)
+    if (x < 1)
+        fun_l2_n333(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n464(x)
+    if (x < 1)
+        fun_l2_n16(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n465(x)
+    if (x < 1)
+        fun_l2_n539(x)
+    else
+        fun_l2_n988(x)
+    end
+end
+
+def fun_l1_n466(x)
+    if (x < 1)
+        fun_l2_n580(x)
+    else
+        fun_l2_n86(x)
+    end
+end
+
+def fun_l1_n467(x)
+    if (x < 1)
+        fun_l2_n406(x)
+    else
+        fun_l2_n706(x)
+    end
+end
+
+def fun_l1_n468(x)
+    if (x < 1)
+        fun_l2_n858(x)
+    else
+        fun_l2_n393(x)
+    end
+end
+
+def fun_l1_n469(x)
+    if (x < 1)
+        fun_l2_n64(x)
+    else
+        fun_l2_n482(x)
+    end
+end
+
+def fun_l1_n470(x)
+    if (x < 1)
+        fun_l2_n654(x)
+    else
+        fun_l2_n833(x)
+    end
+end
+
+def fun_l1_n471(x)
+    if (x < 1)
+        fun_l2_n161(x)
+    else
+        fun_l2_n91(x)
+    end
+end
+
+def fun_l1_n472(x)
+    if (x < 1)
+        fun_l2_n98(x)
+    else
+        fun_l2_n661(x)
+    end
+end
+
+def fun_l1_n473(x)
+    if (x < 1)
+        fun_l2_n574(x)
+    else
+        fun_l2_n133(x)
+    end
+end
+
+def fun_l1_n474(x)
+    if (x < 1)
+        fun_l2_n109(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n475(x)
+    if (x < 1)
+        fun_l2_n808(x)
+    else
+        fun_l2_n584(x)
+    end
+end
+
+def fun_l1_n476(x)
+    if (x < 1)
+        fun_l2_n495(x)
+    else
+        fun_l2_n708(x)
+    end
+end
+
+def fun_l1_n477(x)
+    if (x < 1)
+        fun_l2_n649(x)
+    else
+        fun_l2_n290(x)
+    end
+end
+
+def fun_l1_n478(x)
+    if (x < 1)
+        fun_l2_n718(x)
+    else
+        fun_l2_n998(x)
+    end
+end
+
+def fun_l1_n479(x)
+    if (x < 1)
+        fun_l2_n557(x)
+    else
+        fun_l2_n359(x)
+    end
+end
+
+def fun_l1_n480(x)
+    if (x < 1)
+        fun_l2_n958(x)
+    else
+        fun_l2_n86(x)
+    end
+end
+
+def fun_l1_n481(x)
+    if (x < 1)
+        fun_l2_n245(x)
+    else
+        fun_l2_n124(x)
+    end
+end
+
+def fun_l1_n482(x)
+    if (x < 1)
+        fun_l2_n510(x)
+    else
+        fun_l2_n170(x)
+    end
+end
+
+def fun_l1_n483(x)
+    if (x < 1)
+        fun_l2_n550(x)
+    else
+        fun_l2_n9(x)
+    end
+end
+
+def fun_l1_n484(x)
+    if (x < 1)
+        fun_l2_n82(x)
+    else
+        fun_l2_n351(x)
+    end
+end
+
+def fun_l1_n485(x)
+    if (x < 1)
+        fun_l2_n760(x)
+    else
+        fun_l2_n560(x)
+    end
+end
+
+def fun_l1_n486(x)
+    if (x < 1)
+        fun_l2_n550(x)
+    else
+        fun_l2_n881(x)
+    end
+end
+
+def fun_l1_n487(x)
+    if (x < 1)
+        fun_l2_n62(x)
+    else
+        fun_l2_n213(x)
+    end
+end
+
+def fun_l1_n488(x)
+    if (x < 1)
+        fun_l2_n336(x)
+    else
+        fun_l2_n855(x)
+    end
+end
+
+def fun_l1_n489(x)
+    if (x < 1)
+        fun_l2_n172(x)
+    else
+        fun_l2_n479(x)
+    end
+end
+
+def fun_l1_n490(x)
+    if (x < 1)
+        fun_l2_n821(x)
+    else
+        fun_l2_n767(x)
+    end
+end
+
+def fun_l1_n491(x)
+    if (x < 1)
+        fun_l2_n388(x)
+    else
+        fun_l2_n307(x)
+    end
+end
+
+def fun_l1_n492(x)
+    if (x < 1)
+        fun_l2_n158(x)
+    else
+        fun_l2_n725(x)
+    end
+end
+
+def fun_l1_n493(x)
+    if (x < 1)
+        fun_l2_n681(x)
+    else
+        fun_l2_n767(x)
+    end
+end
+
+def fun_l1_n494(x)
+    if (x < 1)
+        fun_l2_n799(x)
+    else
+        fun_l2_n458(x)
+    end
+end
+
+def fun_l1_n495(x)
+    if (x < 1)
+        fun_l2_n379(x)
+    else
+        fun_l2_n152(x)
+    end
+end
+
+def fun_l1_n496(x)
+    if (x < 1)
+        fun_l2_n996(x)
+    else
+        fun_l2_n296(x)
+    end
+end
+
+def fun_l1_n497(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n481(x)
+    end
+end
+
+def fun_l1_n498(x)
+    if (x < 1)
+        fun_l2_n887(x)
+    else
+        fun_l2_n343(x)
+    end
+end
+
+def fun_l1_n499(x)
+    if (x < 1)
+        fun_l2_n481(x)
+    else
+        fun_l2_n368(x)
+    end
+end
+
+def fun_l1_n500(x)
+    if (x < 1)
+        fun_l2_n738(x)
+    else
+        fun_l2_n349(x)
+    end
+end
+
+def fun_l1_n501(x)
+    if (x < 1)
+        fun_l2_n104(x)
+    else
+        fun_l2_n841(x)
+    end
+end
+
+def fun_l1_n502(x)
+    if (x < 1)
+        fun_l2_n549(x)
+    else
+        fun_l2_n684(x)
+    end
+end
+
+def fun_l1_n503(x)
+    if (x < 1)
+        fun_l2_n726(x)
+    else
+        fun_l2_n41(x)
+    end
+end
+
+def fun_l1_n504(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n830(x)
+    end
+end
+
+def fun_l1_n505(x)
+    if (x < 1)
+        fun_l2_n38(x)
+    else
+        fun_l2_n815(x)
+    end
+end
+
+def fun_l1_n506(x)
+    if (x < 1)
+        fun_l2_n284(x)
+    else
+        fun_l2_n599(x)
+    end
+end
+
+def fun_l1_n507(x)
+    if (x < 1)
+        fun_l2_n665(x)
+    else
+        fun_l2_n763(x)
+    end
+end
+
+def fun_l1_n508(x)
+    if (x < 1)
+        fun_l2_n755(x)
+    else
+        fun_l2_n51(x)
+    end
+end
+
+def fun_l1_n509(x)
+    if (x < 1)
+        fun_l2_n860(x)
+    else
+        fun_l2_n273(x)
+    end
+end
+
+def fun_l1_n510(x)
+    if (x < 1)
+        fun_l2_n967(x)
+    else
+        fun_l2_n141(x)
+    end
+end
+
+def fun_l1_n511(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n953(x)
+    end
+end
+
+def fun_l1_n512(x)
+    if (x < 1)
+        fun_l2_n784(x)
+    else
+        fun_l2_n941(x)
+    end
+end
+
+def fun_l1_n513(x)
+    if (x < 1)
+        fun_l2_n499(x)
+    else
+        fun_l2_n189(x)
+    end
+end
+
+def fun_l1_n514(x)
+    if (x < 1)
+        fun_l2_n207(x)
+    else
+        fun_l2_n187(x)
+    end
+end
+
+def fun_l1_n515(x)
+    if (x < 1)
+        fun_l2_n174(x)
+    else
+        fun_l2_n316(x)
+    end
+end
+
+def fun_l1_n516(x)
+    if (x < 1)
+        fun_l2_n884(x)
+    else
+        fun_l2_n72(x)
+    end
+end
+
+def fun_l1_n517(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n423(x)
+    end
+end
+
+def fun_l1_n518(x)
+    if (x < 1)
+        fun_l2_n452(x)
+    else
+        fun_l2_n733(x)
+    end
+end
+
+def fun_l1_n519(x)
+    if (x < 1)
+        fun_l2_n586(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n520(x)
+    if (x < 1)
+        fun_l2_n638(x)
+    else
+        fun_l2_n276(x)
+    end
+end
+
+def fun_l1_n521(x)
+    if (x < 1)
+        fun_l2_n186(x)
+    else
+        fun_l2_n498(x)
+    end
+end
+
+def fun_l1_n522(x)
+    if (x < 1)
+        fun_l2_n816(x)
+    else
+        fun_l2_n687(x)
+    end
+end
+
+def fun_l1_n523(x)
+    if (x < 1)
+        fun_l2_n572(x)
+    else
+        fun_l2_n878(x)
+    end
+end
+
+def fun_l1_n524(x)
+    if (x < 1)
+        fun_l2_n528(x)
+    else
+        fun_l2_n188(x)
+    end
+end
+
+def fun_l1_n525(x)
+    if (x < 1)
+        fun_l2_n719(x)
+    else
+        fun_l2_n146(x)
+    end
+end
+
+def fun_l1_n526(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n209(x)
+    end
+end
+
+def fun_l1_n527(x)
+    if (x < 1)
+        fun_l2_n998(x)
+    else
+        fun_l2_n544(x)
+    end
+end
+
+def fun_l1_n528(x)
+    if (x < 1)
+        fun_l2_n288(x)
+    else
+        fun_l2_n682(x)
+    end
+end
+
+def fun_l1_n529(x)
+    if (x < 1)
+        fun_l2_n808(x)
+    else
+        fun_l2_n651(x)
+    end
+end
+
+def fun_l1_n530(x)
+    if (x < 1)
+        fun_l2_n674(x)
+    else
+        fun_l2_n643(x)
+    end
+end
+
+def fun_l1_n531(x)
+    if (x < 1)
+        fun_l2_n42(x)
+    else
+        fun_l2_n457(x)
+    end
+end
+
+def fun_l1_n532(x)
+    if (x < 1)
+        fun_l2_n188(x)
+    else
+        fun_l2_n218(x)
+    end
+end
+
+def fun_l1_n533(x)
+    if (x < 1)
+        fun_l2_n529(x)
+    else
+        fun_l2_n541(x)
+    end
+end
+
+def fun_l1_n534(x)
+    if (x < 1)
+        fun_l2_n820(x)
+    else
+        fun_l2_n426(x)
+    end
+end
+
+def fun_l1_n535(x)
+    if (x < 1)
+        fun_l2_n730(x)
+    else
+        fun_l2_n36(x)
+    end
+end
+
+def fun_l1_n536(x)
+    if (x < 1)
+        fun_l2_n187(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n537(x)
+    if (x < 1)
+        fun_l2_n1(x)
+    else
+        fun_l2_n905(x)
+    end
+end
+
+def fun_l1_n538(x)
+    if (x < 1)
+        fun_l2_n252(x)
+    else
+        fun_l2_n597(x)
+    end
+end
+
+def fun_l1_n539(x)
+    if (x < 1)
+        fun_l2_n959(x)
+    else
+        fun_l2_n26(x)
+    end
+end
+
+def fun_l1_n540(x)
+    if (x < 1)
+        fun_l2_n959(x)
+    else
+        fun_l2_n266(x)
+    end
+end
+
+def fun_l1_n541(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n957(x)
+    end
+end
+
+def fun_l1_n542(x)
+    if (x < 1)
+        fun_l2_n244(x)
+    else
+        fun_l2_n407(x)
+    end
+end
+
+def fun_l1_n543(x)
+    if (x < 1)
+        fun_l2_n319(x)
+    else
+        fun_l2_n19(x)
+    end
+end
+
+def fun_l1_n544(x)
+    if (x < 1)
+        fun_l2_n251(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n545(x)
+    if (x < 1)
+        fun_l2_n482(x)
+    else
+        fun_l2_n177(x)
+    end
+end
+
+def fun_l1_n546(x)
+    if (x < 1)
+        fun_l2_n338(x)
+    else
+        fun_l2_n152(x)
+    end
+end
+
+def fun_l1_n547(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n243(x)
+    end
+end
+
+def fun_l1_n548(x)
+    if (x < 1)
+        fun_l2_n943(x)
+    else
+        fun_l2_n930(x)
+    end
+end
+
+def fun_l1_n549(x)
+    if (x < 1)
+        fun_l2_n775(x)
+    else
+        fun_l2_n338(x)
+    end
+end
+
+def fun_l1_n550(x)
+    if (x < 1)
+        fun_l2_n286(x)
+    else
+        fun_l2_n347(x)
+    end
+end
+
+def fun_l1_n551(x)
+    if (x < 1)
+        fun_l2_n611(x)
+    else
+        fun_l2_n108(x)
+    end
+end
+
+def fun_l1_n552(x)
+    if (x < 1)
+        fun_l2_n515(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n553(x)
+    if (x < 1)
+        fun_l2_n68(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n554(x)
+    if (x < 1)
+        fun_l2_n16(x)
+    else
+        fun_l2_n280(x)
+    end
+end
+
+def fun_l1_n555(x)
+    if (x < 1)
+        fun_l2_n421(x)
+    else
+        fun_l2_n412(x)
+    end
+end
+
+def fun_l1_n556(x)
+    if (x < 1)
+        fun_l2_n653(x)
+    else
+        fun_l2_n527(x)
+    end
+end
+
+def fun_l1_n557(x)
+    if (x < 1)
+        fun_l2_n181(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n558(x)
+    if (x < 1)
+        fun_l2_n270(x)
+    else
+        fun_l2_n367(x)
+    end
+end
+
+def fun_l1_n559(x)
+    if (x < 1)
+        fun_l2_n323(x)
+    else
+        fun_l2_n453(x)
+    end
+end
+
+def fun_l1_n560(x)
+    if (x < 1)
+        fun_l2_n699(x)
+    else
+        fun_l2_n904(x)
+    end
+end
+
+def fun_l1_n561(x)
+    if (x < 1)
+        fun_l2_n903(x)
+    else
+        fun_l2_n559(x)
+    end
+end
+
+def fun_l1_n562(x)
+    if (x < 1)
+        fun_l2_n573(x)
+    else
+        fun_l2_n880(x)
+    end
+end
+
+def fun_l1_n563(x)
+    if (x < 1)
+        fun_l2_n674(x)
+    else
+        fun_l2_n420(x)
+    end
+end
+
+def fun_l1_n564(x)
+    if (x < 1)
+        fun_l2_n76(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n565(x)
+    if (x < 1)
+        fun_l2_n78(x)
+    else
+        fun_l2_n741(x)
+    end
+end
+
+def fun_l1_n566(x)
+    if (x < 1)
+        fun_l2_n542(x)
+    else
+        fun_l2_n762(x)
+    end
+end
+
+def fun_l1_n567(x)
+    if (x < 1)
+        fun_l2_n992(x)
+    else
+        fun_l2_n416(x)
+    end
+end
+
+def fun_l1_n568(x)
+    if (x < 1)
+        fun_l2_n510(x)
+    else
+        fun_l2_n68(x)
+    end
+end
+
+def fun_l1_n569(x)
+    if (x < 1)
+        fun_l2_n36(x)
+    else
+        fun_l2_n152(x)
+    end
+end
+
+def fun_l1_n570(x)
+    if (x < 1)
+        fun_l2_n243(x)
+    else
+        fun_l2_n421(x)
+    end
+end
+
+def fun_l1_n571(x)
+    if (x < 1)
+        fun_l2_n48(x)
+    else
+        fun_l2_n50(x)
+    end
+end
+
+def fun_l1_n572(x)
+    if (x < 1)
+        fun_l2_n647(x)
+    else
+        fun_l2_n614(x)
+    end
+end
+
+def fun_l1_n573(x)
+    if (x < 1)
+        fun_l2_n847(x)
+    else
+        fun_l2_n598(x)
+    end
+end
+
+def fun_l1_n574(x)
+    if (x < 1)
+        fun_l2_n462(x)
+    else
+        fun_l2_n492(x)
+    end
+end
+
+def fun_l1_n575(x)
+    if (x < 1)
+        fun_l2_n805(x)
+    else
+        fun_l2_n23(x)
+    end
+end
+
+def fun_l1_n576(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n271(x)
+    end
+end
+
+def fun_l1_n577(x)
+    if (x < 1)
+        fun_l2_n277(x)
+    else
+        fun_l2_n259(x)
+    end
+end
+
+def fun_l1_n578(x)
+    if (x < 1)
+        fun_l2_n645(x)
+    else
+        fun_l2_n638(x)
+    end
+end
+
+def fun_l1_n579(x)
+    if (x < 1)
+        fun_l2_n925(x)
+    else
+        fun_l2_n801(x)
+    end
+end
+
+def fun_l1_n580(x)
+    if (x < 1)
+        fun_l2_n52(x)
+    else
+        fun_l2_n703(x)
+    end
+end
+
+def fun_l1_n581(x)
+    if (x < 1)
+        fun_l2_n126(x)
+    else
+        fun_l2_n511(x)
+    end
+end
+
+def fun_l1_n582(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n158(x)
+    end
+end
+
+def fun_l1_n583(x)
+    if (x < 1)
+        fun_l2_n604(x)
+    else
+        fun_l2_n498(x)
+    end
+end
+
+def fun_l1_n584(x)
+    if (x < 1)
+        fun_l2_n889(x)
+    else
+        fun_l2_n197(x)
+    end
+end
+
+def fun_l1_n585(x)
+    if (x < 1)
+        fun_l2_n28(x)
+    else
+        fun_l2_n298(x)
+    end
+end
+
+def fun_l1_n586(x)
+    if (x < 1)
+        fun_l2_n165(x)
+    else
+        fun_l2_n340(x)
+    end
+end
+
+def fun_l1_n587(x)
+    if (x < 1)
+        fun_l2_n89(x)
+    else
+        fun_l2_n947(x)
+    end
+end
+
+def fun_l1_n588(x)
+    if (x < 1)
+        fun_l2_n151(x)
+    else
+        fun_l2_n163(x)
+    end
+end
+
+def fun_l1_n589(x)
+    if (x < 1)
+        fun_l2_n200(x)
+    else
+        fun_l2_n855(x)
+    end
+end
+
+def fun_l1_n590(x)
+    if (x < 1)
+        fun_l2_n749(x)
+    else
+        fun_l2_n232(x)
+    end
+end
+
+def fun_l1_n591(x)
+    if (x < 1)
+        fun_l2_n850(x)
+    else
+        fun_l2_n897(x)
+    end
+end
+
+def fun_l1_n592(x)
+    if (x < 1)
+        fun_l2_n287(x)
+    else
+        fun_l2_n266(x)
+    end
+end
+
+def fun_l1_n593(x)
+    if (x < 1)
+        fun_l2_n547(x)
+    else
+        fun_l2_n937(x)
+    end
+end
+
+def fun_l1_n594(x)
+    if (x < 1)
+        fun_l2_n517(x)
+    else
+        fun_l2_n602(x)
+    end
+end
+
+def fun_l1_n595(x)
+    if (x < 1)
+        fun_l2_n962(x)
+    else
+        fun_l2_n387(x)
+    end
+end
+
+def fun_l1_n596(x)
+    if (x < 1)
+        fun_l2_n959(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n597(x)
+    if (x < 1)
+        fun_l2_n343(x)
+    else
+        fun_l2_n704(x)
+    end
+end
+
+def fun_l1_n598(x)
+    if (x < 1)
+        fun_l2_n256(x)
+    else
+        fun_l2_n213(x)
+    end
+end
+
+def fun_l1_n599(x)
+    if (x < 1)
+        fun_l2_n653(x)
+    else
+        fun_l2_n630(x)
+    end
+end
+
+def fun_l1_n600(x)
+    if (x < 1)
+        fun_l2_n587(x)
+    else
+        fun_l2_n899(x)
+    end
+end
+
+def fun_l1_n601(x)
+    if (x < 1)
+        fun_l2_n798(x)
+    else
+        fun_l2_n318(x)
+    end
+end
+
+def fun_l1_n602(x)
+    if (x < 1)
+        fun_l2_n286(x)
+    else
+        fun_l2_n586(x)
+    end
+end
+
+def fun_l1_n603(x)
+    if (x < 1)
+        fun_l2_n931(x)
+    else
+        fun_l2_n370(x)
+    end
+end
+
+def fun_l1_n604(x)
+    if (x < 1)
+        fun_l2_n311(x)
+    else
+        fun_l2_n476(x)
+    end
+end
+
+def fun_l1_n605(x)
+    if (x < 1)
+        fun_l2_n998(x)
+    else
+        fun_l2_n953(x)
+    end
+end
+
+def fun_l1_n606(x)
+    if (x < 1)
+        fun_l2_n782(x)
+    else
+        fun_l2_n225(x)
+    end
+end
+
+def fun_l1_n607(x)
+    if (x < 1)
+        fun_l2_n696(x)
+    else
+        fun_l2_n797(x)
+    end
+end
+
+def fun_l1_n608(x)
+    if (x < 1)
+        fun_l2_n344(x)
+    else
+        fun_l2_n247(x)
+    end
+end
+
+def fun_l1_n609(x)
+    if (x < 1)
+        fun_l2_n627(x)
+    else
+        fun_l2_n410(x)
+    end
+end
+
+def fun_l1_n610(x)
+    if (x < 1)
+        fun_l2_n431(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n611(x)
+    if (x < 1)
+        fun_l2_n307(x)
+    else
+        fun_l2_n857(x)
+    end
+end
+
+def fun_l1_n612(x)
+    if (x < 1)
+        fun_l2_n411(x)
+    else
+        fun_l2_n59(x)
+    end
+end
+
+def fun_l1_n613(x)
+    if (x < 1)
+        fun_l2_n38(x)
+    else
+        fun_l2_n880(x)
+    end
+end
+
+def fun_l1_n614(x)
+    if (x < 1)
+        fun_l2_n945(x)
+    else
+        fun_l2_n723(x)
+    end
+end
+
+def fun_l1_n615(x)
+    if (x < 1)
+        fun_l2_n248(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n616(x)
+    if (x < 1)
+        fun_l2_n453(x)
+    else
+        fun_l2_n4(x)
+    end
+end
+
+def fun_l1_n617(x)
+    if (x < 1)
+        fun_l2_n599(x)
+    else
+        fun_l2_n966(x)
+    end
+end
+
+def fun_l1_n618(x)
+    if (x < 1)
+        fun_l2_n896(x)
+    else
+        fun_l2_n666(x)
+    end
+end
+
+def fun_l1_n619(x)
+    if (x < 1)
+        fun_l2_n715(x)
+    else
+        fun_l2_n918(x)
+    end
+end
+
+def fun_l1_n620(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n144(x)
+    end
+end
+
+def fun_l1_n621(x)
+    if (x < 1)
+        fun_l2_n17(x)
+    else
+        fun_l2_n411(x)
+    end
+end
+
+def fun_l1_n622(x)
+    if (x < 1)
+        fun_l2_n851(x)
+    else
+        fun_l2_n858(x)
+    end
+end
+
+def fun_l1_n623(x)
+    if (x < 1)
+        fun_l2_n552(x)
+    else
+        fun_l2_n503(x)
+    end
+end
+
+def fun_l1_n624(x)
+    if (x < 1)
+        fun_l2_n822(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n625(x)
+    if (x < 1)
+        fun_l2_n917(x)
+    else
+        fun_l2_n120(x)
+    end
+end
+
+def fun_l1_n626(x)
+    if (x < 1)
+        fun_l2_n640(x)
+    else
+        fun_l2_n603(x)
+    end
+end
+
+def fun_l1_n627(x)
+    if (x < 1)
+        fun_l2_n244(x)
+    else
+        fun_l2_n114(x)
+    end
+end
+
+def fun_l1_n628(x)
+    if (x < 1)
+        fun_l2_n374(x)
+    else
+        fun_l2_n295(x)
+    end
+end
+
+def fun_l1_n629(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n920(x)
+    end
+end
+
+def fun_l1_n630(x)
+    if (x < 1)
+        fun_l2_n314(x)
+    else
+        fun_l2_n571(x)
+    end
+end
+
+def fun_l1_n631(x)
+    if (x < 1)
+        fun_l2_n830(x)
+    else
+        fun_l2_n838(x)
+    end
+end
+
+def fun_l1_n632(x)
+    if (x < 1)
+        fun_l2_n523(x)
+    else
+        fun_l2_n453(x)
+    end
+end
+
+def fun_l1_n633(x)
+    if (x < 1)
+        fun_l2_n245(x)
+    else
+        fun_l2_n173(x)
+    end
+end
+
+def fun_l1_n634(x)
+    if (x < 1)
+        fun_l2_n939(x)
+    else
+        fun_l2_n774(x)
+    end
+end
+
+def fun_l1_n635(x)
+    if (x < 1)
+        fun_l2_n17(x)
+    else
+        fun_l2_n166(x)
+    end
+end
+
+def fun_l1_n636(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n297(x)
+    end
+end
+
+def fun_l1_n637(x)
+    if (x < 1)
+        fun_l2_n280(x)
+    else
+        fun_l2_n776(x)
+    end
+end
+
+def fun_l1_n638(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n866(x)
+    end
+end
+
+def fun_l1_n639(x)
+    if (x < 1)
+        fun_l2_n677(x)
+    else
+        fun_l2_n855(x)
+    end
+end
+
+def fun_l1_n640(x)
+    if (x < 1)
+        fun_l2_n252(x)
+    else
+        fun_l2_n766(x)
+    end
+end
+
+def fun_l1_n641(x)
+    if (x < 1)
+        fun_l2_n3(x)
+    else
+        fun_l2_n115(x)
+    end
+end
+
+def fun_l1_n642(x)
+    if (x < 1)
+        fun_l2_n495(x)
+    else
+        fun_l2_n340(x)
+    end
+end
+
+def fun_l1_n643(x)
+    if (x < 1)
+        fun_l2_n991(x)
+    else
+        fun_l2_n119(x)
+    end
+end
+
+def fun_l1_n644(x)
+    if (x < 1)
+        fun_l2_n379(x)
+    else
+        fun_l2_n519(x)
+    end
+end
+
+def fun_l1_n645(x)
+    if (x < 1)
+        fun_l2_n191(x)
+    else
+        fun_l2_n872(x)
+    end
+end
+
+def fun_l1_n646(x)
+    if (x < 1)
+        fun_l2_n979(x)
+    else
+        fun_l2_n980(x)
+    end
+end
+
+def fun_l1_n647(x)
+    if (x < 1)
+        fun_l2_n918(x)
+    else
+        fun_l2_n455(x)
+    end
+end
+
+def fun_l1_n648(x)
+    if (x < 1)
+        fun_l2_n966(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n649(x)
+    if (x < 1)
+        fun_l2_n838(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n650(x)
+    if (x < 1)
+        fun_l2_n542(x)
+    else
+        fun_l2_n42(x)
+    end
+end
+
+def fun_l1_n651(x)
+    if (x < 1)
+        fun_l2_n65(x)
+    else
+        fun_l2_n460(x)
+    end
+end
+
+def fun_l1_n652(x)
+    if (x < 1)
+        fun_l2_n479(x)
+    else
+        fun_l2_n251(x)
+    end
+end
+
+def fun_l1_n653(x)
+    if (x < 1)
+        fun_l2_n243(x)
+    else
+        fun_l2_n77(x)
+    end
+end
+
+def fun_l1_n654(x)
+    if (x < 1)
+        fun_l2_n392(x)
+    else
+        fun_l2_n940(x)
+    end
+end
+
+def fun_l1_n655(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n157(x)
+    end
+end
+
+def fun_l1_n656(x)
+    if (x < 1)
+        fun_l2_n279(x)
+    else
+        fun_l2_n237(x)
+    end
+end
+
+def fun_l1_n657(x)
+    if (x < 1)
+        fun_l2_n522(x)
+    else
+        fun_l2_n174(x)
+    end
+end
+
+def fun_l1_n658(x)
+    if (x < 1)
+        fun_l2_n669(x)
+    else
+        fun_l2_n399(x)
+    end
+end
+
+def fun_l1_n659(x)
+    if (x < 1)
+        fun_l2_n251(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n660(x)
+    if (x < 1)
+        fun_l2_n563(x)
+    else
+        fun_l2_n731(x)
+    end
+end
+
+def fun_l1_n661(x)
+    if (x < 1)
+        fun_l2_n684(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n662(x)
+    if (x < 1)
+        fun_l2_n952(x)
+    else
+        fun_l2_n1(x)
+    end
+end
+
+def fun_l1_n663(x)
+    if (x < 1)
+        fun_l2_n89(x)
+    else
+        fun_l2_n562(x)
+    end
+end
+
+def fun_l1_n664(x)
+    if (x < 1)
+        fun_l2_n480(x)
+    else
+        fun_l2_n488(x)
+    end
+end
+
+def fun_l1_n665(x)
+    if (x < 1)
+        fun_l2_n398(x)
+    else
+        fun_l2_n493(x)
+    end
+end
+
+def fun_l1_n666(x)
+    if (x < 1)
+        fun_l2_n778(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n667(x)
+    if (x < 1)
+        fun_l2_n332(x)
+    else
+        fun_l2_n441(x)
+    end
+end
+
+def fun_l1_n668(x)
+    if (x < 1)
+        fun_l2_n866(x)
+    else
+        fun_l2_n442(x)
+    end
+end
+
+def fun_l1_n669(x)
+    if (x < 1)
+        fun_l2_n533(x)
+    else
+        fun_l2_n970(x)
+    end
+end
+
+def fun_l1_n670(x)
+    if (x < 1)
+        fun_l2_n926(x)
+    else
+        fun_l2_n883(x)
+    end
+end
+
+def fun_l1_n671(x)
+    if (x < 1)
+        fun_l2_n204(x)
+    else
+        fun_l2_n769(x)
+    end
+end
+
+def fun_l1_n672(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n367(x)
+    end
+end
+
+def fun_l1_n673(x)
+    if (x < 1)
+        fun_l2_n978(x)
+    else
+        fun_l2_n750(x)
+    end
+end
+
+def fun_l1_n674(x)
+    if (x < 1)
+        fun_l2_n296(x)
+    else
+        fun_l2_n608(x)
+    end
+end
+
+def fun_l1_n675(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n200(x)
+    end
+end
+
+def fun_l1_n676(x)
+    if (x < 1)
+        fun_l2_n618(x)
+    else
+        fun_l2_n286(x)
+    end
+end
+
+def fun_l1_n677(x)
+    if (x < 1)
+        fun_l2_n98(x)
+    else
+        fun_l2_n264(x)
+    end
+end
+
+def fun_l1_n678(x)
+    if (x < 1)
+        fun_l2_n967(x)
+    else
+        fun_l2_n884(x)
+    end
+end
+
+def fun_l1_n679(x)
+    if (x < 1)
+        fun_l2_n351(x)
+    else
+        fun_l2_n854(x)
+    end
+end
+
+def fun_l1_n680(x)
+    if (x < 1)
+        fun_l2_n397(x)
+    else
+        fun_l2_n56(x)
+    end
+end
+
+def fun_l1_n681(x)
+    if (x < 1)
+        fun_l2_n232(x)
+    else
+        fun_l2_n400(x)
+    end
+end
+
+def fun_l1_n682(x)
+    if (x < 1)
+        fun_l2_n321(x)
+    else
+        fun_l2_n500(x)
+    end
+end
+
+def fun_l1_n683(x)
+    if (x < 1)
+        fun_l2_n315(x)
+    else
+        fun_l2_n509(x)
+    end
+end
+
+def fun_l1_n684(x)
+    if (x < 1)
+        fun_l2_n854(x)
+    else
+        fun_l2_n921(x)
+    end
+end
+
+def fun_l1_n685(x)
+    if (x < 1)
+        fun_l2_n823(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n686(x)
+    if (x < 1)
+        fun_l2_n42(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n687(x)
+    if (x < 1)
+        fun_l2_n74(x)
+    else
+        fun_l2_n577(x)
+    end
+end
+
+def fun_l1_n688(x)
+    if (x < 1)
+        fun_l2_n47(x)
+    else
+        fun_l2_n664(x)
+    end
+end
+
+def fun_l1_n689(x)
+    if (x < 1)
+        fun_l2_n709(x)
+    else
+        fun_l2_n92(x)
+    end
+end
+
+def fun_l1_n690(x)
+    if (x < 1)
+        fun_l2_n875(x)
+    else
+        fun_l2_n893(x)
+    end
+end
+
+def fun_l1_n691(x)
+    if (x < 1)
+        fun_l2_n934(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n692(x)
+    if (x < 1)
+        fun_l2_n194(x)
+    else
+        fun_l2_n915(x)
+    end
+end
+
+def fun_l1_n693(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n212(x)
+    end
+end
+
+def fun_l1_n694(x)
+    if (x < 1)
+        fun_l2_n554(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n695(x)
+    if (x < 1)
+        fun_l2_n372(x)
+    else
+        fun_l2_n652(x)
+    end
+end
+
+def fun_l1_n696(x)
+    if (x < 1)
+        fun_l2_n778(x)
+    else
+        fun_l2_n350(x)
+    end
+end
+
+def fun_l1_n697(x)
+    if (x < 1)
+        fun_l2_n656(x)
+    else
+        fun_l2_n467(x)
+    end
+end
+
+def fun_l1_n698(x)
+    if (x < 1)
+        fun_l2_n799(x)
+    else
+        fun_l2_n983(x)
+    end
+end
+
+def fun_l1_n699(x)
+    if (x < 1)
+        fun_l2_n917(x)
+    else
+        fun_l2_n801(x)
+    end
+end
+
+def fun_l1_n700(x)
+    if (x < 1)
+        fun_l2_n276(x)
+    else
+        fun_l2_n778(x)
+    end
+end
+
+def fun_l1_n701(x)
+    if (x < 1)
+        fun_l2_n562(x)
+    else
+        fun_l2_n558(x)
+    end
+end
+
+def fun_l1_n702(x)
+    if (x < 1)
+        fun_l2_n600(x)
+    else
+        fun_l2_n120(x)
+    end
+end
+
+def fun_l1_n703(x)
+    if (x < 1)
+        fun_l2_n346(x)
+    else
+        fun_l2_n975(x)
+    end
+end
+
+def fun_l1_n704(x)
+    if (x < 1)
+        fun_l2_n139(x)
+    else
+        fun_l2_n241(x)
+    end
+end
+
+def fun_l1_n705(x)
+    if (x < 1)
+        fun_l2_n728(x)
+    else
+        fun_l2_n62(x)
+    end
+end
+
+def fun_l1_n706(x)
+    if (x < 1)
+        fun_l2_n719(x)
+    else
+        fun_l2_n955(x)
+    end
+end
+
+def fun_l1_n707(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n122(x)
+    end
+end
+
+def fun_l1_n708(x)
+    if (x < 1)
+        fun_l2_n456(x)
+    else
+        fun_l2_n128(x)
+    end
+end
+
+def fun_l1_n709(x)
+    if (x < 1)
+        fun_l2_n4(x)
+    else
+        fun_l2_n399(x)
+    end
+end
+
+def fun_l1_n710(x)
+    if (x < 1)
+        fun_l2_n20(x)
+    else
+        fun_l2_n746(x)
+    end
+end
+
+def fun_l1_n711(x)
+    if (x < 1)
+        fun_l2_n978(x)
+    else
+        fun_l2_n886(x)
+    end
+end
+
+def fun_l1_n712(x)
+    if (x < 1)
+        fun_l2_n417(x)
+    else
+        fun_l2_n337(x)
+    end
+end
+
+def fun_l1_n713(x)
+    if (x < 1)
+        fun_l2_n394(x)
+    else
+        fun_l2_n713(x)
+    end
+end
+
+def fun_l1_n714(x)
+    if (x < 1)
+        fun_l2_n433(x)
+    else
+        fun_l2_n985(x)
+    end
+end
+
+def fun_l1_n715(x)
+    if (x < 1)
+        fun_l2_n937(x)
+    else
+        fun_l2_n709(x)
+    end
+end
+
+def fun_l1_n716(x)
+    if (x < 1)
+        fun_l2_n963(x)
+    else
+        fun_l2_n842(x)
+    end
+end
+
+def fun_l1_n717(x)
+    if (x < 1)
+        fun_l2_n671(x)
+    else
+        fun_l2_n954(x)
+    end
+end
+
+def fun_l1_n718(x)
+    if (x < 1)
+        fun_l2_n948(x)
+    else
+        fun_l2_n128(x)
+    end
+end
+
+def fun_l1_n719(x)
+    if (x < 1)
+        fun_l2_n682(x)
+    else
+        fun_l2_n973(x)
+    end
+end
+
+def fun_l1_n720(x)
+    if (x < 1)
+        fun_l2_n336(x)
+    else
+        fun_l2_n643(x)
+    end
+end
+
+def fun_l1_n721(x)
+    if (x < 1)
+        fun_l2_n224(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n722(x)
+    if (x < 1)
+        fun_l2_n907(x)
+    else
+        fun_l2_n776(x)
+    end
+end
+
+def fun_l1_n723(x)
+    if (x < 1)
+        fun_l2_n93(x)
+    else
+        fun_l2_n410(x)
+    end
+end
+
+def fun_l1_n724(x)
+    if (x < 1)
+        fun_l2_n282(x)
+    else
+        fun_l2_n134(x)
+    end
+end
+
+def fun_l1_n725(x)
+    if (x < 1)
+        fun_l2_n938(x)
+    else
+        fun_l2_n603(x)
+    end
+end
+
+def fun_l1_n726(x)
+    if (x < 1)
+        fun_l2_n574(x)
+    else
+        fun_l2_n976(x)
+    end
+end
+
+def fun_l1_n727(x)
+    if (x < 1)
+        fun_l2_n428(x)
+    else
+        fun_l2_n658(x)
+    end
+end
+
+def fun_l1_n728(x)
+    if (x < 1)
+        fun_l2_n828(x)
+    else
+        fun_l2_n226(x)
+    end
+end
+
+def fun_l1_n729(x)
+    if (x < 1)
+        fun_l2_n663(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n730(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n853(x)
+    end
+end
+
+def fun_l1_n731(x)
+    if (x < 1)
+        fun_l2_n142(x)
+    else
+        fun_l2_n339(x)
+    end
+end
+
+def fun_l1_n732(x)
+    if (x < 1)
+        fun_l2_n211(x)
+    else
+        fun_l2_n35(x)
+    end
+end
+
+def fun_l1_n733(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n179(x)
+    end
+end
+
+def fun_l1_n734(x)
+    if (x < 1)
+        fun_l2_n174(x)
+    else
+        fun_l2_n224(x)
+    end
+end
+
+def fun_l1_n735(x)
+    if (x < 1)
+        fun_l2_n490(x)
+    else
+        fun_l2_n564(x)
+    end
+end
+
+def fun_l1_n736(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n153(x)
+    end
+end
+
+def fun_l1_n737(x)
+    if (x < 1)
+        fun_l2_n633(x)
+    else
+        fun_l2_n358(x)
+    end
+end
+
+def fun_l1_n738(x)
+    if (x < 1)
+        fun_l2_n0(x)
+    else
+        fun_l2_n858(x)
+    end
+end
+
+def fun_l1_n739(x)
+    if (x < 1)
+        fun_l2_n335(x)
+    else
+        fun_l2_n531(x)
+    end
+end
+
+def fun_l1_n740(x)
+    if (x < 1)
+        fun_l2_n736(x)
+    else
+        fun_l2_n653(x)
+    end
+end
+
+def fun_l1_n741(x)
+    if (x < 1)
+        fun_l2_n280(x)
+    else
+        fun_l2_n684(x)
+    end
+end
+
+def fun_l1_n742(x)
+    if (x < 1)
+        fun_l2_n976(x)
+    else
+        fun_l2_n987(x)
+    end
+end
+
+def fun_l1_n743(x)
+    if (x < 1)
+        fun_l2_n519(x)
+    else
+        fun_l2_n633(x)
+    end
+end
+
+def fun_l1_n744(x)
+    if (x < 1)
+        fun_l2_n314(x)
+    else
+        fun_l2_n579(x)
+    end
+end
+
+def fun_l1_n745(x)
+    if (x < 1)
+        fun_l2_n365(x)
+    else
+        fun_l2_n972(x)
+    end
+end
+
+def fun_l1_n746(x)
+    if (x < 1)
+        fun_l2_n902(x)
+    else
+        fun_l2_n715(x)
+    end
+end
+
+def fun_l1_n747(x)
+    if (x < 1)
+        fun_l2_n363(x)
+    else
+        fun_l2_n407(x)
+    end
+end
+
+def fun_l1_n748(x)
+    if (x < 1)
+        fun_l2_n660(x)
+    else
+        fun_l2_n814(x)
+    end
+end
+
+def fun_l1_n749(x)
+    if (x < 1)
+        fun_l2_n415(x)
+    else
+        fun_l2_n162(x)
+    end
+end
+
+def fun_l1_n750(x)
+    if (x < 1)
+        fun_l2_n157(x)
+    else
+        fun_l2_n406(x)
+    end
+end
+
+def fun_l1_n751(x)
+    if (x < 1)
+        fun_l2_n388(x)
+    else
+        fun_l2_n212(x)
+    end
+end
+
+def fun_l1_n752(x)
+    if (x < 1)
+        fun_l2_n733(x)
+    else
+        fun_l2_n283(x)
+    end
+end
+
+def fun_l1_n753(x)
+    if (x < 1)
+        fun_l2_n960(x)
+    else
+        fun_l2_n20(x)
+    end
+end
+
+def fun_l1_n754(x)
+    if (x < 1)
+        fun_l2_n797(x)
+    else
+        fun_l2_n202(x)
+    end
+end
+
+def fun_l1_n755(x)
+    if (x < 1)
+        fun_l2_n113(x)
+    else
+        fun_l2_n953(x)
+    end
+end
+
+def fun_l1_n756(x)
+    if (x < 1)
+        fun_l2_n84(x)
+    else
+        fun_l2_n390(x)
+    end
+end
+
+def fun_l1_n757(x)
+    if (x < 1)
+        fun_l2_n355(x)
+    else
+        fun_l2_n761(x)
+    end
+end
+
+def fun_l1_n758(x)
+    if (x < 1)
+        fun_l2_n823(x)
+    else
+        fun_l2_n37(x)
+    end
+end
+
+def fun_l1_n759(x)
+    if (x < 1)
+        fun_l2_n428(x)
+    else
+        fun_l2_n130(x)
+    end
+end
+
+def fun_l1_n760(x)
+    if (x < 1)
+        fun_l2_n364(x)
+    else
+        fun_l2_n680(x)
+    end
+end
+
+def fun_l1_n761(x)
+    if (x < 1)
+        fun_l2_n718(x)
+    else
+        fun_l2_n885(x)
+    end
+end
+
+def fun_l1_n762(x)
+    if (x < 1)
+        fun_l2_n795(x)
+    else
+        fun_l2_n342(x)
+    end
+end
+
+def fun_l1_n763(x)
+    if (x < 1)
+        fun_l2_n561(x)
+    else
+        fun_l2_n593(x)
+    end
+end
+
+def fun_l1_n764(x)
+    if (x < 1)
+        fun_l2_n714(x)
+    else
+        fun_l2_n168(x)
+    end
+end
+
+def fun_l1_n765(x)
+    if (x < 1)
+        fun_l2_n377(x)
+    else
+        fun_l2_n109(x)
+    end
+end
+
+def fun_l1_n766(x)
+    if (x < 1)
+        fun_l2_n477(x)
+    else
+        fun_l2_n871(x)
+    end
+end
+
+def fun_l1_n767(x)
+    if (x < 1)
+        fun_l2_n596(x)
+    else
+        fun_l2_n81(x)
+    end
+end
+
+def fun_l1_n768(x)
+    if (x < 1)
+        fun_l2_n609(x)
+    else
+        fun_l2_n454(x)
+    end
+end
+
+def fun_l1_n769(x)
+    if (x < 1)
+        fun_l2_n308(x)
+    else
+        fun_l2_n890(x)
+    end
+end
+
+def fun_l1_n770(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n342(x)
+    end
+end
+
+def fun_l1_n771(x)
+    if (x < 1)
+        fun_l2_n44(x)
+    else
+        fun_l2_n1(x)
+    end
+end
+
+def fun_l1_n772(x)
+    if (x < 1)
+        fun_l2_n457(x)
+    else
+        fun_l2_n571(x)
+    end
+end
+
+def fun_l1_n773(x)
+    if (x < 1)
+        fun_l2_n88(x)
+    else
+        fun_l2_n622(x)
+    end
+end
+
+def fun_l1_n774(x)
+    if (x < 1)
+        fun_l2_n459(x)
+    else
+        fun_l2_n446(x)
+    end
+end
+
+def fun_l1_n775(x)
+    if (x < 1)
+        fun_l2_n400(x)
+    else
+        fun_l2_n918(x)
+    end
+end
+
+def fun_l1_n776(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n696(x)
+    end
+end
+
+def fun_l1_n777(x)
+    if (x < 1)
+        fun_l2_n968(x)
+    else
+        fun_l2_n988(x)
+    end
+end
+
+def fun_l1_n778(x)
+    if (x < 1)
+        fun_l2_n242(x)
+    else
+        fun_l2_n496(x)
+    end
+end
+
+def fun_l1_n779(x)
+    if (x < 1)
+        fun_l2_n106(x)
+    else
+        fun_l2_n637(x)
+    end
+end
+
+def fun_l1_n780(x)
+    if (x < 1)
+        fun_l2_n945(x)
+    else
+        fun_l2_n238(x)
+    end
+end
+
+def fun_l1_n781(x)
+    if (x < 1)
+        fun_l2_n269(x)
+    else
+        fun_l2_n582(x)
+    end
+end
+
+def fun_l1_n782(x)
+    if (x < 1)
+        fun_l2_n523(x)
+    else
+        fun_l2_n201(x)
+    end
+end
+
+def fun_l1_n783(x)
+    if (x < 1)
+        fun_l2_n326(x)
+    else
+        fun_l2_n744(x)
+    end
+end
+
+def fun_l1_n784(x)
+    if (x < 1)
+        fun_l2_n49(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n785(x)
+    if (x < 1)
+        fun_l2_n975(x)
+    else
+        fun_l2_n560(x)
+    end
+end
+
+def fun_l1_n786(x)
+    if (x < 1)
+        fun_l2_n843(x)
+    else
+        fun_l2_n240(x)
+    end
+end
+
+def fun_l1_n787(x)
+    if (x < 1)
+        fun_l2_n179(x)
+    else
+        fun_l2_n423(x)
+    end
+end
+
+def fun_l1_n788(x)
+    if (x < 1)
+        fun_l2_n536(x)
+    else
+        fun_l2_n112(x)
+    end
+end
+
+def fun_l1_n789(x)
+    if (x < 1)
+        fun_l2_n418(x)
+    else
+        fun_l2_n443(x)
+    end
+end
+
+def fun_l1_n790(x)
+    if (x < 1)
+        fun_l2_n770(x)
+    else
+        fun_l2_n127(x)
+    end
+end
+
+def fun_l1_n791(x)
+    if (x < 1)
+        fun_l2_n425(x)
+    else
+        fun_l2_n364(x)
+    end
+end
+
+def fun_l1_n792(x)
+    if (x < 1)
+        fun_l2_n841(x)
+    else
+        fun_l2_n112(x)
+    end
+end
+
+def fun_l1_n793(x)
+    if (x < 1)
+        fun_l2_n64(x)
+    else
+        fun_l2_n294(x)
+    end
+end
+
+def fun_l1_n794(x)
+    if (x < 1)
+        fun_l2_n837(x)
+    else
+        fun_l2_n325(x)
+    end
+end
+
+def fun_l1_n795(x)
+    if (x < 1)
+        fun_l2_n522(x)
+    else
+        fun_l2_n307(x)
+    end
+end
+
+def fun_l1_n796(x)
+    if (x < 1)
+        fun_l2_n526(x)
+    else
+        fun_l2_n957(x)
+    end
+end
+
+def fun_l1_n797(x)
+    if (x < 1)
+        fun_l2_n71(x)
+    else
+        fun_l2_n871(x)
+    end
+end
+
+def fun_l1_n798(x)
+    if (x < 1)
+        fun_l2_n386(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n799(x)
+    if (x < 1)
+        fun_l2_n669(x)
+    else
+        fun_l2_n237(x)
+    end
+end
+
+def fun_l1_n800(x)
+    if (x < 1)
+        fun_l2_n455(x)
+    else
+        fun_l2_n549(x)
+    end
+end
+
+def fun_l1_n801(x)
+    if (x < 1)
+        fun_l2_n708(x)
+    else
+        fun_l2_n611(x)
+    end
+end
+
+def fun_l1_n802(x)
+    if (x < 1)
+        fun_l2_n35(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n803(x)
+    if (x < 1)
+        fun_l2_n890(x)
+    else
+        fun_l2_n27(x)
+    end
+end
+
+def fun_l1_n804(x)
+    if (x < 1)
+        fun_l2_n378(x)
+    else
+        fun_l2_n567(x)
+    end
+end
+
+def fun_l1_n805(x)
+    if (x < 1)
+        fun_l2_n672(x)
+    else
+        fun_l2_n320(x)
+    end
+end
+
+def fun_l1_n806(x)
+    if (x < 1)
+        fun_l2_n207(x)
+    else
+        fun_l2_n691(x)
+    end
+end
+
+def fun_l1_n807(x)
+    if (x < 1)
+        fun_l2_n180(x)
+    else
+        fun_l2_n912(x)
+    end
+end
+
+def fun_l1_n808(x)
+    if (x < 1)
+        fun_l2_n370(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n809(x)
+    if (x < 1)
+        fun_l2_n436(x)
+    else
+        fun_l2_n465(x)
+    end
+end
+
+def fun_l1_n810(x)
+    if (x < 1)
+        fun_l2_n820(x)
+    else
+        fun_l2_n995(x)
+    end
+end
+
+def fun_l1_n811(x)
+    if (x < 1)
+        fun_l2_n821(x)
+    else
+        fun_l2_n898(x)
+    end
+end
+
+def fun_l1_n812(x)
+    if (x < 1)
+        fun_l2_n376(x)
+    else
+        fun_l2_n999(x)
+    end
+end
+
+def fun_l1_n813(x)
+    if (x < 1)
+        fun_l2_n643(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n814(x)
+    if (x < 1)
+        fun_l2_n475(x)
+    else
+        fun_l2_n137(x)
+    end
+end
+
+def fun_l1_n815(x)
+    if (x < 1)
+        fun_l2_n117(x)
+    else
+        fun_l2_n685(x)
+    end
+end
+
+def fun_l1_n816(x)
+    if (x < 1)
+        fun_l2_n451(x)
+    else
+        fun_l2_n643(x)
+    end
+end
+
+def fun_l1_n817(x)
+    if (x < 1)
+        fun_l2_n22(x)
+    else
+        fun_l2_n939(x)
+    end
+end
+
+def fun_l1_n818(x)
+    if (x < 1)
+        fun_l2_n586(x)
+    else
+        fun_l2_n206(x)
+    end
+end
+
+def fun_l1_n819(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n661(x)
+    end
+end
+
+def fun_l1_n820(x)
+    if (x < 1)
+        fun_l2_n656(x)
+    else
+        fun_l2_n93(x)
+    end
+end
+
+def fun_l1_n821(x)
+    if (x < 1)
+        fun_l2_n794(x)
+    else
+        fun_l2_n354(x)
+    end
+end
+
+def fun_l1_n822(x)
+    if (x < 1)
+        fun_l2_n519(x)
+    else
+        fun_l2_n446(x)
+    end
+end
+
+def fun_l1_n823(x)
+    if (x < 1)
+        fun_l2_n0(x)
+    else
+        fun_l2_n233(x)
+    end
+end
+
+def fun_l1_n824(x)
+    if (x < 1)
+        fun_l2_n376(x)
+    else
+        fun_l2_n186(x)
+    end
+end
+
+def fun_l1_n825(x)
+    if (x < 1)
+        fun_l2_n292(x)
+    else
+        fun_l2_n303(x)
+    end
+end
+
+def fun_l1_n826(x)
+    if (x < 1)
+        fun_l2_n871(x)
+    else
+        fun_l2_n515(x)
+    end
+end
+
+def fun_l1_n827(x)
+    if (x < 1)
+        fun_l2_n227(x)
+    else
+        fun_l2_n232(x)
+    end
+end
+
+def fun_l1_n828(x)
+    if (x < 1)
+        fun_l2_n860(x)
+    else
+        fun_l2_n341(x)
+    end
+end
+
+def fun_l1_n829(x)
+    if (x < 1)
+        fun_l2_n140(x)
+    else
+        fun_l2_n304(x)
+    end
+end
+
+def fun_l1_n830(x)
+    if (x < 1)
+        fun_l2_n796(x)
+    else
+        fun_l2_n943(x)
+    end
+end
+
+def fun_l1_n831(x)
+    if (x < 1)
+        fun_l2_n71(x)
+    else
+        fun_l2_n8(x)
+    end
+end
+
+def fun_l1_n832(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n836(x)
+    end
+end
+
+def fun_l1_n833(x)
+    if (x < 1)
+        fun_l2_n322(x)
+    else
+        fun_l2_n653(x)
+    end
+end
+
+def fun_l1_n834(x)
+    if (x < 1)
+        fun_l2_n471(x)
+    else
+        fun_l2_n147(x)
+    end
+end
+
+def fun_l1_n835(x)
+    if (x < 1)
+        fun_l2_n601(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n836(x)
+    if (x < 1)
+        fun_l2_n105(x)
+    else
+        fun_l2_n63(x)
+    end
+end
+
+def fun_l1_n837(x)
+    if (x < 1)
+        fun_l2_n773(x)
+    else
+        fun_l2_n597(x)
+    end
+end
+
+def fun_l1_n838(x)
+    if (x < 1)
+        fun_l2_n933(x)
+    else
+        fun_l2_n964(x)
+    end
+end
+
+def fun_l1_n839(x)
+    if (x < 1)
+        fun_l2_n123(x)
+    else
+        fun_l2_n533(x)
+    end
+end
+
+def fun_l1_n840(x)
+    if (x < 1)
+        fun_l2_n94(x)
+    else
+        fun_l2_n127(x)
+    end
+end
+
+def fun_l1_n841(x)
+    if (x < 1)
+        fun_l2_n981(x)
+    else
+        fun_l2_n819(x)
+    end
+end
+
+def fun_l1_n842(x)
+    if (x < 1)
+        fun_l2_n743(x)
+    else
+        fun_l2_n747(x)
+    end
+end
+
+def fun_l1_n843(x)
+    if (x < 1)
+        fun_l2_n735(x)
+    else
+        fun_l2_n110(x)
+    end
+end
+
+def fun_l1_n844(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n753(x)
+    end
+end
+
+def fun_l1_n845(x)
+    if (x < 1)
+        fun_l2_n316(x)
+    else
+        fun_l2_n391(x)
+    end
+end
+
+def fun_l1_n846(x)
+    if (x < 1)
+        fun_l2_n221(x)
+    else
+        fun_l2_n251(x)
+    end
+end
+
+def fun_l1_n847(x)
+    if (x < 1)
+        fun_l2_n795(x)
+    else
+        fun_l2_n513(x)
+    end
+end
+
+def fun_l1_n848(x)
+    if (x < 1)
+        fun_l2_n986(x)
+    else
+        fun_l2_n472(x)
+    end
+end
+
+def fun_l1_n849(x)
+    if (x < 1)
+        fun_l2_n863(x)
+    else
+        fun_l2_n759(x)
+    end
+end
+
+def fun_l1_n850(x)
+    if (x < 1)
+        fun_l2_n512(x)
+    else
+        fun_l2_n502(x)
+    end
+end
+
+def fun_l1_n851(x)
+    if (x < 1)
+        fun_l2_n561(x)
+    else
+        fun_l2_n697(x)
+    end
+end
+
+def fun_l1_n852(x)
+    if (x < 1)
+        fun_l2_n816(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n853(x)
+    if (x < 1)
+        fun_l2_n656(x)
+    else
+        fun_l2_n174(x)
+    end
+end
+
+def fun_l1_n854(x)
+    if (x < 1)
+        fun_l2_n439(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n855(x)
+    if (x < 1)
+        fun_l2_n15(x)
+    else
+        fun_l2_n402(x)
+    end
+end
+
+def fun_l1_n856(x)
+    if (x < 1)
+        fun_l2_n224(x)
+    else
+        fun_l2_n177(x)
+    end
+end
+
+def fun_l1_n857(x)
+    if (x < 1)
+        fun_l2_n675(x)
+    else
+        fun_l2_n113(x)
+    end
+end
+
+def fun_l1_n858(x)
+    if (x < 1)
+        fun_l2_n388(x)
+    else
+        fun_l2_n529(x)
+    end
+end
+
+def fun_l1_n859(x)
+    if (x < 1)
+        fun_l2_n628(x)
+    else
+        fun_l2_n93(x)
+    end
+end
+
+def fun_l1_n860(x)
+    if (x < 1)
+        fun_l2_n67(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n861(x)
+    if (x < 1)
+        fun_l2_n637(x)
+    else
+        fun_l2_n68(x)
+    end
+end
+
+def fun_l1_n862(x)
+    if (x < 1)
+        fun_l2_n767(x)
+    else
+        fun_l2_n86(x)
+    end
+end
+
+def fun_l1_n863(x)
+    if (x < 1)
+        fun_l2_n50(x)
+    else
+        fun_l2_n777(x)
+    end
+end
+
+def fun_l1_n864(x)
+    if (x < 1)
+        fun_l2_n846(x)
+    else
+        fun_l2_n783(x)
+    end
+end
+
+def fun_l1_n865(x)
+    if (x < 1)
+        fun_l2_n756(x)
+    else
+        fun_l2_n703(x)
+    end
+end
+
+def fun_l1_n866(x)
+    if (x < 1)
+        fun_l2_n972(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n867(x)
+    if (x < 1)
+        fun_l2_n636(x)
+    else
+        fun_l2_n841(x)
+    end
+end
+
+def fun_l1_n868(x)
+    if (x < 1)
+        fun_l2_n889(x)
+    else
+        fun_l2_n899(x)
+    end
+end
+
+def fun_l1_n869(x)
+    if (x < 1)
+        fun_l2_n55(x)
+    else
+        fun_l2_n45(x)
+    end
+end
+
+def fun_l1_n870(x)
+    if (x < 1)
+        fun_l2_n740(x)
+    else
+        fun_l2_n722(x)
+    end
+end
+
+def fun_l1_n871(x)
+    if (x < 1)
+        fun_l2_n865(x)
+    else
+        fun_l2_n695(x)
+    end
+end
+
+def fun_l1_n872(x)
+    if (x < 1)
+        fun_l2_n54(x)
+    else
+        fun_l2_n581(x)
+    end
+end
+
+def fun_l1_n873(x)
+    if (x < 1)
+        fun_l2_n328(x)
+    else
+        fun_l2_n861(x)
+    end
+end
+
+def fun_l1_n874(x)
+    if (x < 1)
+        fun_l2_n645(x)
+    else
+        fun_l2_n121(x)
+    end
+end
+
+def fun_l1_n875(x)
+    if (x < 1)
+        fun_l2_n71(x)
+    else
+        fun_l2_n329(x)
+    end
+end
+
+def fun_l1_n876(x)
+    if (x < 1)
+        fun_l2_n944(x)
+    else
+        fun_l2_n95(x)
+    end
+end
+
+def fun_l1_n877(x)
+    if (x < 1)
+        fun_l2_n270(x)
+    else
+        fun_l2_n801(x)
+    end
+end
+
+def fun_l1_n878(x)
+    if (x < 1)
+        fun_l2_n115(x)
+    else
+        fun_l2_n414(x)
+    end
+end
+
+def fun_l1_n879(x)
+    if (x < 1)
+        fun_l2_n154(x)
+    else
+        fun_l2_n605(x)
+    end
+end
+
+def fun_l1_n880(x)
+    if (x < 1)
+        fun_l2_n859(x)
+    else
+        fun_l2_n307(x)
+    end
+end
+
+def fun_l1_n881(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n267(x)
+    end
+end
+
+def fun_l1_n882(x)
+    if (x < 1)
+        fun_l2_n280(x)
+    else
+        fun_l2_n175(x)
+    end
+end
+
+def fun_l1_n883(x)
+    if (x < 1)
+        fun_l2_n176(x)
+    else
+        fun_l2_n286(x)
+    end
+end
+
+def fun_l1_n884(x)
+    if (x < 1)
+        fun_l2_n422(x)
+    else
+        fun_l2_n469(x)
+    end
+end
+
+def fun_l1_n885(x)
+    if (x < 1)
+        fun_l2_n532(x)
+    else
+        fun_l2_n795(x)
+    end
+end
+
+def fun_l1_n886(x)
+    if (x < 1)
+        fun_l2_n966(x)
+    else
+        fun_l2_n46(x)
+    end
+end
+
+def fun_l1_n887(x)
+    if (x < 1)
+        fun_l2_n446(x)
+    else
+        fun_l2_n944(x)
+    end
+end
+
+def fun_l1_n888(x)
+    if (x < 1)
+        fun_l2_n256(x)
+    else
+        fun_l2_n757(x)
+    end
+end
+
+def fun_l1_n889(x)
+    if (x < 1)
+        fun_l2_n566(x)
+    else
+        fun_l2_n992(x)
+    end
+end
+
+def fun_l1_n890(x)
+    if (x < 1)
+        fun_l2_n55(x)
+    else
+        fun_l2_n121(x)
+    end
+end
+
+def fun_l1_n891(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n257(x)
+    end
+end
+
+def fun_l1_n892(x)
+    if (x < 1)
+        fun_l2_n79(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n893(x)
+    if (x < 1)
+        fun_l2_n436(x)
+    else
+        fun_l2_n738(x)
+    end
+end
+
+def fun_l1_n894(x)
+    if (x < 1)
+        fun_l2_n244(x)
+    else
+        fun_l2_n184(x)
+    end
+end
+
+def fun_l1_n895(x)
+    if (x < 1)
+        fun_l2_n342(x)
+    else
+        fun_l2_n794(x)
+    end
+end
+
+def fun_l1_n896(x)
+    if (x < 1)
+        fun_l2_n588(x)
+    else
+        fun_l2_n235(x)
+    end
+end
+
+def fun_l1_n897(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n462(x)
+    end
+end
+
+def fun_l1_n898(x)
+    if (x < 1)
+        fun_l2_n986(x)
+    else
+        fun_l2_n282(x)
+    end
+end
+
+def fun_l1_n899(x)
+    if (x < 1)
+        fun_l2_n61(x)
+    else
+        fun_l2_n516(x)
+    end
+end
+
+def fun_l1_n900(x)
+    if (x < 1)
+        fun_l2_n993(x)
+    else
+        fun_l2_n337(x)
+    end
+end
+
+def fun_l1_n901(x)
+    if (x < 1)
+        fun_l2_n398(x)
+    else
+        fun_l2_n425(x)
+    end
+end
+
+def fun_l1_n902(x)
+    if (x < 1)
+        fun_l2_n177(x)
+    else
+        fun_l2_n741(x)
+    end
+end
+
+def fun_l1_n903(x)
+    if (x < 1)
+        fun_l2_n597(x)
+    else
+        fun_l2_n331(x)
+    end
+end
+
+def fun_l1_n904(x)
+    if (x < 1)
+        fun_l2_n740(x)
+    else
+        fun_l2_n527(x)
+    end
+end
+
+def fun_l1_n905(x)
+    if (x < 1)
+        fun_l2_n138(x)
+    else
+        fun_l2_n248(x)
+    end
+end
+
+def fun_l1_n906(x)
+    if (x < 1)
+        fun_l2_n318(x)
+    else
+        fun_l2_n941(x)
+    end
+end
+
+def fun_l1_n907(x)
+    if (x < 1)
+        fun_l2_n493(x)
+    else
+        fun_l2_n376(x)
+    end
+end
+
+def fun_l1_n908(x)
+    if (x < 1)
+        fun_l2_n899(x)
+    else
+        fun_l2_n745(x)
+    end
+end
+
+def fun_l1_n909(x)
+    if (x < 1)
+        fun_l2_n963(x)
+    else
+        fun_l2_n384(x)
+    end
+end
+
+def fun_l1_n910(x)
+    if (x < 1)
+        fun_l2_n490(x)
+    else
+        fun_l2_n702(x)
+    end
+end
+
+def fun_l1_n911(x)
+    if (x < 1)
+        fun_l2_n712(x)
+    else
+        fun_l2_n810(x)
+    end
+end
+
+def fun_l1_n912(x)
+    if (x < 1)
+        fun_l2_n245(x)
+    else
+        fun_l2_n609(x)
+    end
+end
+
+def fun_l1_n913(x)
+    if (x < 1)
+        fun_l2_n997(x)
+    else
+        fun_l2_n241(x)
+    end
+end
+
+def fun_l1_n914(x)
+    if (x < 1)
+        fun_l2_n428(x)
+    else
+        fun_l2_n697(x)
+    end
+end
+
+def fun_l1_n915(x)
+    if (x < 1)
+        fun_l2_n257(x)
+    else
+        fun_l2_n626(x)
+    end
+end
+
+def fun_l1_n916(x)
+    if (x < 1)
+        fun_l2_n378(x)
+    else
+        fun_l2_n457(x)
+    end
+end
+
+def fun_l1_n917(x)
+    if (x < 1)
+        fun_l2_n378(x)
+    else
+        fun_l2_n958(x)
+    end
+end
+
+def fun_l1_n918(x)
+    if (x < 1)
+        fun_l2_n213(x)
+    else
+        fun_l2_n962(x)
+    end
+end
+
+def fun_l1_n919(x)
+    if (x < 1)
+        fun_l2_n466(x)
+    else
+        fun_l2_n461(x)
+    end
+end
+
+def fun_l1_n920(x)
+    if (x < 1)
+        fun_l2_n835(x)
+    else
+        fun_l2_n460(x)
+    end
+end
+
+def fun_l1_n921(x)
+    if (x < 1)
+        fun_l2_n642(x)
+    else
+        fun_l2_n680(x)
+    end
+end
+
+def fun_l1_n922(x)
+    if (x < 1)
+        fun_l2_n467(x)
+    else
+        fun_l2_n225(x)
+    end
+end
+
+def fun_l1_n923(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n462(x)
+    end
+end
+
+def fun_l1_n924(x)
+    if (x < 1)
+        fun_l2_n113(x)
+    else
+        fun_l2_n59(x)
+    end
+end
+
+def fun_l1_n925(x)
+    if (x < 1)
+        fun_l2_n329(x)
+    else
+        fun_l2_n994(x)
+    end
+end
+
+def fun_l1_n926(x)
+    if (x < 1)
+        fun_l2_n815(x)
+    else
+        fun_l2_n249(x)
+    end
+end
+
+def fun_l1_n927(x)
+    if (x < 1)
+        fun_l2_n216(x)
+    else
+        fun_l2_n591(x)
+    end
+end
+
+def fun_l1_n928(x)
+    if (x < 1)
+        fun_l2_n441(x)
+    else
+        fun_l2_n437(x)
+    end
+end
+
+def fun_l1_n929(x)
+    if (x < 1)
+        fun_l2_n433(x)
+    else
+        fun_l2_n185(x)
+    end
+end
+
+def fun_l1_n930(x)
+    if (x < 1)
+        fun_l2_n125(x)
+    else
+        fun_l2_n940(x)
+    end
+end
+
+def fun_l1_n931(x)
+    if (x < 1)
+        fun_l2_n203(x)
+    else
+        fun_l2_n292(x)
+    end
+end
+
+def fun_l1_n932(x)
+    if (x < 1)
+        fun_l2_n986(x)
+    else
+        fun_l2_n234(x)
+    end
+end
+
+def fun_l1_n933(x)
+    if (x < 1)
+        fun_l2_n735(x)
+    else
+        fun_l2_n20(x)
+    end
+end
+
+def fun_l1_n934(x)
+    if (x < 1)
+        fun_l2_n878(x)
+    else
+        fun_l2_n166(x)
+    end
+end
+
+def fun_l1_n935(x)
+    if (x < 1)
+        fun_l2_n123(x)
+    else
+        fun_l2_n52(x)
+    end
+end
+
+def fun_l1_n936(x)
+    if (x < 1)
+        fun_l2_n99(x)
+    else
+        fun_l2_n336(x)
+    end
+end
+
+def fun_l1_n937(x)
+    if (x < 1)
+        fun_l2_n731(x)
+    else
+        fun_l2_n363(x)
+    end
+end
+
+def fun_l1_n938(x)
+    if (x < 1)
+        fun_l2_n988(x)
+    else
+        fun_l2_n978(x)
+    end
+end
+
+def fun_l1_n939(x)
+    if (x < 1)
+        fun_l2_n592(x)
+    else
+        fun_l2_n932(x)
+    end
+end
+
+def fun_l1_n940(x)
+    if (x < 1)
+        fun_l2_n681(x)
+    else
+        fun_l2_n868(x)
+    end
+end
+
+def fun_l1_n941(x)
+    if (x < 1)
+        fun_l2_n863(x)
+    else
+        fun_l2_n457(x)
+    end
+end
+
+def fun_l1_n942(x)
+    if (x < 1)
+        fun_l2_n526(x)
+    else
+        fun_l2_n960(x)
+    end
+end
+
+def fun_l1_n943(x)
+    if (x < 1)
+        fun_l2_n859(x)
+    else
+        fun_l2_n478(x)
+    end
+end
+
+def fun_l1_n944(x)
+    if (x < 1)
+        fun_l2_n947(x)
+    else
+        fun_l2_n889(x)
+    end
+end
+
+def fun_l1_n945(x)
+    if (x < 1)
+        fun_l2_n845(x)
+    else
+        fun_l2_n211(x)
+    end
+end
+
+def fun_l1_n946(x)
+    if (x < 1)
+        fun_l2_n445(x)
+    else
+        fun_l2_n600(x)
+    end
+end
+
+def fun_l1_n947(x)
+    if (x < 1)
+        fun_l2_n932(x)
+    else
+        fun_l2_n534(x)
+    end
+end
+
+def fun_l1_n948(x)
+    if (x < 1)
+        fun_l2_n224(x)
+    else
+        fun_l2_n32(x)
+    end
+end
+
+def fun_l1_n949(x)
+    if (x < 1)
+        fun_l2_n63(x)
+    else
+        fun_l2_n121(x)
+    end
+end
+
+def fun_l1_n950(x)
+    if (x < 1)
+        fun_l2_n55(x)
+    else
+        fun_l2_n90(x)
+    end
+end
+
+def fun_l1_n951(x)
+    if (x < 1)
+        fun_l2_n880(x)
+    else
+        fun_l2_n936(x)
+    end
+end
+
+def fun_l1_n952(x)
+    if (x < 1)
+        fun_l2_n971(x)
+    else
+        fun_l2_n40(x)
+    end
+end
+
+def fun_l1_n953(x)
+    if (x < 1)
+        fun_l2_n880(x)
+    else
+        fun_l2_n200(x)
+    end
+end
+
+def fun_l1_n954(x)
+    if (x < 1)
+        fun_l2_n60(x)
+    else
+        fun_l2_n473(x)
+    end
+end
+
+def fun_l1_n955(x)
+    if (x < 1)
+        fun_l2_n855(x)
+    else
+        fun_l2_n601(x)
+    end
+end
+
+def fun_l1_n956(x)
+    if (x < 1)
+        fun_l2_n282(x)
+    else
+        fun_l2_n542(x)
+    end
+end
+
+def fun_l1_n957(x)
+    if (x < 1)
+        fun_l2_n116(x)
+    else
+        fun_l2_n584(x)
+    end
+end
+
+def fun_l1_n958(x)
+    if (x < 1)
+        fun_l2_n845(x)
+    else
+        fun_l2_n814(x)
+    end
+end
+
+def fun_l1_n959(x)
+    if (x < 1)
+        fun_l2_n443(x)
+    else
+        fun_l2_n239(x)
+    end
+end
+
+def fun_l1_n960(x)
+    if (x < 1)
+        fun_l2_n79(x)
+    else
+        fun_l2_n556(x)
+    end
+end
+
+def fun_l1_n961(x)
+    if (x < 1)
+        fun_l2_n664(x)
+    else
+        fun_l2_n282(x)
+    end
+end
+
+def fun_l1_n962(x)
+    if (x < 1)
+        fun_l2_n273(x)
+    else
+        fun_l2_n393(x)
+    end
+end
+
+def fun_l1_n963(x)
+    if (x < 1)
+        fun_l2_n120(x)
+    else
+        fun_l2_n506(x)
+    end
+end
+
+def fun_l1_n964(x)
+    if (x < 1)
+        fun_l2_n362(x)
+    else
+        fun_l2_n631(x)
+    end
+end
+
+def fun_l1_n965(x)
+    if (x < 1)
+        fun_l2_n219(x)
+    else
+        fun_l2_n260(x)
+    end
+end
+
+def fun_l1_n966(x)
+    if (x < 1)
+        fun_l2_n802(x)
+    else
+        fun_l2_n732(x)
+    end
+end
+
+def fun_l1_n967(x)
+    if (x < 1)
+        fun_l2_n761(x)
+    else
+        fun_l2_n580(x)
+    end
+end
+
+def fun_l1_n968(x)
+    if (x < 1)
+        fun_l2_n529(x)
+    else
+        fun_l2_n783(x)
+    end
+end
+
+def fun_l1_n969(x)
+    if (x < 1)
+        fun_l2_n138(x)
+    else
+        fun_l2_n434(x)
+    end
+end
+
+def fun_l1_n970(x)
+    if (x < 1)
+        fun_l2_n266(x)
+    else
+        fun_l2_n522(x)
+    end
+end
+
+def fun_l1_n971(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n51(x)
+    end
+end
+
+def fun_l1_n972(x)
+    if (x < 1)
+        fun_l2_n619(x)
+    else
+        fun_l2_n68(x)
+    end
+end
+
+def fun_l1_n973(x)
+    if (x < 1)
+        fun_l2_n510(x)
+    else
+        fun_l2_n74(x)
+    end
+end
+
+def fun_l1_n974(x)
+    if (x < 1)
+        fun_l2_n442(x)
+    else
+        fun_l2_n258(x)
+    end
+end
+
+def fun_l1_n975(x)
+    if (x < 1)
+        fun_l2_n106(x)
+    else
+        fun_l2_n364(x)
+    end
+end
+
+def fun_l1_n976(x)
+    if (x < 1)
+        fun_l2_n412(x)
+    else
+        fun_l2_n669(x)
+    end
+end
+
+def fun_l1_n977(x)
+    if (x < 1)
+        fun_l2_n394(x)
+    else
+        fun_l2_n435(x)
+    end
+end
+
+def fun_l1_n978(x)
+    if (x < 1)
+        fun_l2_n630(x)
+    else
+        fun_l2_n686(x)
+    end
+end
+
+def fun_l1_n979(x)
+    if (x < 1)
+        fun_l2_n683(x)
+    else
+        fun_l2_n99(x)
+    end
+end
+
+def fun_l1_n980(x)
+    if (x < 1)
+        fun_l2_n352(x)
+    else
+        fun_l2_n394(x)
+    end
+end
+
+def fun_l1_n981(x)
+    if (x < 1)
+        fun_l2_n856(x)
+    else
+        fun_l2_n11(x)
+    end
+end
+
+def fun_l1_n982(x)
+    if (x < 1)
+        fun_l2_n484(x)
+    else
+        fun_l2_n230(x)
+    end
+end
+
+def fun_l1_n983(x)
+    if (x < 1)
+        fun_l2_n609(x)
+    else
+        fun_l2_n882(x)
+    end
+end
+
+def fun_l1_n984(x)
+    if (x < 1)
+        fun_l2_n529(x)
+    else
+        fun_l2_n589(x)
+    end
+end
+
+def fun_l1_n985(x)
+    if (x < 1)
+        fun_l2_n545(x)
+    else
+        fun_l2_n139(x)
+    end
+end
+
+def fun_l1_n986(x)
+    if (x < 1)
+        fun_l2_n679(x)
+    else
+        fun_l2_n938(x)
+    end
+end
+
+def fun_l1_n987(x)
+    if (x < 1)
+        fun_l2_n803(x)
+    else
+        fun_l2_n454(x)
+    end
+end
+
+def fun_l1_n988(x)
+    if (x < 1)
+        fun_l2_n403(x)
+    else
+        fun_l2_n976(x)
+    end
+end
+
+def fun_l1_n989(x)
+    if (x < 1)
+        fun_l2_n364(x)
+    else
+        fun_l2_n96(x)
+    end
+end
+
+def fun_l1_n990(x)
+    if (x < 1)
+        fun_l2_n48(x)
+    else
+        fun_l2_n442(x)
+    end
+end
+
+def fun_l1_n991(x)
+    if (x < 1)
+        fun_l2_n842(x)
+    else
+        fun_l2_n810(x)
+    end
+end
+
+def fun_l1_n992(x)
+    if (x < 1)
+        fun_l2_n237(x)
+    else
+        fun_l2_n145(x)
+    end
+end
+
+def fun_l1_n993(x)
+    if (x < 1)
+        fun_l2_n279(x)
+    else
+        fun_l2_n783(x)
+    end
+end
+
+def fun_l1_n994(x)
+    if (x < 1)
+        fun_l2_n323(x)
+    else
+        fun_l2_n829(x)
+    end
+end
+
+def fun_l1_n995(x)
+    if (x < 1)
+        fun_l2_n904(x)
+    else
+        fun_l2_n738(x)
+    end
+end
+
+def fun_l1_n996(x)
+    if (x < 1)
+        fun_l2_n390(x)
+    else
+        fun_l2_n169(x)
+    end
+end
+
+def fun_l1_n997(x)
+    if (x < 1)
+        fun_l2_n583(x)
+    else
+        fun_l2_n993(x)
+    end
+end
+
+def fun_l1_n998(x)
+    if (x < 1)
+        fun_l2_n752(x)
+    else
+        fun_l2_n240(x)
+    end
+end
+
+def fun_l1_n999(x)
+    if (x < 1)
+        fun_l2_n489(x)
+    else
+        fun_l2_n175(x)
+    end
+end
+
+def fun_l2_n0(x)
+    if (x < 1)
+        fun_l3_n293(x)
+    else
+        fun_l3_n569(x)
+    end
+end
+
+def fun_l2_n1(x)
+    if (x < 1)
+        fun_l3_n310(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n2(x)
+    if (x < 1)
+        fun_l3_n484(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n3(x)
+    if (x < 1)
+        fun_l3_n353(x)
+    else
+        fun_l3_n871(x)
+    end
+end
+
+def fun_l2_n4(x)
+    if (x < 1)
+        fun_l3_n100(x)
+    else
+        fun_l3_n796(x)
+    end
+end
+
+def fun_l2_n5(x)
+    if (x < 1)
+        fun_l3_n547(x)
+    else
+        fun_l3_n663(x)
+    end
+end
+
+def fun_l2_n6(x)
+    if (x < 1)
+        fun_l3_n756(x)
+    else
+        fun_l3_n69(x)
+    end
+end
+
+def fun_l2_n7(x)
+    if (x < 1)
+        fun_l3_n393(x)
+    else
+        fun_l3_n333(x)
+    end
+end
+
+def fun_l2_n8(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n47(x)
+    end
+end
+
+def fun_l2_n9(x)
+    if (x < 1)
+        fun_l3_n969(x)
+    else
+        fun_l3_n772(x)
+    end
+end
+
+def fun_l2_n10(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n62(x)
+    end
+end
+
+def fun_l2_n11(x)
+    if (x < 1)
+        fun_l3_n671(x)
+    else
+        fun_l3_n303(x)
+    end
+end
+
+def fun_l2_n12(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n13(x)
+    if (x < 1)
+        fun_l3_n363(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n14(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n15(x)
+    if (x < 1)
+        fun_l3_n344(x)
+    else
+        fun_l3_n590(x)
+    end
+end
+
+def fun_l2_n16(x)
+    if (x < 1)
+        fun_l3_n759(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n17(x)
+    if (x < 1)
+        fun_l3_n902(x)
+    else
+        fun_l3_n948(x)
+    end
+end
+
+def fun_l2_n18(x)
+    if (x < 1)
+        fun_l3_n407(x)
+    else
+        fun_l3_n743(x)
+    end
+end
+
+def fun_l2_n19(x)
+    if (x < 1)
+        fun_l3_n360(x)
+    else
+        fun_l3_n953(x)
+    end
+end
+
+def fun_l2_n20(x)
+    if (x < 1)
+        fun_l3_n968(x)
+    else
+        fun_l3_n685(x)
+    end
+end
+
+def fun_l2_n21(x)
+    if (x < 1)
+        fun_l3_n964(x)
+    else
+        fun_l3_n210(x)
+    end
+end
+
+def fun_l2_n22(x)
+    if (x < 1)
+        fun_l3_n346(x)
+    else
+        fun_l3_n902(x)
+    end
+end
+
+def fun_l2_n23(x)
+    if (x < 1)
+        fun_l3_n154(x)
+    else
+        fun_l3_n52(x)
+    end
+end
+
+def fun_l2_n24(x)
+    if (x < 1)
+        fun_l3_n229(x)
+    else
+        fun_l3_n137(x)
+    end
+end
+
+def fun_l2_n25(x)
+    if (x < 1)
+        fun_l3_n390(x)
+    else
+        fun_l3_n445(x)
+    end
+end
+
+def fun_l2_n26(x)
+    if (x < 1)
+        fun_l3_n11(x)
+    else
+        fun_l3_n113(x)
+    end
+end
+
+def fun_l2_n27(x)
+    if (x < 1)
+        fun_l3_n756(x)
+    else
+        fun_l3_n935(x)
+    end
+end
+
+def fun_l2_n28(x)
+    if (x < 1)
+        fun_l3_n567(x)
+    else
+        fun_l3_n984(x)
+    end
+end
+
+def fun_l2_n29(x)
+    if (x < 1)
+        fun_l3_n982(x)
+    else
+        fun_l3_n335(x)
+    end
+end
+
+def fun_l2_n30(x)
+    if (x < 1)
+        fun_l3_n78(x)
+    else
+        fun_l3_n571(x)
+    end
+end
+
+def fun_l2_n31(x)
+    if (x < 1)
+        fun_l3_n93(x)
+    else
+        fun_l3_n455(x)
+    end
+end
+
+def fun_l2_n32(x)
+    if (x < 1)
+        fun_l3_n118(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n33(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n0(x)
+    end
+end
+
+def fun_l2_n34(x)
+    if (x < 1)
+        fun_l3_n153(x)
+    else
+        fun_l3_n77(x)
+    end
+end
+
+def fun_l2_n35(x)
+    if (x < 1)
+        fun_l3_n815(x)
+    else
+        fun_l3_n642(x)
+    end
+end
+
+def fun_l2_n36(x)
+    if (x < 1)
+        fun_l3_n503(x)
+    else
+        fun_l3_n428(x)
+    end
+end
+
+def fun_l2_n37(x)
+    if (x < 1)
+        fun_l3_n780(x)
+    else
+        fun_l3_n301(x)
+    end
+end
+
+def fun_l2_n38(x)
+    if (x < 1)
+        fun_l3_n827(x)
+    else
+        fun_l3_n444(x)
+    end
+end
+
+def fun_l2_n39(x)
+    if (x < 1)
+        fun_l3_n808(x)
+    else
+        fun_l3_n76(x)
+    end
+end
+
+def fun_l2_n40(x)
+    if (x < 1)
+        fun_l3_n216(x)
+    else
+        fun_l3_n943(x)
+    end
+end
+
+def fun_l2_n41(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n935(x)
+    end
+end
+
+def fun_l2_n42(x)
+    if (x < 1)
+        fun_l3_n769(x)
+    else
+        fun_l3_n564(x)
+    end
+end
+
+def fun_l2_n43(x)
+    if (x < 1)
+        fun_l3_n108(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n44(x)
+    if (x < 1)
+        fun_l3_n750(x)
+    else
+        fun_l3_n614(x)
+    end
+end
+
+def fun_l2_n45(x)
+    if (x < 1)
+        fun_l3_n497(x)
+    else
+        fun_l3_n584(x)
+    end
+end
+
+def fun_l2_n46(x)
+    if (x < 1)
+        fun_l3_n364(x)
+    else
+        fun_l3_n218(x)
+    end
+end
+
+def fun_l2_n47(x)
+    if (x < 1)
+        fun_l3_n938(x)
+    else
+        fun_l3_n707(x)
+    end
+end
+
+def fun_l2_n48(x)
+    if (x < 1)
+        fun_l3_n14(x)
+    else
+        fun_l3_n178(x)
+    end
+end
+
+def fun_l2_n49(x)
+    if (x < 1)
+        fun_l3_n923(x)
+    else
+        fun_l3_n493(x)
+    end
+end
+
+def fun_l2_n50(x)
+    if (x < 1)
+        fun_l3_n481(x)
+    else
+        fun_l3_n193(x)
+    end
+end
+
+def fun_l2_n51(x)
+    if (x < 1)
+        fun_l3_n876(x)
+    else
+        fun_l3_n59(x)
+    end
+end
+
+def fun_l2_n52(x)
+    if (x < 1)
+        fun_l3_n930(x)
+    else
+        fun_l3_n813(x)
+    end
+end
+
+def fun_l2_n53(x)
+    if (x < 1)
+        fun_l3_n369(x)
+    else
+        fun_l3_n972(x)
+    end
+end
+
+def fun_l2_n54(x)
+    if (x < 1)
+        fun_l3_n95(x)
+    else
+        fun_l3_n573(x)
+    end
+end
+
+def fun_l2_n55(x)
+    if (x < 1)
+        fun_l3_n148(x)
+    else
+        fun_l3_n369(x)
+    end
+end
+
+def fun_l2_n56(x)
+    if (x < 1)
+        fun_l3_n476(x)
+    else
+        fun_l3_n54(x)
+    end
+end
+
+def fun_l2_n57(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n58(x)
+    if (x < 1)
+        fun_l3_n648(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n59(x)
+    if (x < 1)
+        fun_l3_n844(x)
+    else
+        fun_l3_n422(x)
+    end
+end
+
+def fun_l2_n60(x)
+    if (x < 1)
+        fun_l3_n6(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n61(x)
+    if (x < 1)
+        fun_l3_n35(x)
+    else
+        fun_l3_n316(x)
+    end
+end
+
+def fun_l2_n62(x)
+    if (x < 1)
+        fun_l3_n487(x)
+    else
+        fun_l3_n469(x)
+    end
+end
+
+def fun_l2_n63(x)
+    if (x < 1)
+        fun_l3_n272(x)
+    else
+        fun_l3_n909(x)
+    end
+end
+
+def fun_l2_n64(x)
+    if (x < 1)
+        fun_l3_n266(x)
+    else
+        fun_l3_n347(x)
+    end
+end
+
+def fun_l2_n65(x)
+    if (x < 1)
+        fun_l3_n696(x)
+    else
+        fun_l3_n499(x)
+    end
+end
+
+def fun_l2_n66(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n834(x)
+    end
+end
+
+def fun_l2_n67(x)
+    if (x < 1)
+        fun_l3_n966(x)
+    else
+        fun_l3_n454(x)
+    end
+end
+
+def fun_l2_n68(x)
+    if (x < 1)
+        fun_l3_n406(x)
+    else
+        fun_l3_n644(x)
+    end
+end
+
+def fun_l2_n69(x)
+    if (x < 1)
+        fun_l3_n616(x)
+    else
+        fun_l3_n90(x)
+    end
+end
+
+def fun_l2_n70(x)
+    if (x < 1)
+        fun_l3_n158(x)
+    else
+        fun_l3_n910(x)
+    end
+end
+
+def fun_l2_n71(x)
+    if (x < 1)
+        fun_l3_n391(x)
+    else
+        fun_l3_n761(x)
+    end
+end
+
+def fun_l2_n72(x)
+    if (x < 1)
+        fun_l3_n585(x)
+    else
+        fun_l3_n405(x)
+    end
+end
+
+def fun_l2_n73(x)
+    if (x < 1)
+        fun_l3_n227(x)
+    else
+        fun_l3_n583(x)
+    end
+end
+
+def fun_l2_n74(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n110(x)
+    end
+end
+
+def fun_l2_n75(x)
+    if (x < 1)
+        fun_l3_n393(x)
+    else
+        fun_l3_n643(x)
+    end
+end
+
+def fun_l2_n76(x)
+    if (x < 1)
+        fun_l3_n935(x)
+    else
+        fun_l3_n593(x)
+    end
+end
+
+def fun_l2_n77(x)
+    if (x < 1)
+        fun_l3_n239(x)
+    else
+        fun_l3_n704(x)
+    end
+end
+
+def fun_l2_n78(x)
+    if (x < 1)
+        fun_l3_n192(x)
+    else
+        fun_l3_n722(x)
+    end
+end
+
+def fun_l2_n79(x)
+    if (x < 1)
+        fun_l3_n119(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n80(x)
+    if (x < 1)
+        fun_l3_n692(x)
+    else
+        fun_l3_n895(x)
+    end
+end
+
+def fun_l2_n81(x)
+    if (x < 1)
+        fun_l3_n246(x)
+    else
+        fun_l3_n340(x)
+    end
+end
+
+def fun_l2_n82(x)
+    if (x < 1)
+        fun_l3_n368(x)
+    else
+        fun_l3_n255(x)
+    end
+end
+
+def fun_l2_n83(x)
+    if (x < 1)
+        fun_l3_n942(x)
+    else
+        fun_l3_n595(x)
+    end
+end
+
+def fun_l2_n84(x)
+    if (x < 1)
+        fun_l3_n629(x)
+    else
+        fun_l3_n622(x)
+    end
+end
+
+def fun_l2_n85(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n615(x)
+    end
+end
+
+def fun_l2_n86(x)
+    if (x < 1)
+        fun_l3_n295(x)
+    else
+        fun_l3_n809(x)
+    end
+end
+
+def fun_l2_n87(x)
+    if (x < 1)
+        fun_l3_n957(x)
+    else
+        fun_l3_n452(x)
+    end
+end
+
+def fun_l2_n88(x)
+    if (x < 1)
+        fun_l3_n490(x)
+    else
+        fun_l3_n184(x)
+    end
+end
+
+def fun_l2_n89(x)
+    if (x < 1)
+        fun_l3_n483(x)
+    else
+        fun_l3_n963(x)
+    end
+end
+
+def fun_l2_n90(x)
+    if (x < 1)
+        fun_l3_n262(x)
+    else
+        fun_l3_n458(x)
+    end
+end
+
+def fun_l2_n91(x)
+    if (x < 1)
+        fun_l3_n277(x)
+    else
+        fun_l3_n30(x)
+    end
+end
+
+def fun_l2_n92(x)
+    if (x < 1)
+        fun_l3_n310(x)
+    else
+        fun_l3_n215(x)
+    end
+end
+
+def fun_l2_n93(x)
+    if (x < 1)
+        fun_l3_n660(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n94(x)
+    if (x < 1)
+        fun_l3_n761(x)
+    else
+        fun_l3_n10(x)
+    end
+end
+
+def fun_l2_n95(x)
+    if (x < 1)
+        fun_l3_n4(x)
+    else
+        fun_l3_n65(x)
+    end
+end
+
+def fun_l2_n96(x)
+    if (x < 1)
+        fun_l3_n444(x)
+    else
+        fun_l3_n378(x)
+    end
+end
+
+def fun_l2_n97(x)
+    if (x < 1)
+        fun_l3_n119(x)
+    else
+        fun_l3_n96(x)
+    end
+end
+
+def fun_l2_n98(x)
+    if (x < 1)
+        fun_l3_n970(x)
+    else
+        fun_l3_n471(x)
+    end
+end
+
+def fun_l2_n99(x)
+    if (x < 1)
+        fun_l3_n544(x)
+    else
+        fun_l3_n1(x)
+    end
+end
+
+def fun_l2_n100(x)
+    if (x < 1)
+        fun_l3_n253(x)
+    else
+        fun_l3_n332(x)
+    end
+end
+
+def fun_l2_n101(x)
+    if (x < 1)
+        fun_l3_n69(x)
+    else
+        fun_l3_n946(x)
+    end
+end
+
+def fun_l2_n102(x)
+    if (x < 1)
+        fun_l3_n458(x)
+    else
+        fun_l3_n885(x)
+    end
+end
+
+def fun_l2_n103(x)
+    if (x < 1)
+        fun_l3_n732(x)
+    else
+        fun_l3_n601(x)
+    end
+end
+
+def fun_l2_n104(x)
+    if (x < 1)
+        fun_l3_n737(x)
+    else
+        fun_l3_n530(x)
+    end
+end
+
+def fun_l2_n105(x)
+    if (x < 1)
+        fun_l3_n125(x)
+    else
+        fun_l3_n561(x)
+    end
+end
+
+def fun_l2_n106(x)
+    if (x < 1)
+        fun_l3_n717(x)
+    else
+        fun_l3_n660(x)
+    end
+end
+
+def fun_l2_n107(x)
+    if (x < 1)
+        fun_l3_n863(x)
+    else
+        fun_l3_n211(x)
+    end
+end
+
+def fun_l2_n108(x)
+    if (x < 1)
+        fun_l3_n221(x)
+    else
+        fun_l3_n718(x)
+    end
+end
+
+def fun_l2_n109(x)
+    if (x < 1)
+        fun_l3_n100(x)
+    else
+        fun_l3_n673(x)
+    end
+end
+
+def fun_l2_n110(x)
+    if (x < 1)
+        fun_l3_n434(x)
+    else
+        fun_l3_n348(x)
+    end
+end
+
+def fun_l2_n111(x)
+    if (x < 1)
+        fun_l3_n923(x)
+    else
+        fun_l3_n413(x)
+    end
+end
+
+def fun_l2_n112(x)
+    if (x < 1)
+        fun_l3_n253(x)
+    else
+        fun_l3_n461(x)
+    end
+end
+
+def fun_l2_n113(x)
+    if (x < 1)
+        fun_l3_n946(x)
+    else
+        fun_l3_n406(x)
+    end
+end
+
+def fun_l2_n114(x)
+    if (x < 1)
+        fun_l3_n976(x)
+    else
+        fun_l3_n354(x)
+    end
+end
+
+def fun_l2_n115(x)
+    if (x < 1)
+        fun_l3_n205(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n116(x)
+    if (x < 1)
+        fun_l3_n304(x)
+    else
+        fun_l3_n145(x)
+    end
+end
+
+def fun_l2_n117(x)
+    if (x < 1)
+        fun_l3_n917(x)
+    else
+        fun_l3_n276(x)
+    end
+end
+
+def fun_l2_n118(x)
+    if (x < 1)
+        fun_l3_n880(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n119(x)
+    if (x < 1)
+        fun_l3_n39(x)
+    else
+        fun_l3_n549(x)
+    end
+end
+
+def fun_l2_n120(x)
+    if (x < 1)
+        fun_l3_n325(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n121(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n259(x)
+    end
+end
+
+def fun_l2_n122(x)
+    if (x < 1)
+        fun_l3_n572(x)
+    else
+        fun_l3_n747(x)
+    end
+end
+
+def fun_l2_n123(x)
+    if (x < 1)
+        fun_l3_n639(x)
+    else
+        fun_l3_n810(x)
+    end
+end
+
+def fun_l2_n124(x)
+    if (x < 1)
+        fun_l3_n954(x)
+    else
+        fun_l3_n814(x)
+    end
+end
+
+def fun_l2_n125(x)
+    if (x < 1)
+        fun_l3_n932(x)
+    else
+        fun_l3_n275(x)
+    end
+end
+
+def fun_l2_n126(x)
+    if (x < 1)
+        fun_l3_n472(x)
+    else
+        fun_l3_n184(x)
+    end
+end
+
+def fun_l2_n127(x)
+    if (x < 1)
+        fun_l3_n725(x)
+    else
+        fun_l3_n497(x)
+    end
+end
+
+def fun_l2_n128(x)
+    if (x < 1)
+        fun_l3_n94(x)
+    else
+        fun_l3_n801(x)
+    end
+end
+
+def fun_l2_n129(x)
+    if (x < 1)
+        fun_l3_n476(x)
+    else
+        fun_l3_n936(x)
+    end
+end
+
+def fun_l2_n130(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n738(x)
+    end
+end
+
+def fun_l2_n131(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n401(x)
+    end
+end
+
+def fun_l2_n132(x)
+    if (x < 1)
+        fun_l3_n459(x)
+    else
+        fun_l3_n998(x)
+    end
+end
+
+def fun_l2_n133(x)
+    if (x < 1)
+        fun_l3_n158(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n134(x)
+    if (x < 1)
+        fun_l3_n47(x)
+    else
+        fun_l3_n104(x)
+    end
+end
+
+def fun_l2_n135(x)
+    if (x < 1)
+        fun_l3_n154(x)
+    else
+        fun_l3_n239(x)
+    end
+end
+
+def fun_l2_n136(x)
+    if (x < 1)
+        fun_l3_n634(x)
+    else
+        fun_l3_n718(x)
+    end
+end
+
+def fun_l2_n137(x)
+    if (x < 1)
+        fun_l3_n867(x)
+    else
+        fun_l3_n578(x)
+    end
+end
+
+def fun_l2_n138(x)
+    if (x < 1)
+        fun_l3_n905(x)
+    else
+        fun_l3_n434(x)
+    end
+end
+
+def fun_l2_n139(x)
+    if (x < 1)
+        fun_l3_n596(x)
+    else
+        fun_l3_n516(x)
+    end
+end
+
+def fun_l2_n140(x)
+    if (x < 1)
+        fun_l3_n150(x)
+    else
+        fun_l3_n901(x)
+    end
+end
+
+def fun_l2_n141(x)
+    if (x < 1)
+        fun_l3_n792(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n142(x)
+    if (x < 1)
+        fun_l3_n539(x)
+    else
+        fun_l3_n206(x)
+    end
+end
+
+def fun_l2_n143(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n788(x)
+    end
+end
+
+def fun_l2_n144(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n868(x)
+    end
+end
+
+def fun_l2_n145(x)
+    if (x < 1)
+        fun_l3_n869(x)
+    else
+        fun_l3_n865(x)
+    end
+end
+
+def fun_l2_n146(x)
+    if (x < 1)
+        fun_l3_n574(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n147(x)
+    if (x < 1)
+        fun_l3_n876(x)
+    else
+        fun_l3_n658(x)
+    end
+end
+
+def fun_l2_n148(x)
+    if (x < 1)
+        fun_l3_n582(x)
+    else
+        fun_l3_n694(x)
+    end
+end
+
+def fun_l2_n149(x)
+    if (x < 1)
+        fun_l3_n137(x)
+    else
+        fun_l3_n187(x)
+    end
+end
+
+def fun_l2_n150(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n666(x)
+    end
+end
+
+def fun_l2_n151(x)
+    if (x < 1)
+        fun_l3_n264(x)
+    else
+        fun_l3_n236(x)
+    end
+end
+
+def fun_l2_n152(x)
+    if (x < 1)
+        fun_l3_n984(x)
+    else
+        fun_l3_n469(x)
+    end
+end
+
+def fun_l2_n153(x)
+    if (x < 1)
+        fun_l3_n152(x)
+    else
+        fun_l3_n578(x)
+    end
+end
+
+def fun_l2_n154(x)
+    if (x < 1)
+        fun_l3_n452(x)
+    else
+        fun_l3_n807(x)
+    end
+end
+
+def fun_l2_n155(x)
+    if (x < 1)
+        fun_l3_n82(x)
+    else
+        fun_l3_n589(x)
+    end
+end
+
+def fun_l2_n156(x)
+    if (x < 1)
+        fun_l3_n356(x)
+    else
+        fun_l3_n454(x)
+    end
+end
+
+def fun_l2_n157(x)
+    if (x < 1)
+        fun_l3_n814(x)
+    else
+        fun_l3_n376(x)
+    end
+end
+
+def fun_l2_n158(x)
+    if (x < 1)
+        fun_l3_n755(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n159(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n571(x)
+    end
+end
+
+def fun_l2_n160(x)
+    if (x < 1)
+        fun_l3_n919(x)
+    else
+        fun_l3_n771(x)
+    end
+end
+
+def fun_l2_n161(x)
+    if (x < 1)
+        fun_l3_n147(x)
+    else
+        fun_l3_n936(x)
+    end
+end
+
+def fun_l2_n162(x)
+    if (x < 1)
+        fun_l3_n638(x)
+    else
+        fun_l3_n23(x)
+    end
+end
+
+def fun_l2_n163(x)
+    if (x < 1)
+        fun_l3_n349(x)
+    else
+        fun_l3_n46(x)
+    end
+end
+
+def fun_l2_n164(x)
+    if (x < 1)
+        fun_l3_n55(x)
+    else
+        fun_l3_n795(x)
+    end
+end
+
+def fun_l2_n165(x)
+    if (x < 1)
+        fun_l3_n131(x)
+    else
+        fun_l3_n233(x)
+    end
+end
+
+def fun_l2_n166(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n215(x)
+    end
+end
+
+def fun_l2_n167(x)
+    if (x < 1)
+        fun_l3_n244(x)
+    else
+        fun_l3_n641(x)
+    end
+end
+
+def fun_l2_n168(x)
+    if (x < 1)
+        fun_l3_n744(x)
+    else
+        fun_l3_n337(x)
+    end
+end
+
+def fun_l2_n169(x)
+    if (x < 1)
+        fun_l3_n760(x)
+    else
+        fun_l3_n82(x)
+    end
+end
+
+def fun_l2_n170(x)
+    if (x < 1)
+        fun_l3_n877(x)
+    else
+        fun_l3_n566(x)
+    end
+end
+
+def fun_l2_n171(x)
+    if (x < 1)
+        fun_l3_n211(x)
+    else
+        fun_l3_n101(x)
+    end
+end
+
+def fun_l2_n172(x)
+    if (x < 1)
+        fun_l3_n143(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n173(x)
+    if (x < 1)
+        fun_l3_n210(x)
+    else
+        fun_l3_n150(x)
+    end
+end
+
+def fun_l2_n174(x)
+    if (x < 1)
+        fun_l3_n772(x)
+    else
+        fun_l3_n42(x)
+    end
+end
+
+def fun_l2_n175(x)
+    if (x < 1)
+        fun_l3_n482(x)
+    else
+        fun_l3_n606(x)
+    end
+end
+
+def fun_l2_n176(x)
+    if (x < 1)
+        fun_l3_n68(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n177(x)
+    if (x < 1)
+        fun_l3_n313(x)
+    else
+        fun_l3_n947(x)
+    end
+end
+
+def fun_l2_n178(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n812(x)
+    end
+end
+
+def fun_l2_n179(x)
+    if (x < 1)
+        fun_l3_n741(x)
+    else
+        fun_l3_n994(x)
+    end
+end
+
+def fun_l2_n180(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n335(x)
+    end
+end
+
+def fun_l2_n181(x)
+    if (x < 1)
+        fun_l3_n994(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n182(x)
+    if (x < 1)
+        fun_l3_n528(x)
+    else
+        fun_l3_n272(x)
+    end
+end
+
+def fun_l2_n183(x)
+    if (x < 1)
+        fun_l3_n649(x)
+    else
+        fun_l3_n200(x)
+    end
+end
+
+def fun_l2_n184(x)
+    if (x < 1)
+        fun_l3_n105(x)
+    else
+        fun_l3_n897(x)
+    end
+end
+
+def fun_l2_n185(x)
+    if (x < 1)
+        fun_l3_n980(x)
+    else
+        fun_l3_n651(x)
+    end
+end
+
+def fun_l2_n186(x)
+    if (x < 1)
+        fun_l3_n835(x)
+    else
+        fun_l3_n388(x)
+    end
+end
+
+def fun_l2_n187(x)
+    if (x < 1)
+        fun_l3_n769(x)
+    else
+        fun_l3_n162(x)
+    end
+end
+
+def fun_l2_n188(x)
+    if (x < 1)
+        fun_l3_n934(x)
+    else
+        fun_l3_n874(x)
+    end
+end
+
+def fun_l2_n189(x)
+    if (x < 1)
+        fun_l3_n407(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n190(x)
+    if (x < 1)
+        fun_l3_n594(x)
+    else
+        fun_l3_n929(x)
+    end
+end
+
+def fun_l2_n191(x)
+    if (x < 1)
+        fun_l3_n303(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n192(x)
+    if (x < 1)
+        fun_l3_n768(x)
+    else
+        fun_l3_n226(x)
+    end
+end
+
+def fun_l2_n193(x)
+    if (x < 1)
+        fun_l3_n618(x)
+    else
+        fun_l3_n821(x)
+    end
+end
+
+def fun_l2_n194(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n969(x)
+    end
+end
+
+def fun_l2_n195(x)
+    if (x < 1)
+        fun_l3_n574(x)
+    else
+        fun_l3_n344(x)
+    end
+end
+
+def fun_l2_n196(x)
+    if (x < 1)
+        fun_l3_n943(x)
+    else
+        fun_l3_n304(x)
+    end
+end
+
+def fun_l2_n197(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n198(x)
+    if (x < 1)
+        fun_l3_n597(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n199(x)
+    if (x < 1)
+        fun_l3_n517(x)
+    else
+        fun_l3_n34(x)
+    end
+end
+
+def fun_l2_n200(x)
+    if (x < 1)
+        fun_l3_n980(x)
+    else
+        fun_l3_n672(x)
+    end
+end
+
+def fun_l2_n201(x)
+    if (x < 1)
+        fun_l3_n510(x)
+    else
+        fun_l3_n804(x)
+    end
+end
+
+def fun_l2_n202(x)
+    if (x < 1)
+        fun_l3_n735(x)
+    else
+        fun_l3_n367(x)
+    end
+end
+
+def fun_l2_n203(x)
+    if (x < 1)
+        fun_l3_n546(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n204(x)
+    if (x < 1)
+        fun_l3_n189(x)
+    else
+        fun_l3_n639(x)
+    end
+end
+
+def fun_l2_n205(x)
+    if (x < 1)
+        fun_l3_n396(x)
+    else
+        fun_l3_n862(x)
+    end
+end
+
+def fun_l2_n206(x)
+    if (x < 1)
+        fun_l3_n679(x)
+    else
+        fun_l3_n881(x)
+    end
+end
+
+def fun_l2_n207(x)
+    if (x < 1)
+        fun_l3_n342(x)
+    else
+        fun_l3_n522(x)
+    end
+end
+
+def fun_l2_n208(x)
+    if (x < 1)
+        fun_l3_n173(x)
+    else
+        fun_l3_n323(x)
+    end
+end
+
+def fun_l2_n209(x)
+    if (x < 1)
+        fun_l3_n693(x)
+    else
+        fun_l3_n160(x)
+    end
+end
+
+def fun_l2_n210(x)
+    if (x < 1)
+        fun_l3_n827(x)
+    else
+        fun_l3_n580(x)
+    end
+end
+
+def fun_l2_n211(x)
+    if (x < 1)
+        fun_l3_n213(x)
+    else
+        fun_l3_n100(x)
+    end
+end
+
+def fun_l2_n212(x)
+    if (x < 1)
+        fun_l3_n915(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n213(x)
+    if (x < 1)
+        fun_l3_n260(x)
+    else
+        fun_l3_n279(x)
+    end
+end
+
+def fun_l2_n214(x)
+    if (x < 1)
+        fun_l3_n468(x)
+    else
+        fun_l3_n257(x)
+    end
+end
+
+def fun_l2_n215(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n740(x)
+    end
+end
+
+def fun_l2_n216(x)
+    if (x < 1)
+        fun_l3_n291(x)
+    else
+        fun_l3_n625(x)
+    end
+end
+
+def fun_l2_n217(x)
+    if (x < 1)
+        fun_l3_n493(x)
+    else
+        fun_l3_n726(x)
+    end
+end
+
+def fun_l2_n218(x)
+    if (x < 1)
+        fun_l3_n714(x)
+    else
+        fun_l3_n793(x)
+    end
+end
+
+def fun_l2_n219(x)
+    if (x < 1)
+        fun_l3_n683(x)
+    else
+        fun_l3_n715(x)
+    end
+end
+
+def fun_l2_n220(x)
+    if (x < 1)
+        fun_l3_n249(x)
+    else
+        fun_l3_n266(x)
+    end
+end
+
+def fun_l2_n221(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n22(x)
+    end
+end
+
+def fun_l2_n222(x)
+    if (x < 1)
+        fun_l3_n978(x)
+    else
+        fun_l3_n885(x)
+    end
+end
+
+def fun_l2_n223(x)
+    if (x < 1)
+        fun_l3_n821(x)
+    else
+        fun_l3_n412(x)
+    end
+end
+
+def fun_l2_n224(x)
+    if (x < 1)
+        fun_l3_n636(x)
+    else
+        fun_l3_n641(x)
+    end
+end
+
+def fun_l2_n225(x)
+    if (x < 1)
+        fun_l3_n971(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n226(x)
+    if (x < 1)
+        fun_l3_n429(x)
+    else
+        fun_l3_n323(x)
+    end
+end
+
+def fun_l2_n227(x)
+    if (x < 1)
+        fun_l3_n909(x)
+    else
+        fun_l3_n267(x)
+    end
+end
+
+def fun_l2_n228(x)
+    if (x < 1)
+        fun_l3_n437(x)
+    else
+        fun_l3_n985(x)
+    end
+end
+
+def fun_l2_n229(x)
+    if (x < 1)
+        fun_l3_n131(x)
+    else
+        fun_l3_n298(x)
+    end
+end
+
+def fun_l2_n230(x)
+    if (x < 1)
+        fun_l3_n865(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n231(x)
+    if (x < 1)
+        fun_l3_n772(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n232(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n422(x)
+    end
+end
+
+def fun_l2_n233(x)
+    if (x < 1)
+        fun_l3_n82(x)
+    else
+        fun_l3_n32(x)
+    end
+end
+
+def fun_l2_n234(x)
+    if (x < 1)
+        fun_l3_n25(x)
+    else
+        fun_l3_n518(x)
+    end
+end
+
+def fun_l2_n235(x)
+    if (x < 1)
+        fun_l3_n313(x)
+    else
+        fun_l3_n179(x)
+    end
+end
+
+def fun_l2_n236(x)
+    if (x < 1)
+        fun_l3_n819(x)
+    else
+        fun_l3_n586(x)
+    end
+end
+
+def fun_l2_n237(x)
+    if (x < 1)
+        fun_l3_n398(x)
+    else
+        fun_l3_n921(x)
+    end
+end
+
+def fun_l2_n238(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n795(x)
+    end
+end
+
+def fun_l2_n239(x)
+    if (x < 1)
+        fun_l3_n862(x)
+    else
+        fun_l3_n222(x)
+    end
+end
+
+def fun_l2_n240(x)
+    if (x < 1)
+        fun_l3_n968(x)
+    else
+        fun_l3_n320(x)
+    end
+end
+
+def fun_l2_n241(x)
+    if (x < 1)
+        fun_l3_n559(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n242(x)
+    if (x < 1)
+        fun_l3_n647(x)
+    else
+        fun_l3_n232(x)
+    end
+end
+
+def fun_l2_n243(x)
+    if (x < 1)
+        fun_l3_n425(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n244(x)
+    if (x < 1)
+        fun_l3_n752(x)
+    else
+        fun_l3_n690(x)
+    end
+end
+
+def fun_l2_n245(x)
+    if (x < 1)
+        fun_l3_n382(x)
+    else
+        fun_l3_n817(x)
+    end
+end
+
+def fun_l2_n246(x)
+    if (x < 1)
+        fun_l3_n880(x)
+    else
+        fun_l3_n380(x)
+    end
+end
+
+def fun_l2_n247(x)
+    if (x < 1)
+        fun_l3_n444(x)
+    else
+        fun_l3_n75(x)
+    end
+end
+
+def fun_l2_n248(x)
+    if (x < 1)
+        fun_l3_n368(x)
+    else
+        fun_l3_n314(x)
+    end
+end
+
+def fun_l2_n249(x)
+    if (x < 1)
+        fun_l3_n131(x)
+    else
+        fun_l3_n398(x)
+    end
+end
+
+def fun_l2_n250(x)
+    if (x < 1)
+        fun_l3_n376(x)
+    else
+        fun_l3_n449(x)
+    end
+end
+
+def fun_l2_n251(x)
+    if (x < 1)
+        fun_l3_n404(x)
+    else
+        fun_l3_n301(x)
+    end
+end
+
+def fun_l2_n252(x)
+    if (x < 1)
+        fun_l3_n274(x)
+    else
+        fun_l3_n430(x)
+    end
+end
+
+def fun_l2_n253(x)
+    if (x < 1)
+        fun_l3_n734(x)
+    else
+        fun_l3_n255(x)
+    end
+end
+
+def fun_l2_n254(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n944(x)
+    end
+end
+
+def fun_l2_n255(x)
+    if (x < 1)
+        fun_l3_n978(x)
+    else
+        fun_l3_n898(x)
+    end
+end
+
+def fun_l2_n256(x)
+    if (x < 1)
+        fun_l3_n175(x)
+    else
+        fun_l3_n477(x)
+    end
+end
+
+def fun_l2_n257(x)
+    if (x < 1)
+        fun_l3_n84(x)
+    else
+        fun_l3_n772(x)
+    end
+end
+
+def fun_l2_n258(x)
+    if (x < 1)
+        fun_l3_n605(x)
+    else
+        fun_l3_n144(x)
+    end
+end
+
+def fun_l2_n259(x)
+    if (x < 1)
+        fun_l3_n51(x)
+    else
+        fun_l3_n542(x)
+    end
+end
+
+def fun_l2_n260(x)
+    if (x < 1)
+        fun_l3_n940(x)
+    else
+        fun_l3_n316(x)
+    end
+end
+
+def fun_l2_n261(x)
+    if (x < 1)
+        fun_l3_n702(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n262(x)
+    if (x < 1)
+        fun_l3_n164(x)
+    else
+        fun_l3_n21(x)
+    end
+end
+
+def fun_l2_n263(x)
+    if (x < 1)
+        fun_l3_n432(x)
+    else
+        fun_l3_n496(x)
+    end
+end
+
+def fun_l2_n264(x)
+    if (x < 1)
+        fun_l3_n265(x)
+    else
+        fun_l3_n40(x)
+    end
+end
+
+def fun_l2_n265(x)
+    if (x < 1)
+        fun_l3_n951(x)
+    else
+        fun_l3_n723(x)
+    end
+end
+
+def fun_l2_n266(x)
+    if (x < 1)
+        fun_l3_n279(x)
+    else
+        fun_l3_n167(x)
+    end
+end
+
+def fun_l2_n267(x)
+    if (x < 1)
+        fun_l3_n51(x)
+    else
+        fun_l3_n283(x)
+    end
+end
+
+def fun_l2_n268(x)
+    if (x < 1)
+        fun_l3_n389(x)
+    else
+        fun_l3_n264(x)
+    end
+end
+
+def fun_l2_n269(x)
+    if (x < 1)
+        fun_l3_n68(x)
+    else
+        fun_l3_n484(x)
+    end
+end
+
+def fun_l2_n270(x)
+    if (x < 1)
+        fun_l3_n435(x)
+    else
+        fun_l3_n204(x)
+    end
+end
+
+def fun_l2_n271(x)
+    if (x < 1)
+        fun_l3_n717(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n272(x)
+    if (x < 1)
+        fun_l3_n901(x)
+    else
+        fun_l3_n332(x)
+    end
+end
+
+def fun_l2_n273(x)
+    if (x < 1)
+        fun_l3_n358(x)
+    else
+        fun_l3_n608(x)
+    end
+end
+
+def fun_l2_n274(x)
+    if (x < 1)
+        fun_l3_n885(x)
+    else
+        fun_l3_n490(x)
+    end
+end
+
+def fun_l2_n275(x)
+    if (x < 1)
+        fun_l3_n82(x)
+    else
+        fun_l3_n87(x)
+    end
+end
+
+def fun_l2_n276(x)
+    if (x < 1)
+        fun_l3_n698(x)
+    else
+        fun_l3_n846(x)
+    end
+end
+
+def fun_l2_n277(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n457(x)
+    end
+end
+
+def fun_l2_n278(x)
+    if (x < 1)
+        fun_l3_n925(x)
+    else
+        fun_l3_n674(x)
+    end
+end
+
+def fun_l2_n279(x)
+    if (x < 1)
+        fun_l3_n797(x)
+    else
+        fun_l3_n315(x)
+    end
+end
+
+def fun_l2_n280(x)
+    if (x < 1)
+        fun_l3_n73(x)
+    else
+        fun_l3_n2(x)
+    end
+end
+
+def fun_l2_n281(x)
+    if (x < 1)
+        fun_l3_n301(x)
+    else
+        fun_l3_n315(x)
+    end
+end
+
+def fun_l2_n282(x)
+    if (x < 1)
+        fun_l3_n473(x)
+    else
+        fun_l3_n639(x)
+    end
+end
+
+def fun_l2_n283(x)
+    if (x < 1)
+        fun_l3_n812(x)
+    else
+        fun_l3_n241(x)
+    end
+end
+
+def fun_l2_n284(x)
+    if (x < 1)
+        fun_l3_n0(x)
+    else
+        fun_l3_n445(x)
+    end
+end
+
+def fun_l2_n285(x)
+    if (x < 1)
+        fun_l3_n587(x)
+    else
+        fun_l3_n806(x)
+    end
+end
+
+def fun_l2_n286(x)
+    if (x < 1)
+        fun_l3_n169(x)
+    else
+        fun_l3_n546(x)
+    end
+end
+
+def fun_l2_n287(x)
+    if (x < 1)
+        fun_l3_n623(x)
+    else
+        fun_l3_n677(x)
+    end
+end
+
+def fun_l2_n288(x)
+    if (x < 1)
+        fun_l3_n804(x)
+    else
+        fun_l3_n80(x)
+    end
+end
+
+def fun_l2_n289(x)
+    if (x < 1)
+        fun_l3_n812(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n290(x)
+    if (x < 1)
+        fun_l3_n551(x)
+    else
+        fun_l3_n896(x)
+    end
+end
+
+def fun_l2_n291(x)
+    if (x < 1)
+        fun_l3_n686(x)
+    else
+        fun_l3_n884(x)
+    end
+end
+
+def fun_l2_n292(x)
+    if (x < 1)
+        fun_l3_n427(x)
+    else
+        fun_l3_n251(x)
+    end
+end
+
+def fun_l2_n293(x)
+    if (x < 1)
+        fun_l3_n375(x)
+    else
+        fun_l3_n309(x)
+    end
+end
+
+def fun_l2_n294(x)
+    if (x < 1)
+        fun_l3_n371(x)
+    else
+        fun_l3_n184(x)
+    end
+end
+
+def fun_l2_n295(x)
+    if (x < 1)
+        fun_l3_n332(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n296(x)
+    if (x < 1)
+        fun_l3_n333(x)
+    else
+        fun_l3_n254(x)
+    end
+end
+
+def fun_l2_n297(x)
+    if (x < 1)
+        fun_l3_n24(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n298(x)
+    if (x < 1)
+        fun_l3_n96(x)
+    else
+        fun_l3_n653(x)
+    end
+end
+
+def fun_l2_n299(x)
+    if (x < 1)
+        fun_l3_n920(x)
+    else
+        fun_l3_n475(x)
+    end
+end
+
+def fun_l2_n300(x)
+    if (x < 1)
+        fun_l3_n337(x)
+    else
+        fun_l3_n378(x)
+    end
+end
+
+def fun_l2_n301(x)
+    if (x < 1)
+        fun_l3_n778(x)
+    else
+        fun_l3_n216(x)
+    end
+end
+
+def fun_l2_n302(x)
+    if (x < 1)
+        fun_l3_n366(x)
+    else
+        fun_l3_n562(x)
+    end
+end
+
+def fun_l2_n303(x)
+    if (x < 1)
+        fun_l3_n656(x)
+    else
+        fun_l3_n779(x)
+    end
+end
+
+def fun_l2_n304(x)
+    if (x < 1)
+        fun_l3_n526(x)
+    else
+        fun_l3_n783(x)
+    end
+end
+
+def fun_l2_n305(x)
+    if (x < 1)
+        fun_l3_n500(x)
+    else
+        fun_l3_n744(x)
+    end
+end
+
+def fun_l2_n306(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n307(x)
+    if (x < 1)
+        fun_l3_n385(x)
+    else
+        fun_l3_n937(x)
+    end
+end
+
+def fun_l2_n308(x)
+    if (x < 1)
+        fun_l3_n742(x)
+    else
+        fun_l3_n984(x)
+    end
+end
+
+def fun_l2_n309(x)
+    if (x < 1)
+        fun_l3_n388(x)
+    else
+        fun_l3_n704(x)
+    end
+end
+
+def fun_l2_n310(x)
+    if (x < 1)
+        fun_l3_n252(x)
+    else
+        fun_l3_n585(x)
+    end
+end
+
+def fun_l2_n311(x)
+    if (x < 1)
+        fun_l3_n121(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n312(x)
+    if (x < 1)
+        fun_l3_n657(x)
+    else
+        fun_l3_n338(x)
+    end
+end
+
+def fun_l2_n313(x)
+    if (x < 1)
+        fun_l3_n115(x)
+    else
+        fun_l3_n748(x)
+    end
+end
+
+def fun_l2_n314(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n319(x)
+    end
+end
+
+def fun_l2_n315(x)
+    if (x < 1)
+        fun_l3_n684(x)
+    else
+        fun_l3_n428(x)
+    end
+end
+
+def fun_l2_n316(x)
+    if (x < 1)
+        fun_l3_n416(x)
+    else
+        fun_l3_n499(x)
+    end
+end
+
+def fun_l2_n317(x)
+    if (x < 1)
+        fun_l3_n305(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n318(x)
+    if (x < 1)
+        fun_l3_n506(x)
+    else
+        fun_l3_n579(x)
+    end
+end
+
+def fun_l2_n319(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n459(x)
+    end
+end
+
+def fun_l2_n320(x)
+    if (x < 1)
+        fun_l3_n278(x)
+    else
+        fun_l3_n89(x)
+    end
+end
+
+def fun_l2_n321(x)
+    if (x < 1)
+        fun_l3_n319(x)
+    else
+        fun_l3_n903(x)
+    end
+end
+
+def fun_l2_n322(x)
+    if (x < 1)
+        fun_l3_n96(x)
+    else
+        fun_l3_n334(x)
+    end
+end
+
+def fun_l2_n323(x)
+    if (x < 1)
+        fun_l3_n913(x)
+    else
+        fun_l3_n309(x)
+    end
+end
+
+def fun_l2_n324(x)
+    if (x < 1)
+        fun_l3_n186(x)
+    else
+        fun_l3_n453(x)
+    end
+end
+
+def fun_l2_n325(x)
+    if (x < 1)
+        fun_l3_n223(x)
+    else
+        fun_l3_n761(x)
+    end
+end
+
+def fun_l2_n326(x)
+    if (x < 1)
+        fun_l3_n757(x)
+    else
+        fun_l3_n700(x)
+    end
+end
+
+def fun_l2_n327(x)
+    if (x < 1)
+        fun_l3_n316(x)
+    else
+        fun_l3_n3(x)
+    end
+end
+
+def fun_l2_n328(x)
+    if (x < 1)
+        fun_l3_n680(x)
+    else
+        fun_l3_n275(x)
+    end
+end
+
+def fun_l2_n329(x)
+    if (x < 1)
+        fun_l3_n731(x)
+    else
+        fun_l3_n971(x)
+    end
+end
+
+def fun_l2_n330(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n389(x)
+    end
+end
+
+def fun_l2_n331(x)
+    if (x < 1)
+        fun_l3_n947(x)
+    else
+        fun_l3_n778(x)
+    end
+end
+
+def fun_l2_n332(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n478(x)
+    end
+end
+
+def fun_l2_n333(x)
+    if (x < 1)
+        fun_l3_n778(x)
+    else
+        fun_l3_n894(x)
+    end
+end
+
+def fun_l2_n334(x)
+    if (x < 1)
+        fun_l3_n198(x)
+    else
+        fun_l3_n830(x)
+    end
+end
+
+def fun_l2_n335(x)
+    if (x < 1)
+        fun_l3_n874(x)
+    else
+        fun_l3_n861(x)
+    end
+end
+
+def fun_l2_n336(x)
+    if (x < 1)
+        fun_l3_n66(x)
+    else
+        fun_l3_n47(x)
+    end
+end
+
+def fun_l2_n337(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n849(x)
+    end
+end
+
+def fun_l2_n338(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n891(x)
+    end
+end
+
+def fun_l2_n339(x)
+    if (x < 1)
+        fun_l3_n377(x)
+    else
+        fun_l3_n862(x)
+    end
+end
+
+def fun_l2_n340(x)
+    if (x < 1)
+        fun_l3_n278(x)
+    else
+        fun_l3_n495(x)
+    end
+end
+
+def fun_l2_n341(x)
+    if (x < 1)
+        fun_l3_n396(x)
+    else
+        fun_l3_n842(x)
+    end
+end
+
+def fun_l2_n342(x)
+    if (x < 1)
+        fun_l3_n971(x)
+    else
+        fun_l3_n296(x)
+    end
+end
+
+def fun_l2_n343(x)
+    if (x < 1)
+        fun_l3_n137(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n344(x)
+    if (x < 1)
+        fun_l3_n910(x)
+    else
+        fun_l3_n515(x)
+    end
+end
+
+def fun_l2_n345(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n766(x)
+    end
+end
+
+def fun_l2_n346(x)
+    if (x < 1)
+        fun_l3_n816(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n347(x)
+    if (x < 1)
+        fun_l3_n223(x)
+    else
+        fun_l3_n776(x)
+    end
+end
+
+def fun_l2_n348(x)
+    if (x < 1)
+        fun_l3_n316(x)
+    else
+        fun_l3_n497(x)
+    end
+end
+
+def fun_l2_n349(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n536(x)
+    end
+end
+
+def fun_l2_n350(x)
+    if (x < 1)
+        fun_l3_n252(x)
+    else
+        fun_l3_n981(x)
+    end
+end
+
+def fun_l2_n351(x)
+    if (x < 1)
+        fun_l3_n783(x)
+    else
+        fun_l3_n596(x)
+    end
+end
+
+def fun_l2_n352(x)
+    if (x < 1)
+        fun_l3_n72(x)
+    else
+        fun_l3_n978(x)
+    end
+end
+
+def fun_l2_n353(x)
+    if (x < 1)
+        fun_l3_n910(x)
+    else
+        fun_l3_n493(x)
+    end
+end
+
+def fun_l2_n354(x)
+    if (x < 1)
+        fun_l3_n671(x)
+    else
+        fun_l3_n297(x)
+    end
+end
+
+def fun_l2_n355(x)
+    if (x < 1)
+        fun_l3_n820(x)
+    else
+        fun_l3_n456(x)
+    end
+end
+
+def fun_l2_n356(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n760(x)
+    end
+end
+
+def fun_l2_n357(x)
+    if (x < 1)
+        fun_l3_n676(x)
+    else
+        fun_l3_n531(x)
+    end
+end
+
+def fun_l2_n358(x)
+    if (x < 1)
+        fun_l3_n849(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n359(x)
+    if (x < 1)
+        fun_l3_n492(x)
+    else
+        fun_l3_n845(x)
+    end
+end
+
+def fun_l2_n360(x)
+    if (x < 1)
+        fun_l3_n58(x)
+    else
+        fun_l3_n896(x)
+    end
+end
+
+def fun_l2_n361(x)
+    if (x < 1)
+        fun_l3_n427(x)
+    else
+        fun_l3_n434(x)
+    end
+end
+
+def fun_l2_n362(x)
+    if (x < 1)
+        fun_l3_n129(x)
+    else
+        fun_l3_n582(x)
+    end
+end
+
+def fun_l2_n363(x)
+    if (x < 1)
+        fun_l3_n901(x)
+    else
+        fun_l3_n405(x)
+    end
+end
+
+def fun_l2_n364(x)
+    if (x < 1)
+        fun_l3_n577(x)
+    else
+        fun_l3_n550(x)
+    end
+end
+
+def fun_l2_n365(x)
+    if (x < 1)
+        fun_l3_n717(x)
+    else
+        fun_l3_n660(x)
+    end
+end
+
+def fun_l2_n366(x)
+    if (x < 1)
+        fun_l3_n605(x)
+    else
+        fun_l3_n755(x)
+    end
+end
+
+def fun_l2_n367(x)
+    if (x < 1)
+        fun_l3_n875(x)
+    else
+        fun_l3_n784(x)
+    end
+end
+
+def fun_l2_n368(x)
+    if (x < 1)
+        fun_l3_n914(x)
+    else
+        fun_l3_n351(x)
+    end
+end
+
+def fun_l2_n369(x)
+    if (x < 1)
+        fun_l3_n684(x)
+    else
+        fun_l3_n932(x)
+    end
+end
+
+def fun_l2_n370(x)
+    if (x < 1)
+        fun_l3_n796(x)
+    else
+        fun_l3_n920(x)
+    end
+end
+
+def fun_l2_n371(x)
+    if (x < 1)
+        fun_l3_n456(x)
+    else
+        fun_l3_n188(x)
+    end
+end
+
+def fun_l2_n372(x)
+    if (x < 1)
+        fun_l3_n891(x)
+    else
+        fun_l3_n905(x)
+    end
+end
+
+def fun_l2_n373(x)
+    if (x < 1)
+        fun_l3_n906(x)
+    else
+        fun_l3_n993(x)
+    end
+end
+
+def fun_l2_n374(x)
+    if (x < 1)
+        fun_l3_n811(x)
+    else
+        fun_l3_n629(x)
+    end
+end
+
+def fun_l2_n375(x)
+    if (x < 1)
+        fun_l3_n5(x)
+    else
+        fun_l3_n304(x)
+    end
+end
+
+def fun_l2_n376(x)
+    if (x < 1)
+        fun_l3_n240(x)
+    else
+        fun_l3_n859(x)
+    end
+end
+
+def fun_l2_n377(x)
+    if (x < 1)
+        fun_l3_n346(x)
+    else
+        fun_l3_n196(x)
+    end
+end
+
+def fun_l2_n378(x)
+    if (x < 1)
+        fun_l3_n918(x)
+    else
+        fun_l3_n371(x)
+    end
+end
+
+def fun_l2_n379(x)
+    if (x < 1)
+        fun_l3_n112(x)
+    else
+        fun_l3_n269(x)
+    end
+end
+
+def fun_l2_n380(x)
+    if (x < 1)
+        fun_l3_n46(x)
+    else
+        fun_l3_n397(x)
+    end
+end
+
+def fun_l2_n381(x)
+    if (x < 1)
+        fun_l3_n977(x)
+    else
+        fun_l3_n647(x)
+    end
+end
+
+def fun_l2_n382(x)
+    if (x < 1)
+        fun_l3_n788(x)
+    else
+        fun_l3_n418(x)
+    end
+end
+
+def fun_l2_n383(x)
+    if (x < 1)
+        fun_l3_n395(x)
+    else
+        fun_l3_n268(x)
+    end
+end
+
+def fun_l2_n384(x)
+    if (x < 1)
+        fun_l3_n39(x)
+    else
+        fun_l3_n950(x)
+    end
+end
+
+def fun_l2_n385(x)
+    if (x < 1)
+        fun_l3_n301(x)
+    else
+        fun_l3_n241(x)
+    end
+end
+
+def fun_l2_n386(x)
+    if (x < 1)
+        fun_l3_n936(x)
+    else
+        fun_l3_n416(x)
+    end
+end
+
+def fun_l2_n387(x)
+    if (x < 1)
+        fun_l3_n750(x)
+    else
+        fun_l3_n152(x)
+    end
+end
+
+def fun_l2_n388(x)
+    if (x < 1)
+        fun_l3_n210(x)
+    else
+        fun_l3_n824(x)
+    end
+end
+
+def fun_l2_n389(x)
+    if (x < 1)
+        fun_l3_n3(x)
+    else
+        fun_l3_n872(x)
+    end
+end
+
+def fun_l2_n390(x)
+    if (x < 1)
+        fun_l3_n944(x)
+    else
+        fun_l3_n49(x)
+    end
+end
+
+def fun_l2_n391(x)
+    if (x < 1)
+        fun_l3_n645(x)
+    else
+        fun_l3_n604(x)
+    end
+end
+
+def fun_l2_n392(x)
+    if (x < 1)
+        fun_l3_n539(x)
+    else
+        fun_l3_n374(x)
+    end
+end
+
+def fun_l2_n393(x)
+    if (x < 1)
+        fun_l3_n728(x)
+    else
+        fun_l3_n620(x)
+    end
+end
+
+def fun_l2_n394(x)
+    if (x < 1)
+        fun_l3_n538(x)
+    else
+        fun_l3_n233(x)
+    end
+end
+
+def fun_l2_n395(x)
+    if (x < 1)
+        fun_l3_n977(x)
+    else
+        fun_l3_n351(x)
+    end
+end
+
+def fun_l2_n396(x)
+    if (x < 1)
+        fun_l3_n54(x)
+    else
+        fun_l3_n958(x)
+    end
+end
+
+def fun_l2_n397(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n54(x)
+    end
+end
+
+def fun_l2_n398(x)
+    if (x < 1)
+        fun_l3_n846(x)
+    else
+        fun_l3_n234(x)
+    end
+end
+
+def fun_l2_n399(x)
+    if (x < 1)
+        fun_l3_n934(x)
+    else
+        fun_l3_n128(x)
+    end
+end
+
+def fun_l2_n400(x)
+    if (x < 1)
+        fun_l3_n15(x)
+    else
+        fun_l3_n288(x)
+    end
+end
+
+def fun_l2_n401(x)
+    if (x < 1)
+        fun_l3_n944(x)
+    else
+        fun_l3_n455(x)
+    end
+end
+
+def fun_l2_n402(x)
+    if (x < 1)
+        fun_l3_n962(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n403(x)
+    if (x < 1)
+        fun_l3_n408(x)
+    else
+        fun_l3_n689(x)
+    end
+end
+
+def fun_l2_n404(x)
+    if (x < 1)
+        fun_l3_n722(x)
+    else
+        fun_l3_n704(x)
+    end
+end
+
+def fun_l2_n405(x)
+    if (x < 1)
+        fun_l3_n410(x)
+    else
+        fun_l3_n543(x)
+    end
+end
+
+def fun_l2_n406(x)
+    if (x < 1)
+        fun_l3_n953(x)
+    else
+        fun_l3_n351(x)
+    end
+end
+
+def fun_l2_n407(x)
+    if (x < 1)
+        fun_l3_n426(x)
+    else
+        fun_l3_n467(x)
+    end
+end
+
+def fun_l2_n408(x)
+    if (x < 1)
+        fun_l3_n204(x)
+    else
+        fun_l3_n163(x)
+    end
+end
+
+def fun_l2_n409(x)
+    if (x < 1)
+        fun_l3_n418(x)
+    else
+        fun_l3_n896(x)
+    end
+end
+
+def fun_l2_n410(x)
+    if (x < 1)
+        fun_l3_n915(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n411(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n507(x)
+    end
+end
+
+def fun_l2_n412(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n938(x)
+    end
+end
+
+def fun_l2_n413(x)
+    if (x < 1)
+        fun_l3_n112(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n414(x)
+    if (x < 1)
+        fun_l3_n801(x)
+    else
+        fun_l3_n604(x)
+    end
+end
+
+def fun_l2_n415(x)
+    if (x < 1)
+        fun_l3_n773(x)
+    else
+        fun_l3_n951(x)
+    end
+end
+
+def fun_l2_n416(x)
+    if (x < 1)
+        fun_l3_n335(x)
+    else
+        fun_l3_n157(x)
+    end
+end
+
+def fun_l2_n417(x)
+    if (x < 1)
+        fun_l3_n480(x)
+    else
+        fun_l3_n106(x)
+    end
+end
+
+def fun_l2_n418(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n969(x)
+    end
+end
+
+def fun_l2_n419(x)
+    if (x < 1)
+        fun_l3_n371(x)
+    else
+        fun_l3_n698(x)
+    end
+end
+
+def fun_l2_n420(x)
+    if (x < 1)
+        fun_l3_n102(x)
+    else
+        fun_l3_n47(x)
+    end
+end
+
+def fun_l2_n421(x)
+    if (x < 1)
+        fun_l3_n64(x)
+    else
+        fun_l3_n574(x)
+    end
+end
+
+def fun_l2_n422(x)
+    if (x < 1)
+        fun_l3_n208(x)
+    else
+        fun_l3_n904(x)
+    end
+end
+
+def fun_l2_n423(x)
+    if (x < 1)
+        fun_l3_n715(x)
+    else
+        fun_l3_n414(x)
+    end
+end
+
+def fun_l2_n424(x)
+    if (x < 1)
+        fun_l3_n455(x)
+    else
+        fun_l3_n219(x)
+    end
+end
+
+def fun_l2_n425(x)
+    if (x < 1)
+        fun_l3_n210(x)
+    else
+        fun_l3_n160(x)
+    end
+end
+
+def fun_l2_n426(x)
+    if (x < 1)
+        fun_l3_n729(x)
+    else
+        fun_l3_n512(x)
+    end
+end
+
+def fun_l2_n427(x)
+    if (x < 1)
+        fun_l3_n159(x)
+    else
+        fun_l3_n482(x)
+    end
+end
+
+def fun_l2_n428(x)
+    if (x < 1)
+        fun_l3_n182(x)
+    else
+        fun_l3_n687(x)
+    end
+end
+
+def fun_l2_n429(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n856(x)
+    end
+end
+
+def fun_l2_n430(x)
+    if (x < 1)
+        fun_l3_n494(x)
+    else
+        fun_l3_n365(x)
+    end
+end
+
+def fun_l2_n431(x)
+    if (x < 1)
+        fun_l3_n346(x)
+    else
+        fun_l3_n82(x)
+    end
+end
+
+def fun_l2_n432(x)
+    if (x < 1)
+        fun_l3_n311(x)
+    else
+        fun_l3_n412(x)
+    end
+end
+
+def fun_l2_n433(x)
+    if (x < 1)
+        fun_l3_n824(x)
+    else
+        fun_l3_n494(x)
+    end
+end
+
+def fun_l2_n434(x)
+    if (x < 1)
+        fun_l3_n471(x)
+    else
+        fun_l3_n174(x)
+    end
+end
+
+def fun_l2_n435(x)
+    if (x < 1)
+        fun_l3_n10(x)
+    else
+        fun_l3_n319(x)
+    end
+end
+
+def fun_l2_n436(x)
+    if (x < 1)
+        fun_l3_n223(x)
+    else
+        fun_l3_n518(x)
+    end
+end
+
+def fun_l2_n437(x)
+    if (x < 1)
+        fun_l3_n497(x)
+    else
+        fun_l3_n685(x)
+    end
+end
+
+def fun_l2_n438(x)
+    if (x < 1)
+        fun_l3_n639(x)
+    else
+        fun_l3_n695(x)
+    end
+end
+
+def fun_l2_n439(x)
+    if (x < 1)
+        fun_l3_n898(x)
+    else
+        fun_l3_n114(x)
+    end
+end
+
+def fun_l2_n440(x)
+    if (x < 1)
+        fun_l3_n12(x)
+    else
+        fun_l3_n344(x)
+    end
+end
+
+def fun_l2_n441(x)
+    if (x < 1)
+        fun_l3_n556(x)
+    else
+        fun_l3_n684(x)
+    end
+end
+
+def fun_l2_n442(x)
+    if (x < 1)
+        fun_l3_n403(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n443(x)
+    if (x < 1)
+        fun_l3_n514(x)
+    else
+        fun_l3_n943(x)
+    end
+end
+
+def fun_l2_n444(x)
+    if (x < 1)
+        fun_l3_n218(x)
+    else
+        fun_l3_n94(x)
+    end
+end
+
+def fun_l2_n445(x)
+    if (x < 1)
+        fun_l3_n0(x)
+    else
+        fun_l3_n731(x)
+    end
+end
+
+def fun_l2_n446(x)
+    if (x < 1)
+        fun_l3_n468(x)
+    else
+        fun_l3_n197(x)
+    end
+end
+
+def fun_l2_n447(x)
+    if (x < 1)
+        fun_l3_n79(x)
+    else
+        fun_l3_n900(x)
+    end
+end
+
+def fun_l2_n448(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n449(x)
+    if (x < 1)
+        fun_l3_n607(x)
+    else
+        fun_l3_n514(x)
+    end
+end
+
+def fun_l2_n450(x)
+    if (x < 1)
+        fun_l3_n855(x)
+    else
+        fun_l3_n223(x)
+    end
+end
+
+def fun_l2_n451(x)
+    if (x < 1)
+        fun_l3_n824(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n452(x)
+    if (x < 1)
+        fun_l3_n137(x)
+    else
+        fun_l3_n555(x)
+    end
+end
+
+def fun_l2_n453(x)
+    if (x < 1)
+        fun_l3_n553(x)
+    else
+        fun_l3_n130(x)
+    end
+end
+
+def fun_l2_n454(x)
+    if (x < 1)
+        fun_l3_n350(x)
+    else
+        fun_l3_n545(x)
+    end
+end
+
+def fun_l2_n455(x)
+    if (x < 1)
+        fun_l3_n181(x)
+    else
+        fun_l3_n950(x)
+    end
+end
+
+def fun_l2_n456(x)
+    if (x < 1)
+        fun_l3_n581(x)
+    else
+        fun_l3_n957(x)
+    end
+end
+
+def fun_l2_n457(x)
+    if (x < 1)
+        fun_l3_n688(x)
+    else
+        fun_l3_n560(x)
+    end
+end
+
+def fun_l2_n458(x)
+    if (x < 1)
+        fun_l3_n655(x)
+    else
+        fun_l3_n323(x)
+    end
+end
+
+def fun_l2_n459(x)
+    if (x < 1)
+        fun_l3_n92(x)
+    else
+        fun_l3_n796(x)
+    end
+end
+
+def fun_l2_n460(x)
+    if (x < 1)
+        fun_l3_n68(x)
+    else
+        fun_l3_n152(x)
+    end
+end
+
+def fun_l2_n461(x)
+    if (x < 1)
+        fun_l3_n153(x)
+    else
+        fun_l3_n929(x)
+    end
+end
+
+def fun_l2_n462(x)
+    if (x < 1)
+        fun_l3_n401(x)
+    else
+        fun_l3_n248(x)
+    end
+end
+
+def fun_l2_n463(x)
+    if (x < 1)
+        fun_l3_n4(x)
+    else
+        fun_l3_n906(x)
+    end
+end
+
+def fun_l2_n464(x)
+    if (x < 1)
+        fun_l3_n313(x)
+    else
+        fun_l3_n911(x)
+    end
+end
+
+def fun_l2_n465(x)
+    if (x < 1)
+        fun_l3_n490(x)
+    else
+        fun_l3_n430(x)
+    end
+end
+
+def fun_l2_n466(x)
+    if (x < 1)
+        fun_l3_n537(x)
+    else
+        fun_l3_n470(x)
+    end
+end
+
+def fun_l2_n467(x)
+    if (x < 1)
+        fun_l3_n666(x)
+    else
+        fun_l3_n695(x)
+    end
+end
+
+def fun_l2_n468(x)
+    if (x < 1)
+        fun_l3_n126(x)
+    else
+        fun_l3_n201(x)
+    end
+end
+
+def fun_l2_n469(x)
+    if (x < 1)
+        fun_l3_n111(x)
+    else
+        fun_l3_n741(x)
+    end
+end
+
+def fun_l2_n470(x)
+    if (x < 1)
+        fun_l3_n391(x)
+    else
+        fun_l3_n83(x)
+    end
+end
+
+def fun_l2_n471(x)
+    if (x < 1)
+        fun_l3_n619(x)
+    else
+        fun_l3_n425(x)
+    end
+end
+
+def fun_l2_n472(x)
+    if (x < 1)
+        fun_l3_n637(x)
+    else
+        fun_l3_n865(x)
+    end
+end
+
+def fun_l2_n473(x)
+    if (x < 1)
+        fun_l3_n182(x)
+    else
+        fun_l3_n350(x)
+    end
+end
+
+def fun_l2_n474(x)
+    if (x < 1)
+        fun_l3_n752(x)
+    else
+        fun_l3_n815(x)
+    end
+end
+
+def fun_l2_n475(x)
+    if (x < 1)
+        fun_l3_n184(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n476(x)
+    if (x < 1)
+        fun_l3_n324(x)
+    else
+        fun_l3_n232(x)
+    end
+end
+
+def fun_l2_n477(x)
+    if (x < 1)
+        fun_l3_n588(x)
+    else
+        fun_l3_n586(x)
+    end
+end
+
+def fun_l2_n478(x)
+    if (x < 1)
+        fun_l3_n320(x)
+    else
+        fun_l3_n599(x)
+    end
+end
+
+def fun_l2_n479(x)
+    if (x < 1)
+        fun_l3_n999(x)
+    else
+        fun_l3_n678(x)
+    end
+end
+
+def fun_l2_n480(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n637(x)
+    end
+end
+
+def fun_l2_n481(x)
+    if (x < 1)
+        fun_l3_n291(x)
+    else
+        fun_l3_n347(x)
+    end
+end
+
+def fun_l2_n482(x)
+    if (x < 1)
+        fun_l3_n873(x)
+    else
+        fun_l3_n435(x)
+    end
+end
+
+def fun_l2_n483(x)
+    if (x < 1)
+        fun_l3_n718(x)
+    else
+        fun_l3_n903(x)
+    end
+end
+
+def fun_l2_n484(x)
+    if (x < 1)
+        fun_l3_n188(x)
+    else
+        fun_l3_n751(x)
+    end
+end
+
+def fun_l2_n485(x)
+    if (x < 1)
+        fun_l3_n501(x)
+    else
+        fun_l3_n235(x)
+    end
+end
+
+def fun_l2_n486(x)
+    if (x < 1)
+        fun_l3_n578(x)
+    else
+        fun_l3_n224(x)
+    end
+end
+
+def fun_l2_n487(x)
+    if (x < 1)
+        fun_l3_n757(x)
+    else
+        fun_l3_n145(x)
+    end
+end
+
+def fun_l2_n488(x)
+    if (x < 1)
+        fun_l3_n17(x)
+    else
+        fun_l3_n727(x)
+    end
+end
+
+def fun_l2_n489(x)
+    if (x < 1)
+        fun_l3_n699(x)
+    else
+        fun_l3_n102(x)
+    end
+end
+
+def fun_l2_n490(x)
+    if (x < 1)
+        fun_l3_n518(x)
+    else
+        fun_l3_n15(x)
+    end
+end
+
+def fun_l2_n491(x)
+    if (x < 1)
+        fun_l3_n889(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n492(x)
+    if (x < 1)
+        fun_l3_n715(x)
+    else
+        fun_l3_n27(x)
+    end
+end
+
+def fun_l2_n493(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n130(x)
+    end
+end
+
+def fun_l2_n494(x)
+    if (x < 1)
+        fun_l3_n99(x)
+    else
+        fun_l3_n223(x)
+    end
+end
+
+def fun_l2_n495(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n811(x)
+    end
+end
+
+def fun_l2_n496(x)
+    if (x < 1)
+        fun_l3_n457(x)
+    else
+        fun_l3_n527(x)
+    end
+end
+
+def fun_l2_n497(x)
+    if (x < 1)
+        fun_l3_n312(x)
+    else
+        fun_l3_n902(x)
+    end
+end
+
+def fun_l2_n498(x)
+    if (x < 1)
+        fun_l3_n63(x)
+    else
+        fun_l3_n948(x)
+    end
+end
+
+def fun_l2_n499(x)
+    if (x < 1)
+        fun_l3_n652(x)
+    else
+        fun_l3_n752(x)
+    end
+end
+
+def fun_l2_n500(x)
+    if (x < 1)
+        fun_l3_n583(x)
+    else
+        fun_l3_n427(x)
+    end
+end
+
+def fun_l2_n501(x)
+    if (x < 1)
+        fun_l3_n536(x)
+    else
+        fun_l3_n671(x)
+    end
+end
+
+def fun_l2_n502(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n170(x)
+    end
+end
+
+def fun_l2_n503(x)
+    if (x < 1)
+        fun_l3_n280(x)
+    else
+        fun_l3_n390(x)
+    end
+end
+
+def fun_l2_n504(x)
+    if (x < 1)
+        fun_l3_n427(x)
+    else
+        fun_l3_n267(x)
+    end
+end
+
+def fun_l2_n505(x)
+    if (x < 1)
+        fun_l3_n241(x)
+    else
+        fun_l3_n345(x)
+    end
+end
+
+def fun_l2_n506(x)
+    if (x < 1)
+        fun_l3_n960(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n507(x)
+    if (x < 1)
+        fun_l3_n947(x)
+    else
+        fun_l3_n3(x)
+    end
+end
+
+def fun_l2_n508(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n597(x)
+    end
+end
+
+def fun_l2_n509(x)
+    if (x < 1)
+        fun_l3_n978(x)
+    else
+        fun_l3_n70(x)
+    end
+end
+
+def fun_l2_n510(x)
+    if (x < 1)
+        fun_l3_n855(x)
+    else
+        fun_l3_n259(x)
+    end
+end
+
+def fun_l2_n511(x)
+    if (x < 1)
+        fun_l3_n987(x)
+    else
+        fun_l3_n182(x)
+    end
+end
+
+def fun_l2_n512(x)
+    if (x < 1)
+        fun_l3_n787(x)
+    else
+        fun_l3_n656(x)
+    end
+end
+
+def fun_l2_n513(x)
+    if (x < 1)
+        fun_l3_n348(x)
+    else
+        fun_l3_n242(x)
+    end
+end
+
+def fun_l2_n514(x)
+    if (x < 1)
+        fun_l3_n530(x)
+    else
+        fun_l3_n718(x)
+    end
+end
+
+def fun_l2_n515(x)
+    if (x < 1)
+        fun_l3_n840(x)
+    else
+        fun_l3_n302(x)
+    end
+end
+
+def fun_l2_n516(x)
+    if (x < 1)
+        fun_l3_n678(x)
+    else
+        fun_l3_n732(x)
+    end
+end
+
+def fun_l2_n517(x)
+    if (x < 1)
+        fun_l3_n160(x)
+    else
+        fun_l3_n344(x)
+    end
+end
+
+def fun_l2_n518(x)
+    if (x < 1)
+        fun_l3_n518(x)
+    else
+        fun_l3_n830(x)
+    end
+end
+
+def fun_l2_n519(x)
+    if (x < 1)
+        fun_l3_n595(x)
+    else
+        fun_l3_n95(x)
+    end
+end
+
+def fun_l2_n520(x)
+    if (x < 1)
+        fun_l3_n939(x)
+    else
+        fun_l3_n954(x)
+    end
+end
+
+def fun_l2_n521(x)
+    if (x < 1)
+        fun_l3_n931(x)
+    else
+        fun_l3_n686(x)
+    end
+end
+
+def fun_l2_n522(x)
+    if (x < 1)
+        fun_l3_n117(x)
+    else
+        fun_l3_n501(x)
+    end
+end
+
+def fun_l2_n523(x)
+    if (x < 1)
+        fun_l3_n727(x)
+    else
+        fun_l3_n712(x)
+    end
+end
+
+def fun_l2_n524(x)
+    if (x < 1)
+        fun_l3_n152(x)
+    else
+        fun_l3_n453(x)
+    end
+end
+
+def fun_l2_n525(x)
+    if (x < 1)
+        fun_l3_n375(x)
+    else
+        fun_l3_n186(x)
+    end
+end
+
+def fun_l2_n526(x)
+    if (x < 1)
+        fun_l3_n835(x)
+    else
+        fun_l3_n465(x)
+    end
+end
+
+def fun_l2_n527(x)
+    if (x < 1)
+        fun_l3_n411(x)
+    else
+        fun_l3_n208(x)
+    end
+end
+
+def fun_l2_n528(x)
+    if (x < 1)
+        fun_l3_n696(x)
+    else
+        fun_l3_n537(x)
+    end
+end
+
+def fun_l2_n529(x)
+    if (x < 1)
+        fun_l3_n606(x)
+    else
+        fun_l3_n682(x)
+    end
+end
+
+def fun_l2_n530(x)
+    if (x < 1)
+        fun_l3_n920(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n531(x)
+    if (x < 1)
+        fun_l3_n201(x)
+    else
+        fun_l3_n27(x)
+    end
+end
+
+def fun_l2_n532(x)
+    if (x < 1)
+        fun_l3_n643(x)
+    else
+        fun_l3_n642(x)
+    end
+end
+
+def fun_l2_n533(x)
+    if (x < 1)
+        fun_l3_n92(x)
+    else
+        fun_l3_n576(x)
+    end
+end
+
+def fun_l2_n534(x)
+    if (x < 1)
+        fun_l3_n135(x)
+    else
+        fun_l3_n738(x)
+    end
+end
+
+def fun_l2_n535(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n810(x)
+    end
+end
+
+def fun_l2_n536(x)
+    if (x < 1)
+        fun_l3_n922(x)
+    else
+        fun_l3_n456(x)
+    end
+end
+
+def fun_l2_n537(x)
+    if (x < 1)
+        fun_l3_n511(x)
+    else
+        fun_l3_n279(x)
+    end
+end
+
+def fun_l2_n538(x)
+    if (x < 1)
+        fun_l3_n541(x)
+    else
+        fun_l3_n826(x)
+    end
+end
+
+def fun_l2_n539(x)
+    if (x < 1)
+        fun_l3_n7(x)
+    else
+        fun_l3_n362(x)
+    end
+end
+
+def fun_l2_n540(x)
+    if (x < 1)
+        fun_l3_n132(x)
+    else
+        fun_l3_n819(x)
+    end
+end
+
+def fun_l2_n541(x)
+    if (x < 1)
+        fun_l3_n600(x)
+    else
+        fun_l3_n155(x)
+    end
+end
+
+def fun_l2_n542(x)
+    if (x < 1)
+        fun_l3_n930(x)
+    else
+        fun_l3_n827(x)
+    end
+end
+
+def fun_l2_n543(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n957(x)
+    end
+end
+
+def fun_l2_n544(x)
+    if (x < 1)
+        fun_l3_n912(x)
+    else
+        fun_l3_n503(x)
+    end
+end
+
+def fun_l2_n545(x)
+    if (x < 1)
+        fun_l3_n605(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n546(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n105(x)
+    end
+end
+
+def fun_l2_n547(x)
+    if (x < 1)
+        fun_l3_n352(x)
+    else
+        fun_l3_n762(x)
+    end
+end
+
+def fun_l2_n548(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n714(x)
+    end
+end
+
+def fun_l2_n549(x)
+    if (x < 1)
+        fun_l3_n665(x)
+    else
+        fun_l3_n799(x)
+    end
+end
+
+def fun_l2_n550(x)
+    if (x < 1)
+        fun_l3_n624(x)
+    else
+        fun_l3_n131(x)
+    end
+end
+
+def fun_l2_n551(x)
+    if (x < 1)
+        fun_l3_n53(x)
+    else
+        fun_l3_n377(x)
+    end
+end
+
+def fun_l2_n552(x)
+    if (x < 1)
+        fun_l3_n377(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n553(x)
+    if (x < 1)
+        fun_l3_n302(x)
+    else
+        fun_l3_n593(x)
+    end
+end
+
+def fun_l2_n554(x)
+    if (x < 1)
+        fun_l3_n573(x)
+    else
+        fun_l3_n727(x)
+    end
+end
+
+def fun_l2_n555(x)
+    if (x < 1)
+        fun_l3_n575(x)
+    else
+        fun_l3_n838(x)
+    end
+end
+
+def fun_l2_n556(x)
+    if (x < 1)
+        fun_l3_n92(x)
+    else
+        fun_l3_n137(x)
+    end
+end
+
+def fun_l2_n557(x)
+    if (x < 1)
+        fun_l3_n921(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n558(x)
+    if (x < 1)
+        fun_l3_n987(x)
+    else
+        fun_l3_n646(x)
+    end
+end
+
+def fun_l2_n559(x)
+    if (x < 1)
+        fun_l3_n574(x)
+    else
+        fun_l3_n493(x)
+    end
+end
+
+def fun_l2_n560(x)
+    if (x < 1)
+        fun_l3_n950(x)
+    else
+        fun_l3_n139(x)
+    end
+end
+
+def fun_l2_n561(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n491(x)
+    end
+end
+
+def fun_l2_n562(x)
+    if (x < 1)
+        fun_l3_n226(x)
+    else
+        fun_l3_n840(x)
+    end
+end
+
+def fun_l2_n563(x)
+    if (x < 1)
+        fun_l3_n473(x)
+    else
+        fun_l3_n907(x)
+    end
+end
+
+def fun_l2_n564(x)
+    if (x < 1)
+        fun_l3_n695(x)
+    else
+        fun_l3_n951(x)
+    end
+end
+
+def fun_l2_n565(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n12(x)
+    end
+end
+
+def fun_l2_n566(x)
+    if (x < 1)
+        fun_l3_n32(x)
+    else
+        fun_l3_n759(x)
+    end
+end
+
+def fun_l2_n567(x)
+    if (x < 1)
+        fun_l3_n876(x)
+    else
+        fun_l3_n297(x)
+    end
+end
+
+def fun_l2_n568(x)
+    if (x < 1)
+        fun_l3_n520(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n569(x)
+    if (x < 1)
+        fun_l3_n819(x)
+    else
+        fun_l3_n505(x)
+    end
+end
+
+def fun_l2_n570(x)
+    if (x < 1)
+        fun_l3_n661(x)
+    else
+        fun_l3_n447(x)
+    end
+end
+
+def fun_l2_n571(x)
+    if (x < 1)
+        fun_l3_n538(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n572(x)
+    if (x < 1)
+        fun_l3_n584(x)
+    else
+        fun_l3_n304(x)
+    end
+end
+
+def fun_l2_n573(x)
+    if (x < 1)
+        fun_l3_n76(x)
+    else
+        fun_l3_n512(x)
+    end
+end
+
+def fun_l2_n574(x)
+    if (x < 1)
+        fun_l3_n22(x)
+    else
+        fun_l3_n328(x)
+    end
+end
+
+def fun_l2_n575(x)
+    if (x < 1)
+        fun_l3_n397(x)
+    else
+        fun_l3_n640(x)
+    end
+end
+
+def fun_l2_n576(x)
+    if (x < 1)
+        fun_l3_n227(x)
+    else
+        fun_l3_n236(x)
+    end
+end
+
+def fun_l2_n577(x)
+    if (x < 1)
+        fun_l3_n743(x)
+    else
+        fun_l3_n974(x)
+    end
+end
+
+def fun_l2_n578(x)
+    if (x < 1)
+        fun_l3_n970(x)
+    else
+        fun_l3_n229(x)
+    end
+end
+
+def fun_l2_n579(x)
+    if (x < 1)
+        fun_l3_n401(x)
+    else
+        fun_l3_n672(x)
+    end
+end
+
+def fun_l2_n580(x)
+    if (x < 1)
+        fun_l3_n837(x)
+    else
+        fun_l3_n804(x)
+    end
+end
+
+def fun_l2_n581(x)
+    if (x < 1)
+        fun_l3_n526(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n582(x)
+    if (x < 1)
+        fun_l3_n2(x)
+    else
+        fun_l3_n692(x)
+    end
+end
+
+def fun_l2_n583(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n584(x)
+    if (x < 1)
+        fun_l3_n60(x)
+    else
+        fun_l3_n682(x)
+    end
+end
+
+def fun_l2_n585(x)
+    if (x < 1)
+        fun_l3_n646(x)
+    else
+        fun_l3_n776(x)
+    end
+end
+
+def fun_l2_n586(x)
+    if (x < 1)
+        fun_l3_n466(x)
+    else
+        fun_l3_n91(x)
+    end
+end
+
+def fun_l2_n587(x)
+    if (x < 1)
+        fun_l3_n294(x)
+    else
+        fun_l3_n813(x)
+    end
+end
+
+def fun_l2_n588(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n64(x)
+    end
+end
+
+def fun_l2_n589(x)
+    if (x < 1)
+        fun_l3_n703(x)
+    else
+        fun_l3_n937(x)
+    end
+end
+
+def fun_l2_n590(x)
+    if (x < 1)
+        fun_l3_n1(x)
+    else
+        fun_l3_n970(x)
+    end
+end
+
+def fun_l2_n591(x)
+    if (x < 1)
+        fun_l3_n566(x)
+    else
+        fun_l3_n750(x)
+    end
+end
+
+def fun_l2_n592(x)
+    if (x < 1)
+        fun_l3_n905(x)
+    else
+        fun_l3_n840(x)
+    end
+end
+
+def fun_l2_n593(x)
+    if (x < 1)
+        fun_l3_n23(x)
+    else
+        fun_l3_n862(x)
+    end
+end
+
+def fun_l2_n594(x)
+    if (x < 1)
+        fun_l3_n739(x)
+    else
+        fun_l3_n4(x)
+    end
+end
+
+def fun_l2_n595(x)
+    if (x < 1)
+        fun_l3_n818(x)
+    else
+        fun_l3_n117(x)
+    end
+end
+
+def fun_l2_n596(x)
+    if (x < 1)
+        fun_l3_n891(x)
+    else
+        fun_l3_n599(x)
+    end
+end
+
+def fun_l2_n597(x)
+    if (x < 1)
+        fun_l3_n731(x)
+    else
+        fun_l3_n960(x)
+    end
+end
+
+def fun_l2_n598(x)
+    if (x < 1)
+        fun_l3_n323(x)
+    else
+        fun_l3_n811(x)
+    end
+end
+
+def fun_l2_n599(x)
+    if (x < 1)
+        fun_l3_n299(x)
+    else
+        fun_l3_n188(x)
+    end
+end
+
+def fun_l2_n600(x)
+    if (x < 1)
+        fun_l3_n129(x)
+    else
+        fun_l3_n730(x)
+    end
+end
+
+def fun_l2_n601(x)
+    if (x < 1)
+        fun_l3_n412(x)
+    else
+        fun_l3_n353(x)
+    end
+end
+
+def fun_l2_n602(x)
+    if (x < 1)
+        fun_l3_n658(x)
+    else
+        fun_l3_n774(x)
+    end
+end
+
+def fun_l2_n603(x)
+    if (x < 1)
+        fun_l3_n378(x)
+    else
+        fun_l3_n722(x)
+    end
+end
+
+def fun_l2_n604(x)
+    if (x < 1)
+        fun_l3_n482(x)
+    else
+        fun_l3_n949(x)
+    end
+end
+
+def fun_l2_n605(x)
+    if (x < 1)
+        fun_l3_n996(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n606(x)
+    if (x < 1)
+        fun_l3_n653(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n607(x)
+    if (x < 1)
+        fun_l3_n179(x)
+    else
+        fun_l3_n113(x)
+    end
+end
+
+def fun_l2_n608(x)
+    if (x < 1)
+        fun_l3_n157(x)
+    else
+        fun_l3_n692(x)
+    end
+end
+
+def fun_l2_n609(x)
+    if (x < 1)
+        fun_l3_n648(x)
+    else
+        fun_l3_n318(x)
+    end
+end
+
+def fun_l2_n610(x)
+    if (x < 1)
+        fun_l3_n979(x)
+    else
+        fun_l3_n642(x)
+    end
+end
+
+def fun_l2_n611(x)
+    if (x < 1)
+        fun_l3_n909(x)
+    else
+        fun_l3_n986(x)
+    end
+end
+
+def fun_l2_n612(x)
+    if (x < 1)
+        fun_l3_n387(x)
+    else
+        fun_l3_n586(x)
+    end
+end
+
+def fun_l2_n613(x)
+    if (x < 1)
+        fun_l3_n99(x)
+    else
+        fun_l3_n690(x)
+    end
+end
+
+def fun_l2_n614(x)
+    if (x < 1)
+        fun_l3_n485(x)
+    else
+        fun_l3_n733(x)
+    end
+end
+
+def fun_l2_n615(x)
+    if (x < 1)
+        fun_l3_n735(x)
+    else
+        fun_l3_n827(x)
+    end
+end
+
+def fun_l2_n616(x)
+    if (x < 1)
+        fun_l3_n496(x)
+    else
+        fun_l3_n912(x)
+    end
+end
+
+def fun_l2_n617(x)
+    if (x < 1)
+        fun_l3_n363(x)
+    else
+        fun_l3_n845(x)
+    end
+end
+
+def fun_l2_n618(x)
+    if (x < 1)
+        fun_l3_n891(x)
+    else
+        fun_l3_n964(x)
+    end
+end
+
+def fun_l2_n619(x)
+    if (x < 1)
+        fun_l3_n266(x)
+    else
+        fun_l3_n189(x)
+    end
+end
+
+def fun_l2_n620(x)
+    if (x < 1)
+        fun_l3_n906(x)
+    else
+        fun_l3_n218(x)
+    end
+end
+
+def fun_l2_n621(x)
+    if (x < 1)
+        fun_l3_n145(x)
+    else
+        fun_l3_n279(x)
+    end
+end
+
+def fun_l2_n622(x)
+    if (x < 1)
+        fun_l3_n797(x)
+    else
+        fun_l3_n328(x)
+    end
+end
+
+def fun_l2_n623(x)
+    if (x < 1)
+        fun_l3_n910(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n624(x)
+    if (x < 1)
+        fun_l3_n111(x)
+    else
+        fun_l3_n884(x)
+    end
+end
+
+def fun_l2_n625(x)
+    if (x < 1)
+        fun_l3_n852(x)
+    else
+        fun_l3_n985(x)
+    end
+end
+
+def fun_l2_n626(x)
+    if (x < 1)
+        fun_l3_n163(x)
+    else
+        fun_l3_n885(x)
+    end
+end
+
+def fun_l2_n627(x)
+    if (x < 1)
+        fun_l3_n338(x)
+    else
+        fun_l3_n562(x)
+    end
+end
+
+def fun_l2_n628(x)
+    if (x < 1)
+        fun_l3_n300(x)
+    else
+        fun_l3_n245(x)
+    end
+end
+
+def fun_l2_n629(x)
+    if (x < 1)
+        fun_l3_n747(x)
+    else
+        fun_l3_n123(x)
+    end
+end
+
+def fun_l2_n630(x)
+    if (x < 1)
+        fun_l3_n42(x)
+    else
+        fun_l3_n46(x)
+    end
+end
+
+def fun_l2_n631(x)
+    if (x < 1)
+        fun_l3_n256(x)
+    else
+        fun_l3_n960(x)
+    end
+end
+
+def fun_l2_n632(x)
+    if (x < 1)
+        fun_l3_n679(x)
+    else
+        fun_l3_n393(x)
+    end
+end
+
+def fun_l2_n633(x)
+    if (x < 1)
+        fun_l3_n286(x)
+    else
+        fun_l3_n147(x)
+    end
+end
+
+def fun_l2_n634(x)
+    if (x < 1)
+        fun_l3_n62(x)
+    else
+        fun_l3_n994(x)
+    end
+end
+
+def fun_l2_n635(x)
+    if (x < 1)
+        fun_l3_n479(x)
+    else
+        fun_l3_n502(x)
+    end
+end
+
+def fun_l2_n636(x)
+    if (x < 1)
+        fun_l3_n504(x)
+    else
+        fun_l3_n557(x)
+    end
+end
+
+def fun_l2_n637(x)
+    if (x < 1)
+        fun_l3_n716(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n638(x)
+    if (x < 1)
+        fun_l3_n972(x)
+    else
+        fun_l3_n391(x)
+    end
+end
+
+def fun_l2_n639(x)
+    if (x < 1)
+        fun_l3_n842(x)
+    else
+        fun_l3_n740(x)
+    end
+end
+
+def fun_l2_n640(x)
+    if (x < 1)
+        fun_l3_n854(x)
+    else
+        fun_l3_n52(x)
+    end
+end
+
+def fun_l2_n641(x)
+    if (x < 1)
+        fun_l3_n321(x)
+    else
+        fun_l3_n109(x)
+    end
+end
+
+def fun_l2_n642(x)
+    if (x < 1)
+        fun_l3_n868(x)
+    else
+        fun_l3_n926(x)
+    end
+end
+
+def fun_l2_n643(x)
+    if (x < 1)
+        fun_l3_n864(x)
+    else
+        fun_l3_n98(x)
+    end
+end
+
+def fun_l2_n644(x)
+    if (x < 1)
+        fun_l3_n373(x)
+    else
+        fun_l3_n105(x)
+    end
+end
+
+def fun_l2_n645(x)
+    if (x < 1)
+        fun_l3_n293(x)
+    else
+        fun_l3_n846(x)
+    end
+end
+
+def fun_l2_n646(x)
+    if (x < 1)
+        fun_l3_n24(x)
+    else
+        fun_l3_n83(x)
+    end
+end
+
+def fun_l2_n647(x)
+    if (x < 1)
+        fun_l3_n431(x)
+    else
+        fun_l3_n772(x)
+    end
+end
+
+def fun_l2_n648(x)
+    if (x < 1)
+        fun_l3_n667(x)
+    else
+        fun_l3_n108(x)
+    end
+end
+
+def fun_l2_n649(x)
+    if (x < 1)
+        fun_l3_n93(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n650(x)
+    if (x < 1)
+        fun_l3_n176(x)
+    else
+        fun_l3_n315(x)
+    end
+end
+
+def fun_l2_n651(x)
+    if (x < 1)
+        fun_l3_n684(x)
+    else
+        fun_l3_n635(x)
+    end
+end
+
+def fun_l2_n652(x)
+    if (x < 1)
+        fun_l3_n554(x)
+    else
+        fun_l3_n88(x)
+    end
+end
+
+def fun_l2_n653(x)
+    if (x < 1)
+        fun_l3_n165(x)
+    else
+        fun_l3_n962(x)
+    end
+end
+
+def fun_l2_n654(x)
+    if (x < 1)
+        fun_l3_n631(x)
+    else
+        fun_l3_n80(x)
+    end
+end
+
+def fun_l2_n655(x)
+    if (x < 1)
+        fun_l3_n529(x)
+    else
+        fun_l3_n711(x)
+    end
+end
+
+def fun_l2_n656(x)
+    if (x < 1)
+        fun_l3_n809(x)
+    else
+        fun_l3_n44(x)
+    end
+end
+
+def fun_l2_n657(x)
+    if (x < 1)
+        fun_l3_n226(x)
+    else
+        fun_l3_n939(x)
+    end
+end
+
+def fun_l2_n658(x)
+    if (x < 1)
+        fun_l3_n355(x)
+    else
+        fun_l3_n750(x)
+    end
+end
+
+def fun_l2_n659(x)
+    if (x < 1)
+        fun_l3_n111(x)
+    else
+        fun_l3_n883(x)
+    end
+end
+
+def fun_l2_n660(x)
+    if (x < 1)
+        fun_l3_n22(x)
+    else
+        fun_l3_n544(x)
+    end
+end
+
+def fun_l2_n661(x)
+    if (x < 1)
+        fun_l3_n334(x)
+    else
+        fun_l3_n58(x)
+    end
+end
+
+def fun_l2_n662(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n647(x)
+    end
+end
+
+def fun_l2_n663(x)
+    if (x < 1)
+        fun_l3_n886(x)
+    else
+        fun_l3_n142(x)
+    end
+end
+
+def fun_l2_n664(x)
+    if (x < 1)
+        fun_l3_n713(x)
+    else
+        fun_l3_n710(x)
+    end
+end
+
+def fun_l2_n665(x)
+    if (x < 1)
+        fun_l3_n657(x)
+    else
+        fun_l3_n24(x)
+    end
+end
+
+def fun_l2_n666(x)
+    if (x < 1)
+        fun_l3_n993(x)
+    else
+        fun_l3_n741(x)
+    end
+end
+
+def fun_l2_n667(x)
+    if (x < 1)
+        fun_l3_n265(x)
+    else
+        fun_l3_n143(x)
+    end
+end
+
+def fun_l2_n668(x)
+    if (x < 1)
+        fun_l3_n725(x)
+    else
+        fun_l3_n272(x)
+    end
+end
+
+def fun_l2_n669(x)
+    if (x < 1)
+        fun_l3_n171(x)
+    else
+        fun_l3_n95(x)
+    end
+end
+
+def fun_l2_n670(x)
+    if (x < 1)
+        fun_l3_n409(x)
+    else
+        fun_l3_n774(x)
+    end
+end
+
+def fun_l2_n671(x)
+    if (x < 1)
+        fun_l3_n566(x)
+    else
+        fun_l3_n251(x)
+    end
+end
+
+def fun_l2_n672(x)
+    if (x < 1)
+        fun_l3_n914(x)
+    else
+        fun_l3_n716(x)
+    end
+end
+
+def fun_l2_n673(x)
+    if (x < 1)
+        fun_l3_n889(x)
+    else
+        fun_l3_n339(x)
+    end
+end
+
+def fun_l2_n674(x)
+    if (x < 1)
+        fun_l3_n808(x)
+    else
+        fun_l3_n858(x)
+    end
+end
+
+def fun_l2_n675(x)
+    if (x < 1)
+        fun_l3_n895(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n676(x)
+    if (x < 1)
+        fun_l3_n674(x)
+    else
+        fun_l3_n183(x)
+    end
+end
+
+def fun_l2_n677(x)
+    if (x < 1)
+        fun_l3_n934(x)
+    else
+        fun_l3_n292(x)
+    end
+end
+
+def fun_l2_n678(x)
+    if (x < 1)
+        fun_l3_n302(x)
+    else
+        fun_l3_n511(x)
+    end
+end
+
+def fun_l2_n679(x)
+    if (x < 1)
+        fun_l3_n847(x)
+    else
+        fun_l3_n70(x)
+    end
+end
+
+def fun_l2_n680(x)
+    if (x < 1)
+        fun_l3_n200(x)
+    else
+        fun_l3_n436(x)
+    end
+end
+
+def fun_l2_n681(x)
+    if (x < 1)
+        fun_l3_n44(x)
+    else
+        fun_l3_n145(x)
+    end
+end
+
+def fun_l2_n682(x)
+    if (x < 1)
+        fun_l3_n929(x)
+    else
+        fun_l3_n605(x)
+    end
+end
+
+def fun_l2_n683(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n641(x)
+    end
+end
+
+def fun_l2_n684(x)
+    if (x < 1)
+        fun_l3_n679(x)
+    else
+        fun_l3_n976(x)
+    end
+end
+
+def fun_l2_n685(x)
+    if (x < 1)
+        fun_l3_n405(x)
+    else
+        fun_l3_n658(x)
+    end
+end
+
+def fun_l2_n686(x)
+    if (x < 1)
+        fun_l3_n685(x)
+    else
+        fun_l3_n379(x)
+    end
+end
+
+def fun_l2_n687(x)
+    if (x < 1)
+        fun_l3_n279(x)
+    else
+        fun_l3_n415(x)
+    end
+end
+
+def fun_l2_n688(x)
+    if (x < 1)
+        fun_l3_n234(x)
+    else
+        fun_l3_n634(x)
+    end
+end
+
+def fun_l2_n689(x)
+    if (x < 1)
+        fun_l3_n119(x)
+    else
+        fun_l3_n234(x)
+    end
+end
+
+def fun_l2_n690(x)
+    if (x < 1)
+        fun_l3_n213(x)
+    else
+        fun_l3_n102(x)
+    end
+end
+
+def fun_l2_n691(x)
+    if (x < 1)
+        fun_l3_n744(x)
+    else
+        fun_l3_n31(x)
+    end
+end
+
+def fun_l2_n692(x)
+    if (x < 1)
+        fun_l3_n29(x)
+    else
+        fun_l3_n238(x)
+    end
+end
+
+def fun_l2_n693(x)
+    if (x < 1)
+        fun_l3_n323(x)
+    else
+        fun_l3_n388(x)
+    end
+end
+
+def fun_l2_n694(x)
+    if (x < 1)
+        fun_l3_n70(x)
+    else
+        fun_l3_n356(x)
+    end
+end
+
+def fun_l2_n695(x)
+    if (x < 1)
+        fun_l3_n589(x)
+    else
+        fun_l3_n949(x)
+    end
+end
+
+def fun_l2_n696(x)
+    if (x < 1)
+        fun_l3_n328(x)
+    else
+        fun_l3_n472(x)
+    end
+end
+
+def fun_l2_n697(x)
+    if (x < 1)
+        fun_l3_n705(x)
+    else
+        fun_l3_n709(x)
+    end
+end
+
+def fun_l2_n698(x)
+    if (x < 1)
+        fun_l3_n817(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n699(x)
+    if (x < 1)
+        fun_l3_n916(x)
+    else
+        fun_l3_n66(x)
+    end
+end
+
+def fun_l2_n700(x)
+    if (x < 1)
+        fun_l3_n461(x)
+    else
+        fun_l3_n648(x)
+    end
+end
+
+def fun_l2_n701(x)
+    if (x < 1)
+        fun_l3_n71(x)
+    else
+        fun_l3_n218(x)
+    end
+end
+
+def fun_l2_n702(x)
+    if (x < 1)
+        fun_l3_n490(x)
+    else
+        fun_l3_n706(x)
+    end
+end
+
+def fun_l2_n703(x)
+    if (x < 1)
+        fun_l3_n480(x)
+    else
+        fun_l3_n665(x)
+    end
+end
+
+def fun_l2_n704(x)
+    if (x < 1)
+        fun_l3_n965(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n705(x)
+    if (x < 1)
+        fun_l3_n65(x)
+    else
+        fun_l3_n761(x)
+    end
+end
+
+def fun_l2_n706(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n707(x)
+    if (x < 1)
+        fun_l3_n665(x)
+    else
+        fun_l3_n589(x)
+    end
+end
+
+def fun_l2_n708(x)
+    if (x < 1)
+        fun_l3_n331(x)
+    else
+        fun_l3_n299(x)
+    end
+end
+
+def fun_l2_n709(x)
+    if (x < 1)
+        fun_l3_n656(x)
+    else
+        fun_l3_n966(x)
+    end
+end
+
+def fun_l2_n710(x)
+    if (x < 1)
+        fun_l3_n610(x)
+    else
+        fun_l3_n767(x)
+    end
+end
+
+def fun_l2_n711(x)
+    if (x < 1)
+        fun_l3_n281(x)
+    else
+        fun_l3_n942(x)
+    end
+end
+
+def fun_l2_n712(x)
+    if (x < 1)
+        fun_l3_n474(x)
+    else
+        fun_l3_n373(x)
+    end
+end
+
+def fun_l2_n713(x)
+    if (x < 1)
+        fun_l3_n668(x)
+    else
+        fun_l3_n881(x)
+    end
+end
+
+def fun_l2_n714(x)
+    if (x < 1)
+        fun_l3_n112(x)
+    else
+        fun_l3_n914(x)
+    end
+end
+
+def fun_l2_n715(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n946(x)
+    end
+end
+
+def fun_l2_n716(x)
+    if (x < 1)
+        fun_l3_n340(x)
+    else
+        fun_l3_n474(x)
+    end
+end
+
+def fun_l2_n717(x)
+    if (x < 1)
+        fun_l3_n179(x)
+    else
+        fun_l3_n740(x)
+    end
+end
+
+def fun_l2_n718(x)
+    if (x < 1)
+        fun_l3_n830(x)
+    else
+        fun_l3_n139(x)
+    end
+end
+
+def fun_l2_n719(x)
+    if (x < 1)
+        fun_l3_n945(x)
+    else
+        fun_l3_n98(x)
+    end
+end
+
+def fun_l2_n720(x)
+    if (x < 1)
+        fun_l3_n912(x)
+    else
+        fun_l3_n457(x)
+    end
+end
+
+def fun_l2_n721(x)
+    if (x < 1)
+        fun_l3_n4(x)
+    else
+        fun_l3_n798(x)
+    end
+end
+
+def fun_l2_n722(x)
+    if (x < 1)
+        fun_l3_n438(x)
+    else
+        fun_l3_n677(x)
+    end
+end
+
+def fun_l2_n723(x)
+    if (x < 1)
+        fun_l3_n447(x)
+    else
+        fun_l3_n418(x)
+    end
+end
+
+def fun_l2_n724(x)
+    if (x < 1)
+        fun_l3_n936(x)
+    else
+        fun_l3_n572(x)
+    end
+end
+
+def fun_l2_n725(x)
+    if (x < 1)
+        fun_l3_n856(x)
+    else
+        fun_l3_n429(x)
+    end
+end
+
+def fun_l2_n726(x)
+    if (x < 1)
+        fun_l3_n747(x)
+    else
+        fun_l3_n823(x)
+    end
+end
+
+def fun_l2_n727(x)
+    if (x < 1)
+        fun_l3_n908(x)
+    else
+        fun_l3_n446(x)
+    end
+end
+
+def fun_l2_n728(x)
+    if (x < 1)
+        fun_l3_n170(x)
+    else
+        fun_l3_n546(x)
+    end
+end
+
+def fun_l2_n729(x)
+    if (x < 1)
+        fun_l3_n45(x)
+    else
+        fun_l3_n76(x)
+    end
+end
+
+def fun_l2_n730(x)
+    if (x < 1)
+        fun_l3_n688(x)
+    else
+        fun_l3_n826(x)
+    end
+end
+
+def fun_l2_n731(x)
+    if (x < 1)
+        fun_l3_n805(x)
+    else
+        fun_l3_n88(x)
+    end
+end
+
+def fun_l2_n732(x)
+    if (x < 1)
+        fun_l3_n191(x)
+    else
+        fun_l3_n395(x)
+    end
+end
+
+def fun_l2_n733(x)
+    if (x < 1)
+        fun_l3_n161(x)
+    else
+        fun_l3_n600(x)
+    end
+end
+
+def fun_l2_n734(x)
+    if (x < 1)
+        fun_l3_n586(x)
+    else
+        fun_l3_n770(x)
+    end
+end
+
+def fun_l2_n735(x)
+    if (x < 1)
+        fun_l3_n139(x)
+    else
+        fun_l3_n108(x)
+    end
+end
+
+def fun_l2_n736(x)
+    if (x < 1)
+        fun_l3_n719(x)
+    else
+        fun_l3_n210(x)
+    end
+end
+
+def fun_l2_n737(x)
+    if (x < 1)
+        fun_l3_n327(x)
+    else
+        fun_l3_n138(x)
+    end
+end
+
+def fun_l2_n738(x)
+    if (x < 1)
+        fun_l3_n755(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n739(x)
+    if (x < 1)
+        fun_l3_n499(x)
+    else
+        fun_l3_n998(x)
+    end
+end
+
+def fun_l2_n740(x)
+    if (x < 1)
+        fun_l3_n303(x)
+    else
+        fun_l3_n646(x)
+    end
+end
+
+def fun_l2_n741(x)
+    if (x < 1)
+        fun_l3_n385(x)
+    else
+        fun_l3_n202(x)
+    end
+end
+
+def fun_l2_n742(x)
+    if (x < 1)
+        fun_l3_n290(x)
+    else
+        fun_l3_n617(x)
+    end
+end
+
+def fun_l2_n743(x)
+    if (x < 1)
+        fun_l3_n735(x)
+    else
+        fun_l3_n322(x)
+    end
+end
+
+def fun_l2_n744(x)
+    if (x < 1)
+        fun_l3_n541(x)
+    else
+        fun_l3_n841(x)
+    end
+end
+
+def fun_l2_n745(x)
+    if (x < 1)
+        fun_l3_n124(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n746(x)
+    if (x < 1)
+        fun_l3_n909(x)
+    else
+        fun_l3_n981(x)
+    end
+end
+
+def fun_l2_n747(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n154(x)
+    end
+end
+
+def fun_l2_n748(x)
+    if (x < 1)
+        fun_l3_n804(x)
+    else
+        fun_l3_n837(x)
+    end
+end
+
+def fun_l2_n749(x)
+    if (x < 1)
+        fun_l3_n787(x)
+    else
+        fun_l3_n890(x)
+    end
+end
+
+def fun_l2_n750(x)
+    if (x < 1)
+        fun_l3_n273(x)
+    else
+        fun_l3_n539(x)
+    end
+end
+
+def fun_l2_n751(x)
+    if (x < 1)
+        fun_l3_n397(x)
+    else
+        fun_l3_n630(x)
+    end
+end
+
+def fun_l2_n752(x)
+    if (x < 1)
+        fun_l3_n757(x)
+    else
+        fun_l3_n294(x)
+    end
+end
+
+def fun_l2_n753(x)
+    if (x < 1)
+        fun_l3_n731(x)
+    else
+        fun_l3_n121(x)
+    end
+end
+
+def fun_l2_n754(x)
+    if (x < 1)
+        fun_l3_n391(x)
+    else
+        fun_l3_n640(x)
+    end
+end
+
+def fun_l2_n755(x)
+    if (x < 1)
+        fun_l3_n441(x)
+    else
+        fun_l3_n731(x)
+    end
+end
+
+def fun_l2_n756(x)
+    if (x < 1)
+        fun_l3_n947(x)
+    else
+        fun_l3_n175(x)
+    end
+end
+
+def fun_l2_n757(x)
+    if (x < 1)
+        fun_l3_n294(x)
+    else
+        fun_l3_n732(x)
+    end
+end
+
+def fun_l2_n758(x)
+    if (x < 1)
+        fun_l3_n862(x)
+    else
+        fun_l3_n490(x)
+    end
+end
+
+def fun_l2_n759(x)
+    if (x < 1)
+        fun_l3_n959(x)
+    else
+        fun_l3_n58(x)
+    end
+end
+
+def fun_l2_n760(x)
+    if (x < 1)
+        fun_l3_n245(x)
+    else
+        fun_l3_n201(x)
+    end
+end
+
+def fun_l2_n761(x)
+    if (x < 1)
+        fun_l3_n174(x)
+    else
+        fun_l3_n763(x)
+    end
+end
+
+def fun_l2_n762(x)
+    if (x < 1)
+        fun_l3_n276(x)
+    else
+        fun_l3_n624(x)
+    end
+end
+
+def fun_l2_n763(x)
+    if (x < 1)
+        fun_l3_n130(x)
+    else
+        fun_l3_n452(x)
+    end
+end
+
+def fun_l2_n764(x)
+    if (x < 1)
+        fun_l3_n476(x)
+    else
+        fun_l3_n519(x)
+    end
+end
+
+def fun_l2_n765(x)
+    if (x < 1)
+        fun_l3_n911(x)
+    else
+        fun_l3_n28(x)
+    end
+end
+
+def fun_l2_n766(x)
+    if (x < 1)
+        fun_l3_n290(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n767(x)
+    if (x < 1)
+        fun_l3_n89(x)
+    else
+        fun_l3_n284(x)
+    end
+end
+
+def fun_l2_n768(x)
+    if (x < 1)
+        fun_l3_n307(x)
+    else
+        fun_l3_n832(x)
+    end
+end
+
+def fun_l2_n769(x)
+    if (x < 1)
+        fun_l3_n204(x)
+    else
+        fun_l3_n358(x)
+    end
+end
+
+def fun_l2_n770(x)
+    if (x < 1)
+        fun_l3_n380(x)
+    else
+        fun_l3_n938(x)
+    end
+end
+
+def fun_l2_n771(x)
+    if (x < 1)
+        fun_l3_n245(x)
+    else
+        fun_l3_n156(x)
+    end
+end
+
+def fun_l2_n772(x)
+    if (x < 1)
+        fun_l3_n77(x)
+    else
+        fun_l3_n842(x)
+    end
+end
+
+def fun_l2_n773(x)
+    if (x < 1)
+        fun_l3_n972(x)
+    else
+        fun_l3_n143(x)
+    end
+end
+
+def fun_l2_n774(x)
+    if (x < 1)
+        fun_l3_n308(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n775(x)
+    if (x < 1)
+        fun_l3_n714(x)
+    else
+        fun_l3_n329(x)
+    end
+end
+
+def fun_l2_n776(x)
+    if (x < 1)
+        fun_l3_n805(x)
+    else
+        fun_l3_n141(x)
+    end
+end
+
+def fun_l2_n777(x)
+    if (x < 1)
+        fun_l3_n155(x)
+    else
+        fun_l3_n873(x)
+    end
+end
+
+def fun_l2_n778(x)
+    if (x < 1)
+        fun_l3_n551(x)
+    else
+        fun_l3_n293(x)
+    end
+end
+
+def fun_l2_n779(x)
+    if (x < 1)
+        fun_l3_n857(x)
+    else
+        fun_l3_n551(x)
+    end
+end
+
+def fun_l2_n780(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n230(x)
+    end
+end
+
+def fun_l2_n781(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n463(x)
+    end
+end
+
+def fun_l2_n782(x)
+    if (x < 1)
+        fun_l3_n89(x)
+    else
+        fun_l3_n514(x)
+    end
+end
+
+def fun_l2_n783(x)
+    if (x < 1)
+        fun_l3_n290(x)
+    else
+        fun_l3_n394(x)
+    end
+end
+
+def fun_l2_n784(x)
+    if (x < 1)
+        fun_l3_n582(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n785(x)
+    if (x < 1)
+        fun_l3_n739(x)
+    else
+        fun_l3_n822(x)
+    end
+end
+
+def fun_l2_n786(x)
+    if (x < 1)
+        fun_l3_n1(x)
+    else
+        fun_l3_n162(x)
+    end
+end
+
+def fun_l2_n787(x)
+    if (x < 1)
+        fun_l3_n88(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n788(x)
+    if (x < 1)
+        fun_l3_n592(x)
+    else
+        fun_l3_n235(x)
+    end
+end
+
+def fun_l2_n789(x)
+    if (x < 1)
+        fun_l3_n337(x)
+    else
+        fun_l3_n204(x)
+    end
+end
+
+def fun_l2_n790(x)
+    if (x < 1)
+        fun_l3_n481(x)
+    else
+        fun_l3_n361(x)
+    end
+end
+
+def fun_l2_n791(x)
+    if (x < 1)
+        fun_l3_n441(x)
+    else
+        fun_l3_n883(x)
+    end
+end
+
+def fun_l2_n792(x)
+    if (x < 1)
+        fun_l3_n424(x)
+    else
+        fun_l3_n387(x)
+    end
+end
+
+def fun_l2_n793(x)
+    if (x < 1)
+        fun_l3_n961(x)
+    else
+        fun_l3_n710(x)
+    end
+end
+
+def fun_l2_n794(x)
+    if (x < 1)
+        fun_l3_n653(x)
+    else
+        fun_l3_n869(x)
+    end
+end
+
+def fun_l2_n795(x)
+    if (x < 1)
+        fun_l3_n466(x)
+    else
+        fun_l3_n195(x)
+    end
+end
+
+def fun_l2_n796(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n137(x)
+    end
+end
+
+def fun_l2_n797(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n911(x)
+    end
+end
+
+def fun_l2_n798(x)
+    if (x < 1)
+        fun_l3_n500(x)
+    else
+        fun_l3_n607(x)
+    end
+end
+
+def fun_l2_n799(x)
+    if (x < 1)
+        fun_l3_n964(x)
+    else
+        fun_l3_n425(x)
+    end
+end
+
+def fun_l2_n800(x)
+    if (x < 1)
+        fun_l3_n381(x)
+    else
+        fun_l3_n618(x)
+    end
+end
+
+def fun_l2_n801(x)
+    if (x < 1)
+        fun_l3_n803(x)
+    else
+        fun_l3_n697(x)
+    end
+end
+
+def fun_l2_n802(x)
+    if (x < 1)
+        fun_l3_n372(x)
+    else
+        fun_l3_n331(x)
+    end
+end
+
+def fun_l2_n803(x)
+    if (x < 1)
+        fun_l3_n450(x)
+    else
+        fun_l3_n707(x)
+    end
+end
+
+def fun_l2_n804(x)
+    if (x < 1)
+        fun_l3_n760(x)
+    else
+        fun_l3_n800(x)
+    end
+end
+
+def fun_l2_n805(x)
+    if (x < 1)
+        fun_l3_n695(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n806(x)
+    if (x < 1)
+        fun_l3_n312(x)
+    else
+        fun_l3_n517(x)
+    end
+end
+
+def fun_l2_n807(x)
+    if (x < 1)
+        fun_l3_n794(x)
+    else
+        fun_l3_n37(x)
+    end
+end
+
+def fun_l2_n808(x)
+    if (x < 1)
+        fun_l3_n591(x)
+    else
+        fun_l3_n933(x)
+    end
+end
+
+def fun_l2_n809(x)
+    if (x < 1)
+        fun_l3_n974(x)
+    else
+        fun_l3_n69(x)
+    end
+end
+
+def fun_l2_n810(x)
+    if (x < 1)
+        fun_l3_n263(x)
+    else
+        fun_l3_n628(x)
+    end
+end
+
+def fun_l2_n811(x)
+    if (x < 1)
+        fun_l3_n647(x)
+    else
+        fun_l3_n133(x)
+    end
+end
+
+def fun_l2_n812(x)
+    if (x < 1)
+        fun_l3_n396(x)
+    else
+        fun_l3_n872(x)
+    end
+end
+
+def fun_l2_n813(x)
+    if (x < 1)
+        fun_l3_n716(x)
+    else
+        fun_l3_n254(x)
+    end
+end
+
+def fun_l2_n814(x)
+    if (x < 1)
+        fun_l3_n181(x)
+    else
+        fun_l3_n786(x)
+    end
+end
+
+def fun_l2_n815(x)
+    if (x < 1)
+        fun_l3_n163(x)
+    else
+        fun_l3_n175(x)
+    end
+end
+
+def fun_l2_n816(x)
+    if (x < 1)
+        fun_l3_n835(x)
+    else
+        fun_l3_n713(x)
+    end
+end
+
+def fun_l2_n817(x)
+    if (x < 1)
+        fun_l3_n54(x)
+    else
+        fun_l3_n280(x)
+    end
+end
+
+def fun_l2_n818(x)
+    if (x < 1)
+        fun_l3_n261(x)
+    else
+        fun_l3_n958(x)
+    end
+end
+
+def fun_l2_n819(x)
+    if (x < 1)
+        fun_l3_n821(x)
+    else
+        fun_l3_n418(x)
+    end
+end
+
+def fun_l2_n820(x)
+    if (x < 1)
+        fun_l3_n541(x)
+    else
+        fun_l3_n547(x)
+    end
+end
+
+def fun_l2_n821(x)
+    if (x < 1)
+        fun_l3_n726(x)
+    else
+        fun_l3_n386(x)
+    end
+end
+
+def fun_l2_n822(x)
+    if (x < 1)
+        fun_l3_n369(x)
+    else
+        fun_l3_n781(x)
+    end
+end
+
+def fun_l2_n823(x)
+    if (x < 1)
+        fun_l3_n392(x)
+    else
+        fun_l3_n357(x)
+    end
+end
+
+def fun_l2_n824(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n764(x)
+    end
+end
+
+def fun_l2_n825(x)
+    if (x < 1)
+        fun_l3_n339(x)
+    else
+        fun_l3_n853(x)
+    end
+end
+
+def fun_l2_n826(x)
+    if (x < 1)
+        fun_l3_n613(x)
+    else
+        fun_l3_n767(x)
+    end
+end
+
+def fun_l2_n827(x)
+    if (x < 1)
+        fun_l3_n31(x)
+    else
+        fun_l3_n35(x)
+    end
+end
+
+def fun_l2_n828(x)
+    if (x < 1)
+        fun_l3_n838(x)
+    else
+        fun_l3_n939(x)
+    end
+end
+
+def fun_l2_n829(x)
+    if (x < 1)
+        fun_l3_n344(x)
+    else
+        fun_l3_n568(x)
+    end
+end
+
+def fun_l2_n830(x)
+    if (x < 1)
+        fun_l3_n892(x)
+    else
+        fun_l3_n564(x)
+    end
+end
+
+def fun_l2_n831(x)
+    if (x < 1)
+        fun_l3_n520(x)
+    else
+        fun_l3_n897(x)
+    end
+end
+
+def fun_l2_n832(x)
+    if (x < 1)
+        fun_l3_n986(x)
+    else
+        fun_l3_n523(x)
+    end
+end
+
+def fun_l2_n833(x)
+    if (x < 1)
+        fun_l3_n649(x)
+    else
+        fun_l3_n776(x)
+    end
+end
+
+def fun_l2_n834(x)
+    if (x < 1)
+        fun_l3_n613(x)
+    else
+        fun_l3_n170(x)
+    end
+end
+
+def fun_l2_n835(x)
+    if (x < 1)
+        fun_l3_n657(x)
+    else
+        fun_l3_n790(x)
+    end
+end
+
+def fun_l2_n836(x)
+    if (x < 1)
+        fun_l3_n976(x)
+    else
+        fun_l3_n785(x)
+    end
+end
+
+def fun_l2_n837(x)
+    if (x < 1)
+        fun_l3_n746(x)
+    else
+        fun_l3_n448(x)
+    end
+end
+
+def fun_l2_n838(x)
+    if (x < 1)
+        fun_l3_n911(x)
+    else
+        fun_l3_n978(x)
+    end
+end
+
+def fun_l2_n839(x)
+    if (x < 1)
+        fun_l3_n917(x)
+    else
+        fun_l3_n484(x)
+    end
+end
+
+def fun_l2_n840(x)
+    if (x < 1)
+        fun_l3_n930(x)
+    else
+        fun_l3_n617(x)
+    end
+end
+
+def fun_l2_n841(x)
+    if (x < 1)
+        fun_l3_n753(x)
+    else
+        fun_l3_n587(x)
+    end
+end
+
+def fun_l2_n842(x)
+    if (x < 1)
+        fun_l3_n21(x)
+    else
+        fun_l3_n256(x)
+    end
+end
+
+def fun_l2_n843(x)
+    if (x < 1)
+        fun_l3_n697(x)
+    else
+        fun_l3_n828(x)
+    end
+end
+
+def fun_l2_n844(x)
+    if (x < 1)
+        fun_l3_n59(x)
+    else
+        fun_l3_n855(x)
+    end
+end
+
+def fun_l2_n845(x)
+    if (x < 1)
+        fun_l3_n637(x)
+    else
+        fun_l3_n667(x)
+    end
+end
+
+def fun_l2_n846(x)
+    if (x < 1)
+        fun_l3_n229(x)
+    else
+        fun_l3_n379(x)
+    end
+end
+
+def fun_l2_n847(x)
+    if (x < 1)
+        fun_l3_n908(x)
+    else
+        fun_l3_n53(x)
+    end
+end
+
+def fun_l2_n848(x)
+    if (x < 1)
+        fun_l3_n72(x)
+    else
+        fun_l3_n882(x)
+    end
+end
+
+def fun_l2_n849(x)
+    if (x < 1)
+        fun_l3_n890(x)
+    else
+        fun_l3_n153(x)
+    end
+end
+
+def fun_l2_n850(x)
+    if (x < 1)
+        fun_l3_n301(x)
+    else
+        fun_l3_n404(x)
+    end
+end
+
+def fun_l2_n851(x)
+    if (x < 1)
+        fun_l3_n451(x)
+    else
+        fun_l3_n365(x)
+    end
+end
+
+def fun_l2_n852(x)
+    if (x < 1)
+        fun_l3_n591(x)
+    else
+        fun_l3_n974(x)
+    end
+end
+
+def fun_l2_n853(x)
+    if (x < 1)
+        fun_l3_n534(x)
+    else
+        fun_l3_n649(x)
+    end
+end
+
+def fun_l2_n854(x)
+    if (x < 1)
+        fun_l3_n438(x)
+    else
+        fun_l3_n853(x)
+    end
+end
+
+def fun_l2_n855(x)
+    if (x < 1)
+        fun_l3_n181(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n856(x)
+    if (x < 1)
+        fun_l3_n856(x)
+    else
+        fun_l3_n139(x)
+    end
+end
+
+def fun_l2_n857(x)
+    if (x < 1)
+        fun_l3_n664(x)
+    else
+        fun_l3_n659(x)
+    end
+end
+
+def fun_l2_n858(x)
+    if (x < 1)
+        fun_l3_n838(x)
+    else
+        fun_l3_n157(x)
+    end
+end
+
+def fun_l2_n859(x)
+    if (x < 1)
+        fun_l3_n542(x)
+    else
+        fun_l3_n512(x)
+    end
+end
+
+def fun_l2_n860(x)
+    if (x < 1)
+        fun_l3_n213(x)
+    else
+        fun_l3_n954(x)
+    end
+end
+
+def fun_l2_n861(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n525(x)
+    end
+end
+
+def fun_l2_n862(x)
+    if (x < 1)
+        fun_l3_n649(x)
+    else
+        fun_l3_n376(x)
+    end
+end
+
+def fun_l2_n863(x)
+    if (x < 1)
+        fun_l3_n846(x)
+    else
+        fun_l3_n643(x)
+    end
+end
+
+def fun_l2_n864(x)
+    if (x < 1)
+        fun_l3_n899(x)
+    else
+        fun_l3_n667(x)
+    end
+end
+
+def fun_l2_n865(x)
+    if (x < 1)
+        fun_l3_n326(x)
+    else
+        fun_l3_n664(x)
+    end
+end
+
+def fun_l2_n866(x)
+    if (x < 1)
+        fun_l3_n155(x)
+    else
+        fun_l3_n369(x)
+    end
+end
+
+def fun_l2_n867(x)
+    if (x < 1)
+        fun_l3_n583(x)
+    else
+        fun_l3_n12(x)
+    end
+end
+
+def fun_l2_n868(x)
+    if (x < 1)
+        fun_l3_n637(x)
+    else
+        fun_l3_n711(x)
+    end
+end
+
+def fun_l2_n869(x)
+    if (x < 1)
+        fun_l3_n120(x)
+    else
+        fun_l3_n449(x)
+    end
+end
+
+def fun_l2_n870(x)
+    if (x < 1)
+        fun_l3_n459(x)
+    else
+        fun_l3_n83(x)
+    end
+end
+
+def fun_l2_n871(x)
+    if (x < 1)
+        fun_l3_n298(x)
+    else
+        fun_l3_n6(x)
+    end
+end
+
+def fun_l2_n872(x)
+    if (x < 1)
+        fun_l3_n640(x)
+    else
+        fun_l3_n319(x)
+    end
+end
+
+def fun_l2_n873(x)
+    if (x < 1)
+        fun_l3_n777(x)
+    else
+        fun_l3_n903(x)
+    end
+end
+
+def fun_l2_n874(x)
+    if (x < 1)
+        fun_l3_n16(x)
+    else
+        fun_l3_n50(x)
+    end
+end
+
+def fun_l2_n875(x)
+    if (x < 1)
+        fun_l3_n732(x)
+    else
+        fun_l3_n711(x)
+    end
+end
+
+def fun_l2_n876(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n949(x)
+    end
+end
+
+def fun_l2_n877(x)
+    if (x < 1)
+        fun_l3_n992(x)
+    else
+        fun_l3_n592(x)
+    end
+end
+
+def fun_l2_n878(x)
+    if (x < 1)
+        fun_l3_n283(x)
+    else
+        fun_l3_n178(x)
+    end
+end
+
+def fun_l2_n879(x)
+    if (x < 1)
+        fun_l3_n179(x)
+    else
+        fun_l3_n963(x)
+    end
+end
+
+def fun_l2_n880(x)
+    if (x < 1)
+        fun_l3_n345(x)
+    else
+        fun_l3_n585(x)
+    end
+end
+
+def fun_l2_n881(x)
+    if (x < 1)
+        fun_l3_n859(x)
+    else
+        fun_l3_n204(x)
+    end
+end
+
+def fun_l2_n882(x)
+    if (x < 1)
+        fun_l3_n718(x)
+    else
+        fun_l3_n354(x)
+    end
+end
+
+def fun_l2_n883(x)
+    if (x < 1)
+        fun_l3_n58(x)
+    else
+        fun_l3_n34(x)
+    end
+end
+
+def fun_l2_n884(x)
+    if (x < 1)
+        fun_l3_n442(x)
+    else
+        fun_l3_n853(x)
+    end
+end
+
+def fun_l2_n885(x)
+    if (x < 1)
+        fun_l3_n37(x)
+    else
+        fun_l3_n665(x)
+    end
+end
+
+def fun_l2_n886(x)
+    if (x < 1)
+        fun_l3_n468(x)
+    else
+        fun_l3_n283(x)
+    end
+end
+
+def fun_l2_n887(x)
+    if (x < 1)
+        fun_l3_n674(x)
+    else
+        fun_l3_n940(x)
+    end
+end
+
+def fun_l2_n888(x)
+    if (x < 1)
+        fun_l3_n556(x)
+    else
+        fun_l3_n191(x)
+    end
+end
+
+def fun_l2_n889(x)
+    if (x < 1)
+        fun_l3_n451(x)
+    else
+        fun_l3_n33(x)
+    end
+end
+
+def fun_l2_n890(x)
+    if (x < 1)
+        fun_l3_n724(x)
+    else
+        fun_l3_n355(x)
+    end
+end
+
+def fun_l2_n891(x)
+    if (x < 1)
+        fun_l3_n811(x)
+    else
+        fun_l3_n969(x)
+    end
+end
+
+def fun_l2_n892(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n956(x)
+    end
+end
+
+def fun_l2_n893(x)
+    if (x < 1)
+        fun_l3_n416(x)
+    else
+        fun_l3_n373(x)
+    end
+end
+
+def fun_l2_n894(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n148(x)
+    end
+end
+
+def fun_l2_n895(x)
+    if (x < 1)
+        fun_l3_n52(x)
+    else
+        fun_l3_n605(x)
+    end
+end
+
+def fun_l2_n896(x)
+    if (x < 1)
+        fun_l3_n523(x)
+    else
+        fun_l3_n929(x)
+    end
+end
+
+def fun_l2_n897(x)
+    if (x < 1)
+        fun_l3_n631(x)
+    else
+        fun_l3_n167(x)
+    end
+end
+
+def fun_l2_n898(x)
+    if (x < 1)
+        fun_l3_n366(x)
+    else
+        fun_l3_n666(x)
+    end
+end
+
+def fun_l2_n899(x)
+    if (x < 1)
+        fun_l3_n758(x)
+    else
+        fun_l3_n441(x)
+    end
+end
+
+def fun_l2_n900(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n766(x)
+    end
+end
+
+def fun_l2_n901(x)
+    if (x < 1)
+        fun_l3_n323(x)
+    else
+        fun_l3_n348(x)
+    end
+end
+
+def fun_l2_n902(x)
+    if (x < 1)
+        fun_l3_n455(x)
+    else
+        fun_l3_n78(x)
+    end
+end
+
+def fun_l2_n903(x)
+    if (x < 1)
+        fun_l3_n373(x)
+    else
+        fun_l3_n646(x)
+    end
+end
+
+def fun_l2_n904(x)
+    if (x < 1)
+        fun_l3_n595(x)
+    else
+        fun_l3_n742(x)
+    end
+end
+
+def fun_l2_n905(x)
+    if (x < 1)
+        fun_l3_n102(x)
+    else
+        fun_l3_n140(x)
+    end
+end
+
+def fun_l2_n906(x)
+    if (x < 1)
+        fun_l3_n458(x)
+    else
+        fun_l3_n528(x)
+    end
+end
+
+def fun_l2_n907(x)
+    if (x < 1)
+        fun_l3_n970(x)
+    else
+        fun_l3_n841(x)
+    end
+end
+
+def fun_l2_n908(x)
+    if (x < 1)
+        fun_l3_n97(x)
+    else
+        fun_l3_n250(x)
+    end
+end
+
+def fun_l2_n909(x)
+    if (x < 1)
+        fun_l3_n381(x)
+    else
+        fun_l3_n44(x)
+    end
+end
+
+def fun_l2_n910(x)
+    if (x < 1)
+        fun_l3_n812(x)
+    else
+        fun_l3_n225(x)
+    end
+end
+
+def fun_l2_n911(x)
+    if (x < 1)
+        fun_l3_n849(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n912(x)
+    if (x < 1)
+        fun_l3_n958(x)
+    else
+        fun_l3_n590(x)
+    end
+end
+
+def fun_l2_n913(x)
+    if (x < 1)
+        fun_l3_n858(x)
+    else
+        fun_l3_n140(x)
+    end
+end
+
+def fun_l2_n914(x)
+    if (x < 1)
+        fun_l3_n997(x)
+    else
+        fun_l3_n959(x)
+    end
+end
+
+def fun_l2_n915(x)
+    if (x < 1)
+        fun_l3_n184(x)
+    else
+        fun_l3_n910(x)
+    end
+end
+
+def fun_l2_n916(x)
+    if (x < 1)
+        fun_l3_n369(x)
+    else
+        fun_l3_n180(x)
+    end
+end
+
+def fun_l2_n917(x)
+    if (x < 1)
+        fun_l3_n537(x)
+    else
+        fun_l3_n927(x)
+    end
+end
+
+def fun_l2_n918(x)
+    if (x < 1)
+        fun_l3_n739(x)
+    else
+        fun_l3_n222(x)
+    end
+end
+
+def fun_l2_n919(x)
+    if (x < 1)
+        fun_l3_n640(x)
+    else
+        fun_l3_n406(x)
+    end
+end
+
+def fun_l2_n920(x)
+    if (x < 1)
+        fun_l3_n371(x)
+    else
+        fun_l3_n976(x)
+    end
+end
+
+def fun_l2_n921(x)
+    if (x < 1)
+        fun_l3_n262(x)
+    else
+        fun_l3_n532(x)
+    end
+end
+
+def fun_l2_n922(x)
+    if (x < 1)
+        fun_l3_n772(x)
+    else
+        fun_l3_n368(x)
+    end
+end
+
+def fun_l2_n923(x)
+    if (x < 1)
+        fun_l3_n935(x)
+    else
+        fun_l3_n109(x)
+    end
+end
+
+def fun_l2_n924(x)
+    if (x < 1)
+        fun_l3_n982(x)
+    else
+        fun_l3_n643(x)
+    end
+end
+
+def fun_l2_n925(x)
+    if (x < 1)
+        fun_l3_n849(x)
+    else
+        fun_l3_n266(x)
+    end
+end
+
+def fun_l2_n926(x)
+    if (x < 1)
+        fun_l3_n977(x)
+    else
+        fun_l3_n803(x)
+    end
+end
+
+def fun_l2_n927(x)
+    if (x < 1)
+        fun_l3_n706(x)
+    else
+        fun_l3_n441(x)
+    end
+end
+
+def fun_l2_n928(x)
+    if (x < 1)
+        fun_l3_n781(x)
+    else
+        fun_l3_n374(x)
+    end
+end
+
+def fun_l2_n929(x)
+    if (x < 1)
+        fun_l3_n122(x)
+    else
+        fun_l3_n851(x)
+    end
+end
+
+def fun_l2_n930(x)
+    if (x < 1)
+        fun_l3_n821(x)
+    else
+        fun_l3_n904(x)
+    end
+end
+
+def fun_l2_n931(x)
+    if (x < 1)
+        fun_l3_n379(x)
+    else
+        fun_l3_n211(x)
+    end
+end
+
+def fun_l2_n932(x)
+    if (x < 1)
+        fun_l3_n572(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n933(x)
+    if (x < 1)
+        fun_l3_n620(x)
+    else
+        fun_l3_n703(x)
+    end
+end
+
+def fun_l2_n934(x)
+    if (x < 1)
+        fun_l3_n238(x)
+    else
+        fun_l3_n220(x)
+    end
+end
+
+def fun_l2_n935(x)
+    if (x < 1)
+        fun_l3_n652(x)
+    else
+        fun_l3_n822(x)
+    end
+end
+
+def fun_l2_n936(x)
+    if (x < 1)
+        fun_l3_n818(x)
+    else
+        fun_l3_n384(x)
+    end
+end
+
+def fun_l2_n937(x)
+    if (x < 1)
+        fun_l3_n560(x)
+    else
+        fun_l3_n875(x)
+    end
+end
+
+def fun_l2_n938(x)
+    if (x < 1)
+        fun_l3_n417(x)
+    else
+        fun_l3_n900(x)
+    end
+end
+
+def fun_l2_n939(x)
+    if (x < 1)
+        fun_l3_n740(x)
+    else
+        fun_l3_n431(x)
+    end
+end
+
+def fun_l2_n940(x)
+    if (x < 1)
+        fun_l3_n1(x)
+    else
+        fun_l3_n147(x)
+    end
+end
+
+def fun_l2_n941(x)
+    if (x < 1)
+        fun_l3_n64(x)
+    else
+        fun_l3_n317(x)
+    end
+end
+
+def fun_l2_n942(x)
+    if (x < 1)
+        fun_l3_n347(x)
+    else
+        fun_l3_n778(x)
+    end
+end
+
+def fun_l2_n943(x)
+    if (x < 1)
+        fun_l3_n819(x)
+    else
+        fun_l3_n446(x)
+    end
+end
+
+def fun_l2_n944(x)
+    if (x < 1)
+        fun_l3_n492(x)
+    else
+        fun_l3_n381(x)
+    end
+end
+
+def fun_l2_n945(x)
+    if (x < 1)
+        fun_l3_n594(x)
+    else
+        fun_l3_n413(x)
+    end
+end
+
+def fun_l2_n946(x)
+    if (x < 1)
+        fun_l3_n580(x)
+    else
+        fun_l3_n838(x)
+    end
+end
+
+def fun_l2_n947(x)
+    if (x < 1)
+        fun_l3_n880(x)
+    else
+        fun_l3_n768(x)
+    end
+end
+
+def fun_l2_n948(x)
+    if (x < 1)
+        fun_l3_n9(x)
+    else
+        fun_l3_n888(x)
+    end
+end
+
+def fun_l2_n949(x)
+    if (x < 1)
+        fun_l3_n365(x)
+    else
+        fun_l3_n322(x)
+    end
+end
+
+def fun_l2_n950(x)
+    if (x < 1)
+        fun_l3_n283(x)
+    else
+        fun_l3_n921(x)
+    end
+end
+
+def fun_l2_n951(x)
+    if (x < 1)
+        fun_l3_n740(x)
+    else
+        fun_l3_n336(x)
+    end
+end
+
+def fun_l2_n952(x)
+    if (x < 1)
+        fun_l3_n827(x)
+    else
+        fun_l3_n683(x)
+    end
+end
+
+def fun_l2_n953(x)
+    if (x < 1)
+        fun_l3_n289(x)
+    else
+        fun_l3_n915(x)
+    end
+end
+
+def fun_l2_n954(x)
+    if (x < 1)
+        fun_l3_n234(x)
+    else
+        fun_l3_n198(x)
+    end
+end
+
+def fun_l2_n955(x)
+    if (x < 1)
+        fun_l3_n364(x)
+    else
+        fun_l3_n152(x)
+    end
+end
+
+def fun_l2_n956(x)
+    if (x < 1)
+        fun_l3_n370(x)
+    else
+        fun_l3_n786(x)
+    end
+end
+
+def fun_l2_n957(x)
+    if (x < 1)
+        fun_l3_n672(x)
+    else
+        fun_l3_n375(x)
+    end
+end
+
+def fun_l2_n958(x)
+    if (x < 1)
+        fun_l3_n423(x)
+    else
+        fun_l3_n448(x)
+    end
+end
+
+def fun_l2_n959(x)
+    if (x < 1)
+        fun_l3_n887(x)
+    else
+        fun_l3_n33(x)
+    end
+end
+
+def fun_l2_n960(x)
+    if (x < 1)
+        fun_l3_n280(x)
+    else
+        fun_l3_n334(x)
+    end
+end
+
+def fun_l2_n961(x)
+    if (x < 1)
+        fun_l3_n535(x)
+    else
+        fun_l3_n524(x)
+    end
+end
+
+def fun_l2_n962(x)
+    if (x < 1)
+        fun_l3_n689(x)
+    else
+        fun_l3_n426(x)
+    end
+end
+
+def fun_l2_n963(x)
+    if (x < 1)
+        fun_l3_n235(x)
+    else
+        fun_l3_n286(x)
+    end
+end
+
+def fun_l2_n964(x)
+    if (x < 1)
+        fun_l3_n116(x)
+    else
+        fun_l3_n308(x)
+    end
+end
+
+def fun_l2_n965(x)
+    if (x < 1)
+        fun_l3_n174(x)
+    else
+        fun_l3_n823(x)
+    end
+end
+
+def fun_l2_n966(x)
+    if (x < 1)
+        fun_l3_n792(x)
+    else
+        fun_l3_n29(x)
+    end
+end
+
+def fun_l2_n967(x)
+    if (x < 1)
+        fun_l3_n755(x)
+    else
+        fun_l3_n689(x)
+    end
+end
+
+def fun_l2_n968(x)
+    if (x < 1)
+        fun_l3_n167(x)
+    else
+        fun_l3_n287(x)
+    end
+end
+
+def fun_l2_n969(x)
+    if (x < 1)
+        fun_l3_n836(x)
+    else
+        fun_l3_n892(x)
+    end
+end
+
+def fun_l2_n970(x)
+    if (x < 1)
+        fun_l3_n201(x)
+    else
+        fun_l3_n677(x)
+    end
+end
+
+def fun_l2_n971(x)
+    if (x < 1)
+        fun_l3_n990(x)
+    else
+        fun_l3_n251(x)
+    end
+end
+
+def fun_l2_n972(x)
+    if (x < 1)
+        fun_l3_n500(x)
+    else
+        fun_l3_n686(x)
+    end
+end
+
+def fun_l2_n973(x)
+    if (x < 1)
+        fun_l3_n969(x)
+    else
+        fun_l3_n819(x)
+    end
+end
+
+def fun_l2_n974(x)
+    if (x < 1)
+        fun_l3_n87(x)
+    else
+        fun_l3_n120(x)
+    end
+end
+
+def fun_l2_n975(x)
+    if (x < 1)
+        fun_l3_n701(x)
+    else
+        fun_l3_n569(x)
+    end
+end
+
+def fun_l2_n976(x)
+    if (x < 1)
+        fun_l3_n128(x)
+    else
+        fun_l3_n310(x)
+    end
+end
+
+def fun_l2_n977(x)
+    if (x < 1)
+        fun_l3_n690(x)
+    else
+        fun_l3_n5(x)
+    end
+end
+
+def fun_l2_n978(x)
+    if (x < 1)
+        fun_l3_n432(x)
+    else
+        fun_l3_n964(x)
+    end
+end
+
+def fun_l2_n979(x)
+    if (x < 1)
+        fun_l3_n198(x)
+    else
+        fun_l3_n161(x)
+    end
+end
+
+def fun_l2_n980(x)
+    if (x < 1)
+        fun_l3_n415(x)
+    else
+        fun_l3_n768(x)
+    end
+end
+
+def fun_l2_n981(x)
+    if (x < 1)
+        fun_l3_n635(x)
+    else
+        fun_l3_n569(x)
+    end
+end
+
+def fun_l2_n982(x)
+    if (x < 1)
+        fun_l3_n326(x)
+    else
+        fun_l3_n338(x)
+    end
+end
+
+def fun_l2_n983(x)
+    if (x < 1)
+        fun_l3_n243(x)
+    else
+        fun_l3_n48(x)
+    end
+end
+
+def fun_l2_n984(x)
+    if (x < 1)
+        fun_l3_n204(x)
+    else
+        fun_l3_n141(x)
+    end
+end
+
+def fun_l2_n985(x)
+    if (x < 1)
+        fun_l3_n805(x)
+    else
+        fun_l3_n577(x)
+    end
+end
+
+def fun_l2_n986(x)
+    if (x < 1)
+        fun_l3_n237(x)
+    else
+        fun_l3_n833(x)
+    end
+end
+
+def fun_l2_n987(x)
+    if (x < 1)
+        fun_l3_n643(x)
+    else
+        fun_l3_n629(x)
+    end
+end
+
+def fun_l2_n988(x)
+    if (x < 1)
+        fun_l3_n911(x)
+    else
+        fun_l3_n712(x)
+    end
+end
+
+def fun_l2_n989(x)
+    if (x < 1)
+        fun_l3_n936(x)
+    else
+        fun_l3_n300(x)
+    end
+end
+
+def fun_l2_n990(x)
+    if (x < 1)
+        fun_l3_n561(x)
+    else
+        fun_l3_n281(x)
+    end
+end
+
+def fun_l2_n991(x)
+    if (x < 1)
+        fun_l3_n226(x)
+    else
+        fun_l3_n203(x)
+    end
+end
+
+def fun_l2_n992(x)
+    if (x < 1)
+        fun_l3_n727(x)
+    else
+        fun_l3_n437(x)
+    end
+end
+
+def fun_l2_n993(x)
+    if (x < 1)
+        fun_l3_n608(x)
+    else
+        fun_l3_n169(x)
+    end
+end
+
+def fun_l2_n994(x)
+    if (x < 1)
+        fun_l3_n30(x)
+    else
+        fun_l3_n980(x)
+    end
+end
+
+def fun_l2_n995(x)
+    if (x < 1)
+        fun_l3_n652(x)
+    else
+        fun_l3_n122(x)
+    end
+end
+
+def fun_l2_n996(x)
+    if (x < 1)
+        fun_l3_n334(x)
+    else
+        fun_l3_n668(x)
+    end
+end
+
+def fun_l2_n997(x)
+    if (x < 1)
+        fun_l3_n241(x)
+    else
+        fun_l3_n515(x)
+    end
+end
+
+def fun_l2_n998(x)
+    if (x < 1)
+        fun_l3_n665(x)
+    else
+        fun_l3_n54(x)
+    end
+end
+
+def fun_l2_n999(x)
+    if (x < 1)
+        fun_l3_n568(x)
+    else
+        fun_l3_n652(x)
+    end
+end
+
+def fun_l3_n0(x)
+    if (x < 1)
+        fun_l4_n169(x)
+    else
+        fun_l4_n923(x)
+    end
+end
+
+def fun_l3_n1(x)
+    if (x < 1)
+        fun_l4_n214(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n2(x)
+    if (x < 1)
+        fun_l4_n513(x)
+    else
+        fun_l4_n409(x)
+    end
+end
+
+def fun_l3_n3(x)
+    if (x < 1)
+        fun_l4_n133(x)
+    else
+        fun_l4_n293(x)
+    end
+end
+
+def fun_l3_n4(x)
+    if (x < 1)
+        fun_l4_n550(x)
+    else
+        fun_l4_n95(x)
+    end
+end
+
+def fun_l3_n5(x)
+    if (x < 1)
+        fun_l4_n13(x)
+    else
+        fun_l4_n508(x)
+    end
+end
+
+def fun_l3_n6(x)
+    if (x < 1)
+        fun_l4_n607(x)
+    else
+        fun_l4_n140(x)
+    end
+end
+
+def fun_l3_n7(x)
+    if (x < 1)
+        fun_l4_n65(x)
+    else
+        fun_l4_n90(x)
+    end
+end
+
+def fun_l3_n8(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n9(x)
+    if (x < 1)
+        fun_l4_n713(x)
+    else
+        fun_l4_n487(x)
+    end
+end
+
+def fun_l3_n10(x)
+    if (x < 1)
+        fun_l4_n16(x)
+    else
+        fun_l4_n547(x)
+    end
+end
+
+def fun_l3_n11(x)
+    if (x < 1)
+        fun_l4_n561(x)
+    else
+        fun_l4_n530(x)
+    end
+end
+
+def fun_l3_n12(x)
+    if (x < 1)
+        fun_l4_n866(x)
+    else
+        fun_l4_n187(x)
+    end
+end
+
+def fun_l3_n13(x)
+    if (x < 1)
+        fun_l4_n8(x)
+    else
+        fun_l4_n458(x)
+    end
+end
+
+def fun_l3_n14(x)
+    if (x < 1)
+        fun_l4_n627(x)
+    else
+        fun_l4_n122(x)
+    end
+end
+
+def fun_l3_n15(x)
+    if (x < 1)
+        fun_l4_n988(x)
+    else
+        fun_l4_n4(x)
+    end
+end
+
+def fun_l3_n16(x)
+    if (x < 1)
+        fun_l4_n654(x)
+    else
+        fun_l4_n863(x)
+    end
+end
+
+def fun_l3_n17(x)
+    if (x < 1)
+        fun_l4_n112(x)
+    else
+        fun_l4_n223(x)
+    end
+end
+
+def fun_l3_n18(x)
+    if (x < 1)
+        fun_l4_n808(x)
+    else
+        fun_l4_n161(x)
+    end
+end
+
+def fun_l3_n19(x)
+    if (x < 1)
+        fun_l4_n265(x)
+    else
+        fun_l4_n860(x)
+    end
+end
+
+def fun_l3_n20(x)
+    if (x < 1)
+        fun_l4_n60(x)
+    else
+        fun_l4_n943(x)
+    end
+end
+
+def fun_l3_n21(x)
+    if (x < 1)
+        fun_l4_n707(x)
+    else
+        fun_l4_n990(x)
+    end
+end
+
+def fun_l3_n22(x)
+    if (x < 1)
+        fun_l4_n774(x)
+    else
+        fun_l4_n686(x)
+    end
+end
+
+def fun_l3_n23(x)
+    if (x < 1)
+        fun_l4_n552(x)
+    else
+        fun_l4_n935(x)
+    end
+end
+
+def fun_l3_n24(x)
+    if (x < 1)
+        fun_l4_n752(x)
+    else
+        fun_l4_n279(x)
+    end
+end
+
+def fun_l3_n25(x)
+    if (x < 1)
+        fun_l4_n325(x)
+    else
+        fun_l4_n440(x)
+    end
+end
+
+def fun_l3_n26(x)
+    if (x < 1)
+        fun_l4_n330(x)
+    else
+        fun_l4_n233(x)
+    end
+end
+
+def fun_l3_n27(x)
+    if (x < 1)
+        fun_l4_n112(x)
+    else
+        fun_l4_n399(x)
+    end
+end
+
+def fun_l3_n28(x)
+    if (x < 1)
+        fun_l4_n420(x)
+    else
+        fun_l4_n570(x)
+    end
+end
+
+def fun_l3_n29(x)
+    if (x < 1)
+        fun_l4_n515(x)
+    else
+        fun_l4_n485(x)
+    end
+end
+
+def fun_l3_n30(x)
+    if (x < 1)
+        fun_l4_n694(x)
+    else
+        fun_l4_n279(x)
+    end
+end
+
+def fun_l3_n31(x)
+    if (x < 1)
+        fun_l4_n683(x)
+    else
+        fun_l4_n396(x)
+    end
+end
+
+def fun_l3_n32(x)
+    if (x < 1)
+        fun_l4_n997(x)
+    else
+        fun_l4_n978(x)
+    end
+end
+
+def fun_l3_n33(x)
+    if (x < 1)
+        fun_l4_n260(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n34(x)
+    if (x < 1)
+        fun_l4_n510(x)
+    else
+        fun_l4_n147(x)
+    end
+end
+
+def fun_l3_n35(x)
+    if (x < 1)
+        fun_l4_n415(x)
+    else
+        fun_l4_n590(x)
+    end
+end
+
+def fun_l3_n36(x)
+    if (x < 1)
+        fun_l4_n164(x)
+    else
+        fun_l4_n990(x)
+    end
+end
+
+def fun_l3_n37(x)
+    if (x < 1)
+        fun_l4_n744(x)
+    else
+        fun_l4_n981(x)
+    end
+end
+
+def fun_l3_n38(x)
+    if (x < 1)
+        fun_l4_n243(x)
+    else
+        fun_l4_n385(x)
+    end
+end
+
+def fun_l3_n39(x)
+    if (x < 1)
+        fun_l4_n874(x)
+    else
+        fun_l4_n941(x)
+    end
+end
+
+def fun_l3_n40(x)
+    if (x < 1)
+        fun_l4_n39(x)
+    else
+        fun_l4_n115(x)
+    end
+end
+
+def fun_l3_n41(x)
+    if (x < 1)
+        fun_l4_n829(x)
+    else
+        fun_l4_n991(x)
+    end
+end
+
+def fun_l3_n42(x)
+    if (x < 1)
+        fun_l4_n234(x)
+    else
+        fun_l4_n359(x)
+    end
+end
+
+def fun_l3_n43(x)
+    if (x < 1)
+        fun_l4_n481(x)
+    else
+        fun_l4_n368(x)
+    end
+end
+
+def fun_l3_n44(x)
+    if (x < 1)
+        fun_l4_n969(x)
+    else
+        fun_l4_n716(x)
+    end
+end
+
+def fun_l3_n45(x)
+    if (x < 1)
+        fun_l4_n858(x)
+    else
+        fun_l4_n446(x)
+    end
+end
+
+def fun_l3_n46(x)
+    if (x < 1)
+        fun_l4_n786(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n47(x)
+    if (x < 1)
+        fun_l4_n261(x)
+    else
+        fun_l4_n346(x)
+    end
+end
+
+def fun_l3_n48(x)
+    if (x < 1)
+        fun_l4_n422(x)
+    else
+        fun_l4_n710(x)
+    end
+end
+
+def fun_l3_n49(x)
+    if (x < 1)
+        fun_l4_n533(x)
+    else
+        fun_l4_n599(x)
+    end
+end
+
+def fun_l3_n50(x)
+    if (x < 1)
+        fun_l4_n922(x)
+    else
+        fun_l4_n90(x)
+    end
+end
+
+def fun_l3_n51(x)
+    if (x < 1)
+        fun_l4_n718(x)
+    else
+        fun_l4_n854(x)
+    end
+end
+
+def fun_l3_n52(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n996(x)
+    end
+end
+
+def fun_l3_n53(x)
+    if (x < 1)
+        fun_l4_n628(x)
+    else
+        fun_l4_n589(x)
+    end
+end
+
+def fun_l3_n54(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n258(x)
+    end
+end
+
+def fun_l3_n55(x)
+    if (x < 1)
+        fun_l4_n794(x)
+    else
+        fun_l4_n559(x)
+    end
+end
+
+def fun_l3_n56(x)
+    if (x < 1)
+        fun_l4_n771(x)
+    else
+        fun_l4_n812(x)
+    end
+end
+
+def fun_l3_n57(x)
+    if (x < 1)
+        fun_l4_n106(x)
+    else
+        fun_l4_n144(x)
+    end
+end
+
+def fun_l3_n58(x)
+    if (x < 1)
+        fun_l4_n2(x)
+    else
+        fun_l4_n49(x)
+    end
+end
+
+def fun_l3_n59(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n164(x)
+    end
+end
+
+def fun_l3_n60(x)
+    if (x < 1)
+        fun_l4_n638(x)
+    else
+        fun_l4_n984(x)
+    end
+end
+
+def fun_l3_n61(x)
+    if (x < 1)
+        fun_l4_n144(x)
+    else
+        fun_l4_n236(x)
+    end
+end
+
+def fun_l3_n62(x)
+    if (x < 1)
+        fun_l4_n345(x)
+    else
+        fun_l4_n65(x)
+    end
+end
+
+def fun_l3_n63(x)
+    if (x < 1)
+        fun_l4_n112(x)
+    else
+        fun_l4_n216(x)
+    end
+end
+
+def fun_l3_n64(x)
+    if (x < 1)
+        fun_l4_n213(x)
+    else
+        fun_l4_n370(x)
+    end
+end
+
+def fun_l3_n65(x)
+    if (x < 1)
+        fun_l4_n845(x)
+    else
+        fun_l4_n672(x)
+    end
+end
+
+def fun_l3_n66(x)
+    if (x < 1)
+        fun_l4_n951(x)
+    else
+        fun_l4_n415(x)
+    end
+end
+
+def fun_l3_n67(x)
+    if (x < 1)
+        fun_l4_n997(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n68(x)
+    if (x < 1)
+        fun_l4_n595(x)
+    else
+        fun_l4_n517(x)
+    end
+end
+
+def fun_l3_n69(x)
+    if (x < 1)
+        fun_l4_n776(x)
+    else
+        fun_l4_n550(x)
+    end
+end
+
+def fun_l3_n70(x)
+    if (x < 1)
+        fun_l4_n360(x)
+    else
+        fun_l4_n836(x)
+    end
+end
+
+def fun_l3_n71(x)
+    if (x < 1)
+        fun_l4_n214(x)
+    else
+        fun_l4_n532(x)
+    end
+end
+
+def fun_l3_n72(x)
+    if (x < 1)
+        fun_l4_n138(x)
+    else
+        fun_l4_n881(x)
+    end
+end
+
+def fun_l3_n73(x)
+    if (x < 1)
+        fun_l4_n793(x)
+    else
+        fun_l4_n866(x)
+    end
+end
+
+def fun_l3_n74(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n730(x)
+    end
+end
+
+def fun_l3_n75(x)
+    if (x < 1)
+        fun_l4_n525(x)
+    else
+        fun_l4_n188(x)
+    end
+end
+
+def fun_l3_n76(x)
+    if (x < 1)
+        fun_l4_n528(x)
+    else
+        fun_l4_n723(x)
+    end
+end
+
+def fun_l3_n77(x)
+    if (x < 1)
+        fun_l4_n954(x)
+    else
+        fun_l4_n581(x)
+    end
+end
+
+def fun_l3_n78(x)
+    if (x < 1)
+        fun_l4_n614(x)
+    else
+        fun_l4_n941(x)
+    end
+end
+
+def fun_l3_n79(x)
+    if (x < 1)
+        fun_l4_n396(x)
+    else
+        fun_l4_n539(x)
+    end
+end
+
+def fun_l3_n80(x)
+    if (x < 1)
+        fun_l4_n1(x)
+    else
+        fun_l4_n708(x)
+    end
+end
+
+def fun_l3_n81(x)
+    if (x < 1)
+        fun_l4_n626(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n82(x)
+    if (x < 1)
+        fun_l4_n5(x)
+    else
+        fun_l4_n108(x)
+    end
+end
+
+def fun_l3_n83(x)
+    if (x < 1)
+        fun_l4_n683(x)
+    else
+        fun_l4_n679(x)
+    end
+end
+
+def fun_l3_n84(x)
+    if (x < 1)
+        fun_l4_n613(x)
+    else
+        fun_l4_n596(x)
+    end
+end
+
+def fun_l3_n85(x)
+    if (x < 1)
+        fun_l4_n490(x)
+    else
+        fun_l4_n178(x)
+    end
+end
+
+def fun_l3_n86(x)
+    if (x < 1)
+        fun_l4_n286(x)
+    else
+        fun_l4_n724(x)
+    end
+end
+
+def fun_l3_n87(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n711(x)
+    end
+end
+
+def fun_l3_n88(x)
+    if (x < 1)
+        fun_l4_n422(x)
+    else
+        fun_l4_n259(x)
+    end
+end
+
+def fun_l3_n89(x)
+    if (x < 1)
+        fun_l4_n938(x)
+    else
+        fun_l4_n123(x)
+    end
+end
+
+def fun_l3_n90(x)
+    if (x < 1)
+        fun_l4_n589(x)
+    else
+        fun_l4_n231(x)
+    end
+end
+
+def fun_l3_n91(x)
+    if (x < 1)
+        fun_l4_n484(x)
+    else
+        fun_l4_n439(x)
+    end
+end
+
+def fun_l3_n92(x)
+    if (x < 1)
+        fun_l4_n469(x)
+    else
+        fun_l4_n737(x)
+    end
+end
+
+def fun_l3_n93(x)
+    if (x < 1)
+        fun_l4_n93(x)
+    else
+        fun_l4_n907(x)
+    end
+end
+
+def fun_l3_n94(x)
+    if (x < 1)
+        fun_l4_n468(x)
+    else
+        fun_l4_n219(x)
+    end
+end
+
+def fun_l3_n95(x)
+    if (x < 1)
+        fun_l4_n409(x)
+    else
+        fun_l4_n921(x)
+    end
+end
+
+def fun_l3_n96(x)
+    if (x < 1)
+        fun_l4_n952(x)
+    else
+        fun_l4_n167(x)
+    end
+end
+
+def fun_l3_n97(x)
+    if (x < 1)
+        fun_l4_n177(x)
+    else
+        fun_l4_n462(x)
+    end
+end
+
+def fun_l3_n98(x)
+    if (x < 1)
+        fun_l4_n351(x)
+    else
+        fun_l4_n89(x)
+    end
+end
+
+def fun_l3_n99(x)
+    if (x < 1)
+        fun_l4_n869(x)
+    else
+        fun_l4_n502(x)
+    end
+end
+
+def fun_l3_n100(x)
+    if (x < 1)
+        fun_l4_n985(x)
+    else
+        fun_l4_n297(x)
+    end
+end
+
+def fun_l3_n101(x)
+    if (x < 1)
+        fun_l4_n48(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n102(x)
+    if (x < 1)
+        fun_l4_n92(x)
+    else
+        fun_l4_n36(x)
+    end
+end
+
+def fun_l3_n103(x)
+    if (x < 1)
+        fun_l4_n610(x)
+    else
+        fun_l4_n616(x)
+    end
+end
+
+def fun_l3_n104(x)
+    if (x < 1)
+        fun_l4_n472(x)
+    else
+        fun_l4_n689(x)
+    end
+end
+
+def fun_l3_n105(x)
+    if (x < 1)
+        fun_l4_n75(x)
+    else
+        fun_l4_n161(x)
+    end
+end
+
+def fun_l3_n106(x)
+    if (x < 1)
+        fun_l4_n300(x)
+    else
+        fun_l4_n767(x)
+    end
+end
+
+def fun_l3_n107(x)
+    if (x < 1)
+        fun_l4_n707(x)
+    else
+        fun_l4_n229(x)
+    end
+end
+
+def fun_l3_n108(x)
+    if (x < 1)
+        fun_l4_n761(x)
+    else
+        fun_l4_n97(x)
+    end
+end
+
+def fun_l3_n109(x)
+    if (x < 1)
+        fun_l4_n734(x)
+    else
+        fun_l4_n290(x)
+    end
+end
+
+def fun_l3_n110(x)
+    if (x < 1)
+        fun_l4_n819(x)
+    else
+        fun_l4_n567(x)
+    end
+end
+
+def fun_l3_n111(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n322(x)
+    end
+end
+
+def fun_l3_n112(x)
+    if (x < 1)
+        fun_l4_n907(x)
+    else
+        fun_l4_n667(x)
+    end
+end
+
+def fun_l3_n113(x)
+    if (x < 1)
+        fun_l4_n473(x)
+    else
+        fun_l4_n620(x)
+    end
+end
+
+def fun_l3_n114(x)
+    if (x < 1)
+        fun_l4_n278(x)
+    else
+        fun_l4_n998(x)
+    end
+end
+
+def fun_l3_n115(x)
+    if (x < 1)
+        fun_l4_n185(x)
+    else
+        fun_l4_n962(x)
+    end
+end
+
+def fun_l3_n116(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n993(x)
+    end
+end
+
+def fun_l3_n117(x)
+    if (x < 1)
+        fun_l4_n140(x)
+    else
+        fun_l4_n456(x)
+    end
+end
+
+def fun_l3_n118(x)
+    if (x < 1)
+        fun_l4_n920(x)
+    else
+        fun_l4_n701(x)
+    end
+end
+
+def fun_l3_n119(x)
+    if (x < 1)
+        fun_l4_n263(x)
+    else
+        fun_l4_n837(x)
+    end
+end
+
+def fun_l3_n120(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n964(x)
+    end
+end
+
+def fun_l3_n121(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n543(x)
+    end
+end
+
+def fun_l3_n122(x)
+    if (x < 1)
+        fun_l4_n51(x)
+    else
+        fun_l4_n453(x)
+    end
+end
+
+def fun_l3_n123(x)
+    if (x < 1)
+        fun_l4_n726(x)
+    else
+        fun_l4_n785(x)
+    end
+end
+
+def fun_l3_n124(x)
+    if (x < 1)
+        fun_l4_n932(x)
+    else
+        fun_l4_n583(x)
+    end
+end
+
+def fun_l3_n125(x)
+    if (x < 1)
+        fun_l4_n471(x)
+    else
+        fun_l4_n518(x)
+    end
+end
+
+def fun_l3_n126(x)
+    if (x < 1)
+        fun_l4_n351(x)
+    else
+        fun_l4_n825(x)
+    end
+end
+
+def fun_l3_n127(x)
+    if (x < 1)
+        fun_l4_n759(x)
+    else
+        fun_l4_n203(x)
+    end
+end
+
+def fun_l3_n128(x)
+    if (x < 1)
+        fun_l4_n336(x)
+    else
+        fun_l4_n861(x)
+    end
+end
+
+def fun_l3_n129(x)
+    if (x < 1)
+        fun_l4_n573(x)
+    else
+        fun_l4_n568(x)
+    end
+end
+
+def fun_l3_n130(x)
+    if (x < 1)
+        fun_l4_n788(x)
+    else
+        fun_l4_n259(x)
+    end
+end
+
+def fun_l3_n131(x)
+    if (x < 1)
+        fun_l4_n392(x)
+    else
+        fun_l4_n932(x)
+    end
+end
+
+def fun_l3_n132(x)
+    if (x < 1)
+        fun_l4_n919(x)
+    else
+        fun_l4_n650(x)
+    end
+end
+
+def fun_l3_n133(x)
+    if (x < 1)
+        fun_l4_n895(x)
+    else
+        fun_l4_n983(x)
+    end
+end
+
+def fun_l3_n134(x)
+    if (x < 1)
+        fun_l4_n389(x)
+    else
+        fun_l4_n358(x)
+    end
+end
+
+def fun_l3_n135(x)
+    if (x < 1)
+        fun_l4_n732(x)
+    else
+        fun_l4_n747(x)
+    end
+end
+
+def fun_l3_n136(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n592(x)
+    end
+end
+
+def fun_l3_n137(x)
+    if (x < 1)
+        fun_l4_n581(x)
+    else
+        fun_l4_n24(x)
+    end
+end
+
+def fun_l3_n138(x)
+    if (x < 1)
+        fun_l4_n932(x)
+    else
+        fun_l4_n599(x)
+    end
+end
+
+def fun_l3_n139(x)
+    if (x < 1)
+        fun_l4_n955(x)
+    else
+        fun_l4_n148(x)
+    end
+end
+
+def fun_l3_n140(x)
+    if (x < 1)
+        fun_l4_n332(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n141(x)
+    if (x < 1)
+        fun_l4_n152(x)
+    else
+        fun_l4_n696(x)
+    end
+end
+
+def fun_l3_n142(x)
+    if (x < 1)
+        fun_l4_n295(x)
+    else
+        fun_l4_n205(x)
+    end
+end
+
+def fun_l3_n143(x)
+    if (x < 1)
+        fun_l4_n543(x)
+    else
+        fun_l4_n951(x)
+    end
+end
+
+def fun_l3_n144(x)
+    if (x < 1)
+        fun_l4_n656(x)
+    else
+        fun_l4_n494(x)
+    end
+end
+
+def fun_l3_n145(x)
+    if (x < 1)
+        fun_l4_n729(x)
+    else
+        fun_l4_n749(x)
+    end
+end
+
+def fun_l3_n146(x)
+    if (x < 1)
+        fun_l4_n197(x)
+    else
+        fun_l4_n3(x)
+    end
+end
+
+def fun_l3_n147(x)
+    if (x < 1)
+        fun_l4_n519(x)
+    else
+        fun_l4_n36(x)
+    end
+end
+
+def fun_l3_n148(x)
+    if (x < 1)
+        fun_l4_n100(x)
+    else
+        fun_l4_n463(x)
+    end
+end
+
+def fun_l3_n149(x)
+    if (x < 1)
+        fun_l4_n890(x)
+    else
+        fun_l4_n947(x)
+    end
+end
+
+def fun_l3_n150(x)
+    if (x < 1)
+        fun_l4_n512(x)
+    else
+        fun_l4_n982(x)
+    end
+end
+
+def fun_l3_n151(x)
+    if (x < 1)
+        fun_l4_n750(x)
+    else
+        fun_l4_n781(x)
+    end
+end
+
+def fun_l3_n152(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n530(x)
+    end
+end
+
+def fun_l3_n153(x)
+    if (x < 1)
+        fun_l4_n189(x)
+    else
+        fun_l4_n209(x)
+    end
+end
+
+def fun_l3_n154(x)
+    if (x < 1)
+        fun_l4_n343(x)
+    else
+        fun_l4_n44(x)
+    end
+end
+
+def fun_l3_n155(x)
+    if (x < 1)
+        fun_l4_n536(x)
+    else
+        fun_l4_n228(x)
+    end
+end
+
+def fun_l3_n156(x)
+    if (x < 1)
+        fun_l4_n475(x)
+    else
+        fun_l4_n790(x)
+    end
+end
+
+def fun_l3_n157(x)
+    if (x < 1)
+        fun_l4_n954(x)
+    else
+        fun_l4_n242(x)
+    end
+end
+
+def fun_l3_n158(x)
+    if (x < 1)
+        fun_l4_n19(x)
+    else
+        fun_l4_n735(x)
+    end
+end
+
+def fun_l3_n159(x)
+    if (x < 1)
+        fun_l4_n900(x)
+    else
+        fun_l4_n456(x)
+    end
+end
+
+def fun_l3_n160(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n606(x)
+    end
+end
+
+def fun_l3_n161(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n622(x)
+    end
+end
+
+def fun_l3_n162(x)
+    if (x < 1)
+        fun_l4_n260(x)
+    else
+        fun_l4_n582(x)
+    end
+end
+
+def fun_l3_n163(x)
+    if (x < 1)
+        fun_l4_n713(x)
+    else
+        fun_l4_n601(x)
+    end
+end
+
+def fun_l3_n164(x)
+    if (x < 1)
+        fun_l4_n819(x)
+    else
+        fun_l4_n642(x)
+    end
+end
+
+def fun_l3_n165(x)
+    if (x < 1)
+        fun_l4_n45(x)
+    else
+        fun_l4_n777(x)
+    end
+end
+
+def fun_l3_n166(x)
+    if (x < 1)
+        fun_l4_n256(x)
+    else
+        fun_l4_n92(x)
+    end
+end
+
+def fun_l3_n167(x)
+    if (x < 1)
+        fun_l4_n975(x)
+    else
+        fun_l4_n962(x)
+    end
+end
+
+def fun_l3_n168(x)
+    if (x < 1)
+        fun_l4_n579(x)
+    else
+        fun_l4_n208(x)
+    end
+end
+
+def fun_l3_n169(x)
+    if (x < 1)
+        fun_l4_n133(x)
+    else
+        fun_l4_n636(x)
+    end
+end
+
+def fun_l3_n170(x)
+    if (x < 1)
+        fun_l4_n863(x)
+    else
+        fun_l4_n168(x)
+    end
+end
+
+def fun_l3_n171(x)
+    if (x < 1)
+        fun_l4_n396(x)
+    else
+        fun_l4_n654(x)
+    end
+end
+
+def fun_l3_n172(x)
+    if (x < 1)
+        fun_l4_n963(x)
+    else
+        fun_l4_n420(x)
+    end
+end
+
+def fun_l3_n173(x)
+    if (x < 1)
+        fun_l4_n487(x)
+    else
+        fun_l4_n573(x)
+    end
+end
+
+def fun_l3_n174(x)
+    if (x < 1)
+        fun_l4_n847(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n175(x)
+    if (x < 1)
+        fun_l4_n712(x)
+    else
+        fun_l4_n522(x)
+    end
+end
+
+def fun_l3_n176(x)
+    if (x < 1)
+        fun_l4_n292(x)
+    else
+        fun_l4_n717(x)
+    end
+end
+
+def fun_l3_n177(x)
+    if (x < 1)
+        fun_l4_n945(x)
+    else
+        fun_l4_n146(x)
+    end
+end
+
+def fun_l3_n178(x)
+    if (x < 1)
+        fun_l4_n163(x)
+    else
+        fun_l4_n28(x)
+    end
+end
+
+def fun_l3_n179(x)
+    if (x < 1)
+        fun_l4_n738(x)
+    else
+        fun_l4_n502(x)
+    end
+end
+
+def fun_l3_n180(x)
+    if (x < 1)
+        fun_l4_n8(x)
+    else
+        fun_l4_n56(x)
+    end
+end
+
+def fun_l3_n181(x)
+    if (x < 1)
+        fun_l4_n58(x)
+    else
+        fun_l4_n155(x)
+    end
+end
+
+def fun_l3_n182(x)
+    if (x < 1)
+        fun_l4_n298(x)
+    else
+        fun_l4_n580(x)
+    end
+end
+
+def fun_l3_n183(x)
+    if (x < 1)
+        fun_l4_n860(x)
+    else
+        fun_l4_n176(x)
+    end
+end
+
+def fun_l3_n184(x)
+    if (x < 1)
+        fun_l4_n108(x)
+    else
+        fun_l4_n986(x)
+    end
+end
+
+def fun_l3_n185(x)
+    if (x < 1)
+        fun_l4_n366(x)
+    else
+        fun_l4_n110(x)
+    end
+end
+
+def fun_l3_n186(x)
+    if (x < 1)
+        fun_l4_n177(x)
+    else
+        fun_l4_n158(x)
+    end
+end
+
+def fun_l3_n187(x)
+    if (x < 1)
+        fun_l4_n212(x)
+    else
+        fun_l4_n803(x)
+    end
+end
+
+def fun_l3_n188(x)
+    if (x < 1)
+        fun_l4_n946(x)
+    else
+        fun_l4_n281(x)
+    end
+end
+
+def fun_l3_n189(x)
+    if (x < 1)
+        fun_l4_n610(x)
+    else
+        fun_l4_n691(x)
+    end
+end
+
+def fun_l3_n190(x)
+    if (x < 1)
+        fun_l4_n784(x)
+    else
+        fun_l4_n300(x)
+    end
+end
+
+def fun_l3_n191(x)
+    if (x < 1)
+        fun_l4_n272(x)
+    else
+        fun_l4_n809(x)
+    end
+end
+
+def fun_l3_n192(x)
+    if (x < 1)
+        fun_l4_n812(x)
+    else
+        fun_l4_n633(x)
+    end
+end
+
+def fun_l3_n193(x)
+    if (x < 1)
+        fun_l4_n880(x)
+    else
+        fun_l4_n267(x)
+    end
+end
+
+def fun_l3_n194(x)
+    if (x < 1)
+        fun_l4_n454(x)
+    else
+        fun_l4_n567(x)
+    end
+end
+
+def fun_l3_n195(x)
+    if (x < 1)
+        fun_l4_n919(x)
+    else
+        fun_l4_n184(x)
+    end
+end
+
+def fun_l3_n196(x)
+    if (x < 1)
+        fun_l4_n294(x)
+    else
+        fun_l4_n150(x)
+    end
+end
+
+def fun_l3_n197(x)
+    if (x < 1)
+        fun_l4_n543(x)
+    else
+        fun_l4_n319(x)
+    end
+end
+
+def fun_l3_n198(x)
+    if (x < 1)
+        fun_l4_n91(x)
+    else
+        fun_l4_n378(x)
+    end
+end
+
+def fun_l3_n199(x)
+    if (x < 1)
+        fun_l4_n590(x)
+    else
+        fun_l4_n195(x)
+    end
+end
+
+def fun_l3_n200(x)
+    if (x < 1)
+        fun_l4_n532(x)
+    else
+        fun_l4_n346(x)
+    end
+end
+
+def fun_l3_n201(x)
+    if (x < 1)
+        fun_l4_n340(x)
+    else
+        fun_l4_n129(x)
+    end
+end
+
+def fun_l3_n202(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n676(x)
+    end
+end
+
+def fun_l3_n203(x)
+    if (x < 1)
+        fun_l4_n210(x)
+    else
+        fun_l4_n982(x)
+    end
+end
+
+def fun_l3_n204(x)
+    if (x < 1)
+        fun_l4_n247(x)
+    else
+        fun_l4_n550(x)
+    end
+end
+
+def fun_l3_n205(x)
+    if (x < 1)
+        fun_l4_n727(x)
+    else
+        fun_l4_n737(x)
+    end
+end
+
+def fun_l3_n206(x)
+    if (x < 1)
+        fun_l4_n111(x)
+    else
+        fun_l4_n952(x)
+    end
+end
+
+def fun_l3_n207(x)
+    if (x < 1)
+        fun_l4_n996(x)
+    else
+        fun_l4_n865(x)
+    end
+end
+
+def fun_l3_n208(x)
+    if (x < 1)
+        fun_l4_n945(x)
+    else
+        fun_l4_n488(x)
+    end
+end
+
+def fun_l3_n209(x)
+    if (x < 1)
+        fun_l4_n697(x)
+    else
+        fun_l4_n366(x)
+    end
+end
+
+def fun_l3_n210(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n995(x)
+    end
+end
+
+def fun_l3_n211(x)
+    if (x < 1)
+        fun_l4_n972(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n212(x)
+    if (x < 1)
+        fun_l4_n58(x)
+    else
+        fun_l4_n430(x)
+    end
+end
+
+def fun_l3_n213(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n703(x)
+    end
+end
+
+def fun_l3_n214(x)
+    if (x < 1)
+        fun_l4_n882(x)
+    else
+        fun_l4_n648(x)
+    end
+end
+
+def fun_l3_n215(x)
+    if (x < 1)
+        fun_l4_n800(x)
+    else
+        fun_l4_n680(x)
+    end
+end
+
+def fun_l3_n216(x)
+    if (x < 1)
+        fun_l4_n205(x)
+    else
+        fun_l4_n185(x)
+    end
+end
+
+def fun_l3_n217(x)
+    if (x < 1)
+        fun_l4_n242(x)
+    else
+        fun_l4_n834(x)
+    end
+end
+
+def fun_l3_n218(x)
+    if (x < 1)
+        fun_l4_n551(x)
+    else
+        fun_l4_n399(x)
+    end
+end
+
+def fun_l3_n219(x)
+    if (x < 1)
+        fun_l4_n820(x)
+    else
+        fun_l4_n403(x)
+    end
+end
+
+def fun_l3_n220(x)
+    if (x < 1)
+        fun_l4_n874(x)
+    else
+        fun_l4_n584(x)
+    end
+end
+
+def fun_l3_n221(x)
+    if (x < 1)
+        fun_l4_n845(x)
+    else
+        fun_l4_n56(x)
+    end
+end
+
+def fun_l3_n222(x)
+    if (x < 1)
+        fun_l4_n947(x)
+    else
+        fun_l4_n299(x)
+    end
+end
+
+def fun_l3_n223(x)
+    if (x < 1)
+        fun_l4_n533(x)
+    else
+        fun_l4_n184(x)
+    end
+end
+
+def fun_l3_n224(x)
+    if (x < 1)
+        fun_l4_n760(x)
+    else
+        fun_l4_n507(x)
+    end
+end
+
+def fun_l3_n225(x)
+    if (x < 1)
+        fun_l4_n47(x)
+    else
+        fun_l4_n712(x)
+    end
+end
+
+def fun_l3_n226(x)
+    if (x < 1)
+        fun_l4_n470(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n227(x)
+    if (x < 1)
+        fun_l4_n932(x)
+    else
+        fun_l4_n292(x)
+    end
+end
+
+def fun_l3_n228(x)
+    if (x < 1)
+        fun_l4_n44(x)
+    else
+        fun_l4_n855(x)
+    end
+end
+
+def fun_l3_n229(x)
+    if (x < 1)
+        fun_l4_n385(x)
+    else
+        fun_l4_n284(x)
+    end
+end
+
+def fun_l3_n230(x)
+    if (x < 1)
+        fun_l4_n272(x)
+    else
+        fun_l4_n407(x)
+    end
+end
+
+def fun_l3_n231(x)
+    if (x < 1)
+        fun_l4_n820(x)
+    else
+        fun_l4_n375(x)
+    end
+end
+
+def fun_l3_n232(x)
+    if (x < 1)
+        fun_l4_n165(x)
+    else
+        fun_l4_n38(x)
+    end
+end
+
+def fun_l3_n233(x)
+    if (x < 1)
+        fun_l4_n772(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n234(x)
+    if (x < 1)
+        fun_l4_n980(x)
+    else
+        fun_l4_n678(x)
+    end
+end
+
+def fun_l3_n235(x)
+    if (x < 1)
+        fun_l4_n279(x)
+    else
+        fun_l4_n834(x)
+    end
+end
+
+def fun_l3_n236(x)
+    if (x < 1)
+        fun_l4_n227(x)
+    else
+        fun_l4_n11(x)
+    end
+end
+
+def fun_l3_n237(x)
+    if (x < 1)
+        fun_l4_n724(x)
+    else
+        fun_l4_n659(x)
+    end
+end
+
+def fun_l3_n238(x)
+    if (x < 1)
+        fun_l4_n569(x)
+    else
+        fun_l4_n693(x)
+    end
+end
+
+def fun_l3_n239(x)
+    if (x < 1)
+        fun_l4_n933(x)
+    else
+        fun_l4_n897(x)
+    end
+end
+
+def fun_l3_n240(x)
+    if (x < 1)
+        fun_l4_n215(x)
+    else
+        fun_l4_n784(x)
+    end
+end
+
+def fun_l3_n241(x)
+    if (x < 1)
+        fun_l4_n964(x)
+    else
+        fun_l4_n430(x)
+    end
+end
+
+def fun_l3_n242(x)
+    if (x < 1)
+        fun_l4_n91(x)
+    else
+        fun_l4_n190(x)
+    end
+end
+
+def fun_l3_n243(x)
+    if (x < 1)
+        fun_l4_n375(x)
+    else
+        fun_l4_n638(x)
+    end
+end
+
+def fun_l3_n244(x)
+    if (x < 1)
+        fun_l4_n381(x)
+    else
+        fun_l4_n324(x)
+    end
+end
+
+def fun_l3_n245(x)
+    if (x < 1)
+        fun_l4_n983(x)
+    else
+        fun_l4_n248(x)
+    end
+end
+
+def fun_l3_n246(x)
+    if (x < 1)
+        fun_l4_n336(x)
+    else
+        fun_l4_n647(x)
+    end
+end
+
+def fun_l3_n247(x)
+    if (x < 1)
+        fun_l4_n64(x)
+    else
+        fun_l4_n957(x)
+    end
+end
+
+def fun_l3_n248(x)
+    if (x < 1)
+        fun_l4_n313(x)
+    else
+        fun_l4_n662(x)
+    end
+end
+
+def fun_l3_n249(x)
+    if (x < 1)
+        fun_l4_n528(x)
+    else
+        fun_l4_n448(x)
+    end
+end
+
+def fun_l3_n250(x)
+    if (x < 1)
+        fun_l4_n9(x)
+    else
+        fun_l4_n424(x)
+    end
+end
+
+def fun_l3_n251(x)
+    if (x < 1)
+        fun_l4_n290(x)
+    else
+        fun_l4_n416(x)
+    end
+end
+
+def fun_l3_n252(x)
+    if (x < 1)
+        fun_l4_n159(x)
+    else
+        fun_l4_n780(x)
+    end
+end
+
+def fun_l3_n253(x)
+    if (x < 1)
+        fun_l4_n863(x)
+    else
+        fun_l4_n192(x)
+    end
+end
+
+def fun_l3_n254(x)
+    if (x < 1)
+        fun_l4_n658(x)
+    else
+        fun_l4_n816(x)
+    end
+end
+
+def fun_l3_n255(x)
+    if (x < 1)
+        fun_l4_n686(x)
+    else
+        fun_l4_n586(x)
+    end
+end
+
+def fun_l3_n256(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n290(x)
+    end
+end
+
+def fun_l3_n257(x)
+    if (x < 1)
+        fun_l4_n355(x)
+    else
+        fun_l4_n862(x)
+    end
+end
+
+def fun_l3_n258(x)
+    if (x < 1)
+        fun_l4_n63(x)
+    else
+        fun_l4_n205(x)
+    end
+end
+
+def fun_l3_n259(x)
+    if (x < 1)
+        fun_l4_n766(x)
+    else
+        fun_l4_n130(x)
+    end
+end
+
+def fun_l3_n260(x)
+    if (x < 1)
+        fun_l4_n670(x)
+    else
+        fun_l4_n313(x)
+    end
+end
+
+def fun_l3_n261(x)
+    if (x < 1)
+        fun_l4_n738(x)
+    else
+        fun_l4_n796(x)
+    end
+end
+
+def fun_l3_n262(x)
+    if (x < 1)
+        fun_l4_n925(x)
+    else
+        fun_l4_n267(x)
+    end
+end
+
+def fun_l3_n263(x)
+    if (x < 1)
+        fun_l4_n515(x)
+    else
+        fun_l4_n298(x)
+    end
+end
+
+def fun_l3_n264(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n809(x)
+    end
+end
+
+def fun_l3_n265(x)
+    if (x < 1)
+        fun_l4_n138(x)
+    else
+        fun_l4_n665(x)
+    end
+end
+
+def fun_l3_n266(x)
+    if (x < 1)
+        fun_l4_n141(x)
+    else
+        fun_l4_n641(x)
+    end
+end
+
+def fun_l3_n267(x)
+    if (x < 1)
+        fun_l4_n936(x)
+    else
+        fun_l4_n233(x)
+    end
+end
+
+def fun_l3_n268(x)
+    if (x < 1)
+        fun_l4_n28(x)
+    else
+        fun_l4_n351(x)
+    end
+end
+
+def fun_l3_n269(x)
+    if (x < 1)
+        fun_l4_n62(x)
+    else
+        fun_l4_n17(x)
+    end
+end
+
+def fun_l3_n270(x)
+    if (x < 1)
+        fun_l4_n489(x)
+    else
+        fun_l4_n408(x)
+    end
+end
+
+def fun_l3_n271(x)
+    if (x < 1)
+        fun_l4_n276(x)
+    else
+        fun_l4_n799(x)
+    end
+end
+
+def fun_l3_n272(x)
+    if (x < 1)
+        fun_l4_n103(x)
+    else
+        fun_l4_n804(x)
+    end
+end
+
+def fun_l3_n273(x)
+    if (x < 1)
+        fun_l4_n850(x)
+    else
+        fun_l4_n388(x)
+    end
+end
+
+def fun_l3_n274(x)
+    if (x < 1)
+        fun_l4_n651(x)
+    else
+        fun_l4_n484(x)
+    end
+end
+
+def fun_l3_n275(x)
+    if (x < 1)
+        fun_l4_n693(x)
+    else
+        fun_l4_n20(x)
+    end
+end
+
+def fun_l3_n276(x)
+    if (x < 1)
+        fun_l4_n897(x)
+    else
+        fun_l4_n328(x)
+    end
+end
+
+def fun_l3_n277(x)
+    if (x < 1)
+        fun_l4_n632(x)
+    else
+        fun_l4_n120(x)
+    end
+end
+
+def fun_l3_n278(x)
+    if (x < 1)
+        fun_l4_n919(x)
+    else
+        fun_l4_n921(x)
+    end
+end
+
+def fun_l3_n279(x)
+    if (x < 1)
+        fun_l4_n461(x)
+    else
+        fun_l4_n219(x)
+    end
+end
+
+def fun_l3_n280(x)
+    if (x < 1)
+        fun_l4_n867(x)
+    else
+        fun_l4_n682(x)
+    end
+end
+
+def fun_l3_n281(x)
+    if (x < 1)
+        fun_l4_n233(x)
+    else
+        fun_l4_n589(x)
+    end
+end
+
+def fun_l3_n282(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n970(x)
+    end
+end
+
+def fun_l3_n283(x)
+    if (x < 1)
+        fun_l4_n300(x)
+    else
+        fun_l4_n934(x)
+    end
+end
+
+def fun_l3_n284(x)
+    if (x < 1)
+        fun_l4_n736(x)
+    else
+        fun_l4_n516(x)
+    end
+end
+
+def fun_l3_n285(x)
+    if (x < 1)
+        fun_l4_n401(x)
+    else
+        fun_l4_n539(x)
+    end
+end
+
+def fun_l3_n286(x)
+    if (x < 1)
+        fun_l4_n342(x)
+    else
+        fun_l4_n142(x)
+    end
+end
+
+def fun_l3_n287(x)
+    if (x < 1)
+        fun_l4_n44(x)
+    else
+        fun_l4_n311(x)
+    end
+end
+
+def fun_l3_n288(x)
+    if (x < 1)
+        fun_l4_n698(x)
+    else
+        fun_l4_n407(x)
+    end
+end
+
+def fun_l3_n289(x)
+    if (x < 1)
+        fun_l4_n714(x)
+    else
+        fun_l4_n324(x)
+    end
+end
+
+def fun_l3_n290(x)
+    if (x < 1)
+        fun_l4_n862(x)
+    else
+        fun_l4_n807(x)
+    end
+end
+
+def fun_l3_n291(x)
+    if (x < 1)
+        fun_l4_n446(x)
+    else
+        fun_l4_n378(x)
+    end
+end
+
+def fun_l3_n292(x)
+    if (x < 1)
+        fun_l4_n418(x)
+    else
+        fun_l4_n194(x)
+    end
+end
+
+def fun_l3_n293(x)
+    if (x < 1)
+        fun_l4_n336(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n294(x)
+    if (x < 1)
+        fun_l4_n928(x)
+    else
+        fun_l4_n154(x)
+    end
+end
+
+def fun_l3_n295(x)
+    if (x < 1)
+        fun_l4_n764(x)
+    else
+        fun_l4_n335(x)
+    end
+end
+
+def fun_l3_n296(x)
+    if (x < 1)
+        fun_l4_n840(x)
+    else
+        fun_l4_n513(x)
+    end
+end
+
+def fun_l3_n297(x)
+    if (x < 1)
+        fun_l4_n520(x)
+    else
+        fun_l4_n838(x)
+    end
+end
+
+def fun_l3_n298(x)
+    if (x < 1)
+        fun_l4_n831(x)
+    else
+        fun_l4_n344(x)
+    end
+end
+
+def fun_l3_n299(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n19(x)
+    end
+end
+
+def fun_l3_n300(x)
+    if (x < 1)
+        fun_l4_n272(x)
+    else
+        fun_l4_n952(x)
+    end
+end
+
+def fun_l3_n301(x)
+    if (x < 1)
+        fun_l4_n659(x)
+    else
+        fun_l4_n439(x)
+    end
+end
+
+def fun_l3_n302(x)
+    if (x < 1)
+        fun_l4_n787(x)
+    else
+        fun_l4_n189(x)
+    end
+end
+
+def fun_l3_n303(x)
+    if (x < 1)
+        fun_l4_n549(x)
+    else
+        fun_l4_n594(x)
+    end
+end
+
+def fun_l3_n304(x)
+    if (x < 1)
+        fun_l4_n255(x)
+    else
+        fun_l4_n822(x)
+    end
+end
+
+def fun_l3_n305(x)
+    if (x < 1)
+        fun_l4_n312(x)
+    else
+        fun_l4_n935(x)
+    end
+end
+
+def fun_l3_n306(x)
+    if (x < 1)
+        fun_l4_n831(x)
+    else
+        fun_l4_n299(x)
+    end
+end
+
+def fun_l3_n307(x)
+    if (x < 1)
+        fun_l4_n154(x)
+    else
+        fun_l4_n520(x)
+    end
+end
+
+def fun_l3_n308(x)
+    if (x < 1)
+        fun_l4_n768(x)
+    else
+        fun_l4_n676(x)
+    end
+end
+
+def fun_l3_n309(x)
+    if (x < 1)
+        fun_l4_n816(x)
+    else
+        fun_l4_n447(x)
+    end
+end
+
+def fun_l3_n310(x)
+    if (x < 1)
+        fun_l4_n689(x)
+    else
+        fun_l4_n244(x)
+    end
+end
+
+def fun_l3_n311(x)
+    if (x < 1)
+        fun_l4_n389(x)
+    else
+        fun_l4_n326(x)
+    end
+end
+
+def fun_l3_n312(x)
+    if (x < 1)
+        fun_l4_n125(x)
+    else
+        fun_l4_n502(x)
+    end
+end
+
+def fun_l3_n313(x)
+    if (x < 1)
+        fun_l4_n327(x)
+    else
+        fun_l4_n123(x)
+    end
+end
+
+def fun_l3_n314(x)
+    if (x < 1)
+        fun_l4_n558(x)
+    else
+        fun_l4_n940(x)
+    end
+end
+
+def fun_l3_n315(x)
+    if (x < 1)
+        fun_l4_n652(x)
+    else
+        fun_l4_n10(x)
+    end
+end
+
+def fun_l3_n316(x)
+    if (x < 1)
+        fun_l4_n483(x)
+    else
+        fun_l4_n315(x)
+    end
+end
+
+def fun_l3_n317(x)
+    if (x < 1)
+        fun_l4_n567(x)
+    else
+        fun_l4_n540(x)
+    end
+end
+
+def fun_l3_n318(x)
+    if (x < 1)
+        fun_l4_n449(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n319(x)
+    if (x < 1)
+        fun_l4_n111(x)
+    else
+        fun_l4_n173(x)
+    end
+end
+
+def fun_l3_n320(x)
+    if (x < 1)
+        fun_l4_n373(x)
+    else
+        fun_l4_n615(x)
+    end
+end
+
+def fun_l3_n321(x)
+    if (x < 1)
+        fun_l4_n570(x)
+    else
+        fun_l4_n27(x)
+    end
+end
+
+def fun_l3_n322(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n695(x)
+    end
+end
+
+def fun_l3_n323(x)
+    if (x < 1)
+        fun_l4_n788(x)
+    else
+        fun_l4_n57(x)
+    end
+end
+
+def fun_l3_n324(x)
+    if (x < 1)
+        fun_l4_n7(x)
+    else
+        fun_l4_n75(x)
+    end
+end
+
+def fun_l3_n325(x)
+    if (x < 1)
+        fun_l4_n502(x)
+    else
+        fun_l4_n459(x)
+    end
+end
+
+def fun_l3_n326(x)
+    if (x < 1)
+        fun_l4_n572(x)
+    else
+        fun_l4_n324(x)
+    end
+end
+
+def fun_l3_n327(x)
+    if (x < 1)
+        fun_l4_n860(x)
+    else
+        fun_l4_n250(x)
+    end
+end
+
+def fun_l3_n328(x)
+    if (x < 1)
+        fun_l4_n242(x)
+    else
+        fun_l4_n667(x)
+    end
+end
+
+def fun_l3_n329(x)
+    if (x < 1)
+        fun_l4_n589(x)
+    else
+        fun_l4_n236(x)
+    end
+end
+
+def fun_l3_n330(x)
+    if (x < 1)
+        fun_l4_n100(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n331(x)
+    if (x < 1)
+        fun_l4_n779(x)
+    else
+        fun_l4_n667(x)
+    end
+end
+
+def fun_l3_n332(x)
+    if (x < 1)
+        fun_l4_n277(x)
+    else
+        fun_l4_n441(x)
+    end
+end
+
+def fun_l3_n333(x)
+    if (x < 1)
+        fun_l4_n379(x)
+    else
+        fun_l4_n331(x)
+    end
+end
+
+def fun_l3_n334(x)
+    if (x < 1)
+        fun_l4_n802(x)
+    else
+        fun_l4_n588(x)
+    end
+end
+
+def fun_l3_n335(x)
+    if (x < 1)
+        fun_l4_n385(x)
+    else
+        fun_l4_n918(x)
+    end
+end
+
+def fun_l3_n336(x)
+    if (x < 1)
+        fun_l4_n532(x)
+    else
+        fun_l4_n254(x)
+    end
+end
+
+def fun_l3_n337(x)
+    if (x < 1)
+        fun_l4_n920(x)
+    else
+        fun_l4_n134(x)
+    end
+end
+
+def fun_l3_n338(x)
+    if (x < 1)
+        fun_l4_n803(x)
+    else
+        fun_l4_n746(x)
+    end
+end
+
+def fun_l3_n339(x)
+    if (x < 1)
+        fun_l4_n924(x)
+    else
+        fun_l4_n878(x)
+    end
+end
+
+def fun_l3_n340(x)
+    if (x < 1)
+        fun_l4_n166(x)
+    else
+        fun_l4_n776(x)
+    end
+end
+
+def fun_l3_n341(x)
+    if (x < 1)
+        fun_l4_n240(x)
+    else
+        fun_l4_n898(x)
+    end
+end
+
+def fun_l3_n342(x)
+    if (x < 1)
+        fun_l4_n810(x)
+    else
+        fun_l4_n423(x)
+    end
+end
+
+def fun_l3_n343(x)
+    if (x < 1)
+        fun_l4_n209(x)
+    else
+        fun_l4_n514(x)
+    end
+end
+
+def fun_l3_n344(x)
+    if (x < 1)
+        fun_l4_n505(x)
+    else
+        fun_l4_n321(x)
+    end
+end
+
+def fun_l3_n345(x)
+    if (x < 1)
+        fun_l4_n88(x)
+    else
+        fun_l4_n39(x)
+    end
+end
+
+def fun_l3_n346(x)
+    if (x < 1)
+        fun_l4_n848(x)
+    else
+        fun_l4_n357(x)
+    end
+end
+
+def fun_l3_n347(x)
+    if (x < 1)
+        fun_l4_n450(x)
+    else
+        fun_l4_n704(x)
+    end
+end
+
+def fun_l3_n348(x)
+    if (x < 1)
+        fun_l4_n881(x)
+    else
+        fun_l4_n916(x)
+    end
+end
+
+def fun_l3_n349(x)
+    if (x < 1)
+        fun_l4_n16(x)
+    else
+        fun_l4_n996(x)
+    end
+end
+
+def fun_l3_n350(x)
+    if (x < 1)
+        fun_l4_n839(x)
+    else
+        fun_l4_n697(x)
+    end
+end
+
+def fun_l3_n351(x)
+    if (x < 1)
+        fun_l4_n177(x)
+    else
+        fun_l4_n859(x)
+    end
+end
+
+def fun_l3_n352(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n778(x)
+    end
+end
+
+def fun_l3_n353(x)
+    if (x < 1)
+        fun_l4_n604(x)
+    else
+        fun_l4_n280(x)
+    end
+end
+
+def fun_l3_n354(x)
+    if (x < 1)
+        fun_l4_n366(x)
+    else
+        fun_l4_n576(x)
+    end
+end
+
+def fun_l3_n355(x)
+    if (x < 1)
+        fun_l4_n584(x)
+    else
+        fun_l4_n228(x)
+    end
+end
+
+def fun_l3_n356(x)
+    if (x < 1)
+        fun_l4_n844(x)
+    else
+        fun_l4_n799(x)
+    end
+end
+
+def fun_l3_n357(x)
+    if (x < 1)
+        fun_l4_n489(x)
+    else
+        fun_l4_n905(x)
+    end
+end
+
+def fun_l3_n358(x)
+    if (x < 1)
+        fun_l4_n781(x)
+    else
+        fun_l4_n565(x)
+    end
+end
+
+def fun_l3_n359(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n326(x)
+    end
+end
+
+def fun_l3_n360(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n489(x)
+    end
+end
+
+def fun_l3_n361(x)
+    if (x < 1)
+        fun_l4_n110(x)
+    else
+        fun_l4_n733(x)
+    end
+end
+
+def fun_l3_n362(x)
+    if (x < 1)
+        fun_l4_n93(x)
+    else
+        fun_l4_n549(x)
+    end
+end
+
+def fun_l3_n363(x)
+    if (x < 1)
+        fun_l4_n270(x)
+    else
+        fun_l4_n883(x)
+    end
+end
+
+def fun_l3_n364(x)
+    if (x < 1)
+        fun_l4_n512(x)
+    else
+        fun_l4_n555(x)
+    end
+end
+
+def fun_l3_n365(x)
+    if (x < 1)
+        fun_l4_n800(x)
+    else
+        fun_l4_n672(x)
+    end
+end
+
+def fun_l3_n366(x)
+    if (x < 1)
+        fun_l4_n535(x)
+    else
+        fun_l4_n320(x)
+    end
+end
+
+def fun_l3_n367(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n365(x)
+    end
+end
+
+def fun_l3_n368(x)
+    if (x < 1)
+        fun_l4_n306(x)
+    else
+        fun_l4_n614(x)
+    end
+end
+
+def fun_l3_n369(x)
+    if (x < 1)
+        fun_l4_n914(x)
+    else
+        fun_l4_n20(x)
+    end
+end
+
+def fun_l3_n370(x)
+    if (x < 1)
+        fun_l4_n230(x)
+    else
+        fun_l4_n585(x)
+    end
+end
+
+def fun_l3_n371(x)
+    if (x < 1)
+        fun_l4_n544(x)
+    else
+        fun_l4_n752(x)
+    end
+end
+
+def fun_l3_n372(x)
+    if (x < 1)
+        fun_l4_n984(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n373(x)
+    if (x < 1)
+        fun_l4_n478(x)
+    else
+        fun_l4_n618(x)
+    end
+end
+
+def fun_l3_n374(x)
+    if (x < 1)
+        fun_l4_n941(x)
+    else
+        fun_l4_n746(x)
+    end
+end
+
+def fun_l3_n375(x)
+    if (x < 1)
+        fun_l4_n121(x)
+    else
+        fun_l4_n798(x)
+    end
+end
+
+def fun_l3_n376(x)
+    if (x < 1)
+        fun_l4_n851(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n377(x)
+    if (x < 1)
+        fun_l4_n502(x)
+    else
+        fun_l4_n538(x)
+    end
+end
+
+def fun_l3_n378(x)
+    if (x < 1)
+        fun_l4_n432(x)
+    else
+        fun_l4_n226(x)
+    end
+end
+
+def fun_l3_n379(x)
+    if (x < 1)
+        fun_l4_n734(x)
+    else
+        fun_l4_n684(x)
+    end
+end
+
+def fun_l3_n380(x)
+    if (x < 1)
+        fun_l4_n912(x)
+    else
+        fun_l4_n116(x)
+    end
+end
+
+def fun_l3_n381(x)
+    if (x < 1)
+        fun_l4_n291(x)
+    else
+        fun_l4_n464(x)
+    end
+end
+
+def fun_l3_n382(x)
+    if (x < 1)
+        fun_l4_n285(x)
+    else
+        fun_l4_n943(x)
+    end
+end
+
+def fun_l3_n383(x)
+    if (x < 1)
+        fun_l4_n738(x)
+    else
+        fun_l4_n532(x)
+    end
+end
+
+def fun_l3_n384(x)
+    if (x < 1)
+        fun_l4_n503(x)
+    else
+        fun_l4_n724(x)
+    end
+end
+
+def fun_l3_n385(x)
+    if (x < 1)
+        fun_l4_n208(x)
+    else
+        fun_l4_n683(x)
+    end
+end
+
+def fun_l3_n386(x)
+    if (x < 1)
+        fun_l4_n673(x)
+    else
+        fun_l4_n230(x)
+    end
+end
+
+def fun_l3_n387(x)
+    if (x < 1)
+        fun_l4_n921(x)
+    else
+        fun_l4_n800(x)
+    end
+end
+
+def fun_l3_n388(x)
+    if (x < 1)
+        fun_l4_n461(x)
+    else
+        fun_l4_n369(x)
+    end
+end
+
+def fun_l3_n389(x)
+    if (x < 1)
+        fun_l4_n86(x)
+    else
+        fun_l4_n403(x)
+    end
+end
+
+def fun_l3_n390(x)
+    if (x < 1)
+        fun_l4_n883(x)
+    else
+        fun_l4_n92(x)
+    end
+end
+
+def fun_l3_n391(x)
+    if (x < 1)
+        fun_l4_n562(x)
+    else
+        fun_l4_n826(x)
+    end
+end
+
+def fun_l3_n392(x)
+    if (x < 1)
+        fun_l4_n459(x)
+    else
+        fun_l4_n821(x)
+    end
+end
+
+def fun_l3_n393(x)
+    if (x < 1)
+        fun_l4_n774(x)
+    else
+        fun_l4_n376(x)
+    end
+end
+
+def fun_l3_n394(x)
+    if (x < 1)
+        fun_l4_n114(x)
+    else
+        fun_l4_n451(x)
+    end
+end
+
+def fun_l3_n395(x)
+    if (x < 1)
+        fun_l4_n689(x)
+    else
+        fun_l4_n13(x)
+    end
+end
+
+def fun_l3_n396(x)
+    if (x < 1)
+        fun_l4_n929(x)
+    else
+        fun_l4_n777(x)
+    end
+end
+
+def fun_l3_n397(x)
+    if (x < 1)
+        fun_l4_n634(x)
+    else
+        fun_l4_n329(x)
+    end
+end
+
+def fun_l3_n398(x)
+    if (x < 1)
+        fun_l4_n972(x)
+    else
+        fun_l4_n572(x)
+    end
+end
+
+def fun_l3_n399(x)
+    if (x < 1)
+        fun_l4_n231(x)
+    else
+        fun_l4_n14(x)
+    end
+end
+
+def fun_l3_n400(x)
+    if (x < 1)
+        fun_l4_n357(x)
+    else
+        fun_l4_n881(x)
+    end
+end
+
+def fun_l3_n401(x)
+    if (x < 1)
+        fun_l4_n283(x)
+    else
+        fun_l4_n614(x)
+    end
+end
+
+def fun_l3_n402(x)
+    if (x < 1)
+        fun_l4_n634(x)
+    else
+        fun_l4_n653(x)
+    end
+end
+
+def fun_l3_n403(x)
+    if (x < 1)
+        fun_l4_n660(x)
+    else
+        fun_l4_n127(x)
+    end
+end
+
+def fun_l3_n404(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n467(x)
+    end
+end
+
+def fun_l3_n405(x)
+    if (x < 1)
+        fun_l4_n593(x)
+    else
+        fun_l4_n78(x)
+    end
+end
+
+def fun_l3_n406(x)
+    if (x < 1)
+        fun_l4_n514(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n407(x)
+    if (x < 1)
+        fun_l4_n460(x)
+    else
+        fun_l4_n137(x)
+    end
+end
+
+def fun_l3_n408(x)
+    if (x < 1)
+        fun_l4_n3(x)
+    else
+        fun_l4_n224(x)
+    end
+end
+
+def fun_l3_n409(x)
+    if (x < 1)
+        fun_l4_n11(x)
+    else
+        fun_l4_n531(x)
+    end
+end
+
+def fun_l3_n410(x)
+    if (x < 1)
+        fun_l4_n94(x)
+    else
+        fun_l4_n717(x)
+    end
+end
+
+def fun_l3_n411(x)
+    if (x < 1)
+        fun_l4_n729(x)
+    else
+        fun_l4_n526(x)
+    end
+end
+
+def fun_l3_n412(x)
+    if (x < 1)
+        fun_l4_n86(x)
+    else
+        fun_l4_n26(x)
+    end
+end
+
+def fun_l3_n413(x)
+    if (x < 1)
+        fun_l4_n249(x)
+    else
+        fun_l4_n572(x)
+    end
+end
+
+def fun_l3_n414(x)
+    if (x < 1)
+        fun_l4_n578(x)
+    else
+        fun_l4_n512(x)
+    end
+end
+
+def fun_l3_n415(x)
+    if (x < 1)
+        fun_l4_n176(x)
+    else
+        fun_l4_n414(x)
+    end
+end
+
+def fun_l3_n416(x)
+    if (x < 1)
+        fun_l4_n757(x)
+    else
+        fun_l4_n385(x)
+    end
+end
+
+def fun_l3_n417(x)
+    if (x < 1)
+        fun_l4_n249(x)
+    else
+        fun_l4_n180(x)
+    end
+end
+
+def fun_l3_n418(x)
+    if (x < 1)
+        fun_l4_n193(x)
+    else
+        fun_l4_n294(x)
+    end
+end
+
+def fun_l3_n419(x)
+    if (x < 1)
+        fun_l4_n441(x)
+    else
+        fun_l4_n932(x)
+    end
+end
+
+def fun_l3_n420(x)
+    if (x < 1)
+        fun_l4_n492(x)
+    else
+        fun_l4_n239(x)
+    end
+end
+
+def fun_l3_n421(x)
+    if (x < 1)
+        fun_l4_n49(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n422(x)
+    if (x < 1)
+        fun_l4_n546(x)
+    else
+        fun_l4_n285(x)
+    end
+end
+
+def fun_l3_n423(x)
+    if (x < 1)
+        fun_l4_n687(x)
+    else
+        fun_l4_n973(x)
+    end
+end
+
+def fun_l3_n424(x)
+    if (x < 1)
+        fun_l4_n876(x)
+    else
+        fun_l4_n591(x)
+    end
+end
+
+def fun_l3_n425(x)
+    if (x < 1)
+        fun_l4_n626(x)
+    else
+        fun_l4_n739(x)
+    end
+end
+
+def fun_l3_n426(x)
+    if (x < 1)
+        fun_l4_n439(x)
+    else
+        fun_l4_n709(x)
+    end
+end
+
+def fun_l3_n427(x)
+    if (x < 1)
+        fun_l4_n710(x)
+    else
+        fun_l4_n305(x)
+    end
+end
+
+def fun_l3_n428(x)
+    if (x < 1)
+        fun_l4_n61(x)
+    else
+        fun_l4_n520(x)
+    end
+end
+
+def fun_l3_n429(x)
+    if (x < 1)
+        fun_l4_n172(x)
+    else
+        fun_l4_n12(x)
+    end
+end
+
+def fun_l3_n430(x)
+    if (x < 1)
+        fun_l4_n432(x)
+    else
+        fun_l4_n174(x)
+    end
+end
+
+def fun_l3_n431(x)
+    if (x < 1)
+        fun_l4_n194(x)
+    else
+        fun_l4_n673(x)
+    end
+end
+
+def fun_l3_n432(x)
+    if (x < 1)
+        fun_l4_n952(x)
+    else
+        fun_l4_n798(x)
+    end
+end
+
+def fun_l3_n433(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n263(x)
+    end
+end
+
+def fun_l3_n434(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n882(x)
+    end
+end
+
+def fun_l3_n435(x)
+    if (x < 1)
+        fun_l4_n499(x)
+    else
+        fun_l4_n947(x)
+    end
+end
+
+def fun_l3_n436(x)
+    if (x < 1)
+        fun_l4_n744(x)
+    else
+        fun_l4_n187(x)
+    end
+end
+
+def fun_l3_n437(x)
+    if (x < 1)
+        fun_l4_n244(x)
+    else
+        fun_l4_n366(x)
+    end
+end
+
+def fun_l3_n438(x)
+    if (x < 1)
+        fun_l4_n228(x)
+    else
+        fun_l4_n866(x)
+    end
+end
+
+def fun_l3_n439(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n924(x)
+    end
+end
+
+def fun_l3_n440(x)
+    if (x < 1)
+        fun_l4_n302(x)
+    else
+        fun_l4_n691(x)
+    end
+end
+
+def fun_l3_n441(x)
+    if (x < 1)
+        fun_l4_n559(x)
+    else
+        fun_l4_n758(x)
+    end
+end
+
+def fun_l3_n442(x)
+    if (x < 1)
+        fun_l4_n412(x)
+    else
+        fun_l4_n544(x)
+    end
+end
+
+def fun_l3_n443(x)
+    if (x < 1)
+        fun_l4_n130(x)
+    else
+        fun_l4_n764(x)
+    end
+end
+
+def fun_l3_n444(x)
+    if (x < 1)
+        fun_l4_n135(x)
+    else
+        fun_l4_n65(x)
+    end
+end
+
+def fun_l3_n445(x)
+    if (x < 1)
+        fun_l4_n224(x)
+    else
+        fun_l4_n148(x)
+    end
+end
+
+def fun_l3_n446(x)
+    if (x < 1)
+        fun_l4_n238(x)
+    else
+        fun_l4_n808(x)
+    end
+end
+
+def fun_l3_n447(x)
+    if (x < 1)
+        fun_l4_n832(x)
+    else
+        fun_l4_n460(x)
+    end
+end
+
+def fun_l3_n448(x)
+    if (x < 1)
+        fun_l4_n897(x)
+    else
+        fun_l4_n817(x)
+    end
+end
+
+def fun_l3_n449(x)
+    if (x < 1)
+        fun_l4_n587(x)
+    else
+        fun_l4_n926(x)
+    end
+end
+
+def fun_l3_n450(x)
+    if (x < 1)
+        fun_l4_n575(x)
+    else
+        fun_l4_n274(x)
+    end
+end
+
+def fun_l3_n451(x)
+    if (x < 1)
+        fun_l4_n42(x)
+    else
+        fun_l4_n714(x)
+    end
+end
+
+def fun_l3_n452(x)
+    if (x < 1)
+        fun_l4_n101(x)
+    else
+        fun_l4_n470(x)
+    end
+end
+
+def fun_l3_n453(x)
+    if (x < 1)
+        fun_l4_n906(x)
+    else
+        fun_l4_n724(x)
+    end
+end
+
+def fun_l3_n454(x)
+    if (x < 1)
+        fun_l4_n682(x)
+    else
+        fun_l4_n709(x)
+    end
+end
+
+def fun_l3_n455(x)
+    if (x < 1)
+        fun_l4_n929(x)
+    else
+        fun_l4_n274(x)
+    end
+end
+
+def fun_l3_n456(x)
+    if (x < 1)
+        fun_l4_n10(x)
+    else
+        fun_l4_n101(x)
+    end
+end
+
+def fun_l3_n457(x)
+    if (x < 1)
+        fun_l4_n825(x)
+    else
+        fun_l4_n632(x)
+    end
+end
+
+def fun_l3_n458(x)
+    if (x < 1)
+        fun_l4_n2(x)
+    else
+        fun_l4_n723(x)
+    end
+end
+
+def fun_l3_n459(x)
+    if (x < 1)
+        fun_l4_n998(x)
+    else
+        fun_l4_n546(x)
+    end
+end
+
+def fun_l3_n460(x)
+    if (x < 1)
+        fun_l4_n483(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n461(x)
+    if (x < 1)
+        fun_l4_n896(x)
+    else
+        fun_l4_n993(x)
+    end
+end
+
+def fun_l3_n462(x)
+    if (x < 1)
+        fun_l4_n710(x)
+    else
+        fun_l4_n529(x)
+    end
+end
+
+def fun_l3_n463(x)
+    if (x < 1)
+        fun_l4_n913(x)
+    else
+        fun_l4_n65(x)
+    end
+end
+
+def fun_l3_n464(x)
+    if (x < 1)
+        fun_l4_n712(x)
+    else
+        fun_l4_n412(x)
+    end
+end
+
+def fun_l3_n465(x)
+    if (x < 1)
+        fun_l4_n296(x)
+    else
+        fun_l4_n37(x)
+    end
+end
+
+def fun_l3_n466(x)
+    if (x < 1)
+        fun_l4_n241(x)
+    else
+        fun_l4_n649(x)
+    end
+end
+
+def fun_l3_n467(x)
+    if (x < 1)
+        fun_l4_n296(x)
+    else
+        fun_l4_n80(x)
+    end
+end
+
+def fun_l3_n468(x)
+    if (x < 1)
+        fun_l4_n270(x)
+    else
+        fun_l4_n192(x)
+    end
+end
+
+def fun_l3_n469(x)
+    if (x < 1)
+        fun_l4_n655(x)
+    else
+        fun_l4_n605(x)
+    end
+end
+
+def fun_l3_n470(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n807(x)
+    end
+end
+
+def fun_l3_n471(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n902(x)
+    end
+end
+
+def fun_l3_n472(x)
+    if (x < 1)
+        fun_l4_n527(x)
+    else
+        fun_l4_n638(x)
+    end
+end
+
+def fun_l3_n473(x)
+    if (x < 1)
+        fun_l4_n775(x)
+    else
+        fun_l4_n572(x)
+    end
+end
+
+def fun_l3_n474(x)
+    if (x < 1)
+        fun_l4_n856(x)
+    else
+        fun_l4_n182(x)
+    end
+end
+
+def fun_l3_n475(x)
+    if (x < 1)
+        fun_l4_n434(x)
+    else
+        fun_l4_n232(x)
+    end
+end
+
+def fun_l3_n476(x)
+    if (x < 1)
+        fun_l4_n208(x)
+    else
+        fun_l4_n37(x)
+    end
+end
+
+def fun_l3_n477(x)
+    if (x < 1)
+        fun_l4_n146(x)
+    else
+        fun_l4_n764(x)
+    end
+end
+
+def fun_l3_n478(x)
+    if (x < 1)
+        fun_l4_n806(x)
+    else
+        fun_l4_n148(x)
+    end
+end
+
+def fun_l3_n479(x)
+    if (x < 1)
+        fun_l4_n46(x)
+    else
+        fun_l4_n488(x)
+    end
+end
+
+def fun_l3_n480(x)
+    if (x < 1)
+        fun_l4_n637(x)
+    else
+        fun_l4_n48(x)
+    end
+end
+
+def fun_l3_n481(x)
+    if (x < 1)
+        fun_l4_n496(x)
+    else
+        fun_l4_n891(x)
+    end
+end
+
+def fun_l3_n482(x)
+    if (x < 1)
+        fun_l4_n282(x)
+    else
+        fun_l4_n736(x)
+    end
+end
+
+def fun_l3_n483(x)
+    if (x < 1)
+        fun_l4_n377(x)
+    else
+        fun_l4_n603(x)
+    end
+end
+
+def fun_l3_n484(x)
+    if (x < 1)
+        fun_l4_n689(x)
+    else
+        fun_l4_n201(x)
+    end
+end
+
+def fun_l3_n485(x)
+    if (x < 1)
+        fun_l4_n495(x)
+    else
+        fun_l4_n721(x)
+    end
+end
+
+def fun_l3_n486(x)
+    if (x < 1)
+        fun_l4_n128(x)
+    else
+        fun_l4_n400(x)
+    end
+end
+
+def fun_l3_n487(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n53(x)
+    end
+end
+
+def fun_l3_n488(x)
+    if (x < 1)
+        fun_l4_n913(x)
+    else
+        fun_l4_n814(x)
+    end
+end
+
+def fun_l3_n489(x)
+    if (x < 1)
+        fun_l4_n816(x)
+    else
+        fun_l4_n196(x)
+    end
+end
+
+def fun_l3_n490(x)
+    if (x < 1)
+        fun_l4_n754(x)
+    else
+        fun_l4_n451(x)
+    end
+end
+
+def fun_l3_n491(x)
+    if (x < 1)
+        fun_l4_n57(x)
+    else
+        fun_l4_n597(x)
+    end
+end
+
+def fun_l3_n492(x)
+    if (x < 1)
+        fun_l4_n539(x)
+    else
+        fun_l4_n893(x)
+    end
+end
+
+def fun_l3_n493(x)
+    if (x < 1)
+        fun_l4_n542(x)
+    else
+        fun_l4_n956(x)
+    end
+end
+
+def fun_l3_n494(x)
+    if (x < 1)
+        fun_l4_n479(x)
+    else
+        fun_l4_n448(x)
+    end
+end
+
+def fun_l3_n495(x)
+    if (x < 1)
+        fun_l4_n263(x)
+    else
+        fun_l4_n912(x)
+    end
+end
+
+def fun_l3_n496(x)
+    if (x < 1)
+        fun_l4_n463(x)
+    else
+        fun_l4_n112(x)
+    end
+end
+
+def fun_l3_n497(x)
+    if (x < 1)
+        fun_l4_n806(x)
+    else
+        fun_l4_n486(x)
+    end
+end
+
+def fun_l3_n498(x)
+    if (x < 1)
+        fun_l4_n155(x)
+    else
+        fun_l4_n298(x)
+    end
+end
+
+def fun_l3_n499(x)
+    if (x < 1)
+        fun_l4_n538(x)
+    else
+        fun_l4_n908(x)
+    end
+end
+
+def fun_l3_n500(x)
+    if (x < 1)
+        fun_l4_n769(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n501(x)
+    if (x < 1)
+        fun_l4_n544(x)
+    else
+        fun_l4_n749(x)
+    end
+end
+
+def fun_l3_n502(x)
+    if (x < 1)
+        fun_l4_n505(x)
+    else
+        fun_l4_n66(x)
+    end
+end
+
+def fun_l3_n503(x)
+    if (x < 1)
+        fun_l4_n900(x)
+    else
+        fun_l4_n917(x)
+    end
+end
+
+def fun_l3_n504(x)
+    if (x < 1)
+        fun_l4_n982(x)
+    else
+        fun_l4_n707(x)
+    end
+end
+
+def fun_l3_n505(x)
+    if (x < 1)
+        fun_l4_n102(x)
+    else
+        fun_l4_n564(x)
+    end
+end
+
+def fun_l3_n506(x)
+    if (x < 1)
+        fun_l4_n332(x)
+    else
+        fun_l4_n367(x)
+    end
+end
+
+def fun_l3_n507(x)
+    if (x < 1)
+        fun_l4_n969(x)
+    else
+        fun_l4_n354(x)
+    end
+end
+
+def fun_l3_n508(x)
+    if (x < 1)
+        fun_l4_n405(x)
+    else
+        fun_l4_n485(x)
+    end
+end
+
+def fun_l3_n509(x)
+    if (x < 1)
+        fun_l4_n477(x)
+    else
+        fun_l4_n629(x)
+    end
+end
+
+def fun_l3_n510(x)
+    if (x < 1)
+        fun_l4_n753(x)
+    else
+        fun_l4_n78(x)
+    end
+end
+
+def fun_l3_n511(x)
+    if (x < 1)
+        fun_l4_n221(x)
+    else
+        fun_l4_n637(x)
+    end
+end
+
+def fun_l3_n512(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n267(x)
+    end
+end
+
+def fun_l3_n513(x)
+    if (x < 1)
+        fun_l4_n750(x)
+    else
+        fun_l4_n626(x)
+    end
+end
+
+def fun_l3_n514(x)
+    if (x < 1)
+        fun_l4_n160(x)
+    else
+        fun_l4_n32(x)
+    end
+end
+
+def fun_l3_n515(x)
+    if (x < 1)
+        fun_l4_n914(x)
+    else
+        fun_l4_n967(x)
+    end
+end
+
+def fun_l3_n516(x)
+    if (x < 1)
+        fun_l4_n380(x)
+    else
+        fun_l4_n83(x)
+    end
+end
+
+def fun_l3_n517(x)
+    if (x < 1)
+        fun_l4_n175(x)
+    else
+        fun_l4_n830(x)
+    end
+end
+
+def fun_l3_n518(x)
+    if (x < 1)
+        fun_l4_n579(x)
+    else
+        fun_l4_n773(x)
+    end
+end
+
+def fun_l3_n519(x)
+    if (x < 1)
+        fun_l4_n707(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n520(x)
+    if (x < 1)
+        fun_l4_n587(x)
+    else
+        fun_l4_n754(x)
+    end
+end
+
+def fun_l3_n521(x)
+    if (x < 1)
+        fun_l4_n922(x)
+    else
+        fun_l4_n156(x)
+    end
+end
+
+def fun_l3_n522(x)
+    if (x < 1)
+        fun_l4_n299(x)
+    else
+        fun_l4_n937(x)
+    end
+end
+
+def fun_l3_n523(x)
+    if (x < 1)
+        fun_l4_n996(x)
+    else
+        fun_l4_n786(x)
+    end
+end
+
+def fun_l3_n524(x)
+    if (x < 1)
+        fun_l4_n988(x)
+    else
+        fun_l4_n930(x)
+    end
+end
+
+def fun_l3_n525(x)
+    if (x < 1)
+        fun_l4_n475(x)
+    else
+        fun_l4_n43(x)
+    end
+end
+
+def fun_l3_n526(x)
+    if (x < 1)
+        fun_l4_n367(x)
+    else
+        fun_l4_n167(x)
+    end
+end
+
+def fun_l3_n527(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n394(x)
+    end
+end
+
+def fun_l3_n528(x)
+    if (x < 1)
+        fun_l4_n92(x)
+    else
+        fun_l4_n304(x)
+    end
+end
+
+def fun_l3_n529(x)
+    if (x < 1)
+        fun_l4_n369(x)
+    else
+        fun_l4_n458(x)
+    end
+end
+
+def fun_l3_n530(x)
+    if (x < 1)
+        fun_l4_n475(x)
+    else
+        fun_l4_n8(x)
+    end
+end
+
+def fun_l3_n531(x)
+    if (x < 1)
+        fun_l4_n678(x)
+    else
+        fun_l4_n970(x)
+    end
+end
+
+def fun_l3_n532(x)
+    if (x < 1)
+        fun_l4_n349(x)
+    else
+        fun_l4_n853(x)
+    end
+end
+
+def fun_l3_n533(x)
+    if (x < 1)
+        fun_l4_n918(x)
+    else
+        fun_l4_n820(x)
+    end
+end
+
+def fun_l3_n534(x)
+    if (x < 1)
+        fun_l4_n369(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n535(x)
+    if (x < 1)
+        fun_l4_n437(x)
+    else
+        fun_l4_n930(x)
+    end
+end
+
+def fun_l3_n536(x)
+    if (x < 1)
+        fun_l4_n143(x)
+    else
+        fun_l4_n986(x)
+    end
+end
+
+def fun_l3_n537(x)
+    if (x < 1)
+        fun_l4_n603(x)
+    else
+        fun_l4_n818(x)
+    end
+end
+
+def fun_l3_n538(x)
+    if (x < 1)
+        fun_l4_n14(x)
+    else
+        fun_l4_n994(x)
+    end
+end
+
+def fun_l3_n539(x)
+    if (x < 1)
+        fun_l4_n650(x)
+    else
+        fun_l4_n115(x)
+    end
+end
+
+def fun_l3_n540(x)
+    if (x < 1)
+        fun_l4_n74(x)
+    else
+        fun_l4_n559(x)
+    end
+end
+
+def fun_l3_n541(x)
+    if (x < 1)
+        fun_l4_n601(x)
+    else
+        fun_l4_n756(x)
+    end
+end
+
+def fun_l3_n542(x)
+    if (x < 1)
+        fun_l4_n733(x)
+    else
+        fun_l4_n274(x)
+    end
+end
+
+def fun_l3_n543(x)
+    if (x < 1)
+        fun_l4_n819(x)
+    else
+        fun_l4_n97(x)
+    end
+end
+
+def fun_l3_n544(x)
+    if (x < 1)
+        fun_l4_n949(x)
+    else
+        fun_l4_n868(x)
+    end
+end
+
+def fun_l3_n545(x)
+    if (x < 1)
+        fun_l4_n346(x)
+    else
+        fun_l4_n0(x)
+    end
+end
+
+def fun_l3_n546(x)
+    if (x < 1)
+        fun_l4_n820(x)
+    else
+        fun_l4_n188(x)
+    end
+end
+
+def fun_l3_n547(x)
+    if (x < 1)
+        fun_l4_n403(x)
+    else
+        fun_l4_n670(x)
+    end
+end
+
+def fun_l3_n548(x)
+    if (x < 1)
+        fun_l4_n449(x)
+    else
+        fun_l4_n96(x)
+    end
+end
+
+def fun_l3_n549(x)
+    if (x < 1)
+        fun_l4_n585(x)
+    else
+        fun_l4_n388(x)
+    end
+end
+
+def fun_l3_n550(x)
+    if (x < 1)
+        fun_l4_n963(x)
+    else
+        fun_l4_n979(x)
+    end
+end
+
+def fun_l3_n551(x)
+    if (x < 1)
+        fun_l4_n892(x)
+    else
+        fun_l4_n583(x)
+    end
+end
+
+def fun_l3_n552(x)
+    if (x < 1)
+        fun_l4_n846(x)
+    else
+        fun_l4_n508(x)
+    end
+end
+
+def fun_l3_n553(x)
+    if (x < 1)
+        fun_l4_n160(x)
+    else
+        fun_l4_n428(x)
+    end
+end
+
+def fun_l3_n554(x)
+    if (x < 1)
+        fun_l4_n538(x)
+    else
+        fun_l4_n641(x)
+    end
+end
+
+def fun_l3_n555(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n697(x)
+    end
+end
+
+def fun_l3_n556(x)
+    if (x < 1)
+        fun_l4_n212(x)
+    else
+        fun_l4_n0(x)
+    end
+end
+
+def fun_l3_n557(x)
+    if (x < 1)
+        fun_l4_n255(x)
+    else
+        fun_l4_n860(x)
+    end
+end
+
+def fun_l3_n558(x)
+    if (x < 1)
+        fun_l4_n807(x)
+    else
+        fun_l4_n865(x)
+    end
+end
+
+def fun_l3_n559(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n352(x)
+    end
+end
+
+def fun_l3_n560(x)
+    if (x < 1)
+        fun_l4_n327(x)
+    else
+        fun_l4_n739(x)
+    end
+end
+
+def fun_l3_n561(x)
+    if (x < 1)
+        fun_l4_n637(x)
+    else
+        fun_l4_n628(x)
+    end
+end
+
+def fun_l3_n562(x)
+    if (x < 1)
+        fun_l4_n281(x)
+    else
+        fun_l4_n394(x)
+    end
+end
+
+def fun_l3_n563(x)
+    if (x < 1)
+        fun_l4_n440(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n564(x)
+    if (x < 1)
+        fun_l4_n893(x)
+    else
+        fun_l4_n396(x)
+    end
+end
+
+def fun_l3_n565(x)
+    if (x < 1)
+        fun_l4_n94(x)
+    else
+        fun_l4_n134(x)
+    end
+end
+
+def fun_l3_n566(x)
+    if (x < 1)
+        fun_l4_n968(x)
+    else
+        fun_l4_n444(x)
+    end
+end
+
+def fun_l3_n567(x)
+    if (x < 1)
+        fun_l4_n85(x)
+    else
+        fun_l4_n281(x)
+    end
+end
+
+def fun_l3_n568(x)
+    if (x < 1)
+        fun_l4_n164(x)
+    else
+        fun_l4_n229(x)
+    end
+end
+
+def fun_l3_n569(x)
+    if (x < 1)
+        fun_l4_n594(x)
+    else
+        fun_l4_n756(x)
+    end
+end
+
+def fun_l3_n570(x)
+    if (x < 1)
+        fun_l4_n77(x)
+    else
+        fun_l4_n370(x)
+    end
+end
+
+def fun_l3_n571(x)
+    if (x < 1)
+        fun_l4_n724(x)
+    else
+        fun_l4_n965(x)
+    end
+end
+
+def fun_l3_n572(x)
+    if (x < 1)
+        fun_l4_n394(x)
+    else
+        fun_l4_n595(x)
+    end
+end
+
+def fun_l3_n573(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n41(x)
+    end
+end
+
+def fun_l3_n574(x)
+    if (x < 1)
+        fun_l4_n951(x)
+    else
+        fun_l4_n414(x)
+    end
+end
+
+def fun_l3_n575(x)
+    if (x < 1)
+        fun_l4_n297(x)
+    else
+        fun_l4_n126(x)
+    end
+end
+
+def fun_l3_n576(x)
+    if (x < 1)
+        fun_l4_n538(x)
+    else
+        fun_l4_n276(x)
+    end
+end
+
+def fun_l3_n577(x)
+    if (x < 1)
+        fun_l4_n882(x)
+    else
+        fun_l4_n152(x)
+    end
+end
+
+def fun_l3_n578(x)
+    if (x < 1)
+        fun_l4_n950(x)
+    else
+        fun_l4_n822(x)
+    end
+end
+
+def fun_l3_n579(x)
+    if (x < 1)
+        fun_l4_n484(x)
+    else
+        fun_l4_n99(x)
+    end
+end
+
+def fun_l3_n580(x)
+    if (x < 1)
+        fun_l4_n160(x)
+    else
+        fun_l4_n98(x)
+    end
+end
+
+def fun_l3_n581(x)
+    if (x < 1)
+        fun_l4_n10(x)
+    else
+        fun_l4_n537(x)
+    end
+end
+
+def fun_l3_n582(x)
+    if (x < 1)
+        fun_l4_n419(x)
+    else
+        fun_l4_n285(x)
+    end
+end
+
+def fun_l3_n583(x)
+    if (x < 1)
+        fun_l4_n330(x)
+    else
+        fun_l4_n732(x)
+    end
+end
+
+def fun_l3_n584(x)
+    if (x < 1)
+        fun_l4_n64(x)
+    else
+        fun_l4_n461(x)
+    end
+end
+
+def fun_l3_n585(x)
+    if (x < 1)
+        fun_l4_n326(x)
+    else
+        fun_l4_n134(x)
+    end
+end
+
+def fun_l3_n586(x)
+    if (x < 1)
+        fun_l4_n423(x)
+    else
+        fun_l4_n945(x)
+    end
+end
+
+def fun_l3_n587(x)
+    if (x < 1)
+        fun_l4_n192(x)
+    else
+        fun_l4_n459(x)
+    end
+end
+
+def fun_l3_n588(x)
+    if (x < 1)
+        fun_l4_n292(x)
+    else
+        fun_l4_n697(x)
+    end
+end
+
+def fun_l3_n589(x)
+    if (x < 1)
+        fun_l4_n612(x)
+    else
+        fun_l4_n902(x)
+    end
+end
+
+def fun_l3_n590(x)
+    if (x < 1)
+        fun_l4_n842(x)
+    else
+        fun_l4_n300(x)
+    end
+end
+
+def fun_l3_n591(x)
+    if (x < 1)
+        fun_l4_n265(x)
+    else
+        fun_l4_n906(x)
+    end
+end
+
+def fun_l3_n592(x)
+    if (x < 1)
+        fun_l4_n82(x)
+    else
+        fun_l4_n417(x)
+    end
+end
+
+def fun_l3_n593(x)
+    if (x < 1)
+        fun_l4_n896(x)
+    else
+        fun_l4_n794(x)
+    end
+end
+
+def fun_l3_n594(x)
+    if (x < 1)
+        fun_l4_n760(x)
+    else
+        fun_l4_n83(x)
+    end
+end
+
+def fun_l3_n595(x)
+    if (x < 1)
+        fun_l4_n750(x)
+    else
+        fun_l4_n778(x)
+    end
+end
+
+def fun_l3_n596(x)
+    if (x < 1)
+        fun_l4_n655(x)
+    else
+        fun_l4_n8(x)
+    end
+end
+
+def fun_l3_n597(x)
+    if (x < 1)
+        fun_l4_n810(x)
+    else
+        fun_l4_n824(x)
+    end
+end
+
+def fun_l3_n598(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n921(x)
+    end
+end
+
+def fun_l3_n599(x)
+    if (x < 1)
+        fun_l4_n16(x)
+    else
+        fun_l4_n96(x)
+    end
+end
+
+def fun_l3_n600(x)
+    if (x < 1)
+        fun_l4_n879(x)
+    else
+        fun_l4_n757(x)
+    end
+end
+
+def fun_l3_n601(x)
+    if (x < 1)
+        fun_l4_n840(x)
+    else
+        fun_l4_n62(x)
+    end
+end
+
+def fun_l3_n602(x)
+    if (x < 1)
+        fun_l4_n547(x)
+    else
+        fun_l4_n45(x)
+    end
+end
+
+def fun_l3_n603(x)
+    if (x < 1)
+        fun_l4_n978(x)
+    else
+        fun_l4_n646(x)
+    end
+end
+
+def fun_l3_n604(x)
+    if (x < 1)
+        fun_l4_n100(x)
+    else
+        fun_l4_n654(x)
+    end
+end
+
+def fun_l3_n605(x)
+    if (x < 1)
+        fun_l4_n257(x)
+    else
+        fun_l4_n465(x)
+    end
+end
+
+def fun_l3_n606(x)
+    if (x < 1)
+        fun_l4_n427(x)
+    else
+        fun_l4_n489(x)
+    end
+end
+
+def fun_l3_n607(x)
+    if (x < 1)
+        fun_l4_n465(x)
+    else
+        fun_l4_n48(x)
+    end
+end
+
+def fun_l3_n608(x)
+    if (x < 1)
+        fun_l4_n571(x)
+    else
+        fun_l4_n332(x)
+    end
+end
+
+def fun_l3_n609(x)
+    if (x < 1)
+        fun_l4_n813(x)
+    else
+        fun_l4_n462(x)
+    end
+end
+
+def fun_l3_n610(x)
+    if (x < 1)
+        fun_l4_n931(x)
+    else
+        fun_l4_n913(x)
+    end
+end
+
+def fun_l3_n611(x)
+    if (x < 1)
+        fun_l4_n20(x)
+    else
+        fun_l4_n933(x)
+    end
+end
+
+def fun_l3_n612(x)
+    if (x < 1)
+        fun_l4_n913(x)
+    else
+        fun_l4_n787(x)
+    end
+end
+
+def fun_l3_n613(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n735(x)
+    end
+end
+
+def fun_l3_n614(x)
+    if (x < 1)
+        fun_l4_n315(x)
+    else
+        fun_l4_n913(x)
+    end
+end
+
+def fun_l3_n615(x)
+    if (x < 1)
+        fun_l4_n308(x)
+    else
+        fun_l4_n865(x)
+    end
+end
+
+def fun_l3_n616(x)
+    if (x < 1)
+        fun_l4_n847(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n617(x)
+    if (x < 1)
+        fun_l4_n387(x)
+    else
+        fun_l4_n551(x)
+    end
+end
+
+def fun_l3_n618(x)
+    if (x < 1)
+        fun_l4_n276(x)
+    else
+        fun_l4_n991(x)
+    end
+end
+
+def fun_l3_n619(x)
+    if (x < 1)
+        fun_l4_n524(x)
+    else
+        fun_l4_n202(x)
+    end
+end
+
+def fun_l3_n620(x)
+    if (x < 1)
+        fun_l4_n836(x)
+    else
+        fun_l4_n548(x)
+    end
+end
+
+def fun_l3_n621(x)
+    if (x < 1)
+        fun_l4_n76(x)
+    else
+        fun_l4_n5(x)
+    end
+end
+
+def fun_l3_n622(x)
+    if (x < 1)
+        fun_l4_n223(x)
+    else
+        fun_l4_n438(x)
+    end
+end
+
+def fun_l3_n623(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n590(x)
+    end
+end
+
+def fun_l3_n624(x)
+    if (x < 1)
+        fun_l4_n609(x)
+    else
+        fun_l4_n513(x)
+    end
+end
+
+def fun_l3_n625(x)
+    if (x < 1)
+        fun_l4_n966(x)
+    else
+        fun_l4_n278(x)
+    end
+end
+
+def fun_l3_n626(x)
+    if (x < 1)
+        fun_l4_n82(x)
+    else
+        fun_l4_n100(x)
+    end
+end
+
+def fun_l3_n627(x)
+    if (x < 1)
+        fun_l4_n312(x)
+    else
+        fun_l4_n746(x)
+    end
+end
+
+def fun_l3_n628(x)
+    if (x < 1)
+        fun_l4_n682(x)
+    else
+        fun_l4_n791(x)
+    end
+end
+
+def fun_l3_n629(x)
+    if (x < 1)
+        fun_l4_n166(x)
+    else
+        fun_l4_n678(x)
+    end
+end
+
+def fun_l3_n630(x)
+    if (x < 1)
+        fun_l4_n507(x)
+    else
+        fun_l4_n778(x)
+    end
+end
+
+def fun_l3_n631(x)
+    if (x < 1)
+        fun_l4_n97(x)
+    else
+        fun_l4_n13(x)
+    end
+end
+
+def fun_l3_n632(x)
+    if (x < 1)
+        fun_l4_n976(x)
+    else
+        fun_l4_n794(x)
+    end
+end
+
+def fun_l3_n633(x)
+    if (x < 1)
+        fun_l4_n994(x)
+    else
+        fun_l4_n743(x)
+    end
+end
+
+def fun_l3_n634(x)
+    if (x < 1)
+        fun_l4_n212(x)
+    else
+        fun_l4_n754(x)
+    end
+end
+
+def fun_l3_n635(x)
+    if (x < 1)
+        fun_l4_n602(x)
+    else
+        fun_l4_n997(x)
+    end
+end
+
+def fun_l3_n636(x)
+    if (x < 1)
+        fun_l4_n282(x)
+    else
+        fun_l4_n133(x)
+    end
+end
+
+def fun_l3_n637(x)
+    if (x < 1)
+        fun_l4_n413(x)
+    else
+        fun_l4_n952(x)
+    end
+end
+
+def fun_l3_n638(x)
+    if (x < 1)
+        fun_l4_n843(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n639(x)
+    if (x < 1)
+        fun_l4_n946(x)
+    else
+        fun_l4_n833(x)
+    end
+end
+
+def fun_l3_n640(x)
+    if (x < 1)
+        fun_l4_n384(x)
+    else
+        fun_l4_n444(x)
+    end
+end
+
+def fun_l3_n641(x)
+    if (x < 1)
+        fun_l4_n699(x)
+    else
+        fun_l4_n26(x)
+    end
+end
+
+def fun_l3_n642(x)
+    if (x < 1)
+        fun_l4_n96(x)
+    else
+        fun_l4_n623(x)
+    end
+end
+
+def fun_l3_n643(x)
+    if (x < 1)
+        fun_l4_n928(x)
+    else
+        fun_l4_n8(x)
+    end
+end
+
+def fun_l3_n644(x)
+    if (x < 1)
+        fun_l4_n804(x)
+    else
+        fun_l4_n618(x)
+    end
+end
+
+def fun_l3_n645(x)
+    if (x < 1)
+        fun_l4_n513(x)
+    else
+        fun_l4_n214(x)
+    end
+end
+
+def fun_l3_n646(x)
+    if (x < 1)
+        fun_l4_n605(x)
+    else
+        fun_l4_n920(x)
+    end
+end
+
+def fun_l3_n647(x)
+    if (x < 1)
+        fun_l4_n774(x)
+    else
+        fun_l4_n297(x)
+    end
+end
+
+def fun_l3_n648(x)
+    if (x < 1)
+        fun_l4_n871(x)
+    else
+        fun_l4_n75(x)
+    end
+end
+
+def fun_l3_n649(x)
+    if (x < 1)
+        fun_l4_n196(x)
+    else
+        fun_l4_n277(x)
+    end
+end
+
+def fun_l3_n650(x)
+    if (x < 1)
+        fun_l4_n25(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n651(x)
+    if (x < 1)
+        fun_l4_n603(x)
+    else
+        fun_l4_n46(x)
+    end
+end
+
+def fun_l3_n652(x)
+    if (x < 1)
+        fun_l4_n623(x)
+    else
+        fun_l4_n604(x)
+    end
+end
+
+def fun_l3_n653(x)
+    if (x < 1)
+        fun_l4_n854(x)
+    else
+        fun_l4_n955(x)
+    end
+end
+
+def fun_l3_n654(x)
+    if (x < 1)
+        fun_l4_n667(x)
+    else
+        fun_l4_n988(x)
+    end
+end
+
+def fun_l3_n655(x)
+    if (x < 1)
+        fun_l4_n263(x)
+    else
+        fun_l4_n831(x)
+    end
+end
+
+def fun_l3_n656(x)
+    if (x < 1)
+        fun_l4_n591(x)
+    else
+        fun_l4_n593(x)
+    end
+end
+
+def fun_l3_n657(x)
+    if (x < 1)
+        fun_l4_n308(x)
+    else
+        fun_l4_n547(x)
+    end
+end
+
+def fun_l3_n658(x)
+    if (x < 1)
+        fun_l4_n780(x)
+    else
+        fun_l4_n174(x)
+    end
+end
+
+def fun_l3_n659(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n660(x)
+    if (x < 1)
+        fun_l4_n279(x)
+    else
+        fun_l4_n282(x)
+    end
+end
+
+def fun_l3_n661(x)
+    if (x < 1)
+        fun_l4_n953(x)
+    else
+        fun_l4_n832(x)
+    end
+end
+
+def fun_l3_n662(x)
+    if (x < 1)
+        fun_l4_n525(x)
+    else
+        fun_l4_n850(x)
+    end
+end
+
+def fun_l3_n663(x)
+    if (x < 1)
+        fun_l4_n606(x)
+    else
+        fun_l4_n167(x)
+    end
+end
+
+def fun_l3_n664(x)
+    if (x < 1)
+        fun_l4_n941(x)
+    else
+        fun_l4_n591(x)
+    end
+end
+
+def fun_l3_n665(x)
+    if (x < 1)
+        fun_l4_n781(x)
+    else
+        fun_l4_n162(x)
+    end
+end
+
+def fun_l3_n666(x)
+    if (x < 1)
+        fun_l4_n848(x)
+    else
+        fun_l4_n133(x)
+    end
+end
+
+def fun_l3_n667(x)
+    if (x < 1)
+        fun_l4_n341(x)
+    else
+        fun_l4_n212(x)
+    end
+end
+
+def fun_l3_n668(x)
+    if (x < 1)
+        fun_l4_n320(x)
+    else
+        fun_l4_n131(x)
+    end
+end
+
+def fun_l3_n669(x)
+    if (x < 1)
+        fun_l4_n18(x)
+    else
+        fun_l4_n385(x)
+    end
+end
+
+def fun_l3_n670(x)
+    if (x < 1)
+        fun_l4_n917(x)
+    else
+        fun_l4_n988(x)
+    end
+end
+
+def fun_l3_n671(x)
+    if (x < 1)
+        fun_l4_n50(x)
+    else
+        fun_l4_n27(x)
+    end
+end
+
+def fun_l3_n672(x)
+    if (x < 1)
+        fun_l4_n277(x)
+    else
+        fun_l4_n238(x)
+    end
+end
+
+def fun_l3_n673(x)
+    if (x < 1)
+        fun_l4_n303(x)
+    else
+        fun_l4_n643(x)
+    end
+end
+
+def fun_l3_n674(x)
+    if (x < 1)
+        fun_l4_n794(x)
+    else
+        fun_l4_n906(x)
+    end
+end
+
+def fun_l3_n675(x)
+    if (x < 1)
+        fun_l4_n688(x)
+    else
+        fun_l4_n312(x)
+    end
+end
+
+def fun_l3_n676(x)
+    if (x < 1)
+        fun_l4_n833(x)
+    else
+        fun_l4_n900(x)
+    end
+end
+
+def fun_l3_n677(x)
+    if (x < 1)
+        fun_l4_n649(x)
+    else
+        fun_l4_n822(x)
+    end
+end
+
+def fun_l3_n678(x)
+    if (x < 1)
+        fun_l4_n958(x)
+    else
+        fun_l4_n939(x)
+    end
+end
+
+def fun_l3_n679(x)
+    if (x < 1)
+        fun_l4_n949(x)
+    else
+        fun_l4_n887(x)
+    end
+end
+
+def fun_l3_n680(x)
+    if (x < 1)
+        fun_l4_n630(x)
+    else
+        fun_l4_n508(x)
+    end
+end
+
+def fun_l3_n681(x)
+    if (x < 1)
+        fun_l4_n553(x)
+    else
+        fun_l4_n940(x)
+    end
+end
+
+def fun_l3_n682(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n950(x)
+    end
+end
+
+def fun_l3_n683(x)
+    if (x < 1)
+        fun_l4_n898(x)
+    else
+        fun_l4_n374(x)
+    end
+end
+
+def fun_l3_n684(x)
+    if (x < 1)
+        fun_l4_n802(x)
+    else
+        fun_l4_n527(x)
+    end
+end
+
+def fun_l3_n685(x)
+    if (x < 1)
+        fun_l4_n751(x)
+    else
+        fun_l4_n967(x)
+    end
+end
+
+def fun_l3_n686(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n559(x)
+    end
+end
+
+def fun_l3_n687(x)
+    if (x < 1)
+        fun_l4_n694(x)
+    else
+        fun_l4_n819(x)
+    end
+end
+
+def fun_l3_n688(x)
+    if (x < 1)
+        fun_l4_n167(x)
+    else
+        fun_l4_n91(x)
+    end
+end
+
+def fun_l3_n689(x)
+    if (x < 1)
+        fun_l4_n692(x)
+    else
+        fun_l4_n422(x)
+    end
+end
+
+def fun_l3_n690(x)
+    if (x < 1)
+        fun_l4_n344(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n691(x)
+    if (x < 1)
+        fun_l4_n394(x)
+    else
+        fun_l4_n603(x)
+    end
+end
+
+def fun_l3_n692(x)
+    if (x < 1)
+        fun_l4_n909(x)
+    else
+        fun_l4_n528(x)
+    end
+end
+
+def fun_l3_n693(x)
+    if (x < 1)
+        fun_l4_n180(x)
+    else
+        fun_l4_n22(x)
+    end
+end
+
+def fun_l3_n694(x)
+    if (x < 1)
+        fun_l4_n6(x)
+    else
+        fun_l4_n777(x)
+    end
+end
+
+def fun_l3_n695(x)
+    if (x < 1)
+        fun_l4_n327(x)
+    else
+        fun_l4_n948(x)
+    end
+end
+
+def fun_l3_n696(x)
+    if (x < 1)
+        fun_l4_n748(x)
+    else
+        fun_l4_n706(x)
+    end
+end
+
+def fun_l3_n697(x)
+    if (x < 1)
+        fun_l4_n720(x)
+    else
+        fun_l4_n693(x)
+    end
+end
+
+def fun_l3_n698(x)
+    if (x < 1)
+        fun_l4_n282(x)
+    else
+        fun_l4_n755(x)
+    end
+end
+
+def fun_l3_n699(x)
+    if (x < 1)
+        fun_l4_n975(x)
+    else
+        fun_l4_n415(x)
+    end
+end
+
+def fun_l3_n700(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n701(x)
+    if (x < 1)
+        fun_l4_n58(x)
+    else
+        fun_l4_n892(x)
+    end
+end
+
+def fun_l3_n702(x)
+    if (x < 1)
+        fun_l4_n366(x)
+    else
+        fun_l4_n189(x)
+    end
+end
+
+def fun_l3_n703(x)
+    if (x < 1)
+        fun_l4_n422(x)
+    else
+        fun_l4_n535(x)
+    end
+end
+
+def fun_l3_n704(x)
+    if (x < 1)
+        fun_l4_n886(x)
+    else
+        fun_l4_n223(x)
+    end
+end
+
+def fun_l3_n705(x)
+    if (x < 1)
+        fun_l4_n57(x)
+    else
+        fun_l4_n62(x)
+    end
+end
+
+def fun_l3_n706(x)
+    if (x < 1)
+        fun_l4_n629(x)
+    else
+        fun_l4_n479(x)
+    end
+end
+
+def fun_l3_n707(x)
+    if (x < 1)
+        fun_l4_n477(x)
+    else
+        fun_l4_n302(x)
+    end
+end
+
+def fun_l3_n708(x)
+    if (x < 1)
+        fun_l4_n790(x)
+    else
+        fun_l4_n262(x)
+    end
+end
+
+def fun_l3_n709(x)
+    if (x < 1)
+        fun_l4_n772(x)
+    else
+        fun_l4_n995(x)
+    end
+end
+
+def fun_l3_n710(x)
+    if (x < 1)
+        fun_l4_n549(x)
+    else
+        fun_l4_n651(x)
+    end
+end
+
+def fun_l3_n711(x)
+    if (x < 1)
+        fun_l4_n77(x)
+    else
+        fun_l4_n555(x)
+    end
+end
+
+def fun_l3_n712(x)
+    if (x < 1)
+        fun_l4_n515(x)
+    else
+        fun_l4_n734(x)
+    end
+end
+
+def fun_l3_n713(x)
+    if (x < 1)
+        fun_l4_n778(x)
+    else
+        fun_l4_n884(x)
+    end
+end
+
+def fun_l3_n714(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n637(x)
+    end
+end
+
+def fun_l3_n715(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n249(x)
+    end
+end
+
+def fun_l3_n716(x)
+    if (x < 1)
+        fun_l4_n44(x)
+    else
+        fun_l4_n307(x)
+    end
+end
+
+def fun_l3_n717(x)
+    if (x < 1)
+        fun_l4_n482(x)
+    else
+        fun_l4_n4(x)
+    end
+end
+
+def fun_l3_n718(x)
+    if (x < 1)
+        fun_l4_n195(x)
+    else
+        fun_l4_n410(x)
+    end
+end
+
+def fun_l3_n719(x)
+    if (x < 1)
+        fun_l4_n862(x)
+    else
+        fun_l4_n91(x)
+    end
+end
+
+def fun_l3_n720(x)
+    if (x < 1)
+        fun_l4_n591(x)
+    else
+        fun_l4_n391(x)
+    end
+end
+
+def fun_l3_n721(x)
+    if (x < 1)
+        fun_l4_n776(x)
+    else
+        fun_l4_n129(x)
+    end
+end
+
+def fun_l3_n722(x)
+    if (x < 1)
+        fun_l4_n857(x)
+    else
+        fun_l4_n160(x)
+    end
+end
+
+def fun_l3_n723(x)
+    if (x < 1)
+        fun_l4_n772(x)
+    else
+        fun_l4_n567(x)
+    end
+end
+
+def fun_l3_n724(x)
+    if (x < 1)
+        fun_l4_n582(x)
+    else
+        fun_l4_n100(x)
+    end
+end
+
+def fun_l3_n725(x)
+    if (x < 1)
+        fun_l4_n962(x)
+    else
+        fun_l4_n846(x)
+    end
+end
+
+def fun_l3_n726(x)
+    if (x < 1)
+        fun_l4_n892(x)
+    else
+        fun_l4_n334(x)
+    end
+end
+
+def fun_l3_n727(x)
+    if (x < 1)
+        fun_l4_n17(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n728(x)
+    if (x < 1)
+        fun_l4_n453(x)
+    else
+        fun_l4_n234(x)
+    end
+end
+
+def fun_l3_n729(x)
+    if (x < 1)
+        fun_l4_n562(x)
+    else
+        fun_l4_n139(x)
+    end
+end
+
+def fun_l3_n730(x)
+    if (x < 1)
+        fun_l4_n87(x)
+    else
+        fun_l4_n513(x)
+    end
+end
+
+def fun_l3_n731(x)
+    if (x < 1)
+        fun_l4_n565(x)
+    else
+        fun_l4_n289(x)
+    end
+end
+
+def fun_l3_n732(x)
+    if (x < 1)
+        fun_l4_n821(x)
+    else
+        fun_l4_n290(x)
+    end
+end
+
+def fun_l3_n733(x)
+    if (x < 1)
+        fun_l4_n464(x)
+    else
+        fun_l4_n929(x)
+    end
+end
+
+def fun_l3_n734(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n230(x)
+    end
+end
+
+def fun_l3_n735(x)
+    if (x < 1)
+        fun_l4_n942(x)
+    else
+        fun_l4_n770(x)
+    end
+end
+
+def fun_l3_n736(x)
+    if (x < 1)
+        fun_l4_n826(x)
+    else
+        fun_l4_n414(x)
+    end
+end
+
+def fun_l3_n737(x)
+    if (x < 1)
+        fun_l4_n47(x)
+    else
+        fun_l4_n357(x)
+    end
+end
+
+def fun_l3_n738(x)
+    if (x < 1)
+        fun_l4_n582(x)
+    else
+        fun_l4_n652(x)
+    end
+end
+
+def fun_l3_n739(x)
+    if (x < 1)
+        fun_l4_n641(x)
+    else
+        fun_l4_n479(x)
+    end
+end
+
+def fun_l3_n740(x)
+    if (x < 1)
+        fun_l4_n11(x)
+    else
+        fun_l4_n965(x)
+    end
+end
+
+def fun_l3_n741(x)
+    if (x < 1)
+        fun_l4_n402(x)
+    else
+        fun_l4_n512(x)
+    end
+end
+
+def fun_l3_n742(x)
+    if (x < 1)
+        fun_l4_n300(x)
+    else
+        fun_l4_n942(x)
+    end
+end
+
+def fun_l3_n743(x)
+    if (x < 1)
+        fun_l4_n770(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n744(x)
+    if (x < 1)
+        fun_l4_n575(x)
+    else
+        fun_l4_n158(x)
+    end
+end
+
+def fun_l3_n745(x)
+    if (x < 1)
+        fun_l4_n760(x)
+    else
+        fun_l4_n552(x)
+    end
+end
+
+def fun_l3_n746(x)
+    if (x < 1)
+        fun_l4_n887(x)
+    else
+        fun_l4_n319(x)
+    end
+end
+
+def fun_l3_n747(x)
+    if (x < 1)
+        fun_l4_n967(x)
+    else
+        fun_l4_n561(x)
+    end
+end
+
+def fun_l3_n748(x)
+    if (x < 1)
+        fun_l4_n4(x)
+    else
+        fun_l4_n766(x)
+    end
+end
+
+def fun_l3_n749(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n991(x)
+    end
+end
+
+def fun_l3_n750(x)
+    if (x < 1)
+        fun_l4_n890(x)
+    else
+        fun_l4_n663(x)
+    end
+end
+
+def fun_l3_n751(x)
+    if (x < 1)
+        fun_l4_n267(x)
+    else
+        fun_l4_n449(x)
+    end
+end
+
+def fun_l3_n752(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n226(x)
+    end
+end
+
+def fun_l3_n753(x)
+    if (x < 1)
+        fun_l4_n893(x)
+    else
+        fun_l4_n116(x)
+    end
+end
+
+def fun_l3_n754(x)
+    if (x < 1)
+        fun_l4_n570(x)
+    else
+        fun_l4_n192(x)
+    end
+end
+
+def fun_l3_n755(x)
+    if (x < 1)
+        fun_l4_n712(x)
+    else
+        fun_l4_n81(x)
+    end
+end
+
+def fun_l3_n756(x)
+    if (x < 1)
+        fun_l4_n833(x)
+    else
+        fun_l4_n24(x)
+    end
+end
+
+def fun_l3_n757(x)
+    if (x < 1)
+        fun_l4_n740(x)
+    else
+        fun_l4_n803(x)
+    end
+end
+
+def fun_l3_n758(x)
+    if (x < 1)
+        fun_l4_n552(x)
+    else
+        fun_l4_n551(x)
+    end
+end
+
+def fun_l3_n759(x)
+    if (x < 1)
+        fun_l4_n570(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n760(x)
+    if (x < 1)
+        fun_l4_n243(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n761(x)
+    if (x < 1)
+        fun_l4_n65(x)
+    else
+        fun_l4_n660(x)
+    end
+end
+
+def fun_l3_n762(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n761(x)
+    end
+end
+
+def fun_l3_n763(x)
+    if (x < 1)
+        fun_l4_n971(x)
+    else
+        fun_l4_n280(x)
+    end
+end
+
+def fun_l3_n764(x)
+    if (x < 1)
+        fun_l4_n441(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n765(x)
+    if (x < 1)
+        fun_l4_n577(x)
+    else
+        fun_l4_n586(x)
+    end
+end
+
+def fun_l3_n766(x)
+    if (x < 1)
+        fun_l4_n385(x)
+    else
+        fun_l4_n60(x)
+    end
+end
+
+def fun_l3_n767(x)
+    if (x < 1)
+        fun_l4_n380(x)
+    else
+        fun_l4_n32(x)
+    end
+end
+
+def fun_l3_n768(x)
+    if (x < 1)
+        fun_l4_n797(x)
+    else
+        fun_l4_n437(x)
+    end
+end
+
+def fun_l3_n769(x)
+    if (x < 1)
+        fun_l4_n615(x)
+    else
+        fun_l4_n369(x)
+    end
+end
+
+def fun_l3_n770(x)
+    if (x < 1)
+        fun_l4_n779(x)
+    else
+        fun_l4_n194(x)
+    end
+end
+
+def fun_l3_n771(x)
+    if (x < 1)
+        fun_l4_n287(x)
+    else
+        fun_l4_n819(x)
+    end
+end
+
+def fun_l3_n772(x)
+    if (x < 1)
+        fun_l4_n405(x)
+    else
+        fun_l4_n738(x)
+    end
+end
+
+def fun_l3_n773(x)
+    if (x < 1)
+        fun_l4_n706(x)
+    else
+        fun_l4_n174(x)
+    end
+end
+
+def fun_l3_n774(x)
+    if (x < 1)
+        fun_l4_n690(x)
+    else
+        fun_l4_n841(x)
+    end
+end
+
+def fun_l3_n775(x)
+    if (x < 1)
+        fun_l4_n256(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n776(x)
+    if (x < 1)
+        fun_l4_n342(x)
+    else
+        fun_l4_n359(x)
+    end
+end
+
+def fun_l3_n777(x)
+    if (x < 1)
+        fun_l4_n371(x)
+    else
+        fun_l4_n680(x)
+    end
+end
+
+def fun_l3_n778(x)
+    if (x < 1)
+        fun_l4_n996(x)
+    else
+        fun_l4_n343(x)
+    end
+end
+
+def fun_l3_n779(x)
+    if (x < 1)
+        fun_l4_n96(x)
+    else
+        fun_l4_n893(x)
+    end
+end
+
+def fun_l3_n780(x)
+    if (x < 1)
+        fun_l4_n706(x)
+    else
+        fun_l4_n140(x)
+    end
+end
+
+def fun_l3_n781(x)
+    if (x < 1)
+        fun_l4_n349(x)
+    else
+        fun_l4_n317(x)
+    end
+end
+
+def fun_l3_n782(x)
+    if (x < 1)
+        fun_l4_n491(x)
+    else
+        fun_l4_n616(x)
+    end
+end
+
+def fun_l3_n783(x)
+    if (x < 1)
+        fun_l4_n227(x)
+    else
+        fun_l4_n356(x)
+    end
+end
+
+def fun_l3_n784(x)
+    if (x < 1)
+        fun_l4_n387(x)
+    else
+        fun_l4_n532(x)
+    end
+end
+
+def fun_l3_n785(x)
+    if (x < 1)
+        fun_l4_n648(x)
+    else
+        fun_l4_n34(x)
+    end
+end
+
+def fun_l3_n786(x)
+    if (x < 1)
+        fun_l4_n562(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n787(x)
+    if (x < 1)
+        fun_l4_n162(x)
+    else
+        fun_l4_n384(x)
+    end
+end
+
+def fun_l3_n788(x)
+    if (x < 1)
+        fun_l4_n221(x)
+    else
+        fun_l4_n617(x)
+    end
+end
+
+def fun_l3_n789(x)
+    if (x < 1)
+        fun_l4_n670(x)
+    else
+        fun_l4_n350(x)
+    end
+end
+
+def fun_l3_n790(x)
+    if (x < 1)
+        fun_l4_n202(x)
+    else
+        fun_l4_n112(x)
+    end
+end
+
+def fun_l3_n791(x)
+    if (x < 1)
+        fun_l4_n390(x)
+    else
+        fun_l4_n868(x)
+    end
+end
+
+def fun_l3_n792(x)
+    if (x < 1)
+        fun_l4_n746(x)
+    else
+        fun_l4_n833(x)
+    end
+end
+
+def fun_l3_n793(x)
+    if (x < 1)
+        fun_l4_n471(x)
+    else
+        fun_l4_n60(x)
+    end
+end
+
+def fun_l3_n794(x)
+    if (x < 1)
+        fun_l4_n583(x)
+    else
+        fun_l4_n470(x)
+    end
+end
+
+def fun_l3_n795(x)
+    if (x < 1)
+        fun_l4_n567(x)
+    else
+        fun_l4_n218(x)
+    end
+end
+
+def fun_l3_n796(x)
+    if (x < 1)
+        fun_l4_n140(x)
+    else
+        fun_l4_n690(x)
+    end
+end
+
+def fun_l3_n797(x)
+    if (x < 1)
+        fun_l4_n190(x)
+    else
+        fun_l4_n437(x)
+    end
+end
+
+def fun_l3_n798(x)
+    if (x < 1)
+        fun_l4_n684(x)
+    else
+        fun_l4_n843(x)
+    end
+end
+
+def fun_l3_n799(x)
+    if (x < 1)
+        fun_l4_n825(x)
+    else
+        fun_l4_n354(x)
+    end
+end
+
+def fun_l3_n800(x)
+    if (x < 1)
+        fun_l4_n711(x)
+    else
+        fun_l4_n606(x)
+    end
+end
+
+def fun_l3_n801(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n464(x)
+    end
+end
+
+def fun_l3_n802(x)
+    if (x < 1)
+        fun_l4_n143(x)
+    else
+        fun_l4_n962(x)
+    end
+end
+
+def fun_l3_n803(x)
+    if (x < 1)
+        fun_l4_n223(x)
+    else
+        fun_l4_n293(x)
+    end
+end
+
+def fun_l3_n804(x)
+    if (x < 1)
+        fun_l4_n832(x)
+    else
+        fun_l4_n632(x)
+    end
+end
+
+def fun_l3_n805(x)
+    if (x < 1)
+        fun_l4_n649(x)
+    else
+        fun_l4_n259(x)
+    end
+end
+
+def fun_l3_n806(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n993(x)
+    end
+end
+
+def fun_l3_n807(x)
+    if (x < 1)
+        fun_l4_n257(x)
+    else
+        fun_l4_n712(x)
+    end
+end
+
+def fun_l3_n808(x)
+    if (x < 1)
+        fun_l4_n632(x)
+    else
+        fun_l4_n563(x)
+    end
+end
+
+def fun_l3_n809(x)
+    if (x < 1)
+        fun_l4_n154(x)
+    else
+        fun_l4_n561(x)
+    end
+end
+
+def fun_l3_n810(x)
+    if (x < 1)
+        fun_l4_n411(x)
+    else
+        fun_l4_n42(x)
+    end
+end
+
+def fun_l3_n811(x)
+    if (x < 1)
+        fun_l4_n560(x)
+    else
+        fun_l4_n531(x)
+    end
+end
+
+def fun_l3_n812(x)
+    if (x < 1)
+        fun_l4_n759(x)
+    else
+        fun_l4_n588(x)
+    end
+end
+
+def fun_l3_n813(x)
+    if (x < 1)
+        fun_l4_n311(x)
+    else
+        fun_l4_n813(x)
+    end
+end
+
+def fun_l3_n814(x)
+    if (x < 1)
+        fun_l4_n521(x)
+    else
+        fun_l4_n877(x)
+    end
+end
+
+def fun_l3_n815(x)
+    if (x < 1)
+        fun_l4_n578(x)
+    else
+        fun_l4_n37(x)
+    end
+end
+
+def fun_l3_n816(x)
+    if (x < 1)
+        fun_l4_n337(x)
+    else
+        fun_l4_n562(x)
+    end
+end
+
+def fun_l3_n817(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n445(x)
+    end
+end
+
+def fun_l3_n818(x)
+    if (x < 1)
+        fun_l4_n256(x)
+    else
+        fun_l4_n551(x)
+    end
+end
+
+def fun_l3_n819(x)
+    if (x < 1)
+        fun_l4_n718(x)
+    else
+        fun_l4_n463(x)
+    end
+end
+
+def fun_l3_n820(x)
+    if (x < 1)
+        fun_l4_n780(x)
+    else
+        fun_l4_n103(x)
+    end
+end
+
+def fun_l3_n821(x)
+    if (x < 1)
+        fun_l4_n729(x)
+    else
+        fun_l4_n331(x)
+    end
+end
+
+def fun_l3_n822(x)
+    if (x < 1)
+        fun_l4_n84(x)
+    else
+        fun_l4_n176(x)
+    end
+end
+
+def fun_l3_n823(x)
+    if (x < 1)
+        fun_l4_n231(x)
+    else
+        fun_l4_n681(x)
+    end
+end
+
+def fun_l3_n824(x)
+    if (x < 1)
+        fun_l4_n675(x)
+    else
+        fun_l4_n837(x)
+    end
+end
+
+def fun_l3_n825(x)
+    if (x < 1)
+        fun_l4_n140(x)
+    else
+        fun_l4_n932(x)
+    end
+end
+
+def fun_l3_n826(x)
+    if (x < 1)
+        fun_l4_n268(x)
+    else
+        fun_l4_n908(x)
+    end
+end
+
+def fun_l3_n827(x)
+    if (x < 1)
+        fun_l4_n959(x)
+    else
+        fun_l4_n643(x)
+    end
+end
+
+def fun_l3_n828(x)
+    if (x < 1)
+        fun_l4_n290(x)
+    else
+        fun_l4_n718(x)
+    end
+end
+
+def fun_l3_n829(x)
+    if (x < 1)
+        fun_l4_n430(x)
+    else
+        fun_l4_n114(x)
+    end
+end
+
+def fun_l3_n830(x)
+    if (x < 1)
+        fun_l4_n817(x)
+    else
+        fun_l4_n296(x)
+    end
+end
+
+def fun_l3_n831(x)
+    if (x < 1)
+        fun_l4_n586(x)
+    else
+        fun_l4_n345(x)
+    end
+end
+
+def fun_l3_n832(x)
+    if (x < 1)
+        fun_l4_n321(x)
+    else
+        fun_l4_n805(x)
+    end
+end
+
+def fun_l3_n833(x)
+    if (x < 1)
+        fun_l4_n57(x)
+    else
+        fun_l4_n373(x)
+    end
+end
+
+def fun_l3_n834(x)
+    if (x < 1)
+        fun_l4_n344(x)
+    else
+        fun_l4_n654(x)
+    end
+end
+
+def fun_l3_n835(x)
+    if (x < 1)
+        fun_l4_n761(x)
+    else
+        fun_l4_n295(x)
+    end
+end
+
+def fun_l3_n836(x)
+    if (x < 1)
+        fun_l4_n169(x)
+    else
+        fun_l4_n184(x)
+    end
+end
+
+def fun_l3_n837(x)
+    if (x < 1)
+        fun_l4_n482(x)
+    else
+        fun_l4_n127(x)
+    end
+end
+
+def fun_l3_n838(x)
+    if (x < 1)
+        fun_l4_n260(x)
+    else
+        fun_l4_n662(x)
+    end
+end
+
+def fun_l3_n839(x)
+    if (x < 1)
+        fun_l4_n548(x)
+    else
+        fun_l4_n197(x)
+    end
+end
+
+def fun_l3_n840(x)
+    if (x < 1)
+        fun_l4_n96(x)
+    else
+        fun_l4_n17(x)
+    end
+end
+
+def fun_l3_n841(x)
+    if (x < 1)
+        fun_l4_n946(x)
+    else
+        fun_l4_n447(x)
+    end
+end
+
+def fun_l3_n842(x)
+    if (x < 1)
+        fun_l4_n66(x)
+    else
+        fun_l4_n110(x)
+    end
+end
+
+def fun_l3_n843(x)
+    if (x < 1)
+        fun_l4_n574(x)
+    else
+        fun_l4_n887(x)
+    end
+end
+
+def fun_l3_n844(x)
+    if (x < 1)
+        fun_l4_n912(x)
+    else
+        fun_l4_n465(x)
+    end
+end
+
+def fun_l3_n845(x)
+    if (x < 1)
+        fun_l4_n401(x)
+    else
+        fun_l4_n903(x)
+    end
+end
+
+def fun_l3_n846(x)
+    if (x < 1)
+        fun_l4_n929(x)
+    else
+        fun_l4_n238(x)
+    end
+end
+
+def fun_l3_n847(x)
+    if (x < 1)
+        fun_l4_n579(x)
+    else
+        fun_l4_n924(x)
+    end
+end
+
+def fun_l3_n848(x)
+    if (x < 1)
+        fun_l4_n697(x)
+    else
+        fun_l4_n157(x)
+    end
+end
+
+def fun_l3_n849(x)
+    if (x < 1)
+        fun_l4_n608(x)
+    else
+        fun_l4_n426(x)
+    end
+end
+
+def fun_l3_n850(x)
+    if (x < 1)
+        fun_l4_n710(x)
+    else
+        fun_l4_n360(x)
+    end
+end
+
+def fun_l3_n851(x)
+    if (x < 1)
+        fun_l4_n558(x)
+    else
+        fun_l4_n152(x)
+    end
+end
+
+def fun_l3_n852(x)
+    if (x < 1)
+        fun_l4_n276(x)
+    else
+        fun_l4_n895(x)
+    end
+end
+
+def fun_l3_n853(x)
+    if (x < 1)
+        fun_l4_n945(x)
+    else
+        fun_l4_n251(x)
+    end
+end
+
+def fun_l3_n854(x)
+    if (x < 1)
+        fun_l4_n131(x)
+    else
+        fun_l4_n677(x)
+    end
+end
+
+def fun_l3_n855(x)
+    if (x < 1)
+        fun_l4_n493(x)
+    else
+        fun_l4_n631(x)
+    end
+end
+
+def fun_l3_n856(x)
+    if (x < 1)
+        fun_l4_n608(x)
+    else
+        fun_l4_n556(x)
+    end
+end
+
+def fun_l3_n857(x)
+    if (x < 1)
+        fun_l4_n808(x)
+    else
+        fun_l4_n672(x)
+    end
+end
+
+def fun_l3_n858(x)
+    if (x < 1)
+        fun_l4_n407(x)
+    else
+        fun_l4_n648(x)
+    end
+end
+
+def fun_l3_n859(x)
+    if (x < 1)
+        fun_l4_n217(x)
+    else
+        fun_l4_n763(x)
+    end
+end
+
+def fun_l3_n860(x)
+    if (x < 1)
+        fun_l4_n941(x)
+    else
+        fun_l4_n159(x)
+    end
+end
+
+def fun_l3_n861(x)
+    if (x < 1)
+        fun_l4_n364(x)
+    else
+        fun_l4_n241(x)
+    end
+end
+
+def fun_l3_n862(x)
+    if (x < 1)
+        fun_l4_n915(x)
+    else
+        fun_l4_n729(x)
+    end
+end
+
+def fun_l3_n863(x)
+    if (x < 1)
+        fun_l4_n137(x)
+    else
+        fun_l4_n317(x)
+    end
+end
+
+def fun_l3_n864(x)
+    if (x < 1)
+        fun_l4_n818(x)
+    else
+        fun_l4_n782(x)
+    end
+end
+
+def fun_l3_n865(x)
+    if (x < 1)
+        fun_l4_n577(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n866(x)
+    if (x < 1)
+        fun_l4_n882(x)
+    else
+        fun_l4_n7(x)
+    end
+end
+
+def fun_l3_n867(x)
+    if (x < 1)
+        fun_l4_n238(x)
+    else
+        fun_l4_n944(x)
+    end
+end
+
+def fun_l3_n868(x)
+    if (x < 1)
+        fun_l4_n105(x)
+    else
+        fun_l4_n465(x)
+    end
+end
+
+def fun_l3_n869(x)
+    if (x < 1)
+        fun_l4_n841(x)
+    else
+        fun_l4_n262(x)
+    end
+end
+
+def fun_l3_n870(x)
+    if (x < 1)
+        fun_l4_n32(x)
+    else
+        fun_l4_n992(x)
+    end
+end
+
+def fun_l3_n871(x)
+    if (x < 1)
+        fun_l4_n431(x)
+    else
+        fun_l4_n391(x)
+    end
+end
+
+def fun_l3_n872(x)
+    if (x < 1)
+        fun_l4_n829(x)
+    else
+        fun_l4_n879(x)
+    end
+end
+
+def fun_l3_n873(x)
+    if (x < 1)
+        fun_l4_n617(x)
+    else
+        fun_l4_n657(x)
+    end
+end
+
+def fun_l3_n874(x)
+    if (x < 1)
+        fun_l4_n529(x)
+    else
+        fun_l4_n717(x)
+    end
+end
+
+def fun_l3_n875(x)
+    if (x < 1)
+        fun_l4_n928(x)
+    else
+        fun_l4_n476(x)
+    end
+end
+
+def fun_l3_n876(x)
+    if (x < 1)
+        fun_l4_n388(x)
+    else
+        fun_l4_n949(x)
+    end
+end
+
+def fun_l3_n877(x)
+    if (x < 1)
+        fun_l4_n826(x)
+    else
+        fun_l4_n560(x)
+    end
+end
+
+def fun_l3_n878(x)
+    if (x < 1)
+        fun_l4_n863(x)
+    else
+        fun_l4_n122(x)
+    end
+end
+
+def fun_l3_n879(x)
+    if (x < 1)
+        fun_l4_n964(x)
+    else
+        fun_l4_n793(x)
+    end
+end
+
+def fun_l3_n880(x)
+    if (x < 1)
+        fun_l4_n141(x)
+    else
+        fun_l4_n132(x)
+    end
+end
+
+def fun_l3_n881(x)
+    if (x < 1)
+        fun_l4_n735(x)
+    else
+        fun_l4_n592(x)
+    end
+end
+
+def fun_l3_n882(x)
+    if (x < 1)
+        fun_l4_n585(x)
+    else
+        fun_l4_n341(x)
+    end
+end
+
+def fun_l3_n883(x)
+    if (x < 1)
+        fun_l4_n843(x)
+    else
+        fun_l4_n692(x)
+    end
+end
+
+def fun_l3_n884(x)
+    if (x < 1)
+        fun_l4_n360(x)
+    else
+        fun_l4_n833(x)
+    end
+end
+
+def fun_l3_n885(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n62(x)
+    end
+end
+
+def fun_l3_n886(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n699(x)
+    end
+end
+
+def fun_l3_n887(x)
+    if (x < 1)
+        fun_l4_n71(x)
+    else
+        fun_l4_n256(x)
+    end
+end
+
+def fun_l3_n888(x)
+    if (x < 1)
+        fun_l4_n406(x)
+    else
+        fun_l4_n493(x)
+    end
+end
+
+def fun_l3_n889(x)
+    if (x < 1)
+        fun_l4_n489(x)
+    else
+        fun_l4_n874(x)
+    end
+end
+
+def fun_l3_n890(x)
+    if (x < 1)
+        fun_l4_n365(x)
+    else
+        fun_l4_n910(x)
+    end
+end
+
+def fun_l3_n891(x)
+    if (x < 1)
+        fun_l4_n262(x)
+    else
+        fun_l4_n665(x)
+    end
+end
+
+def fun_l3_n892(x)
+    if (x < 1)
+        fun_l4_n274(x)
+    else
+        fun_l4_n849(x)
+    end
+end
+
+def fun_l3_n893(x)
+    if (x < 1)
+        fun_l4_n880(x)
+    else
+        fun_l4_n739(x)
+    end
+end
+
+def fun_l3_n894(x)
+    if (x < 1)
+        fun_l4_n504(x)
+    else
+        fun_l4_n128(x)
+    end
+end
+
+def fun_l3_n895(x)
+    if (x < 1)
+        fun_l4_n555(x)
+    else
+        fun_l4_n281(x)
+    end
+end
+
+def fun_l3_n896(x)
+    if (x < 1)
+        fun_l4_n270(x)
+    else
+        fun_l4_n225(x)
+    end
+end
+
+def fun_l3_n897(x)
+    if (x < 1)
+        fun_l4_n38(x)
+    else
+        fun_l4_n26(x)
+    end
+end
+
+def fun_l3_n898(x)
+    if (x < 1)
+        fun_l4_n944(x)
+    else
+        fun_l4_n217(x)
+    end
+end
+
+def fun_l3_n899(x)
+    if (x < 1)
+        fun_l4_n967(x)
+    else
+        fun_l4_n853(x)
+    end
+end
+
+def fun_l3_n900(x)
+    if (x < 1)
+        fun_l4_n686(x)
+    else
+        fun_l4_n760(x)
+    end
+end
+
+def fun_l3_n901(x)
+    if (x < 1)
+        fun_l4_n698(x)
+    else
+        fun_l4_n842(x)
+    end
+end
+
+def fun_l3_n902(x)
+    if (x < 1)
+        fun_l4_n344(x)
+    else
+        fun_l4_n701(x)
+    end
+end
+
+def fun_l3_n903(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n321(x)
+    end
+end
+
+def fun_l3_n904(x)
+    if (x < 1)
+        fun_l4_n504(x)
+    else
+        fun_l4_n228(x)
+    end
+end
+
+def fun_l3_n905(x)
+    if (x < 1)
+        fun_l4_n135(x)
+    else
+        fun_l4_n57(x)
+    end
+end
+
+def fun_l3_n906(x)
+    if (x < 1)
+        fun_l4_n279(x)
+    else
+        fun_l4_n912(x)
+    end
+end
+
+def fun_l3_n907(x)
+    if (x < 1)
+        fun_l4_n962(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n908(x)
+    if (x < 1)
+        fun_l4_n972(x)
+    else
+        fun_l4_n14(x)
+    end
+end
+
+def fun_l3_n909(x)
+    if (x < 1)
+        fun_l4_n231(x)
+    else
+        fun_l4_n763(x)
+    end
+end
+
+def fun_l3_n910(x)
+    if (x < 1)
+        fun_l4_n859(x)
+    else
+        fun_l4_n243(x)
+    end
+end
+
+def fun_l3_n911(x)
+    if (x < 1)
+        fun_l4_n153(x)
+    else
+        fun_l4_n136(x)
+    end
+end
+
+def fun_l3_n912(x)
+    if (x < 1)
+        fun_l4_n325(x)
+    else
+        fun_l4_n113(x)
+    end
+end
+
+def fun_l3_n913(x)
+    if (x < 1)
+        fun_l4_n625(x)
+    else
+        fun_l4_n179(x)
+    end
+end
+
+def fun_l3_n914(x)
+    if (x < 1)
+        fun_l4_n54(x)
+    else
+        fun_l4_n88(x)
+    end
+end
+
+def fun_l3_n915(x)
+    if (x < 1)
+        fun_l4_n332(x)
+    else
+        fun_l4_n3(x)
+    end
+end
+
+def fun_l3_n916(x)
+    if (x < 1)
+        fun_l4_n748(x)
+    else
+        fun_l4_n21(x)
+    end
+end
+
+def fun_l3_n917(x)
+    if (x < 1)
+        fun_l4_n132(x)
+    else
+        fun_l4_n132(x)
+    end
+end
+
+def fun_l3_n918(x)
+    if (x < 1)
+        fun_l4_n295(x)
+    else
+        fun_l4_n429(x)
+    end
+end
+
+def fun_l3_n919(x)
+    if (x < 1)
+        fun_l4_n105(x)
+    else
+        fun_l4_n984(x)
+    end
+end
+
+def fun_l3_n920(x)
+    if (x < 1)
+        fun_l4_n319(x)
+    else
+        fun_l4_n304(x)
+    end
+end
+
+def fun_l3_n921(x)
+    if (x < 1)
+        fun_l4_n756(x)
+    else
+        fun_l4_n639(x)
+    end
+end
+
+def fun_l3_n922(x)
+    if (x < 1)
+        fun_l4_n678(x)
+    else
+        fun_l4_n209(x)
+    end
+end
+
+def fun_l3_n923(x)
+    if (x < 1)
+        fun_l4_n755(x)
+    else
+        fun_l4_n941(x)
+    end
+end
+
+def fun_l3_n924(x)
+    if (x < 1)
+        fun_l4_n311(x)
+    else
+        fun_l4_n272(x)
+    end
+end
+
+def fun_l3_n925(x)
+    if (x < 1)
+        fun_l4_n543(x)
+    else
+        fun_l4_n896(x)
+    end
+end
+
+def fun_l3_n926(x)
+    if (x < 1)
+        fun_l4_n994(x)
+    else
+        fun_l4_n671(x)
+    end
+end
+
+def fun_l3_n927(x)
+    if (x < 1)
+        fun_l4_n125(x)
+    else
+        fun_l4_n852(x)
+    end
+end
+
+def fun_l3_n928(x)
+    if (x < 1)
+        fun_l4_n483(x)
+    else
+        fun_l4_n350(x)
+    end
+end
+
+def fun_l3_n929(x)
+    if (x < 1)
+        fun_l4_n622(x)
+    else
+        fun_l4_n511(x)
+    end
+end
+
+def fun_l3_n930(x)
+    if (x < 1)
+        fun_l4_n134(x)
+    else
+        fun_l4_n288(x)
+    end
+end
+
+def fun_l3_n931(x)
+    if (x < 1)
+        fun_l4_n278(x)
+    else
+        fun_l4_n800(x)
+    end
+end
+
+def fun_l3_n932(x)
+    if (x < 1)
+        fun_l4_n139(x)
+    else
+        fun_l4_n966(x)
+    end
+end
+
+def fun_l3_n933(x)
+    if (x < 1)
+        fun_l4_n275(x)
+    else
+        fun_l4_n506(x)
+    end
+end
+
+def fun_l3_n934(x)
+    if (x < 1)
+        fun_l4_n503(x)
+    else
+        fun_l4_n204(x)
+    end
+end
+
+def fun_l3_n935(x)
+    if (x < 1)
+        fun_l4_n993(x)
+    else
+        fun_l4_n126(x)
+    end
+end
+
+def fun_l3_n936(x)
+    if (x < 1)
+        fun_l4_n704(x)
+    else
+        fun_l4_n462(x)
+    end
+end
+
+def fun_l3_n937(x)
+    if (x < 1)
+        fun_l4_n922(x)
+    else
+        fun_l4_n722(x)
+    end
+end
+
+def fun_l3_n938(x)
+    if (x < 1)
+        fun_l4_n937(x)
+    else
+        fun_l4_n195(x)
+    end
+end
+
+def fun_l3_n939(x)
+    if (x < 1)
+        fun_l4_n661(x)
+    else
+        fun_l4_n265(x)
+    end
+end
+
+def fun_l3_n940(x)
+    if (x < 1)
+        fun_l4_n423(x)
+    else
+        fun_l4_n230(x)
+    end
+end
+
+def fun_l3_n941(x)
+    if (x < 1)
+        fun_l4_n698(x)
+    else
+        fun_l4_n226(x)
+    end
+end
+
+def fun_l3_n942(x)
+    if (x < 1)
+        fun_l4_n501(x)
+    else
+        fun_l4_n816(x)
+    end
+end
+
+def fun_l3_n943(x)
+    if (x < 1)
+        fun_l4_n650(x)
+    else
+        fun_l4_n925(x)
+    end
+end
+
+def fun_l3_n944(x)
+    if (x < 1)
+        fun_l4_n829(x)
+    else
+        fun_l4_n647(x)
+    end
+end
+
+def fun_l3_n945(x)
+    if (x < 1)
+        fun_l4_n401(x)
+    else
+        fun_l4_n791(x)
+    end
+end
+
+def fun_l3_n946(x)
+    if (x < 1)
+        fun_l4_n551(x)
+    else
+        fun_l4_n104(x)
+    end
+end
+
+def fun_l3_n947(x)
+    if (x < 1)
+        fun_l4_n927(x)
+    else
+        fun_l4_n213(x)
+    end
+end
+
+def fun_l3_n948(x)
+    if (x < 1)
+        fun_l4_n912(x)
+    else
+        fun_l4_n609(x)
+    end
+end
+
+def fun_l3_n949(x)
+    if (x < 1)
+        fun_l4_n302(x)
+    else
+        fun_l4_n157(x)
+    end
+end
+
+def fun_l3_n950(x)
+    if (x < 1)
+        fun_l4_n955(x)
+    else
+        fun_l4_n492(x)
+    end
+end
+
+def fun_l3_n951(x)
+    if (x < 1)
+        fun_l4_n486(x)
+    else
+        fun_l4_n412(x)
+    end
+end
+
+def fun_l3_n952(x)
+    if (x < 1)
+        fun_l4_n850(x)
+    else
+        fun_l4_n885(x)
+    end
+end
+
+def fun_l3_n953(x)
+    if (x < 1)
+        fun_l4_n84(x)
+    else
+        fun_l4_n622(x)
+    end
+end
+
+def fun_l3_n954(x)
+    if (x < 1)
+        fun_l4_n235(x)
+    else
+        fun_l4_n67(x)
+    end
+end
+
+def fun_l3_n955(x)
+    if (x < 1)
+        fun_l4_n347(x)
+    else
+        fun_l4_n757(x)
+    end
+end
+
+def fun_l3_n956(x)
+    if (x < 1)
+        fun_l4_n825(x)
+    else
+        fun_l4_n10(x)
+    end
+end
+
+def fun_l3_n957(x)
+    if (x < 1)
+        fun_l4_n393(x)
+    else
+        fun_l4_n482(x)
+    end
+end
+
+def fun_l3_n958(x)
+    if (x < 1)
+        fun_l4_n0(x)
+    else
+        fun_l4_n556(x)
+    end
+end
+
+def fun_l3_n959(x)
+    if (x < 1)
+        fun_l4_n806(x)
+    else
+        fun_l4_n783(x)
+    end
+end
+
+def fun_l3_n960(x)
+    if (x < 1)
+        fun_l4_n964(x)
+    else
+        fun_l4_n843(x)
+    end
+end
+
+def fun_l3_n961(x)
+    if (x < 1)
+        fun_l4_n508(x)
+    else
+        fun_l4_n874(x)
+    end
+end
+
+def fun_l3_n962(x)
+    if (x < 1)
+        fun_l4_n15(x)
+    else
+        fun_l4_n197(x)
+    end
+end
+
+def fun_l3_n963(x)
+    if (x < 1)
+        fun_l4_n989(x)
+    else
+        fun_l4_n380(x)
+    end
+end
+
+def fun_l3_n964(x)
+    if (x < 1)
+        fun_l4_n315(x)
+    else
+        fun_l4_n196(x)
+    end
+end
+
+def fun_l3_n965(x)
+    if (x < 1)
+        fun_l4_n510(x)
+    else
+        fun_l4_n275(x)
+    end
+end
+
+def fun_l3_n966(x)
+    if (x < 1)
+        fun_l4_n725(x)
+    else
+        fun_l4_n94(x)
+    end
+end
+
+def fun_l3_n967(x)
+    if (x < 1)
+        fun_l4_n733(x)
+    else
+        fun_l4_n577(x)
+    end
+end
+
+def fun_l3_n968(x)
+    if (x < 1)
+        fun_l4_n280(x)
+    else
+        fun_l4_n702(x)
+    end
+end
+
+def fun_l3_n969(x)
+    if (x < 1)
+        fun_l4_n41(x)
+    else
+        fun_l4_n343(x)
+    end
+end
+
+def fun_l3_n970(x)
+    if (x < 1)
+        fun_l4_n102(x)
+    else
+        fun_l4_n785(x)
+    end
+end
+
+def fun_l3_n971(x)
+    if (x < 1)
+        fun_l4_n460(x)
+    else
+        fun_l4_n388(x)
+    end
+end
+
+def fun_l3_n972(x)
+    if (x < 1)
+        fun_l4_n31(x)
+    else
+        fun_l4_n421(x)
+    end
+end
+
+def fun_l3_n973(x)
+    if (x < 1)
+        fun_l4_n587(x)
+    else
+        fun_l4_n401(x)
+    end
+end
+
+def fun_l3_n974(x)
+    if (x < 1)
+        fun_l4_n593(x)
+    else
+        fun_l4_n418(x)
+    end
+end
+
+def fun_l3_n975(x)
+    if (x < 1)
+        fun_l4_n12(x)
+    else
+        fun_l4_n929(x)
+    end
+end
+
+def fun_l3_n976(x)
+    if (x < 1)
+        fun_l4_n516(x)
+    else
+        fun_l4_n402(x)
+    end
+end
+
+def fun_l3_n977(x)
+    if (x < 1)
+        fun_l4_n590(x)
+    else
+        fun_l4_n876(x)
+    end
+end
+
+def fun_l3_n978(x)
+    if (x < 1)
+        fun_l4_n505(x)
+    else
+        fun_l4_n94(x)
+    end
+end
+
+def fun_l3_n979(x)
+    if (x < 1)
+        fun_l4_n625(x)
+    else
+        fun_l4_n344(x)
+    end
+end
+
+def fun_l3_n980(x)
+    if (x < 1)
+        fun_l4_n128(x)
+    else
+        fun_l4_n454(x)
+    end
+end
+
+def fun_l3_n981(x)
+    if (x < 1)
+        fun_l4_n937(x)
+    else
+        fun_l4_n277(x)
+    end
+end
+
+def fun_l3_n982(x)
+    if (x < 1)
+        fun_l4_n237(x)
+    else
+        fun_l4_n113(x)
+    end
+end
+
+def fun_l3_n983(x)
+    if (x < 1)
+        fun_l4_n668(x)
+    else
+        fun_l4_n668(x)
+    end
+end
+
+def fun_l3_n984(x)
+    if (x < 1)
+        fun_l4_n783(x)
+    else
+        fun_l4_n771(x)
+    end
+end
+
+def fun_l3_n985(x)
+    if (x < 1)
+        fun_l4_n135(x)
+    else
+        fun_l4_n967(x)
+    end
+end
+
+def fun_l3_n986(x)
+    if (x < 1)
+        fun_l4_n29(x)
+    else
+        fun_l4_n313(x)
+    end
+end
+
+def fun_l3_n987(x)
+    if (x < 1)
+        fun_l4_n765(x)
+    else
+        fun_l4_n885(x)
+    end
+end
+
+def fun_l3_n988(x)
+    if (x < 1)
+        fun_l4_n242(x)
+    else
+        fun_l4_n622(x)
+    end
+end
+
+def fun_l3_n989(x)
+    if (x < 1)
+        fun_l4_n916(x)
+    else
+        fun_l4_n518(x)
+    end
+end
+
+def fun_l3_n990(x)
+    if (x < 1)
+        fun_l4_n523(x)
+    else
+        fun_l4_n468(x)
+    end
+end
+
+def fun_l3_n991(x)
+    if (x < 1)
+        fun_l4_n904(x)
+    else
+        fun_l4_n601(x)
+    end
+end
+
+def fun_l3_n992(x)
+    if (x < 1)
+        fun_l4_n437(x)
+    else
+        fun_l4_n77(x)
+    end
+end
+
+def fun_l3_n993(x)
+    if (x < 1)
+        fun_l4_n957(x)
+    else
+        fun_l4_n619(x)
+    end
+end
+
+def fun_l3_n994(x)
+    if (x < 1)
+        fun_l4_n540(x)
+    else
+        fun_l4_n108(x)
+    end
+end
+
+def fun_l3_n995(x)
+    if (x < 1)
+        fun_l4_n8(x)
+    else
+        fun_l4_n428(x)
+    end
+end
+
+def fun_l3_n996(x)
+    if (x < 1)
+        fun_l4_n53(x)
+    else
+        fun_l4_n278(x)
+    end
+end
+
+def fun_l3_n997(x)
+    if (x < 1)
+        fun_l4_n930(x)
+    else
+        fun_l4_n671(x)
+    end
+end
+
+def fun_l3_n998(x)
+    if (x < 1)
+        fun_l4_n574(x)
+    else
+        fun_l4_n879(x)
+    end
+end
+
+def fun_l3_n999(x)
+    if (x < 1)
+        fun_l4_n316(x)
+    else
+        fun_l4_n93(x)
+    end
+end
+
+def fun_l4_n0(x)
+    if (x < 1)
+        fun_l5_n524(x)
+    else
+        fun_l5_n284(x)
+    end
+end
+
+def fun_l4_n1(x)
+    if (x < 1)
+        fun_l5_n845(x)
+    else
+        fun_l5_n863(x)
+    end
+end
+
+def fun_l4_n2(x)
+    if (x < 1)
+        fun_l5_n258(x)
+    else
+        fun_l5_n860(x)
+    end
+end
+
+def fun_l4_n3(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n4(x)
+    if (x < 1)
+        fun_l5_n833(x)
+    else
+        fun_l5_n807(x)
+    end
+end
+
+def fun_l4_n5(x)
+    if (x < 1)
+        fun_l5_n890(x)
+    else
+        fun_l5_n669(x)
+    end
+end
+
+def fun_l4_n6(x)
+    if (x < 1)
+        fun_l5_n396(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n7(x)
+    if (x < 1)
+        fun_l5_n926(x)
+    else
+        fun_l5_n661(x)
+    end
+end
+
+def fun_l4_n8(x)
+    if (x < 1)
+        fun_l5_n990(x)
+    else
+        fun_l5_n765(x)
+    end
+end
+
+def fun_l4_n9(x)
+    if (x < 1)
+        fun_l5_n978(x)
+    else
+        fun_l5_n342(x)
+    end
+end
+
+def fun_l4_n10(x)
+    if (x < 1)
+        fun_l5_n500(x)
+    else
+        fun_l5_n758(x)
+    end
+end
+
+def fun_l4_n11(x)
+    if (x < 1)
+        fun_l5_n10(x)
+    else
+        fun_l5_n796(x)
+    end
+end
+
+def fun_l4_n12(x)
+    if (x < 1)
+        fun_l5_n173(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n13(x)
+    if (x < 1)
+        fun_l5_n852(x)
+    else
+        fun_l5_n93(x)
+    end
+end
+
+def fun_l4_n14(x)
+    if (x < 1)
+        fun_l5_n526(x)
+    else
+        fun_l5_n144(x)
+    end
+end
+
+def fun_l4_n15(x)
+    if (x < 1)
+        fun_l5_n398(x)
+    else
+        fun_l5_n632(x)
+    end
+end
+
+def fun_l4_n16(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n716(x)
+    end
+end
+
+def fun_l4_n17(x)
+    if (x < 1)
+        fun_l5_n412(x)
+    else
+        fun_l5_n95(x)
+    end
+end
+
+def fun_l4_n18(x)
+    if (x < 1)
+        fun_l5_n446(x)
+    else
+        fun_l5_n885(x)
+    end
+end
+
+def fun_l4_n19(x)
+    if (x < 1)
+        fun_l5_n420(x)
+    else
+        fun_l5_n420(x)
+    end
+end
+
+def fun_l4_n20(x)
+    if (x < 1)
+        fun_l5_n274(x)
+    else
+        fun_l5_n813(x)
+    end
+end
+
+def fun_l4_n21(x)
+    if (x < 1)
+        fun_l5_n174(x)
+    else
+        fun_l5_n781(x)
+    end
+end
+
+def fun_l4_n22(x)
+    if (x < 1)
+        fun_l5_n903(x)
+    else
+        fun_l5_n224(x)
+    end
+end
+
+def fun_l4_n23(x)
+    if (x < 1)
+        fun_l5_n317(x)
+    else
+        fun_l5_n900(x)
+    end
+end
+
+def fun_l4_n24(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n515(x)
+    end
+end
+
+def fun_l4_n25(x)
+    if (x < 1)
+        fun_l5_n151(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n26(x)
+    if (x < 1)
+        fun_l5_n256(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n27(x)
+    if (x < 1)
+        fun_l5_n985(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n28(x)
+    if (x < 1)
+        fun_l5_n961(x)
+    else
+        fun_l5_n86(x)
+    end
+end
+
+def fun_l4_n29(x)
+    if (x < 1)
+        fun_l5_n359(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n30(x)
+    if (x < 1)
+        fun_l5_n426(x)
+    else
+        fun_l5_n983(x)
+    end
+end
+
+def fun_l4_n31(x)
+    if (x < 1)
+        fun_l5_n996(x)
+    else
+        fun_l5_n343(x)
+    end
+end
+
+def fun_l4_n32(x)
+    if (x < 1)
+        fun_l5_n300(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n33(x)
+    if (x < 1)
+        fun_l5_n755(x)
+    else
+        fun_l5_n623(x)
+    end
+end
+
+def fun_l4_n34(x)
+    if (x < 1)
+        fun_l5_n681(x)
+    else
+        fun_l5_n410(x)
+    end
+end
+
+def fun_l4_n35(x)
+    if (x < 1)
+        fun_l5_n356(x)
+    else
+        fun_l5_n351(x)
+    end
+end
+
+def fun_l4_n36(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n402(x)
+    end
+end
+
+def fun_l4_n37(x)
+    if (x < 1)
+        fun_l5_n250(x)
+    else
+        fun_l5_n681(x)
+    end
+end
+
+def fun_l4_n38(x)
+    if (x < 1)
+        fun_l5_n573(x)
+    else
+        fun_l5_n622(x)
+    end
+end
+
+def fun_l4_n39(x)
+    if (x < 1)
+        fun_l5_n545(x)
+    else
+        fun_l5_n210(x)
+    end
+end
+
+def fun_l4_n40(x)
+    if (x < 1)
+        fun_l5_n264(x)
+    else
+        fun_l5_n239(x)
+    end
+end
+
+def fun_l4_n41(x)
+    if (x < 1)
+        fun_l5_n635(x)
+    else
+        fun_l5_n224(x)
+    end
+end
+
+def fun_l4_n42(x)
+    if (x < 1)
+        fun_l5_n806(x)
+    else
+        fun_l5_n125(x)
+    end
+end
+
+def fun_l4_n43(x)
+    if (x < 1)
+        fun_l5_n480(x)
+    else
+        fun_l5_n625(x)
+    end
+end
+
+def fun_l4_n44(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n465(x)
+    end
+end
+
+def fun_l4_n45(x)
+    if (x < 1)
+        fun_l5_n999(x)
+    else
+        fun_l5_n759(x)
+    end
+end
+
+def fun_l4_n46(x)
+    if (x < 1)
+        fun_l5_n866(x)
+    else
+        fun_l5_n536(x)
+    end
+end
+
+def fun_l4_n47(x)
+    if (x < 1)
+        fun_l5_n328(x)
+    else
+        fun_l5_n533(x)
+    end
+end
+
+def fun_l4_n48(x)
+    if (x < 1)
+        fun_l5_n902(x)
+    else
+        fun_l5_n919(x)
+    end
+end
+
+def fun_l4_n49(x)
+    if (x < 1)
+        fun_l5_n197(x)
+    else
+        fun_l5_n262(x)
+    end
+end
+
+def fun_l4_n50(x)
+    if (x < 1)
+        fun_l5_n172(x)
+    else
+        fun_l5_n731(x)
+    end
+end
+
+def fun_l4_n51(x)
+    if (x < 1)
+        fun_l5_n502(x)
+    else
+        fun_l5_n149(x)
+    end
+end
+
+def fun_l4_n52(x)
+    if (x < 1)
+        fun_l5_n69(x)
+    else
+        fun_l5_n536(x)
+    end
+end
+
+def fun_l4_n53(x)
+    if (x < 1)
+        fun_l5_n932(x)
+    else
+        fun_l5_n482(x)
+    end
+end
+
+def fun_l4_n54(x)
+    if (x < 1)
+        fun_l5_n982(x)
+    else
+        fun_l5_n207(x)
+    end
+end
+
+def fun_l4_n55(x)
+    if (x < 1)
+        fun_l5_n949(x)
+    else
+        fun_l5_n9(x)
+    end
+end
+
+def fun_l4_n56(x)
+    if (x < 1)
+        fun_l5_n672(x)
+    else
+        fun_l5_n924(x)
+    end
+end
+
+def fun_l4_n57(x)
+    if (x < 1)
+        fun_l5_n757(x)
+    else
+        fun_l5_n609(x)
+    end
+end
+
+def fun_l4_n58(x)
+    if (x < 1)
+        fun_l5_n251(x)
+    else
+        fun_l5_n471(x)
+    end
+end
+
+def fun_l4_n59(x)
+    if (x < 1)
+        fun_l5_n878(x)
+    else
+        fun_l5_n626(x)
+    end
+end
+
+def fun_l4_n60(x)
+    if (x < 1)
+        fun_l5_n859(x)
+    else
+        fun_l5_n646(x)
+    end
+end
+
+def fun_l4_n61(x)
+    if (x < 1)
+        fun_l5_n417(x)
+    else
+        fun_l5_n587(x)
+    end
+end
+
+def fun_l4_n62(x)
+    if (x < 1)
+        fun_l5_n164(x)
+    else
+        fun_l5_n861(x)
+    end
+end
+
+def fun_l4_n63(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n79(x)
+    end
+end
+
+def fun_l4_n64(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n336(x)
+    end
+end
+
+def fun_l4_n65(x)
+    if (x < 1)
+        fun_l5_n420(x)
+    else
+        fun_l5_n557(x)
+    end
+end
+
+def fun_l4_n66(x)
+    if (x < 1)
+        fun_l5_n61(x)
+    else
+        fun_l5_n690(x)
+    end
+end
+
+def fun_l4_n67(x)
+    if (x < 1)
+        fun_l5_n939(x)
+    else
+        fun_l5_n139(x)
+    end
+end
+
+def fun_l4_n68(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n625(x)
+    end
+end
+
+def fun_l4_n69(x)
+    if (x < 1)
+        fun_l5_n532(x)
+    else
+        fun_l5_n909(x)
+    end
+end
+
+def fun_l4_n70(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n886(x)
+    end
+end
+
+def fun_l4_n71(x)
+    if (x < 1)
+        fun_l5_n554(x)
+    else
+        fun_l5_n898(x)
+    end
+end
+
+def fun_l4_n72(x)
+    if (x < 1)
+        fun_l5_n390(x)
+    else
+        fun_l5_n690(x)
+    end
+end
+
+def fun_l4_n73(x)
+    if (x < 1)
+        fun_l5_n980(x)
+    else
+        fun_l5_n248(x)
+    end
+end
+
+def fun_l4_n74(x)
+    if (x < 1)
+        fun_l5_n438(x)
+    else
+        fun_l5_n247(x)
+    end
+end
+
+def fun_l4_n75(x)
+    if (x < 1)
+        fun_l5_n798(x)
+    else
+        fun_l5_n399(x)
+    end
+end
+
+def fun_l4_n76(x)
+    if (x < 1)
+        fun_l5_n419(x)
+    else
+        fun_l5_n754(x)
+    end
+end
+
+def fun_l4_n77(x)
+    if (x < 1)
+        fun_l5_n875(x)
+    else
+        fun_l5_n18(x)
+    end
+end
+
+def fun_l4_n78(x)
+    if (x < 1)
+        fun_l5_n695(x)
+    else
+        fun_l5_n336(x)
+    end
+end
+
+def fun_l4_n79(x)
+    if (x < 1)
+        fun_l5_n185(x)
+    else
+        fun_l5_n627(x)
+    end
+end
+
+def fun_l4_n80(x)
+    if (x < 1)
+        fun_l5_n359(x)
+    else
+        fun_l5_n465(x)
+    end
+end
+
+def fun_l4_n81(x)
+    if (x < 1)
+        fun_l5_n284(x)
+    else
+        fun_l5_n232(x)
+    end
+end
+
+def fun_l4_n82(x)
+    if (x < 1)
+        fun_l5_n947(x)
+    else
+        fun_l5_n748(x)
+    end
+end
+
+def fun_l4_n83(x)
+    if (x < 1)
+        fun_l5_n254(x)
+    else
+        fun_l5_n836(x)
+    end
+end
+
+def fun_l4_n84(x)
+    if (x < 1)
+        fun_l5_n181(x)
+    else
+        fun_l5_n789(x)
+    end
+end
+
+def fun_l4_n85(x)
+    if (x < 1)
+        fun_l5_n682(x)
+    else
+        fun_l5_n547(x)
+    end
+end
+
+def fun_l4_n86(x)
+    if (x < 1)
+        fun_l5_n35(x)
+    else
+        fun_l5_n157(x)
+    end
+end
+
+def fun_l4_n87(x)
+    if (x < 1)
+        fun_l5_n981(x)
+    else
+        fun_l5_n724(x)
+    end
+end
+
+def fun_l4_n88(x)
+    if (x < 1)
+        fun_l5_n35(x)
+    else
+        fun_l5_n914(x)
+    end
+end
+
+def fun_l4_n89(x)
+    if (x < 1)
+        fun_l5_n844(x)
+    else
+        fun_l5_n668(x)
+    end
+end
+
+def fun_l4_n90(x)
+    if (x < 1)
+        fun_l5_n615(x)
+    else
+        fun_l5_n415(x)
+    end
+end
+
+def fun_l4_n91(x)
+    if (x < 1)
+        fun_l5_n141(x)
+    else
+        fun_l5_n538(x)
+    end
+end
+
+def fun_l4_n92(x)
+    if (x < 1)
+        fun_l5_n563(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n93(x)
+    if (x < 1)
+        fun_l5_n967(x)
+    else
+        fun_l5_n549(x)
+    end
+end
+
+def fun_l4_n94(x)
+    if (x < 1)
+        fun_l5_n992(x)
+    else
+        fun_l5_n34(x)
+    end
+end
+
+def fun_l4_n95(x)
+    if (x < 1)
+        fun_l5_n187(x)
+    else
+        fun_l5_n980(x)
+    end
+end
+
+def fun_l4_n96(x)
+    if (x < 1)
+        fun_l5_n543(x)
+    else
+        fun_l5_n318(x)
+    end
+end
+
+def fun_l4_n97(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n709(x)
+    end
+end
+
+def fun_l4_n98(x)
+    if (x < 1)
+        fun_l5_n233(x)
+    else
+        fun_l5_n963(x)
+    end
+end
+
+def fun_l4_n99(x)
+    if (x < 1)
+        fun_l5_n944(x)
+    else
+        fun_l5_n688(x)
+    end
+end
+
+def fun_l4_n100(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n805(x)
+    end
+end
+
+def fun_l4_n101(x)
+    if (x < 1)
+        fun_l5_n125(x)
+    else
+        fun_l5_n729(x)
+    end
+end
+
+def fun_l4_n102(x)
+    if (x < 1)
+        fun_l5_n339(x)
+    else
+        fun_l5_n394(x)
+    end
+end
+
+def fun_l4_n103(x)
+    if (x < 1)
+        fun_l5_n149(x)
+    else
+        fun_l5_n839(x)
+    end
+end
+
+def fun_l4_n104(x)
+    if (x < 1)
+        fun_l5_n750(x)
+    else
+        fun_l5_n514(x)
+    end
+end
+
+def fun_l4_n105(x)
+    if (x < 1)
+        fun_l5_n726(x)
+    else
+        fun_l5_n251(x)
+    end
+end
+
+def fun_l4_n106(x)
+    if (x < 1)
+        fun_l5_n810(x)
+    else
+        fun_l5_n46(x)
+    end
+end
+
+def fun_l4_n107(x)
+    if (x < 1)
+        fun_l5_n702(x)
+    else
+        fun_l5_n224(x)
+    end
+end
+
+def fun_l4_n108(x)
+    if (x < 1)
+        fun_l5_n604(x)
+    else
+        fun_l5_n24(x)
+    end
+end
+
+def fun_l4_n109(x)
+    if (x < 1)
+        fun_l5_n511(x)
+    else
+        fun_l5_n529(x)
+    end
+end
+
+def fun_l4_n110(x)
+    if (x < 1)
+        fun_l5_n193(x)
+    else
+        fun_l5_n210(x)
+    end
+end
+
+def fun_l4_n111(x)
+    if (x < 1)
+        fun_l5_n599(x)
+    else
+        fun_l5_n85(x)
+    end
+end
+
+def fun_l4_n112(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n292(x)
+    end
+end
+
+def fun_l4_n113(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n269(x)
+    end
+end
+
+def fun_l4_n114(x)
+    if (x < 1)
+        fun_l5_n739(x)
+    else
+        fun_l5_n439(x)
+    end
+end
+
+def fun_l4_n115(x)
+    if (x < 1)
+        fun_l5_n580(x)
+    else
+        fun_l5_n656(x)
+    end
+end
+
+def fun_l4_n116(x)
+    if (x < 1)
+        fun_l5_n992(x)
+    else
+        fun_l5_n703(x)
+    end
+end
+
+def fun_l4_n117(x)
+    if (x < 1)
+        fun_l5_n549(x)
+    else
+        fun_l5_n300(x)
+    end
+end
+
+def fun_l4_n118(x)
+    if (x < 1)
+        fun_l5_n785(x)
+    else
+        fun_l5_n596(x)
+    end
+end
+
+def fun_l4_n119(x)
+    if (x < 1)
+        fun_l5_n236(x)
+    else
+        fun_l5_n84(x)
+    end
+end
+
+def fun_l4_n120(x)
+    if (x < 1)
+        fun_l5_n78(x)
+    else
+        fun_l5_n610(x)
+    end
+end
+
+def fun_l4_n121(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n557(x)
+    end
+end
+
+def fun_l4_n122(x)
+    if (x < 1)
+        fun_l5_n927(x)
+    else
+        fun_l5_n40(x)
+    end
+end
+
+def fun_l4_n123(x)
+    if (x < 1)
+        fun_l5_n620(x)
+    else
+        fun_l5_n173(x)
+    end
+end
+
+def fun_l4_n124(x)
+    if (x < 1)
+        fun_l5_n558(x)
+    else
+        fun_l5_n330(x)
+    end
+end
+
+def fun_l4_n125(x)
+    if (x < 1)
+        fun_l5_n535(x)
+    else
+        fun_l5_n636(x)
+    end
+end
+
+def fun_l4_n126(x)
+    if (x < 1)
+        fun_l5_n401(x)
+    else
+        fun_l5_n747(x)
+    end
+end
+
+def fun_l4_n127(x)
+    if (x < 1)
+        fun_l5_n172(x)
+    else
+        fun_l5_n124(x)
+    end
+end
+
+def fun_l4_n128(x)
+    if (x < 1)
+        fun_l5_n449(x)
+    else
+        fun_l5_n619(x)
+    end
+end
+
+def fun_l4_n129(x)
+    if (x < 1)
+        fun_l5_n564(x)
+    else
+        fun_l5_n306(x)
+    end
+end
+
+def fun_l4_n130(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n170(x)
+    end
+end
+
+def fun_l4_n131(x)
+    if (x < 1)
+        fun_l5_n383(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n132(x)
+    if (x < 1)
+        fun_l5_n568(x)
+    else
+        fun_l5_n54(x)
+    end
+end
+
+def fun_l4_n133(x)
+    if (x < 1)
+        fun_l5_n780(x)
+    else
+        fun_l5_n184(x)
+    end
+end
+
+def fun_l4_n134(x)
+    if (x < 1)
+        fun_l5_n880(x)
+    else
+        fun_l5_n38(x)
+    end
+end
+
+def fun_l4_n135(x)
+    if (x < 1)
+        fun_l5_n819(x)
+    else
+        fun_l5_n440(x)
+    end
+end
+
+def fun_l4_n136(x)
+    if (x < 1)
+        fun_l5_n301(x)
+    else
+        fun_l5_n676(x)
+    end
+end
+
+def fun_l4_n137(x)
+    if (x < 1)
+        fun_l5_n69(x)
+    else
+        fun_l5_n333(x)
+    end
+end
+
+def fun_l4_n138(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n69(x)
+    end
+end
+
+def fun_l4_n139(x)
+    if (x < 1)
+        fun_l5_n939(x)
+    else
+        fun_l5_n103(x)
+    end
+end
+
+def fun_l4_n140(x)
+    if (x < 1)
+        fun_l5_n517(x)
+    else
+        fun_l5_n24(x)
+    end
+end
+
+def fun_l4_n141(x)
+    if (x < 1)
+        fun_l5_n923(x)
+    else
+        fun_l5_n968(x)
+    end
+end
+
+def fun_l4_n142(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n841(x)
+    end
+end
+
+def fun_l4_n143(x)
+    if (x < 1)
+        fun_l5_n726(x)
+    else
+        fun_l5_n715(x)
+    end
+end
+
+def fun_l4_n144(x)
+    if (x < 1)
+        fun_l5_n434(x)
+    else
+        fun_l5_n771(x)
+    end
+end
+
+def fun_l4_n145(x)
+    if (x < 1)
+        fun_l5_n211(x)
+    else
+        fun_l5_n963(x)
+    end
+end
+
+def fun_l4_n146(x)
+    if (x < 1)
+        fun_l5_n534(x)
+    else
+        fun_l5_n5(x)
+    end
+end
+
+def fun_l4_n147(x)
+    if (x < 1)
+        fun_l5_n409(x)
+    else
+        fun_l5_n298(x)
+    end
+end
+
+def fun_l4_n148(x)
+    if (x < 1)
+        fun_l5_n447(x)
+    else
+        fun_l5_n474(x)
+    end
+end
+
+def fun_l4_n149(x)
+    if (x < 1)
+        fun_l5_n181(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n150(x)
+    if (x < 1)
+        fun_l5_n871(x)
+    else
+        fun_l5_n201(x)
+    end
+end
+
+def fun_l4_n151(x)
+    if (x < 1)
+        fun_l5_n539(x)
+    else
+        fun_l5_n855(x)
+    end
+end
+
+def fun_l4_n152(x)
+    if (x < 1)
+        fun_l5_n387(x)
+    else
+        fun_l5_n730(x)
+    end
+end
+
+def fun_l4_n153(x)
+    if (x < 1)
+        fun_l5_n785(x)
+    else
+        fun_l5_n774(x)
+    end
+end
+
+def fun_l4_n154(x)
+    if (x < 1)
+        fun_l5_n924(x)
+    else
+        fun_l5_n414(x)
+    end
+end
+
+def fun_l4_n155(x)
+    if (x < 1)
+        fun_l5_n110(x)
+    else
+        fun_l5_n669(x)
+    end
+end
+
+def fun_l4_n156(x)
+    if (x < 1)
+        fun_l5_n551(x)
+    else
+        fun_l5_n456(x)
+    end
+end
+
+def fun_l4_n157(x)
+    if (x < 1)
+        fun_l5_n872(x)
+    else
+        fun_l5_n397(x)
+    end
+end
+
+def fun_l4_n158(x)
+    if (x < 1)
+        fun_l5_n208(x)
+    else
+        fun_l5_n464(x)
+    end
+end
+
+def fun_l4_n159(x)
+    if (x < 1)
+        fun_l5_n236(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n160(x)
+    if (x < 1)
+        fun_l5_n820(x)
+    else
+        fun_l5_n146(x)
+    end
+end
+
+def fun_l4_n161(x)
+    if (x < 1)
+        fun_l5_n154(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n162(x)
+    if (x < 1)
+        fun_l5_n456(x)
+    else
+        fun_l5_n309(x)
+    end
+end
+
+def fun_l4_n163(x)
+    if (x < 1)
+        fun_l5_n201(x)
+    else
+        fun_l5_n728(x)
+    end
+end
+
+def fun_l4_n164(x)
+    if (x < 1)
+        fun_l5_n806(x)
+    else
+        fun_l5_n156(x)
+    end
+end
+
+def fun_l4_n165(x)
+    if (x < 1)
+        fun_l5_n984(x)
+    else
+        fun_l5_n996(x)
+    end
+end
+
+def fun_l4_n166(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n167(x)
+    if (x < 1)
+        fun_l5_n513(x)
+    else
+        fun_l5_n145(x)
+    end
+end
+
+def fun_l4_n168(x)
+    if (x < 1)
+        fun_l5_n694(x)
+    else
+        fun_l5_n841(x)
+    end
+end
+
+def fun_l4_n169(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n193(x)
+    end
+end
+
+def fun_l4_n170(x)
+    if (x < 1)
+        fun_l5_n638(x)
+    else
+        fun_l5_n252(x)
+    end
+end
+
+def fun_l4_n171(x)
+    if (x < 1)
+        fun_l5_n166(x)
+    else
+        fun_l5_n134(x)
+    end
+end
+
+def fun_l4_n172(x)
+    if (x < 1)
+        fun_l5_n172(x)
+    else
+        fun_l5_n179(x)
+    end
+end
+
+def fun_l4_n173(x)
+    if (x < 1)
+        fun_l5_n218(x)
+    else
+        fun_l5_n124(x)
+    end
+end
+
+def fun_l4_n174(x)
+    if (x < 1)
+        fun_l5_n370(x)
+    else
+        fun_l5_n742(x)
+    end
+end
+
+def fun_l4_n175(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n542(x)
+    end
+end
+
+def fun_l4_n176(x)
+    if (x < 1)
+        fun_l5_n438(x)
+    else
+        fun_l5_n606(x)
+    end
+end
+
+def fun_l4_n177(x)
+    if (x < 1)
+        fun_l5_n316(x)
+    else
+        fun_l5_n92(x)
+    end
+end
+
+def fun_l4_n178(x)
+    if (x < 1)
+        fun_l5_n222(x)
+    else
+        fun_l5_n461(x)
+    end
+end
+
+def fun_l4_n179(x)
+    if (x < 1)
+        fun_l5_n244(x)
+    else
+        fun_l5_n536(x)
+    end
+end
+
+def fun_l4_n180(x)
+    if (x < 1)
+        fun_l5_n120(x)
+    else
+        fun_l5_n905(x)
+    end
+end
+
+def fun_l4_n181(x)
+    if (x < 1)
+        fun_l5_n601(x)
+    else
+        fun_l5_n62(x)
+    end
+end
+
+def fun_l4_n182(x)
+    if (x < 1)
+        fun_l5_n701(x)
+    else
+        fun_l5_n25(x)
+    end
+end
+
+def fun_l4_n183(x)
+    if (x < 1)
+        fun_l5_n361(x)
+    else
+        fun_l5_n433(x)
+    end
+end
+
+def fun_l4_n184(x)
+    if (x < 1)
+        fun_l5_n29(x)
+    else
+        fun_l5_n302(x)
+    end
+end
+
+def fun_l4_n185(x)
+    if (x < 1)
+        fun_l5_n697(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n186(x)
+    if (x < 1)
+        fun_l5_n76(x)
+    else
+        fun_l5_n402(x)
+    end
+end
+
+def fun_l4_n187(x)
+    if (x < 1)
+        fun_l5_n38(x)
+    else
+        fun_l5_n818(x)
+    end
+end
+
+def fun_l4_n188(x)
+    if (x < 1)
+        fun_l5_n730(x)
+    else
+        fun_l5_n456(x)
+    end
+end
+
+def fun_l4_n189(x)
+    if (x < 1)
+        fun_l5_n828(x)
+    else
+        fun_l5_n796(x)
+    end
+end
+
+def fun_l4_n190(x)
+    if (x < 1)
+        fun_l5_n86(x)
+    else
+        fun_l5_n976(x)
+    end
+end
+
+def fun_l4_n191(x)
+    if (x < 1)
+        fun_l5_n267(x)
+    else
+        fun_l5_n497(x)
+    end
+end
+
+def fun_l4_n192(x)
+    if (x < 1)
+        fun_l5_n534(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n193(x)
+    if (x < 1)
+        fun_l5_n97(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n194(x)
+    if (x < 1)
+        fun_l5_n821(x)
+    else
+        fun_l5_n823(x)
+    end
+end
+
+def fun_l4_n195(x)
+    if (x < 1)
+        fun_l5_n936(x)
+    else
+        fun_l5_n490(x)
+    end
+end
+
+def fun_l4_n196(x)
+    if (x < 1)
+        fun_l5_n579(x)
+    else
+        fun_l5_n684(x)
+    end
+end
+
+def fun_l4_n197(x)
+    if (x < 1)
+        fun_l5_n742(x)
+    else
+        fun_l5_n874(x)
+    end
+end
+
+def fun_l4_n198(x)
+    if (x < 1)
+        fun_l5_n904(x)
+    else
+        fun_l5_n394(x)
+    end
+end
+
+def fun_l4_n199(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n200(x)
+    if (x < 1)
+        fun_l5_n332(x)
+    else
+        fun_l5_n803(x)
+    end
+end
+
+def fun_l4_n201(x)
+    if (x < 1)
+        fun_l5_n635(x)
+    else
+        fun_l5_n294(x)
+    end
+end
+
+def fun_l4_n202(x)
+    if (x < 1)
+        fun_l5_n397(x)
+    else
+        fun_l5_n924(x)
+    end
+end
+
+def fun_l4_n203(x)
+    if (x < 1)
+        fun_l5_n199(x)
+    else
+        fun_l5_n751(x)
+    end
+end
+
+def fun_l4_n204(x)
+    if (x < 1)
+        fun_l5_n570(x)
+    else
+        fun_l5_n70(x)
+    end
+end
+
+def fun_l4_n205(x)
+    if (x < 1)
+        fun_l5_n344(x)
+    else
+        fun_l5_n713(x)
+    end
+end
+
+def fun_l4_n206(x)
+    if (x < 1)
+        fun_l5_n568(x)
+    else
+        fun_l5_n40(x)
+    end
+end
+
+def fun_l4_n207(x)
+    if (x < 1)
+        fun_l5_n460(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n208(x)
+    if (x < 1)
+        fun_l5_n995(x)
+    else
+        fun_l5_n147(x)
+    end
+end
+
+def fun_l4_n209(x)
+    if (x < 1)
+        fun_l5_n295(x)
+    else
+        fun_l5_n752(x)
+    end
+end
+
+def fun_l4_n210(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n555(x)
+    end
+end
+
+def fun_l4_n211(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n418(x)
+    end
+end
+
+def fun_l4_n212(x)
+    if (x < 1)
+        fun_l5_n761(x)
+    else
+        fun_l5_n66(x)
+    end
+end
+
+def fun_l4_n213(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n521(x)
+    end
+end
+
+def fun_l4_n214(x)
+    if (x < 1)
+        fun_l5_n97(x)
+    else
+        fun_l5_n431(x)
+    end
+end
+
+def fun_l4_n215(x)
+    if (x < 1)
+        fun_l5_n450(x)
+    else
+        fun_l5_n58(x)
+    end
+end
+
+def fun_l4_n216(x)
+    if (x < 1)
+        fun_l5_n576(x)
+    else
+        fun_l5_n675(x)
+    end
+end
+
+def fun_l4_n217(x)
+    if (x < 1)
+        fun_l5_n764(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n218(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n398(x)
+    end
+end
+
+def fun_l4_n219(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n411(x)
+    end
+end
+
+def fun_l4_n220(x)
+    if (x < 1)
+        fun_l5_n13(x)
+    else
+        fun_l5_n117(x)
+    end
+end
+
+def fun_l4_n221(x)
+    if (x < 1)
+        fun_l5_n872(x)
+    else
+        fun_l5_n799(x)
+    end
+end
+
+def fun_l4_n222(x)
+    if (x < 1)
+        fun_l5_n692(x)
+    else
+        fun_l5_n99(x)
+    end
+end
+
+def fun_l4_n223(x)
+    if (x < 1)
+        fun_l5_n861(x)
+    else
+        fun_l5_n999(x)
+    end
+end
+
+def fun_l4_n224(x)
+    if (x < 1)
+        fun_l5_n547(x)
+    else
+        fun_l5_n955(x)
+    end
+end
+
+def fun_l4_n225(x)
+    if (x < 1)
+        fun_l5_n305(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n226(x)
+    if (x < 1)
+        fun_l5_n128(x)
+    else
+        fun_l5_n662(x)
+    end
+end
+
+def fun_l4_n227(x)
+    if (x < 1)
+        fun_l5_n858(x)
+    else
+        fun_l5_n323(x)
+    end
+end
+
+def fun_l4_n228(x)
+    if (x < 1)
+        fun_l5_n923(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n229(x)
+    if (x < 1)
+        fun_l5_n486(x)
+    else
+        fun_l5_n603(x)
+    end
+end
+
+def fun_l4_n230(x)
+    if (x < 1)
+        fun_l5_n116(x)
+    else
+        fun_l5_n887(x)
+    end
+end
+
+def fun_l4_n231(x)
+    if (x < 1)
+        fun_l5_n791(x)
+    else
+        fun_l5_n762(x)
+    end
+end
+
+def fun_l4_n232(x)
+    if (x < 1)
+        fun_l5_n511(x)
+    else
+        fun_l5_n890(x)
+    end
+end
+
+def fun_l4_n233(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n777(x)
+    end
+end
+
+def fun_l4_n234(x)
+    if (x < 1)
+        fun_l5_n458(x)
+    else
+        fun_l5_n379(x)
+    end
+end
+
+def fun_l4_n235(x)
+    if (x < 1)
+        fun_l5_n907(x)
+    else
+        fun_l5_n463(x)
+    end
+end
+
+def fun_l4_n236(x)
+    if (x < 1)
+        fun_l5_n177(x)
+    else
+        fun_l5_n732(x)
+    end
+end
+
+def fun_l4_n237(x)
+    if (x < 1)
+        fun_l5_n761(x)
+    else
+        fun_l5_n936(x)
+    end
+end
+
+def fun_l4_n238(x)
+    if (x < 1)
+        fun_l5_n757(x)
+    else
+        fun_l5_n733(x)
+    end
+end
+
+def fun_l4_n239(x)
+    if (x < 1)
+        fun_l5_n844(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n240(x)
+    if (x < 1)
+        fun_l5_n594(x)
+    else
+        fun_l5_n620(x)
+    end
+end
+
+def fun_l4_n241(x)
+    if (x < 1)
+        fun_l5_n722(x)
+    else
+        fun_l5_n779(x)
+    end
+end
+
+def fun_l4_n242(x)
+    if (x < 1)
+        fun_l5_n663(x)
+    else
+        fun_l5_n237(x)
+    end
+end
+
+def fun_l4_n243(x)
+    if (x < 1)
+        fun_l5_n256(x)
+    else
+        fun_l5_n366(x)
+    end
+end
+
+def fun_l4_n244(x)
+    if (x < 1)
+        fun_l5_n614(x)
+    else
+        fun_l5_n895(x)
+    end
+end
+
+def fun_l4_n245(x)
+    if (x < 1)
+        fun_l5_n459(x)
+    else
+        fun_l5_n193(x)
+    end
+end
+
+def fun_l4_n246(x)
+    if (x < 1)
+        fun_l5_n780(x)
+    else
+        fun_l5_n175(x)
+    end
+end
+
+def fun_l4_n247(x)
+    if (x < 1)
+        fun_l5_n186(x)
+    else
+        fun_l5_n488(x)
+    end
+end
+
+def fun_l4_n248(x)
+    if (x < 1)
+        fun_l5_n156(x)
+    else
+        fun_l5_n807(x)
+    end
+end
+
+def fun_l4_n249(x)
+    if (x < 1)
+        fun_l5_n862(x)
+    else
+        fun_l5_n537(x)
+    end
+end
+
+def fun_l4_n250(x)
+    if (x < 1)
+        fun_l5_n880(x)
+    else
+        fun_l5_n528(x)
+    end
+end
+
+def fun_l4_n251(x)
+    if (x < 1)
+        fun_l5_n163(x)
+    else
+        fun_l5_n94(x)
+    end
+end
+
+def fun_l4_n252(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n582(x)
+    end
+end
+
+def fun_l4_n253(x)
+    if (x < 1)
+        fun_l5_n368(x)
+    else
+        fun_l5_n584(x)
+    end
+end
+
+def fun_l4_n254(x)
+    if (x < 1)
+        fun_l5_n566(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n255(x)
+    if (x < 1)
+        fun_l5_n876(x)
+    else
+        fun_l5_n0(x)
+    end
+end
+
+def fun_l4_n256(x)
+    if (x < 1)
+        fun_l5_n842(x)
+    else
+        fun_l5_n469(x)
+    end
+end
+
+def fun_l4_n257(x)
+    if (x < 1)
+        fun_l5_n85(x)
+    else
+        fun_l5_n961(x)
+    end
+end
+
+def fun_l4_n258(x)
+    if (x < 1)
+        fun_l5_n120(x)
+    else
+        fun_l5_n893(x)
+    end
+end
+
+def fun_l4_n259(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n630(x)
+    end
+end
+
+def fun_l4_n260(x)
+    if (x < 1)
+        fun_l5_n710(x)
+    else
+        fun_l5_n715(x)
+    end
+end
+
+def fun_l4_n261(x)
+    if (x < 1)
+        fun_l5_n423(x)
+    else
+        fun_l5_n910(x)
+    end
+end
+
+def fun_l4_n262(x)
+    if (x < 1)
+        fun_l5_n505(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n263(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n236(x)
+    end
+end
+
+def fun_l4_n264(x)
+    if (x < 1)
+        fun_l5_n140(x)
+    else
+        fun_l5_n295(x)
+    end
+end
+
+def fun_l4_n265(x)
+    if (x < 1)
+        fun_l5_n554(x)
+    else
+        fun_l5_n88(x)
+    end
+end
+
+def fun_l4_n266(x)
+    if (x < 1)
+        fun_l5_n831(x)
+    else
+        fun_l5_n307(x)
+    end
+end
+
+def fun_l4_n267(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n960(x)
+    end
+end
+
+def fun_l4_n268(x)
+    if (x < 1)
+        fun_l5_n322(x)
+    else
+        fun_l5_n264(x)
+    end
+end
+
+def fun_l4_n269(x)
+    if (x < 1)
+        fun_l5_n823(x)
+    else
+        fun_l5_n374(x)
+    end
+end
+
+def fun_l4_n270(x)
+    if (x < 1)
+        fun_l5_n76(x)
+    else
+        fun_l5_n918(x)
+    end
+end
+
+def fun_l4_n271(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n45(x)
+    end
+end
+
+def fun_l4_n272(x)
+    if (x < 1)
+        fun_l5_n686(x)
+    else
+        fun_l5_n836(x)
+    end
+end
+
+def fun_l4_n273(x)
+    if (x < 1)
+        fun_l5_n13(x)
+    else
+        fun_l5_n676(x)
+    end
+end
+
+def fun_l4_n274(x)
+    if (x < 1)
+        fun_l5_n120(x)
+    else
+        fun_l5_n180(x)
+    end
+end
+
+def fun_l4_n275(x)
+    if (x < 1)
+        fun_l5_n901(x)
+    else
+        fun_l5_n101(x)
+    end
+end
+
+def fun_l4_n276(x)
+    if (x < 1)
+        fun_l5_n289(x)
+    else
+        fun_l5_n238(x)
+    end
+end
+
+def fun_l4_n277(x)
+    if (x < 1)
+        fun_l5_n513(x)
+    else
+        fun_l5_n887(x)
+    end
+end
+
+def fun_l4_n278(x)
+    if (x < 1)
+        fun_l5_n799(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n279(x)
+    if (x < 1)
+        fun_l5_n628(x)
+    else
+        fun_l5_n373(x)
+    end
+end
+
+def fun_l4_n280(x)
+    if (x < 1)
+        fun_l5_n661(x)
+    else
+        fun_l5_n826(x)
+    end
+end
+
+def fun_l4_n281(x)
+    if (x < 1)
+        fun_l5_n35(x)
+    else
+        fun_l5_n409(x)
+    end
+end
+
+def fun_l4_n282(x)
+    if (x < 1)
+        fun_l5_n721(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n283(x)
+    if (x < 1)
+        fun_l5_n729(x)
+    else
+        fun_l5_n901(x)
+    end
+end
+
+def fun_l4_n284(x)
+    if (x < 1)
+        fun_l5_n17(x)
+    else
+        fun_l5_n482(x)
+    end
+end
+
+def fun_l4_n285(x)
+    if (x < 1)
+        fun_l5_n166(x)
+    else
+        fun_l5_n53(x)
+    end
+end
+
+def fun_l4_n286(x)
+    if (x < 1)
+        fun_l5_n873(x)
+    else
+        fun_l5_n383(x)
+    end
+end
+
+def fun_l4_n287(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n49(x)
+    end
+end
+
+def fun_l4_n288(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n353(x)
+    end
+end
+
+def fun_l4_n289(x)
+    if (x < 1)
+        fun_l5_n651(x)
+    else
+        fun_l5_n606(x)
+    end
+end
+
+def fun_l4_n290(x)
+    if (x < 1)
+        fun_l5_n287(x)
+    else
+        fun_l5_n444(x)
+    end
+end
+
+def fun_l4_n291(x)
+    if (x < 1)
+        fun_l5_n181(x)
+    else
+        fun_l5_n195(x)
+    end
+end
+
+def fun_l4_n292(x)
+    if (x < 1)
+        fun_l5_n20(x)
+    else
+        fun_l5_n58(x)
+    end
+end
+
+def fun_l4_n293(x)
+    if (x < 1)
+        fun_l5_n185(x)
+    else
+        fun_l5_n759(x)
+    end
+end
+
+def fun_l4_n294(x)
+    if (x < 1)
+        fun_l5_n938(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n295(x)
+    if (x < 1)
+        fun_l5_n187(x)
+    else
+        fun_l5_n469(x)
+    end
+end
+
+def fun_l4_n296(x)
+    if (x < 1)
+        fun_l5_n516(x)
+    else
+        fun_l5_n314(x)
+    end
+end
+
+def fun_l4_n297(x)
+    if (x < 1)
+        fun_l5_n585(x)
+    else
+        fun_l5_n344(x)
+    end
+end
+
+def fun_l4_n298(x)
+    if (x < 1)
+        fun_l5_n637(x)
+    else
+        fun_l5_n103(x)
+    end
+end
+
+def fun_l4_n299(x)
+    if (x < 1)
+        fun_l5_n185(x)
+    else
+        fun_l5_n593(x)
+    end
+end
+
+def fun_l4_n300(x)
+    if (x < 1)
+        fun_l5_n773(x)
+    else
+        fun_l5_n758(x)
+    end
+end
+
+def fun_l4_n301(x)
+    if (x < 1)
+        fun_l5_n444(x)
+    else
+        fun_l5_n945(x)
+    end
+end
+
+def fun_l4_n302(x)
+    if (x < 1)
+        fun_l5_n728(x)
+    else
+        fun_l5_n484(x)
+    end
+end
+
+def fun_l4_n303(x)
+    if (x < 1)
+        fun_l5_n412(x)
+    else
+        fun_l5_n106(x)
+    end
+end
+
+def fun_l4_n304(x)
+    if (x < 1)
+        fun_l5_n399(x)
+    else
+        fun_l5_n234(x)
+    end
+end
+
+def fun_l4_n305(x)
+    if (x < 1)
+        fun_l5_n886(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n306(x)
+    if (x < 1)
+        fun_l5_n535(x)
+    else
+        fun_l5_n338(x)
+    end
+end
+
+def fun_l4_n307(x)
+    if (x < 1)
+        fun_l5_n898(x)
+    else
+        fun_l5_n859(x)
+    end
+end
+
+def fun_l4_n308(x)
+    if (x < 1)
+        fun_l5_n25(x)
+    else
+        fun_l5_n476(x)
+    end
+end
+
+def fun_l4_n309(x)
+    if (x < 1)
+        fun_l5_n451(x)
+    else
+        fun_l5_n665(x)
+    end
+end
+
+def fun_l4_n310(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n555(x)
+    end
+end
+
+def fun_l4_n311(x)
+    if (x < 1)
+        fun_l5_n982(x)
+    else
+        fun_l5_n89(x)
+    end
+end
+
+def fun_l4_n312(x)
+    if (x < 1)
+        fun_l5_n32(x)
+    else
+        fun_l5_n908(x)
+    end
+end
+
+def fun_l4_n313(x)
+    if (x < 1)
+        fun_l5_n963(x)
+    else
+        fun_l5_n267(x)
+    end
+end
+
+def fun_l4_n314(x)
+    if (x < 1)
+        fun_l5_n3(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n315(x)
+    if (x < 1)
+        fun_l5_n763(x)
+    else
+        fun_l5_n488(x)
+    end
+end
+
+def fun_l4_n316(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n663(x)
+    end
+end
+
+def fun_l4_n317(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n487(x)
+    end
+end
+
+def fun_l4_n318(x)
+    if (x < 1)
+        fun_l5_n327(x)
+    else
+        fun_l5_n433(x)
+    end
+end
+
+def fun_l4_n319(x)
+    if (x < 1)
+        fun_l5_n242(x)
+    else
+        fun_l5_n471(x)
+    end
+end
+
+def fun_l4_n320(x)
+    if (x < 1)
+        fun_l5_n786(x)
+    else
+        fun_l5_n622(x)
+    end
+end
+
+def fun_l4_n321(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n934(x)
+    end
+end
+
+def fun_l4_n322(x)
+    if (x < 1)
+        fun_l5_n665(x)
+    else
+        fun_l5_n386(x)
+    end
+end
+
+def fun_l4_n323(x)
+    if (x < 1)
+        fun_l5_n96(x)
+    else
+        fun_l5_n466(x)
+    end
+end
+
+def fun_l4_n324(x)
+    if (x < 1)
+        fun_l5_n394(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n325(x)
+    if (x < 1)
+        fun_l5_n544(x)
+    else
+        fun_l5_n688(x)
+    end
+end
+
+def fun_l4_n326(x)
+    if (x < 1)
+        fun_l5_n295(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n327(x)
+    if (x < 1)
+        fun_l5_n128(x)
+    else
+        fun_l5_n607(x)
+    end
+end
+
+def fun_l4_n328(x)
+    if (x < 1)
+        fun_l5_n987(x)
+    else
+        fun_l5_n109(x)
+    end
+end
+
+def fun_l4_n329(x)
+    if (x < 1)
+        fun_l5_n842(x)
+    else
+        fun_l5_n217(x)
+    end
+end
+
+def fun_l4_n330(x)
+    if (x < 1)
+        fun_l5_n92(x)
+    else
+        fun_l5_n774(x)
+    end
+end
+
+def fun_l4_n331(x)
+    if (x < 1)
+        fun_l5_n761(x)
+    else
+        fun_l5_n34(x)
+    end
+end
+
+def fun_l4_n332(x)
+    if (x < 1)
+        fun_l5_n867(x)
+    else
+        fun_l5_n645(x)
+    end
+end
+
+def fun_l4_n333(x)
+    if (x < 1)
+        fun_l5_n273(x)
+    else
+        fun_l5_n592(x)
+    end
+end
+
+def fun_l4_n334(x)
+    if (x < 1)
+        fun_l5_n29(x)
+    else
+        fun_l5_n985(x)
+    end
+end
+
+def fun_l4_n335(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n346(x)
+    end
+end
+
+def fun_l4_n336(x)
+    if (x < 1)
+        fun_l5_n367(x)
+    else
+        fun_l5_n686(x)
+    end
+end
+
+def fun_l4_n337(x)
+    if (x < 1)
+        fun_l5_n868(x)
+    else
+        fun_l5_n5(x)
+    end
+end
+
+def fun_l4_n338(x)
+    if (x < 1)
+        fun_l5_n998(x)
+    else
+        fun_l5_n64(x)
+    end
+end
+
+def fun_l4_n339(x)
+    if (x < 1)
+        fun_l5_n594(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n340(x)
+    if (x < 1)
+        fun_l5_n547(x)
+    else
+        fun_l5_n573(x)
+    end
+end
+
+def fun_l4_n341(x)
+    if (x < 1)
+        fun_l5_n590(x)
+    else
+        fun_l5_n923(x)
+    end
+end
+
+def fun_l4_n342(x)
+    if (x < 1)
+        fun_l5_n538(x)
+    else
+        fun_l5_n118(x)
+    end
+end
+
+def fun_l4_n343(x)
+    if (x < 1)
+        fun_l5_n322(x)
+    else
+        fun_l5_n970(x)
+    end
+end
+
+def fun_l4_n344(x)
+    if (x < 1)
+        fun_l5_n809(x)
+    else
+        fun_l5_n958(x)
+    end
+end
+
+def fun_l4_n345(x)
+    if (x < 1)
+        fun_l5_n613(x)
+    else
+        fun_l5_n199(x)
+    end
+end
+
+def fun_l4_n346(x)
+    if (x < 1)
+        fun_l5_n298(x)
+    else
+        fun_l5_n273(x)
+    end
+end
+
+def fun_l4_n347(x)
+    if (x < 1)
+        fun_l5_n560(x)
+    else
+        fun_l5_n803(x)
+    end
+end
+
+def fun_l4_n348(x)
+    if (x < 1)
+        fun_l5_n672(x)
+    else
+        fun_l5_n952(x)
+    end
+end
+
+def fun_l4_n349(x)
+    if (x < 1)
+        fun_l5_n58(x)
+    else
+        fun_l5_n267(x)
+    end
+end
+
+def fun_l4_n350(x)
+    if (x < 1)
+        fun_l5_n933(x)
+    else
+        fun_l5_n773(x)
+    end
+end
+
+def fun_l4_n351(x)
+    if (x < 1)
+        fun_l5_n574(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n352(x)
+    if (x < 1)
+        fun_l5_n537(x)
+    else
+        fun_l5_n312(x)
+    end
+end
+
+def fun_l4_n353(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n739(x)
+    end
+end
+
+def fun_l4_n354(x)
+    if (x < 1)
+        fun_l5_n871(x)
+    else
+        fun_l5_n86(x)
+    end
+end
+
+def fun_l4_n355(x)
+    if (x < 1)
+        fun_l5_n3(x)
+    else
+        fun_l5_n950(x)
+    end
+end
+
+def fun_l4_n356(x)
+    if (x < 1)
+        fun_l5_n560(x)
+    else
+        fun_l5_n45(x)
+    end
+end
+
+def fun_l4_n357(x)
+    if (x < 1)
+        fun_l5_n666(x)
+    else
+        fun_l5_n874(x)
+    end
+end
+
+def fun_l4_n358(x)
+    if (x < 1)
+        fun_l5_n457(x)
+    else
+        fun_l5_n7(x)
+    end
+end
+
+def fun_l4_n359(x)
+    if (x < 1)
+        fun_l5_n674(x)
+    else
+        fun_l5_n985(x)
+    end
+end
+
+def fun_l4_n360(x)
+    if (x < 1)
+        fun_l5_n960(x)
+    else
+        fun_l5_n228(x)
+    end
+end
+
+def fun_l4_n361(x)
+    if (x < 1)
+        fun_l5_n597(x)
+    else
+        fun_l5_n487(x)
+    end
+end
+
+def fun_l4_n362(x)
+    if (x < 1)
+        fun_l5_n145(x)
+    else
+        fun_l5_n278(x)
+    end
+end
+
+def fun_l4_n363(x)
+    if (x < 1)
+        fun_l5_n949(x)
+    else
+        fun_l5_n353(x)
+    end
+end
+
+def fun_l4_n364(x)
+    if (x < 1)
+        fun_l5_n604(x)
+    else
+        fun_l5_n250(x)
+    end
+end
+
+def fun_l4_n365(x)
+    if (x < 1)
+        fun_l5_n347(x)
+    else
+        fun_l5_n964(x)
+    end
+end
+
+def fun_l4_n366(x)
+    if (x < 1)
+        fun_l5_n331(x)
+    else
+        fun_l5_n657(x)
+    end
+end
+
+def fun_l4_n367(x)
+    if (x < 1)
+        fun_l5_n74(x)
+    else
+        fun_l5_n504(x)
+    end
+end
+
+def fun_l4_n368(x)
+    if (x < 1)
+        fun_l5_n9(x)
+    else
+        fun_l5_n993(x)
+    end
+end
+
+def fun_l4_n369(x)
+    if (x < 1)
+        fun_l5_n492(x)
+    else
+        fun_l5_n155(x)
+    end
+end
+
+def fun_l4_n370(x)
+    if (x < 1)
+        fun_l5_n848(x)
+    else
+        fun_l5_n178(x)
+    end
+end
+
+def fun_l4_n371(x)
+    if (x < 1)
+        fun_l5_n395(x)
+    else
+        fun_l5_n837(x)
+    end
+end
+
+def fun_l4_n372(x)
+    if (x < 1)
+        fun_l5_n834(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n373(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n374(x)
+    if (x < 1)
+        fun_l5_n293(x)
+    else
+        fun_l5_n385(x)
+    end
+end
+
+def fun_l4_n375(x)
+    if (x < 1)
+        fun_l5_n487(x)
+    else
+        fun_l5_n61(x)
+    end
+end
+
+def fun_l4_n376(x)
+    if (x < 1)
+        fun_l5_n493(x)
+    else
+        fun_l5_n629(x)
+    end
+end
+
+def fun_l4_n377(x)
+    if (x < 1)
+        fun_l5_n429(x)
+    else
+        fun_l5_n157(x)
+    end
+end
+
+def fun_l4_n378(x)
+    if (x < 1)
+        fun_l5_n145(x)
+    else
+        fun_l5_n988(x)
+    end
+end
+
+def fun_l4_n379(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n246(x)
+    end
+end
+
+def fun_l4_n380(x)
+    if (x < 1)
+        fun_l5_n320(x)
+    else
+        fun_l5_n284(x)
+    end
+end
+
+def fun_l4_n381(x)
+    if (x < 1)
+        fun_l5_n278(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n382(x)
+    if (x < 1)
+        fun_l5_n999(x)
+    else
+        fun_l5_n907(x)
+    end
+end
+
+def fun_l4_n383(x)
+    if (x < 1)
+        fun_l5_n979(x)
+    else
+        fun_l5_n370(x)
+    end
+end
+
+def fun_l4_n384(x)
+    if (x < 1)
+        fun_l5_n58(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n385(x)
+    if (x < 1)
+        fun_l5_n558(x)
+    else
+        fun_l5_n524(x)
+    end
+end
+
+def fun_l4_n386(x)
+    if (x < 1)
+        fun_l5_n438(x)
+    else
+        fun_l5_n799(x)
+    end
+end
+
+def fun_l4_n387(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n463(x)
+    end
+end
+
+def fun_l4_n388(x)
+    if (x < 1)
+        fun_l5_n376(x)
+    else
+        fun_l5_n943(x)
+    end
+end
+
+def fun_l4_n389(x)
+    if (x < 1)
+        fun_l5_n21(x)
+    else
+        fun_l5_n663(x)
+    end
+end
+
+def fun_l4_n390(x)
+    if (x < 1)
+        fun_l5_n8(x)
+    else
+        fun_l5_n348(x)
+    end
+end
+
+def fun_l4_n391(x)
+    if (x < 1)
+        fun_l5_n908(x)
+    else
+        fun_l5_n695(x)
+    end
+end
+
+def fun_l4_n392(x)
+    if (x < 1)
+        fun_l5_n97(x)
+    else
+        fun_l5_n466(x)
+    end
+end
+
+def fun_l4_n393(x)
+    if (x < 1)
+        fun_l5_n480(x)
+    else
+        fun_l5_n972(x)
+    end
+end
+
+def fun_l4_n394(x)
+    if (x < 1)
+        fun_l5_n85(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n395(x)
+    if (x < 1)
+        fun_l5_n897(x)
+    else
+        fun_l5_n13(x)
+    end
+end
+
+def fun_l4_n396(x)
+    if (x < 1)
+        fun_l5_n628(x)
+    else
+        fun_l5_n743(x)
+    end
+end
+
+def fun_l4_n397(x)
+    if (x < 1)
+        fun_l5_n29(x)
+    else
+        fun_l5_n185(x)
+    end
+end
+
+def fun_l4_n398(x)
+    if (x < 1)
+        fun_l5_n464(x)
+    else
+        fun_l5_n742(x)
+    end
+end
+
+def fun_l4_n399(x)
+    if (x < 1)
+        fun_l5_n348(x)
+    else
+        fun_l5_n70(x)
+    end
+end
+
+def fun_l4_n400(x)
+    if (x < 1)
+        fun_l5_n397(x)
+    else
+        fun_l5_n132(x)
+    end
+end
+
+def fun_l4_n401(x)
+    if (x < 1)
+        fun_l5_n433(x)
+    else
+        fun_l5_n77(x)
+    end
+end
+
+def fun_l4_n402(x)
+    if (x < 1)
+        fun_l5_n24(x)
+    else
+        fun_l5_n160(x)
+    end
+end
+
+def fun_l4_n403(x)
+    if (x < 1)
+        fun_l5_n738(x)
+    else
+        fun_l5_n174(x)
+    end
+end
+
+def fun_l4_n404(x)
+    if (x < 1)
+        fun_l5_n585(x)
+    else
+        fun_l5_n670(x)
+    end
+end
+
+def fun_l4_n405(x)
+    if (x < 1)
+        fun_l5_n320(x)
+    else
+        fun_l5_n245(x)
+    end
+end
+
+def fun_l4_n406(x)
+    if (x < 1)
+        fun_l5_n357(x)
+    else
+        fun_l5_n742(x)
+    end
+end
+
+def fun_l4_n407(x)
+    if (x < 1)
+        fun_l5_n16(x)
+    else
+        fun_l5_n227(x)
+    end
+end
+
+def fun_l4_n408(x)
+    if (x < 1)
+        fun_l5_n360(x)
+    else
+        fun_l5_n18(x)
+    end
+end
+
+def fun_l4_n409(x)
+    if (x < 1)
+        fun_l5_n210(x)
+    else
+        fun_l5_n253(x)
+    end
+end
+
+def fun_l4_n410(x)
+    if (x < 1)
+        fun_l5_n915(x)
+    else
+        fun_l5_n605(x)
+    end
+end
+
+def fun_l4_n411(x)
+    if (x < 1)
+        fun_l5_n511(x)
+    else
+        fun_l5_n118(x)
+    end
+end
+
+def fun_l4_n412(x)
+    if (x < 1)
+        fun_l5_n680(x)
+    else
+        fun_l5_n445(x)
+    end
+end
+
+def fun_l4_n413(x)
+    if (x < 1)
+        fun_l5_n722(x)
+    else
+        fun_l5_n440(x)
+    end
+end
+
+def fun_l4_n414(x)
+    if (x < 1)
+        fun_l5_n382(x)
+    else
+        fun_l5_n380(x)
+    end
+end
+
+def fun_l4_n415(x)
+    if (x < 1)
+        fun_l5_n548(x)
+    else
+        fun_l5_n462(x)
+    end
+end
+
+def fun_l4_n416(x)
+    if (x < 1)
+        fun_l5_n12(x)
+    else
+        fun_l5_n952(x)
+    end
+end
+
+def fun_l4_n417(x)
+    if (x < 1)
+        fun_l5_n814(x)
+    else
+        fun_l5_n720(x)
+    end
+end
+
+def fun_l4_n418(x)
+    if (x < 1)
+        fun_l5_n804(x)
+    else
+        fun_l5_n243(x)
+    end
+end
+
+def fun_l4_n419(x)
+    if (x < 1)
+        fun_l5_n654(x)
+    else
+        fun_l5_n950(x)
+    end
+end
+
+def fun_l4_n420(x)
+    if (x < 1)
+        fun_l5_n998(x)
+    else
+        fun_l5_n937(x)
+    end
+end
+
+def fun_l4_n421(x)
+    if (x < 1)
+        fun_l5_n476(x)
+    else
+        fun_l5_n245(x)
+    end
+end
+
+def fun_l4_n422(x)
+    if (x < 1)
+        fun_l5_n778(x)
+    else
+        fun_l5_n950(x)
+    end
+end
+
+def fun_l4_n423(x)
+    if (x < 1)
+        fun_l5_n255(x)
+    else
+        fun_l5_n438(x)
+    end
+end
+
+def fun_l4_n424(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n329(x)
+    end
+end
+
+def fun_l4_n425(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n512(x)
+    end
+end
+
+def fun_l4_n426(x)
+    if (x < 1)
+        fun_l5_n558(x)
+    else
+        fun_l5_n925(x)
+    end
+end
+
+def fun_l4_n427(x)
+    if (x < 1)
+        fun_l5_n745(x)
+    else
+        fun_l5_n168(x)
+    end
+end
+
+def fun_l4_n428(x)
+    if (x < 1)
+        fun_l5_n682(x)
+    else
+        fun_l5_n298(x)
+    end
+end
+
+def fun_l4_n429(x)
+    if (x < 1)
+        fun_l5_n211(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n430(x)
+    if (x < 1)
+        fun_l5_n100(x)
+    else
+        fun_l5_n287(x)
+    end
+end
+
+def fun_l4_n431(x)
+    if (x < 1)
+        fun_l5_n513(x)
+    else
+        fun_l5_n764(x)
+    end
+end
+
+def fun_l4_n432(x)
+    if (x < 1)
+        fun_l5_n925(x)
+    else
+        fun_l5_n857(x)
+    end
+end
+
+def fun_l4_n433(x)
+    if (x < 1)
+        fun_l5_n279(x)
+    else
+        fun_l5_n429(x)
+    end
+end
+
+def fun_l4_n434(x)
+    if (x < 1)
+        fun_l5_n376(x)
+    else
+        fun_l5_n811(x)
+    end
+end
+
+def fun_l4_n435(x)
+    if (x < 1)
+        fun_l5_n893(x)
+    else
+        fun_l5_n136(x)
+    end
+end
+
+def fun_l4_n436(x)
+    if (x < 1)
+        fun_l5_n283(x)
+    else
+        fun_l5_n508(x)
+    end
+end
+
+def fun_l4_n437(x)
+    if (x < 1)
+        fun_l5_n478(x)
+    else
+        fun_l5_n589(x)
+    end
+end
+
+def fun_l4_n438(x)
+    if (x < 1)
+        fun_l5_n460(x)
+    else
+        fun_l5_n589(x)
+    end
+end
+
+def fun_l4_n439(x)
+    if (x < 1)
+        fun_l5_n745(x)
+    else
+        fun_l5_n5(x)
+    end
+end
+
+def fun_l4_n440(x)
+    if (x < 1)
+        fun_l5_n601(x)
+    else
+        fun_l5_n322(x)
+    end
+end
+
+def fun_l4_n441(x)
+    if (x < 1)
+        fun_l5_n703(x)
+    else
+        fun_l5_n322(x)
+    end
+end
+
+def fun_l4_n442(x)
+    if (x < 1)
+        fun_l5_n810(x)
+    else
+        fun_l5_n363(x)
+    end
+end
+
+def fun_l4_n443(x)
+    if (x < 1)
+        fun_l5_n62(x)
+    else
+        fun_l5_n995(x)
+    end
+end
+
+def fun_l4_n444(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n156(x)
+    end
+end
+
+def fun_l4_n445(x)
+    if (x < 1)
+        fun_l5_n456(x)
+    else
+        fun_l5_n820(x)
+    end
+end
+
+def fun_l4_n446(x)
+    if (x < 1)
+        fun_l5_n592(x)
+    else
+        fun_l5_n214(x)
+    end
+end
+
+def fun_l4_n447(x)
+    if (x < 1)
+        fun_l5_n44(x)
+    else
+        fun_l5_n769(x)
+    end
+end
+
+def fun_l4_n448(x)
+    if (x < 1)
+        fun_l5_n694(x)
+    else
+        fun_l5_n909(x)
+    end
+end
+
+def fun_l4_n449(x)
+    if (x < 1)
+        fun_l5_n297(x)
+    else
+        fun_l5_n134(x)
+    end
+end
+
+def fun_l4_n450(x)
+    if (x < 1)
+        fun_l5_n878(x)
+    else
+        fun_l5_n475(x)
+    end
+end
+
+def fun_l4_n451(x)
+    if (x < 1)
+        fun_l5_n338(x)
+    else
+        fun_l5_n700(x)
+    end
+end
+
+def fun_l4_n452(x)
+    if (x < 1)
+        fun_l5_n813(x)
+    else
+        fun_l5_n41(x)
+    end
+end
+
+def fun_l4_n453(x)
+    if (x < 1)
+        fun_l5_n176(x)
+    else
+        fun_l5_n758(x)
+    end
+end
+
+def fun_l4_n454(x)
+    if (x < 1)
+        fun_l5_n60(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n455(x)
+    if (x < 1)
+        fun_l5_n550(x)
+    else
+        fun_l5_n607(x)
+    end
+end
+
+def fun_l4_n456(x)
+    if (x < 1)
+        fun_l5_n535(x)
+    else
+        fun_l5_n478(x)
+    end
+end
+
+def fun_l4_n457(x)
+    if (x < 1)
+        fun_l5_n768(x)
+    else
+        fun_l5_n613(x)
+    end
+end
+
+def fun_l4_n458(x)
+    if (x < 1)
+        fun_l5_n686(x)
+    else
+        fun_l5_n208(x)
+    end
+end
+
+def fun_l4_n459(x)
+    if (x < 1)
+        fun_l5_n167(x)
+    else
+        fun_l5_n875(x)
+    end
+end
+
+def fun_l4_n460(x)
+    if (x < 1)
+        fun_l5_n202(x)
+    else
+        fun_l5_n440(x)
+    end
+end
+
+def fun_l4_n461(x)
+    if (x < 1)
+        fun_l5_n64(x)
+    else
+        fun_l5_n845(x)
+    end
+end
+
+def fun_l4_n462(x)
+    if (x < 1)
+        fun_l5_n914(x)
+    else
+        fun_l5_n699(x)
+    end
+end
+
+def fun_l4_n463(x)
+    if (x < 1)
+        fun_l5_n204(x)
+    else
+        fun_l5_n723(x)
+    end
+end
+
+def fun_l4_n464(x)
+    if (x < 1)
+        fun_l5_n549(x)
+    else
+        fun_l5_n375(x)
+    end
+end
+
+def fun_l4_n465(x)
+    if (x < 1)
+        fun_l5_n610(x)
+    else
+        fun_l5_n596(x)
+    end
+end
+
+def fun_l4_n466(x)
+    if (x < 1)
+        fun_l5_n571(x)
+    else
+        fun_l5_n618(x)
+    end
+end
+
+def fun_l4_n467(x)
+    if (x < 1)
+        fun_l5_n428(x)
+    else
+        fun_l5_n315(x)
+    end
+end
+
+def fun_l4_n468(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n301(x)
+    end
+end
+
+def fun_l4_n469(x)
+    if (x < 1)
+        fun_l5_n38(x)
+    else
+        fun_l5_n895(x)
+    end
+end
+
+def fun_l4_n470(x)
+    if (x < 1)
+        fun_l5_n815(x)
+    else
+        fun_l5_n303(x)
+    end
+end
+
+def fun_l4_n471(x)
+    if (x < 1)
+        fun_l5_n876(x)
+    else
+        fun_l5_n221(x)
+    end
+end
+
+def fun_l4_n472(x)
+    if (x < 1)
+        fun_l5_n199(x)
+    else
+        fun_l5_n354(x)
+    end
+end
+
+def fun_l4_n473(x)
+    if (x < 1)
+        fun_l5_n56(x)
+    else
+        fun_l5_n197(x)
+    end
+end
+
+def fun_l4_n474(x)
+    if (x < 1)
+        fun_l5_n573(x)
+    else
+        fun_l5_n616(x)
+    end
+end
+
+def fun_l4_n475(x)
+    if (x < 1)
+        fun_l5_n313(x)
+    else
+        fun_l5_n209(x)
+    end
+end
+
+def fun_l4_n476(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n51(x)
+    end
+end
+
+def fun_l4_n477(x)
+    if (x < 1)
+        fun_l5_n768(x)
+    else
+        fun_l5_n368(x)
+    end
+end
+
+def fun_l4_n478(x)
+    if (x < 1)
+        fun_l5_n80(x)
+    else
+        fun_l5_n411(x)
+    end
+end
+
+def fun_l4_n479(x)
+    if (x < 1)
+        fun_l5_n221(x)
+    else
+        fun_l5_n266(x)
+    end
+end
+
+def fun_l4_n480(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n71(x)
+    end
+end
+
+def fun_l4_n481(x)
+    if (x < 1)
+        fun_l5_n446(x)
+    else
+        fun_l5_n610(x)
+    end
+end
+
+def fun_l4_n482(x)
+    if (x < 1)
+        fun_l5_n402(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n483(x)
+    if (x < 1)
+        fun_l5_n497(x)
+    else
+        fun_l5_n521(x)
+    end
+end
+
+def fun_l4_n484(x)
+    if (x < 1)
+        fun_l5_n895(x)
+    else
+        fun_l5_n361(x)
+    end
+end
+
+def fun_l4_n485(x)
+    if (x < 1)
+        fun_l5_n254(x)
+    else
+        fun_l5_n366(x)
+    end
+end
+
+def fun_l4_n486(x)
+    if (x < 1)
+        fun_l5_n179(x)
+    else
+        fun_l5_n154(x)
+    end
+end
+
+def fun_l4_n487(x)
+    if (x < 1)
+        fun_l5_n905(x)
+    else
+        fun_l5_n30(x)
+    end
+end
+
+def fun_l4_n488(x)
+    if (x < 1)
+        fun_l5_n989(x)
+    else
+        fun_l5_n640(x)
+    end
+end
+
+def fun_l4_n489(x)
+    if (x < 1)
+        fun_l5_n664(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n490(x)
+    if (x < 1)
+        fun_l5_n518(x)
+    else
+        fun_l5_n986(x)
+    end
+end
+
+def fun_l4_n491(x)
+    if (x < 1)
+        fun_l5_n443(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n492(x)
+    if (x < 1)
+        fun_l5_n349(x)
+    else
+        fun_l5_n373(x)
+    end
+end
+
+def fun_l4_n493(x)
+    if (x < 1)
+        fun_l5_n208(x)
+    else
+        fun_l5_n404(x)
+    end
+end
+
+def fun_l4_n494(x)
+    if (x < 1)
+        fun_l5_n12(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n495(x)
+    if (x < 1)
+        fun_l5_n12(x)
+    else
+        fun_l5_n42(x)
+    end
+end
+
+def fun_l4_n496(x)
+    if (x < 1)
+        fun_l5_n442(x)
+    else
+        fun_l5_n809(x)
+    end
+end
+
+def fun_l4_n497(x)
+    if (x < 1)
+        fun_l5_n266(x)
+    else
+        fun_l5_n259(x)
+    end
+end
+
+def fun_l4_n498(x)
+    if (x < 1)
+        fun_l5_n342(x)
+    else
+        fun_l5_n275(x)
+    end
+end
+
+def fun_l4_n499(x)
+    if (x < 1)
+        fun_l5_n806(x)
+    else
+        fun_l5_n797(x)
+    end
+end
+
+def fun_l4_n500(x)
+    if (x < 1)
+        fun_l5_n646(x)
+    else
+        fun_l5_n426(x)
+    end
+end
+
+def fun_l4_n501(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n860(x)
+    end
+end
+
+def fun_l4_n502(x)
+    if (x < 1)
+        fun_l5_n355(x)
+    else
+        fun_l5_n411(x)
+    end
+end
+
+def fun_l4_n503(x)
+    if (x < 1)
+        fun_l5_n602(x)
+    else
+        fun_l5_n26(x)
+    end
+end
+
+def fun_l4_n504(x)
+    if (x < 1)
+        fun_l5_n875(x)
+    else
+        fun_l5_n716(x)
+    end
+end
+
+def fun_l4_n505(x)
+    if (x < 1)
+        fun_l5_n248(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n506(x)
+    if (x < 1)
+        fun_l5_n273(x)
+    else
+        fun_l5_n11(x)
+    end
+end
+
+def fun_l4_n507(x)
+    if (x < 1)
+        fun_l5_n291(x)
+    else
+        fun_l5_n464(x)
+    end
+end
+
+def fun_l4_n508(x)
+    if (x < 1)
+        fun_l5_n309(x)
+    else
+        fun_l5_n198(x)
+    end
+end
+
+def fun_l4_n509(x)
+    if (x < 1)
+        fun_l5_n85(x)
+    else
+        fun_l5_n375(x)
+    end
+end
+
+def fun_l4_n510(x)
+    if (x < 1)
+        fun_l5_n993(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n511(x)
+    if (x < 1)
+        fun_l5_n824(x)
+    else
+        fun_l5_n936(x)
+    end
+end
+
+def fun_l4_n512(x)
+    if (x < 1)
+        fun_l5_n897(x)
+    else
+        fun_l5_n995(x)
+    end
+end
+
+def fun_l4_n513(x)
+    if (x < 1)
+        fun_l5_n443(x)
+    else
+        fun_l5_n511(x)
+    end
+end
+
+def fun_l4_n514(x)
+    if (x < 1)
+        fun_l5_n965(x)
+    else
+        fun_l5_n506(x)
+    end
+end
+
+def fun_l4_n515(x)
+    if (x < 1)
+        fun_l5_n480(x)
+    else
+        fun_l5_n464(x)
+    end
+end
+
+def fun_l4_n516(x)
+    if (x < 1)
+        fun_l5_n396(x)
+    else
+        fun_l5_n355(x)
+    end
+end
+
+def fun_l4_n517(x)
+    if (x < 1)
+        fun_l5_n782(x)
+    else
+        fun_l5_n624(x)
+    end
+end
+
+def fun_l4_n518(x)
+    if (x < 1)
+        fun_l5_n460(x)
+    else
+        fun_l5_n920(x)
+    end
+end
+
+def fun_l4_n519(x)
+    if (x < 1)
+        fun_l5_n258(x)
+    else
+        fun_l5_n296(x)
+    end
+end
+
+def fun_l4_n520(x)
+    if (x < 1)
+        fun_l5_n344(x)
+    else
+        fun_l5_n180(x)
+    end
+end
+
+def fun_l4_n521(x)
+    if (x < 1)
+        fun_l5_n489(x)
+    else
+        fun_l5_n818(x)
+    end
+end
+
+def fun_l4_n522(x)
+    if (x < 1)
+        fun_l5_n246(x)
+    else
+        fun_l5_n25(x)
+    end
+end
+
+def fun_l4_n523(x)
+    if (x < 1)
+        fun_l5_n165(x)
+    else
+        fun_l5_n835(x)
+    end
+end
+
+def fun_l4_n524(x)
+    if (x < 1)
+        fun_l5_n836(x)
+    else
+        fun_l5_n838(x)
+    end
+end
+
+def fun_l4_n525(x)
+    if (x < 1)
+        fun_l5_n781(x)
+    else
+        fun_l5_n183(x)
+    end
+end
+
+def fun_l4_n526(x)
+    if (x < 1)
+        fun_l5_n335(x)
+    else
+        fun_l5_n809(x)
+    end
+end
+
+def fun_l4_n527(x)
+    if (x < 1)
+        fun_l5_n748(x)
+    else
+        fun_l5_n674(x)
+    end
+end
+
+def fun_l4_n528(x)
+    if (x < 1)
+        fun_l5_n612(x)
+    else
+        fun_l5_n933(x)
+    end
+end
+
+def fun_l4_n529(x)
+    if (x < 1)
+        fun_l5_n781(x)
+    else
+        fun_l5_n174(x)
+    end
+end
+
+def fun_l4_n530(x)
+    if (x < 1)
+        fun_l5_n299(x)
+    else
+        fun_l5_n677(x)
+    end
+end
+
+def fun_l4_n531(x)
+    if (x < 1)
+        fun_l5_n455(x)
+    else
+        fun_l5_n211(x)
+    end
+end
+
+def fun_l4_n532(x)
+    if (x < 1)
+        fun_l5_n981(x)
+    else
+        fun_l5_n605(x)
+    end
+end
+
+def fun_l4_n533(x)
+    if (x < 1)
+        fun_l5_n299(x)
+    else
+        fun_l5_n30(x)
+    end
+end
+
+def fun_l4_n534(x)
+    if (x < 1)
+        fun_l5_n642(x)
+    else
+        fun_l5_n652(x)
+    end
+end
+
+def fun_l4_n535(x)
+    if (x < 1)
+        fun_l5_n904(x)
+    else
+        fun_l5_n133(x)
+    end
+end
+
+def fun_l4_n536(x)
+    if (x < 1)
+        fun_l5_n253(x)
+    else
+        fun_l5_n330(x)
+    end
+end
+
+def fun_l4_n537(x)
+    if (x < 1)
+        fun_l5_n357(x)
+    else
+        fun_l5_n533(x)
+    end
+end
+
+def fun_l4_n538(x)
+    if (x < 1)
+        fun_l5_n484(x)
+    else
+        fun_l5_n438(x)
+    end
+end
+
+def fun_l4_n539(x)
+    if (x < 1)
+        fun_l5_n200(x)
+    else
+        fun_l5_n235(x)
+    end
+end
+
+def fun_l4_n540(x)
+    if (x < 1)
+        fun_l5_n929(x)
+    else
+        fun_l5_n875(x)
+    end
+end
+
+def fun_l4_n541(x)
+    if (x < 1)
+        fun_l5_n237(x)
+    else
+        fun_l5_n688(x)
+    end
+end
+
+def fun_l4_n542(x)
+    if (x < 1)
+        fun_l5_n723(x)
+    else
+        fun_l5_n308(x)
+    end
+end
+
+def fun_l4_n543(x)
+    if (x < 1)
+        fun_l5_n591(x)
+    else
+        fun_l5_n93(x)
+    end
+end
+
+def fun_l4_n544(x)
+    if (x < 1)
+        fun_l5_n258(x)
+    else
+        fun_l5_n205(x)
+    end
+end
+
+def fun_l4_n545(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n529(x)
+    end
+end
+
+def fun_l4_n546(x)
+    if (x < 1)
+        fun_l5_n255(x)
+    else
+        fun_l5_n262(x)
+    end
+end
+
+def fun_l4_n547(x)
+    if (x < 1)
+        fun_l5_n674(x)
+    else
+        fun_l5_n813(x)
+    end
+end
+
+def fun_l4_n548(x)
+    if (x < 1)
+        fun_l5_n9(x)
+    else
+        fun_l5_n709(x)
+    end
+end
+
+def fun_l4_n549(x)
+    if (x < 1)
+        fun_l5_n146(x)
+    else
+        fun_l5_n801(x)
+    end
+end
+
+def fun_l4_n550(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n428(x)
+    end
+end
+
+def fun_l4_n551(x)
+    if (x < 1)
+        fun_l5_n953(x)
+    else
+        fun_l5_n238(x)
+    end
+end
+
+def fun_l4_n552(x)
+    if (x < 1)
+        fun_l5_n900(x)
+    else
+        fun_l5_n246(x)
+    end
+end
+
+def fun_l4_n553(x)
+    if (x < 1)
+        fun_l5_n400(x)
+    else
+        fun_l5_n150(x)
+    end
+end
+
+def fun_l4_n554(x)
+    if (x < 1)
+        fun_l5_n697(x)
+    else
+        fun_l5_n681(x)
+    end
+end
+
+def fun_l4_n555(x)
+    if (x < 1)
+        fun_l5_n487(x)
+    else
+        fun_l5_n784(x)
+    end
+end
+
+def fun_l4_n556(x)
+    if (x < 1)
+        fun_l5_n485(x)
+    else
+        fun_l5_n984(x)
+    end
+end
+
+def fun_l4_n557(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n864(x)
+    end
+end
+
+def fun_l4_n558(x)
+    if (x < 1)
+        fun_l5_n823(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n559(x)
+    if (x < 1)
+        fun_l5_n204(x)
+    else
+        fun_l5_n114(x)
+    end
+end
+
+def fun_l4_n560(x)
+    if (x < 1)
+        fun_l5_n835(x)
+    else
+        fun_l5_n930(x)
+    end
+end
+
+def fun_l4_n561(x)
+    if (x < 1)
+        fun_l5_n481(x)
+    else
+        fun_l5_n471(x)
+    end
+end
+
+def fun_l4_n562(x)
+    if (x < 1)
+        fun_l5_n459(x)
+    else
+        fun_l5_n526(x)
+    end
+end
+
+def fun_l4_n563(x)
+    if (x < 1)
+        fun_l5_n148(x)
+    else
+        fun_l5_n473(x)
+    end
+end
+
+def fun_l4_n564(x)
+    if (x < 1)
+        fun_l5_n448(x)
+    else
+        fun_l5_n389(x)
+    end
+end
+
+def fun_l4_n565(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n405(x)
+    end
+end
+
+def fun_l4_n566(x)
+    if (x < 1)
+        fun_l5_n67(x)
+    else
+        fun_l5_n145(x)
+    end
+end
+
+def fun_l4_n567(x)
+    if (x < 1)
+        fun_l5_n63(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n568(x)
+    if (x < 1)
+        fun_l5_n463(x)
+    else
+        fun_l5_n288(x)
+    end
+end
+
+def fun_l4_n569(x)
+    if (x < 1)
+        fun_l5_n143(x)
+    else
+        fun_l5_n879(x)
+    end
+end
+
+def fun_l4_n570(x)
+    if (x < 1)
+        fun_l5_n552(x)
+    else
+        fun_l5_n517(x)
+    end
+end
+
+def fun_l4_n571(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n680(x)
+    end
+end
+
+def fun_l4_n572(x)
+    if (x < 1)
+        fun_l5_n853(x)
+    else
+        fun_l5_n97(x)
+    end
+end
+
+def fun_l4_n573(x)
+    if (x < 1)
+        fun_l5_n277(x)
+    else
+        fun_l5_n329(x)
+    end
+end
+
+def fun_l4_n574(x)
+    if (x < 1)
+        fun_l5_n952(x)
+    else
+        fun_l5_n515(x)
+    end
+end
+
+def fun_l4_n575(x)
+    if (x < 1)
+        fun_l5_n64(x)
+    else
+        fun_l5_n576(x)
+    end
+end
+
+def fun_l4_n576(x)
+    if (x < 1)
+        fun_l5_n57(x)
+    else
+        fun_l5_n499(x)
+    end
+end
+
+def fun_l4_n577(x)
+    if (x < 1)
+        fun_l5_n10(x)
+    else
+        fun_l5_n208(x)
+    end
+end
+
+def fun_l4_n578(x)
+    if (x < 1)
+        fun_l5_n361(x)
+    else
+        fun_l5_n447(x)
+    end
+end
+
+def fun_l4_n579(x)
+    if (x < 1)
+        fun_l5_n788(x)
+    else
+        fun_l5_n299(x)
+    end
+end
+
+def fun_l4_n580(x)
+    if (x < 1)
+        fun_l5_n973(x)
+    else
+        fun_l5_n753(x)
+    end
+end
+
+def fun_l4_n581(x)
+    if (x < 1)
+        fun_l5_n862(x)
+    else
+        fun_l5_n110(x)
+    end
+end
+
+def fun_l4_n582(x)
+    if (x < 1)
+        fun_l5_n760(x)
+    else
+        fun_l5_n256(x)
+    end
+end
+
+def fun_l4_n583(x)
+    if (x < 1)
+        fun_l5_n8(x)
+    else
+        fun_l5_n922(x)
+    end
+end
+
+def fun_l4_n584(x)
+    if (x < 1)
+        fun_l5_n100(x)
+    else
+        fun_l5_n230(x)
+    end
+end
+
+def fun_l4_n585(x)
+    if (x < 1)
+        fun_l5_n183(x)
+    else
+        fun_l5_n350(x)
+    end
+end
+
+def fun_l4_n586(x)
+    if (x < 1)
+        fun_l5_n294(x)
+    else
+        fun_l5_n673(x)
+    end
+end
+
+def fun_l4_n587(x)
+    if (x < 1)
+        fun_l5_n51(x)
+    else
+        fun_l5_n718(x)
+    end
+end
+
+def fun_l4_n588(x)
+    if (x < 1)
+        fun_l5_n257(x)
+    else
+        fun_l5_n111(x)
+    end
+end
+
+def fun_l4_n589(x)
+    if (x < 1)
+        fun_l5_n727(x)
+    else
+        fun_l5_n585(x)
+    end
+end
+
+def fun_l4_n590(x)
+    if (x < 1)
+        fun_l5_n205(x)
+    else
+        fun_l5_n308(x)
+    end
+end
+
+def fun_l4_n591(x)
+    if (x < 1)
+        fun_l5_n618(x)
+    else
+        fun_l5_n970(x)
+    end
+end
+
+def fun_l4_n592(x)
+    if (x < 1)
+        fun_l5_n631(x)
+    else
+        fun_l5_n513(x)
+    end
+end
+
+def fun_l4_n593(x)
+    if (x < 1)
+        fun_l5_n270(x)
+    else
+        fun_l5_n737(x)
+    end
+end
+
+def fun_l4_n594(x)
+    if (x < 1)
+        fun_l5_n464(x)
+    else
+        fun_l5_n217(x)
+    end
+end
+
+def fun_l4_n595(x)
+    if (x < 1)
+        fun_l5_n650(x)
+    else
+        fun_l5_n616(x)
+    end
+end
+
+def fun_l4_n596(x)
+    if (x < 1)
+        fun_l5_n542(x)
+    else
+        fun_l5_n613(x)
+    end
+end
+
+def fun_l4_n597(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n7(x)
+    end
+end
+
+def fun_l4_n598(x)
+    if (x < 1)
+        fun_l5_n164(x)
+    else
+        fun_l5_n592(x)
+    end
+end
+
+def fun_l4_n599(x)
+    if (x < 1)
+        fun_l5_n326(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n600(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n233(x)
+    end
+end
+
+def fun_l4_n601(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n7(x)
+    end
+end
+
+def fun_l4_n602(x)
+    if (x < 1)
+        fun_l5_n334(x)
+    else
+        fun_l5_n282(x)
+    end
+end
+
+def fun_l4_n603(x)
+    if (x < 1)
+        fun_l5_n202(x)
+    else
+        fun_l5_n252(x)
+    end
+end
+
+def fun_l4_n604(x)
+    if (x < 1)
+        fun_l5_n173(x)
+    else
+        fun_l5_n685(x)
+    end
+end
+
+def fun_l4_n605(x)
+    if (x < 1)
+        fun_l5_n953(x)
+    else
+        fun_l5_n416(x)
+    end
+end
+
+def fun_l4_n606(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n372(x)
+    end
+end
+
+def fun_l4_n607(x)
+    if (x < 1)
+        fun_l5_n723(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n608(x)
+    if (x < 1)
+        fun_l5_n690(x)
+    else
+        fun_l5_n26(x)
+    end
+end
+
+def fun_l4_n609(x)
+    if (x < 1)
+        fun_l5_n555(x)
+    else
+        fun_l5_n717(x)
+    end
+end
+
+def fun_l4_n610(x)
+    if (x < 1)
+        fun_l5_n597(x)
+    else
+        fun_l5_n106(x)
+    end
+end
+
+def fun_l4_n611(x)
+    if (x < 1)
+        fun_l5_n405(x)
+    else
+        fun_l5_n588(x)
+    end
+end
+
+def fun_l4_n612(x)
+    if (x < 1)
+        fun_l5_n41(x)
+    else
+        fun_l5_n558(x)
+    end
+end
+
+def fun_l4_n613(x)
+    if (x < 1)
+        fun_l5_n875(x)
+    else
+        fun_l5_n492(x)
+    end
+end
+
+def fun_l4_n614(x)
+    if (x < 1)
+        fun_l5_n605(x)
+    else
+        fun_l5_n461(x)
+    end
+end
+
+def fun_l4_n615(x)
+    if (x < 1)
+        fun_l5_n726(x)
+    else
+        fun_l5_n534(x)
+    end
+end
+
+def fun_l4_n616(x)
+    if (x < 1)
+        fun_l5_n919(x)
+    else
+        fun_l5_n404(x)
+    end
+end
+
+def fun_l4_n617(x)
+    if (x < 1)
+        fun_l5_n383(x)
+    else
+        fun_l5_n324(x)
+    end
+end
+
+def fun_l4_n618(x)
+    if (x < 1)
+        fun_l5_n286(x)
+    else
+        fun_l5_n157(x)
+    end
+end
+
+def fun_l4_n619(x)
+    if (x < 1)
+        fun_l5_n713(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n620(x)
+    if (x < 1)
+        fun_l5_n773(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n621(x)
+    if (x < 1)
+        fun_l5_n797(x)
+    else
+        fun_l5_n720(x)
+    end
+end
+
+def fun_l4_n622(x)
+    if (x < 1)
+        fun_l5_n799(x)
+    else
+        fun_l5_n423(x)
+    end
+end
+
+def fun_l4_n623(x)
+    if (x < 1)
+        fun_l5_n390(x)
+    else
+        fun_l5_n941(x)
+    end
+end
+
+def fun_l4_n624(x)
+    if (x < 1)
+        fun_l5_n584(x)
+    else
+        fun_l5_n191(x)
+    end
+end
+
+def fun_l4_n625(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n208(x)
+    end
+end
+
+def fun_l4_n626(x)
+    if (x < 1)
+        fun_l5_n136(x)
+    else
+        fun_l5_n791(x)
+    end
+end
+
+def fun_l4_n627(x)
+    if (x < 1)
+        fun_l5_n684(x)
+    else
+        fun_l5_n341(x)
+    end
+end
+
+def fun_l4_n628(x)
+    if (x < 1)
+        fun_l5_n876(x)
+    else
+        fun_l5_n27(x)
+    end
+end
+
+def fun_l4_n629(x)
+    if (x < 1)
+        fun_l5_n18(x)
+    else
+        fun_l5_n867(x)
+    end
+end
+
+def fun_l4_n630(x)
+    if (x < 1)
+        fun_l5_n4(x)
+    else
+        fun_l5_n871(x)
+    end
+end
+
+def fun_l4_n631(x)
+    if (x < 1)
+        fun_l5_n578(x)
+    else
+        fun_l5_n988(x)
+    end
+end
+
+def fun_l4_n632(x)
+    if (x < 1)
+        fun_l5_n388(x)
+    else
+        fun_l5_n258(x)
+    end
+end
+
+def fun_l4_n633(x)
+    if (x < 1)
+        fun_l5_n680(x)
+    else
+        fun_l5_n814(x)
+    end
+end
+
+def fun_l4_n634(x)
+    if (x < 1)
+        fun_l5_n857(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n635(x)
+    if (x < 1)
+        fun_l5_n547(x)
+    else
+        fun_l5_n725(x)
+    end
+end
+
+def fun_l4_n636(x)
+    if (x < 1)
+        fun_l5_n644(x)
+    else
+        fun_l5_n485(x)
+    end
+end
+
+def fun_l4_n637(x)
+    if (x < 1)
+        fun_l5_n528(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n638(x)
+    if (x < 1)
+        fun_l5_n924(x)
+    else
+        fun_l5_n956(x)
+    end
+end
+
+def fun_l4_n639(x)
+    if (x < 1)
+        fun_l5_n654(x)
+    else
+        fun_l5_n979(x)
+    end
+end
+
+def fun_l4_n640(x)
+    if (x < 1)
+        fun_l5_n287(x)
+    else
+        fun_l5_n778(x)
+    end
+end
+
+def fun_l4_n641(x)
+    if (x < 1)
+        fun_l5_n197(x)
+    else
+        fun_l5_n682(x)
+    end
+end
+
+def fun_l4_n642(x)
+    if (x < 1)
+        fun_l5_n559(x)
+    else
+        fun_l5_n812(x)
+    end
+end
+
+def fun_l4_n643(x)
+    if (x < 1)
+        fun_l5_n970(x)
+    else
+        fun_l5_n43(x)
+    end
+end
+
+def fun_l4_n644(x)
+    if (x < 1)
+        fun_l5_n222(x)
+    else
+        fun_l5_n741(x)
+    end
+end
+
+def fun_l4_n645(x)
+    if (x < 1)
+        fun_l5_n788(x)
+    else
+        fun_l5_n72(x)
+    end
+end
+
+def fun_l4_n646(x)
+    if (x < 1)
+        fun_l5_n877(x)
+    else
+        fun_l5_n371(x)
+    end
+end
+
+def fun_l4_n647(x)
+    if (x < 1)
+        fun_l5_n710(x)
+    else
+        fun_l5_n783(x)
+    end
+end
+
+def fun_l4_n648(x)
+    if (x < 1)
+        fun_l5_n957(x)
+    else
+        fun_l5_n801(x)
+    end
+end
+
+def fun_l4_n649(x)
+    if (x < 1)
+        fun_l5_n127(x)
+    else
+        fun_l5_n664(x)
+    end
+end
+
+def fun_l4_n650(x)
+    if (x < 1)
+        fun_l5_n176(x)
+    else
+        fun_l5_n511(x)
+    end
+end
+
+def fun_l4_n651(x)
+    if (x < 1)
+        fun_l5_n830(x)
+    else
+        fun_l5_n107(x)
+    end
+end
+
+def fun_l4_n652(x)
+    if (x < 1)
+        fun_l5_n207(x)
+    else
+        fun_l5_n894(x)
+    end
+end
+
+def fun_l4_n653(x)
+    if (x < 1)
+        fun_l5_n611(x)
+    else
+        fun_l5_n443(x)
+    end
+end
+
+def fun_l4_n654(x)
+    if (x < 1)
+        fun_l5_n953(x)
+    else
+        fun_l5_n214(x)
+    end
+end
+
+def fun_l4_n655(x)
+    if (x < 1)
+        fun_l5_n109(x)
+    else
+        fun_l5_n706(x)
+    end
+end
+
+def fun_l4_n656(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n914(x)
+    end
+end
+
+def fun_l4_n657(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n530(x)
+    end
+end
+
+def fun_l4_n658(x)
+    if (x < 1)
+        fun_l5_n79(x)
+    else
+        fun_l5_n303(x)
+    end
+end
+
+def fun_l4_n659(x)
+    if (x < 1)
+        fun_l5_n718(x)
+    else
+        fun_l5_n196(x)
+    end
+end
+
+def fun_l4_n660(x)
+    if (x < 1)
+        fun_l5_n196(x)
+    else
+        fun_l5_n661(x)
+    end
+end
+
+def fun_l4_n661(x)
+    if (x < 1)
+        fun_l5_n654(x)
+    else
+        fun_l5_n17(x)
+    end
+end
+
+def fun_l4_n662(x)
+    if (x < 1)
+        fun_l5_n413(x)
+    else
+        fun_l5_n214(x)
+    end
+end
+
+def fun_l4_n663(x)
+    if (x < 1)
+        fun_l5_n491(x)
+    else
+        fun_l5_n927(x)
+    end
+end
+
+def fun_l4_n664(x)
+    if (x < 1)
+        fun_l5_n671(x)
+    else
+        fun_l5_n611(x)
+    end
+end
+
+def fun_l4_n665(x)
+    if (x < 1)
+        fun_l5_n153(x)
+    else
+        fun_l5_n127(x)
+    end
+end
+
+def fun_l4_n666(x)
+    if (x < 1)
+        fun_l5_n661(x)
+    else
+        fun_l5_n590(x)
+    end
+end
+
+def fun_l4_n667(x)
+    if (x < 1)
+        fun_l5_n539(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n668(x)
+    if (x < 1)
+        fun_l5_n390(x)
+    else
+        fun_l5_n423(x)
+    end
+end
+
+def fun_l4_n669(x)
+    if (x < 1)
+        fun_l5_n615(x)
+    else
+        fun_l5_n449(x)
+    end
+end
+
+def fun_l4_n670(x)
+    if (x < 1)
+        fun_l5_n49(x)
+    else
+        fun_l5_n632(x)
+    end
+end
+
+def fun_l4_n671(x)
+    if (x < 1)
+        fun_l5_n891(x)
+    else
+        fun_l5_n915(x)
+    end
+end
+
+def fun_l4_n672(x)
+    if (x < 1)
+        fun_l5_n257(x)
+    else
+        fun_l5_n719(x)
+    end
+end
+
+def fun_l4_n673(x)
+    if (x < 1)
+        fun_l5_n620(x)
+    else
+        fun_l5_n473(x)
+    end
+end
+
+def fun_l4_n674(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n675(x)
+    if (x < 1)
+        fun_l5_n973(x)
+    else
+        fun_l5_n32(x)
+    end
+end
+
+def fun_l4_n676(x)
+    if (x < 1)
+        fun_l5_n434(x)
+    else
+        fun_l5_n85(x)
+    end
+end
+
+def fun_l4_n677(x)
+    if (x < 1)
+        fun_l5_n430(x)
+    else
+        fun_l5_n702(x)
+    end
+end
+
+def fun_l4_n678(x)
+    if (x < 1)
+        fun_l5_n698(x)
+    else
+        fun_l5_n482(x)
+    end
+end
+
+def fun_l4_n679(x)
+    if (x < 1)
+        fun_l5_n365(x)
+    else
+        fun_l5_n83(x)
+    end
+end
+
+def fun_l4_n680(x)
+    if (x < 1)
+        fun_l5_n397(x)
+    else
+        fun_l5_n356(x)
+    end
+end
+
+def fun_l4_n681(x)
+    if (x < 1)
+        fun_l5_n48(x)
+    else
+        fun_l5_n458(x)
+    end
+end
+
+def fun_l4_n682(x)
+    if (x < 1)
+        fun_l5_n205(x)
+    else
+        fun_l5_n693(x)
+    end
+end
+
+def fun_l4_n683(x)
+    if (x < 1)
+        fun_l5_n971(x)
+    else
+        fun_l5_n656(x)
+    end
+end
+
+def fun_l4_n684(x)
+    if (x < 1)
+        fun_l5_n147(x)
+    else
+        fun_l5_n314(x)
+    end
+end
+
+def fun_l4_n685(x)
+    if (x < 1)
+        fun_l5_n347(x)
+    else
+        fun_l5_n281(x)
+    end
+end
+
+def fun_l4_n686(x)
+    if (x < 1)
+        fun_l5_n259(x)
+    else
+        fun_l5_n395(x)
+    end
+end
+
+def fun_l4_n687(x)
+    if (x < 1)
+        fun_l5_n899(x)
+    else
+        fun_l5_n319(x)
+    end
+end
+
+def fun_l4_n688(x)
+    if (x < 1)
+        fun_l5_n293(x)
+    else
+        fun_l5_n831(x)
+    end
+end
+
+def fun_l4_n689(x)
+    if (x < 1)
+        fun_l5_n88(x)
+    else
+        fun_l5_n938(x)
+    end
+end
+
+def fun_l4_n690(x)
+    if (x < 1)
+        fun_l5_n72(x)
+    else
+        fun_l5_n172(x)
+    end
+end
+
+def fun_l4_n691(x)
+    if (x < 1)
+        fun_l5_n330(x)
+    else
+        fun_l5_n70(x)
+    end
+end
+
+def fun_l4_n692(x)
+    if (x < 1)
+        fun_l5_n901(x)
+    else
+        fun_l5_n984(x)
+    end
+end
+
+def fun_l4_n693(x)
+    if (x < 1)
+        fun_l5_n528(x)
+    else
+        fun_l5_n659(x)
+    end
+end
+
+def fun_l4_n694(x)
+    if (x < 1)
+        fun_l5_n522(x)
+    else
+        fun_l5_n219(x)
+    end
+end
+
+def fun_l4_n695(x)
+    if (x < 1)
+        fun_l5_n568(x)
+    else
+        fun_l5_n997(x)
+    end
+end
+
+def fun_l4_n696(x)
+    if (x < 1)
+        fun_l5_n248(x)
+    else
+        fun_l5_n508(x)
+    end
+end
+
+def fun_l4_n697(x)
+    if (x < 1)
+        fun_l5_n71(x)
+    else
+        fun_l5_n590(x)
+    end
+end
+
+def fun_l4_n698(x)
+    if (x < 1)
+        fun_l5_n398(x)
+    else
+        fun_l5_n125(x)
+    end
+end
+
+def fun_l4_n699(x)
+    if (x < 1)
+        fun_l5_n405(x)
+    else
+        fun_l5_n129(x)
+    end
+end
+
+def fun_l4_n700(x)
+    if (x < 1)
+        fun_l5_n818(x)
+    else
+        fun_l5_n792(x)
+    end
+end
+
+def fun_l4_n701(x)
+    if (x < 1)
+        fun_l5_n530(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n702(x)
+    if (x < 1)
+        fun_l5_n640(x)
+    else
+        fun_l5_n558(x)
+    end
+end
+
+def fun_l4_n703(x)
+    if (x < 1)
+        fun_l5_n717(x)
+    else
+        fun_l5_n113(x)
+    end
+end
+
+def fun_l4_n704(x)
+    if (x < 1)
+        fun_l5_n139(x)
+    else
+        fun_l5_n743(x)
+    end
+end
+
+def fun_l4_n705(x)
+    if (x < 1)
+        fun_l5_n720(x)
+    else
+        fun_l5_n713(x)
+    end
+end
+
+def fun_l4_n706(x)
+    if (x < 1)
+        fun_l5_n774(x)
+    else
+        fun_l5_n90(x)
+    end
+end
+
+def fun_l4_n707(x)
+    if (x < 1)
+        fun_l5_n579(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n708(x)
+    if (x < 1)
+        fun_l5_n448(x)
+    else
+        fun_l5_n146(x)
+    end
+end
+
+def fun_l4_n709(x)
+    if (x < 1)
+        fun_l5_n249(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n710(x)
+    if (x < 1)
+        fun_l5_n694(x)
+    else
+        fun_l5_n532(x)
+    end
+end
+
+def fun_l4_n711(x)
+    if (x < 1)
+        fun_l5_n739(x)
+    else
+        fun_l5_n424(x)
+    end
+end
+
+def fun_l4_n712(x)
+    if (x < 1)
+        fun_l5_n700(x)
+    else
+        fun_l5_n761(x)
+    end
+end
+
+def fun_l4_n713(x)
+    if (x < 1)
+        fun_l5_n403(x)
+    else
+        fun_l5_n941(x)
+    end
+end
+
+def fun_l4_n714(x)
+    if (x < 1)
+        fun_l5_n724(x)
+    else
+        fun_l5_n863(x)
+    end
+end
+
+def fun_l4_n715(x)
+    if (x < 1)
+        fun_l5_n392(x)
+    else
+        fun_l5_n617(x)
+    end
+end
+
+def fun_l4_n716(x)
+    if (x < 1)
+        fun_l5_n76(x)
+    else
+        fun_l5_n896(x)
+    end
+end
+
+def fun_l4_n717(x)
+    if (x < 1)
+        fun_l5_n355(x)
+    else
+        fun_l5_n533(x)
+    end
+end
+
+def fun_l4_n718(x)
+    if (x < 1)
+        fun_l5_n225(x)
+    else
+        fun_l5_n273(x)
+    end
+end
+
+def fun_l4_n719(x)
+    if (x < 1)
+        fun_l5_n828(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n720(x)
+    if (x < 1)
+        fun_l5_n309(x)
+    else
+        fun_l5_n702(x)
+    end
+end
+
+def fun_l4_n721(x)
+    if (x < 1)
+        fun_l5_n959(x)
+    else
+        fun_l5_n370(x)
+    end
+end
+
+def fun_l4_n722(x)
+    if (x < 1)
+        fun_l5_n640(x)
+    else
+        fun_l5_n96(x)
+    end
+end
+
+def fun_l4_n723(x)
+    if (x < 1)
+        fun_l5_n590(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n724(x)
+    if (x < 1)
+        fun_l5_n14(x)
+    else
+        fun_l5_n161(x)
+    end
+end
+
+def fun_l4_n725(x)
+    if (x < 1)
+        fun_l5_n871(x)
+    else
+        fun_l5_n643(x)
+    end
+end
+
+def fun_l4_n726(x)
+    if (x < 1)
+        fun_l5_n885(x)
+    else
+        fun_l5_n142(x)
+    end
+end
+
+def fun_l4_n727(x)
+    if (x < 1)
+        fun_l5_n994(x)
+    else
+        fun_l5_n823(x)
+    end
+end
+
+def fun_l4_n728(x)
+    if (x < 1)
+        fun_l5_n825(x)
+    else
+        fun_l5_n315(x)
+    end
+end
+
+def fun_l4_n729(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n28(x)
+    end
+end
+
+def fun_l4_n730(x)
+    if (x < 1)
+        fun_l5_n545(x)
+    else
+        fun_l5_n87(x)
+    end
+end
+
+def fun_l4_n731(x)
+    if (x < 1)
+        fun_l5_n604(x)
+    else
+        fun_l5_n999(x)
+    end
+end
+
+def fun_l4_n732(x)
+    if (x < 1)
+        fun_l5_n21(x)
+    else
+        fun_l5_n170(x)
+    end
+end
+
+def fun_l4_n733(x)
+    if (x < 1)
+        fun_l5_n662(x)
+    else
+        fun_l5_n407(x)
+    end
+end
+
+def fun_l4_n734(x)
+    if (x < 1)
+        fun_l5_n808(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n735(x)
+    if (x < 1)
+        fun_l5_n665(x)
+    else
+        fun_l5_n925(x)
+    end
+end
+
+def fun_l4_n736(x)
+    if (x < 1)
+        fun_l5_n186(x)
+    else
+        fun_l5_n817(x)
+    end
+end
+
+def fun_l4_n737(x)
+    if (x < 1)
+        fun_l5_n360(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n738(x)
+    if (x < 1)
+        fun_l5_n278(x)
+    else
+        fun_l5_n759(x)
+    end
+end
+
+def fun_l4_n739(x)
+    if (x < 1)
+        fun_l5_n710(x)
+    else
+        fun_l5_n909(x)
+    end
+end
+
+def fun_l4_n740(x)
+    if (x < 1)
+        fun_l5_n770(x)
+    else
+        fun_l5_n382(x)
+    end
+end
+
+def fun_l4_n741(x)
+    if (x < 1)
+        fun_l5_n969(x)
+    else
+        fun_l5_n583(x)
+    end
+end
+
+def fun_l4_n742(x)
+    if (x < 1)
+        fun_l5_n653(x)
+    else
+        fun_l5_n258(x)
+    end
+end
+
+def fun_l4_n743(x)
+    if (x < 1)
+        fun_l5_n966(x)
+    else
+        fun_l5_n705(x)
+    end
+end
+
+def fun_l4_n744(x)
+    if (x < 1)
+        fun_l5_n454(x)
+    else
+        fun_l5_n748(x)
+    end
+end
+
+def fun_l4_n745(x)
+    if (x < 1)
+        fun_l5_n595(x)
+    else
+        fun_l5_n865(x)
+    end
+end
+
+def fun_l4_n746(x)
+    if (x < 1)
+        fun_l5_n593(x)
+    else
+        fun_l5_n615(x)
+    end
+end
+
+def fun_l4_n747(x)
+    if (x < 1)
+        fun_l5_n638(x)
+    else
+        fun_l5_n651(x)
+    end
+end
+
+def fun_l4_n748(x)
+    if (x < 1)
+        fun_l5_n331(x)
+    else
+        fun_l5_n847(x)
+    end
+end
+
+def fun_l4_n749(x)
+    if (x < 1)
+        fun_l5_n59(x)
+    else
+        fun_l5_n805(x)
+    end
+end
+
+def fun_l4_n750(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n904(x)
+    end
+end
+
+def fun_l4_n751(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n459(x)
+    end
+end
+
+def fun_l4_n752(x)
+    if (x < 1)
+        fun_l5_n581(x)
+    else
+        fun_l5_n353(x)
+    end
+end
+
+def fun_l4_n753(x)
+    if (x < 1)
+        fun_l5_n785(x)
+    else
+        fun_l5_n745(x)
+    end
+end
+
+def fun_l4_n754(x)
+    if (x < 1)
+        fun_l5_n317(x)
+    else
+        fun_l5_n604(x)
+    end
+end
+
+def fun_l4_n755(x)
+    if (x < 1)
+        fun_l5_n208(x)
+    else
+        fun_l5_n318(x)
+    end
+end
+
+def fun_l4_n756(x)
+    if (x < 1)
+        fun_l5_n986(x)
+    else
+        fun_l5_n83(x)
+    end
+end
+
+def fun_l4_n757(x)
+    if (x < 1)
+        fun_l5_n946(x)
+    else
+        fun_l5_n314(x)
+    end
+end
+
+def fun_l4_n758(x)
+    if (x < 1)
+        fun_l5_n571(x)
+    else
+        fun_l5_n919(x)
+    end
+end
+
+def fun_l4_n759(x)
+    if (x < 1)
+        fun_l5_n129(x)
+    else
+        fun_l5_n191(x)
+    end
+end
+
+def fun_l4_n760(x)
+    if (x < 1)
+        fun_l5_n838(x)
+    else
+        fun_l5_n29(x)
+    end
+end
+
+def fun_l4_n761(x)
+    if (x < 1)
+        fun_l5_n250(x)
+    else
+        fun_l5_n892(x)
+    end
+end
+
+def fun_l4_n762(x)
+    if (x < 1)
+        fun_l5_n588(x)
+    else
+        fun_l5_n59(x)
+    end
+end
+
+def fun_l4_n763(x)
+    if (x < 1)
+        fun_l5_n831(x)
+    else
+        fun_l5_n668(x)
+    end
+end
+
+def fun_l4_n764(x)
+    if (x < 1)
+        fun_l5_n337(x)
+    else
+        fun_l5_n514(x)
+    end
+end
+
+def fun_l4_n765(x)
+    if (x < 1)
+        fun_l5_n56(x)
+    else
+        fun_l5_n718(x)
+    end
+end
+
+def fun_l4_n766(x)
+    if (x < 1)
+        fun_l5_n189(x)
+    else
+        fun_l5_n103(x)
+    end
+end
+
+def fun_l4_n767(x)
+    if (x < 1)
+        fun_l5_n395(x)
+    else
+        fun_l5_n313(x)
+    end
+end
+
+def fun_l4_n768(x)
+    if (x < 1)
+        fun_l5_n388(x)
+    else
+        fun_l5_n757(x)
+    end
+end
+
+def fun_l4_n769(x)
+    if (x < 1)
+        fun_l5_n933(x)
+    else
+        fun_l5_n979(x)
+    end
+end
+
+def fun_l4_n770(x)
+    if (x < 1)
+        fun_l5_n765(x)
+    else
+        fun_l5_n472(x)
+    end
+end
+
+def fun_l4_n771(x)
+    if (x < 1)
+        fun_l5_n381(x)
+    else
+        fun_l5_n527(x)
+    end
+end
+
+def fun_l4_n772(x)
+    if (x < 1)
+        fun_l5_n314(x)
+    else
+        fun_l5_n990(x)
+    end
+end
+
+def fun_l4_n773(x)
+    if (x < 1)
+        fun_l5_n457(x)
+    else
+        fun_l5_n413(x)
+    end
+end
+
+def fun_l4_n774(x)
+    if (x < 1)
+        fun_l5_n245(x)
+    else
+        fun_l5_n85(x)
+    end
+end
+
+def fun_l4_n775(x)
+    if (x < 1)
+        fun_l5_n432(x)
+    else
+        fun_l5_n987(x)
+    end
+end
+
+def fun_l4_n776(x)
+    if (x < 1)
+        fun_l5_n588(x)
+    else
+        fun_l5_n352(x)
+    end
+end
+
+def fun_l4_n777(x)
+    if (x < 1)
+        fun_l5_n414(x)
+    else
+        fun_l5_n586(x)
+    end
+end
+
+def fun_l4_n778(x)
+    if (x < 1)
+        fun_l5_n290(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n779(x)
+    if (x < 1)
+        fun_l5_n324(x)
+    else
+        fun_l5_n918(x)
+    end
+end
+
+def fun_l4_n780(x)
+    if (x < 1)
+        fun_l5_n928(x)
+    else
+        fun_l5_n107(x)
+    end
+end
+
+def fun_l4_n781(x)
+    if (x < 1)
+        fun_l5_n244(x)
+    else
+        fun_l5_n434(x)
+    end
+end
+
+def fun_l4_n782(x)
+    if (x < 1)
+        fun_l5_n828(x)
+    else
+        fun_l5_n141(x)
+    end
+end
+
+def fun_l4_n783(x)
+    if (x < 1)
+        fun_l5_n634(x)
+    else
+        fun_l5_n206(x)
+    end
+end
+
+def fun_l4_n784(x)
+    if (x < 1)
+        fun_l5_n387(x)
+    else
+        fun_l5_n57(x)
+    end
+end
+
+def fun_l4_n785(x)
+    if (x < 1)
+        fun_l5_n731(x)
+    else
+        fun_l5_n670(x)
+    end
+end
+
+def fun_l4_n786(x)
+    if (x < 1)
+        fun_l5_n173(x)
+    else
+        fun_l5_n657(x)
+    end
+end
+
+def fun_l4_n787(x)
+    if (x < 1)
+        fun_l5_n661(x)
+    else
+        fun_l5_n286(x)
+    end
+end
+
+def fun_l4_n788(x)
+    if (x < 1)
+        fun_l5_n364(x)
+    else
+        fun_l5_n520(x)
+    end
+end
+
+def fun_l4_n789(x)
+    if (x < 1)
+        fun_l5_n545(x)
+    else
+        fun_l5_n417(x)
+    end
+end
+
+def fun_l4_n790(x)
+    if (x < 1)
+        fun_l5_n270(x)
+    else
+        fun_l5_n550(x)
+    end
+end
+
+def fun_l4_n791(x)
+    if (x < 1)
+        fun_l5_n873(x)
+    else
+        fun_l5_n321(x)
+    end
+end
+
+def fun_l4_n792(x)
+    if (x < 1)
+        fun_l5_n243(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n793(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n400(x)
+    end
+end
+
+def fun_l4_n794(x)
+    if (x < 1)
+        fun_l5_n670(x)
+    else
+        fun_l5_n535(x)
+    end
+end
+
+def fun_l4_n795(x)
+    if (x < 1)
+        fun_l5_n911(x)
+    else
+        fun_l5_n786(x)
+    end
+end
+
+def fun_l4_n796(x)
+    if (x < 1)
+        fun_l5_n247(x)
+    else
+        fun_l5_n775(x)
+    end
+end
+
+def fun_l4_n797(x)
+    if (x < 1)
+        fun_l5_n944(x)
+    else
+        fun_l5_n14(x)
+    end
+end
+
+def fun_l4_n798(x)
+    if (x < 1)
+        fun_l5_n57(x)
+    else
+        fun_l5_n644(x)
+    end
+end
+
+def fun_l4_n799(x)
+    if (x < 1)
+        fun_l5_n583(x)
+    else
+        fun_l5_n599(x)
+    end
+end
+
+def fun_l4_n800(x)
+    if (x < 1)
+        fun_l5_n685(x)
+    else
+        fun_l5_n366(x)
+    end
+end
+
+def fun_l4_n801(x)
+    if (x < 1)
+        fun_l5_n671(x)
+    else
+        fun_l5_n386(x)
+    end
+end
+
+def fun_l4_n802(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n403(x)
+    end
+end
+
+def fun_l4_n803(x)
+    if (x < 1)
+        fun_l5_n952(x)
+    else
+        fun_l5_n237(x)
+    end
+end
+
+def fun_l4_n804(x)
+    if (x < 1)
+        fun_l5_n929(x)
+    else
+        fun_l5_n737(x)
+    end
+end
+
+def fun_l4_n805(x)
+    if (x < 1)
+        fun_l5_n197(x)
+    else
+        fun_l5_n322(x)
+    end
+end
+
+def fun_l4_n806(x)
+    if (x < 1)
+        fun_l5_n966(x)
+    else
+        fun_l5_n531(x)
+    end
+end
+
+def fun_l4_n807(x)
+    if (x < 1)
+        fun_l5_n928(x)
+    else
+        fun_l5_n802(x)
+    end
+end
+
+def fun_l4_n808(x)
+    if (x < 1)
+        fun_l5_n34(x)
+    else
+        fun_l5_n107(x)
+    end
+end
+
+def fun_l4_n809(x)
+    if (x < 1)
+        fun_l5_n615(x)
+    else
+        fun_l5_n628(x)
+    end
+end
+
+def fun_l4_n810(x)
+    if (x < 1)
+        fun_l5_n187(x)
+    else
+        fun_l5_n424(x)
+    end
+end
+
+def fun_l4_n811(x)
+    if (x < 1)
+        fun_l5_n189(x)
+    else
+        fun_l5_n639(x)
+    end
+end
+
+def fun_l4_n812(x)
+    if (x < 1)
+        fun_l5_n177(x)
+    else
+        fun_l5_n580(x)
+    end
+end
+
+def fun_l4_n813(x)
+    if (x < 1)
+        fun_l5_n699(x)
+    else
+        fun_l5_n595(x)
+    end
+end
+
+def fun_l4_n814(x)
+    if (x < 1)
+        fun_l5_n44(x)
+    else
+        fun_l5_n966(x)
+    end
+end
+
+def fun_l4_n815(x)
+    if (x < 1)
+        fun_l5_n883(x)
+    else
+        fun_l5_n580(x)
+    end
+end
+
+def fun_l4_n816(x)
+    if (x < 1)
+        fun_l5_n306(x)
+    else
+        fun_l5_n564(x)
+    end
+end
+
+def fun_l4_n817(x)
+    if (x < 1)
+        fun_l5_n337(x)
+    else
+        fun_l5_n912(x)
+    end
+end
+
+def fun_l4_n818(x)
+    if (x < 1)
+        fun_l5_n36(x)
+    else
+        fun_l5_n164(x)
+    end
+end
+
+def fun_l4_n819(x)
+    if (x < 1)
+        fun_l5_n987(x)
+    else
+        fun_l5_n38(x)
+    end
+end
+
+def fun_l4_n820(x)
+    if (x < 1)
+        fun_l5_n656(x)
+    else
+        fun_l5_n647(x)
+    end
+end
+
+def fun_l4_n821(x)
+    if (x < 1)
+        fun_l5_n364(x)
+    else
+        fun_l5_n838(x)
+    end
+end
+
+def fun_l4_n822(x)
+    if (x < 1)
+        fun_l5_n301(x)
+    else
+        fun_l5_n850(x)
+    end
+end
+
+def fun_l4_n823(x)
+    if (x < 1)
+        fun_l5_n191(x)
+    else
+        fun_l5_n812(x)
+    end
+end
+
+def fun_l4_n824(x)
+    if (x < 1)
+        fun_l5_n148(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n825(x)
+    if (x < 1)
+        fun_l5_n315(x)
+    else
+        fun_l5_n763(x)
+    end
+end
+
+def fun_l4_n826(x)
+    if (x < 1)
+        fun_l5_n612(x)
+    else
+        fun_l5_n993(x)
+    end
+end
+
+def fun_l4_n827(x)
+    if (x < 1)
+        fun_l5_n229(x)
+    else
+        fun_l5_n388(x)
+    end
+end
+
+def fun_l4_n828(x)
+    if (x < 1)
+        fun_l5_n131(x)
+    else
+        fun_l5_n283(x)
+    end
+end
+
+def fun_l4_n829(x)
+    if (x < 1)
+        fun_l5_n59(x)
+    else
+        fun_l5_n280(x)
+    end
+end
+
+def fun_l4_n830(x)
+    if (x < 1)
+        fun_l5_n993(x)
+    else
+        fun_l5_n160(x)
+    end
+end
+
+def fun_l4_n831(x)
+    if (x < 1)
+        fun_l5_n394(x)
+    else
+        fun_l5_n528(x)
+    end
+end
+
+def fun_l4_n832(x)
+    if (x < 1)
+        fun_l5_n376(x)
+    else
+        fun_l5_n201(x)
+    end
+end
+
+def fun_l4_n833(x)
+    if (x < 1)
+        fun_l5_n890(x)
+    else
+        fun_l5_n867(x)
+    end
+end
+
+def fun_l4_n834(x)
+    if (x < 1)
+        fun_l5_n320(x)
+    else
+        fun_l5_n237(x)
+    end
+end
+
+def fun_l4_n835(x)
+    if (x < 1)
+        fun_l5_n771(x)
+    else
+        fun_l5_n83(x)
+    end
+end
+
+def fun_l4_n836(x)
+    if (x < 1)
+        fun_l5_n751(x)
+    else
+        fun_l5_n2(x)
+    end
+end
+
+def fun_l4_n837(x)
+    if (x < 1)
+        fun_l5_n825(x)
+    else
+        fun_l5_n930(x)
+    end
+end
+
+def fun_l4_n838(x)
+    if (x < 1)
+        fun_l5_n968(x)
+    else
+        fun_l5_n136(x)
+    end
+end
+
+def fun_l4_n839(x)
+    if (x < 1)
+        fun_l5_n529(x)
+    else
+        fun_l5_n626(x)
+    end
+end
+
+def fun_l4_n840(x)
+    if (x < 1)
+        fun_l5_n228(x)
+    else
+        fun_l5_n915(x)
+    end
+end
+
+def fun_l4_n841(x)
+    if (x < 1)
+        fun_l5_n270(x)
+    else
+        fun_l5_n813(x)
+    end
+end
+
+def fun_l4_n842(x)
+    if (x < 1)
+        fun_l5_n392(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n843(x)
+    if (x < 1)
+        fun_l5_n470(x)
+    else
+        fun_l5_n699(x)
+    end
+end
+
+def fun_l4_n844(x)
+    if (x < 1)
+        fun_l5_n68(x)
+    else
+        fun_l5_n163(x)
+    end
+end
+
+def fun_l4_n845(x)
+    if (x < 1)
+        fun_l5_n469(x)
+    else
+        fun_l5_n472(x)
+    end
+end
+
+def fun_l4_n846(x)
+    if (x < 1)
+        fun_l5_n640(x)
+    else
+        fun_l5_n311(x)
+    end
+end
+
+def fun_l4_n847(x)
+    if (x < 1)
+        fun_l5_n968(x)
+    else
+        fun_l5_n414(x)
+    end
+end
+
+def fun_l4_n848(x)
+    if (x < 1)
+        fun_l5_n111(x)
+    else
+        fun_l5_n340(x)
+    end
+end
+
+def fun_l4_n849(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n278(x)
+    end
+end
+
+def fun_l4_n850(x)
+    if (x < 1)
+        fun_l5_n353(x)
+    else
+        fun_l5_n590(x)
+    end
+end
+
+def fun_l4_n851(x)
+    if (x < 1)
+        fun_l5_n218(x)
+    else
+        fun_l5_n341(x)
+    end
+end
+
+def fun_l4_n852(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n273(x)
+    end
+end
+
+def fun_l4_n853(x)
+    if (x < 1)
+        fun_l5_n589(x)
+    else
+        fun_l5_n417(x)
+    end
+end
+
+def fun_l4_n854(x)
+    if (x < 1)
+        fun_l5_n411(x)
+    else
+        fun_l5_n848(x)
+    end
+end
+
+def fun_l4_n855(x)
+    if (x < 1)
+        fun_l5_n607(x)
+    else
+        fun_l5_n65(x)
+    end
+end
+
+def fun_l4_n856(x)
+    if (x < 1)
+        fun_l5_n240(x)
+    else
+        fun_l5_n24(x)
+    end
+end
+
+def fun_l4_n857(x)
+    if (x < 1)
+        fun_l5_n165(x)
+    else
+        fun_l5_n362(x)
+    end
+end
+
+def fun_l4_n858(x)
+    if (x < 1)
+        fun_l5_n559(x)
+    else
+        fun_l5_n253(x)
+    end
+end
+
+def fun_l4_n859(x)
+    if (x < 1)
+        fun_l5_n834(x)
+    else
+        fun_l5_n217(x)
+    end
+end
+
+def fun_l4_n860(x)
+    if (x < 1)
+        fun_l5_n891(x)
+    else
+        fun_l5_n369(x)
+    end
+end
+
+def fun_l4_n861(x)
+    if (x < 1)
+        fun_l5_n676(x)
+    else
+        fun_l5_n614(x)
+    end
+end
+
+def fun_l4_n862(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n318(x)
+    end
+end
+
+def fun_l4_n863(x)
+    if (x < 1)
+        fun_l5_n991(x)
+    else
+        fun_l5_n997(x)
+    end
+end
+
+def fun_l4_n864(x)
+    if (x < 1)
+        fun_l5_n842(x)
+    else
+        fun_l5_n370(x)
+    end
+end
+
+def fun_l4_n865(x)
+    if (x < 1)
+        fun_l5_n623(x)
+    else
+        fun_l5_n741(x)
+    end
+end
+
+def fun_l4_n866(x)
+    if (x < 1)
+        fun_l5_n58(x)
+    else
+        fun_l5_n953(x)
+    end
+end
+
+def fun_l4_n867(x)
+    if (x < 1)
+        fun_l5_n269(x)
+    else
+        fun_l5_n341(x)
+    end
+end
+
+def fun_l4_n868(x)
+    if (x < 1)
+        fun_l5_n814(x)
+    else
+        fun_l5_n849(x)
+    end
+end
+
+def fun_l4_n869(x)
+    if (x < 1)
+        fun_l5_n163(x)
+    else
+        fun_l5_n246(x)
+    end
+end
+
+def fun_l4_n870(x)
+    if (x < 1)
+        fun_l5_n739(x)
+    else
+        fun_l5_n524(x)
+    end
+end
+
+def fun_l4_n871(x)
+    if (x < 1)
+        fun_l5_n589(x)
+    else
+        fun_l5_n592(x)
+    end
+end
+
+def fun_l4_n872(x)
+    if (x < 1)
+        fun_l5_n922(x)
+    else
+        fun_l5_n401(x)
+    end
+end
+
+def fun_l4_n873(x)
+    if (x < 1)
+        fun_l5_n600(x)
+    else
+        fun_l5_n184(x)
+    end
+end
+
+def fun_l4_n874(x)
+    if (x < 1)
+        fun_l5_n424(x)
+    else
+        fun_l5_n627(x)
+    end
+end
+
+def fun_l4_n875(x)
+    if (x < 1)
+        fun_l5_n48(x)
+    else
+        fun_l5_n127(x)
+    end
+end
+
+def fun_l4_n876(x)
+    if (x < 1)
+        fun_l5_n687(x)
+    else
+        fun_l5_n451(x)
+    end
+end
+
+def fun_l4_n877(x)
+    if (x < 1)
+        fun_l5_n849(x)
+    else
+        fun_l5_n480(x)
+    end
+end
+
+def fun_l4_n878(x)
+    if (x < 1)
+        fun_l5_n801(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n879(x)
+    if (x < 1)
+        fun_l5_n964(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n880(x)
+    if (x < 1)
+        fun_l5_n483(x)
+    else
+        fun_l5_n817(x)
+    end
+end
+
+def fun_l4_n881(x)
+    if (x < 1)
+        fun_l5_n91(x)
+    else
+        fun_l5_n776(x)
+    end
+end
+
+def fun_l4_n882(x)
+    if (x < 1)
+        fun_l5_n8(x)
+    else
+        fun_l5_n726(x)
+    end
+end
+
+def fun_l4_n883(x)
+    if (x < 1)
+        fun_l5_n63(x)
+    else
+        fun_l5_n570(x)
+    end
+end
+
+def fun_l4_n884(x)
+    if (x < 1)
+        fun_l5_n691(x)
+    else
+        fun_l5_n117(x)
+    end
+end
+
+def fun_l4_n885(x)
+    if (x < 1)
+        fun_l5_n262(x)
+    else
+        fun_l5_n38(x)
+    end
+end
+
+def fun_l4_n886(x)
+    if (x < 1)
+        fun_l5_n678(x)
+    else
+        fun_l5_n108(x)
+    end
+end
+
+def fun_l4_n887(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n751(x)
+    end
+end
+
+def fun_l4_n888(x)
+    if (x < 1)
+        fun_l5_n917(x)
+    else
+        fun_l5_n769(x)
+    end
+end
+
+def fun_l4_n889(x)
+    if (x < 1)
+        fun_l5_n191(x)
+    else
+        fun_l5_n662(x)
+    end
+end
+
+def fun_l4_n890(x)
+    if (x < 1)
+        fun_l5_n34(x)
+    else
+        fun_l5_n806(x)
+    end
+end
+
+def fun_l4_n891(x)
+    if (x < 1)
+        fun_l5_n705(x)
+    else
+        fun_l5_n198(x)
+    end
+end
+
+def fun_l4_n892(x)
+    if (x < 1)
+        fun_l5_n647(x)
+    else
+        fun_l5_n0(x)
+    end
+end
+
+def fun_l4_n893(x)
+    if (x < 1)
+        fun_l5_n336(x)
+    else
+        fun_l5_n795(x)
+    end
+end
+
+def fun_l4_n894(x)
+    if (x < 1)
+        fun_l5_n984(x)
+    else
+        fun_l5_n751(x)
+    end
+end
+
+def fun_l4_n895(x)
+    if (x < 1)
+        fun_l5_n373(x)
+    else
+        fun_l5_n12(x)
+    end
+end
+
+def fun_l4_n896(x)
+    if (x < 1)
+        fun_l5_n672(x)
+    else
+        fun_l5_n17(x)
+    end
+end
+
+def fun_l4_n897(x)
+    if (x < 1)
+        fun_l5_n67(x)
+    else
+        fun_l5_n183(x)
+    end
+end
+
+def fun_l4_n898(x)
+    if (x < 1)
+        fun_l5_n557(x)
+    else
+        fun_l5_n43(x)
+    end
+end
+
+def fun_l4_n899(x)
+    if (x < 1)
+        fun_l5_n210(x)
+    else
+        fun_l5_n904(x)
+    end
+end
+
+def fun_l4_n900(x)
+    if (x < 1)
+        fun_l5_n665(x)
+    else
+        fun_l5_n173(x)
+    end
+end
+
+def fun_l4_n901(x)
+    if (x < 1)
+        fun_l5_n268(x)
+    else
+        fun_l5_n907(x)
+    end
+end
+
+def fun_l4_n902(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n145(x)
+    end
+end
+
+def fun_l4_n903(x)
+    if (x < 1)
+        fun_l5_n158(x)
+    else
+        fun_l5_n261(x)
+    end
+end
+
+def fun_l4_n904(x)
+    if (x < 1)
+        fun_l5_n677(x)
+    else
+        fun_l5_n880(x)
+    end
+end
+
+def fun_l4_n905(x)
+    if (x < 1)
+        fun_l5_n262(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n906(x)
+    if (x < 1)
+        fun_l5_n775(x)
+    else
+        fun_l5_n785(x)
+    end
+end
+
+def fun_l4_n907(x)
+    if (x < 1)
+        fun_l5_n629(x)
+    else
+        fun_l5_n312(x)
+    end
+end
+
+def fun_l4_n908(x)
+    if (x < 1)
+        fun_l5_n84(x)
+    else
+        fun_l5_n605(x)
+    end
+end
+
+def fun_l4_n909(x)
+    if (x < 1)
+        fun_l5_n346(x)
+    else
+        fun_l5_n245(x)
+    end
+end
+
+def fun_l4_n910(x)
+    if (x < 1)
+        fun_l5_n768(x)
+    else
+        fun_l5_n47(x)
+    end
+end
+
+def fun_l4_n911(x)
+    if (x < 1)
+        fun_l5_n48(x)
+    else
+        fun_l5_n406(x)
+    end
+end
+
+def fun_l4_n912(x)
+    if (x < 1)
+        fun_l5_n493(x)
+    else
+        fun_l5_n608(x)
+    end
+end
+
+def fun_l4_n913(x)
+    if (x < 1)
+        fun_l5_n456(x)
+    else
+        fun_l5_n176(x)
+    end
+end
+
+def fun_l4_n914(x)
+    if (x < 1)
+        fun_l5_n201(x)
+    else
+        fun_l5_n233(x)
+    end
+end
+
+def fun_l4_n915(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n790(x)
+    end
+end
+
+def fun_l4_n916(x)
+    if (x < 1)
+        fun_l5_n734(x)
+    else
+        fun_l5_n685(x)
+    end
+end
+
+def fun_l4_n917(x)
+    if (x < 1)
+        fun_l5_n132(x)
+    else
+        fun_l5_n112(x)
+    end
+end
+
+def fun_l4_n918(x)
+    if (x < 1)
+        fun_l5_n897(x)
+    else
+        fun_l5_n196(x)
+    end
+end
+
+def fun_l4_n919(x)
+    if (x < 1)
+        fun_l5_n395(x)
+    else
+        fun_l5_n186(x)
+    end
+end
+
+def fun_l4_n920(x)
+    if (x < 1)
+        fun_l5_n19(x)
+    else
+        fun_l5_n810(x)
+    end
+end
+
+def fun_l4_n921(x)
+    if (x < 1)
+        fun_l5_n546(x)
+    else
+        fun_l5_n34(x)
+    end
+end
+
+def fun_l4_n922(x)
+    if (x < 1)
+        fun_l5_n863(x)
+    else
+        fun_l5_n928(x)
+    end
+end
+
+def fun_l4_n923(x)
+    if (x < 1)
+        fun_l5_n485(x)
+    else
+        fun_l5_n182(x)
+    end
+end
+
+def fun_l4_n924(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n17(x)
+    end
+end
+
+def fun_l4_n925(x)
+    if (x < 1)
+        fun_l5_n78(x)
+    else
+        fun_l5_n816(x)
+    end
+end
+
+def fun_l4_n926(x)
+    if (x < 1)
+        fun_l5_n797(x)
+    else
+        fun_l5_n761(x)
+    end
+end
+
+def fun_l4_n927(x)
+    if (x < 1)
+        fun_l5_n975(x)
+    else
+        fun_l5_n220(x)
+    end
+end
+
+def fun_l4_n928(x)
+    if (x < 1)
+        fun_l5_n213(x)
+    else
+        fun_l5_n815(x)
+    end
+end
+
+def fun_l4_n929(x)
+    if (x < 1)
+        fun_l5_n280(x)
+    else
+        fun_l5_n551(x)
+    end
+end
+
+def fun_l4_n930(x)
+    if (x < 1)
+        fun_l5_n631(x)
+    else
+        fun_l5_n629(x)
+    end
+end
+
+def fun_l4_n931(x)
+    if (x < 1)
+        fun_l5_n60(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n932(x)
+    if (x < 1)
+        fun_l5_n336(x)
+    else
+        fun_l5_n733(x)
+    end
+end
+
+def fun_l4_n933(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n48(x)
+    end
+end
+
+def fun_l4_n934(x)
+    if (x < 1)
+        fun_l5_n527(x)
+    else
+        fun_l5_n108(x)
+    end
+end
+
+def fun_l4_n935(x)
+    if (x < 1)
+        fun_l5_n994(x)
+    else
+        fun_l5_n95(x)
+    end
+end
+
+def fun_l4_n936(x)
+    if (x < 1)
+        fun_l5_n631(x)
+    else
+        fun_l5_n310(x)
+    end
+end
+
+def fun_l4_n937(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n380(x)
+    end
+end
+
+def fun_l4_n938(x)
+    if (x < 1)
+        fun_l5_n256(x)
+    else
+        fun_l5_n231(x)
+    end
+end
+
+def fun_l4_n939(x)
+    if (x < 1)
+        fun_l5_n686(x)
+    else
+        fun_l5_n557(x)
+    end
+end
+
+def fun_l4_n940(x)
+    if (x < 1)
+        fun_l5_n311(x)
+    else
+        fun_l5_n611(x)
+    end
+end
+
+def fun_l4_n941(x)
+    if (x < 1)
+        fun_l5_n770(x)
+    else
+        fun_l5_n306(x)
+    end
+end
+
+def fun_l4_n942(x)
+    if (x < 1)
+        fun_l5_n649(x)
+    else
+        fun_l5_n60(x)
+    end
+end
+
+def fun_l4_n943(x)
+    if (x < 1)
+        fun_l5_n935(x)
+    else
+        fun_l5_n991(x)
+    end
+end
+
+def fun_l4_n944(x)
+    if (x < 1)
+        fun_l5_n851(x)
+    else
+        fun_l5_n131(x)
+    end
+end
+
+def fun_l4_n945(x)
+    if (x < 1)
+        fun_l5_n422(x)
+    else
+        fun_l5_n309(x)
+    end
+end
+
+def fun_l4_n946(x)
+    if (x < 1)
+        fun_l5_n906(x)
+    else
+        fun_l5_n798(x)
+    end
+end
+
+def fun_l4_n947(x)
+    if (x < 1)
+        fun_l5_n817(x)
+    else
+        fun_l5_n122(x)
+    end
+end
+
+def fun_l4_n948(x)
+    if (x < 1)
+        fun_l5_n233(x)
+    else
+        fun_l5_n600(x)
+    end
+end
+
+def fun_l4_n949(x)
+    if (x < 1)
+        fun_l5_n908(x)
+    else
+        fun_l5_n332(x)
+    end
+end
+
+def fun_l4_n950(x)
+    if (x < 1)
+        fun_l5_n71(x)
+    else
+        fun_l5_n893(x)
+    end
+end
+
+def fun_l4_n951(x)
+    if (x < 1)
+        fun_l5_n281(x)
+    else
+        fun_l5_n281(x)
+    end
+end
+
+def fun_l4_n952(x)
+    if (x < 1)
+        fun_l5_n312(x)
+    else
+        fun_l5_n164(x)
+    end
+end
+
+def fun_l4_n953(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n993(x)
+    end
+end
+
+def fun_l4_n954(x)
+    if (x < 1)
+        fun_l5_n271(x)
+    else
+        fun_l5_n635(x)
+    end
+end
+
+def fun_l4_n955(x)
+    if (x < 1)
+        fun_l5_n10(x)
+    else
+        fun_l5_n202(x)
+    end
+end
+
+def fun_l4_n956(x)
+    if (x < 1)
+        fun_l5_n574(x)
+    else
+        fun_l5_n29(x)
+    end
+end
+
+def fun_l4_n957(x)
+    if (x < 1)
+        fun_l5_n154(x)
+    else
+        fun_l5_n96(x)
+    end
+end
+
+def fun_l4_n958(x)
+    if (x < 1)
+        fun_l5_n287(x)
+    else
+        fun_l5_n509(x)
+    end
+end
+
+def fun_l4_n959(x)
+    if (x < 1)
+        fun_l5_n400(x)
+    else
+        fun_l5_n195(x)
+    end
+end
+
+def fun_l4_n960(x)
+    if (x < 1)
+        fun_l5_n94(x)
+    else
+        fun_l5_n165(x)
+    end
+end
+
+def fun_l4_n961(x)
+    if (x < 1)
+        fun_l5_n276(x)
+    else
+        fun_l5_n935(x)
+    end
+end
+
+def fun_l4_n962(x)
+    if (x < 1)
+        fun_l5_n504(x)
+    else
+        fun_l5_n480(x)
+    end
+end
+
+def fun_l4_n963(x)
+    if (x < 1)
+        fun_l5_n152(x)
+    else
+        fun_l5_n397(x)
+    end
+end
+
+def fun_l4_n964(x)
+    if (x < 1)
+        fun_l5_n303(x)
+    else
+        fun_l5_n481(x)
+    end
+end
+
+def fun_l4_n965(x)
+    if (x < 1)
+        fun_l5_n882(x)
+    else
+        fun_l5_n116(x)
+    end
+end
+
+def fun_l4_n966(x)
+    if (x < 1)
+        fun_l5_n329(x)
+    else
+        fun_l5_n484(x)
+    end
+end
+
+def fun_l4_n967(x)
+    if (x < 1)
+        fun_l5_n369(x)
+    else
+        fun_l5_n680(x)
+    end
+end
+
+def fun_l4_n968(x)
+    if (x < 1)
+        fun_l5_n30(x)
+    else
+        fun_l5_n653(x)
+    end
+end
+
+def fun_l4_n969(x)
+    if (x < 1)
+        fun_l5_n292(x)
+    else
+        fun_l5_n793(x)
+    end
+end
+
+def fun_l4_n970(x)
+    if (x < 1)
+        fun_l5_n796(x)
+    else
+        fun_l5_n387(x)
+    end
+end
+
+def fun_l4_n971(x)
+    if (x < 1)
+        fun_l5_n735(x)
+    else
+        fun_l5_n985(x)
+    end
+end
+
+def fun_l4_n972(x)
+    if (x < 1)
+        fun_l5_n925(x)
+    else
+        fun_l5_n689(x)
+    end
+end
+
+def fun_l4_n973(x)
+    if (x < 1)
+        fun_l5_n154(x)
+    else
+        fun_l5_n998(x)
+    end
+end
+
+def fun_l4_n974(x)
+    if (x < 1)
+        fun_l5_n708(x)
+    else
+        fun_l5_n253(x)
+    end
+end
+
+def fun_l4_n975(x)
+    if (x < 1)
+        fun_l5_n716(x)
+    else
+        fun_l5_n958(x)
+    end
+end
+
+def fun_l4_n976(x)
+    if (x < 1)
+        fun_l5_n488(x)
+    else
+        fun_l5_n299(x)
+    end
+end
+
+def fun_l4_n977(x)
+    if (x < 1)
+        fun_l5_n872(x)
+    else
+        fun_l5_n276(x)
+    end
+end
+
+def fun_l4_n978(x)
+    if (x < 1)
+        fun_l5_n219(x)
+    else
+        fun_l5_n76(x)
+    end
+end
+
+def fun_l4_n979(x)
+    if (x < 1)
+        fun_l5_n937(x)
+    else
+        fun_l5_n988(x)
+    end
+end
+
+def fun_l4_n980(x)
+    if (x < 1)
+        fun_l5_n681(x)
+    else
+        fun_l5_n264(x)
+    end
+end
+
+def fun_l4_n981(x)
+    if (x < 1)
+        fun_l5_n630(x)
+    else
+        fun_l5_n18(x)
+    end
+end
+
+def fun_l4_n982(x)
+    if (x < 1)
+        fun_l5_n910(x)
+    else
+        fun_l5_n97(x)
+    end
+end
+
+def fun_l4_n983(x)
+    if (x < 1)
+        fun_l5_n551(x)
+    else
+        fun_l5_n429(x)
+    end
+end
+
+def fun_l4_n984(x)
+    if (x < 1)
+        fun_l5_n304(x)
+    else
+        fun_l5_n192(x)
+    end
+end
+
+def fun_l4_n985(x)
+    if (x < 1)
+        fun_l5_n696(x)
+    else
+        fun_l5_n124(x)
+    end
+end
+
+def fun_l4_n986(x)
+    if (x < 1)
+        fun_l5_n603(x)
+    else
+        fun_l5_n967(x)
+    end
+end
+
+def fun_l4_n987(x)
+    if (x < 1)
+        fun_l5_n317(x)
+    else
+        fun_l5_n785(x)
+    end
+end
+
+def fun_l4_n988(x)
+    if (x < 1)
+        fun_l5_n762(x)
+    else
+        fun_l5_n999(x)
+    end
+end
+
+def fun_l4_n989(x)
+    if (x < 1)
+        fun_l5_n61(x)
+    else
+        fun_l5_n474(x)
+    end
+end
+
+def fun_l4_n990(x)
+    if (x < 1)
+        fun_l5_n465(x)
+    else
+        fun_l5_n878(x)
+    end
+end
+
+def fun_l4_n991(x)
+    if (x < 1)
+        fun_l5_n907(x)
+    else
+        fun_l5_n259(x)
+    end
+end
+
+def fun_l4_n992(x)
+    if (x < 1)
+        fun_l5_n594(x)
+    else
+        fun_l5_n378(x)
+    end
+end
+
+def fun_l4_n993(x)
+    if (x < 1)
+        fun_l5_n202(x)
+    else
+        fun_l5_n490(x)
+    end
+end
+
+def fun_l4_n994(x)
+    if (x < 1)
+        fun_l5_n105(x)
+    else
+        fun_l5_n675(x)
+    end
+end
+
+def fun_l4_n995(x)
+    if (x < 1)
+        fun_l5_n99(x)
+    else
+        fun_l5_n21(x)
+    end
+end
+
+def fun_l4_n996(x)
+    if (x < 1)
+        fun_l5_n831(x)
+    else
+        fun_l5_n692(x)
+    end
+end
+
+def fun_l4_n997(x)
+    if (x < 1)
+        fun_l5_n186(x)
+    else
+        fun_l5_n427(x)
+    end
+end
+
+def fun_l4_n998(x)
+    if (x < 1)
+        fun_l5_n597(x)
+    else
+        fun_l5_n978(x)
+    end
+end
+
+def fun_l4_n999(x)
+    if (x < 1)
+        fun_l5_n537(x)
+    else
+        fun_l5_n952(x)
+    end
+end
+
+def fun_l5_n0(x)
+    if (x < 1)
+        fun_l6_n104(x)
+    else
+        fun_l6_n249(x)
+    end
+end
+
+def fun_l5_n1(x)
+    if (x < 1)
+        fun_l6_n260(x)
+    else
+        fun_l6_n782(x)
+    end
+end
+
+def fun_l5_n2(x)
+    if (x < 1)
+        fun_l6_n974(x)
+    else
+        fun_l6_n301(x)
+    end
+end
+
+def fun_l5_n3(x)
+    if (x < 1)
+        fun_l6_n883(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n4(x)
+    if (x < 1)
+        fun_l6_n134(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n5(x)
+    if (x < 1)
+        fun_l6_n573(x)
+    else
+        fun_l6_n273(x)
+    end
+end
+
+def fun_l5_n6(x)
+    if (x < 1)
+        fun_l6_n221(x)
+    else
+        fun_l6_n843(x)
+    end
+end
+
+def fun_l5_n7(x)
+    if (x < 1)
+        fun_l6_n572(x)
+    else
+        fun_l6_n435(x)
+    end
+end
+
+def fun_l5_n8(x)
+    if (x < 1)
+        fun_l6_n43(x)
+    else
+        fun_l6_n598(x)
+    end
+end
+
+def fun_l5_n9(x)
+    if (x < 1)
+        fun_l6_n352(x)
+    else
+        fun_l6_n894(x)
+    end
+end
+
+def fun_l5_n10(x)
+    if (x < 1)
+        fun_l6_n161(x)
+    else
+        fun_l6_n654(x)
+    end
+end
+
+def fun_l5_n11(x)
+    if (x < 1)
+        fun_l6_n432(x)
+    else
+        fun_l6_n825(x)
+    end
+end
+
+def fun_l5_n12(x)
+    if (x < 1)
+        fun_l6_n863(x)
+    else
+        fun_l6_n940(x)
+    end
+end
+
+def fun_l5_n13(x)
+    if (x < 1)
+        fun_l6_n478(x)
+    else
+        fun_l6_n193(x)
+    end
+end
+
+def fun_l5_n14(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n808(x)
+    end
+end
+
+def fun_l5_n15(x)
+    if (x < 1)
+        fun_l6_n86(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n16(x)
+    if (x < 1)
+        fun_l6_n492(x)
+    else
+        fun_l6_n704(x)
+    end
+end
+
+def fun_l5_n17(x)
+    if (x < 1)
+        fun_l6_n196(x)
+    else
+        fun_l6_n970(x)
+    end
+end
+
+def fun_l5_n18(x)
+    if (x < 1)
+        fun_l6_n325(x)
+    else
+        fun_l6_n30(x)
+    end
+end
+
+def fun_l5_n19(x)
+    if (x < 1)
+        fun_l6_n559(x)
+    else
+        fun_l6_n269(x)
+    end
+end
+
+def fun_l5_n20(x)
+    if (x < 1)
+        fun_l6_n716(x)
+    else
+        fun_l6_n783(x)
+    end
+end
+
+def fun_l5_n21(x)
+    if (x < 1)
+        fun_l6_n978(x)
+    else
+        fun_l6_n306(x)
+    end
+end
+
+def fun_l5_n22(x)
+    if (x < 1)
+        fun_l6_n220(x)
+    else
+        fun_l6_n823(x)
+    end
+end
+
+def fun_l5_n23(x)
+    if (x < 1)
+        fun_l6_n675(x)
+    else
+        fun_l6_n684(x)
+    end
+end
+
+def fun_l5_n24(x)
+    if (x < 1)
+        fun_l6_n851(x)
+    else
+        fun_l6_n450(x)
+    end
+end
+
+def fun_l5_n25(x)
+    if (x < 1)
+        fun_l6_n745(x)
+    else
+        fun_l6_n370(x)
+    end
+end
+
+def fun_l5_n26(x)
+    if (x < 1)
+        fun_l6_n431(x)
+    else
+        fun_l6_n130(x)
+    end
+end
+
+def fun_l5_n27(x)
+    if (x < 1)
+        fun_l6_n105(x)
+    else
+        fun_l6_n205(x)
+    end
+end
+
+def fun_l5_n28(x)
+    if (x < 1)
+        fun_l6_n718(x)
+    else
+        fun_l6_n742(x)
+    end
+end
+
+def fun_l5_n29(x)
+    if (x < 1)
+        fun_l6_n977(x)
+    else
+        fun_l6_n63(x)
+    end
+end
+
+def fun_l5_n30(x)
+    if (x < 1)
+        fun_l6_n902(x)
+    else
+        fun_l6_n471(x)
+    end
+end
+
+def fun_l5_n31(x)
+    if (x < 1)
+        fun_l6_n76(x)
+    else
+        fun_l6_n960(x)
+    end
+end
+
+def fun_l5_n32(x)
+    if (x < 1)
+        fun_l6_n75(x)
+    else
+        fun_l6_n640(x)
+    end
+end
+
+def fun_l5_n33(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n769(x)
+    end
+end
+
+def fun_l5_n34(x)
+    if (x < 1)
+        fun_l6_n201(x)
+    else
+        fun_l6_n771(x)
+    end
+end
+
+def fun_l5_n35(x)
+    if (x < 1)
+        fun_l6_n734(x)
+    else
+        fun_l6_n370(x)
+    end
+end
+
+def fun_l5_n36(x)
+    if (x < 1)
+        fun_l6_n490(x)
+    else
+        fun_l6_n994(x)
+    end
+end
+
+def fun_l5_n37(x)
+    if (x < 1)
+        fun_l6_n566(x)
+    else
+        fun_l6_n392(x)
+    end
+end
+
+def fun_l5_n38(x)
+    if (x < 1)
+        fun_l6_n120(x)
+    else
+        fun_l6_n774(x)
+    end
+end
+
+def fun_l5_n39(x)
+    if (x < 1)
+        fun_l6_n402(x)
+    else
+        fun_l6_n572(x)
+    end
+end
+
+def fun_l5_n40(x)
+    if (x < 1)
+        fun_l6_n911(x)
+    else
+        fun_l6_n968(x)
+    end
+end
+
+def fun_l5_n41(x)
+    if (x < 1)
+        fun_l6_n200(x)
+    else
+        fun_l6_n656(x)
+    end
+end
+
+def fun_l5_n42(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n426(x)
+    end
+end
+
+def fun_l5_n43(x)
+    if (x < 1)
+        fun_l6_n650(x)
+    else
+        fun_l6_n932(x)
+    end
+end
+
+def fun_l5_n44(x)
+    if (x < 1)
+        fun_l6_n365(x)
+    else
+        fun_l6_n755(x)
+    end
+end
+
+def fun_l5_n45(x)
+    if (x < 1)
+        fun_l6_n738(x)
+    else
+        fun_l6_n432(x)
+    end
+end
+
+def fun_l5_n46(x)
+    if (x < 1)
+        fun_l6_n82(x)
+    else
+        fun_l6_n484(x)
+    end
+end
+
+def fun_l5_n47(x)
+    if (x < 1)
+        fun_l6_n64(x)
+    else
+        fun_l6_n610(x)
+    end
+end
+
+def fun_l5_n48(x)
+    if (x < 1)
+        fun_l6_n875(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n49(x)
+    if (x < 1)
+        fun_l6_n798(x)
+    else
+        fun_l6_n57(x)
+    end
+end
+
+def fun_l5_n50(x)
+    if (x < 1)
+        fun_l6_n76(x)
+    else
+        fun_l6_n462(x)
+    end
+end
+
+def fun_l5_n51(x)
+    if (x < 1)
+        fun_l6_n225(x)
+    else
+        fun_l6_n526(x)
+    end
+end
+
+def fun_l5_n52(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n167(x)
+    end
+end
+
+def fun_l5_n53(x)
+    if (x < 1)
+        fun_l6_n270(x)
+    else
+        fun_l6_n821(x)
+    end
+end
+
+def fun_l5_n54(x)
+    if (x < 1)
+        fun_l6_n790(x)
+    else
+        fun_l6_n95(x)
+    end
+end
+
+def fun_l5_n55(x)
+    if (x < 1)
+        fun_l6_n38(x)
+    else
+        fun_l6_n32(x)
+    end
+end
+
+def fun_l5_n56(x)
+    if (x < 1)
+        fun_l6_n400(x)
+    else
+        fun_l6_n513(x)
+    end
+end
+
+def fun_l5_n57(x)
+    if (x < 1)
+        fun_l6_n251(x)
+    else
+        fun_l6_n16(x)
+    end
+end
+
+def fun_l5_n58(x)
+    if (x < 1)
+        fun_l6_n303(x)
+    else
+        fun_l6_n858(x)
+    end
+end
+
+def fun_l5_n59(x)
+    if (x < 1)
+        fun_l6_n173(x)
+    else
+        fun_l6_n38(x)
+    end
+end
+
+def fun_l5_n60(x)
+    if (x < 1)
+        fun_l6_n466(x)
+    else
+        fun_l6_n64(x)
+    end
+end
+
+def fun_l5_n61(x)
+    if (x < 1)
+        fun_l6_n687(x)
+    else
+        fun_l6_n208(x)
+    end
+end
+
+def fun_l5_n62(x)
+    if (x < 1)
+        fun_l6_n891(x)
+    else
+        fun_l6_n789(x)
+    end
+end
+
+def fun_l5_n63(x)
+    if (x < 1)
+        fun_l6_n664(x)
+    else
+        fun_l6_n133(x)
+    end
+end
+
+def fun_l5_n64(x)
+    if (x < 1)
+        fun_l6_n121(x)
+    else
+        fun_l6_n989(x)
+    end
+end
+
+def fun_l5_n65(x)
+    if (x < 1)
+        fun_l6_n411(x)
+    else
+        fun_l6_n264(x)
+    end
+end
+
+def fun_l5_n66(x)
+    if (x < 1)
+        fun_l6_n528(x)
+    else
+        fun_l6_n662(x)
+    end
+end
+
+def fun_l5_n67(x)
+    if (x < 1)
+        fun_l6_n824(x)
+    else
+        fun_l6_n410(x)
+    end
+end
+
+def fun_l5_n68(x)
+    if (x < 1)
+        fun_l6_n29(x)
+    else
+        fun_l6_n946(x)
+    end
+end
+
+def fun_l5_n69(x)
+    if (x < 1)
+        fun_l6_n566(x)
+    else
+        fun_l6_n797(x)
+    end
+end
+
+def fun_l5_n70(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n71(x)
+    if (x < 1)
+        fun_l6_n920(x)
+    else
+        fun_l6_n44(x)
+    end
+end
+
+def fun_l5_n72(x)
+    if (x < 1)
+        fun_l6_n725(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n73(x)
+    if (x < 1)
+        fun_l6_n406(x)
+    else
+        fun_l6_n555(x)
+    end
+end
+
+def fun_l5_n74(x)
+    if (x < 1)
+        fun_l6_n527(x)
+    else
+        fun_l6_n991(x)
+    end
+end
+
+def fun_l5_n75(x)
+    if (x < 1)
+        fun_l6_n46(x)
+    else
+        fun_l6_n440(x)
+    end
+end
+
+def fun_l5_n76(x)
+    if (x < 1)
+        fun_l6_n242(x)
+    else
+        fun_l6_n488(x)
+    end
+end
+
+def fun_l5_n77(x)
+    if (x < 1)
+        fun_l6_n211(x)
+    else
+        fun_l6_n760(x)
+    end
+end
+
+def fun_l5_n78(x)
+    if (x < 1)
+        fun_l6_n821(x)
+    else
+        fun_l6_n653(x)
+    end
+end
+
+def fun_l5_n79(x)
+    if (x < 1)
+        fun_l6_n559(x)
+    else
+        fun_l6_n425(x)
+    end
+end
+
+def fun_l5_n80(x)
+    if (x < 1)
+        fun_l6_n792(x)
+    else
+        fun_l6_n813(x)
+    end
+end
+
+def fun_l5_n81(x)
+    if (x < 1)
+        fun_l6_n463(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n82(x)
+    if (x < 1)
+        fun_l6_n731(x)
+    else
+        fun_l6_n718(x)
+    end
+end
+
+def fun_l5_n83(x)
+    if (x < 1)
+        fun_l6_n377(x)
+    else
+        fun_l6_n137(x)
+    end
+end
+
+def fun_l5_n84(x)
+    if (x < 1)
+        fun_l6_n829(x)
+    else
+        fun_l6_n77(x)
+    end
+end
+
+def fun_l5_n85(x)
+    if (x < 1)
+        fun_l6_n714(x)
+    else
+        fun_l6_n682(x)
+    end
+end
+
+def fun_l5_n86(x)
+    if (x < 1)
+        fun_l6_n47(x)
+    else
+        fun_l6_n527(x)
+    end
+end
+
+def fun_l5_n87(x)
+    if (x < 1)
+        fun_l6_n976(x)
+    else
+        fun_l6_n18(x)
+    end
+end
+
+def fun_l5_n88(x)
+    if (x < 1)
+        fun_l6_n710(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n89(x)
+    if (x < 1)
+        fun_l6_n222(x)
+    else
+        fun_l6_n97(x)
+    end
+end
+
+def fun_l5_n90(x)
+    if (x < 1)
+        fun_l6_n862(x)
+    else
+        fun_l6_n627(x)
+    end
+end
+
+def fun_l5_n91(x)
+    if (x < 1)
+        fun_l6_n642(x)
+    else
+        fun_l6_n720(x)
+    end
+end
+
+def fun_l5_n92(x)
+    if (x < 1)
+        fun_l6_n444(x)
+    else
+        fun_l6_n506(x)
+    end
+end
+
+def fun_l5_n93(x)
+    if (x < 1)
+        fun_l6_n776(x)
+    else
+        fun_l6_n879(x)
+    end
+end
+
+def fun_l5_n94(x)
+    if (x < 1)
+        fun_l6_n629(x)
+    else
+        fun_l6_n322(x)
+    end
+end
+
+def fun_l5_n95(x)
+    if (x < 1)
+        fun_l6_n119(x)
+    else
+        fun_l6_n134(x)
+    end
+end
+
+def fun_l5_n96(x)
+    if (x < 1)
+        fun_l6_n385(x)
+    else
+        fun_l6_n343(x)
+    end
+end
+
+def fun_l5_n97(x)
+    if (x < 1)
+        fun_l6_n110(x)
+    else
+        fun_l6_n323(x)
+    end
+end
+
+def fun_l5_n98(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n762(x)
+    end
+end
+
+def fun_l5_n99(x)
+    if (x < 1)
+        fun_l6_n811(x)
+    else
+        fun_l6_n404(x)
+    end
+end
+
+def fun_l5_n100(x)
+    if (x < 1)
+        fun_l6_n893(x)
+    else
+        fun_l6_n120(x)
+    end
+end
+
+def fun_l5_n101(x)
+    if (x < 1)
+        fun_l6_n755(x)
+    else
+        fun_l6_n611(x)
+    end
+end
+
+def fun_l5_n102(x)
+    if (x < 1)
+        fun_l6_n65(x)
+    else
+        fun_l6_n897(x)
+    end
+end
+
+def fun_l5_n103(x)
+    if (x < 1)
+        fun_l6_n629(x)
+    else
+        fun_l6_n214(x)
+    end
+end
+
+def fun_l5_n104(x)
+    if (x < 1)
+        fun_l6_n211(x)
+    else
+        fun_l6_n179(x)
+    end
+end
+
+def fun_l5_n105(x)
+    if (x < 1)
+        fun_l6_n650(x)
+    else
+        fun_l6_n348(x)
+    end
+end
+
+def fun_l5_n106(x)
+    if (x < 1)
+        fun_l6_n966(x)
+    else
+        fun_l6_n654(x)
+    end
+end
+
+def fun_l5_n107(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n668(x)
+    end
+end
+
+def fun_l5_n108(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n629(x)
+    end
+end
+
+def fun_l5_n109(x)
+    if (x < 1)
+        fun_l6_n96(x)
+    else
+        fun_l6_n578(x)
+    end
+end
+
+def fun_l5_n110(x)
+    if (x < 1)
+        fun_l6_n88(x)
+    else
+        fun_l6_n214(x)
+    end
+end
+
+def fun_l5_n111(x)
+    if (x < 1)
+        fun_l6_n622(x)
+    else
+        fun_l6_n180(x)
+    end
+end
+
+def fun_l5_n112(x)
+    if (x < 1)
+        fun_l6_n100(x)
+    else
+        fun_l6_n373(x)
+    end
+end
+
+def fun_l5_n113(x)
+    if (x < 1)
+        fun_l6_n464(x)
+    else
+        fun_l6_n30(x)
+    end
+end
+
+def fun_l5_n114(x)
+    if (x < 1)
+        fun_l6_n703(x)
+    else
+        fun_l6_n116(x)
+    end
+end
+
+def fun_l5_n115(x)
+    if (x < 1)
+        fun_l6_n63(x)
+    else
+        fun_l6_n260(x)
+    end
+end
+
+def fun_l5_n116(x)
+    if (x < 1)
+        fun_l6_n935(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n117(x)
+    if (x < 1)
+        fun_l6_n415(x)
+    else
+        fun_l6_n734(x)
+    end
+end
+
+def fun_l5_n118(x)
+    if (x < 1)
+        fun_l6_n873(x)
+    else
+        fun_l6_n163(x)
+    end
+end
+
+def fun_l5_n119(x)
+    if (x < 1)
+        fun_l6_n134(x)
+    else
+        fun_l6_n586(x)
+    end
+end
+
+def fun_l5_n120(x)
+    if (x < 1)
+        fun_l6_n793(x)
+    else
+        fun_l6_n197(x)
+    end
+end
+
+def fun_l5_n121(x)
+    if (x < 1)
+        fun_l6_n585(x)
+    else
+        fun_l6_n793(x)
+    end
+end
+
+def fun_l5_n122(x)
+    if (x < 1)
+        fun_l6_n10(x)
+    else
+        fun_l6_n12(x)
+    end
+end
+
+def fun_l5_n123(x)
+    if (x < 1)
+        fun_l6_n786(x)
+    else
+        fun_l6_n386(x)
+    end
+end
+
+def fun_l5_n124(x)
+    if (x < 1)
+        fun_l6_n891(x)
+    else
+        fun_l6_n903(x)
+    end
+end
+
+def fun_l5_n125(x)
+    if (x < 1)
+        fun_l6_n389(x)
+    else
+        fun_l6_n154(x)
+    end
+end
+
+def fun_l5_n126(x)
+    if (x < 1)
+        fun_l6_n214(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n127(x)
+    if (x < 1)
+        fun_l6_n646(x)
+    else
+        fun_l6_n661(x)
+    end
+end
+
+def fun_l5_n128(x)
+    if (x < 1)
+        fun_l6_n662(x)
+    else
+        fun_l6_n527(x)
+    end
+end
+
+def fun_l5_n129(x)
+    if (x < 1)
+        fun_l6_n329(x)
+    else
+        fun_l6_n310(x)
+    end
+end
+
+def fun_l5_n130(x)
+    if (x < 1)
+        fun_l6_n352(x)
+    else
+        fun_l6_n820(x)
+    end
+end
+
+def fun_l5_n131(x)
+    if (x < 1)
+        fun_l6_n551(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n132(x)
+    if (x < 1)
+        fun_l6_n586(x)
+    else
+        fun_l6_n340(x)
+    end
+end
+
+def fun_l5_n133(x)
+    if (x < 1)
+        fun_l6_n111(x)
+    else
+        fun_l6_n188(x)
+    end
+end
+
+def fun_l5_n134(x)
+    if (x < 1)
+        fun_l6_n261(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n135(x)
+    if (x < 1)
+        fun_l6_n540(x)
+    else
+        fun_l6_n854(x)
+    end
+end
+
+def fun_l5_n136(x)
+    if (x < 1)
+        fun_l6_n120(x)
+    else
+        fun_l6_n230(x)
+    end
+end
+
+def fun_l5_n137(x)
+    if (x < 1)
+        fun_l6_n837(x)
+    else
+        fun_l6_n606(x)
+    end
+end
+
+def fun_l5_n138(x)
+    if (x < 1)
+        fun_l6_n663(x)
+    else
+        fun_l6_n195(x)
+    end
+end
+
+def fun_l5_n139(x)
+    if (x < 1)
+        fun_l6_n572(x)
+    else
+        fun_l6_n768(x)
+    end
+end
+
+def fun_l5_n140(x)
+    if (x < 1)
+        fun_l6_n747(x)
+    else
+        fun_l6_n304(x)
+    end
+end
+
+def fun_l5_n141(x)
+    if (x < 1)
+        fun_l6_n927(x)
+    else
+        fun_l6_n122(x)
+    end
+end
+
+def fun_l5_n142(x)
+    if (x < 1)
+        fun_l6_n311(x)
+    else
+        fun_l6_n920(x)
+    end
+end
+
+def fun_l5_n143(x)
+    if (x < 1)
+        fun_l6_n887(x)
+    else
+        fun_l6_n598(x)
+    end
+end
+
+def fun_l5_n144(x)
+    if (x < 1)
+        fun_l6_n289(x)
+    else
+        fun_l6_n894(x)
+    end
+end
+
+def fun_l5_n145(x)
+    if (x < 1)
+        fun_l6_n333(x)
+    else
+        fun_l6_n385(x)
+    end
+end
+
+def fun_l5_n146(x)
+    if (x < 1)
+        fun_l6_n926(x)
+    else
+        fun_l6_n310(x)
+    end
+end
+
+def fun_l5_n147(x)
+    if (x < 1)
+        fun_l6_n754(x)
+    else
+        fun_l6_n354(x)
+    end
+end
+
+def fun_l5_n148(x)
+    if (x < 1)
+        fun_l6_n800(x)
+    else
+        fun_l6_n634(x)
+    end
+end
+
+def fun_l5_n149(x)
+    if (x < 1)
+        fun_l6_n5(x)
+    else
+        fun_l6_n67(x)
+    end
+end
+
+def fun_l5_n150(x)
+    if (x < 1)
+        fun_l6_n766(x)
+    else
+        fun_l6_n237(x)
+    end
+end
+
+def fun_l5_n151(x)
+    if (x < 1)
+        fun_l6_n277(x)
+    else
+        fun_l6_n692(x)
+    end
+end
+
+def fun_l5_n152(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n216(x)
+    end
+end
+
+def fun_l5_n153(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n154(x)
+    if (x < 1)
+        fun_l6_n884(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n155(x)
+    if (x < 1)
+        fun_l6_n376(x)
+    else
+        fun_l6_n188(x)
+    end
+end
+
+def fun_l5_n156(x)
+    if (x < 1)
+        fun_l6_n276(x)
+    else
+        fun_l6_n19(x)
+    end
+end
+
+def fun_l5_n157(x)
+    if (x < 1)
+        fun_l6_n443(x)
+    else
+        fun_l6_n815(x)
+    end
+end
+
+def fun_l5_n158(x)
+    if (x < 1)
+        fun_l6_n610(x)
+    else
+        fun_l6_n341(x)
+    end
+end
+
+def fun_l5_n159(x)
+    if (x < 1)
+        fun_l6_n147(x)
+    else
+        fun_l6_n289(x)
+    end
+end
+
+def fun_l5_n160(x)
+    if (x < 1)
+        fun_l6_n258(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n161(x)
+    if (x < 1)
+        fun_l6_n544(x)
+    else
+        fun_l6_n621(x)
+    end
+end
+
+def fun_l5_n162(x)
+    if (x < 1)
+        fun_l6_n119(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n163(x)
+    if (x < 1)
+        fun_l6_n297(x)
+    else
+        fun_l6_n915(x)
+    end
+end
+
+def fun_l5_n164(x)
+    if (x < 1)
+        fun_l6_n782(x)
+    else
+        fun_l6_n499(x)
+    end
+end
+
+def fun_l5_n165(x)
+    if (x < 1)
+        fun_l6_n660(x)
+    else
+        fun_l6_n227(x)
+    end
+end
+
+def fun_l5_n166(x)
+    if (x < 1)
+        fun_l6_n820(x)
+    else
+        fun_l6_n822(x)
+    end
+end
+
+def fun_l5_n167(x)
+    if (x < 1)
+        fun_l6_n878(x)
+    else
+        fun_l6_n642(x)
+    end
+end
+
+def fun_l5_n168(x)
+    if (x < 1)
+        fun_l6_n123(x)
+    else
+        fun_l6_n451(x)
+    end
+end
+
+def fun_l5_n169(x)
+    if (x < 1)
+        fun_l6_n741(x)
+    else
+        fun_l6_n35(x)
+    end
+end
+
+def fun_l5_n170(x)
+    if (x < 1)
+        fun_l6_n522(x)
+    else
+        fun_l6_n546(x)
+    end
+end
+
+def fun_l5_n171(x)
+    if (x < 1)
+        fun_l6_n555(x)
+    else
+        fun_l6_n667(x)
+    end
+end
+
+def fun_l5_n172(x)
+    if (x < 1)
+        fun_l6_n760(x)
+    else
+        fun_l6_n292(x)
+    end
+end
+
+def fun_l5_n173(x)
+    if (x < 1)
+        fun_l6_n375(x)
+    else
+        fun_l6_n907(x)
+    end
+end
+
+def fun_l5_n174(x)
+    if (x < 1)
+        fun_l6_n382(x)
+    else
+        fun_l6_n693(x)
+    end
+end
+
+def fun_l5_n175(x)
+    if (x < 1)
+        fun_l6_n728(x)
+    else
+        fun_l6_n378(x)
+    end
+end
+
+def fun_l5_n176(x)
+    if (x < 1)
+        fun_l6_n79(x)
+    else
+        fun_l6_n402(x)
+    end
+end
+
+def fun_l5_n177(x)
+    if (x < 1)
+        fun_l6_n444(x)
+    else
+        fun_l6_n500(x)
+    end
+end
+
+def fun_l5_n178(x)
+    if (x < 1)
+        fun_l6_n535(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n179(x)
+    if (x < 1)
+        fun_l6_n831(x)
+    else
+        fun_l6_n206(x)
+    end
+end
+
+def fun_l5_n180(x)
+    if (x < 1)
+        fun_l6_n878(x)
+    else
+        fun_l6_n715(x)
+    end
+end
+
+def fun_l5_n181(x)
+    if (x < 1)
+        fun_l6_n433(x)
+    else
+        fun_l6_n955(x)
+    end
+end
+
+def fun_l5_n182(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n258(x)
+    end
+end
+
+def fun_l5_n183(x)
+    if (x < 1)
+        fun_l6_n618(x)
+    else
+        fun_l6_n29(x)
+    end
+end
+
+def fun_l5_n184(x)
+    if (x < 1)
+        fun_l6_n838(x)
+    else
+        fun_l6_n918(x)
+    end
+end
+
+def fun_l5_n185(x)
+    if (x < 1)
+        fun_l6_n307(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n186(x)
+    if (x < 1)
+        fun_l6_n564(x)
+    else
+        fun_l6_n73(x)
+    end
+end
+
+def fun_l5_n187(x)
+    if (x < 1)
+        fun_l6_n871(x)
+    else
+        fun_l6_n669(x)
+    end
+end
+
+def fun_l5_n188(x)
+    if (x < 1)
+        fun_l6_n546(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n189(x)
+    if (x < 1)
+        fun_l6_n312(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n190(x)
+    if (x < 1)
+        fun_l6_n519(x)
+    else
+        fun_l6_n275(x)
+    end
+end
+
+def fun_l5_n191(x)
+    if (x < 1)
+        fun_l6_n525(x)
+    else
+        fun_l6_n228(x)
+    end
+end
+
+def fun_l5_n192(x)
+    if (x < 1)
+        fun_l6_n115(x)
+    else
+        fun_l6_n790(x)
+    end
+end
+
+def fun_l5_n193(x)
+    if (x < 1)
+        fun_l6_n976(x)
+    else
+        fun_l6_n219(x)
+    end
+end
+
+def fun_l5_n194(x)
+    if (x < 1)
+        fun_l6_n785(x)
+    else
+        fun_l6_n834(x)
+    end
+end
+
+def fun_l5_n195(x)
+    if (x < 1)
+        fun_l6_n238(x)
+    else
+        fun_l6_n471(x)
+    end
+end
+
+def fun_l5_n196(x)
+    if (x < 1)
+        fun_l6_n275(x)
+    else
+        fun_l6_n218(x)
+    end
+end
+
+def fun_l5_n197(x)
+    if (x < 1)
+        fun_l6_n590(x)
+    else
+        fun_l6_n458(x)
+    end
+end
+
+def fun_l5_n198(x)
+    if (x < 1)
+        fun_l6_n498(x)
+    else
+        fun_l6_n906(x)
+    end
+end
+
+def fun_l5_n199(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n885(x)
+    end
+end
+
+def fun_l5_n200(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n0(x)
+    end
+end
+
+def fun_l5_n201(x)
+    if (x < 1)
+        fun_l6_n31(x)
+    else
+        fun_l6_n729(x)
+    end
+end
+
+def fun_l5_n202(x)
+    if (x < 1)
+        fun_l6_n303(x)
+    else
+        fun_l6_n847(x)
+    end
+end
+
+def fun_l5_n203(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n346(x)
+    end
+end
+
+def fun_l5_n204(x)
+    if (x < 1)
+        fun_l6_n153(x)
+    else
+        fun_l6_n831(x)
+    end
+end
+
+def fun_l5_n205(x)
+    if (x < 1)
+        fun_l6_n424(x)
+    else
+        fun_l6_n836(x)
+    end
+end
+
+def fun_l5_n206(x)
+    if (x < 1)
+        fun_l6_n214(x)
+    else
+        fun_l6_n207(x)
+    end
+end
+
+def fun_l5_n207(x)
+    if (x < 1)
+        fun_l6_n362(x)
+    else
+        fun_l6_n241(x)
+    end
+end
+
+def fun_l5_n208(x)
+    if (x < 1)
+        fun_l6_n796(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n209(x)
+    if (x < 1)
+        fun_l6_n523(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n210(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n755(x)
+    end
+end
+
+def fun_l5_n211(x)
+    if (x < 1)
+        fun_l6_n345(x)
+    else
+        fun_l6_n747(x)
+    end
+end
+
+def fun_l5_n212(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n576(x)
+    end
+end
+
+def fun_l5_n213(x)
+    if (x < 1)
+        fun_l6_n713(x)
+    else
+        fun_l6_n678(x)
+    end
+end
+
+def fun_l5_n214(x)
+    if (x < 1)
+        fun_l6_n470(x)
+    else
+        fun_l6_n877(x)
+    end
+end
+
+def fun_l5_n215(x)
+    if (x < 1)
+        fun_l6_n78(x)
+    else
+        fun_l6_n315(x)
+    end
+end
+
+def fun_l5_n216(x)
+    if (x < 1)
+        fun_l6_n281(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n217(x)
+    if (x < 1)
+        fun_l6_n200(x)
+    else
+        fun_l6_n323(x)
+    end
+end
+
+def fun_l5_n218(x)
+    if (x < 1)
+        fun_l6_n483(x)
+    else
+        fun_l6_n938(x)
+    end
+end
+
+def fun_l5_n219(x)
+    if (x < 1)
+        fun_l6_n102(x)
+    else
+        fun_l6_n690(x)
+    end
+end
+
+def fun_l5_n220(x)
+    if (x < 1)
+        fun_l6_n740(x)
+    else
+        fun_l6_n684(x)
+    end
+end
+
+def fun_l5_n221(x)
+    if (x < 1)
+        fun_l6_n366(x)
+    else
+        fun_l6_n138(x)
+    end
+end
+
+def fun_l5_n222(x)
+    if (x < 1)
+        fun_l6_n306(x)
+    else
+        fun_l6_n874(x)
+    end
+end
+
+def fun_l5_n223(x)
+    if (x < 1)
+        fun_l6_n828(x)
+    else
+        fun_l6_n839(x)
+    end
+end
+
+def fun_l5_n224(x)
+    if (x < 1)
+        fun_l6_n739(x)
+    else
+        fun_l6_n569(x)
+    end
+end
+
+def fun_l5_n225(x)
+    if (x < 1)
+        fun_l6_n332(x)
+    else
+        fun_l6_n49(x)
+    end
+end
+
+def fun_l5_n226(x)
+    if (x < 1)
+        fun_l6_n783(x)
+    else
+        fun_l6_n20(x)
+    end
+end
+
+def fun_l5_n227(x)
+    if (x < 1)
+        fun_l6_n774(x)
+    else
+        fun_l6_n346(x)
+    end
+end
+
+def fun_l5_n228(x)
+    if (x < 1)
+        fun_l6_n637(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n229(x)
+    if (x < 1)
+        fun_l6_n10(x)
+    else
+        fun_l6_n697(x)
+    end
+end
+
+def fun_l5_n230(x)
+    if (x < 1)
+        fun_l6_n804(x)
+    else
+        fun_l6_n141(x)
+    end
+end
+
+def fun_l5_n231(x)
+    if (x < 1)
+        fun_l6_n232(x)
+    else
+        fun_l6_n88(x)
+    end
+end
+
+def fun_l5_n232(x)
+    if (x < 1)
+        fun_l6_n248(x)
+    else
+        fun_l6_n862(x)
+    end
+end
+
+def fun_l5_n233(x)
+    if (x < 1)
+        fun_l6_n287(x)
+    else
+        fun_l6_n315(x)
+    end
+end
+
+def fun_l5_n234(x)
+    if (x < 1)
+        fun_l6_n543(x)
+    else
+        fun_l6_n182(x)
+    end
+end
+
+def fun_l5_n235(x)
+    if (x < 1)
+        fun_l6_n162(x)
+    else
+        fun_l6_n710(x)
+    end
+end
+
+def fun_l5_n236(x)
+    if (x < 1)
+        fun_l6_n879(x)
+    else
+        fun_l6_n262(x)
+    end
+end
+
+def fun_l5_n237(x)
+    if (x < 1)
+        fun_l6_n706(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n238(x)
+    if (x < 1)
+        fun_l6_n578(x)
+    else
+        fun_l6_n792(x)
+    end
+end
+
+def fun_l5_n239(x)
+    if (x < 1)
+        fun_l6_n685(x)
+    else
+        fun_l6_n441(x)
+    end
+end
+
+def fun_l5_n240(x)
+    if (x < 1)
+        fun_l6_n706(x)
+    else
+        fun_l6_n737(x)
+    end
+end
+
+def fun_l5_n241(x)
+    if (x < 1)
+        fun_l6_n360(x)
+    else
+        fun_l6_n751(x)
+    end
+end
+
+def fun_l5_n242(x)
+    if (x < 1)
+        fun_l6_n823(x)
+    else
+        fun_l6_n888(x)
+    end
+end
+
+def fun_l5_n243(x)
+    if (x < 1)
+        fun_l6_n743(x)
+    else
+        fun_l6_n705(x)
+    end
+end
+
+def fun_l5_n244(x)
+    if (x < 1)
+        fun_l6_n340(x)
+    else
+        fun_l6_n541(x)
+    end
+end
+
+def fun_l5_n245(x)
+    if (x < 1)
+        fun_l6_n324(x)
+    else
+        fun_l6_n121(x)
+    end
+end
+
+def fun_l5_n246(x)
+    if (x < 1)
+        fun_l6_n241(x)
+    else
+        fun_l6_n584(x)
+    end
+end
+
+def fun_l5_n247(x)
+    if (x < 1)
+        fun_l6_n468(x)
+    else
+        fun_l6_n673(x)
+    end
+end
+
+def fun_l5_n248(x)
+    if (x < 1)
+        fun_l6_n595(x)
+    else
+        fun_l6_n537(x)
+    end
+end
+
+def fun_l5_n249(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n766(x)
+    end
+end
+
+def fun_l5_n250(x)
+    if (x < 1)
+        fun_l6_n322(x)
+    else
+        fun_l6_n904(x)
+    end
+end
+
+def fun_l5_n251(x)
+    if (x < 1)
+        fun_l6_n273(x)
+    else
+        fun_l6_n353(x)
+    end
+end
+
+def fun_l5_n252(x)
+    if (x < 1)
+        fun_l6_n990(x)
+    else
+        fun_l6_n360(x)
+    end
+end
+
+def fun_l5_n253(x)
+    if (x < 1)
+        fun_l6_n552(x)
+    else
+        fun_l6_n649(x)
+    end
+end
+
+def fun_l5_n254(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n803(x)
+    end
+end
+
+def fun_l5_n255(x)
+    if (x < 1)
+        fun_l6_n763(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n256(x)
+    if (x < 1)
+        fun_l6_n577(x)
+    else
+        fun_l6_n70(x)
+    end
+end
+
+def fun_l5_n257(x)
+    if (x < 1)
+        fun_l6_n618(x)
+    else
+        fun_l6_n943(x)
+    end
+end
+
+def fun_l5_n258(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n761(x)
+    end
+end
+
+def fun_l5_n259(x)
+    if (x < 1)
+        fun_l6_n284(x)
+    else
+        fun_l6_n223(x)
+    end
+end
+
+def fun_l5_n260(x)
+    if (x < 1)
+        fun_l6_n189(x)
+    else
+        fun_l6_n455(x)
+    end
+end
+
+def fun_l5_n261(x)
+    if (x < 1)
+        fun_l6_n632(x)
+    else
+        fun_l6_n245(x)
+    end
+end
+
+def fun_l5_n262(x)
+    if (x < 1)
+        fun_l6_n940(x)
+    else
+        fun_l6_n38(x)
+    end
+end
+
+def fun_l5_n263(x)
+    if (x < 1)
+        fun_l6_n289(x)
+    else
+        fun_l6_n356(x)
+    end
+end
+
+def fun_l5_n264(x)
+    if (x < 1)
+        fun_l6_n268(x)
+    else
+        fun_l6_n412(x)
+    end
+end
+
+def fun_l5_n265(x)
+    if (x < 1)
+        fun_l6_n370(x)
+    else
+        fun_l6_n858(x)
+    end
+end
+
+def fun_l5_n266(x)
+    if (x < 1)
+        fun_l6_n523(x)
+    else
+        fun_l6_n809(x)
+    end
+end
+
+def fun_l5_n267(x)
+    if (x < 1)
+        fun_l6_n469(x)
+    else
+        fun_l6_n260(x)
+    end
+end
+
+def fun_l5_n268(x)
+    if (x < 1)
+        fun_l6_n442(x)
+    else
+        fun_l6_n738(x)
+    end
+end
+
+def fun_l5_n269(x)
+    if (x < 1)
+        fun_l6_n663(x)
+    else
+        fun_l6_n109(x)
+    end
+end
+
+def fun_l5_n270(x)
+    if (x < 1)
+        fun_l6_n302(x)
+    else
+        fun_l6_n664(x)
+    end
+end
+
+def fun_l5_n271(x)
+    if (x < 1)
+        fun_l6_n201(x)
+    else
+        fun_l6_n251(x)
+    end
+end
+
+def fun_l5_n272(x)
+    if (x < 1)
+        fun_l6_n776(x)
+    else
+        fun_l6_n903(x)
+    end
+end
+
+def fun_l5_n273(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n233(x)
+    end
+end
+
+def fun_l5_n274(x)
+    if (x < 1)
+        fun_l6_n530(x)
+    else
+        fun_l6_n487(x)
+    end
+end
+
+def fun_l5_n275(x)
+    if (x < 1)
+        fun_l6_n848(x)
+    else
+        fun_l6_n99(x)
+    end
+end
+
+def fun_l5_n276(x)
+    if (x < 1)
+        fun_l6_n126(x)
+    else
+        fun_l6_n914(x)
+    end
+end
+
+def fun_l5_n277(x)
+    if (x < 1)
+        fun_l6_n304(x)
+    else
+        fun_l6_n198(x)
+    end
+end
+
+def fun_l5_n278(x)
+    if (x < 1)
+        fun_l6_n47(x)
+    else
+        fun_l6_n179(x)
+    end
+end
+
+def fun_l5_n279(x)
+    if (x < 1)
+        fun_l6_n846(x)
+    else
+        fun_l6_n301(x)
+    end
+end
+
+def fun_l5_n280(x)
+    if (x < 1)
+        fun_l6_n576(x)
+    else
+        fun_l6_n561(x)
+    end
+end
+
+def fun_l5_n281(x)
+    if (x < 1)
+        fun_l6_n307(x)
+    else
+        fun_l6_n545(x)
+    end
+end
+
+def fun_l5_n282(x)
+    if (x < 1)
+        fun_l6_n434(x)
+    else
+        fun_l6_n669(x)
+    end
+end
+
+def fun_l5_n283(x)
+    if (x < 1)
+        fun_l6_n606(x)
+    else
+        fun_l6_n147(x)
+    end
+end
+
+def fun_l5_n284(x)
+    if (x < 1)
+        fun_l6_n212(x)
+    else
+        fun_l6_n504(x)
+    end
+end
+
+def fun_l5_n285(x)
+    if (x < 1)
+        fun_l6_n193(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n286(x)
+    if (x < 1)
+        fun_l6_n569(x)
+    else
+        fun_l6_n100(x)
+    end
+end
+
+def fun_l5_n287(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n998(x)
+    end
+end
+
+def fun_l5_n288(x)
+    if (x < 1)
+        fun_l6_n544(x)
+    else
+        fun_l6_n923(x)
+    end
+end
+
+def fun_l5_n289(x)
+    if (x < 1)
+        fun_l6_n317(x)
+    else
+        fun_l6_n255(x)
+    end
+end
+
+def fun_l5_n290(x)
+    if (x < 1)
+        fun_l6_n476(x)
+    else
+        fun_l6_n789(x)
+    end
+end
+
+def fun_l5_n291(x)
+    if (x < 1)
+        fun_l6_n324(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n292(x)
+    if (x < 1)
+        fun_l6_n704(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n293(x)
+    if (x < 1)
+        fun_l6_n994(x)
+    else
+        fun_l6_n637(x)
+    end
+end
+
+def fun_l5_n294(x)
+    if (x < 1)
+        fun_l6_n801(x)
+    else
+        fun_l6_n913(x)
+    end
+end
+
+def fun_l5_n295(x)
+    if (x < 1)
+        fun_l6_n579(x)
+    else
+        fun_l6_n795(x)
+    end
+end
+
+def fun_l5_n296(x)
+    if (x < 1)
+        fun_l6_n689(x)
+    else
+        fun_l6_n546(x)
+    end
+end
+
+def fun_l5_n297(x)
+    if (x < 1)
+        fun_l6_n971(x)
+    else
+        fun_l6_n493(x)
+    end
+end
+
+def fun_l5_n298(x)
+    if (x < 1)
+        fun_l6_n67(x)
+    else
+        fun_l6_n372(x)
+    end
+end
+
+def fun_l5_n299(x)
+    if (x < 1)
+        fun_l6_n654(x)
+    else
+        fun_l6_n921(x)
+    end
+end
+
+def fun_l5_n300(x)
+    if (x < 1)
+        fun_l6_n402(x)
+    else
+        fun_l6_n437(x)
+    end
+end
+
+def fun_l5_n301(x)
+    if (x < 1)
+        fun_l6_n448(x)
+    else
+        fun_l6_n177(x)
+    end
+end
+
+def fun_l5_n302(x)
+    if (x < 1)
+        fun_l6_n308(x)
+    else
+        fun_l6_n869(x)
+    end
+end
+
+def fun_l5_n303(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n848(x)
+    end
+end
+
+def fun_l5_n304(x)
+    if (x < 1)
+        fun_l6_n735(x)
+    else
+        fun_l6_n653(x)
+    end
+end
+
+def fun_l5_n305(x)
+    if (x < 1)
+        fun_l6_n393(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n306(x)
+    if (x < 1)
+        fun_l6_n821(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n307(x)
+    if (x < 1)
+        fun_l6_n734(x)
+    else
+        fun_l6_n498(x)
+    end
+end
+
+def fun_l5_n308(x)
+    if (x < 1)
+        fun_l6_n833(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n309(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n544(x)
+    end
+end
+
+def fun_l5_n310(x)
+    if (x < 1)
+        fun_l6_n61(x)
+    else
+        fun_l6_n823(x)
+    end
+end
+
+def fun_l5_n311(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n98(x)
+    end
+end
+
+def fun_l5_n312(x)
+    if (x < 1)
+        fun_l6_n78(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n313(x)
+    if (x < 1)
+        fun_l6_n286(x)
+    else
+        fun_l6_n230(x)
+    end
+end
+
+def fun_l5_n314(x)
+    if (x < 1)
+        fun_l6_n613(x)
+    else
+        fun_l6_n412(x)
+    end
+end
+
+def fun_l5_n315(x)
+    if (x < 1)
+        fun_l6_n0(x)
+    else
+        fun_l6_n579(x)
+    end
+end
+
+def fun_l5_n316(x)
+    if (x < 1)
+        fun_l6_n991(x)
+    else
+        fun_l6_n379(x)
+    end
+end
+
+def fun_l5_n317(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n964(x)
+    end
+end
+
+def fun_l5_n318(x)
+    if (x < 1)
+        fun_l6_n707(x)
+    else
+        fun_l6_n664(x)
+    end
+end
+
+def fun_l5_n319(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n320(x)
+    if (x < 1)
+        fun_l6_n684(x)
+    else
+        fun_l6_n333(x)
+    end
+end
+
+def fun_l5_n321(x)
+    if (x < 1)
+        fun_l6_n165(x)
+    else
+        fun_l6_n586(x)
+    end
+end
+
+def fun_l5_n322(x)
+    if (x < 1)
+        fun_l6_n28(x)
+    else
+        fun_l6_n53(x)
+    end
+end
+
+def fun_l5_n323(x)
+    if (x < 1)
+        fun_l6_n693(x)
+    else
+        fun_l6_n84(x)
+    end
+end
+
+def fun_l5_n324(x)
+    if (x < 1)
+        fun_l6_n500(x)
+    else
+        fun_l6_n445(x)
+    end
+end
+
+def fun_l5_n325(x)
+    if (x < 1)
+        fun_l6_n189(x)
+    else
+        fun_l6_n756(x)
+    end
+end
+
+def fun_l5_n326(x)
+    if (x < 1)
+        fun_l6_n147(x)
+    else
+        fun_l6_n709(x)
+    end
+end
+
+def fun_l5_n327(x)
+    if (x < 1)
+        fun_l6_n893(x)
+    else
+        fun_l6_n851(x)
+    end
+end
+
+def fun_l5_n328(x)
+    if (x < 1)
+        fun_l6_n685(x)
+    else
+        fun_l6_n399(x)
+    end
+end
+
+def fun_l5_n329(x)
+    if (x < 1)
+        fun_l6_n281(x)
+    else
+        fun_l6_n284(x)
+    end
+end
+
+def fun_l5_n330(x)
+    if (x < 1)
+        fun_l6_n579(x)
+    else
+        fun_l6_n671(x)
+    end
+end
+
+def fun_l5_n331(x)
+    if (x < 1)
+        fun_l6_n176(x)
+    else
+        fun_l6_n829(x)
+    end
+end
+
+def fun_l5_n332(x)
+    if (x < 1)
+        fun_l6_n209(x)
+    else
+        fun_l6_n91(x)
+    end
+end
+
+def fun_l5_n333(x)
+    if (x < 1)
+        fun_l6_n302(x)
+    else
+        fun_l6_n360(x)
+    end
+end
+
+def fun_l5_n334(x)
+    if (x < 1)
+        fun_l6_n701(x)
+    else
+        fun_l6_n438(x)
+    end
+end
+
+def fun_l5_n335(x)
+    if (x < 1)
+        fun_l6_n923(x)
+    else
+        fun_l6_n613(x)
+    end
+end
+
+def fun_l5_n336(x)
+    if (x < 1)
+        fun_l6_n490(x)
+    else
+        fun_l6_n405(x)
+    end
+end
+
+def fun_l5_n337(x)
+    if (x < 1)
+        fun_l6_n187(x)
+    else
+        fun_l6_n953(x)
+    end
+end
+
+def fun_l5_n338(x)
+    if (x < 1)
+        fun_l6_n396(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n339(x)
+    if (x < 1)
+        fun_l6_n822(x)
+    else
+        fun_l6_n939(x)
+    end
+end
+
+def fun_l5_n340(x)
+    if (x < 1)
+        fun_l6_n665(x)
+    else
+        fun_l6_n890(x)
+    end
+end
+
+def fun_l5_n341(x)
+    if (x < 1)
+        fun_l6_n125(x)
+    else
+        fun_l6_n817(x)
+    end
+end
+
+def fun_l5_n342(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n853(x)
+    end
+end
+
+def fun_l5_n343(x)
+    if (x < 1)
+        fun_l6_n724(x)
+    else
+        fun_l6_n633(x)
+    end
+end
+
+def fun_l5_n344(x)
+    if (x < 1)
+        fun_l6_n901(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n345(x)
+    if (x < 1)
+        fun_l6_n406(x)
+    else
+        fun_l6_n664(x)
+    end
+end
+
+def fun_l5_n346(x)
+    if (x < 1)
+        fun_l6_n720(x)
+    else
+        fun_l6_n856(x)
+    end
+end
+
+def fun_l5_n347(x)
+    if (x < 1)
+        fun_l6_n617(x)
+    else
+        fun_l6_n116(x)
+    end
+end
+
+def fun_l5_n348(x)
+    if (x < 1)
+        fun_l6_n560(x)
+    else
+        fun_l6_n24(x)
+    end
+end
+
+def fun_l5_n349(x)
+    if (x < 1)
+        fun_l6_n758(x)
+    else
+        fun_l6_n297(x)
+    end
+end
+
+def fun_l5_n350(x)
+    if (x < 1)
+        fun_l6_n583(x)
+    else
+        fun_l6_n673(x)
+    end
+end
+
+def fun_l5_n351(x)
+    if (x < 1)
+        fun_l6_n990(x)
+    else
+        fun_l6_n512(x)
+    end
+end
+
+def fun_l5_n352(x)
+    if (x < 1)
+        fun_l6_n250(x)
+    else
+        fun_l6_n819(x)
+    end
+end
+
+def fun_l5_n353(x)
+    if (x < 1)
+        fun_l6_n186(x)
+    else
+        fun_l6_n787(x)
+    end
+end
+
+def fun_l5_n354(x)
+    if (x < 1)
+        fun_l6_n217(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n355(x)
+    if (x < 1)
+        fun_l6_n827(x)
+    else
+        fun_l6_n439(x)
+    end
+end
+
+def fun_l5_n356(x)
+    if (x < 1)
+        fun_l6_n456(x)
+    else
+        fun_l6_n352(x)
+    end
+end
+
+def fun_l5_n357(x)
+    if (x < 1)
+        fun_l6_n306(x)
+    else
+        fun_l6_n236(x)
+    end
+end
+
+def fun_l5_n358(x)
+    if (x < 1)
+        fun_l6_n515(x)
+    else
+        fun_l6_n100(x)
+    end
+end
+
+def fun_l5_n359(x)
+    if (x < 1)
+        fun_l6_n28(x)
+    else
+        fun_l6_n820(x)
+    end
+end
+
+def fun_l5_n360(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n361(x)
+    if (x < 1)
+        fun_l6_n573(x)
+    else
+        fun_l6_n699(x)
+    end
+end
+
+def fun_l5_n362(x)
+    if (x < 1)
+        fun_l6_n807(x)
+    else
+        fun_l6_n548(x)
+    end
+end
+
+def fun_l5_n363(x)
+    if (x < 1)
+        fun_l6_n712(x)
+    else
+        fun_l6_n323(x)
+    end
+end
+
+def fun_l5_n364(x)
+    if (x < 1)
+        fun_l6_n457(x)
+    else
+        fun_l6_n447(x)
+    end
+end
+
+def fun_l5_n365(x)
+    if (x < 1)
+        fun_l6_n684(x)
+    else
+        fun_l6_n782(x)
+    end
+end
+
+def fun_l5_n366(x)
+    if (x < 1)
+        fun_l6_n217(x)
+    else
+        fun_l6_n344(x)
+    end
+end
+
+def fun_l5_n367(x)
+    if (x < 1)
+        fun_l6_n670(x)
+    else
+        fun_l6_n311(x)
+    end
+end
+
+def fun_l5_n368(x)
+    if (x < 1)
+        fun_l6_n224(x)
+    else
+        fun_l6_n198(x)
+    end
+end
+
+def fun_l5_n369(x)
+    if (x < 1)
+        fun_l6_n517(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n370(x)
+    if (x < 1)
+        fun_l6_n511(x)
+    else
+        fun_l6_n27(x)
+    end
+end
+
+def fun_l5_n371(x)
+    if (x < 1)
+        fun_l6_n485(x)
+    else
+        fun_l6_n288(x)
+    end
+end
+
+def fun_l5_n372(x)
+    if (x < 1)
+        fun_l6_n931(x)
+    else
+        fun_l6_n473(x)
+    end
+end
+
+def fun_l5_n373(x)
+    if (x < 1)
+        fun_l6_n381(x)
+    else
+        fun_l6_n650(x)
+    end
+end
+
+def fun_l5_n374(x)
+    if (x < 1)
+        fun_l6_n132(x)
+    else
+        fun_l6_n243(x)
+    end
+end
+
+def fun_l5_n375(x)
+    if (x < 1)
+        fun_l6_n900(x)
+    else
+        fun_l6_n322(x)
+    end
+end
+
+def fun_l5_n376(x)
+    if (x < 1)
+        fun_l6_n787(x)
+    else
+        fun_l6_n588(x)
+    end
+end
+
+def fun_l5_n377(x)
+    if (x < 1)
+        fun_l6_n233(x)
+    else
+        fun_l6_n358(x)
+    end
+end
+
+def fun_l5_n378(x)
+    if (x < 1)
+        fun_l6_n601(x)
+    else
+        fun_l6_n40(x)
+    end
+end
+
+def fun_l5_n379(x)
+    if (x < 1)
+        fun_l6_n682(x)
+    else
+        fun_l6_n63(x)
+    end
+end
+
+def fun_l5_n380(x)
+    if (x < 1)
+        fun_l6_n279(x)
+    else
+        fun_l6_n393(x)
+    end
+end
+
+def fun_l5_n381(x)
+    if (x < 1)
+        fun_l6_n83(x)
+    else
+        fun_l6_n538(x)
+    end
+end
+
+def fun_l5_n382(x)
+    if (x < 1)
+        fun_l6_n956(x)
+    else
+        fun_l6_n194(x)
+    end
+end
+
+def fun_l5_n383(x)
+    if (x < 1)
+        fun_l6_n55(x)
+    else
+        fun_l6_n140(x)
+    end
+end
+
+def fun_l5_n384(x)
+    if (x < 1)
+        fun_l6_n165(x)
+    else
+        fun_l6_n784(x)
+    end
+end
+
+def fun_l5_n385(x)
+    if (x < 1)
+        fun_l6_n582(x)
+    else
+        fun_l6_n97(x)
+    end
+end
+
+def fun_l5_n386(x)
+    if (x < 1)
+        fun_l6_n362(x)
+    else
+        fun_l6_n935(x)
+    end
+end
+
+def fun_l5_n387(x)
+    if (x < 1)
+        fun_l6_n496(x)
+    else
+        fun_l6_n512(x)
+    end
+end
+
+def fun_l5_n388(x)
+    if (x < 1)
+        fun_l6_n793(x)
+    else
+        fun_l6_n746(x)
+    end
+end
+
+def fun_l5_n389(x)
+    if (x < 1)
+        fun_l6_n172(x)
+    else
+        fun_l6_n731(x)
+    end
+end
+
+def fun_l5_n390(x)
+    if (x < 1)
+        fun_l6_n895(x)
+    else
+        fun_l6_n694(x)
+    end
+end
+
+def fun_l5_n391(x)
+    if (x < 1)
+        fun_l6_n336(x)
+    else
+        fun_l6_n551(x)
+    end
+end
+
+def fun_l5_n392(x)
+    if (x < 1)
+        fun_l6_n453(x)
+    else
+        fun_l6_n83(x)
+    end
+end
+
+def fun_l5_n393(x)
+    if (x < 1)
+        fun_l6_n571(x)
+    else
+        fun_l6_n293(x)
+    end
+end
+
+def fun_l5_n394(x)
+    if (x < 1)
+        fun_l6_n872(x)
+    else
+        fun_l6_n519(x)
+    end
+end
+
+def fun_l5_n395(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n955(x)
+    end
+end
+
+def fun_l5_n396(x)
+    if (x < 1)
+        fun_l6_n961(x)
+    else
+        fun_l6_n367(x)
+    end
+end
+
+def fun_l5_n397(x)
+    if (x < 1)
+        fun_l6_n255(x)
+    else
+        fun_l6_n639(x)
+    end
+end
+
+def fun_l5_n398(x)
+    if (x < 1)
+        fun_l6_n970(x)
+    else
+        fun_l6_n465(x)
+    end
+end
+
+def fun_l5_n399(x)
+    if (x < 1)
+        fun_l6_n625(x)
+    else
+        fun_l6_n387(x)
+    end
+end
+
+def fun_l5_n400(x)
+    if (x < 1)
+        fun_l6_n537(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n401(x)
+    if (x < 1)
+        fun_l6_n61(x)
+    else
+        fun_l6_n0(x)
+    end
+end
+
+def fun_l5_n402(x)
+    if (x < 1)
+        fun_l6_n358(x)
+    else
+        fun_l6_n715(x)
+    end
+end
+
+def fun_l5_n403(x)
+    if (x < 1)
+        fun_l6_n864(x)
+    else
+        fun_l6_n729(x)
+    end
+end
+
+def fun_l5_n404(x)
+    if (x < 1)
+        fun_l6_n393(x)
+    else
+        fun_l6_n962(x)
+    end
+end
+
+def fun_l5_n405(x)
+    if (x < 1)
+        fun_l6_n995(x)
+    else
+        fun_l6_n835(x)
+    end
+end
+
+def fun_l5_n406(x)
+    if (x < 1)
+        fun_l6_n605(x)
+    else
+        fun_l6_n732(x)
+    end
+end
+
+def fun_l5_n407(x)
+    if (x < 1)
+        fun_l6_n132(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n408(x)
+    if (x < 1)
+        fun_l6_n311(x)
+    else
+        fun_l6_n972(x)
+    end
+end
+
+def fun_l5_n409(x)
+    if (x < 1)
+        fun_l6_n460(x)
+    else
+        fun_l6_n750(x)
+    end
+end
+
+def fun_l5_n410(x)
+    if (x < 1)
+        fun_l6_n237(x)
+    else
+        fun_l6_n463(x)
+    end
+end
+
+def fun_l5_n411(x)
+    if (x < 1)
+        fun_l6_n251(x)
+    else
+        fun_l6_n944(x)
+    end
+end
+
+def fun_l5_n412(x)
+    if (x < 1)
+        fun_l6_n123(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n413(x)
+    if (x < 1)
+        fun_l6_n371(x)
+    else
+        fun_l6_n589(x)
+    end
+end
+
+def fun_l5_n414(x)
+    if (x < 1)
+        fun_l6_n232(x)
+    else
+        fun_l6_n354(x)
+    end
+end
+
+def fun_l5_n415(x)
+    if (x < 1)
+        fun_l6_n580(x)
+    else
+        fun_l6_n330(x)
+    end
+end
+
+def fun_l5_n416(x)
+    if (x < 1)
+        fun_l6_n483(x)
+    else
+        fun_l6_n446(x)
+    end
+end
+
+def fun_l5_n417(x)
+    if (x < 1)
+        fun_l6_n834(x)
+    else
+        fun_l6_n284(x)
+    end
+end
+
+def fun_l5_n418(x)
+    if (x < 1)
+        fun_l6_n864(x)
+    else
+        fun_l6_n825(x)
+    end
+end
+
+def fun_l5_n419(x)
+    if (x < 1)
+        fun_l6_n406(x)
+    else
+        fun_l6_n680(x)
+    end
+end
+
+def fun_l5_n420(x)
+    if (x < 1)
+        fun_l6_n101(x)
+    else
+        fun_l6_n4(x)
+    end
+end
+
+def fun_l5_n421(x)
+    if (x < 1)
+        fun_l6_n628(x)
+    else
+        fun_l6_n303(x)
+    end
+end
+
+def fun_l5_n422(x)
+    if (x < 1)
+        fun_l6_n521(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n423(x)
+    if (x < 1)
+        fun_l6_n589(x)
+    else
+        fun_l6_n134(x)
+    end
+end
+
+def fun_l5_n424(x)
+    if (x < 1)
+        fun_l6_n161(x)
+    else
+        fun_l6_n347(x)
+    end
+end
+
+def fun_l5_n425(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n988(x)
+    end
+end
+
+def fun_l5_n426(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n182(x)
+    end
+end
+
+def fun_l5_n427(x)
+    if (x < 1)
+        fun_l6_n500(x)
+    else
+        fun_l6_n536(x)
+    end
+end
+
+def fun_l5_n428(x)
+    if (x < 1)
+        fun_l6_n792(x)
+    else
+        fun_l6_n253(x)
+    end
+end
+
+def fun_l5_n429(x)
+    if (x < 1)
+        fun_l6_n774(x)
+    else
+        fun_l6_n997(x)
+    end
+end
+
+def fun_l5_n430(x)
+    if (x < 1)
+        fun_l6_n876(x)
+    else
+        fun_l6_n798(x)
+    end
+end
+
+def fun_l5_n431(x)
+    if (x < 1)
+        fun_l6_n606(x)
+    else
+        fun_l6_n403(x)
+    end
+end
+
+def fun_l5_n432(x)
+    if (x < 1)
+        fun_l6_n920(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n433(x)
+    if (x < 1)
+        fun_l6_n887(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n434(x)
+    if (x < 1)
+        fun_l6_n413(x)
+    else
+        fun_l6_n44(x)
+    end
+end
+
+def fun_l5_n435(x)
+    if (x < 1)
+        fun_l6_n474(x)
+    else
+        fun_l6_n107(x)
+    end
+end
+
+def fun_l5_n436(x)
+    if (x < 1)
+        fun_l6_n807(x)
+    else
+        fun_l6_n636(x)
+    end
+end
+
+def fun_l5_n437(x)
+    if (x < 1)
+        fun_l6_n616(x)
+    else
+        fun_l6_n615(x)
+    end
+end
+
+def fun_l5_n438(x)
+    if (x < 1)
+        fun_l6_n384(x)
+    else
+        fun_l6_n535(x)
+    end
+end
+
+def fun_l5_n439(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n929(x)
+    end
+end
+
+def fun_l5_n440(x)
+    if (x < 1)
+        fun_l6_n852(x)
+    else
+        fun_l6_n597(x)
+    end
+end
+
+def fun_l5_n441(x)
+    if (x < 1)
+        fun_l6_n246(x)
+    else
+        fun_l6_n991(x)
+    end
+end
+
+def fun_l5_n442(x)
+    if (x < 1)
+        fun_l6_n258(x)
+    else
+        fun_l6_n140(x)
+    end
+end
+
+def fun_l5_n443(x)
+    if (x < 1)
+        fun_l6_n815(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n444(x)
+    if (x < 1)
+        fun_l6_n153(x)
+    else
+        fun_l6_n902(x)
+    end
+end
+
+def fun_l5_n445(x)
+    if (x < 1)
+        fun_l6_n289(x)
+    else
+        fun_l6_n240(x)
+    end
+end
+
+def fun_l5_n446(x)
+    if (x < 1)
+        fun_l6_n398(x)
+    else
+        fun_l6_n273(x)
+    end
+end
+
+def fun_l5_n447(x)
+    if (x < 1)
+        fun_l6_n537(x)
+    else
+        fun_l6_n8(x)
+    end
+end
+
+def fun_l5_n448(x)
+    if (x < 1)
+        fun_l6_n801(x)
+    else
+        fun_l6_n389(x)
+    end
+end
+
+def fun_l5_n449(x)
+    if (x < 1)
+        fun_l6_n363(x)
+    else
+        fun_l6_n17(x)
+    end
+end
+
+def fun_l5_n450(x)
+    if (x < 1)
+        fun_l6_n511(x)
+    else
+        fun_l6_n151(x)
+    end
+end
+
+def fun_l5_n451(x)
+    if (x < 1)
+        fun_l6_n640(x)
+    else
+        fun_l6_n785(x)
+    end
+end
+
+def fun_l5_n452(x)
+    if (x < 1)
+        fun_l6_n961(x)
+    else
+        fun_l6_n567(x)
+    end
+end
+
+def fun_l5_n453(x)
+    if (x < 1)
+        fun_l6_n608(x)
+    else
+        fun_l6_n910(x)
+    end
+end
+
+def fun_l5_n454(x)
+    if (x < 1)
+        fun_l6_n898(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n455(x)
+    if (x < 1)
+        fun_l6_n205(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n456(x)
+    if (x < 1)
+        fun_l6_n374(x)
+    else
+        fun_l6_n544(x)
+    end
+end
+
+def fun_l5_n457(x)
+    if (x < 1)
+        fun_l6_n514(x)
+    else
+        fun_l6_n522(x)
+    end
+end
+
+def fun_l5_n458(x)
+    if (x < 1)
+        fun_l6_n385(x)
+    else
+        fun_l6_n808(x)
+    end
+end
+
+def fun_l5_n459(x)
+    if (x < 1)
+        fun_l6_n525(x)
+    else
+        fun_l6_n144(x)
+    end
+end
+
+def fun_l5_n460(x)
+    if (x < 1)
+        fun_l6_n781(x)
+    else
+        fun_l6_n180(x)
+    end
+end
+
+def fun_l5_n461(x)
+    if (x < 1)
+        fun_l6_n681(x)
+    else
+        fun_l6_n273(x)
+    end
+end
+
+def fun_l5_n462(x)
+    if (x < 1)
+        fun_l6_n497(x)
+    else
+        fun_l6_n399(x)
+    end
+end
+
+def fun_l5_n463(x)
+    if (x < 1)
+        fun_l6_n261(x)
+    else
+        fun_l6_n311(x)
+    end
+end
+
+def fun_l5_n464(x)
+    if (x < 1)
+        fun_l6_n64(x)
+    else
+        fun_l6_n253(x)
+    end
+end
+
+def fun_l5_n465(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n300(x)
+    end
+end
+
+def fun_l5_n466(x)
+    if (x < 1)
+        fun_l6_n822(x)
+    else
+        fun_l6_n277(x)
+    end
+end
+
+def fun_l5_n467(x)
+    if (x < 1)
+        fun_l6_n909(x)
+    else
+        fun_l6_n605(x)
+    end
+end
+
+def fun_l5_n468(x)
+    if (x < 1)
+        fun_l6_n879(x)
+    else
+        fun_l6_n870(x)
+    end
+end
+
+def fun_l5_n469(x)
+    if (x < 1)
+        fun_l6_n351(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n470(x)
+    if (x < 1)
+        fun_l6_n202(x)
+    else
+        fun_l6_n40(x)
+    end
+end
+
+def fun_l5_n471(x)
+    if (x < 1)
+        fun_l6_n782(x)
+    else
+        fun_l6_n839(x)
+    end
+end
+
+def fun_l5_n472(x)
+    if (x < 1)
+        fun_l6_n370(x)
+    else
+        fun_l6_n868(x)
+    end
+end
+
+def fun_l5_n473(x)
+    if (x < 1)
+        fun_l6_n556(x)
+    else
+        fun_l6_n722(x)
+    end
+end
+
+def fun_l5_n474(x)
+    if (x < 1)
+        fun_l6_n220(x)
+    else
+        fun_l6_n994(x)
+    end
+end
+
+def fun_l5_n475(x)
+    if (x < 1)
+        fun_l6_n266(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n476(x)
+    if (x < 1)
+        fun_l6_n720(x)
+    else
+        fun_l6_n412(x)
+    end
+end
+
+def fun_l5_n477(x)
+    if (x < 1)
+        fun_l6_n284(x)
+    else
+        fun_l6_n90(x)
+    end
+end
+
+def fun_l5_n478(x)
+    if (x < 1)
+        fun_l6_n716(x)
+    else
+        fun_l6_n125(x)
+    end
+end
+
+def fun_l5_n479(x)
+    if (x < 1)
+        fun_l6_n136(x)
+    else
+        fun_l6_n232(x)
+    end
+end
+
+def fun_l5_n480(x)
+    if (x < 1)
+        fun_l6_n627(x)
+    else
+        fun_l6_n641(x)
+    end
+end
+
+def fun_l5_n481(x)
+    if (x < 1)
+        fun_l6_n411(x)
+    else
+        fun_l6_n943(x)
+    end
+end
+
+def fun_l5_n482(x)
+    if (x < 1)
+        fun_l6_n86(x)
+    else
+        fun_l6_n839(x)
+    end
+end
+
+def fun_l5_n483(x)
+    if (x < 1)
+        fun_l6_n988(x)
+    else
+        fun_l6_n329(x)
+    end
+end
+
+def fun_l5_n484(x)
+    if (x < 1)
+        fun_l6_n595(x)
+    else
+        fun_l6_n499(x)
+    end
+end
+
+def fun_l5_n485(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n267(x)
+    end
+end
+
+def fun_l5_n486(x)
+    if (x < 1)
+        fun_l6_n334(x)
+    else
+        fun_l6_n459(x)
+    end
+end
+
+def fun_l5_n487(x)
+    if (x < 1)
+        fun_l6_n771(x)
+    else
+        fun_l6_n458(x)
+    end
+end
+
+def fun_l5_n488(x)
+    if (x < 1)
+        fun_l6_n609(x)
+    else
+        fun_l6_n280(x)
+    end
+end
+
+def fun_l5_n489(x)
+    if (x < 1)
+        fun_l6_n564(x)
+    else
+        fun_l6_n564(x)
+    end
+end
+
+def fun_l5_n490(x)
+    if (x < 1)
+        fun_l6_n271(x)
+    else
+        fun_l6_n904(x)
+    end
+end
+
+def fun_l5_n491(x)
+    if (x < 1)
+        fun_l6_n338(x)
+    else
+        fun_l6_n694(x)
+    end
+end
+
+def fun_l5_n492(x)
+    if (x < 1)
+        fun_l6_n596(x)
+    else
+        fun_l6_n191(x)
+    end
+end
+
+def fun_l5_n493(x)
+    if (x < 1)
+        fun_l6_n369(x)
+    else
+        fun_l6_n513(x)
+    end
+end
+
+def fun_l5_n494(x)
+    if (x < 1)
+        fun_l6_n972(x)
+    else
+        fun_l6_n945(x)
+    end
+end
+
+def fun_l5_n495(x)
+    if (x < 1)
+        fun_l6_n747(x)
+    else
+        fun_l6_n96(x)
+    end
+end
+
+def fun_l5_n496(x)
+    if (x < 1)
+        fun_l6_n220(x)
+    else
+        fun_l6_n665(x)
+    end
+end
+
+def fun_l5_n497(x)
+    if (x < 1)
+        fun_l6_n793(x)
+    else
+        fun_l6_n468(x)
+    end
+end
+
+def fun_l5_n498(x)
+    if (x < 1)
+        fun_l6_n227(x)
+    else
+        fun_l6_n576(x)
+    end
+end
+
+def fun_l5_n499(x)
+    if (x < 1)
+        fun_l6_n356(x)
+    else
+        fun_l6_n614(x)
+    end
+end
+
+def fun_l5_n500(x)
+    if (x < 1)
+        fun_l6_n256(x)
+    else
+        fun_l6_n237(x)
+    end
+end
+
+def fun_l5_n501(x)
+    if (x < 1)
+        fun_l6_n503(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n502(x)
+    if (x < 1)
+        fun_l6_n523(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n503(x)
+    if (x < 1)
+        fun_l6_n778(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n504(x)
+    if (x < 1)
+        fun_l6_n654(x)
+    else
+        fun_l6_n950(x)
+    end
+end
+
+def fun_l5_n505(x)
+    if (x < 1)
+        fun_l6_n105(x)
+    else
+        fun_l6_n881(x)
+    end
+end
+
+def fun_l5_n506(x)
+    if (x < 1)
+        fun_l6_n956(x)
+    else
+        fun_l6_n71(x)
+    end
+end
+
+def fun_l5_n507(x)
+    if (x < 1)
+        fun_l6_n33(x)
+    else
+        fun_l6_n431(x)
+    end
+end
+
+def fun_l5_n508(x)
+    if (x < 1)
+        fun_l6_n587(x)
+    else
+        fun_l6_n1(x)
+    end
+end
+
+def fun_l5_n509(x)
+    if (x < 1)
+        fun_l6_n258(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n510(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n558(x)
+    end
+end
+
+def fun_l5_n511(x)
+    if (x < 1)
+        fun_l6_n61(x)
+    else
+        fun_l6_n10(x)
+    end
+end
+
+def fun_l5_n512(x)
+    if (x < 1)
+        fun_l6_n674(x)
+    else
+        fun_l6_n466(x)
+    end
+end
+
+def fun_l5_n513(x)
+    if (x < 1)
+        fun_l6_n580(x)
+    else
+        fun_l6_n398(x)
+    end
+end
+
+def fun_l5_n514(x)
+    if (x < 1)
+        fun_l6_n495(x)
+    else
+        fun_l6_n407(x)
+    end
+end
+
+def fun_l5_n515(x)
+    if (x < 1)
+        fun_l6_n639(x)
+    else
+        fun_l6_n214(x)
+    end
+end
+
+def fun_l5_n516(x)
+    if (x < 1)
+        fun_l6_n15(x)
+    else
+        fun_l6_n716(x)
+    end
+end
+
+def fun_l5_n517(x)
+    if (x < 1)
+        fun_l6_n645(x)
+    else
+        fun_l6_n645(x)
+    end
+end
+
+def fun_l5_n518(x)
+    if (x < 1)
+        fun_l6_n615(x)
+    else
+        fun_l6_n44(x)
+    end
+end
+
+def fun_l5_n519(x)
+    if (x < 1)
+        fun_l6_n399(x)
+    else
+        fun_l6_n663(x)
+    end
+end
+
+def fun_l5_n520(x)
+    if (x < 1)
+        fun_l6_n85(x)
+    else
+        fun_l6_n870(x)
+    end
+end
+
+def fun_l5_n521(x)
+    if (x < 1)
+        fun_l6_n14(x)
+    else
+        fun_l6_n965(x)
+    end
+end
+
+def fun_l5_n522(x)
+    if (x < 1)
+        fun_l6_n24(x)
+    else
+        fun_l6_n581(x)
+    end
+end
+
+def fun_l5_n523(x)
+    if (x < 1)
+        fun_l6_n501(x)
+    else
+        fun_l6_n913(x)
+    end
+end
+
+def fun_l5_n524(x)
+    if (x < 1)
+        fun_l6_n772(x)
+    else
+        fun_l6_n999(x)
+    end
+end
+
+def fun_l5_n525(x)
+    if (x < 1)
+        fun_l6_n847(x)
+    else
+        fun_l6_n422(x)
+    end
+end
+
+def fun_l5_n526(x)
+    if (x < 1)
+        fun_l6_n377(x)
+    else
+        fun_l6_n986(x)
+    end
+end
+
+def fun_l5_n527(x)
+    if (x < 1)
+        fun_l6_n548(x)
+    else
+        fun_l6_n40(x)
+    end
+end
+
+def fun_l5_n528(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n577(x)
+    end
+end
+
+def fun_l5_n529(x)
+    if (x < 1)
+        fun_l6_n101(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n530(x)
+    if (x < 1)
+        fun_l6_n800(x)
+    else
+        fun_l6_n958(x)
+    end
+end
+
+def fun_l5_n531(x)
+    if (x < 1)
+        fun_l6_n72(x)
+    else
+        fun_l6_n887(x)
+    end
+end
+
+def fun_l5_n532(x)
+    if (x < 1)
+        fun_l6_n467(x)
+    else
+        fun_l6_n740(x)
+    end
+end
+
+def fun_l5_n533(x)
+    if (x < 1)
+        fun_l6_n264(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n534(x)
+    if (x < 1)
+        fun_l6_n953(x)
+    else
+        fun_l6_n560(x)
+    end
+end
+
+def fun_l5_n535(x)
+    if (x < 1)
+        fun_l6_n854(x)
+    else
+        fun_l6_n59(x)
+    end
+end
+
+def fun_l5_n536(x)
+    if (x < 1)
+        fun_l6_n940(x)
+    else
+        fun_l6_n832(x)
+    end
+end
+
+def fun_l5_n537(x)
+    if (x < 1)
+        fun_l6_n297(x)
+    else
+        fun_l6_n18(x)
+    end
+end
+
+def fun_l5_n538(x)
+    if (x < 1)
+        fun_l6_n188(x)
+    else
+        fun_l6_n537(x)
+    end
+end
+
+def fun_l5_n539(x)
+    if (x < 1)
+        fun_l6_n992(x)
+    else
+        fun_l6_n825(x)
+    end
+end
+
+def fun_l5_n540(x)
+    if (x < 1)
+        fun_l6_n691(x)
+    else
+        fun_l6_n850(x)
+    end
+end
+
+def fun_l5_n541(x)
+    if (x < 1)
+        fun_l6_n858(x)
+    else
+        fun_l6_n948(x)
+    end
+end
+
+def fun_l5_n542(x)
+    if (x < 1)
+        fun_l6_n923(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n543(x)
+    if (x < 1)
+        fun_l6_n419(x)
+    else
+        fun_l6_n4(x)
+    end
+end
+
+def fun_l5_n544(x)
+    if (x < 1)
+        fun_l6_n766(x)
+    else
+        fun_l6_n147(x)
+    end
+end
+
+def fun_l5_n545(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n327(x)
+    end
+end
+
+def fun_l5_n546(x)
+    if (x < 1)
+        fun_l6_n94(x)
+    else
+        fun_l6_n662(x)
+    end
+end
+
+def fun_l5_n547(x)
+    if (x < 1)
+        fun_l6_n764(x)
+    else
+        fun_l6_n521(x)
+    end
+end
+
+def fun_l5_n548(x)
+    if (x < 1)
+        fun_l6_n509(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n549(x)
+    if (x < 1)
+        fun_l6_n370(x)
+    else
+        fun_l6_n599(x)
+    end
+end
+
+def fun_l5_n550(x)
+    if (x < 1)
+        fun_l6_n710(x)
+    else
+        fun_l6_n104(x)
+    end
+end
+
+def fun_l5_n551(x)
+    if (x < 1)
+        fun_l6_n677(x)
+    else
+        fun_l6_n184(x)
+    end
+end
+
+def fun_l5_n552(x)
+    if (x < 1)
+        fun_l6_n700(x)
+    else
+        fun_l6_n299(x)
+    end
+end
+
+def fun_l5_n553(x)
+    if (x < 1)
+        fun_l6_n688(x)
+    else
+        fun_l6_n934(x)
+    end
+end
+
+def fun_l5_n554(x)
+    if (x < 1)
+        fun_l6_n771(x)
+    else
+        fun_l6_n989(x)
+    end
+end
+
+def fun_l5_n555(x)
+    if (x < 1)
+        fun_l6_n164(x)
+    else
+        fun_l6_n197(x)
+    end
+end
+
+def fun_l5_n556(x)
+    if (x < 1)
+        fun_l6_n901(x)
+    else
+        fun_l6_n235(x)
+    end
+end
+
+def fun_l5_n557(x)
+    if (x < 1)
+        fun_l6_n990(x)
+    else
+        fun_l6_n490(x)
+    end
+end
+
+def fun_l5_n558(x)
+    if (x < 1)
+        fun_l6_n476(x)
+    else
+        fun_l6_n612(x)
+    end
+end
+
+def fun_l5_n559(x)
+    if (x < 1)
+        fun_l6_n761(x)
+    else
+        fun_l6_n3(x)
+    end
+end
+
+def fun_l5_n560(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n832(x)
+    end
+end
+
+def fun_l5_n561(x)
+    if (x < 1)
+        fun_l6_n206(x)
+    else
+        fun_l6_n815(x)
+    end
+end
+
+def fun_l5_n562(x)
+    if (x < 1)
+        fun_l6_n180(x)
+    else
+        fun_l6_n640(x)
+    end
+end
+
+def fun_l5_n563(x)
+    if (x < 1)
+        fun_l6_n612(x)
+    else
+        fun_l6_n900(x)
+    end
+end
+
+def fun_l5_n564(x)
+    if (x < 1)
+        fun_l6_n31(x)
+    else
+        fun_l6_n290(x)
+    end
+end
+
+def fun_l5_n565(x)
+    if (x < 1)
+        fun_l6_n322(x)
+    else
+        fun_l6_n136(x)
+    end
+end
+
+def fun_l5_n566(x)
+    if (x < 1)
+        fun_l6_n657(x)
+    else
+        fun_l6_n649(x)
+    end
+end
+
+def fun_l5_n567(x)
+    if (x < 1)
+        fun_l6_n683(x)
+    else
+        fun_l6_n903(x)
+    end
+end
+
+def fun_l5_n568(x)
+    if (x < 1)
+        fun_l6_n391(x)
+    else
+        fun_l6_n117(x)
+    end
+end
+
+def fun_l5_n569(x)
+    if (x < 1)
+        fun_l6_n868(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n570(x)
+    if (x < 1)
+        fun_l6_n493(x)
+    else
+        fun_l6_n638(x)
+    end
+end
+
+def fun_l5_n571(x)
+    if (x < 1)
+        fun_l6_n207(x)
+    else
+        fun_l6_n650(x)
+    end
+end
+
+def fun_l5_n572(x)
+    if (x < 1)
+        fun_l6_n575(x)
+    else
+        fun_l6_n421(x)
+    end
+end
+
+def fun_l5_n573(x)
+    if (x < 1)
+        fun_l6_n757(x)
+    else
+        fun_l6_n515(x)
+    end
+end
+
+def fun_l5_n574(x)
+    if (x < 1)
+        fun_l6_n619(x)
+    else
+        fun_l6_n39(x)
+    end
+end
+
+def fun_l5_n575(x)
+    if (x < 1)
+        fun_l6_n91(x)
+    else
+        fun_l6_n79(x)
+    end
+end
+
+def fun_l5_n576(x)
+    if (x < 1)
+        fun_l6_n492(x)
+    else
+        fun_l6_n938(x)
+    end
+end
+
+def fun_l5_n577(x)
+    if (x < 1)
+        fun_l6_n181(x)
+    else
+        fun_l6_n98(x)
+    end
+end
+
+def fun_l5_n578(x)
+    if (x < 1)
+        fun_l6_n823(x)
+    else
+        fun_l6_n528(x)
+    end
+end
+
+def fun_l5_n579(x)
+    if (x < 1)
+        fun_l6_n218(x)
+    else
+        fun_l6_n613(x)
+    end
+end
+
+def fun_l5_n580(x)
+    if (x < 1)
+        fun_l6_n81(x)
+    else
+        fun_l6_n318(x)
+    end
+end
+
+def fun_l5_n581(x)
+    if (x < 1)
+        fun_l6_n953(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n582(x)
+    if (x < 1)
+        fun_l6_n225(x)
+    else
+        fun_l6_n441(x)
+    end
+end
+
+def fun_l5_n583(x)
+    if (x < 1)
+        fun_l6_n862(x)
+    else
+        fun_l6_n939(x)
+    end
+end
+
+def fun_l5_n584(x)
+    if (x < 1)
+        fun_l6_n401(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n585(x)
+    if (x < 1)
+        fun_l6_n94(x)
+    else
+        fun_l6_n320(x)
+    end
+end
+
+def fun_l5_n586(x)
+    if (x < 1)
+        fun_l6_n609(x)
+    else
+        fun_l6_n524(x)
+    end
+end
+
+def fun_l5_n587(x)
+    if (x < 1)
+        fun_l6_n412(x)
+    else
+        fun_l6_n350(x)
+    end
+end
+
+def fun_l5_n588(x)
+    if (x < 1)
+        fun_l6_n874(x)
+    else
+        fun_l6_n217(x)
+    end
+end
+
+def fun_l5_n589(x)
+    if (x < 1)
+        fun_l6_n989(x)
+    else
+        fun_l6_n62(x)
+    end
+end
+
+def fun_l5_n590(x)
+    if (x < 1)
+        fun_l6_n91(x)
+    else
+        fun_l6_n360(x)
+    end
+end
+
+def fun_l5_n591(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n530(x)
+    end
+end
+
+def fun_l5_n592(x)
+    if (x < 1)
+        fun_l6_n635(x)
+    else
+        fun_l6_n268(x)
+    end
+end
+
+def fun_l5_n593(x)
+    if (x < 1)
+        fun_l6_n747(x)
+    else
+        fun_l6_n345(x)
+    end
+end
+
+def fun_l5_n594(x)
+    if (x < 1)
+        fun_l6_n450(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n595(x)
+    if (x < 1)
+        fun_l6_n960(x)
+    else
+        fun_l6_n256(x)
+    end
+end
+
+def fun_l5_n596(x)
+    if (x < 1)
+        fun_l6_n724(x)
+    else
+        fun_l6_n506(x)
+    end
+end
+
+def fun_l5_n597(x)
+    if (x < 1)
+        fun_l6_n809(x)
+    else
+        fun_l6_n180(x)
+    end
+end
+
+def fun_l5_n598(x)
+    if (x < 1)
+        fun_l6_n799(x)
+    else
+        fun_l6_n59(x)
+    end
+end
+
+def fun_l5_n599(x)
+    if (x < 1)
+        fun_l6_n412(x)
+    else
+        fun_l6_n868(x)
+    end
+end
+
+def fun_l5_n600(x)
+    if (x < 1)
+        fun_l6_n459(x)
+    else
+        fun_l6_n537(x)
+    end
+end
+
+def fun_l5_n601(x)
+    if (x < 1)
+        fun_l6_n321(x)
+    else
+        fun_l6_n39(x)
+    end
+end
+
+def fun_l5_n602(x)
+    if (x < 1)
+        fun_l6_n561(x)
+    else
+        fun_l6_n413(x)
+    end
+end
+
+def fun_l5_n603(x)
+    if (x < 1)
+        fun_l6_n173(x)
+    else
+        fun_l6_n324(x)
+    end
+end
+
+def fun_l5_n604(x)
+    if (x < 1)
+        fun_l6_n583(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n605(x)
+    if (x < 1)
+        fun_l6_n200(x)
+    else
+        fun_l6_n996(x)
+    end
+end
+
+def fun_l5_n606(x)
+    if (x < 1)
+        fun_l6_n465(x)
+    else
+        fun_l6_n777(x)
+    end
+end
+
+def fun_l5_n607(x)
+    if (x < 1)
+        fun_l6_n744(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n608(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n751(x)
+    end
+end
+
+def fun_l5_n609(x)
+    if (x < 1)
+        fun_l6_n357(x)
+    else
+        fun_l6_n889(x)
+    end
+end
+
+def fun_l5_n610(x)
+    if (x < 1)
+        fun_l6_n534(x)
+    else
+        fun_l6_n628(x)
+    end
+end
+
+def fun_l5_n611(x)
+    if (x < 1)
+        fun_l6_n242(x)
+    else
+        fun_l6_n57(x)
+    end
+end
+
+def fun_l5_n612(x)
+    if (x < 1)
+        fun_l6_n426(x)
+    else
+        fun_l6_n295(x)
+    end
+end
+
+def fun_l5_n613(x)
+    if (x < 1)
+        fun_l6_n218(x)
+    else
+        fun_l6_n194(x)
+    end
+end
+
+def fun_l5_n614(x)
+    if (x < 1)
+        fun_l6_n618(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n615(x)
+    if (x < 1)
+        fun_l6_n708(x)
+    else
+        fun_l6_n187(x)
+    end
+end
+
+def fun_l5_n616(x)
+    if (x < 1)
+        fun_l6_n824(x)
+    else
+        fun_l6_n384(x)
+    end
+end
+
+def fun_l5_n617(x)
+    if (x < 1)
+        fun_l6_n149(x)
+    else
+        fun_l6_n741(x)
+    end
+end
+
+def fun_l5_n618(x)
+    if (x < 1)
+        fun_l6_n889(x)
+    else
+        fun_l6_n768(x)
+    end
+end
+
+def fun_l5_n619(x)
+    if (x < 1)
+        fun_l6_n144(x)
+    else
+        fun_l6_n746(x)
+    end
+end
+
+def fun_l5_n620(x)
+    if (x < 1)
+        fun_l6_n338(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n621(x)
+    if (x < 1)
+        fun_l6_n623(x)
+    else
+        fun_l6_n432(x)
+    end
+end
+
+def fun_l5_n622(x)
+    if (x < 1)
+        fun_l6_n139(x)
+    else
+        fun_l6_n162(x)
+    end
+end
+
+def fun_l5_n623(x)
+    if (x < 1)
+        fun_l6_n371(x)
+    else
+        fun_l6_n297(x)
+    end
+end
+
+def fun_l5_n624(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n172(x)
+    end
+end
+
+def fun_l5_n625(x)
+    if (x < 1)
+        fun_l6_n506(x)
+    else
+        fun_l6_n7(x)
+    end
+end
+
+def fun_l5_n626(x)
+    if (x < 1)
+        fun_l6_n334(x)
+    else
+        fun_l6_n631(x)
+    end
+end
+
+def fun_l5_n627(x)
+    if (x < 1)
+        fun_l6_n209(x)
+    else
+        fun_l6_n316(x)
+    end
+end
+
+def fun_l5_n628(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n34(x)
+    end
+end
+
+def fun_l5_n629(x)
+    if (x < 1)
+        fun_l6_n6(x)
+    else
+        fun_l6_n818(x)
+    end
+end
+
+def fun_l5_n630(x)
+    if (x < 1)
+        fun_l6_n265(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n631(x)
+    if (x < 1)
+        fun_l6_n493(x)
+    else
+        fun_l6_n64(x)
+    end
+end
+
+def fun_l5_n632(x)
+    if (x < 1)
+        fun_l6_n513(x)
+    else
+        fun_l6_n890(x)
+    end
+end
+
+def fun_l5_n633(x)
+    if (x < 1)
+        fun_l6_n295(x)
+    else
+        fun_l6_n295(x)
+    end
+end
+
+def fun_l5_n634(x)
+    if (x < 1)
+        fun_l6_n158(x)
+    else
+        fun_l6_n971(x)
+    end
+end
+
+def fun_l5_n635(x)
+    if (x < 1)
+        fun_l6_n171(x)
+    else
+        fun_l6_n337(x)
+    end
+end
+
+def fun_l5_n636(x)
+    if (x < 1)
+        fun_l6_n943(x)
+    else
+        fun_l6_n502(x)
+    end
+end
+
+def fun_l5_n637(x)
+    if (x < 1)
+        fun_l6_n339(x)
+    else
+        fun_l6_n638(x)
+    end
+end
+
+def fun_l5_n638(x)
+    if (x < 1)
+        fun_l6_n155(x)
+    else
+        fun_l6_n393(x)
+    end
+end
+
+def fun_l5_n639(x)
+    if (x < 1)
+        fun_l6_n29(x)
+    else
+        fun_l6_n506(x)
+    end
+end
+
+def fun_l5_n640(x)
+    if (x < 1)
+        fun_l6_n677(x)
+    else
+        fun_l6_n606(x)
+    end
+end
+
+def fun_l5_n641(x)
+    if (x < 1)
+        fun_l6_n306(x)
+    else
+        fun_l6_n571(x)
+    end
+end
+
+def fun_l5_n642(x)
+    if (x < 1)
+        fun_l6_n490(x)
+    else
+        fun_l6_n281(x)
+    end
+end
+
+def fun_l5_n643(x)
+    if (x < 1)
+        fun_l6_n392(x)
+    else
+        fun_l6_n686(x)
+    end
+end
+
+def fun_l5_n644(x)
+    if (x < 1)
+        fun_l6_n257(x)
+    else
+        fun_l6_n358(x)
+    end
+end
+
+def fun_l5_n645(x)
+    if (x < 1)
+        fun_l6_n949(x)
+    else
+        fun_l6_n15(x)
+    end
+end
+
+def fun_l5_n646(x)
+    if (x < 1)
+        fun_l6_n866(x)
+    else
+        fun_l6_n657(x)
+    end
+end
+
+def fun_l5_n647(x)
+    if (x < 1)
+        fun_l6_n624(x)
+    else
+        fun_l6_n390(x)
+    end
+end
+
+def fun_l5_n648(x)
+    if (x < 1)
+        fun_l6_n394(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n649(x)
+    if (x < 1)
+        fun_l6_n99(x)
+    else
+        fun_l6_n160(x)
+    end
+end
+
+def fun_l5_n650(x)
+    if (x < 1)
+        fun_l6_n84(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n651(x)
+    if (x < 1)
+        fun_l6_n635(x)
+    else
+        fun_l6_n507(x)
+    end
+end
+
+def fun_l5_n652(x)
+    if (x < 1)
+        fun_l6_n674(x)
+    else
+        fun_l6_n501(x)
+    end
+end
+
+def fun_l5_n653(x)
+    if (x < 1)
+        fun_l6_n171(x)
+    else
+        fun_l6_n645(x)
+    end
+end
+
+def fun_l5_n654(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n152(x)
+    end
+end
+
+def fun_l5_n655(x)
+    if (x < 1)
+        fun_l6_n210(x)
+    else
+        fun_l6_n441(x)
+    end
+end
+
+def fun_l5_n656(x)
+    if (x < 1)
+        fun_l6_n691(x)
+    else
+        fun_l6_n813(x)
+    end
+end
+
+def fun_l5_n657(x)
+    if (x < 1)
+        fun_l6_n671(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n658(x)
+    if (x < 1)
+        fun_l6_n939(x)
+    else
+        fun_l6_n580(x)
+    end
+end
+
+def fun_l5_n659(x)
+    if (x < 1)
+        fun_l6_n152(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n660(x)
+    if (x < 1)
+        fun_l6_n50(x)
+    else
+        fun_l6_n911(x)
+    end
+end
+
+def fun_l5_n661(x)
+    if (x < 1)
+        fun_l6_n700(x)
+    else
+        fun_l6_n972(x)
+    end
+end
+
+def fun_l5_n662(x)
+    if (x < 1)
+        fun_l6_n22(x)
+    else
+        fun_l6_n82(x)
+    end
+end
+
+def fun_l5_n663(x)
+    if (x < 1)
+        fun_l6_n51(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n664(x)
+    if (x < 1)
+        fun_l6_n997(x)
+    else
+        fun_l6_n289(x)
+    end
+end
+
+def fun_l5_n665(x)
+    if (x < 1)
+        fun_l6_n666(x)
+    else
+        fun_l6_n775(x)
+    end
+end
+
+def fun_l5_n666(x)
+    if (x < 1)
+        fun_l6_n373(x)
+    else
+        fun_l6_n175(x)
+    end
+end
+
+def fun_l5_n667(x)
+    if (x < 1)
+        fun_l6_n551(x)
+    else
+        fun_l6_n772(x)
+    end
+end
+
+def fun_l5_n668(x)
+    if (x < 1)
+        fun_l6_n107(x)
+    else
+        fun_l6_n197(x)
+    end
+end
+
+def fun_l5_n669(x)
+    if (x < 1)
+        fun_l6_n244(x)
+    else
+        fun_l6_n968(x)
+    end
+end
+
+def fun_l5_n670(x)
+    if (x < 1)
+        fun_l6_n798(x)
+    else
+        fun_l6_n30(x)
+    end
+end
+
+def fun_l5_n671(x)
+    if (x < 1)
+        fun_l6_n48(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n672(x)
+    if (x < 1)
+        fun_l6_n373(x)
+    else
+        fun_l6_n937(x)
+    end
+end
+
+def fun_l5_n673(x)
+    if (x < 1)
+        fun_l6_n759(x)
+    else
+        fun_l6_n92(x)
+    end
+end
+
+def fun_l5_n674(x)
+    if (x < 1)
+        fun_l6_n380(x)
+    else
+        fun_l6_n772(x)
+    end
+end
+
+def fun_l5_n675(x)
+    if (x < 1)
+        fun_l6_n916(x)
+    else
+        fun_l6_n329(x)
+    end
+end
+
+def fun_l5_n676(x)
+    if (x < 1)
+        fun_l6_n110(x)
+    else
+        fun_l6_n951(x)
+    end
+end
+
+def fun_l5_n677(x)
+    if (x < 1)
+        fun_l6_n363(x)
+    else
+        fun_l6_n35(x)
+    end
+end
+
+def fun_l5_n678(x)
+    if (x < 1)
+        fun_l6_n484(x)
+    else
+        fun_l6_n492(x)
+    end
+end
+
+def fun_l5_n679(x)
+    if (x < 1)
+        fun_l6_n801(x)
+    else
+        fun_l6_n279(x)
+    end
+end
+
+def fun_l5_n680(x)
+    if (x < 1)
+        fun_l6_n499(x)
+    else
+        fun_l6_n561(x)
+    end
+end
+
+def fun_l5_n681(x)
+    if (x < 1)
+        fun_l6_n800(x)
+    else
+        fun_l6_n890(x)
+    end
+end
+
+def fun_l5_n682(x)
+    if (x < 1)
+        fun_l6_n191(x)
+    else
+        fun_l6_n686(x)
+    end
+end
+
+def fun_l5_n683(x)
+    if (x < 1)
+        fun_l6_n318(x)
+    else
+        fun_l6_n683(x)
+    end
+end
+
+def fun_l5_n684(x)
+    if (x < 1)
+        fun_l6_n500(x)
+    else
+        fun_l6_n914(x)
+    end
+end
+
+def fun_l5_n685(x)
+    if (x < 1)
+        fun_l6_n24(x)
+    else
+        fun_l6_n945(x)
+    end
+end
+
+def fun_l5_n686(x)
+    if (x < 1)
+        fun_l6_n602(x)
+    else
+        fun_l6_n291(x)
+    end
+end
+
+def fun_l5_n687(x)
+    if (x < 1)
+        fun_l6_n999(x)
+    else
+        fun_l6_n86(x)
+    end
+end
+
+def fun_l5_n688(x)
+    if (x < 1)
+        fun_l6_n106(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n689(x)
+    if (x < 1)
+        fun_l6_n452(x)
+    else
+        fun_l6_n229(x)
+    end
+end
+
+def fun_l5_n690(x)
+    if (x < 1)
+        fun_l6_n672(x)
+    else
+        fun_l6_n587(x)
+    end
+end
+
+def fun_l5_n691(x)
+    if (x < 1)
+        fun_l6_n532(x)
+    else
+        fun_l6_n56(x)
+    end
+end
+
+def fun_l5_n692(x)
+    if (x < 1)
+        fun_l6_n606(x)
+    else
+        fun_l6_n552(x)
+    end
+end
+
+def fun_l5_n693(x)
+    if (x < 1)
+        fun_l6_n742(x)
+    else
+        fun_l6_n862(x)
+    end
+end
+
+def fun_l5_n694(x)
+    if (x < 1)
+        fun_l6_n964(x)
+    else
+        fun_l6_n475(x)
+    end
+end
+
+def fun_l5_n695(x)
+    if (x < 1)
+        fun_l6_n179(x)
+    else
+        fun_l6_n947(x)
+    end
+end
+
+def fun_l5_n696(x)
+    if (x < 1)
+        fun_l6_n563(x)
+    else
+        fun_l6_n329(x)
+    end
+end
+
+def fun_l5_n697(x)
+    if (x < 1)
+        fun_l6_n786(x)
+    else
+        fun_l6_n502(x)
+    end
+end
+
+def fun_l5_n698(x)
+    if (x < 1)
+        fun_l6_n178(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n699(x)
+    if (x < 1)
+        fun_l6_n248(x)
+    else
+        fun_l6_n288(x)
+    end
+end
+
+def fun_l5_n700(x)
+    if (x < 1)
+        fun_l6_n262(x)
+    else
+        fun_l6_n650(x)
+    end
+end
+
+def fun_l5_n701(x)
+    if (x < 1)
+        fun_l6_n90(x)
+    else
+        fun_l6_n964(x)
+    end
+end
+
+def fun_l5_n702(x)
+    if (x < 1)
+        fun_l6_n864(x)
+    else
+        fun_l6_n743(x)
+    end
+end
+
+def fun_l5_n703(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n364(x)
+    end
+end
+
+def fun_l5_n704(x)
+    if (x < 1)
+        fun_l6_n590(x)
+    else
+        fun_l6_n434(x)
+    end
+end
+
+def fun_l5_n705(x)
+    if (x < 1)
+        fun_l6_n875(x)
+    else
+        fun_l6_n539(x)
+    end
+end
+
+def fun_l5_n706(x)
+    if (x < 1)
+        fun_l6_n964(x)
+    else
+        fun_l6_n564(x)
+    end
+end
+
+def fun_l5_n707(x)
+    if (x < 1)
+        fun_l6_n315(x)
+    else
+        fun_l6_n460(x)
+    end
+end
+
+def fun_l5_n708(x)
+    if (x < 1)
+        fun_l6_n139(x)
+    else
+        fun_l6_n210(x)
+    end
+end
+
+def fun_l5_n709(x)
+    if (x < 1)
+        fun_l6_n593(x)
+    else
+        fun_l6_n933(x)
+    end
+end
+
+def fun_l5_n710(x)
+    if (x < 1)
+        fun_l6_n37(x)
+    else
+        fun_l6_n459(x)
+    end
+end
+
+def fun_l5_n711(x)
+    if (x < 1)
+        fun_l6_n768(x)
+    else
+        fun_l6_n256(x)
+    end
+end
+
+def fun_l5_n712(x)
+    if (x < 1)
+        fun_l6_n506(x)
+    else
+        fun_l6_n936(x)
+    end
+end
+
+def fun_l5_n713(x)
+    if (x < 1)
+        fun_l6_n971(x)
+    else
+        fun_l6_n575(x)
+    end
+end
+
+def fun_l5_n714(x)
+    if (x < 1)
+        fun_l6_n498(x)
+    else
+        fun_l6_n932(x)
+    end
+end
+
+def fun_l5_n715(x)
+    if (x < 1)
+        fun_l6_n362(x)
+    else
+        fun_l6_n949(x)
+    end
+end
+
+def fun_l5_n716(x)
+    if (x < 1)
+        fun_l6_n706(x)
+    else
+        fun_l6_n788(x)
+    end
+end
+
+def fun_l5_n717(x)
+    if (x < 1)
+        fun_l6_n405(x)
+    else
+        fun_l6_n803(x)
+    end
+end
+
+def fun_l5_n718(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n917(x)
+    end
+end
+
+def fun_l5_n719(x)
+    if (x < 1)
+        fun_l6_n899(x)
+    else
+        fun_l6_n836(x)
+    end
+end
+
+def fun_l5_n720(x)
+    if (x < 1)
+        fun_l6_n805(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n721(x)
+    if (x < 1)
+        fun_l6_n960(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n722(x)
+    if (x < 1)
+        fun_l6_n807(x)
+    else
+        fun_l6_n533(x)
+    end
+end
+
+def fun_l5_n723(x)
+    if (x < 1)
+        fun_l6_n480(x)
+    else
+        fun_l6_n907(x)
+    end
+end
+
+def fun_l5_n724(x)
+    if (x < 1)
+        fun_l6_n951(x)
+    else
+        fun_l6_n793(x)
+    end
+end
+
+def fun_l5_n725(x)
+    if (x < 1)
+        fun_l6_n951(x)
+    else
+        fun_l6_n771(x)
+    end
+end
+
+def fun_l5_n726(x)
+    if (x < 1)
+        fun_l6_n435(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n727(x)
+    if (x < 1)
+        fun_l6_n222(x)
+    else
+        fun_l6_n393(x)
+    end
+end
+
+def fun_l5_n728(x)
+    if (x < 1)
+        fun_l6_n988(x)
+    else
+        fun_l6_n402(x)
+    end
+end
+
+def fun_l5_n729(x)
+    if (x < 1)
+        fun_l6_n9(x)
+    else
+        fun_l6_n46(x)
+    end
+end
+
+def fun_l5_n730(x)
+    if (x < 1)
+        fun_l6_n722(x)
+    else
+        fun_l6_n112(x)
+    end
+end
+
+def fun_l5_n731(x)
+    if (x < 1)
+        fun_l6_n543(x)
+    else
+        fun_l6_n813(x)
+    end
+end
+
+def fun_l5_n732(x)
+    if (x < 1)
+        fun_l6_n337(x)
+    else
+        fun_l6_n245(x)
+    end
+end
+
+def fun_l5_n733(x)
+    if (x < 1)
+        fun_l6_n84(x)
+    else
+        fun_l6_n335(x)
+    end
+end
+
+def fun_l5_n734(x)
+    if (x < 1)
+        fun_l6_n697(x)
+    else
+        fun_l6_n498(x)
+    end
+end
+
+def fun_l5_n735(x)
+    if (x < 1)
+        fun_l6_n2(x)
+    else
+        fun_l6_n895(x)
+    end
+end
+
+def fun_l5_n736(x)
+    if (x < 1)
+        fun_l6_n619(x)
+    else
+        fun_l6_n163(x)
+    end
+end
+
+def fun_l5_n737(x)
+    if (x < 1)
+        fun_l6_n237(x)
+    else
+        fun_l6_n6(x)
+    end
+end
+
+def fun_l5_n738(x)
+    if (x < 1)
+        fun_l6_n259(x)
+    else
+        fun_l6_n95(x)
+    end
+end
+
+def fun_l5_n739(x)
+    if (x < 1)
+        fun_l6_n98(x)
+    else
+        fun_l6_n331(x)
+    end
+end
+
+def fun_l5_n740(x)
+    if (x < 1)
+        fun_l6_n489(x)
+    else
+        fun_l6_n305(x)
+    end
+end
+
+def fun_l5_n741(x)
+    if (x < 1)
+        fun_l6_n493(x)
+    else
+        fun_l6_n525(x)
+    end
+end
+
+def fun_l5_n742(x)
+    if (x < 1)
+        fun_l6_n269(x)
+    else
+        fun_l6_n742(x)
+    end
+end
+
+def fun_l5_n743(x)
+    if (x < 1)
+        fun_l6_n194(x)
+    else
+        fun_l6_n254(x)
+    end
+end
+
+def fun_l5_n744(x)
+    if (x < 1)
+        fun_l6_n247(x)
+    else
+        fun_l6_n909(x)
+    end
+end
+
+def fun_l5_n745(x)
+    if (x < 1)
+        fun_l6_n388(x)
+    else
+        fun_l6_n657(x)
+    end
+end
+
+def fun_l5_n746(x)
+    if (x < 1)
+        fun_l6_n27(x)
+    else
+        fun_l6_n286(x)
+    end
+end
+
+def fun_l5_n747(x)
+    if (x < 1)
+        fun_l6_n659(x)
+    else
+        fun_l6_n895(x)
+    end
+end
+
+def fun_l5_n748(x)
+    if (x < 1)
+        fun_l6_n538(x)
+    else
+        fun_l6_n667(x)
+    end
+end
+
+def fun_l5_n749(x)
+    if (x < 1)
+        fun_l6_n208(x)
+    else
+        fun_l6_n493(x)
+    end
+end
+
+def fun_l5_n750(x)
+    if (x < 1)
+        fun_l6_n326(x)
+    else
+        fun_l6_n570(x)
+    end
+end
+
+def fun_l5_n751(x)
+    if (x < 1)
+        fun_l6_n437(x)
+    else
+        fun_l6_n716(x)
+    end
+end
+
+def fun_l5_n752(x)
+    if (x < 1)
+        fun_l6_n957(x)
+    else
+        fun_l6_n231(x)
+    end
+end
+
+def fun_l5_n753(x)
+    if (x < 1)
+        fun_l6_n846(x)
+    else
+        fun_l6_n900(x)
+    end
+end
+
+def fun_l5_n754(x)
+    if (x < 1)
+        fun_l6_n81(x)
+    else
+        fun_l6_n464(x)
+    end
+end
+
+def fun_l5_n755(x)
+    if (x < 1)
+        fun_l6_n735(x)
+    else
+        fun_l6_n232(x)
+    end
+end
+
+def fun_l5_n756(x)
+    if (x < 1)
+        fun_l6_n577(x)
+    else
+        fun_l6_n804(x)
+    end
+end
+
+def fun_l5_n757(x)
+    if (x < 1)
+        fun_l6_n363(x)
+    else
+        fun_l6_n155(x)
+    end
+end
+
+def fun_l5_n758(x)
+    if (x < 1)
+        fun_l6_n534(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n759(x)
+    if (x < 1)
+        fun_l6_n711(x)
+    else
+        fun_l6_n53(x)
+    end
+end
+
+def fun_l5_n760(x)
+    if (x < 1)
+        fun_l6_n80(x)
+    else
+        fun_l6_n734(x)
+    end
+end
+
+def fun_l5_n761(x)
+    if (x < 1)
+        fun_l6_n811(x)
+    else
+        fun_l6_n691(x)
+    end
+end
+
+def fun_l5_n762(x)
+    if (x < 1)
+        fun_l6_n847(x)
+    else
+        fun_l6_n570(x)
+    end
+end
+
+def fun_l5_n763(x)
+    if (x < 1)
+        fun_l6_n30(x)
+    else
+        fun_l6_n283(x)
+    end
+end
+
+def fun_l5_n764(x)
+    if (x < 1)
+        fun_l6_n270(x)
+    else
+        fun_l6_n965(x)
+    end
+end
+
+def fun_l5_n765(x)
+    if (x < 1)
+        fun_l6_n936(x)
+    else
+        fun_l6_n772(x)
+    end
+end
+
+def fun_l5_n766(x)
+    if (x < 1)
+        fun_l6_n181(x)
+    else
+        fun_l6_n682(x)
+    end
+end
+
+def fun_l5_n767(x)
+    if (x < 1)
+        fun_l6_n327(x)
+    else
+        fun_l6_n5(x)
+    end
+end
+
+def fun_l5_n768(x)
+    if (x < 1)
+        fun_l6_n296(x)
+    else
+        fun_l6_n940(x)
+    end
+end
+
+def fun_l5_n769(x)
+    if (x < 1)
+        fun_l6_n543(x)
+    else
+        fun_l6_n871(x)
+    end
+end
+
+def fun_l5_n770(x)
+    if (x < 1)
+        fun_l6_n670(x)
+    else
+        fun_l6_n128(x)
+    end
+end
+
+def fun_l5_n771(x)
+    if (x < 1)
+        fun_l6_n184(x)
+    else
+        fun_l6_n794(x)
+    end
+end
+
+def fun_l5_n772(x)
+    if (x < 1)
+        fun_l6_n571(x)
+    else
+        fun_l6_n337(x)
+    end
+end
+
+def fun_l5_n773(x)
+    if (x < 1)
+        fun_l6_n674(x)
+    else
+        fun_l6_n712(x)
+    end
+end
+
+def fun_l5_n774(x)
+    if (x < 1)
+        fun_l6_n572(x)
+    else
+        fun_l6_n944(x)
+    end
+end
+
+def fun_l5_n775(x)
+    if (x < 1)
+        fun_l6_n122(x)
+    else
+        fun_l6_n897(x)
+    end
+end
+
+def fun_l5_n776(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n202(x)
+    end
+end
+
+def fun_l5_n777(x)
+    if (x < 1)
+        fun_l6_n99(x)
+    else
+        fun_l6_n256(x)
+    end
+end
+
+def fun_l5_n778(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n138(x)
+    end
+end
+
+def fun_l5_n779(x)
+    if (x < 1)
+        fun_l6_n56(x)
+    else
+        fun_l6_n682(x)
+    end
+end
+
+def fun_l5_n780(x)
+    if (x < 1)
+        fun_l6_n10(x)
+    else
+        fun_l6_n238(x)
+    end
+end
+
+def fun_l5_n781(x)
+    if (x < 1)
+        fun_l6_n577(x)
+    else
+        fun_l6_n590(x)
+    end
+end
+
+def fun_l5_n782(x)
+    if (x < 1)
+        fun_l6_n415(x)
+    else
+        fun_l6_n522(x)
+    end
+end
+
+def fun_l5_n783(x)
+    if (x < 1)
+        fun_l6_n255(x)
+    else
+        fun_l6_n182(x)
+    end
+end
+
+def fun_l5_n784(x)
+    if (x < 1)
+        fun_l6_n755(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n785(x)
+    if (x < 1)
+        fun_l6_n39(x)
+    else
+        fun_l6_n296(x)
+    end
+end
+
+def fun_l5_n786(x)
+    if (x < 1)
+        fun_l6_n17(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n787(x)
+    if (x < 1)
+        fun_l6_n814(x)
+    else
+        fun_l6_n989(x)
+    end
+end
+
+def fun_l5_n788(x)
+    if (x < 1)
+        fun_l6_n791(x)
+    else
+        fun_l6_n688(x)
+    end
+end
+
+def fun_l5_n789(x)
+    if (x < 1)
+        fun_l6_n415(x)
+    else
+        fun_l6_n218(x)
+    end
+end
+
+def fun_l5_n790(x)
+    if (x < 1)
+        fun_l6_n227(x)
+    else
+        fun_l6_n391(x)
+    end
+end
+
+def fun_l5_n791(x)
+    if (x < 1)
+        fun_l6_n232(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n792(x)
+    if (x < 1)
+        fun_l6_n325(x)
+    else
+        fun_l6_n740(x)
+    end
+end
+
+def fun_l5_n793(x)
+    if (x < 1)
+        fun_l6_n926(x)
+    else
+        fun_l6_n133(x)
+    end
+end
+
+def fun_l5_n794(x)
+    if (x < 1)
+        fun_l6_n114(x)
+    else
+        fun_l6_n76(x)
+    end
+end
+
+def fun_l5_n795(x)
+    if (x < 1)
+        fun_l6_n332(x)
+    else
+        fun_l6_n198(x)
+    end
+end
+
+def fun_l5_n796(x)
+    if (x < 1)
+        fun_l6_n584(x)
+    else
+        fun_l6_n298(x)
+    end
+end
+
+def fun_l5_n797(x)
+    if (x < 1)
+        fun_l6_n966(x)
+    else
+        fun_l6_n956(x)
+    end
+end
+
+def fun_l5_n798(x)
+    if (x < 1)
+        fun_l6_n604(x)
+    else
+        fun_l6_n311(x)
+    end
+end
+
+def fun_l5_n799(x)
+    if (x < 1)
+        fun_l6_n444(x)
+    else
+        fun_l6_n934(x)
+    end
+end
+
+def fun_l5_n800(x)
+    if (x < 1)
+        fun_l6_n805(x)
+    else
+        fun_l6_n83(x)
+    end
+end
+
+def fun_l5_n801(x)
+    if (x < 1)
+        fun_l6_n996(x)
+    else
+        fun_l6_n282(x)
+    end
+end
+
+def fun_l5_n802(x)
+    if (x < 1)
+        fun_l6_n759(x)
+    else
+        fun_l6_n681(x)
+    end
+end
+
+def fun_l5_n803(x)
+    if (x < 1)
+        fun_l6_n480(x)
+    else
+        fun_l6_n536(x)
+    end
+end
+
+def fun_l5_n804(x)
+    if (x < 1)
+        fun_l6_n536(x)
+    else
+        fun_l6_n64(x)
+    end
+end
+
+def fun_l5_n805(x)
+    if (x < 1)
+        fun_l6_n992(x)
+    else
+        fun_l6_n116(x)
+    end
+end
+
+def fun_l5_n806(x)
+    if (x < 1)
+        fun_l6_n446(x)
+    else
+        fun_l6_n553(x)
+    end
+end
+
+def fun_l5_n807(x)
+    if (x < 1)
+        fun_l6_n822(x)
+    else
+        fun_l6_n80(x)
+    end
+end
+
+def fun_l5_n808(x)
+    if (x < 1)
+        fun_l6_n912(x)
+    else
+        fun_l6_n525(x)
+    end
+end
+
+def fun_l5_n809(x)
+    if (x < 1)
+        fun_l6_n824(x)
+    else
+        fun_l6_n356(x)
+    end
+end
+
+def fun_l5_n810(x)
+    if (x < 1)
+        fun_l6_n144(x)
+    else
+        fun_l6_n193(x)
+    end
+end
+
+def fun_l5_n811(x)
+    if (x < 1)
+        fun_l6_n27(x)
+    else
+        fun_l6_n810(x)
+    end
+end
+
+def fun_l5_n812(x)
+    if (x < 1)
+        fun_l6_n244(x)
+    else
+        fun_l6_n696(x)
+    end
+end
+
+def fun_l5_n813(x)
+    if (x < 1)
+        fun_l6_n408(x)
+    else
+        fun_l6_n46(x)
+    end
+end
+
+def fun_l5_n814(x)
+    if (x < 1)
+        fun_l6_n496(x)
+    else
+        fun_l6_n149(x)
+    end
+end
+
+def fun_l5_n815(x)
+    if (x < 1)
+        fun_l6_n100(x)
+    else
+        fun_l6_n765(x)
+    end
+end
+
+def fun_l5_n816(x)
+    if (x < 1)
+        fun_l6_n731(x)
+    else
+        fun_l6_n953(x)
+    end
+end
+
+def fun_l5_n817(x)
+    if (x < 1)
+        fun_l6_n997(x)
+    else
+        fun_l6_n849(x)
+    end
+end
+
+def fun_l5_n818(x)
+    if (x < 1)
+        fun_l6_n570(x)
+    else
+        fun_l6_n918(x)
+    end
+end
+
+def fun_l5_n819(x)
+    if (x < 1)
+        fun_l6_n473(x)
+    else
+        fun_l6_n955(x)
+    end
+end
+
+def fun_l5_n820(x)
+    if (x < 1)
+        fun_l6_n691(x)
+    else
+        fun_l6_n271(x)
+    end
+end
+
+def fun_l5_n821(x)
+    if (x < 1)
+        fun_l6_n935(x)
+    else
+        fun_l6_n386(x)
+    end
+end
+
+def fun_l5_n822(x)
+    if (x < 1)
+        fun_l6_n210(x)
+    else
+        fun_l6_n871(x)
+    end
+end
+
+def fun_l5_n823(x)
+    if (x < 1)
+        fun_l6_n907(x)
+    else
+        fun_l6_n596(x)
+    end
+end
+
+def fun_l5_n824(x)
+    if (x < 1)
+        fun_l6_n701(x)
+    else
+        fun_l6_n541(x)
+    end
+end
+
+def fun_l5_n825(x)
+    if (x < 1)
+        fun_l6_n477(x)
+    else
+        fun_l6_n207(x)
+    end
+end
+
+def fun_l5_n826(x)
+    if (x < 1)
+        fun_l6_n95(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n827(x)
+    if (x < 1)
+        fun_l6_n908(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n828(x)
+    if (x < 1)
+        fun_l6_n213(x)
+    else
+        fun_l6_n607(x)
+    end
+end
+
+def fun_l5_n829(x)
+    if (x < 1)
+        fun_l6_n763(x)
+    else
+        fun_l6_n753(x)
+    end
+end
+
+def fun_l5_n830(x)
+    if (x < 1)
+        fun_l6_n24(x)
+    else
+        fun_l6_n157(x)
+    end
+end
+
+def fun_l5_n831(x)
+    if (x < 1)
+        fun_l6_n262(x)
+    else
+        fun_l6_n826(x)
+    end
+end
+
+def fun_l5_n832(x)
+    if (x < 1)
+        fun_l6_n743(x)
+    else
+        fun_l6_n37(x)
+    end
+end
+
+def fun_l5_n833(x)
+    if (x < 1)
+        fun_l6_n532(x)
+    else
+        fun_l6_n31(x)
+    end
+end
+
+def fun_l5_n834(x)
+    if (x < 1)
+        fun_l6_n309(x)
+    else
+        fun_l6_n454(x)
+    end
+end
+
+def fun_l5_n835(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n721(x)
+    end
+end
+
+def fun_l5_n836(x)
+    if (x < 1)
+        fun_l6_n376(x)
+    else
+        fun_l6_n758(x)
+    end
+end
+
+def fun_l5_n837(x)
+    if (x < 1)
+        fun_l6_n558(x)
+    else
+        fun_l6_n474(x)
+    end
+end
+
+def fun_l5_n838(x)
+    if (x < 1)
+        fun_l6_n436(x)
+    else
+        fun_l6_n675(x)
+    end
+end
+
+def fun_l5_n839(x)
+    if (x < 1)
+        fun_l6_n720(x)
+    else
+        fun_l6_n12(x)
+    end
+end
+
+def fun_l5_n840(x)
+    if (x < 1)
+        fun_l6_n957(x)
+    else
+        fun_l6_n200(x)
+    end
+end
+
+def fun_l5_n841(x)
+    if (x < 1)
+        fun_l6_n180(x)
+    else
+        fun_l6_n644(x)
+    end
+end
+
+def fun_l5_n842(x)
+    if (x < 1)
+        fun_l6_n510(x)
+    else
+        fun_l6_n73(x)
+    end
+end
+
+def fun_l5_n843(x)
+    if (x < 1)
+        fun_l6_n812(x)
+    else
+        fun_l6_n954(x)
+    end
+end
+
+def fun_l5_n844(x)
+    if (x < 1)
+        fun_l6_n566(x)
+    else
+        fun_l6_n866(x)
+    end
+end
+
+def fun_l5_n845(x)
+    if (x < 1)
+        fun_l6_n641(x)
+    else
+        fun_l6_n11(x)
+    end
+end
+
+def fun_l5_n846(x)
+    if (x < 1)
+        fun_l6_n607(x)
+    else
+        fun_l6_n884(x)
+    end
+end
+
+def fun_l5_n847(x)
+    if (x < 1)
+        fun_l6_n479(x)
+    else
+        fun_l6_n564(x)
+    end
+end
+
+def fun_l5_n848(x)
+    if (x < 1)
+        fun_l6_n365(x)
+    else
+        fun_l6_n285(x)
+    end
+end
+
+def fun_l5_n849(x)
+    if (x < 1)
+        fun_l6_n296(x)
+    else
+        fun_l6_n708(x)
+    end
+end
+
+def fun_l5_n850(x)
+    if (x < 1)
+        fun_l6_n429(x)
+    else
+        fun_l6_n758(x)
+    end
+end
+
+def fun_l5_n851(x)
+    if (x < 1)
+        fun_l6_n881(x)
+    else
+        fun_l6_n848(x)
+    end
+end
+
+def fun_l5_n852(x)
+    if (x < 1)
+        fun_l6_n257(x)
+    else
+        fun_l6_n51(x)
+    end
+end
+
+def fun_l5_n853(x)
+    if (x < 1)
+        fun_l6_n441(x)
+    else
+        fun_l6_n445(x)
+    end
+end
+
+def fun_l5_n854(x)
+    if (x < 1)
+        fun_l6_n80(x)
+    else
+        fun_l6_n767(x)
+    end
+end
+
+def fun_l5_n855(x)
+    if (x < 1)
+        fun_l6_n196(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n856(x)
+    if (x < 1)
+        fun_l6_n548(x)
+    else
+        fun_l6_n860(x)
+    end
+end
+
+def fun_l5_n857(x)
+    if (x < 1)
+        fun_l6_n380(x)
+    else
+        fun_l6_n601(x)
+    end
+end
+
+def fun_l5_n858(x)
+    if (x < 1)
+        fun_l6_n272(x)
+    else
+        fun_l6_n376(x)
+    end
+end
+
+def fun_l5_n859(x)
+    if (x < 1)
+        fun_l6_n179(x)
+    else
+        fun_l6_n978(x)
+    end
+end
+
+def fun_l5_n860(x)
+    if (x < 1)
+        fun_l6_n52(x)
+    else
+        fun_l6_n827(x)
+    end
+end
+
+def fun_l5_n861(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n929(x)
+    end
+end
+
+def fun_l5_n862(x)
+    if (x < 1)
+        fun_l6_n179(x)
+    else
+        fun_l6_n171(x)
+    end
+end
+
+def fun_l5_n863(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n663(x)
+    end
+end
+
+def fun_l5_n864(x)
+    if (x < 1)
+        fun_l6_n539(x)
+    else
+        fun_l6_n356(x)
+    end
+end
+
+def fun_l5_n865(x)
+    if (x < 1)
+        fun_l6_n401(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n866(x)
+    if (x < 1)
+        fun_l6_n94(x)
+    else
+        fun_l6_n761(x)
+    end
+end
+
+def fun_l5_n867(x)
+    if (x < 1)
+        fun_l6_n818(x)
+    else
+        fun_l6_n500(x)
+    end
+end
+
+def fun_l5_n868(x)
+    if (x < 1)
+        fun_l6_n956(x)
+    else
+        fun_l6_n661(x)
+    end
+end
+
+def fun_l5_n869(x)
+    if (x < 1)
+        fun_l6_n628(x)
+    else
+        fun_l6_n765(x)
+    end
+end
+
+def fun_l5_n870(x)
+    if (x < 1)
+        fun_l6_n654(x)
+    else
+        fun_l6_n181(x)
+    end
+end
+
+def fun_l5_n871(x)
+    if (x < 1)
+        fun_l6_n70(x)
+    else
+        fun_l6_n157(x)
+    end
+end
+
+def fun_l5_n872(x)
+    if (x < 1)
+        fun_l6_n133(x)
+    else
+        fun_l6_n806(x)
+    end
+end
+
+def fun_l5_n873(x)
+    if (x < 1)
+        fun_l6_n100(x)
+    else
+        fun_l6_n479(x)
+    end
+end
+
+def fun_l5_n874(x)
+    if (x < 1)
+        fun_l6_n401(x)
+    else
+        fun_l6_n567(x)
+    end
+end
+
+def fun_l5_n875(x)
+    if (x < 1)
+        fun_l6_n399(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n876(x)
+    if (x < 1)
+        fun_l6_n412(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n877(x)
+    if (x < 1)
+        fun_l6_n498(x)
+    else
+        fun_l6_n192(x)
+    end
+end
+
+def fun_l5_n878(x)
+    if (x < 1)
+        fun_l6_n798(x)
+    else
+        fun_l6_n473(x)
+    end
+end
+
+def fun_l5_n879(x)
+    if (x < 1)
+        fun_l6_n166(x)
+    else
+        fun_l6_n301(x)
+    end
+end
+
+def fun_l5_n880(x)
+    if (x < 1)
+        fun_l6_n616(x)
+    else
+        fun_l6_n28(x)
+    end
+end
+
+def fun_l5_n881(x)
+    if (x < 1)
+        fun_l6_n315(x)
+    else
+        fun_l6_n92(x)
+    end
+end
+
+def fun_l5_n882(x)
+    if (x < 1)
+        fun_l6_n548(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n883(x)
+    if (x < 1)
+        fun_l6_n279(x)
+    else
+        fun_l6_n72(x)
+    end
+end
+
+def fun_l5_n884(x)
+    if (x < 1)
+        fun_l6_n206(x)
+    else
+        fun_l6_n384(x)
+    end
+end
+
+def fun_l5_n885(x)
+    if (x < 1)
+        fun_l6_n191(x)
+    else
+        fun_l6_n84(x)
+    end
+end
+
+def fun_l5_n886(x)
+    if (x < 1)
+        fun_l6_n960(x)
+    else
+        fun_l6_n495(x)
+    end
+end
+
+def fun_l5_n887(x)
+    if (x < 1)
+        fun_l6_n459(x)
+    else
+        fun_l6_n757(x)
+    end
+end
+
+def fun_l5_n888(x)
+    if (x < 1)
+        fun_l6_n634(x)
+    else
+        fun_l6_n463(x)
+    end
+end
+
+def fun_l5_n889(x)
+    if (x < 1)
+        fun_l6_n611(x)
+    else
+        fun_l6_n469(x)
+    end
+end
+
+def fun_l5_n890(x)
+    if (x < 1)
+        fun_l6_n787(x)
+    else
+        fun_l6_n707(x)
+    end
+end
+
+def fun_l5_n891(x)
+    if (x < 1)
+        fun_l6_n201(x)
+    else
+        fun_l6_n223(x)
+    end
+end
+
+def fun_l5_n892(x)
+    if (x < 1)
+        fun_l6_n214(x)
+    else
+        fun_l6_n303(x)
+    end
+end
+
+def fun_l5_n893(x)
+    if (x < 1)
+        fun_l6_n85(x)
+    else
+        fun_l6_n802(x)
+    end
+end
+
+def fun_l5_n894(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n325(x)
+    end
+end
+
+def fun_l5_n895(x)
+    if (x < 1)
+        fun_l6_n491(x)
+    else
+        fun_l6_n907(x)
+    end
+end
+
+def fun_l5_n896(x)
+    if (x < 1)
+        fun_l6_n809(x)
+    else
+        fun_l6_n364(x)
+    end
+end
+
+def fun_l5_n897(x)
+    if (x < 1)
+        fun_l6_n739(x)
+    else
+        fun_l6_n192(x)
+    end
+end
+
+def fun_l5_n898(x)
+    if (x < 1)
+        fun_l6_n461(x)
+    else
+        fun_l6_n594(x)
+    end
+end
+
+def fun_l5_n899(x)
+    if (x < 1)
+        fun_l6_n256(x)
+    else
+        fun_l6_n521(x)
+    end
+end
+
+def fun_l5_n900(x)
+    if (x < 1)
+        fun_l6_n6(x)
+    else
+        fun_l6_n127(x)
+    end
+end
+
+def fun_l5_n901(x)
+    if (x < 1)
+        fun_l6_n655(x)
+    else
+        fun_l6_n426(x)
+    end
+end
+
+def fun_l5_n902(x)
+    if (x < 1)
+        fun_l6_n936(x)
+    else
+        fun_l6_n275(x)
+    end
+end
+
+def fun_l5_n903(x)
+    if (x < 1)
+        fun_l6_n738(x)
+    else
+        fun_l6_n654(x)
+    end
+end
+
+def fun_l5_n904(x)
+    if (x < 1)
+        fun_l6_n583(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n905(x)
+    if (x < 1)
+        fun_l6_n228(x)
+    else
+        fun_l6_n591(x)
+    end
+end
+
+def fun_l5_n906(x)
+    if (x < 1)
+        fun_l6_n292(x)
+    else
+        fun_l6_n55(x)
+    end
+end
+
+def fun_l5_n907(x)
+    if (x < 1)
+        fun_l6_n457(x)
+    else
+        fun_l6_n513(x)
+    end
+end
+
+def fun_l5_n908(x)
+    if (x < 1)
+        fun_l6_n542(x)
+    else
+        fun_l6_n593(x)
+    end
+end
+
+def fun_l5_n909(x)
+    if (x < 1)
+        fun_l6_n478(x)
+    else
+        fun_l6_n782(x)
+    end
+end
+
+def fun_l5_n910(x)
+    if (x < 1)
+        fun_l6_n780(x)
+    else
+        fun_l6_n275(x)
+    end
+end
+
+def fun_l5_n911(x)
+    if (x < 1)
+        fun_l6_n631(x)
+    else
+        fun_l6_n811(x)
+    end
+end
+
+def fun_l5_n912(x)
+    if (x < 1)
+        fun_l6_n17(x)
+    else
+        fun_l6_n837(x)
+    end
+end
+
+def fun_l5_n913(x)
+    if (x < 1)
+        fun_l6_n607(x)
+    else
+        fun_l6_n159(x)
+    end
+end
+
+def fun_l5_n914(x)
+    if (x < 1)
+        fun_l6_n23(x)
+    else
+        fun_l6_n70(x)
+    end
+end
+
+def fun_l5_n915(x)
+    if (x < 1)
+        fun_l6_n778(x)
+    else
+        fun_l6_n643(x)
+    end
+end
+
+def fun_l5_n916(x)
+    if (x < 1)
+        fun_l6_n707(x)
+    else
+        fun_l6_n121(x)
+    end
+end
+
+def fun_l5_n917(x)
+    if (x < 1)
+        fun_l6_n816(x)
+    else
+        fun_l6_n67(x)
+    end
+end
+
+def fun_l5_n918(x)
+    if (x < 1)
+        fun_l6_n963(x)
+    else
+        fun_l6_n520(x)
+    end
+end
+
+def fun_l5_n919(x)
+    if (x < 1)
+        fun_l6_n251(x)
+    else
+        fun_l6_n111(x)
+    end
+end
+
+def fun_l5_n920(x)
+    if (x < 1)
+        fun_l6_n198(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n921(x)
+    if (x < 1)
+        fun_l6_n364(x)
+    else
+        fun_l6_n369(x)
+    end
+end
+
+def fun_l5_n922(x)
+    if (x < 1)
+        fun_l6_n7(x)
+    else
+        fun_l6_n314(x)
+    end
+end
+
+def fun_l5_n923(x)
+    if (x < 1)
+        fun_l6_n578(x)
+    else
+        fun_l6_n502(x)
+    end
+end
+
+def fun_l5_n924(x)
+    if (x < 1)
+        fun_l6_n450(x)
+    else
+        fun_l6_n680(x)
+    end
+end
+
+def fun_l5_n925(x)
+    if (x < 1)
+        fun_l6_n469(x)
+    else
+        fun_l6_n973(x)
+    end
+end
+
+def fun_l5_n926(x)
+    if (x < 1)
+        fun_l6_n114(x)
+    else
+        fun_l6_n862(x)
+    end
+end
+
+def fun_l5_n927(x)
+    if (x < 1)
+        fun_l6_n786(x)
+    else
+        fun_l6_n861(x)
+    end
+end
+
+def fun_l5_n928(x)
+    if (x < 1)
+        fun_l6_n40(x)
+    else
+        fun_l6_n665(x)
+    end
+end
+
+def fun_l5_n929(x)
+    if (x < 1)
+        fun_l6_n997(x)
+    else
+        fun_l6_n137(x)
+    end
+end
+
+def fun_l5_n930(x)
+    if (x < 1)
+        fun_l6_n547(x)
+    else
+        fun_l6_n547(x)
+    end
+end
+
+def fun_l5_n931(x)
+    if (x < 1)
+        fun_l6_n310(x)
+    else
+        fun_l6_n986(x)
+    end
+end
+
+def fun_l5_n932(x)
+    if (x < 1)
+        fun_l6_n339(x)
+    else
+        fun_l6_n18(x)
+    end
+end
+
+def fun_l5_n933(x)
+    if (x < 1)
+        fun_l6_n825(x)
+    else
+        fun_l6_n418(x)
+    end
+end
+
+def fun_l5_n934(x)
+    if (x < 1)
+        fun_l6_n509(x)
+    else
+        fun_l6_n589(x)
+    end
+end
+
+def fun_l5_n935(x)
+    if (x < 1)
+        fun_l6_n936(x)
+    else
+        fun_l6_n113(x)
+    end
+end
+
+def fun_l5_n936(x)
+    if (x < 1)
+        fun_l6_n530(x)
+    else
+        fun_l6_n841(x)
+    end
+end
+
+def fun_l5_n937(x)
+    if (x < 1)
+        fun_l6_n431(x)
+    else
+        fun_l6_n531(x)
+    end
+end
+
+def fun_l5_n938(x)
+    if (x < 1)
+        fun_l6_n791(x)
+    else
+        fun_l6_n41(x)
+    end
+end
+
+def fun_l5_n939(x)
+    if (x < 1)
+        fun_l6_n873(x)
+    else
+        fun_l6_n336(x)
+    end
+end
+
+def fun_l5_n940(x)
+    if (x < 1)
+        fun_l6_n925(x)
+    else
+        fun_l6_n746(x)
+    end
+end
+
+def fun_l5_n941(x)
+    if (x < 1)
+        fun_l6_n995(x)
+    else
+        fun_l6_n29(x)
+    end
+end
+
+def fun_l5_n942(x)
+    if (x < 1)
+        fun_l6_n984(x)
+    else
+        fun_l6_n455(x)
+    end
+end
+
+def fun_l5_n943(x)
+    if (x < 1)
+        fun_l6_n660(x)
+    else
+        fun_l6_n934(x)
+    end
+end
+
+def fun_l5_n944(x)
+    if (x < 1)
+        fun_l6_n625(x)
+    else
+        fun_l6_n523(x)
+    end
+end
+
+def fun_l5_n945(x)
+    if (x < 1)
+        fun_l6_n407(x)
+    else
+        fun_l6_n766(x)
+    end
+end
+
+def fun_l5_n946(x)
+    if (x < 1)
+        fun_l6_n80(x)
+    else
+        fun_l6_n75(x)
+    end
+end
+
+def fun_l5_n947(x)
+    if (x < 1)
+        fun_l6_n465(x)
+    else
+        fun_l6_n57(x)
+    end
+end
+
+def fun_l5_n948(x)
+    if (x < 1)
+        fun_l6_n750(x)
+    else
+        fun_l6_n278(x)
+    end
+end
+
+def fun_l5_n949(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n472(x)
+    end
+end
+
+def fun_l5_n950(x)
+    if (x < 1)
+        fun_l6_n917(x)
+    else
+        fun_l6_n71(x)
+    end
+end
+
+def fun_l5_n951(x)
+    if (x < 1)
+        fun_l6_n420(x)
+    else
+        fun_l6_n132(x)
+    end
+end
+
+def fun_l5_n952(x)
+    if (x < 1)
+        fun_l6_n112(x)
+    else
+        fun_l6_n396(x)
+    end
+end
+
+def fun_l5_n953(x)
+    if (x < 1)
+        fun_l6_n705(x)
+    else
+        fun_l6_n978(x)
+    end
+end
+
+def fun_l5_n954(x)
+    if (x < 1)
+        fun_l6_n761(x)
+    else
+        fun_l6_n136(x)
+    end
+end
+
+def fun_l5_n955(x)
+    if (x < 1)
+        fun_l6_n518(x)
+    else
+        fun_l6_n687(x)
+    end
+end
+
+def fun_l5_n956(x)
+    if (x < 1)
+        fun_l6_n308(x)
+    else
+        fun_l6_n34(x)
+    end
+end
+
+def fun_l5_n957(x)
+    if (x < 1)
+        fun_l6_n904(x)
+    else
+        fun_l6_n129(x)
+    end
+end
+
+def fun_l5_n958(x)
+    if (x < 1)
+        fun_l6_n271(x)
+    else
+        fun_l6_n444(x)
+    end
+end
+
+def fun_l5_n959(x)
+    if (x < 1)
+        fun_l6_n690(x)
+    else
+        fun_l6_n118(x)
+    end
+end
+
+def fun_l5_n960(x)
+    if (x < 1)
+        fun_l6_n509(x)
+    else
+        fun_l6_n957(x)
+    end
+end
+
+def fun_l5_n961(x)
+    if (x < 1)
+        fun_l6_n889(x)
+    else
+        fun_l6_n26(x)
+    end
+end
+
+def fun_l5_n962(x)
+    if (x < 1)
+        fun_l6_n802(x)
+    else
+        fun_l6_n364(x)
+    end
+end
+
+def fun_l5_n963(x)
+    if (x < 1)
+        fun_l6_n368(x)
+    else
+        fun_l6_n580(x)
+    end
+end
+
+def fun_l5_n964(x)
+    if (x < 1)
+        fun_l6_n879(x)
+    else
+        fun_l6_n925(x)
+    end
+end
+
+def fun_l5_n965(x)
+    if (x < 1)
+        fun_l6_n114(x)
+    else
+        fun_l6_n882(x)
+    end
+end
+
+def fun_l5_n966(x)
+    if (x < 1)
+        fun_l6_n9(x)
+    else
+        fun_l6_n5(x)
+    end
+end
+
+def fun_l5_n967(x)
+    if (x < 1)
+        fun_l6_n536(x)
+    else
+        fun_l6_n251(x)
+    end
+end
+
+def fun_l5_n968(x)
+    if (x < 1)
+        fun_l6_n804(x)
+    else
+        fun_l6_n179(x)
+    end
+end
+
+def fun_l5_n969(x)
+    if (x < 1)
+        fun_l6_n469(x)
+    else
+        fun_l6_n235(x)
+    end
+end
+
+def fun_l5_n970(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n763(x)
+    end
+end
+
+def fun_l5_n971(x)
+    if (x < 1)
+        fun_l6_n342(x)
+    else
+        fun_l6_n126(x)
+    end
+end
+
+def fun_l5_n972(x)
+    if (x < 1)
+        fun_l6_n901(x)
+    else
+        fun_l6_n674(x)
+    end
+end
+
+def fun_l5_n973(x)
+    if (x < 1)
+        fun_l6_n853(x)
+    else
+        fun_l6_n714(x)
+    end
+end
+
+def fun_l5_n974(x)
+    if (x < 1)
+        fun_l6_n670(x)
+    else
+        fun_l6_n905(x)
+    end
+end
+
+def fun_l5_n975(x)
+    if (x < 1)
+        fun_l6_n873(x)
+    else
+        fun_l6_n193(x)
+    end
+end
+
+def fun_l5_n976(x)
+    if (x < 1)
+        fun_l6_n603(x)
+    else
+        fun_l6_n186(x)
+    end
+end
+
+def fun_l5_n977(x)
+    if (x < 1)
+        fun_l6_n474(x)
+    else
+        fun_l6_n108(x)
+    end
+end
+
+def fun_l5_n978(x)
+    if (x < 1)
+        fun_l6_n347(x)
+    else
+        fun_l6_n872(x)
+    end
+end
+
+def fun_l5_n979(x)
+    if (x < 1)
+        fun_l6_n593(x)
+    else
+        fun_l6_n575(x)
+    end
+end
+
+def fun_l5_n980(x)
+    if (x < 1)
+        fun_l6_n692(x)
+    else
+        fun_l6_n262(x)
+    end
+end
+
+def fun_l5_n981(x)
+    if (x < 1)
+        fun_l6_n226(x)
+    else
+        fun_l6_n600(x)
+    end
+end
+
+def fun_l5_n982(x)
+    if (x < 1)
+        fun_l6_n357(x)
+    else
+        fun_l6_n165(x)
+    end
+end
+
+def fun_l5_n983(x)
+    if (x < 1)
+        fun_l6_n784(x)
+    else
+        fun_l6_n584(x)
+    end
+end
+
+def fun_l5_n984(x)
+    if (x < 1)
+        fun_l6_n339(x)
+    else
+        fun_l6_n754(x)
+    end
+end
+
+def fun_l5_n985(x)
+    if (x < 1)
+        fun_l6_n536(x)
+    else
+        fun_l6_n663(x)
+    end
+end
+
+def fun_l5_n986(x)
+    if (x < 1)
+        fun_l6_n239(x)
+    else
+        fun_l6_n723(x)
+    end
+end
+
+def fun_l5_n987(x)
+    if (x < 1)
+        fun_l6_n928(x)
+    else
+        fun_l6_n403(x)
+    end
+end
+
+def fun_l5_n988(x)
+    if (x < 1)
+        fun_l6_n328(x)
+    else
+        fun_l6_n551(x)
+    end
+end
+
+def fun_l5_n989(x)
+    if (x < 1)
+        fun_l6_n847(x)
+    else
+        fun_l6_n475(x)
+    end
+end
+
+def fun_l5_n990(x)
+    if (x < 1)
+        fun_l6_n405(x)
+    else
+        fun_l6_n39(x)
+    end
+end
+
+def fun_l5_n991(x)
+    if (x < 1)
+        fun_l6_n705(x)
+    else
+        fun_l6_n281(x)
+    end
+end
+
+def fun_l5_n992(x)
+    if (x < 1)
+        fun_l6_n59(x)
+    else
+        fun_l6_n465(x)
+    end
+end
+
+def fun_l5_n993(x)
+    if (x < 1)
+        fun_l6_n828(x)
+    else
+        fun_l6_n705(x)
+    end
+end
+
+def fun_l5_n994(x)
+    if (x < 1)
+        fun_l6_n687(x)
+    else
+        fun_l6_n451(x)
+    end
+end
+
+def fun_l5_n995(x)
+    if (x < 1)
+        fun_l6_n600(x)
+    else
+        fun_l6_n9(x)
+    end
+end
+
+def fun_l5_n996(x)
+    if (x < 1)
+        fun_l6_n205(x)
+    else
+        fun_l6_n242(x)
+    end
+end
+
+def fun_l5_n997(x)
+    if (x < 1)
+        fun_l6_n438(x)
+    else
+        fun_l6_n108(x)
+    end
+end
+
+def fun_l5_n998(x)
+    if (x < 1)
+        fun_l6_n164(x)
+    else
+        fun_l6_n302(x)
+    end
+end
+
+def fun_l5_n999(x)
+    if (x < 1)
+        fun_l6_n533(x)
+    else
+        fun_l6_n685(x)
+    end
+end
+
+def fun_l6_n0(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n45(x)
+    end
+end
+
+def fun_l6_n1(x)
+    if (x < 1)
+        fun_l7_n685(x)
+    else
+        fun_l7_n163(x)
+    end
+end
+
+def fun_l6_n2(x)
+    if (x < 1)
+        fun_l7_n325(x)
+    else
+        fun_l7_n365(x)
+    end
+end
+
+def fun_l6_n3(x)
+    if (x < 1)
+        fun_l7_n855(x)
+    else
+        fun_l7_n359(x)
+    end
+end
+
+def fun_l6_n4(x)
+    if (x < 1)
+        fun_l7_n939(x)
+    else
+        fun_l7_n690(x)
+    end
+end
+
+def fun_l6_n5(x)
+    if (x < 1)
+        fun_l7_n689(x)
+    else
+        fun_l7_n681(x)
+    end
+end
+
+def fun_l6_n6(x)
+    if (x < 1)
+        fun_l7_n226(x)
+    else
+        fun_l7_n307(x)
+    end
+end
+
+def fun_l6_n7(x)
+    if (x < 1)
+        fun_l7_n779(x)
+    else
+        fun_l7_n765(x)
+    end
+end
+
+def fun_l6_n8(x)
+    if (x < 1)
+        fun_l7_n85(x)
+    else
+        fun_l7_n967(x)
+    end
+end
+
+def fun_l6_n9(x)
+    if (x < 1)
+        fun_l7_n539(x)
+    else
+        fun_l7_n5(x)
+    end
+end
+
+def fun_l6_n10(x)
+    if (x < 1)
+        fun_l7_n503(x)
+    else
+        fun_l7_n163(x)
+    end
+end
+
+def fun_l6_n11(x)
+    if (x < 1)
+        fun_l7_n24(x)
+    else
+        fun_l7_n374(x)
+    end
+end
+
+def fun_l6_n12(x)
+    if (x < 1)
+        fun_l7_n633(x)
+    else
+        fun_l7_n395(x)
+    end
+end
+
+def fun_l6_n13(x)
+    if (x < 1)
+        fun_l7_n250(x)
+    else
+        fun_l7_n7(x)
+    end
+end
+
+def fun_l6_n14(x)
+    if (x < 1)
+        fun_l7_n22(x)
+    else
+        fun_l7_n560(x)
+    end
+end
+
+def fun_l6_n15(x)
+    if (x < 1)
+        fun_l7_n209(x)
+    else
+        fun_l7_n323(x)
+    end
+end
+
+def fun_l6_n16(x)
+    if (x < 1)
+        fun_l7_n770(x)
+    else
+        fun_l7_n155(x)
+    end
+end
+
+def fun_l6_n17(x)
+    if (x < 1)
+        fun_l7_n976(x)
+    else
+        fun_l7_n712(x)
+    end
+end
+
+def fun_l6_n18(x)
+    if (x < 1)
+        fun_l7_n762(x)
+    else
+        fun_l7_n307(x)
+    end
+end
+
+def fun_l6_n19(x)
+    if (x < 1)
+        fun_l7_n911(x)
+    else
+        fun_l7_n788(x)
+    end
+end
+
+def fun_l6_n20(x)
+    if (x < 1)
+        fun_l7_n40(x)
+    else
+        fun_l7_n269(x)
+    end
+end
+
+def fun_l6_n21(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n861(x)
+    end
+end
+
+def fun_l6_n22(x)
+    if (x < 1)
+        fun_l7_n591(x)
+    else
+        fun_l7_n557(x)
+    end
+end
+
+def fun_l6_n23(x)
+    if (x < 1)
+        fun_l7_n890(x)
+    else
+        fun_l7_n142(x)
+    end
+end
+
+def fun_l6_n24(x)
+    if (x < 1)
+        fun_l7_n563(x)
+    else
+        fun_l7_n509(x)
+    end
+end
+
+def fun_l6_n25(x)
+    if (x < 1)
+        fun_l7_n630(x)
+    else
+        fun_l7_n784(x)
+    end
+end
+
+def fun_l6_n26(x)
+    if (x < 1)
+        fun_l7_n30(x)
+    else
+        fun_l7_n826(x)
+    end
+end
+
+def fun_l6_n27(x)
+    if (x < 1)
+        fun_l7_n223(x)
+    else
+        fun_l7_n800(x)
+    end
+end
+
+def fun_l6_n28(x)
+    if (x < 1)
+        fun_l7_n51(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n29(x)
+    if (x < 1)
+        fun_l7_n603(x)
+    else
+        fun_l7_n988(x)
+    end
+end
+
+def fun_l6_n30(x)
+    if (x < 1)
+        fun_l7_n258(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n31(x)
+    if (x < 1)
+        fun_l7_n649(x)
+    else
+        fun_l7_n772(x)
+    end
+end
+
+def fun_l6_n32(x)
+    if (x < 1)
+        fun_l7_n999(x)
+    else
+        fun_l7_n592(x)
+    end
+end
+
+def fun_l6_n33(x)
+    if (x < 1)
+        fun_l7_n371(x)
+    else
+        fun_l7_n801(x)
+    end
+end
+
+def fun_l6_n34(x)
+    if (x < 1)
+        fun_l7_n905(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n35(x)
+    if (x < 1)
+        fun_l7_n142(x)
+    else
+        fun_l7_n933(x)
+    end
+end
+
+def fun_l6_n36(x)
+    if (x < 1)
+        fun_l7_n987(x)
+    else
+        fun_l7_n305(x)
+    end
+end
+
+def fun_l6_n37(x)
+    if (x < 1)
+        fun_l7_n360(x)
+    else
+        fun_l7_n266(x)
+    end
+end
+
+def fun_l6_n38(x)
+    if (x < 1)
+        fun_l7_n799(x)
+    else
+        fun_l7_n938(x)
+    end
+end
+
+def fun_l6_n39(x)
+    if (x < 1)
+        fun_l7_n921(x)
+    else
+        fun_l7_n739(x)
+    end
+end
+
+def fun_l6_n40(x)
+    if (x < 1)
+        fun_l7_n553(x)
+    else
+        fun_l7_n236(x)
+    end
+end
+
+def fun_l6_n41(x)
+    if (x < 1)
+        fun_l7_n592(x)
+    else
+        fun_l7_n335(x)
+    end
+end
+
+def fun_l6_n42(x)
+    if (x < 1)
+        fun_l7_n33(x)
+    else
+        fun_l7_n521(x)
+    end
+end
+
+def fun_l6_n43(x)
+    if (x < 1)
+        fun_l7_n278(x)
+    else
+        fun_l7_n866(x)
+    end
+end
+
+def fun_l6_n44(x)
+    if (x < 1)
+        fun_l7_n808(x)
+    else
+        fun_l7_n394(x)
+    end
+end
+
+def fun_l6_n45(x)
+    if (x < 1)
+        fun_l7_n556(x)
+    else
+        fun_l7_n462(x)
+    end
+end
+
+def fun_l6_n46(x)
+    if (x < 1)
+        fun_l7_n72(x)
+    else
+        fun_l7_n558(x)
+    end
+end
+
+def fun_l6_n47(x)
+    if (x < 1)
+        fun_l7_n583(x)
+    else
+        fun_l7_n472(x)
+    end
+end
+
+def fun_l6_n48(x)
+    if (x < 1)
+        fun_l7_n577(x)
+    else
+        fun_l7_n264(x)
+    end
+end
+
+def fun_l6_n49(x)
+    if (x < 1)
+        fun_l7_n167(x)
+    else
+        fun_l7_n570(x)
+    end
+end
+
+def fun_l6_n50(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n127(x)
+    end
+end
+
+def fun_l6_n51(x)
+    if (x < 1)
+        fun_l7_n151(x)
+    else
+        fun_l7_n82(x)
+    end
+end
+
+def fun_l6_n52(x)
+    if (x < 1)
+        fun_l7_n729(x)
+    else
+        fun_l7_n785(x)
+    end
+end
+
+def fun_l6_n53(x)
+    if (x < 1)
+        fun_l7_n236(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n54(x)
+    if (x < 1)
+        fun_l7_n573(x)
+    else
+        fun_l7_n92(x)
+    end
+end
+
+def fun_l6_n55(x)
+    if (x < 1)
+        fun_l7_n601(x)
+    else
+        fun_l7_n531(x)
+    end
+end
+
+def fun_l6_n56(x)
+    if (x < 1)
+        fun_l7_n623(x)
+    else
+        fun_l7_n522(x)
+    end
+end
+
+def fun_l6_n57(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n830(x)
+    end
+end
+
+def fun_l6_n58(x)
+    if (x < 1)
+        fun_l7_n240(x)
+    else
+        fun_l7_n868(x)
+    end
+end
+
+def fun_l6_n59(x)
+    if (x < 1)
+        fun_l7_n233(x)
+    else
+        fun_l7_n595(x)
+    end
+end
+
+def fun_l6_n60(x)
+    if (x < 1)
+        fun_l7_n384(x)
+    else
+        fun_l7_n605(x)
+    end
+end
+
+def fun_l6_n61(x)
+    if (x < 1)
+        fun_l7_n721(x)
+    else
+        fun_l7_n509(x)
+    end
+end
+
+def fun_l6_n62(x)
+    if (x < 1)
+        fun_l7_n741(x)
+    else
+        fun_l7_n934(x)
+    end
+end
+
+def fun_l6_n63(x)
+    if (x < 1)
+        fun_l7_n724(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n64(x)
+    if (x < 1)
+        fun_l7_n144(x)
+    else
+        fun_l7_n417(x)
+    end
+end
+
+def fun_l6_n65(x)
+    if (x < 1)
+        fun_l7_n618(x)
+    else
+        fun_l7_n19(x)
+    end
+end
+
+def fun_l6_n66(x)
+    if (x < 1)
+        fun_l7_n128(x)
+    else
+        fun_l7_n257(x)
+    end
+end
+
+def fun_l6_n67(x)
+    if (x < 1)
+        fun_l7_n623(x)
+    else
+        fun_l7_n182(x)
+    end
+end
+
+def fun_l6_n68(x)
+    if (x < 1)
+        fun_l7_n256(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n69(x)
+    if (x < 1)
+        fun_l7_n360(x)
+    else
+        fun_l7_n34(x)
+    end
+end
+
+def fun_l6_n70(x)
+    if (x < 1)
+        fun_l7_n690(x)
+    else
+        fun_l7_n813(x)
+    end
+end
+
+def fun_l6_n71(x)
+    if (x < 1)
+        fun_l7_n533(x)
+    else
+        fun_l7_n94(x)
+    end
+end
+
+def fun_l6_n72(x)
+    if (x < 1)
+        fun_l7_n245(x)
+    else
+        fun_l7_n548(x)
+    end
+end
+
+def fun_l6_n73(x)
+    if (x < 1)
+        fun_l7_n919(x)
+    else
+        fun_l7_n295(x)
+    end
+end
+
+def fun_l6_n74(x)
+    if (x < 1)
+        fun_l7_n925(x)
+    else
+        fun_l7_n965(x)
+    end
+end
+
+def fun_l6_n75(x)
+    if (x < 1)
+        fun_l7_n825(x)
+    else
+        fun_l7_n79(x)
+    end
+end
+
+def fun_l6_n76(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n96(x)
+    end
+end
+
+def fun_l6_n77(x)
+    if (x < 1)
+        fun_l7_n688(x)
+    else
+        fun_l7_n424(x)
+    end
+end
+
+def fun_l6_n78(x)
+    if (x < 1)
+        fun_l7_n171(x)
+    else
+        fun_l7_n728(x)
+    end
+end
+
+def fun_l6_n79(x)
+    if (x < 1)
+        fun_l7_n786(x)
+    else
+        fun_l7_n135(x)
+    end
+end
+
+def fun_l6_n80(x)
+    if (x < 1)
+        fun_l7_n622(x)
+    else
+        fun_l7_n3(x)
+    end
+end
+
+def fun_l6_n81(x)
+    if (x < 1)
+        fun_l7_n386(x)
+    else
+        fun_l7_n946(x)
+    end
+end
+
+def fun_l6_n82(x)
+    if (x < 1)
+        fun_l7_n192(x)
+    else
+        fun_l7_n253(x)
+    end
+end
+
+def fun_l6_n83(x)
+    if (x < 1)
+        fun_l7_n534(x)
+    else
+        fun_l7_n4(x)
+    end
+end
+
+def fun_l6_n84(x)
+    if (x < 1)
+        fun_l7_n198(x)
+    else
+        fun_l7_n455(x)
+    end
+end
+
+def fun_l6_n85(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n26(x)
+    end
+end
+
+def fun_l6_n86(x)
+    if (x < 1)
+        fun_l7_n147(x)
+    else
+        fun_l7_n893(x)
+    end
+end
+
+def fun_l6_n87(x)
+    if (x < 1)
+        fun_l7_n424(x)
+    else
+        fun_l7_n713(x)
+    end
+end
+
+def fun_l6_n88(x)
+    if (x < 1)
+        fun_l7_n867(x)
+    else
+        fun_l7_n561(x)
+    end
+end
+
+def fun_l6_n89(x)
+    if (x < 1)
+        fun_l7_n64(x)
+    else
+        fun_l7_n662(x)
+    end
+end
+
+def fun_l6_n90(x)
+    if (x < 1)
+        fun_l7_n849(x)
+    else
+        fun_l7_n105(x)
+    end
+end
+
+def fun_l6_n91(x)
+    if (x < 1)
+        fun_l7_n564(x)
+    else
+        fun_l7_n758(x)
+    end
+end
+
+def fun_l6_n92(x)
+    if (x < 1)
+        fun_l7_n433(x)
+    else
+        fun_l7_n713(x)
+    end
+end
+
+def fun_l6_n93(x)
+    if (x < 1)
+        fun_l7_n283(x)
+    else
+        fun_l7_n577(x)
+    end
+end
+
+def fun_l6_n94(x)
+    if (x < 1)
+        fun_l7_n951(x)
+    else
+        fun_l7_n48(x)
+    end
+end
+
+def fun_l6_n95(x)
+    if (x < 1)
+        fun_l7_n966(x)
+    else
+        fun_l7_n789(x)
+    end
+end
+
+def fun_l6_n96(x)
+    if (x < 1)
+        fun_l7_n954(x)
+    else
+        fun_l7_n431(x)
+    end
+end
+
+def fun_l6_n97(x)
+    if (x < 1)
+        fun_l7_n720(x)
+    else
+        fun_l7_n847(x)
+    end
+end
+
+def fun_l6_n98(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n378(x)
+    end
+end
+
+def fun_l6_n99(x)
+    if (x < 1)
+        fun_l7_n951(x)
+    else
+        fun_l7_n688(x)
+    end
+end
+
+def fun_l6_n100(x)
+    if (x < 1)
+        fun_l7_n163(x)
+    else
+        fun_l7_n540(x)
+    end
+end
+
+def fun_l6_n101(x)
+    if (x < 1)
+        fun_l7_n423(x)
+    else
+        fun_l7_n10(x)
+    end
+end
+
+def fun_l6_n102(x)
+    if (x < 1)
+        fun_l7_n346(x)
+    else
+        fun_l7_n409(x)
+    end
+end
+
+def fun_l6_n103(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n432(x)
+    end
+end
+
+def fun_l6_n104(x)
+    if (x < 1)
+        fun_l7_n144(x)
+    else
+        fun_l7_n510(x)
+    end
+end
+
+def fun_l6_n105(x)
+    if (x < 1)
+        fun_l7_n568(x)
+    else
+        fun_l7_n756(x)
+    end
+end
+
+def fun_l6_n106(x)
+    if (x < 1)
+        fun_l7_n708(x)
+    else
+        fun_l7_n199(x)
+    end
+end
+
+def fun_l6_n107(x)
+    if (x < 1)
+        fun_l7_n823(x)
+    else
+        fun_l7_n969(x)
+    end
+end
+
+def fun_l6_n108(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n211(x)
+    end
+end
+
+def fun_l6_n109(x)
+    if (x < 1)
+        fun_l7_n527(x)
+    else
+        fun_l7_n791(x)
+    end
+end
+
+def fun_l6_n110(x)
+    if (x < 1)
+        fun_l7_n392(x)
+    else
+        fun_l7_n314(x)
+    end
+end
+
+def fun_l6_n111(x)
+    if (x < 1)
+        fun_l7_n355(x)
+    else
+        fun_l7_n222(x)
+    end
+end
+
+def fun_l6_n112(x)
+    if (x < 1)
+        fun_l7_n683(x)
+    else
+        fun_l7_n735(x)
+    end
+end
+
+def fun_l6_n113(x)
+    if (x < 1)
+        fun_l7_n38(x)
+    else
+        fun_l7_n874(x)
+    end
+end
+
+def fun_l6_n114(x)
+    if (x < 1)
+        fun_l7_n190(x)
+    else
+        fun_l7_n209(x)
+    end
+end
+
+def fun_l6_n115(x)
+    if (x < 1)
+        fun_l7_n544(x)
+    else
+        fun_l7_n267(x)
+    end
+end
+
+def fun_l6_n116(x)
+    if (x < 1)
+        fun_l7_n701(x)
+    else
+        fun_l7_n101(x)
+    end
+end
+
+def fun_l6_n117(x)
+    if (x < 1)
+        fun_l7_n283(x)
+    else
+        fun_l7_n979(x)
+    end
+end
+
+def fun_l6_n118(x)
+    if (x < 1)
+        fun_l7_n902(x)
+    else
+        fun_l7_n897(x)
+    end
+end
+
+def fun_l6_n119(x)
+    if (x < 1)
+        fun_l7_n115(x)
+    else
+        fun_l7_n660(x)
+    end
+end
+
+def fun_l6_n120(x)
+    if (x < 1)
+        fun_l7_n804(x)
+    else
+        fun_l7_n536(x)
+    end
+end
+
+def fun_l6_n121(x)
+    if (x < 1)
+        fun_l7_n278(x)
+    else
+        fun_l7_n666(x)
+    end
+end
+
+def fun_l6_n122(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n572(x)
+    end
+end
+
+def fun_l6_n123(x)
+    if (x < 1)
+        fun_l7_n474(x)
+    else
+        fun_l7_n912(x)
+    end
+end
+
+def fun_l6_n124(x)
+    if (x < 1)
+        fun_l7_n0(x)
+    else
+        fun_l7_n514(x)
+    end
+end
+
+def fun_l6_n125(x)
+    if (x < 1)
+        fun_l7_n916(x)
+    else
+        fun_l7_n633(x)
+    end
+end
+
+def fun_l6_n126(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n379(x)
+    end
+end
+
+def fun_l6_n127(x)
+    if (x < 1)
+        fun_l7_n316(x)
+    else
+        fun_l7_n422(x)
+    end
+end
+
+def fun_l6_n128(x)
+    if (x < 1)
+        fun_l7_n402(x)
+    else
+        fun_l7_n237(x)
+    end
+end
+
+def fun_l6_n129(x)
+    if (x < 1)
+        fun_l7_n303(x)
+    else
+        fun_l7_n61(x)
+    end
+end
+
+def fun_l6_n130(x)
+    if (x < 1)
+        fun_l7_n918(x)
+    else
+        fun_l7_n732(x)
+    end
+end
+
+def fun_l6_n131(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n472(x)
+    end
+end
+
+def fun_l6_n132(x)
+    if (x < 1)
+        fun_l7_n648(x)
+    else
+        fun_l7_n546(x)
+    end
+end
+
+def fun_l6_n133(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n359(x)
+    end
+end
+
+def fun_l6_n134(x)
+    if (x < 1)
+        fun_l7_n594(x)
+    else
+        fun_l7_n607(x)
+    end
+end
+
+def fun_l6_n135(x)
+    if (x < 1)
+        fun_l7_n642(x)
+    else
+        fun_l7_n188(x)
+    end
+end
+
+def fun_l6_n136(x)
+    if (x < 1)
+        fun_l7_n879(x)
+    else
+        fun_l7_n521(x)
+    end
+end
+
+def fun_l6_n137(x)
+    if (x < 1)
+        fun_l7_n362(x)
+    else
+        fun_l7_n564(x)
+    end
+end
+
+def fun_l6_n138(x)
+    if (x < 1)
+        fun_l7_n590(x)
+    else
+        fun_l7_n59(x)
+    end
+end
+
+def fun_l6_n139(x)
+    if (x < 1)
+        fun_l7_n464(x)
+    else
+        fun_l7_n563(x)
+    end
+end
+
+def fun_l6_n140(x)
+    if (x < 1)
+        fun_l7_n710(x)
+    else
+        fun_l7_n890(x)
+    end
+end
+
+def fun_l6_n141(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n470(x)
+    end
+end
+
+def fun_l6_n142(x)
+    if (x < 1)
+        fun_l7_n160(x)
+    else
+        fun_l7_n153(x)
+    end
+end
+
+def fun_l6_n143(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n286(x)
+    end
+end
+
+def fun_l6_n144(x)
+    if (x < 1)
+        fun_l7_n193(x)
+    else
+        fun_l7_n657(x)
+    end
+end
+
+def fun_l6_n145(x)
+    if (x < 1)
+        fun_l7_n885(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n146(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n188(x)
+    end
+end
+
+def fun_l6_n147(x)
+    if (x < 1)
+        fun_l7_n378(x)
+    else
+        fun_l7_n299(x)
+    end
+end
+
+def fun_l6_n148(x)
+    if (x < 1)
+        fun_l7_n239(x)
+    else
+        fun_l7_n70(x)
+    end
+end
+
+def fun_l6_n149(x)
+    if (x < 1)
+        fun_l7_n864(x)
+    else
+        fun_l7_n131(x)
+    end
+end
+
+def fun_l6_n150(x)
+    if (x < 1)
+        fun_l7_n748(x)
+    else
+        fun_l7_n112(x)
+    end
+end
+
+def fun_l6_n151(x)
+    if (x < 1)
+        fun_l7_n466(x)
+    else
+        fun_l7_n672(x)
+    end
+end
+
+def fun_l6_n152(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n8(x)
+    end
+end
+
+def fun_l6_n153(x)
+    if (x < 1)
+        fun_l7_n408(x)
+    else
+        fun_l7_n538(x)
+    end
+end
+
+def fun_l6_n154(x)
+    if (x < 1)
+        fun_l7_n984(x)
+    else
+        fun_l7_n134(x)
+    end
+end
+
+def fun_l6_n155(x)
+    if (x < 1)
+        fun_l7_n384(x)
+    else
+        fun_l7_n62(x)
+    end
+end
+
+def fun_l6_n156(x)
+    if (x < 1)
+        fun_l7_n576(x)
+    else
+        fun_l7_n168(x)
+    end
+end
+
+def fun_l6_n157(x)
+    if (x < 1)
+        fun_l7_n371(x)
+    else
+        fun_l7_n470(x)
+    end
+end
+
+def fun_l6_n158(x)
+    if (x < 1)
+        fun_l7_n30(x)
+    else
+        fun_l7_n11(x)
+    end
+end
+
+def fun_l6_n159(x)
+    if (x < 1)
+        fun_l7_n45(x)
+    else
+        fun_l7_n191(x)
+    end
+end
+
+def fun_l6_n160(x)
+    if (x < 1)
+        fun_l7_n659(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n161(x)
+    if (x < 1)
+        fun_l7_n586(x)
+    else
+        fun_l7_n617(x)
+    end
+end
+
+def fun_l6_n162(x)
+    if (x < 1)
+        fun_l7_n844(x)
+    else
+        fun_l7_n831(x)
+    end
+end
+
+def fun_l6_n163(x)
+    if (x < 1)
+        fun_l7_n14(x)
+    else
+        fun_l7_n631(x)
+    end
+end
+
+def fun_l6_n164(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n837(x)
+    end
+end
+
+def fun_l6_n165(x)
+    if (x < 1)
+        fun_l7_n825(x)
+    else
+        fun_l7_n902(x)
+    end
+end
+
+def fun_l6_n166(x)
+    if (x < 1)
+        fun_l7_n490(x)
+    else
+        fun_l7_n724(x)
+    end
+end
+
+def fun_l6_n167(x)
+    if (x < 1)
+        fun_l7_n612(x)
+    else
+        fun_l7_n792(x)
+    end
+end
+
+def fun_l6_n168(x)
+    if (x < 1)
+        fun_l7_n344(x)
+    else
+        fun_l7_n624(x)
+    end
+end
+
+def fun_l6_n169(x)
+    if (x < 1)
+        fun_l7_n255(x)
+    else
+        fun_l7_n456(x)
+    end
+end
+
+def fun_l6_n170(x)
+    if (x < 1)
+        fun_l7_n893(x)
+    else
+        fun_l7_n358(x)
+    end
+end
+
+def fun_l6_n171(x)
+    if (x < 1)
+        fun_l7_n926(x)
+    else
+        fun_l7_n988(x)
+    end
+end
+
+def fun_l6_n172(x)
+    if (x < 1)
+        fun_l7_n856(x)
+    else
+        fun_l7_n553(x)
+    end
+end
+
+def fun_l6_n173(x)
+    if (x < 1)
+        fun_l7_n694(x)
+    else
+        fun_l7_n918(x)
+    end
+end
+
+def fun_l6_n174(x)
+    if (x < 1)
+        fun_l7_n884(x)
+    else
+        fun_l7_n711(x)
+    end
+end
+
+def fun_l6_n175(x)
+    if (x < 1)
+        fun_l7_n884(x)
+    else
+        fun_l7_n28(x)
+    end
+end
+
+def fun_l6_n176(x)
+    if (x < 1)
+        fun_l7_n378(x)
+    else
+        fun_l7_n14(x)
+    end
+end
+
+def fun_l6_n177(x)
+    if (x < 1)
+        fun_l7_n844(x)
+    else
+        fun_l7_n549(x)
+    end
+end
+
+def fun_l6_n178(x)
+    if (x < 1)
+        fun_l7_n396(x)
+    else
+        fun_l7_n802(x)
+    end
+end
+
+def fun_l6_n179(x)
+    if (x < 1)
+        fun_l7_n407(x)
+    else
+        fun_l7_n612(x)
+    end
+end
+
+def fun_l6_n180(x)
+    if (x < 1)
+        fun_l7_n403(x)
+    else
+        fun_l7_n768(x)
+    end
+end
+
+def fun_l6_n181(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n301(x)
+    end
+end
+
+def fun_l6_n182(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n923(x)
+    end
+end
+
+def fun_l6_n183(x)
+    if (x < 1)
+        fun_l7_n664(x)
+    else
+        fun_l7_n451(x)
+    end
+end
+
+def fun_l6_n184(x)
+    if (x < 1)
+        fun_l7_n854(x)
+    else
+        fun_l7_n438(x)
+    end
+end
+
+def fun_l6_n185(x)
+    if (x < 1)
+        fun_l7_n994(x)
+    else
+        fun_l7_n726(x)
+    end
+end
+
+def fun_l6_n186(x)
+    if (x < 1)
+        fun_l7_n128(x)
+    else
+        fun_l7_n166(x)
+    end
+end
+
+def fun_l6_n187(x)
+    if (x < 1)
+        fun_l7_n515(x)
+    else
+        fun_l7_n21(x)
+    end
+end
+
+def fun_l6_n188(x)
+    if (x < 1)
+        fun_l7_n487(x)
+    else
+        fun_l7_n631(x)
+    end
+end
+
+def fun_l6_n189(x)
+    if (x < 1)
+        fun_l7_n16(x)
+    else
+        fun_l7_n579(x)
+    end
+end
+
+def fun_l6_n190(x)
+    if (x < 1)
+        fun_l7_n30(x)
+    else
+        fun_l7_n417(x)
+    end
+end
+
+def fun_l6_n191(x)
+    if (x < 1)
+        fun_l7_n737(x)
+    else
+        fun_l7_n436(x)
+    end
+end
+
+def fun_l6_n192(x)
+    if (x < 1)
+        fun_l7_n260(x)
+    else
+        fun_l7_n657(x)
+    end
+end
+
+def fun_l6_n193(x)
+    if (x < 1)
+        fun_l7_n722(x)
+    else
+        fun_l7_n489(x)
+    end
+end
+
+def fun_l6_n194(x)
+    if (x < 1)
+        fun_l7_n53(x)
+    else
+        fun_l7_n624(x)
+    end
+end
+
+def fun_l6_n195(x)
+    if (x < 1)
+        fun_l7_n91(x)
+    else
+        fun_l7_n597(x)
+    end
+end
+
+def fun_l6_n196(x)
+    if (x < 1)
+        fun_l7_n980(x)
+    else
+        fun_l7_n498(x)
+    end
+end
+
+def fun_l6_n197(x)
+    if (x < 1)
+        fun_l7_n918(x)
+    else
+        fun_l7_n328(x)
+    end
+end
+
+def fun_l6_n198(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n761(x)
+    end
+end
+
+def fun_l6_n199(x)
+    if (x < 1)
+        fun_l7_n692(x)
+    else
+        fun_l7_n610(x)
+    end
+end
+
+def fun_l6_n200(x)
+    if (x < 1)
+        fun_l7_n597(x)
+    else
+        fun_l7_n135(x)
+    end
+end
+
+def fun_l6_n201(x)
+    if (x < 1)
+        fun_l7_n973(x)
+    else
+        fun_l7_n453(x)
+    end
+end
+
+def fun_l6_n202(x)
+    if (x < 1)
+        fun_l7_n433(x)
+    else
+        fun_l7_n794(x)
+    end
+end
+
+def fun_l6_n203(x)
+    if (x < 1)
+        fun_l7_n294(x)
+    else
+        fun_l7_n271(x)
+    end
+end
+
+def fun_l6_n204(x)
+    if (x < 1)
+        fun_l7_n783(x)
+    else
+        fun_l7_n20(x)
+    end
+end
+
+def fun_l6_n205(x)
+    if (x < 1)
+        fun_l7_n941(x)
+    else
+        fun_l7_n517(x)
+    end
+end
+
+def fun_l6_n206(x)
+    if (x < 1)
+        fun_l7_n306(x)
+    else
+        fun_l7_n735(x)
+    end
+end
+
+def fun_l6_n207(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n313(x)
+    end
+end
+
+def fun_l6_n208(x)
+    if (x < 1)
+        fun_l7_n766(x)
+    else
+        fun_l7_n868(x)
+    end
+end
+
+def fun_l6_n209(x)
+    if (x < 1)
+        fun_l7_n780(x)
+    else
+        fun_l7_n422(x)
+    end
+end
+
+def fun_l6_n210(x)
+    if (x < 1)
+        fun_l7_n279(x)
+    else
+        fun_l7_n695(x)
+    end
+end
+
+def fun_l6_n211(x)
+    if (x < 1)
+        fun_l7_n981(x)
+    else
+        fun_l7_n946(x)
+    end
+end
+
+def fun_l6_n212(x)
+    if (x < 1)
+        fun_l7_n885(x)
+    else
+        fun_l7_n752(x)
+    end
+end
+
+def fun_l6_n213(x)
+    if (x < 1)
+        fun_l7_n238(x)
+    else
+        fun_l7_n322(x)
+    end
+end
+
+def fun_l6_n214(x)
+    if (x < 1)
+        fun_l7_n832(x)
+    else
+        fun_l7_n714(x)
+    end
+end
+
+def fun_l6_n215(x)
+    if (x < 1)
+        fun_l7_n369(x)
+    else
+        fun_l7_n793(x)
+    end
+end
+
+def fun_l6_n216(x)
+    if (x < 1)
+        fun_l7_n897(x)
+    else
+        fun_l7_n22(x)
+    end
+end
+
+def fun_l6_n217(x)
+    if (x < 1)
+        fun_l7_n94(x)
+    else
+        fun_l7_n93(x)
+    end
+end
+
+def fun_l6_n218(x)
+    if (x < 1)
+        fun_l7_n638(x)
+    else
+        fun_l7_n267(x)
+    end
+end
+
+def fun_l6_n219(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n162(x)
+    end
+end
+
+def fun_l6_n220(x)
+    if (x < 1)
+        fun_l7_n969(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n221(x)
+    if (x < 1)
+        fun_l7_n692(x)
+    else
+        fun_l7_n421(x)
+    end
+end
+
+def fun_l6_n222(x)
+    if (x < 1)
+        fun_l7_n312(x)
+    else
+        fun_l7_n475(x)
+    end
+end
+
+def fun_l6_n223(x)
+    if (x < 1)
+        fun_l7_n566(x)
+    else
+        fun_l7_n497(x)
+    end
+end
+
+def fun_l6_n224(x)
+    if (x < 1)
+        fun_l7_n560(x)
+    else
+        fun_l7_n60(x)
+    end
+end
+
+def fun_l6_n225(x)
+    if (x < 1)
+        fun_l7_n484(x)
+    else
+        fun_l7_n602(x)
+    end
+end
+
+def fun_l6_n226(x)
+    if (x < 1)
+        fun_l7_n399(x)
+    else
+        fun_l7_n614(x)
+    end
+end
+
+def fun_l6_n227(x)
+    if (x < 1)
+        fun_l7_n344(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n228(x)
+    if (x < 1)
+        fun_l7_n840(x)
+    else
+        fun_l7_n211(x)
+    end
+end
+
+def fun_l6_n229(x)
+    if (x < 1)
+        fun_l7_n423(x)
+    else
+        fun_l7_n51(x)
+    end
+end
+
+def fun_l6_n230(x)
+    if (x < 1)
+        fun_l7_n978(x)
+    else
+        fun_l7_n334(x)
+    end
+end
+
+def fun_l6_n231(x)
+    if (x < 1)
+        fun_l7_n136(x)
+    else
+        fun_l7_n296(x)
+    end
+end
+
+def fun_l6_n232(x)
+    if (x < 1)
+        fun_l7_n24(x)
+    else
+        fun_l7_n282(x)
+    end
+end
+
+def fun_l6_n233(x)
+    if (x < 1)
+        fun_l7_n803(x)
+    else
+        fun_l7_n623(x)
+    end
+end
+
+def fun_l6_n234(x)
+    if (x < 1)
+        fun_l7_n720(x)
+    else
+        fun_l7_n492(x)
+    end
+end
+
+def fun_l6_n235(x)
+    if (x < 1)
+        fun_l7_n627(x)
+    else
+        fun_l7_n260(x)
+    end
+end
+
+def fun_l6_n236(x)
+    if (x < 1)
+        fun_l7_n460(x)
+    else
+        fun_l7_n693(x)
+    end
+end
+
+def fun_l6_n237(x)
+    if (x < 1)
+        fun_l7_n635(x)
+    else
+        fun_l7_n745(x)
+    end
+end
+
+def fun_l6_n238(x)
+    if (x < 1)
+        fun_l7_n76(x)
+    else
+        fun_l7_n283(x)
+    end
+end
+
+def fun_l6_n239(x)
+    if (x < 1)
+        fun_l7_n183(x)
+    else
+        fun_l7_n515(x)
+    end
+end
+
+def fun_l6_n240(x)
+    if (x < 1)
+        fun_l7_n266(x)
+    else
+        fun_l7_n34(x)
+    end
+end
+
+def fun_l6_n241(x)
+    if (x < 1)
+        fun_l7_n480(x)
+    else
+        fun_l7_n868(x)
+    end
+end
+
+def fun_l6_n242(x)
+    if (x < 1)
+        fun_l7_n998(x)
+    else
+        fun_l7_n669(x)
+    end
+end
+
+def fun_l6_n243(x)
+    if (x < 1)
+        fun_l7_n414(x)
+    else
+        fun_l7_n161(x)
+    end
+end
+
+def fun_l6_n244(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n659(x)
+    end
+end
+
+def fun_l6_n245(x)
+    if (x < 1)
+        fun_l7_n881(x)
+    else
+        fun_l7_n229(x)
+    end
+end
+
+def fun_l6_n246(x)
+    if (x < 1)
+        fun_l7_n328(x)
+    else
+        fun_l7_n935(x)
+    end
+end
+
+def fun_l6_n247(x)
+    if (x < 1)
+        fun_l7_n433(x)
+    else
+        fun_l7_n565(x)
+    end
+end
+
+def fun_l6_n248(x)
+    if (x < 1)
+        fun_l7_n161(x)
+    else
+        fun_l7_n760(x)
+    end
+end
+
+def fun_l6_n249(x)
+    if (x < 1)
+        fun_l7_n115(x)
+    else
+        fun_l7_n594(x)
+    end
+end
+
+def fun_l6_n250(x)
+    if (x < 1)
+        fun_l7_n350(x)
+    else
+        fun_l7_n310(x)
+    end
+end
+
+def fun_l6_n251(x)
+    if (x < 1)
+        fun_l7_n920(x)
+    else
+        fun_l7_n51(x)
+    end
+end
+
+def fun_l6_n252(x)
+    if (x < 1)
+        fun_l7_n132(x)
+    else
+        fun_l7_n492(x)
+    end
+end
+
+def fun_l6_n253(x)
+    if (x < 1)
+        fun_l7_n618(x)
+    else
+        fun_l7_n325(x)
+    end
+end
+
+def fun_l6_n254(x)
+    if (x < 1)
+        fun_l7_n682(x)
+    else
+        fun_l7_n840(x)
+    end
+end
+
+def fun_l6_n255(x)
+    if (x < 1)
+        fun_l7_n462(x)
+    else
+        fun_l7_n780(x)
+    end
+end
+
+def fun_l6_n256(x)
+    if (x < 1)
+        fun_l7_n712(x)
+    else
+        fun_l7_n995(x)
+    end
+end
+
+def fun_l6_n257(x)
+    if (x < 1)
+        fun_l7_n111(x)
+    else
+        fun_l7_n121(x)
+    end
+end
+
+def fun_l6_n258(x)
+    if (x < 1)
+        fun_l7_n255(x)
+    else
+        fun_l7_n384(x)
+    end
+end
+
+def fun_l6_n259(x)
+    if (x < 1)
+        fun_l7_n610(x)
+    else
+        fun_l7_n555(x)
+    end
+end
+
+def fun_l6_n260(x)
+    if (x < 1)
+        fun_l7_n778(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n261(x)
+    if (x < 1)
+        fun_l7_n376(x)
+    else
+        fun_l7_n892(x)
+    end
+end
+
+def fun_l6_n262(x)
+    if (x < 1)
+        fun_l7_n454(x)
+    else
+        fun_l7_n468(x)
+    end
+end
+
+def fun_l6_n263(x)
+    if (x < 1)
+        fun_l7_n708(x)
+    else
+        fun_l7_n368(x)
+    end
+end
+
+def fun_l6_n264(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n299(x)
+    end
+end
+
+def fun_l6_n265(x)
+    if (x < 1)
+        fun_l7_n987(x)
+    else
+        fun_l7_n318(x)
+    end
+end
+
+def fun_l6_n266(x)
+    if (x < 1)
+        fun_l7_n372(x)
+    else
+        fun_l7_n560(x)
+    end
+end
+
+def fun_l6_n267(x)
+    if (x < 1)
+        fun_l7_n493(x)
+    else
+        fun_l7_n288(x)
+    end
+end
+
+def fun_l6_n268(x)
+    if (x < 1)
+        fun_l7_n278(x)
+    else
+        fun_l7_n10(x)
+    end
+end
+
+def fun_l6_n269(x)
+    if (x < 1)
+        fun_l7_n417(x)
+    else
+        fun_l7_n703(x)
+    end
+end
+
+def fun_l6_n270(x)
+    if (x < 1)
+        fun_l7_n410(x)
+    else
+        fun_l7_n91(x)
+    end
+end
+
+def fun_l6_n271(x)
+    if (x < 1)
+        fun_l7_n281(x)
+    else
+        fun_l7_n447(x)
+    end
+end
+
+def fun_l6_n272(x)
+    if (x < 1)
+        fun_l7_n263(x)
+    else
+        fun_l7_n374(x)
+    end
+end
+
+def fun_l6_n273(x)
+    if (x < 1)
+        fun_l7_n622(x)
+    else
+        fun_l7_n310(x)
+    end
+end
+
+def fun_l6_n274(x)
+    if (x < 1)
+        fun_l7_n176(x)
+    else
+        fun_l7_n227(x)
+    end
+end
+
+def fun_l6_n275(x)
+    if (x < 1)
+        fun_l7_n848(x)
+    else
+        fun_l7_n416(x)
+    end
+end
+
+def fun_l6_n276(x)
+    if (x < 1)
+        fun_l7_n998(x)
+    else
+        fun_l7_n969(x)
+    end
+end
+
+def fun_l6_n277(x)
+    if (x < 1)
+        fun_l7_n356(x)
+    else
+        fun_l7_n722(x)
+    end
+end
+
+def fun_l6_n278(x)
+    if (x < 1)
+        fun_l7_n888(x)
+    else
+        fun_l7_n156(x)
+    end
+end
+
+def fun_l6_n279(x)
+    if (x < 1)
+        fun_l7_n779(x)
+    else
+        fun_l7_n123(x)
+    end
+end
+
+def fun_l6_n280(x)
+    if (x < 1)
+        fun_l7_n393(x)
+    else
+        fun_l7_n765(x)
+    end
+end
+
+def fun_l6_n281(x)
+    if (x < 1)
+        fun_l7_n257(x)
+    else
+        fun_l7_n277(x)
+    end
+end
+
+def fun_l6_n282(x)
+    if (x < 1)
+        fun_l7_n780(x)
+    else
+        fun_l7_n643(x)
+    end
+end
+
+def fun_l6_n283(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n449(x)
+    end
+end
+
+def fun_l6_n284(x)
+    if (x < 1)
+        fun_l7_n200(x)
+    else
+        fun_l7_n806(x)
+    end
+end
+
+def fun_l6_n285(x)
+    if (x < 1)
+        fun_l7_n575(x)
+    else
+        fun_l7_n409(x)
+    end
+end
+
+def fun_l6_n286(x)
+    if (x < 1)
+        fun_l7_n377(x)
+    else
+        fun_l7_n456(x)
+    end
+end
+
+def fun_l6_n287(x)
+    if (x < 1)
+        fun_l7_n519(x)
+    else
+        fun_l7_n473(x)
+    end
+end
+
+def fun_l6_n288(x)
+    if (x < 1)
+        fun_l7_n525(x)
+    else
+        fun_l7_n45(x)
+    end
+end
+
+def fun_l6_n289(x)
+    if (x < 1)
+        fun_l7_n678(x)
+    else
+        fun_l7_n910(x)
+    end
+end
+
+def fun_l6_n290(x)
+    if (x < 1)
+        fun_l7_n628(x)
+    else
+        fun_l7_n939(x)
+    end
+end
+
+def fun_l6_n291(x)
+    if (x < 1)
+        fun_l7_n967(x)
+    else
+        fun_l7_n927(x)
+    end
+end
+
+def fun_l6_n292(x)
+    if (x < 1)
+        fun_l7_n634(x)
+    else
+        fun_l7_n184(x)
+    end
+end
+
+def fun_l6_n293(x)
+    if (x < 1)
+        fun_l7_n857(x)
+    else
+        fun_l7_n625(x)
+    end
+end
+
+def fun_l6_n294(x)
+    if (x < 1)
+        fun_l7_n105(x)
+    else
+        fun_l7_n46(x)
+    end
+end
+
+def fun_l6_n295(x)
+    if (x < 1)
+        fun_l7_n642(x)
+    else
+        fun_l7_n566(x)
+    end
+end
+
+def fun_l6_n296(x)
+    if (x < 1)
+        fun_l7_n173(x)
+    else
+        fun_l7_n619(x)
+    end
+end
+
+def fun_l6_n297(x)
+    if (x < 1)
+        fun_l7_n257(x)
+    else
+        fun_l7_n485(x)
+    end
+end
+
+def fun_l6_n298(x)
+    if (x < 1)
+        fun_l7_n447(x)
+    else
+        fun_l7_n808(x)
+    end
+end
+
+def fun_l6_n299(x)
+    if (x < 1)
+        fun_l7_n838(x)
+    else
+        fun_l7_n856(x)
+    end
+end
+
+def fun_l6_n300(x)
+    if (x < 1)
+        fun_l7_n893(x)
+    else
+        fun_l7_n99(x)
+    end
+end
+
+def fun_l6_n301(x)
+    if (x < 1)
+        fun_l7_n180(x)
+    else
+        fun_l7_n126(x)
+    end
+end
+
+def fun_l6_n302(x)
+    if (x < 1)
+        fun_l7_n62(x)
+    else
+        fun_l7_n266(x)
+    end
+end
+
+def fun_l6_n303(x)
+    if (x < 1)
+        fun_l7_n709(x)
+    else
+        fun_l7_n196(x)
+    end
+end
+
+def fun_l6_n304(x)
+    if (x < 1)
+        fun_l7_n408(x)
+    else
+        fun_l7_n730(x)
+    end
+end
+
+def fun_l6_n305(x)
+    if (x < 1)
+        fun_l7_n736(x)
+    else
+        fun_l7_n673(x)
+    end
+end
+
+def fun_l6_n306(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n519(x)
+    end
+end
+
+def fun_l6_n307(x)
+    if (x < 1)
+        fun_l7_n629(x)
+    else
+        fun_l7_n670(x)
+    end
+end
+
+def fun_l6_n308(x)
+    if (x < 1)
+        fun_l7_n839(x)
+    else
+        fun_l7_n191(x)
+    end
+end
+
+def fun_l6_n309(x)
+    if (x < 1)
+        fun_l7_n123(x)
+    else
+        fun_l7_n553(x)
+    end
+end
+
+def fun_l6_n310(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n815(x)
+    end
+end
+
+def fun_l6_n311(x)
+    if (x < 1)
+        fun_l7_n860(x)
+    else
+        fun_l7_n519(x)
+    end
+end
+
+def fun_l6_n312(x)
+    if (x < 1)
+        fun_l7_n181(x)
+    else
+        fun_l7_n674(x)
+    end
+end
+
+def fun_l6_n313(x)
+    if (x < 1)
+        fun_l7_n654(x)
+    else
+        fun_l7_n500(x)
+    end
+end
+
+def fun_l6_n314(x)
+    if (x < 1)
+        fun_l7_n690(x)
+    else
+        fun_l7_n136(x)
+    end
+end
+
+def fun_l6_n315(x)
+    if (x < 1)
+        fun_l7_n944(x)
+    else
+        fun_l7_n956(x)
+    end
+end
+
+def fun_l6_n316(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n245(x)
+    end
+end
+
+def fun_l6_n317(x)
+    if (x < 1)
+        fun_l7_n520(x)
+    else
+        fun_l7_n919(x)
+    end
+end
+
+def fun_l6_n318(x)
+    if (x < 1)
+        fun_l7_n843(x)
+    else
+        fun_l7_n793(x)
+    end
+end
+
+def fun_l6_n319(x)
+    if (x < 1)
+        fun_l7_n765(x)
+    else
+        fun_l7_n363(x)
+    end
+end
+
+def fun_l6_n320(x)
+    if (x < 1)
+        fun_l7_n483(x)
+    else
+        fun_l7_n439(x)
+    end
+end
+
+def fun_l6_n321(x)
+    if (x < 1)
+        fun_l7_n232(x)
+    else
+        fun_l7_n921(x)
+    end
+end
+
+def fun_l6_n322(x)
+    if (x < 1)
+        fun_l7_n398(x)
+    else
+        fun_l7_n862(x)
+    end
+end
+
+def fun_l6_n323(x)
+    if (x < 1)
+        fun_l7_n550(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n324(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n325(x)
+    if (x < 1)
+        fun_l7_n512(x)
+    else
+        fun_l7_n303(x)
+    end
+end
+
+def fun_l6_n326(x)
+    if (x < 1)
+        fun_l7_n86(x)
+    else
+        fun_l7_n555(x)
+    end
+end
+
+def fun_l6_n327(x)
+    if (x < 1)
+        fun_l7_n857(x)
+    else
+        fun_l7_n751(x)
+    end
+end
+
+def fun_l6_n328(x)
+    if (x < 1)
+        fun_l7_n341(x)
+    else
+        fun_l7_n208(x)
+    end
+end
+
+def fun_l6_n329(x)
+    if (x < 1)
+        fun_l7_n707(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n330(x)
+    if (x < 1)
+        fun_l7_n217(x)
+    else
+        fun_l7_n604(x)
+    end
+end
+
+def fun_l6_n331(x)
+    if (x < 1)
+        fun_l7_n607(x)
+    else
+        fun_l7_n471(x)
+    end
+end
+
+def fun_l6_n332(x)
+    if (x < 1)
+        fun_l7_n818(x)
+    else
+        fun_l7_n787(x)
+    end
+end
+
+def fun_l6_n333(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n220(x)
+    end
+end
+
+def fun_l6_n334(x)
+    if (x < 1)
+        fun_l7_n666(x)
+    else
+        fun_l7_n995(x)
+    end
+end
+
+def fun_l6_n335(x)
+    if (x < 1)
+        fun_l7_n3(x)
+    else
+        fun_l7_n970(x)
+    end
+end
+
+def fun_l6_n336(x)
+    if (x < 1)
+        fun_l7_n977(x)
+    else
+        fun_l7_n77(x)
+    end
+end
+
+def fun_l6_n337(x)
+    if (x < 1)
+        fun_l7_n54(x)
+    else
+        fun_l7_n814(x)
+    end
+end
+
+def fun_l6_n338(x)
+    if (x < 1)
+        fun_l7_n129(x)
+    else
+        fun_l7_n624(x)
+    end
+end
+
+def fun_l6_n339(x)
+    if (x < 1)
+        fun_l7_n866(x)
+    else
+        fun_l7_n821(x)
+    end
+end
+
+def fun_l6_n340(x)
+    if (x < 1)
+        fun_l7_n912(x)
+    else
+        fun_l7_n24(x)
+    end
+end
+
+def fun_l6_n341(x)
+    if (x < 1)
+        fun_l7_n684(x)
+    else
+        fun_l7_n610(x)
+    end
+end
+
+def fun_l6_n342(x)
+    if (x < 1)
+        fun_l7_n816(x)
+    else
+        fun_l7_n826(x)
+    end
+end
+
+def fun_l6_n343(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n444(x)
+    end
+end
+
+def fun_l6_n344(x)
+    if (x < 1)
+        fun_l7_n51(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n345(x)
+    if (x < 1)
+        fun_l7_n690(x)
+    else
+        fun_l7_n631(x)
+    end
+end
+
+def fun_l6_n346(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n353(x)
+    end
+end
+
+def fun_l6_n347(x)
+    if (x < 1)
+        fun_l7_n905(x)
+    else
+        fun_l7_n422(x)
+    end
+end
+
+def fun_l6_n348(x)
+    if (x < 1)
+        fun_l7_n249(x)
+    else
+        fun_l7_n200(x)
+    end
+end
+
+def fun_l6_n349(x)
+    if (x < 1)
+        fun_l7_n11(x)
+    else
+        fun_l7_n550(x)
+    end
+end
+
+def fun_l6_n350(x)
+    if (x < 1)
+        fun_l7_n818(x)
+    else
+        fun_l7_n444(x)
+    end
+end
+
+def fun_l6_n351(x)
+    if (x < 1)
+        fun_l7_n422(x)
+    else
+        fun_l7_n242(x)
+    end
+end
+
+def fun_l6_n352(x)
+    if (x < 1)
+        fun_l7_n653(x)
+    else
+        fun_l7_n912(x)
+    end
+end
+
+def fun_l6_n353(x)
+    if (x < 1)
+        fun_l7_n605(x)
+    else
+        fun_l7_n129(x)
+    end
+end
+
+def fun_l6_n354(x)
+    if (x < 1)
+        fun_l7_n622(x)
+    else
+        fun_l7_n172(x)
+    end
+end
+
+def fun_l6_n355(x)
+    if (x < 1)
+        fun_l7_n568(x)
+    else
+        fun_l7_n26(x)
+    end
+end
+
+def fun_l6_n356(x)
+    if (x < 1)
+        fun_l7_n777(x)
+    else
+        fun_l7_n818(x)
+    end
+end
+
+def fun_l6_n357(x)
+    if (x < 1)
+        fun_l7_n807(x)
+    else
+        fun_l7_n642(x)
+    end
+end
+
+def fun_l6_n358(x)
+    if (x < 1)
+        fun_l7_n745(x)
+    else
+        fun_l7_n866(x)
+    end
+end
+
+def fun_l6_n359(x)
+    if (x < 1)
+        fun_l7_n603(x)
+    else
+        fun_l7_n42(x)
+    end
+end
+
+def fun_l6_n360(x)
+    if (x < 1)
+        fun_l7_n818(x)
+    else
+        fun_l7_n203(x)
+    end
+end
+
+def fun_l6_n361(x)
+    if (x < 1)
+        fun_l7_n451(x)
+    else
+        fun_l7_n719(x)
+    end
+end
+
+def fun_l6_n362(x)
+    if (x < 1)
+        fun_l7_n31(x)
+    else
+        fun_l7_n148(x)
+    end
+end
+
+def fun_l6_n363(x)
+    if (x < 1)
+        fun_l7_n148(x)
+    else
+        fun_l7_n292(x)
+    end
+end
+
+def fun_l6_n364(x)
+    if (x < 1)
+        fun_l7_n175(x)
+    else
+        fun_l7_n849(x)
+    end
+end
+
+def fun_l6_n365(x)
+    if (x < 1)
+        fun_l7_n414(x)
+    else
+        fun_l7_n57(x)
+    end
+end
+
+def fun_l6_n366(x)
+    if (x < 1)
+        fun_l7_n771(x)
+    else
+        fun_l7_n625(x)
+    end
+end
+
+def fun_l6_n367(x)
+    if (x < 1)
+        fun_l7_n232(x)
+    else
+        fun_l7_n108(x)
+    end
+end
+
+def fun_l6_n368(x)
+    if (x < 1)
+        fun_l7_n123(x)
+    else
+        fun_l7_n413(x)
+    end
+end
+
+def fun_l6_n369(x)
+    if (x < 1)
+        fun_l7_n587(x)
+    else
+        fun_l7_n876(x)
+    end
+end
+
+def fun_l6_n370(x)
+    if (x < 1)
+        fun_l7_n750(x)
+    else
+        fun_l7_n531(x)
+    end
+end
+
+def fun_l6_n371(x)
+    if (x < 1)
+        fun_l7_n55(x)
+    else
+        fun_l7_n859(x)
+    end
+end
+
+def fun_l6_n372(x)
+    if (x < 1)
+        fun_l7_n848(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n373(x)
+    if (x < 1)
+        fun_l7_n480(x)
+    else
+        fun_l7_n976(x)
+    end
+end
+
+def fun_l6_n374(x)
+    if (x < 1)
+        fun_l7_n298(x)
+    else
+        fun_l7_n844(x)
+    end
+end
+
+def fun_l6_n375(x)
+    if (x < 1)
+        fun_l7_n564(x)
+    else
+        fun_l7_n960(x)
+    end
+end
+
+def fun_l6_n376(x)
+    if (x < 1)
+        fun_l7_n684(x)
+    else
+        fun_l7_n181(x)
+    end
+end
+
+def fun_l6_n377(x)
+    if (x < 1)
+        fun_l7_n153(x)
+    else
+        fun_l7_n21(x)
+    end
+end
+
+def fun_l6_n378(x)
+    if (x < 1)
+        fun_l7_n377(x)
+    else
+        fun_l7_n761(x)
+    end
+end
+
+def fun_l6_n379(x)
+    if (x < 1)
+        fun_l7_n737(x)
+    else
+        fun_l7_n605(x)
+    end
+end
+
+def fun_l6_n380(x)
+    if (x < 1)
+        fun_l7_n536(x)
+    else
+        fun_l7_n143(x)
+    end
+end
+
+def fun_l6_n381(x)
+    if (x < 1)
+        fun_l7_n314(x)
+    else
+        fun_l7_n999(x)
+    end
+end
+
+def fun_l6_n382(x)
+    if (x < 1)
+        fun_l7_n995(x)
+    else
+        fun_l7_n564(x)
+    end
+end
+
+def fun_l6_n383(x)
+    if (x < 1)
+        fun_l7_n772(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n384(x)
+    if (x < 1)
+        fun_l7_n250(x)
+    else
+        fun_l7_n142(x)
+    end
+end
+
+def fun_l6_n385(x)
+    if (x < 1)
+        fun_l7_n993(x)
+    else
+        fun_l7_n987(x)
+    end
+end
+
+def fun_l6_n386(x)
+    if (x < 1)
+        fun_l7_n717(x)
+    else
+        fun_l7_n674(x)
+    end
+end
+
+def fun_l6_n387(x)
+    if (x < 1)
+        fun_l7_n585(x)
+    else
+        fun_l7_n102(x)
+    end
+end
+
+def fun_l6_n388(x)
+    if (x < 1)
+        fun_l7_n779(x)
+    else
+        fun_l7_n110(x)
+    end
+end
+
+def fun_l6_n389(x)
+    if (x < 1)
+        fun_l7_n815(x)
+    else
+        fun_l7_n194(x)
+    end
+end
+
+def fun_l6_n390(x)
+    if (x < 1)
+        fun_l7_n261(x)
+    else
+        fun_l7_n30(x)
+    end
+end
+
+def fun_l6_n391(x)
+    if (x < 1)
+        fun_l7_n746(x)
+    else
+        fun_l7_n207(x)
+    end
+end
+
+def fun_l6_n392(x)
+    if (x < 1)
+        fun_l7_n866(x)
+    else
+        fun_l7_n862(x)
+    end
+end
+
+def fun_l6_n393(x)
+    if (x < 1)
+        fun_l7_n47(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n394(x)
+    if (x < 1)
+        fun_l7_n140(x)
+    else
+        fun_l7_n104(x)
+    end
+end
+
+def fun_l6_n395(x)
+    if (x < 1)
+        fun_l7_n170(x)
+    else
+        fun_l7_n93(x)
+    end
+end
+
+def fun_l6_n396(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n218(x)
+    end
+end
+
+def fun_l6_n397(x)
+    if (x < 1)
+        fun_l7_n268(x)
+    else
+        fun_l7_n278(x)
+    end
+end
+
+def fun_l6_n398(x)
+    if (x < 1)
+        fun_l7_n859(x)
+    else
+        fun_l7_n888(x)
+    end
+end
+
+def fun_l6_n399(x)
+    if (x < 1)
+        fun_l7_n540(x)
+    else
+        fun_l7_n218(x)
+    end
+end
+
+def fun_l6_n400(x)
+    if (x < 1)
+        fun_l7_n148(x)
+    else
+        fun_l7_n220(x)
+    end
+end
+
+def fun_l6_n401(x)
+    if (x < 1)
+        fun_l7_n169(x)
+    else
+        fun_l7_n310(x)
+    end
+end
+
+def fun_l6_n402(x)
+    if (x < 1)
+        fun_l7_n256(x)
+    else
+        fun_l7_n336(x)
+    end
+end
+
+def fun_l6_n403(x)
+    if (x < 1)
+        fun_l7_n257(x)
+    else
+        fun_l7_n536(x)
+    end
+end
+
+def fun_l6_n404(x)
+    if (x < 1)
+        fun_l7_n47(x)
+    else
+        fun_l7_n714(x)
+    end
+end
+
+def fun_l6_n405(x)
+    if (x < 1)
+        fun_l7_n913(x)
+    else
+        fun_l7_n705(x)
+    end
+end
+
+def fun_l6_n406(x)
+    if (x < 1)
+        fun_l7_n816(x)
+    else
+        fun_l7_n168(x)
+    end
+end
+
+def fun_l6_n407(x)
+    if (x < 1)
+        fun_l7_n506(x)
+    else
+        fun_l7_n772(x)
+    end
+end
+
+def fun_l6_n408(x)
+    if (x < 1)
+        fun_l7_n983(x)
+    else
+        fun_l7_n973(x)
+    end
+end
+
+def fun_l6_n409(x)
+    if (x < 1)
+        fun_l7_n752(x)
+    else
+        fun_l7_n543(x)
+    end
+end
+
+def fun_l6_n410(x)
+    if (x < 1)
+        fun_l7_n580(x)
+    else
+        fun_l7_n265(x)
+    end
+end
+
+def fun_l6_n411(x)
+    if (x < 1)
+        fun_l7_n744(x)
+    else
+        fun_l7_n736(x)
+    end
+end
+
+def fun_l6_n412(x)
+    if (x < 1)
+        fun_l7_n950(x)
+    else
+        fun_l7_n5(x)
+    end
+end
+
+def fun_l6_n413(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n151(x)
+    end
+end
+
+def fun_l6_n414(x)
+    if (x < 1)
+        fun_l7_n907(x)
+    else
+        fun_l7_n113(x)
+    end
+end
+
+def fun_l6_n415(x)
+    if (x < 1)
+        fun_l7_n621(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n416(x)
+    if (x < 1)
+        fun_l7_n598(x)
+    else
+        fun_l7_n872(x)
+    end
+end
+
+def fun_l6_n417(x)
+    if (x < 1)
+        fun_l7_n811(x)
+    else
+        fun_l7_n734(x)
+    end
+end
+
+def fun_l6_n418(x)
+    if (x < 1)
+        fun_l7_n18(x)
+    else
+        fun_l7_n405(x)
+    end
+end
+
+def fun_l6_n419(x)
+    if (x < 1)
+        fun_l7_n89(x)
+    else
+        fun_l7_n153(x)
+    end
+end
+
+def fun_l6_n420(x)
+    if (x < 1)
+        fun_l7_n438(x)
+    else
+        fun_l7_n452(x)
+    end
+end
+
+def fun_l6_n421(x)
+    if (x < 1)
+        fun_l7_n601(x)
+    else
+        fun_l7_n777(x)
+    end
+end
+
+def fun_l6_n422(x)
+    if (x < 1)
+        fun_l7_n202(x)
+    else
+        fun_l7_n368(x)
+    end
+end
+
+def fun_l6_n423(x)
+    if (x < 1)
+        fun_l7_n636(x)
+    else
+        fun_l7_n137(x)
+    end
+end
+
+def fun_l6_n424(x)
+    if (x < 1)
+        fun_l7_n222(x)
+    else
+        fun_l7_n838(x)
+    end
+end
+
+def fun_l6_n425(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n175(x)
+    end
+end
+
+def fun_l6_n426(x)
+    if (x < 1)
+        fun_l7_n629(x)
+    else
+        fun_l7_n376(x)
+    end
+end
+
+def fun_l6_n427(x)
+    if (x < 1)
+        fun_l7_n293(x)
+    else
+        fun_l7_n517(x)
+    end
+end
+
+def fun_l6_n428(x)
+    if (x < 1)
+        fun_l7_n859(x)
+    else
+        fun_l7_n129(x)
+    end
+end
+
+def fun_l6_n429(x)
+    if (x < 1)
+        fun_l7_n854(x)
+    else
+        fun_l7_n647(x)
+    end
+end
+
+def fun_l6_n430(x)
+    if (x < 1)
+        fun_l7_n117(x)
+    else
+        fun_l7_n291(x)
+    end
+end
+
+def fun_l6_n431(x)
+    if (x < 1)
+        fun_l7_n505(x)
+    else
+        fun_l7_n938(x)
+    end
+end
+
+def fun_l6_n432(x)
+    if (x < 1)
+        fun_l7_n536(x)
+    else
+        fun_l7_n303(x)
+    end
+end
+
+def fun_l6_n433(x)
+    if (x < 1)
+        fun_l7_n443(x)
+    else
+        fun_l7_n945(x)
+    end
+end
+
+def fun_l6_n434(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n594(x)
+    end
+end
+
+def fun_l6_n435(x)
+    if (x < 1)
+        fun_l7_n273(x)
+    else
+        fun_l7_n704(x)
+    end
+end
+
+def fun_l6_n436(x)
+    if (x < 1)
+        fun_l7_n451(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n437(x)
+    if (x < 1)
+        fun_l7_n628(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n438(x)
+    if (x < 1)
+        fun_l7_n361(x)
+    else
+        fun_l7_n506(x)
+    end
+end
+
+def fun_l6_n439(x)
+    if (x < 1)
+        fun_l7_n8(x)
+    else
+        fun_l7_n721(x)
+    end
+end
+
+def fun_l6_n440(x)
+    if (x < 1)
+        fun_l7_n728(x)
+    else
+        fun_l7_n372(x)
+    end
+end
+
+def fun_l6_n441(x)
+    if (x < 1)
+        fun_l7_n988(x)
+    else
+        fun_l7_n323(x)
+    end
+end
+
+def fun_l6_n442(x)
+    if (x < 1)
+        fun_l7_n5(x)
+    else
+        fun_l7_n56(x)
+    end
+end
+
+def fun_l6_n443(x)
+    if (x < 1)
+        fun_l7_n553(x)
+    else
+        fun_l7_n776(x)
+    end
+end
+
+def fun_l6_n444(x)
+    if (x < 1)
+        fun_l7_n194(x)
+    else
+        fun_l7_n101(x)
+    end
+end
+
+def fun_l6_n445(x)
+    if (x < 1)
+        fun_l7_n613(x)
+    else
+        fun_l7_n977(x)
+    end
+end
+
+def fun_l6_n446(x)
+    if (x < 1)
+        fun_l7_n23(x)
+    else
+        fun_l7_n311(x)
+    end
+end
+
+def fun_l6_n447(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n8(x)
+    end
+end
+
+def fun_l6_n448(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n229(x)
+    end
+end
+
+def fun_l6_n449(x)
+    if (x < 1)
+        fun_l7_n222(x)
+    else
+        fun_l7_n620(x)
+    end
+end
+
+def fun_l6_n450(x)
+    if (x < 1)
+        fun_l7_n599(x)
+    else
+        fun_l7_n468(x)
+    end
+end
+
+def fun_l6_n451(x)
+    if (x < 1)
+        fun_l7_n347(x)
+    else
+        fun_l7_n504(x)
+    end
+end
+
+def fun_l6_n452(x)
+    if (x < 1)
+        fun_l7_n95(x)
+    else
+        fun_l7_n482(x)
+    end
+end
+
+def fun_l6_n453(x)
+    if (x < 1)
+        fun_l7_n217(x)
+    else
+        fun_l7_n419(x)
+    end
+end
+
+def fun_l6_n454(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n609(x)
+    end
+end
+
+def fun_l6_n455(x)
+    if (x < 1)
+        fun_l7_n932(x)
+    else
+        fun_l7_n744(x)
+    end
+end
+
+def fun_l6_n456(x)
+    if (x < 1)
+        fun_l7_n901(x)
+    else
+        fun_l7_n882(x)
+    end
+end
+
+def fun_l6_n457(x)
+    if (x < 1)
+        fun_l7_n368(x)
+    else
+        fun_l7_n441(x)
+    end
+end
+
+def fun_l6_n458(x)
+    if (x < 1)
+        fun_l7_n49(x)
+    else
+        fun_l7_n135(x)
+    end
+end
+
+def fun_l6_n459(x)
+    if (x < 1)
+        fun_l7_n228(x)
+    else
+        fun_l7_n899(x)
+    end
+end
+
+def fun_l6_n460(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n190(x)
+    end
+end
+
+def fun_l6_n461(x)
+    if (x < 1)
+        fun_l7_n892(x)
+    else
+        fun_l7_n670(x)
+    end
+end
+
+def fun_l6_n462(x)
+    if (x < 1)
+        fun_l7_n961(x)
+    else
+        fun_l7_n769(x)
+    end
+end
+
+def fun_l6_n463(x)
+    if (x < 1)
+        fun_l7_n828(x)
+    else
+        fun_l7_n219(x)
+    end
+end
+
+def fun_l6_n464(x)
+    if (x < 1)
+        fun_l7_n17(x)
+    else
+        fun_l7_n345(x)
+    end
+end
+
+def fun_l6_n465(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n498(x)
+    end
+end
+
+def fun_l6_n466(x)
+    if (x < 1)
+        fun_l7_n659(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n467(x)
+    if (x < 1)
+        fun_l7_n528(x)
+    else
+        fun_l7_n138(x)
+    end
+end
+
+def fun_l6_n468(x)
+    if (x < 1)
+        fun_l7_n272(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n469(x)
+    if (x < 1)
+        fun_l7_n458(x)
+    else
+        fun_l7_n430(x)
+    end
+end
+
+def fun_l6_n470(x)
+    if (x < 1)
+        fun_l7_n192(x)
+    else
+        fun_l7_n755(x)
+    end
+end
+
+def fun_l6_n471(x)
+    if (x < 1)
+        fun_l7_n188(x)
+    else
+        fun_l7_n827(x)
+    end
+end
+
+def fun_l6_n472(x)
+    if (x < 1)
+        fun_l7_n467(x)
+    else
+        fun_l7_n167(x)
+    end
+end
+
+def fun_l6_n473(x)
+    if (x < 1)
+        fun_l7_n648(x)
+    else
+        fun_l7_n823(x)
+    end
+end
+
+def fun_l6_n474(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n120(x)
+    end
+end
+
+def fun_l6_n475(x)
+    if (x < 1)
+        fun_l7_n199(x)
+    else
+        fun_l7_n25(x)
+    end
+end
+
+def fun_l6_n476(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n258(x)
+    end
+end
+
+def fun_l6_n477(x)
+    if (x < 1)
+        fun_l7_n525(x)
+    else
+        fun_l7_n140(x)
+    end
+end
+
+def fun_l6_n478(x)
+    if (x < 1)
+        fun_l7_n728(x)
+    else
+        fun_l7_n157(x)
+    end
+end
+
+def fun_l6_n479(x)
+    if (x < 1)
+        fun_l7_n527(x)
+    else
+        fun_l7_n172(x)
+    end
+end
+
+def fun_l6_n480(x)
+    if (x < 1)
+        fun_l7_n295(x)
+    else
+        fun_l7_n230(x)
+    end
+end
+
+def fun_l6_n481(x)
+    if (x < 1)
+        fun_l7_n619(x)
+    else
+        fun_l7_n495(x)
+    end
+end
+
+def fun_l6_n482(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n30(x)
+    end
+end
+
+def fun_l6_n483(x)
+    if (x < 1)
+        fun_l7_n236(x)
+    else
+        fun_l7_n842(x)
+    end
+end
+
+def fun_l6_n484(x)
+    if (x < 1)
+        fun_l7_n59(x)
+    else
+        fun_l7_n341(x)
+    end
+end
+
+def fun_l6_n485(x)
+    if (x < 1)
+        fun_l7_n841(x)
+    else
+        fun_l7_n67(x)
+    end
+end
+
+def fun_l6_n486(x)
+    if (x < 1)
+        fun_l7_n299(x)
+    else
+        fun_l7_n144(x)
+    end
+end
+
+def fun_l6_n487(x)
+    if (x < 1)
+        fun_l7_n672(x)
+    else
+        fun_l7_n682(x)
+    end
+end
+
+def fun_l6_n488(x)
+    if (x < 1)
+        fun_l7_n110(x)
+    else
+        fun_l7_n231(x)
+    end
+end
+
+def fun_l6_n489(x)
+    if (x < 1)
+        fun_l7_n984(x)
+    else
+        fun_l7_n583(x)
+    end
+end
+
+def fun_l6_n490(x)
+    if (x < 1)
+        fun_l7_n354(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n491(x)
+    if (x < 1)
+        fun_l7_n541(x)
+    else
+        fun_l7_n583(x)
+    end
+end
+
+def fun_l6_n492(x)
+    if (x < 1)
+        fun_l7_n35(x)
+    else
+        fun_l7_n209(x)
+    end
+end
+
+def fun_l6_n493(x)
+    if (x < 1)
+        fun_l7_n547(x)
+    else
+        fun_l7_n982(x)
+    end
+end
+
+def fun_l6_n494(x)
+    if (x < 1)
+        fun_l7_n3(x)
+    else
+        fun_l7_n230(x)
+    end
+end
+
+def fun_l6_n495(x)
+    if (x < 1)
+        fun_l7_n777(x)
+    else
+        fun_l7_n140(x)
+    end
+end
+
+def fun_l6_n496(x)
+    if (x < 1)
+        fun_l7_n927(x)
+    else
+        fun_l7_n934(x)
+    end
+end
+
+def fun_l6_n497(x)
+    if (x < 1)
+        fun_l7_n201(x)
+    else
+        fun_l7_n342(x)
+    end
+end
+
+def fun_l6_n498(x)
+    if (x < 1)
+        fun_l7_n973(x)
+    else
+        fun_l7_n106(x)
+    end
+end
+
+def fun_l6_n499(x)
+    if (x < 1)
+        fun_l7_n373(x)
+    else
+        fun_l7_n558(x)
+    end
+end
+
+def fun_l6_n500(x)
+    if (x < 1)
+        fun_l7_n835(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n501(x)
+    if (x < 1)
+        fun_l7_n135(x)
+    else
+        fun_l7_n997(x)
+    end
+end
+
+def fun_l6_n502(x)
+    if (x < 1)
+        fun_l7_n129(x)
+    else
+        fun_l7_n530(x)
+    end
+end
+
+def fun_l6_n503(x)
+    if (x < 1)
+        fun_l7_n924(x)
+    else
+        fun_l7_n611(x)
+    end
+end
+
+def fun_l6_n504(x)
+    if (x < 1)
+        fun_l7_n125(x)
+    else
+        fun_l7_n26(x)
+    end
+end
+
+def fun_l6_n505(x)
+    if (x < 1)
+        fun_l7_n592(x)
+    else
+        fun_l7_n50(x)
+    end
+end
+
+def fun_l6_n506(x)
+    if (x < 1)
+        fun_l7_n220(x)
+    else
+        fun_l7_n787(x)
+    end
+end
+
+def fun_l6_n507(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n15(x)
+    end
+end
+
+def fun_l6_n508(x)
+    if (x < 1)
+        fun_l7_n475(x)
+    else
+        fun_l7_n899(x)
+    end
+end
+
+def fun_l6_n509(x)
+    if (x < 1)
+        fun_l7_n704(x)
+    else
+        fun_l7_n559(x)
+    end
+end
+
+def fun_l6_n510(x)
+    if (x < 1)
+        fun_l7_n625(x)
+    else
+        fun_l7_n73(x)
+    end
+end
+
+def fun_l6_n511(x)
+    if (x < 1)
+        fun_l7_n234(x)
+    else
+        fun_l7_n166(x)
+    end
+end
+
+def fun_l6_n512(x)
+    if (x < 1)
+        fun_l7_n502(x)
+    else
+        fun_l7_n304(x)
+    end
+end
+
+def fun_l6_n513(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n643(x)
+    end
+end
+
+def fun_l6_n514(x)
+    if (x < 1)
+        fun_l7_n804(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n515(x)
+    if (x < 1)
+        fun_l7_n365(x)
+    else
+        fun_l7_n102(x)
+    end
+end
+
+def fun_l6_n516(x)
+    if (x < 1)
+        fun_l7_n563(x)
+    else
+        fun_l7_n161(x)
+    end
+end
+
+def fun_l6_n517(x)
+    if (x < 1)
+        fun_l7_n695(x)
+    else
+        fun_l7_n936(x)
+    end
+end
+
+def fun_l6_n518(x)
+    if (x < 1)
+        fun_l7_n220(x)
+    else
+        fun_l7_n884(x)
+    end
+end
+
+def fun_l6_n519(x)
+    if (x < 1)
+        fun_l7_n602(x)
+    else
+        fun_l7_n144(x)
+    end
+end
+
+def fun_l6_n520(x)
+    if (x < 1)
+        fun_l7_n409(x)
+    else
+        fun_l7_n861(x)
+    end
+end
+
+def fun_l6_n521(x)
+    if (x < 1)
+        fun_l7_n258(x)
+    else
+        fun_l7_n768(x)
+    end
+end
+
+def fun_l6_n522(x)
+    if (x < 1)
+        fun_l7_n878(x)
+    else
+        fun_l7_n503(x)
+    end
+end
+
+def fun_l6_n523(x)
+    if (x < 1)
+        fun_l7_n570(x)
+    else
+        fun_l7_n675(x)
+    end
+end
+
+def fun_l6_n524(x)
+    if (x < 1)
+        fun_l7_n741(x)
+    else
+        fun_l7_n748(x)
+    end
+end
+
+def fun_l6_n525(x)
+    if (x < 1)
+        fun_l7_n729(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n526(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n70(x)
+    end
+end
+
+def fun_l6_n527(x)
+    if (x < 1)
+        fun_l7_n235(x)
+    else
+        fun_l7_n606(x)
+    end
+end
+
+def fun_l6_n528(x)
+    if (x < 1)
+        fun_l7_n67(x)
+    else
+        fun_l7_n399(x)
+    end
+end
+
+def fun_l6_n529(x)
+    if (x < 1)
+        fun_l7_n706(x)
+    else
+        fun_l7_n150(x)
+    end
+end
+
+def fun_l6_n530(x)
+    if (x < 1)
+        fun_l7_n35(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n531(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n329(x)
+    end
+end
+
+def fun_l6_n532(x)
+    if (x < 1)
+        fun_l7_n392(x)
+    else
+        fun_l7_n970(x)
+    end
+end
+
+def fun_l6_n533(x)
+    if (x < 1)
+        fun_l7_n466(x)
+    else
+        fun_l7_n260(x)
+    end
+end
+
+def fun_l6_n534(x)
+    if (x < 1)
+        fun_l7_n957(x)
+    else
+        fun_l7_n417(x)
+    end
+end
+
+def fun_l6_n535(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n188(x)
+    end
+end
+
+def fun_l6_n536(x)
+    if (x < 1)
+        fun_l7_n298(x)
+    else
+        fun_l7_n192(x)
+    end
+end
+
+def fun_l6_n537(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n309(x)
+    end
+end
+
+def fun_l6_n538(x)
+    if (x < 1)
+        fun_l7_n801(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n539(x)
+    if (x < 1)
+        fun_l7_n894(x)
+    else
+        fun_l7_n973(x)
+    end
+end
+
+def fun_l6_n540(x)
+    if (x < 1)
+        fun_l7_n895(x)
+    else
+        fun_l7_n231(x)
+    end
+end
+
+def fun_l6_n541(x)
+    if (x < 1)
+        fun_l7_n728(x)
+    else
+        fun_l7_n28(x)
+    end
+end
+
+def fun_l6_n542(x)
+    if (x < 1)
+        fun_l7_n655(x)
+    else
+        fun_l7_n845(x)
+    end
+end
+
+def fun_l6_n543(x)
+    if (x < 1)
+        fun_l7_n952(x)
+    else
+        fun_l7_n484(x)
+    end
+end
+
+def fun_l6_n544(x)
+    if (x < 1)
+        fun_l7_n835(x)
+    else
+        fun_l7_n187(x)
+    end
+end
+
+def fun_l6_n545(x)
+    if (x < 1)
+        fun_l7_n748(x)
+    else
+        fun_l7_n460(x)
+    end
+end
+
+def fun_l6_n546(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n165(x)
+    end
+end
+
+def fun_l6_n547(x)
+    if (x < 1)
+        fun_l7_n499(x)
+    else
+        fun_l7_n133(x)
+    end
+end
+
+def fun_l6_n548(x)
+    if (x < 1)
+        fun_l7_n751(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n549(x)
+    if (x < 1)
+        fun_l7_n269(x)
+    else
+        fun_l7_n690(x)
+    end
+end
+
+def fun_l6_n550(x)
+    if (x < 1)
+        fun_l7_n320(x)
+    else
+        fun_l7_n308(x)
+    end
+end
+
+def fun_l6_n551(x)
+    if (x < 1)
+        fun_l7_n182(x)
+    else
+        fun_l7_n144(x)
+    end
+end
+
+def fun_l6_n552(x)
+    if (x < 1)
+        fun_l7_n683(x)
+    else
+        fun_l7_n691(x)
+    end
+end
+
+def fun_l6_n553(x)
+    if (x < 1)
+        fun_l7_n502(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n554(x)
+    if (x < 1)
+        fun_l7_n60(x)
+    else
+        fun_l7_n551(x)
+    end
+end
+
+def fun_l6_n555(x)
+    if (x < 1)
+        fun_l7_n185(x)
+    else
+        fun_l7_n87(x)
+    end
+end
+
+def fun_l6_n556(x)
+    if (x < 1)
+        fun_l7_n140(x)
+    else
+        fun_l7_n725(x)
+    end
+end
+
+def fun_l6_n557(x)
+    if (x < 1)
+        fun_l7_n76(x)
+    else
+        fun_l7_n501(x)
+    end
+end
+
+def fun_l6_n558(x)
+    if (x < 1)
+        fun_l7_n553(x)
+    else
+        fun_l7_n146(x)
+    end
+end
+
+def fun_l6_n559(x)
+    if (x < 1)
+        fun_l7_n535(x)
+    else
+        fun_l7_n17(x)
+    end
+end
+
+def fun_l6_n560(x)
+    if (x < 1)
+        fun_l7_n566(x)
+    else
+        fun_l7_n773(x)
+    end
+end
+
+def fun_l6_n561(x)
+    if (x < 1)
+        fun_l7_n358(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n562(x)
+    if (x < 1)
+        fun_l7_n492(x)
+    else
+        fun_l7_n478(x)
+    end
+end
+
+def fun_l6_n563(x)
+    if (x < 1)
+        fun_l7_n796(x)
+    else
+        fun_l7_n906(x)
+    end
+end
+
+def fun_l6_n564(x)
+    if (x < 1)
+        fun_l7_n751(x)
+    else
+        fun_l7_n546(x)
+    end
+end
+
+def fun_l6_n565(x)
+    if (x < 1)
+        fun_l7_n179(x)
+    else
+        fun_l7_n49(x)
+    end
+end
+
+def fun_l6_n566(x)
+    if (x < 1)
+        fun_l7_n550(x)
+    else
+        fun_l7_n440(x)
+    end
+end
+
+def fun_l6_n567(x)
+    if (x < 1)
+        fun_l7_n715(x)
+    else
+        fun_l7_n862(x)
+    end
+end
+
+def fun_l6_n568(x)
+    if (x < 1)
+        fun_l7_n124(x)
+    else
+        fun_l7_n191(x)
+    end
+end
+
+def fun_l6_n569(x)
+    if (x < 1)
+        fun_l7_n709(x)
+    else
+        fun_l7_n704(x)
+    end
+end
+
+def fun_l6_n570(x)
+    if (x < 1)
+        fun_l7_n864(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n571(x)
+    if (x < 1)
+        fun_l7_n302(x)
+    else
+        fun_l7_n424(x)
+    end
+end
+
+def fun_l6_n572(x)
+    if (x < 1)
+        fun_l7_n488(x)
+    else
+        fun_l7_n570(x)
+    end
+end
+
+def fun_l6_n573(x)
+    if (x < 1)
+        fun_l7_n590(x)
+    else
+        fun_l7_n560(x)
+    end
+end
+
+def fun_l6_n574(x)
+    if (x < 1)
+        fun_l7_n38(x)
+    else
+        fun_l7_n444(x)
+    end
+end
+
+def fun_l6_n575(x)
+    if (x < 1)
+        fun_l7_n401(x)
+    else
+        fun_l7_n359(x)
+    end
+end
+
+def fun_l6_n576(x)
+    if (x < 1)
+        fun_l7_n518(x)
+    else
+        fun_l7_n240(x)
+    end
+end
+
+def fun_l6_n577(x)
+    if (x < 1)
+        fun_l7_n247(x)
+    else
+        fun_l7_n540(x)
+    end
+end
+
+def fun_l6_n578(x)
+    if (x < 1)
+        fun_l7_n223(x)
+    else
+        fun_l7_n729(x)
+    end
+end
+
+def fun_l6_n579(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n684(x)
+    end
+end
+
+def fun_l6_n580(x)
+    if (x < 1)
+        fun_l7_n113(x)
+    else
+        fun_l7_n865(x)
+    end
+end
+
+def fun_l6_n581(x)
+    if (x < 1)
+        fun_l7_n920(x)
+    else
+        fun_l7_n238(x)
+    end
+end
+
+def fun_l6_n582(x)
+    if (x < 1)
+        fun_l7_n78(x)
+    else
+        fun_l7_n85(x)
+    end
+end
+
+def fun_l6_n583(x)
+    if (x < 1)
+        fun_l7_n713(x)
+    else
+        fun_l7_n110(x)
+    end
+end
+
+def fun_l6_n584(x)
+    if (x < 1)
+        fun_l7_n170(x)
+    else
+        fun_l7_n183(x)
+    end
+end
+
+def fun_l6_n585(x)
+    if (x < 1)
+        fun_l7_n100(x)
+    else
+        fun_l7_n215(x)
+    end
+end
+
+def fun_l6_n586(x)
+    if (x < 1)
+        fun_l7_n126(x)
+    else
+        fun_l7_n136(x)
+    end
+end
+
+def fun_l6_n587(x)
+    if (x < 1)
+        fun_l7_n592(x)
+    else
+        fun_l7_n502(x)
+    end
+end
+
+def fun_l6_n588(x)
+    if (x < 1)
+        fun_l7_n155(x)
+    else
+        fun_l7_n591(x)
+    end
+end
+
+def fun_l6_n589(x)
+    if (x < 1)
+        fun_l7_n840(x)
+    else
+        fun_l7_n91(x)
+    end
+end
+
+def fun_l6_n590(x)
+    if (x < 1)
+        fun_l7_n146(x)
+    else
+        fun_l7_n849(x)
+    end
+end
+
+def fun_l6_n591(x)
+    if (x < 1)
+        fun_l7_n161(x)
+    else
+        fun_l7_n884(x)
+    end
+end
+
+def fun_l6_n592(x)
+    if (x < 1)
+        fun_l7_n994(x)
+    else
+        fun_l7_n341(x)
+    end
+end
+
+def fun_l6_n593(x)
+    if (x < 1)
+        fun_l7_n974(x)
+    else
+        fun_l7_n355(x)
+    end
+end
+
+def fun_l6_n594(x)
+    if (x < 1)
+        fun_l7_n726(x)
+    else
+        fun_l7_n266(x)
+    end
+end
+
+def fun_l6_n595(x)
+    if (x < 1)
+        fun_l7_n142(x)
+    else
+        fun_l7_n154(x)
+    end
+end
+
+def fun_l6_n596(x)
+    if (x < 1)
+        fun_l7_n287(x)
+    else
+        fun_l7_n155(x)
+    end
+end
+
+def fun_l6_n597(x)
+    if (x < 1)
+        fun_l7_n594(x)
+    else
+        fun_l7_n424(x)
+    end
+end
+
+def fun_l6_n598(x)
+    if (x < 1)
+        fun_l7_n227(x)
+    else
+        fun_l7_n445(x)
+    end
+end
+
+def fun_l6_n599(x)
+    if (x < 1)
+        fun_l7_n660(x)
+    else
+        fun_l7_n464(x)
+    end
+end
+
+def fun_l6_n600(x)
+    if (x < 1)
+        fun_l7_n930(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n601(x)
+    if (x < 1)
+        fun_l7_n714(x)
+    else
+        fun_l7_n984(x)
+    end
+end
+
+def fun_l6_n602(x)
+    if (x < 1)
+        fun_l7_n226(x)
+    else
+        fun_l7_n316(x)
+    end
+end
+
+def fun_l6_n603(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n563(x)
+    end
+end
+
+def fun_l6_n604(x)
+    if (x < 1)
+        fun_l7_n149(x)
+    else
+        fun_l7_n921(x)
+    end
+end
+
+def fun_l6_n605(x)
+    if (x < 1)
+        fun_l7_n195(x)
+    else
+        fun_l7_n696(x)
+    end
+end
+
+def fun_l6_n606(x)
+    if (x < 1)
+        fun_l7_n337(x)
+    else
+        fun_l7_n347(x)
+    end
+end
+
+def fun_l6_n607(x)
+    if (x < 1)
+        fun_l7_n657(x)
+    else
+        fun_l7_n67(x)
+    end
+end
+
+def fun_l6_n608(x)
+    if (x < 1)
+        fun_l7_n796(x)
+    else
+        fun_l7_n589(x)
+    end
+end
+
+def fun_l6_n609(x)
+    if (x < 1)
+        fun_l7_n230(x)
+    else
+        fun_l7_n769(x)
+    end
+end
+
+def fun_l6_n610(x)
+    if (x < 1)
+        fun_l7_n427(x)
+    else
+        fun_l7_n892(x)
+    end
+end
+
+def fun_l6_n611(x)
+    if (x < 1)
+        fun_l7_n741(x)
+    else
+        fun_l7_n567(x)
+    end
+end
+
+def fun_l6_n612(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n824(x)
+    end
+end
+
+def fun_l6_n613(x)
+    if (x < 1)
+        fun_l7_n522(x)
+    else
+        fun_l7_n694(x)
+    end
+end
+
+def fun_l6_n614(x)
+    if (x < 1)
+        fun_l7_n95(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n615(x)
+    if (x < 1)
+        fun_l7_n632(x)
+    else
+        fun_l7_n590(x)
+    end
+end
+
+def fun_l6_n616(x)
+    if (x < 1)
+        fun_l7_n372(x)
+    else
+        fun_l7_n659(x)
+    end
+end
+
+def fun_l6_n617(x)
+    if (x < 1)
+        fun_l7_n547(x)
+    else
+        fun_l7_n321(x)
+    end
+end
+
+def fun_l6_n618(x)
+    if (x < 1)
+        fun_l7_n53(x)
+    else
+        fun_l7_n723(x)
+    end
+end
+
+def fun_l6_n619(x)
+    if (x < 1)
+        fun_l7_n653(x)
+    else
+        fun_l7_n740(x)
+    end
+end
+
+def fun_l6_n620(x)
+    if (x < 1)
+        fun_l7_n16(x)
+    else
+        fun_l7_n228(x)
+    end
+end
+
+def fun_l6_n621(x)
+    if (x < 1)
+        fun_l7_n655(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n622(x)
+    if (x < 1)
+        fun_l7_n212(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n623(x)
+    if (x < 1)
+        fun_l7_n959(x)
+    else
+        fun_l7_n327(x)
+    end
+end
+
+def fun_l6_n624(x)
+    if (x < 1)
+        fun_l7_n607(x)
+    else
+        fun_l7_n168(x)
+    end
+end
+
+def fun_l6_n625(x)
+    if (x < 1)
+        fun_l7_n229(x)
+    else
+        fun_l7_n584(x)
+    end
+end
+
+def fun_l6_n626(x)
+    if (x < 1)
+        fun_l7_n776(x)
+    else
+        fun_l7_n284(x)
+    end
+end
+
+def fun_l6_n627(x)
+    if (x < 1)
+        fun_l7_n770(x)
+    else
+        fun_l7_n169(x)
+    end
+end
+
+def fun_l6_n628(x)
+    if (x < 1)
+        fun_l7_n550(x)
+    else
+        fun_l7_n918(x)
+    end
+end
+
+def fun_l6_n629(x)
+    if (x < 1)
+        fun_l7_n450(x)
+    else
+        fun_l7_n654(x)
+    end
+end
+
+def fun_l6_n630(x)
+    if (x < 1)
+        fun_l7_n968(x)
+    else
+        fun_l7_n770(x)
+    end
+end
+
+def fun_l6_n631(x)
+    if (x < 1)
+        fun_l7_n118(x)
+    else
+        fun_l7_n411(x)
+    end
+end
+
+def fun_l6_n632(x)
+    if (x < 1)
+        fun_l7_n352(x)
+    else
+        fun_l7_n840(x)
+    end
+end
+
+def fun_l6_n633(x)
+    if (x < 1)
+        fun_l7_n588(x)
+    else
+        fun_l7_n810(x)
+    end
+end
+
+def fun_l6_n634(x)
+    if (x < 1)
+        fun_l7_n955(x)
+    else
+        fun_l7_n709(x)
+    end
+end
+
+def fun_l6_n635(x)
+    if (x < 1)
+        fun_l7_n137(x)
+    else
+        fun_l7_n239(x)
+    end
+end
+
+def fun_l6_n636(x)
+    if (x < 1)
+        fun_l7_n955(x)
+    else
+        fun_l7_n87(x)
+    end
+end
+
+def fun_l6_n637(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n91(x)
+    end
+end
+
+def fun_l6_n638(x)
+    if (x < 1)
+        fun_l7_n366(x)
+    else
+        fun_l7_n388(x)
+    end
+end
+
+def fun_l6_n639(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n971(x)
+    end
+end
+
+def fun_l6_n640(x)
+    if (x < 1)
+        fun_l7_n330(x)
+    else
+        fun_l7_n415(x)
+    end
+end
+
+def fun_l6_n641(x)
+    if (x < 1)
+        fun_l7_n233(x)
+    else
+        fun_l7_n653(x)
+    end
+end
+
+def fun_l6_n642(x)
+    if (x < 1)
+        fun_l7_n106(x)
+    else
+        fun_l7_n440(x)
+    end
+end
+
+def fun_l6_n643(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n818(x)
+    end
+end
+
+def fun_l6_n644(x)
+    if (x < 1)
+        fun_l7_n68(x)
+    else
+        fun_l7_n763(x)
+    end
+end
+
+def fun_l6_n645(x)
+    if (x < 1)
+        fun_l7_n858(x)
+    else
+        fun_l7_n465(x)
+    end
+end
+
+def fun_l6_n646(x)
+    if (x < 1)
+        fun_l7_n886(x)
+    else
+        fun_l7_n86(x)
+    end
+end
+
+def fun_l6_n647(x)
+    if (x < 1)
+        fun_l7_n689(x)
+    else
+        fun_l7_n964(x)
+    end
+end
+
+def fun_l6_n648(x)
+    if (x < 1)
+        fun_l7_n748(x)
+    else
+        fun_l7_n214(x)
+    end
+end
+
+def fun_l6_n649(x)
+    if (x < 1)
+        fun_l7_n830(x)
+    else
+        fun_l7_n567(x)
+    end
+end
+
+def fun_l6_n650(x)
+    if (x < 1)
+        fun_l7_n907(x)
+    else
+        fun_l7_n957(x)
+    end
+end
+
+def fun_l6_n651(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n239(x)
+    end
+end
+
+def fun_l6_n652(x)
+    if (x < 1)
+        fun_l7_n347(x)
+    else
+        fun_l7_n63(x)
+    end
+end
+
+def fun_l6_n653(x)
+    if (x < 1)
+        fun_l7_n480(x)
+    else
+        fun_l7_n441(x)
+    end
+end
+
+def fun_l6_n654(x)
+    if (x < 1)
+        fun_l7_n304(x)
+    else
+        fun_l7_n690(x)
+    end
+end
+
+def fun_l6_n655(x)
+    if (x < 1)
+        fun_l7_n511(x)
+    else
+        fun_l7_n710(x)
+    end
+end
+
+def fun_l6_n656(x)
+    if (x < 1)
+        fun_l7_n202(x)
+    else
+        fun_l7_n48(x)
+    end
+end
+
+def fun_l6_n657(x)
+    if (x < 1)
+        fun_l7_n232(x)
+    else
+        fun_l7_n919(x)
+    end
+end
+
+def fun_l6_n658(x)
+    if (x < 1)
+        fun_l7_n627(x)
+    else
+        fun_l7_n620(x)
+    end
+end
+
+def fun_l6_n659(x)
+    if (x < 1)
+        fun_l7_n716(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n660(x)
+    if (x < 1)
+        fun_l7_n105(x)
+    else
+        fun_l7_n536(x)
+    end
+end
+
+def fun_l6_n661(x)
+    if (x < 1)
+        fun_l7_n376(x)
+    else
+        fun_l7_n965(x)
+    end
+end
+
+def fun_l6_n662(x)
+    if (x < 1)
+        fun_l7_n417(x)
+    else
+        fun_l7_n726(x)
+    end
+end
+
+def fun_l6_n663(x)
+    if (x < 1)
+        fun_l7_n567(x)
+    else
+        fun_l7_n948(x)
+    end
+end
+
+def fun_l6_n664(x)
+    if (x < 1)
+        fun_l7_n640(x)
+    else
+        fun_l7_n910(x)
+    end
+end
+
+def fun_l6_n665(x)
+    if (x < 1)
+        fun_l7_n874(x)
+    else
+        fun_l7_n314(x)
+    end
+end
+
+def fun_l6_n666(x)
+    if (x < 1)
+        fun_l7_n946(x)
+    else
+        fun_l7_n101(x)
+    end
+end
+
+def fun_l6_n667(x)
+    if (x < 1)
+        fun_l7_n960(x)
+    else
+        fun_l7_n199(x)
+    end
+end
+
+def fun_l6_n668(x)
+    if (x < 1)
+        fun_l7_n389(x)
+    else
+        fun_l7_n976(x)
+    end
+end
+
+def fun_l6_n669(x)
+    if (x < 1)
+        fun_l7_n31(x)
+    else
+        fun_l7_n903(x)
+    end
+end
+
+def fun_l6_n670(x)
+    if (x < 1)
+        fun_l7_n288(x)
+    else
+        fun_l7_n115(x)
+    end
+end
+
+def fun_l6_n671(x)
+    if (x < 1)
+        fun_l7_n418(x)
+    else
+        fun_l7_n249(x)
+    end
+end
+
+def fun_l6_n672(x)
+    if (x < 1)
+        fun_l7_n733(x)
+    else
+        fun_l7_n815(x)
+    end
+end
+
+def fun_l6_n673(x)
+    if (x < 1)
+        fun_l7_n227(x)
+    else
+        fun_l7_n23(x)
+    end
+end
+
+def fun_l6_n674(x)
+    if (x < 1)
+        fun_l7_n936(x)
+    else
+        fun_l7_n386(x)
+    end
+end
+
+def fun_l6_n675(x)
+    if (x < 1)
+        fun_l7_n638(x)
+    else
+        fun_l7_n39(x)
+    end
+end
+
+def fun_l6_n676(x)
+    if (x < 1)
+        fun_l7_n304(x)
+    else
+        fun_l7_n35(x)
+    end
+end
+
+def fun_l6_n677(x)
+    if (x < 1)
+        fun_l7_n676(x)
+    else
+        fun_l7_n443(x)
+    end
+end
+
+def fun_l6_n678(x)
+    if (x < 1)
+        fun_l7_n648(x)
+    else
+        fun_l7_n453(x)
+    end
+end
+
+def fun_l6_n679(x)
+    if (x < 1)
+        fun_l7_n15(x)
+    else
+        fun_l7_n220(x)
+    end
+end
+
+def fun_l6_n680(x)
+    if (x < 1)
+        fun_l7_n201(x)
+    else
+        fun_l7_n842(x)
+    end
+end
+
+def fun_l6_n681(x)
+    if (x < 1)
+        fun_l7_n67(x)
+    else
+        fun_l7_n73(x)
+    end
+end
+
+def fun_l6_n682(x)
+    if (x < 1)
+        fun_l7_n280(x)
+    else
+        fun_l7_n370(x)
+    end
+end
+
+def fun_l6_n683(x)
+    if (x < 1)
+        fun_l7_n822(x)
+    else
+        fun_l7_n27(x)
+    end
+end
+
+def fun_l6_n684(x)
+    if (x < 1)
+        fun_l7_n720(x)
+    else
+        fun_l7_n651(x)
+    end
+end
+
+def fun_l6_n685(x)
+    if (x < 1)
+        fun_l7_n414(x)
+    else
+        fun_l7_n257(x)
+    end
+end
+
+def fun_l6_n686(x)
+    if (x < 1)
+        fun_l7_n477(x)
+    else
+        fun_l7_n883(x)
+    end
+end
+
+def fun_l6_n687(x)
+    if (x < 1)
+        fun_l7_n467(x)
+    else
+        fun_l7_n739(x)
+    end
+end
+
+def fun_l6_n688(x)
+    if (x < 1)
+        fun_l7_n421(x)
+    else
+        fun_l7_n271(x)
+    end
+end
+
+def fun_l6_n689(x)
+    if (x < 1)
+        fun_l7_n444(x)
+    else
+        fun_l7_n601(x)
+    end
+end
+
+def fun_l6_n690(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n597(x)
+    end
+end
+
+def fun_l6_n691(x)
+    if (x < 1)
+        fun_l7_n273(x)
+    else
+        fun_l7_n79(x)
+    end
+end
+
+def fun_l6_n692(x)
+    if (x < 1)
+        fun_l7_n310(x)
+    else
+        fun_l7_n261(x)
+    end
+end
+
+def fun_l6_n693(x)
+    if (x < 1)
+        fun_l7_n190(x)
+    else
+        fun_l7_n330(x)
+    end
+end
+
+def fun_l6_n694(x)
+    if (x < 1)
+        fun_l7_n103(x)
+    else
+        fun_l7_n258(x)
+    end
+end
+
+def fun_l6_n695(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n988(x)
+    end
+end
+
+def fun_l6_n696(x)
+    if (x < 1)
+        fun_l7_n885(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n697(x)
+    if (x < 1)
+        fun_l7_n212(x)
+    else
+        fun_l7_n98(x)
+    end
+end
+
+def fun_l6_n698(x)
+    if (x < 1)
+        fun_l7_n735(x)
+    else
+        fun_l7_n682(x)
+    end
+end
+
+def fun_l6_n699(x)
+    if (x < 1)
+        fun_l7_n610(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n700(x)
+    if (x < 1)
+        fun_l7_n828(x)
+    else
+        fun_l7_n651(x)
+    end
+end
+
+def fun_l6_n701(x)
+    if (x < 1)
+        fun_l7_n269(x)
+    else
+        fun_l7_n192(x)
+    end
+end
+
+def fun_l6_n702(x)
+    if (x < 1)
+        fun_l7_n775(x)
+    else
+        fun_l7_n334(x)
+    end
+end
+
+def fun_l6_n703(x)
+    if (x < 1)
+        fun_l7_n880(x)
+    else
+        fun_l7_n396(x)
+    end
+end
+
+def fun_l6_n704(x)
+    if (x < 1)
+        fun_l7_n907(x)
+    else
+        fun_l7_n107(x)
+    end
+end
+
+def fun_l6_n705(x)
+    if (x < 1)
+        fun_l7_n425(x)
+    else
+        fun_l7_n555(x)
+    end
+end
+
+def fun_l6_n706(x)
+    if (x < 1)
+        fun_l7_n458(x)
+    else
+        fun_l7_n610(x)
+    end
+end
+
+def fun_l6_n707(x)
+    if (x < 1)
+        fun_l7_n527(x)
+    else
+        fun_l7_n69(x)
+    end
+end
+
+def fun_l6_n708(x)
+    if (x < 1)
+        fun_l7_n518(x)
+    else
+        fun_l7_n87(x)
+    end
+end
+
+def fun_l6_n709(x)
+    if (x < 1)
+        fun_l7_n441(x)
+    else
+        fun_l7_n533(x)
+    end
+end
+
+def fun_l6_n710(x)
+    if (x < 1)
+        fun_l7_n872(x)
+    else
+        fun_l7_n896(x)
+    end
+end
+
+def fun_l6_n711(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n476(x)
+    end
+end
+
+def fun_l6_n712(x)
+    if (x < 1)
+        fun_l7_n913(x)
+    else
+        fun_l7_n304(x)
+    end
+end
+
+def fun_l6_n713(x)
+    if (x < 1)
+        fun_l7_n203(x)
+    else
+        fun_l7_n457(x)
+    end
+end
+
+def fun_l6_n714(x)
+    if (x < 1)
+        fun_l7_n593(x)
+    else
+        fun_l7_n921(x)
+    end
+end
+
+def fun_l6_n715(x)
+    if (x < 1)
+        fun_l7_n452(x)
+    else
+        fun_l7_n68(x)
+    end
+end
+
+def fun_l6_n716(x)
+    if (x < 1)
+        fun_l7_n203(x)
+    else
+        fun_l7_n362(x)
+    end
+end
+
+def fun_l6_n717(x)
+    if (x < 1)
+        fun_l7_n455(x)
+    else
+        fun_l7_n199(x)
+    end
+end
+
+def fun_l6_n718(x)
+    if (x < 1)
+        fun_l7_n500(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n719(x)
+    if (x < 1)
+        fun_l7_n970(x)
+    else
+        fun_l7_n572(x)
+    end
+end
+
+def fun_l6_n720(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n246(x)
+    end
+end
+
+def fun_l6_n721(x)
+    if (x < 1)
+        fun_l7_n943(x)
+    else
+        fun_l7_n640(x)
+    end
+end
+
+def fun_l6_n722(x)
+    if (x < 1)
+        fun_l7_n106(x)
+    else
+        fun_l7_n387(x)
+    end
+end
+
+def fun_l6_n723(x)
+    if (x < 1)
+        fun_l7_n474(x)
+    else
+        fun_l7_n530(x)
+    end
+end
+
+def fun_l6_n724(x)
+    if (x < 1)
+        fun_l7_n246(x)
+    else
+        fun_l7_n387(x)
+    end
+end
+
+def fun_l6_n725(x)
+    if (x < 1)
+        fun_l7_n572(x)
+    else
+        fun_l7_n874(x)
+    end
+end
+
+def fun_l6_n726(x)
+    if (x < 1)
+        fun_l7_n858(x)
+    else
+        fun_l7_n71(x)
+    end
+end
+
+def fun_l6_n727(x)
+    if (x < 1)
+        fun_l7_n615(x)
+    else
+        fun_l7_n14(x)
+    end
+end
+
+def fun_l6_n728(x)
+    if (x < 1)
+        fun_l7_n840(x)
+    else
+        fun_l7_n779(x)
+    end
+end
+
+def fun_l6_n729(x)
+    if (x < 1)
+        fun_l7_n811(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n730(x)
+    if (x < 1)
+        fun_l7_n196(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n731(x)
+    if (x < 1)
+        fun_l7_n202(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n732(x)
+    if (x < 1)
+        fun_l7_n867(x)
+    else
+        fun_l7_n770(x)
+    end
+end
+
+def fun_l6_n733(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n937(x)
+    end
+end
+
+def fun_l6_n734(x)
+    if (x < 1)
+        fun_l7_n890(x)
+    else
+        fun_l7_n937(x)
+    end
+end
+
+def fun_l6_n735(x)
+    if (x < 1)
+        fun_l7_n967(x)
+    else
+        fun_l7_n235(x)
+    end
+end
+
+def fun_l6_n736(x)
+    if (x < 1)
+        fun_l7_n612(x)
+    else
+        fun_l7_n140(x)
+    end
+end
+
+def fun_l6_n737(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n600(x)
+    end
+end
+
+def fun_l6_n738(x)
+    if (x < 1)
+        fun_l7_n462(x)
+    else
+        fun_l7_n907(x)
+    end
+end
+
+def fun_l6_n739(x)
+    if (x < 1)
+        fun_l7_n226(x)
+    else
+        fun_l7_n83(x)
+    end
+end
+
+def fun_l6_n740(x)
+    if (x < 1)
+        fun_l7_n419(x)
+    else
+        fun_l7_n95(x)
+    end
+end
+
+def fun_l6_n741(x)
+    if (x < 1)
+        fun_l7_n358(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n742(x)
+    if (x < 1)
+        fun_l7_n451(x)
+    else
+        fun_l7_n700(x)
+    end
+end
+
+def fun_l6_n743(x)
+    if (x < 1)
+        fun_l7_n561(x)
+    else
+        fun_l7_n383(x)
+    end
+end
+
+def fun_l6_n744(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n56(x)
+    end
+end
+
+def fun_l6_n745(x)
+    if (x < 1)
+        fun_l7_n127(x)
+    else
+        fun_l7_n113(x)
+    end
+end
+
+def fun_l6_n746(x)
+    if (x < 1)
+        fun_l7_n767(x)
+    else
+        fun_l7_n907(x)
+    end
+end
+
+def fun_l6_n747(x)
+    if (x < 1)
+        fun_l7_n174(x)
+    else
+        fun_l7_n955(x)
+    end
+end
+
+def fun_l6_n748(x)
+    if (x < 1)
+        fun_l7_n51(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n749(x)
+    if (x < 1)
+        fun_l7_n172(x)
+    else
+        fun_l7_n847(x)
+    end
+end
+
+def fun_l6_n750(x)
+    if (x < 1)
+        fun_l7_n240(x)
+    else
+        fun_l7_n869(x)
+    end
+end
+
+def fun_l6_n751(x)
+    if (x < 1)
+        fun_l7_n435(x)
+    else
+        fun_l7_n747(x)
+    end
+end
+
+def fun_l6_n752(x)
+    if (x < 1)
+        fun_l7_n673(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n753(x)
+    if (x < 1)
+        fun_l7_n98(x)
+    else
+        fun_l7_n66(x)
+    end
+end
+
+def fun_l6_n754(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n943(x)
+    end
+end
+
+def fun_l6_n755(x)
+    if (x < 1)
+        fun_l7_n863(x)
+    else
+        fun_l7_n155(x)
+    end
+end
+
+def fun_l6_n756(x)
+    if (x < 1)
+        fun_l7_n197(x)
+    else
+        fun_l7_n807(x)
+    end
+end
+
+def fun_l6_n757(x)
+    if (x < 1)
+        fun_l7_n992(x)
+    else
+        fun_l7_n615(x)
+    end
+end
+
+def fun_l6_n758(x)
+    if (x < 1)
+        fun_l7_n172(x)
+    else
+        fun_l7_n507(x)
+    end
+end
+
+def fun_l6_n759(x)
+    if (x < 1)
+        fun_l7_n756(x)
+    else
+        fun_l7_n599(x)
+    end
+end
+
+def fun_l6_n760(x)
+    if (x < 1)
+        fun_l7_n876(x)
+    else
+        fun_l7_n185(x)
+    end
+end
+
+def fun_l6_n761(x)
+    if (x < 1)
+        fun_l7_n522(x)
+    else
+        fun_l7_n301(x)
+    end
+end
+
+def fun_l6_n762(x)
+    if (x < 1)
+        fun_l7_n994(x)
+    else
+        fun_l7_n408(x)
+    end
+end
+
+def fun_l6_n763(x)
+    if (x < 1)
+        fun_l7_n201(x)
+    else
+        fun_l7_n304(x)
+    end
+end
+
+def fun_l6_n764(x)
+    if (x < 1)
+        fun_l7_n200(x)
+    else
+        fun_l7_n123(x)
+    end
+end
+
+def fun_l6_n765(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n117(x)
+    end
+end
+
+def fun_l6_n766(x)
+    if (x < 1)
+        fun_l7_n918(x)
+    else
+        fun_l7_n416(x)
+    end
+end
+
+def fun_l6_n767(x)
+    if (x < 1)
+        fun_l7_n538(x)
+    else
+        fun_l7_n335(x)
+    end
+end
+
+def fun_l6_n768(x)
+    if (x < 1)
+        fun_l7_n699(x)
+    else
+        fun_l7_n980(x)
+    end
+end
+
+def fun_l6_n769(x)
+    if (x < 1)
+        fun_l7_n903(x)
+    else
+        fun_l7_n195(x)
+    end
+end
+
+def fun_l6_n770(x)
+    if (x < 1)
+        fun_l7_n419(x)
+    else
+        fun_l7_n523(x)
+    end
+end
+
+def fun_l6_n771(x)
+    if (x < 1)
+        fun_l7_n221(x)
+    else
+        fun_l7_n39(x)
+    end
+end
+
+def fun_l6_n772(x)
+    if (x < 1)
+        fun_l7_n369(x)
+    else
+        fun_l7_n227(x)
+    end
+end
+
+def fun_l6_n773(x)
+    if (x < 1)
+        fun_l7_n861(x)
+    else
+        fun_l7_n252(x)
+    end
+end
+
+def fun_l6_n774(x)
+    if (x < 1)
+        fun_l7_n682(x)
+    else
+        fun_l7_n42(x)
+    end
+end
+
+def fun_l6_n775(x)
+    if (x < 1)
+        fun_l7_n777(x)
+    else
+        fun_l7_n594(x)
+    end
+end
+
+def fun_l6_n776(x)
+    if (x < 1)
+        fun_l7_n794(x)
+    else
+        fun_l7_n71(x)
+    end
+end
+
+def fun_l6_n777(x)
+    if (x < 1)
+        fun_l7_n669(x)
+    else
+        fun_l7_n66(x)
+    end
+end
+
+def fun_l6_n778(x)
+    if (x < 1)
+        fun_l7_n824(x)
+    else
+        fun_l7_n95(x)
+    end
+end
+
+def fun_l6_n779(x)
+    if (x < 1)
+        fun_l7_n833(x)
+    else
+        fun_l7_n504(x)
+    end
+end
+
+def fun_l6_n780(x)
+    if (x < 1)
+        fun_l7_n50(x)
+    else
+        fun_l7_n647(x)
+    end
+end
+
+def fun_l6_n781(x)
+    if (x < 1)
+        fun_l7_n139(x)
+    else
+        fun_l7_n214(x)
+    end
+end
+
+def fun_l6_n782(x)
+    if (x < 1)
+        fun_l7_n450(x)
+    else
+        fun_l7_n660(x)
+    end
+end
+
+def fun_l6_n783(x)
+    if (x < 1)
+        fun_l7_n164(x)
+    else
+        fun_l7_n576(x)
+    end
+end
+
+def fun_l6_n784(x)
+    if (x < 1)
+        fun_l7_n722(x)
+    else
+        fun_l7_n714(x)
+    end
+end
+
+def fun_l6_n785(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n556(x)
+    end
+end
+
+def fun_l6_n786(x)
+    if (x < 1)
+        fun_l7_n413(x)
+    else
+        fun_l7_n722(x)
+    end
+end
+
+def fun_l6_n787(x)
+    if (x < 1)
+        fun_l7_n141(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n788(x)
+    if (x < 1)
+        fun_l7_n750(x)
+    else
+        fun_l7_n660(x)
+    end
+end
+
+def fun_l6_n789(x)
+    if (x < 1)
+        fun_l7_n581(x)
+    else
+        fun_l7_n368(x)
+    end
+end
+
+def fun_l6_n790(x)
+    if (x < 1)
+        fun_l7_n922(x)
+    else
+        fun_l7_n551(x)
+    end
+end
+
+def fun_l6_n791(x)
+    if (x < 1)
+        fun_l7_n842(x)
+    else
+        fun_l7_n336(x)
+    end
+end
+
+def fun_l6_n792(x)
+    if (x < 1)
+        fun_l7_n264(x)
+    else
+        fun_l7_n7(x)
+    end
+end
+
+def fun_l6_n793(x)
+    if (x < 1)
+        fun_l7_n902(x)
+    else
+        fun_l7_n184(x)
+    end
+end
+
+def fun_l6_n794(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n854(x)
+    end
+end
+
+def fun_l6_n795(x)
+    if (x < 1)
+        fun_l7_n375(x)
+    else
+        fun_l7_n601(x)
+    end
+end
+
+def fun_l6_n796(x)
+    if (x < 1)
+        fun_l7_n674(x)
+    else
+        fun_l7_n136(x)
+    end
+end
+
+def fun_l6_n797(x)
+    if (x < 1)
+        fun_l7_n836(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n798(x)
+    if (x < 1)
+        fun_l7_n461(x)
+    else
+        fun_l7_n686(x)
+    end
+end
+
+def fun_l6_n799(x)
+    if (x < 1)
+        fun_l7_n308(x)
+    else
+        fun_l7_n179(x)
+    end
+end
+
+def fun_l6_n800(x)
+    if (x < 1)
+        fun_l7_n154(x)
+    else
+        fun_l7_n618(x)
+    end
+end
+
+def fun_l6_n801(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n16(x)
+    end
+end
+
+def fun_l6_n802(x)
+    if (x < 1)
+        fun_l7_n880(x)
+    else
+        fun_l7_n143(x)
+    end
+end
+
+def fun_l6_n803(x)
+    if (x < 1)
+        fun_l7_n577(x)
+    else
+        fun_l7_n414(x)
+    end
+end
+
+def fun_l6_n804(x)
+    if (x < 1)
+        fun_l7_n409(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n805(x)
+    if (x < 1)
+        fun_l7_n259(x)
+    else
+        fun_l7_n820(x)
+    end
+end
+
+def fun_l6_n806(x)
+    if (x < 1)
+        fun_l7_n384(x)
+    else
+        fun_l7_n939(x)
+    end
+end
+
+def fun_l6_n807(x)
+    if (x < 1)
+        fun_l7_n138(x)
+    else
+        fun_l7_n652(x)
+    end
+end
+
+def fun_l6_n808(x)
+    if (x < 1)
+        fun_l7_n455(x)
+    else
+        fun_l7_n693(x)
+    end
+end
+
+def fun_l6_n809(x)
+    if (x < 1)
+        fun_l7_n892(x)
+    else
+        fun_l7_n638(x)
+    end
+end
+
+def fun_l6_n810(x)
+    if (x < 1)
+        fun_l7_n498(x)
+    else
+        fun_l7_n716(x)
+    end
+end
+
+def fun_l6_n811(x)
+    if (x < 1)
+        fun_l7_n713(x)
+    else
+        fun_l7_n9(x)
+    end
+end
+
+def fun_l6_n812(x)
+    if (x < 1)
+        fun_l7_n854(x)
+    else
+        fun_l7_n507(x)
+    end
+end
+
+def fun_l6_n813(x)
+    if (x < 1)
+        fun_l7_n385(x)
+    else
+        fun_l7_n323(x)
+    end
+end
+
+def fun_l6_n814(x)
+    if (x < 1)
+        fun_l7_n437(x)
+    else
+        fun_l7_n954(x)
+    end
+end
+
+def fun_l6_n815(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n245(x)
+    end
+end
+
+def fun_l6_n816(x)
+    if (x < 1)
+        fun_l7_n485(x)
+    else
+        fun_l7_n935(x)
+    end
+end
+
+def fun_l6_n817(x)
+    if (x < 1)
+        fun_l7_n319(x)
+    else
+        fun_l7_n566(x)
+    end
+end
+
+def fun_l6_n818(x)
+    if (x < 1)
+        fun_l7_n339(x)
+    else
+        fun_l7_n152(x)
+    end
+end
+
+def fun_l6_n819(x)
+    if (x < 1)
+        fun_l7_n21(x)
+    else
+        fun_l7_n452(x)
+    end
+end
+
+def fun_l6_n820(x)
+    if (x < 1)
+        fun_l7_n16(x)
+    else
+        fun_l7_n502(x)
+    end
+end
+
+def fun_l6_n821(x)
+    if (x < 1)
+        fun_l7_n813(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n822(x)
+    if (x < 1)
+        fun_l7_n519(x)
+    else
+        fun_l7_n651(x)
+    end
+end
+
+def fun_l6_n823(x)
+    if (x < 1)
+        fun_l7_n890(x)
+    else
+        fun_l7_n227(x)
+    end
+end
+
+def fun_l6_n824(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n799(x)
+    end
+end
+
+def fun_l6_n825(x)
+    if (x < 1)
+        fun_l7_n404(x)
+    else
+        fun_l7_n442(x)
+    end
+end
+
+def fun_l6_n826(x)
+    if (x < 1)
+        fun_l7_n308(x)
+    else
+        fun_l7_n328(x)
+    end
+end
+
+def fun_l6_n827(x)
+    if (x < 1)
+        fun_l7_n953(x)
+    else
+        fun_l7_n950(x)
+    end
+end
+
+def fun_l6_n828(x)
+    if (x < 1)
+        fun_l7_n206(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n829(x)
+    if (x < 1)
+        fun_l7_n499(x)
+    else
+        fun_l7_n972(x)
+    end
+end
+
+def fun_l6_n830(x)
+    if (x < 1)
+        fun_l7_n578(x)
+    else
+        fun_l7_n697(x)
+    end
+end
+
+def fun_l6_n831(x)
+    if (x < 1)
+        fun_l7_n116(x)
+    else
+        fun_l7_n747(x)
+    end
+end
+
+def fun_l6_n832(x)
+    if (x < 1)
+        fun_l7_n423(x)
+    else
+        fun_l7_n653(x)
+    end
+end
+
+def fun_l6_n833(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n423(x)
+    end
+end
+
+def fun_l6_n834(x)
+    if (x < 1)
+        fun_l7_n940(x)
+    else
+        fun_l7_n48(x)
+    end
+end
+
+def fun_l6_n835(x)
+    if (x < 1)
+        fun_l7_n336(x)
+    else
+        fun_l7_n584(x)
+    end
+end
+
+def fun_l6_n836(x)
+    if (x < 1)
+        fun_l7_n66(x)
+    else
+        fun_l7_n980(x)
+    end
+end
+
+def fun_l6_n837(x)
+    if (x < 1)
+        fun_l7_n176(x)
+    else
+        fun_l7_n845(x)
+    end
+end
+
+def fun_l6_n838(x)
+    if (x < 1)
+        fun_l7_n736(x)
+    else
+        fun_l7_n385(x)
+    end
+end
+
+def fun_l6_n839(x)
+    if (x < 1)
+        fun_l7_n948(x)
+    else
+        fun_l7_n258(x)
+    end
+end
+
+def fun_l6_n840(x)
+    if (x < 1)
+        fun_l7_n926(x)
+    else
+        fun_l7_n926(x)
+    end
+end
+
+def fun_l6_n841(x)
+    if (x < 1)
+        fun_l7_n334(x)
+    else
+        fun_l7_n134(x)
+    end
+end
+
+def fun_l6_n842(x)
+    if (x < 1)
+        fun_l7_n757(x)
+    else
+        fun_l7_n995(x)
+    end
+end
+
+def fun_l6_n843(x)
+    if (x < 1)
+        fun_l7_n75(x)
+    else
+        fun_l7_n6(x)
+    end
+end
+
+def fun_l6_n844(x)
+    if (x < 1)
+        fun_l7_n632(x)
+    else
+        fun_l7_n683(x)
+    end
+end
+
+def fun_l6_n845(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n153(x)
+    end
+end
+
+def fun_l6_n846(x)
+    if (x < 1)
+        fun_l7_n668(x)
+    else
+        fun_l7_n78(x)
+    end
+end
+
+def fun_l6_n847(x)
+    if (x < 1)
+        fun_l7_n509(x)
+    else
+        fun_l7_n210(x)
+    end
+end
+
+def fun_l6_n848(x)
+    if (x < 1)
+        fun_l7_n862(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n849(x)
+    if (x < 1)
+        fun_l7_n837(x)
+    else
+        fun_l7_n37(x)
+    end
+end
+
+def fun_l6_n850(x)
+    if (x < 1)
+        fun_l7_n792(x)
+    else
+        fun_l7_n171(x)
+    end
+end
+
+def fun_l6_n851(x)
+    if (x < 1)
+        fun_l7_n869(x)
+    else
+        fun_l7_n217(x)
+    end
+end
+
+def fun_l6_n852(x)
+    if (x < 1)
+        fun_l7_n585(x)
+    else
+        fun_l7_n980(x)
+    end
+end
+
+def fun_l6_n853(x)
+    if (x < 1)
+        fun_l7_n752(x)
+    else
+        fun_l7_n214(x)
+    end
+end
+
+def fun_l6_n854(x)
+    if (x < 1)
+        fun_l7_n151(x)
+    else
+        fun_l7_n668(x)
+    end
+end
+
+def fun_l6_n855(x)
+    if (x < 1)
+        fun_l7_n145(x)
+    else
+        fun_l7_n99(x)
+    end
+end
+
+def fun_l6_n856(x)
+    if (x < 1)
+        fun_l7_n114(x)
+    else
+        fun_l7_n852(x)
+    end
+end
+
+def fun_l6_n857(x)
+    if (x < 1)
+        fun_l7_n571(x)
+    else
+        fun_l7_n6(x)
+    end
+end
+
+def fun_l6_n858(x)
+    if (x < 1)
+        fun_l7_n724(x)
+    else
+        fun_l7_n132(x)
+    end
+end
+
+def fun_l6_n859(x)
+    if (x < 1)
+        fun_l7_n146(x)
+    else
+        fun_l7_n627(x)
+    end
+end
+
+def fun_l6_n860(x)
+    if (x < 1)
+        fun_l7_n515(x)
+    else
+        fun_l7_n598(x)
+    end
+end
+
+def fun_l6_n861(x)
+    if (x < 1)
+        fun_l7_n49(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n862(x)
+    if (x < 1)
+        fun_l7_n378(x)
+    else
+        fun_l7_n295(x)
+    end
+end
+
+def fun_l6_n863(x)
+    if (x < 1)
+        fun_l7_n122(x)
+    else
+        fun_l7_n738(x)
+    end
+end
+
+def fun_l6_n864(x)
+    if (x < 1)
+        fun_l7_n421(x)
+    else
+        fun_l7_n719(x)
+    end
+end
+
+def fun_l6_n865(x)
+    if (x < 1)
+        fun_l7_n965(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n866(x)
+    if (x < 1)
+        fun_l7_n551(x)
+    else
+        fun_l7_n177(x)
+    end
+end
+
+def fun_l6_n867(x)
+    if (x < 1)
+        fun_l7_n136(x)
+    else
+        fun_l7_n289(x)
+    end
+end
+
+def fun_l6_n868(x)
+    if (x < 1)
+        fun_l7_n26(x)
+    else
+        fun_l7_n376(x)
+    end
+end
+
+def fun_l6_n869(x)
+    if (x < 1)
+        fun_l7_n888(x)
+    else
+        fun_l7_n948(x)
+    end
+end
+
+def fun_l6_n870(x)
+    if (x < 1)
+        fun_l7_n636(x)
+    else
+        fun_l7_n89(x)
+    end
+end
+
+def fun_l6_n871(x)
+    if (x < 1)
+        fun_l7_n953(x)
+    else
+        fun_l7_n634(x)
+    end
+end
+
+def fun_l6_n872(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n219(x)
+    end
+end
+
+def fun_l6_n873(x)
+    if (x < 1)
+        fun_l7_n317(x)
+    else
+        fun_l7_n863(x)
+    end
+end
+
+def fun_l6_n874(x)
+    if (x < 1)
+        fun_l7_n495(x)
+    else
+        fun_l7_n478(x)
+    end
+end
+
+def fun_l6_n875(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n634(x)
+    end
+end
+
+def fun_l6_n876(x)
+    if (x < 1)
+        fun_l7_n780(x)
+    else
+        fun_l7_n886(x)
+    end
+end
+
+def fun_l6_n877(x)
+    if (x < 1)
+        fun_l7_n768(x)
+    else
+        fun_l7_n820(x)
+    end
+end
+
+def fun_l6_n878(x)
+    if (x < 1)
+        fun_l7_n501(x)
+    else
+        fun_l7_n355(x)
+    end
+end
+
+def fun_l6_n879(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n880(x)
+    if (x < 1)
+        fun_l7_n541(x)
+    else
+        fun_l7_n148(x)
+    end
+end
+
+def fun_l6_n881(x)
+    if (x < 1)
+        fun_l7_n460(x)
+    else
+        fun_l7_n579(x)
+    end
+end
+
+def fun_l6_n882(x)
+    if (x < 1)
+        fun_l7_n576(x)
+    else
+        fun_l7_n118(x)
+    end
+end
+
+def fun_l6_n883(x)
+    if (x < 1)
+        fun_l7_n218(x)
+    else
+        fun_l7_n197(x)
+    end
+end
+
+def fun_l6_n884(x)
+    if (x < 1)
+        fun_l7_n279(x)
+    else
+        fun_l7_n565(x)
+    end
+end
+
+def fun_l6_n885(x)
+    if (x < 1)
+        fun_l7_n934(x)
+    else
+        fun_l7_n46(x)
+    end
+end
+
+def fun_l6_n886(x)
+    if (x < 1)
+        fun_l7_n894(x)
+    else
+        fun_l7_n864(x)
+    end
+end
+
+def fun_l6_n887(x)
+    if (x < 1)
+        fun_l7_n45(x)
+    else
+        fun_l7_n151(x)
+    end
+end
+
+def fun_l6_n888(x)
+    if (x < 1)
+        fun_l7_n190(x)
+    else
+        fun_l7_n46(x)
+    end
+end
+
+def fun_l6_n889(x)
+    if (x < 1)
+        fun_l7_n56(x)
+    else
+        fun_l7_n451(x)
+    end
+end
+
+def fun_l6_n890(x)
+    if (x < 1)
+        fun_l7_n7(x)
+    else
+        fun_l7_n906(x)
+    end
+end
+
+def fun_l6_n891(x)
+    if (x < 1)
+        fun_l7_n507(x)
+    else
+        fun_l7_n121(x)
+    end
+end
+
+def fun_l6_n892(x)
+    if (x < 1)
+        fun_l7_n757(x)
+    else
+        fun_l7_n485(x)
+    end
+end
+
+def fun_l6_n893(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n366(x)
+    end
+end
+
+def fun_l6_n894(x)
+    if (x < 1)
+        fun_l7_n563(x)
+    else
+        fun_l7_n749(x)
+    end
+end
+
+def fun_l6_n895(x)
+    if (x < 1)
+        fun_l7_n976(x)
+    else
+        fun_l7_n907(x)
+    end
+end
+
+def fun_l6_n896(x)
+    if (x < 1)
+        fun_l7_n525(x)
+    else
+        fun_l7_n843(x)
+    end
+end
+
+def fun_l6_n897(x)
+    if (x < 1)
+        fun_l7_n255(x)
+    else
+        fun_l7_n133(x)
+    end
+end
+
+def fun_l6_n898(x)
+    if (x < 1)
+        fun_l7_n796(x)
+    else
+        fun_l7_n275(x)
+    end
+end
+
+def fun_l6_n899(x)
+    if (x < 1)
+        fun_l7_n985(x)
+    else
+        fun_l7_n485(x)
+    end
+end
+
+def fun_l6_n900(x)
+    if (x < 1)
+        fun_l7_n32(x)
+    else
+        fun_l7_n324(x)
+    end
+end
+
+def fun_l6_n901(x)
+    if (x < 1)
+        fun_l7_n334(x)
+    else
+        fun_l7_n618(x)
+    end
+end
+
+def fun_l6_n902(x)
+    if (x < 1)
+        fun_l7_n762(x)
+    else
+        fun_l7_n778(x)
+    end
+end
+
+def fun_l6_n903(x)
+    if (x < 1)
+        fun_l7_n343(x)
+    else
+        fun_l7_n349(x)
+    end
+end
+
+def fun_l6_n904(x)
+    if (x < 1)
+        fun_l7_n310(x)
+    else
+        fun_l7_n215(x)
+    end
+end
+
+def fun_l6_n905(x)
+    if (x < 1)
+        fun_l7_n162(x)
+    else
+        fun_l7_n405(x)
+    end
+end
+
+def fun_l6_n906(x)
+    if (x < 1)
+        fun_l7_n667(x)
+    else
+        fun_l7_n633(x)
+    end
+end
+
+def fun_l6_n907(x)
+    if (x < 1)
+        fun_l7_n652(x)
+    else
+        fun_l7_n771(x)
+    end
+end
+
+def fun_l6_n908(x)
+    if (x < 1)
+        fun_l7_n198(x)
+    else
+        fun_l7_n32(x)
+    end
+end
+
+def fun_l6_n909(x)
+    if (x < 1)
+        fun_l7_n577(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n910(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n57(x)
+    end
+end
+
+def fun_l6_n911(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n556(x)
+    end
+end
+
+def fun_l6_n912(x)
+    if (x < 1)
+        fun_l7_n420(x)
+    else
+        fun_l7_n163(x)
+    end
+end
+
+def fun_l6_n913(x)
+    if (x < 1)
+        fun_l7_n795(x)
+    else
+        fun_l7_n225(x)
+    end
+end
+
+def fun_l6_n914(x)
+    if (x < 1)
+        fun_l7_n855(x)
+    else
+        fun_l7_n742(x)
+    end
+end
+
+def fun_l6_n915(x)
+    if (x < 1)
+        fun_l7_n386(x)
+    else
+        fun_l7_n314(x)
+    end
+end
+
+def fun_l6_n916(x)
+    if (x < 1)
+        fun_l7_n587(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n917(x)
+    if (x < 1)
+        fun_l7_n570(x)
+    else
+        fun_l7_n735(x)
+    end
+end
+
+def fun_l6_n918(x)
+    if (x < 1)
+        fun_l7_n985(x)
+    else
+        fun_l7_n492(x)
+    end
+end
+
+def fun_l6_n919(x)
+    if (x < 1)
+        fun_l7_n991(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n920(x)
+    if (x < 1)
+        fun_l7_n925(x)
+    else
+        fun_l7_n161(x)
+    end
+end
+
+def fun_l6_n921(x)
+    if (x < 1)
+        fun_l7_n398(x)
+    else
+        fun_l7_n621(x)
+    end
+end
+
+def fun_l6_n922(x)
+    if (x < 1)
+        fun_l7_n732(x)
+    else
+        fun_l7_n509(x)
+    end
+end
+
+def fun_l6_n923(x)
+    if (x < 1)
+        fun_l7_n879(x)
+    else
+        fun_l7_n219(x)
+    end
+end
+
+def fun_l6_n924(x)
+    if (x < 1)
+        fun_l7_n19(x)
+    else
+        fun_l7_n604(x)
+    end
+end
+
+def fun_l6_n925(x)
+    if (x < 1)
+        fun_l7_n474(x)
+    else
+        fun_l7_n439(x)
+    end
+end
+
+def fun_l6_n926(x)
+    if (x < 1)
+        fun_l7_n807(x)
+    else
+        fun_l7_n802(x)
+    end
+end
+
+def fun_l6_n927(x)
+    if (x < 1)
+        fun_l7_n146(x)
+    else
+        fun_l7_n966(x)
+    end
+end
+
+def fun_l6_n928(x)
+    if (x < 1)
+        fun_l7_n72(x)
+    else
+        fun_l7_n835(x)
+    end
+end
+
+def fun_l6_n929(x)
+    if (x < 1)
+        fun_l7_n389(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n930(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n719(x)
+    end
+end
+
+def fun_l6_n931(x)
+    if (x < 1)
+        fun_l7_n250(x)
+    else
+        fun_l7_n13(x)
+    end
+end
+
+def fun_l6_n932(x)
+    if (x < 1)
+        fun_l7_n470(x)
+    else
+        fun_l7_n984(x)
+    end
+end
+
+def fun_l6_n933(x)
+    if (x < 1)
+        fun_l7_n485(x)
+    else
+        fun_l7_n750(x)
+    end
+end
+
+def fun_l6_n934(x)
+    if (x < 1)
+        fun_l7_n371(x)
+    else
+        fun_l7_n912(x)
+    end
+end
+
+def fun_l6_n935(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n523(x)
+    end
+end
+
+def fun_l6_n936(x)
+    if (x < 1)
+        fun_l7_n998(x)
+    else
+        fun_l7_n6(x)
+    end
+end
+
+def fun_l6_n937(x)
+    if (x < 1)
+        fun_l7_n753(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n938(x)
+    if (x < 1)
+        fun_l7_n518(x)
+    else
+        fun_l7_n18(x)
+    end
+end
+
+def fun_l6_n939(x)
+    if (x < 1)
+        fun_l7_n771(x)
+    else
+        fun_l7_n1(x)
+    end
+end
+
+def fun_l6_n940(x)
+    if (x < 1)
+        fun_l7_n43(x)
+    else
+        fun_l7_n727(x)
+    end
+end
+
+def fun_l6_n941(x)
+    if (x < 1)
+        fun_l7_n282(x)
+    else
+        fun_l7_n676(x)
+    end
+end
+
+def fun_l6_n942(x)
+    if (x < 1)
+        fun_l7_n284(x)
+    else
+        fun_l7_n56(x)
+    end
+end
+
+def fun_l6_n943(x)
+    if (x < 1)
+        fun_l7_n304(x)
+    else
+        fun_l7_n287(x)
+    end
+end
+
+def fun_l6_n944(x)
+    if (x < 1)
+        fun_l7_n968(x)
+    else
+        fun_l7_n283(x)
+    end
+end
+
+def fun_l6_n945(x)
+    if (x < 1)
+        fun_l7_n892(x)
+    else
+        fun_l7_n413(x)
+    end
+end
+
+def fun_l6_n946(x)
+    if (x < 1)
+        fun_l7_n750(x)
+    else
+        fun_l7_n244(x)
+    end
+end
+
+def fun_l6_n947(x)
+    if (x < 1)
+        fun_l7_n599(x)
+    else
+        fun_l7_n238(x)
+    end
+end
+
+def fun_l6_n948(x)
+    if (x < 1)
+        fun_l7_n447(x)
+    else
+        fun_l7_n880(x)
+    end
+end
+
+def fun_l6_n949(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n210(x)
+    end
+end
+
+def fun_l6_n950(x)
+    if (x < 1)
+        fun_l7_n143(x)
+    else
+        fun_l7_n816(x)
+    end
+end
+
+def fun_l6_n951(x)
+    if (x < 1)
+        fun_l7_n125(x)
+    else
+        fun_l7_n909(x)
+    end
+end
+
+def fun_l6_n952(x)
+    if (x < 1)
+        fun_l7_n134(x)
+    else
+        fun_l7_n946(x)
+    end
+end
+
+def fun_l6_n953(x)
+    if (x < 1)
+        fun_l7_n858(x)
+    else
+        fun_l7_n927(x)
+    end
+end
+
+def fun_l6_n954(x)
+    if (x < 1)
+        fun_l7_n853(x)
+    else
+        fun_l7_n396(x)
+    end
+end
+
+def fun_l6_n955(x)
+    if (x < 1)
+        fun_l7_n725(x)
+    else
+        fun_l7_n42(x)
+    end
+end
+
+def fun_l6_n956(x)
+    if (x < 1)
+        fun_l7_n108(x)
+    else
+        fun_l7_n177(x)
+    end
+end
+
+def fun_l6_n957(x)
+    if (x < 1)
+        fun_l7_n742(x)
+    else
+        fun_l7_n482(x)
+    end
+end
+
+def fun_l6_n958(x)
+    if (x < 1)
+        fun_l7_n385(x)
+    else
+        fun_l7_n292(x)
+    end
+end
+
+def fun_l6_n959(x)
+    if (x < 1)
+        fun_l7_n325(x)
+    else
+        fun_l7_n27(x)
+    end
+end
+
+def fun_l6_n960(x)
+    if (x < 1)
+        fun_l7_n558(x)
+    else
+        fun_l7_n556(x)
+    end
+end
+
+def fun_l6_n961(x)
+    if (x < 1)
+        fun_l7_n472(x)
+    else
+        fun_l7_n322(x)
+    end
+end
+
+def fun_l6_n962(x)
+    if (x < 1)
+        fun_l7_n754(x)
+    else
+        fun_l7_n729(x)
+    end
+end
+
+def fun_l6_n963(x)
+    if (x < 1)
+        fun_l7_n35(x)
+    else
+        fun_l7_n232(x)
+    end
+end
+
+def fun_l6_n964(x)
+    if (x < 1)
+        fun_l7_n113(x)
+    else
+        fun_l7_n878(x)
+    end
+end
+
+def fun_l6_n965(x)
+    if (x < 1)
+        fun_l7_n982(x)
+    else
+        fun_l7_n404(x)
+    end
+end
+
+def fun_l6_n966(x)
+    if (x < 1)
+        fun_l7_n385(x)
+    else
+        fun_l7_n20(x)
+    end
+end
+
+def fun_l6_n967(x)
+    if (x < 1)
+        fun_l7_n394(x)
+    else
+        fun_l7_n873(x)
+    end
+end
+
+def fun_l6_n968(x)
+    if (x < 1)
+        fun_l7_n230(x)
+    else
+        fun_l7_n141(x)
+    end
+end
+
+def fun_l6_n969(x)
+    if (x < 1)
+        fun_l7_n742(x)
+    else
+        fun_l7_n75(x)
+    end
+end
+
+def fun_l6_n970(x)
+    if (x < 1)
+        fun_l7_n583(x)
+    else
+        fun_l7_n809(x)
+    end
+end
+
+def fun_l6_n971(x)
+    if (x < 1)
+        fun_l7_n535(x)
+    else
+        fun_l7_n151(x)
+    end
+end
+
+def fun_l6_n972(x)
+    if (x < 1)
+        fun_l7_n42(x)
+    else
+        fun_l7_n469(x)
+    end
+end
+
+def fun_l6_n973(x)
+    if (x < 1)
+        fun_l7_n964(x)
+    else
+        fun_l7_n759(x)
+    end
+end
+
+def fun_l6_n974(x)
+    if (x < 1)
+        fun_l7_n897(x)
+    else
+        fun_l7_n29(x)
+    end
+end
+
+def fun_l6_n975(x)
+    if (x < 1)
+        fun_l7_n331(x)
+    else
+        fun_l7_n972(x)
+    end
+end
+
+def fun_l6_n976(x)
+    if (x < 1)
+        fun_l7_n825(x)
+    else
+        fun_l7_n221(x)
+    end
+end
+
+def fun_l6_n977(x)
+    if (x < 1)
+        fun_l7_n207(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n978(x)
+    if (x < 1)
+        fun_l7_n231(x)
+    else
+        fun_l7_n552(x)
+    end
+end
+
+def fun_l6_n979(x)
+    if (x < 1)
+        fun_l7_n621(x)
+    else
+        fun_l7_n766(x)
+    end
+end
+
+def fun_l6_n980(x)
+    if (x < 1)
+        fun_l7_n461(x)
+    else
+        fun_l7_n552(x)
+    end
+end
+
+def fun_l6_n981(x)
+    if (x < 1)
+        fun_l7_n891(x)
+    else
+        fun_l7_n710(x)
+    end
+end
+
+def fun_l6_n982(x)
+    if (x < 1)
+        fun_l7_n253(x)
+    else
+        fun_l7_n104(x)
+    end
+end
+
+def fun_l6_n983(x)
+    if (x < 1)
+        fun_l7_n726(x)
+    else
+        fun_l7_n903(x)
+    end
+end
+
+def fun_l6_n984(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n700(x)
+    end
+end
+
+def fun_l6_n985(x)
+    if (x < 1)
+        fun_l7_n234(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n986(x)
+    if (x < 1)
+        fun_l7_n379(x)
+    else
+        fun_l7_n504(x)
+    end
+end
+
+def fun_l6_n987(x)
+    if (x < 1)
+        fun_l7_n194(x)
+    else
+        fun_l7_n962(x)
+    end
+end
+
+def fun_l6_n988(x)
+    if (x < 1)
+        fun_l7_n60(x)
+    else
+        fun_l7_n699(x)
+    end
+end
+
+def fun_l6_n989(x)
+    if (x < 1)
+        fun_l7_n692(x)
+    else
+        fun_l7_n28(x)
+    end
+end
+
+def fun_l6_n990(x)
+    if (x < 1)
+        fun_l7_n456(x)
+    else
+        fun_l7_n126(x)
+    end
+end
+
+def fun_l6_n991(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n156(x)
+    end
+end
+
+def fun_l6_n992(x)
+    if (x < 1)
+        fun_l7_n269(x)
+    else
+        fun_l7_n513(x)
+    end
+end
+
+def fun_l6_n993(x)
+    if (x < 1)
+        fun_l7_n20(x)
+    else
+        fun_l7_n754(x)
+    end
+end
+
+def fun_l6_n994(x)
+    if (x < 1)
+        fun_l7_n445(x)
+    else
+        fun_l7_n422(x)
+    end
+end
+
+def fun_l6_n995(x)
+    if (x < 1)
+        fun_l7_n320(x)
+    else
+        fun_l7_n398(x)
+    end
+end
+
+def fun_l6_n996(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n238(x)
+    end
+end
+
+def fun_l6_n997(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n998(x)
+    if (x < 1)
+        fun_l7_n774(x)
+    else
+        fun_l7_n510(x)
+    end
+end
+
+def fun_l6_n999(x)
+    if (x < 1)
+        fun_l7_n158(x)
+    else
+        fun_l7_n929(x)
+    end
+end
+
+def fun_l7_n0(x)
+    if (x < 1)
+        fun_l8_n414(x)
+    else
+        fun_l8_n327(x)
+    end
+end
+
+def fun_l7_n1(x)
+    if (x < 1)
+        fun_l8_n446(x)
+    else
+        fun_l8_n611(x)
+    end
+end
+
+def fun_l7_n2(x)
+    if (x < 1)
+        fun_l8_n116(x)
+    else
+        fun_l8_n224(x)
+    end
+end
+
+def fun_l7_n3(x)
+    if (x < 1)
+        fun_l8_n809(x)
+    else
+        fun_l8_n962(x)
+    end
+end
+
+def fun_l7_n4(x)
+    if (x < 1)
+        fun_l8_n137(x)
+    else
+        fun_l8_n426(x)
+    end
+end
+
+def fun_l7_n5(x)
+    if (x < 1)
+        fun_l8_n686(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n6(x)
+    if (x < 1)
+        fun_l8_n430(x)
+    else
+        fun_l8_n302(x)
+    end
+end
+
+def fun_l7_n7(x)
+    if (x < 1)
+        fun_l8_n865(x)
+    else
+        fun_l8_n60(x)
+    end
+end
+
+def fun_l7_n8(x)
+    if (x < 1)
+        fun_l8_n895(x)
+    else
+        fun_l8_n148(x)
+    end
+end
+
+def fun_l7_n9(x)
+    if (x < 1)
+        fun_l8_n740(x)
+    else
+        fun_l8_n982(x)
+    end
+end
+
+def fun_l7_n10(x)
+    if (x < 1)
+        fun_l8_n757(x)
+    else
+        fun_l8_n640(x)
+    end
+end
+
+def fun_l7_n11(x)
+    if (x < 1)
+        fun_l8_n744(x)
+    else
+        fun_l8_n256(x)
+    end
+end
+
+def fun_l7_n12(x)
+    if (x < 1)
+        fun_l8_n272(x)
+    else
+        fun_l8_n828(x)
+    end
+end
+
+def fun_l7_n13(x)
+    if (x < 1)
+        fun_l8_n395(x)
+    else
+        fun_l8_n932(x)
+    end
+end
+
+def fun_l7_n14(x)
+    if (x < 1)
+        fun_l8_n178(x)
+    else
+        fun_l8_n676(x)
+    end
+end
+
+def fun_l7_n15(x)
+    if (x < 1)
+        fun_l8_n40(x)
+    else
+        fun_l8_n548(x)
+    end
+end
+
+def fun_l7_n16(x)
+    if (x < 1)
+        fun_l8_n506(x)
+    else
+        fun_l8_n234(x)
+    end
+end
+
+def fun_l7_n17(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n56(x)
+    end
+end
+
+def fun_l7_n18(x)
+    if (x < 1)
+        fun_l8_n381(x)
+    else
+        fun_l8_n720(x)
+    end
+end
+
+def fun_l7_n19(x)
+    if (x < 1)
+        fun_l8_n781(x)
+    else
+        fun_l8_n605(x)
+    end
+end
+
+def fun_l7_n20(x)
+    if (x < 1)
+        fun_l8_n479(x)
+    else
+        fun_l8_n894(x)
+    end
+end
+
+def fun_l7_n21(x)
+    if (x < 1)
+        fun_l8_n437(x)
+    else
+        fun_l8_n123(x)
+    end
+end
+
+def fun_l7_n22(x)
+    if (x < 1)
+        fun_l8_n20(x)
+    else
+        fun_l8_n144(x)
+    end
+end
+
+def fun_l7_n23(x)
+    if (x < 1)
+        fun_l8_n684(x)
+    else
+        fun_l8_n866(x)
+    end
+end
+
+def fun_l7_n24(x)
+    if (x < 1)
+        fun_l8_n527(x)
+    else
+        fun_l8_n629(x)
+    end
+end
+
+def fun_l7_n25(x)
+    if (x < 1)
+        fun_l8_n399(x)
+    else
+        fun_l8_n52(x)
+    end
+end
+
+def fun_l7_n26(x)
+    if (x < 1)
+        fun_l8_n353(x)
+    else
+        fun_l8_n438(x)
+    end
+end
+
+def fun_l7_n27(x)
+    if (x < 1)
+        fun_l8_n916(x)
+    else
+        fun_l8_n488(x)
+    end
+end
+
+def fun_l7_n28(x)
+    if (x < 1)
+        fun_l8_n833(x)
+    else
+        fun_l8_n585(x)
+    end
+end
+
+def fun_l7_n29(x)
+    if (x < 1)
+        fun_l8_n38(x)
+    else
+        fun_l8_n785(x)
+    end
+end
+
+def fun_l7_n30(x)
+    if (x < 1)
+        fun_l8_n157(x)
+    else
+        fun_l8_n332(x)
+    end
+end
+
+def fun_l7_n31(x)
+    if (x < 1)
+        fun_l8_n467(x)
+    else
+        fun_l8_n442(x)
+    end
+end
+
+def fun_l7_n32(x)
+    if (x < 1)
+        fun_l8_n704(x)
+    else
+        fun_l8_n295(x)
+    end
+end
+
+def fun_l7_n33(x)
+    if (x < 1)
+        fun_l8_n829(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n34(x)
+    if (x < 1)
+        fun_l8_n227(x)
+    else
+        fun_l8_n865(x)
+    end
+end
+
+def fun_l7_n35(x)
+    if (x < 1)
+        fun_l8_n930(x)
+    else
+        fun_l8_n129(x)
+    end
+end
+
+def fun_l7_n36(x)
+    if (x < 1)
+        fun_l8_n519(x)
+    else
+        fun_l8_n587(x)
+    end
+end
+
+def fun_l7_n37(x)
+    if (x < 1)
+        fun_l8_n132(x)
+    else
+        fun_l8_n547(x)
+    end
+end
+
+def fun_l7_n38(x)
+    if (x < 1)
+        fun_l8_n627(x)
+    else
+        fun_l8_n712(x)
+    end
+end
+
+def fun_l7_n39(x)
+    if (x < 1)
+        fun_l8_n752(x)
+    else
+        fun_l8_n357(x)
+    end
+end
+
+def fun_l7_n40(x)
+    if (x < 1)
+        fun_l8_n542(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n41(x)
+    if (x < 1)
+        fun_l8_n89(x)
+    else
+        fun_l8_n492(x)
+    end
+end
+
+def fun_l7_n42(x)
+    if (x < 1)
+        fun_l8_n508(x)
+    else
+        fun_l8_n288(x)
+    end
+end
+
+def fun_l7_n43(x)
+    if (x < 1)
+        fun_l8_n627(x)
+    else
+        fun_l8_n632(x)
+    end
+end
+
+def fun_l7_n44(x)
+    if (x < 1)
+        fun_l8_n513(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n45(x)
+    if (x < 1)
+        fun_l8_n599(x)
+    else
+        fun_l8_n581(x)
+    end
+end
+
+def fun_l7_n46(x)
+    if (x < 1)
+        fun_l8_n907(x)
+    else
+        fun_l8_n71(x)
+    end
+end
+
+def fun_l7_n47(x)
+    if (x < 1)
+        fun_l8_n609(x)
+    else
+        fun_l8_n601(x)
+    end
+end
+
+def fun_l7_n48(x)
+    if (x < 1)
+        fun_l8_n985(x)
+    else
+        fun_l8_n536(x)
+    end
+end
+
+def fun_l7_n49(x)
+    if (x < 1)
+        fun_l8_n220(x)
+    else
+        fun_l8_n6(x)
+    end
+end
+
+def fun_l7_n50(x)
+    if (x < 1)
+        fun_l8_n445(x)
+    else
+        fun_l8_n939(x)
+    end
+end
+
+def fun_l7_n51(x)
+    if (x < 1)
+        fun_l8_n973(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n52(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n70(x)
+    end
+end
+
+def fun_l7_n53(x)
+    if (x < 1)
+        fun_l8_n745(x)
+    else
+        fun_l8_n237(x)
+    end
+end
+
+def fun_l7_n54(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n756(x)
+    end
+end
+
+def fun_l7_n55(x)
+    if (x < 1)
+        fun_l8_n438(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n56(x)
+    if (x < 1)
+        fun_l8_n564(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n57(x)
+    if (x < 1)
+        fun_l8_n480(x)
+    else
+        fun_l8_n832(x)
+    end
+end
+
+def fun_l7_n58(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n59(x)
+    if (x < 1)
+        fun_l8_n904(x)
+    else
+        fun_l8_n334(x)
+    end
+end
+
+def fun_l7_n60(x)
+    if (x < 1)
+        fun_l8_n407(x)
+    else
+        fun_l8_n573(x)
+    end
+end
+
+def fun_l7_n61(x)
+    if (x < 1)
+        fun_l8_n705(x)
+    else
+        fun_l8_n202(x)
+    end
+end
+
+def fun_l7_n62(x)
+    if (x < 1)
+        fun_l8_n715(x)
+    else
+        fun_l8_n394(x)
+    end
+end
+
+def fun_l7_n63(x)
+    if (x < 1)
+        fun_l8_n935(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n64(x)
+    if (x < 1)
+        fun_l8_n525(x)
+    else
+        fun_l8_n81(x)
+    end
+end
+
+def fun_l7_n65(x)
+    if (x < 1)
+        fun_l8_n692(x)
+    else
+        fun_l8_n372(x)
+    end
+end
+
+def fun_l7_n66(x)
+    if (x < 1)
+        fun_l8_n286(x)
+    else
+        fun_l8_n568(x)
+    end
+end
+
+def fun_l7_n67(x)
+    if (x < 1)
+        fun_l8_n829(x)
+    else
+        fun_l8_n89(x)
+    end
+end
+
+def fun_l7_n68(x)
+    if (x < 1)
+        fun_l8_n542(x)
+    else
+        fun_l8_n362(x)
+    end
+end
+
+def fun_l7_n69(x)
+    if (x < 1)
+        fun_l8_n673(x)
+    else
+        fun_l8_n302(x)
+    end
+end
+
+def fun_l7_n70(x)
+    if (x < 1)
+        fun_l8_n649(x)
+    else
+        fun_l8_n890(x)
+    end
+end
+
+def fun_l7_n71(x)
+    if (x < 1)
+        fun_l8_n639(x)
+    else
+        fun_l8_n304(x)
+    end
+end
+
+def fun_l7_n72(x)
+    if (x < 1)
+        fun_l8_n797(x)
+    else
+        fun_l8_n132(x)
+    end
+end
+
+def fun_l7_n73(x)
+    if (x < 1)
+        fun_l8_n301(x)
+    else
+        fun_l8_n328(x)
+    end
+end
+
+def fun_l7_n74(x)
+    if (x < 1)
+        fun_l8_n438(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n75(x)
+    if (x < 1)
+        fun_l8_n679(x)
+    else
+        fun_l8_n621(x)
+    end
+end
+
+def fun_l7_n76(x)
+    if (x < 1)
+        fun_l8_n136(x)
+    else
+        fun_l8_n916(x)
+    end
+end
+
+def fun_l7_n77(x)
+    if (x < 1)
+        fun_l8_n39(x)
+    else
+        fun_l8_n945(x)
+    end
+end
+
+def fun_l7_n78(x)
+    if (x < 1)
+        fun_l8_n365(x)
+    else
+        fun_l8_n883(x)
+    end
+end
+
+def fun_l7_n79(x)
+    if (x < 1)
+        fun_l8_n514(x)
+    else
+        fun_l8_n989(x)
+    end
+end
+
+def fun_l7_n80(x)
+    if (x < 1)
+        fun_l8_n378(x)
+    else
+        fun_l8_n634(x)
+    end
+end
+
+def fun_l7_n81(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n73(x)
+    end
+end
+
+def fun_l7_n82(x)
+    if (x < 1)
+        fun_l8_n521(x)
+    else
+        fun_l8_n848(x)
+    end
+end
+
+def fun_l7_n83(x)
+    if (x < 1)
+        fun_l8_n184(x)
+    else
+        fun_l8_n350(x)
+    end
+end
+
+def fun_l7_n84(x)
+    if (x < 1)
+        fun_l8_n215(x)
+    else
+        fun_l8_n615(x)
+    end
+end
+
+def fun_l7_n85(x)
+    if (x < 1)
+        fun_l8_n556(x)
+    else
+        fun_l8_n723(x)
+    end
+end
+
+def fun_l7_n86(x)
+    if (x < 1)
+        fun_l8_n565(x)
+    else
+        fun_l8_n661(x)
+    end
+end
+
+def fun_l7_n87(x)
+    if (x < 1)
+        fun_l8_n22(x)
+    else
+        fun_l8_n623(x)
+    end
+end
+
+def fun_l7_n88(x)
+    if (x < 1)
+        fun_l8_n995(x)
+    else
+        fun_l8_n30(x)
+    end
+end
+
+def fun_l7_n89(x)
+    if (x < 1)
+        fun_l8_n912(x)
+    else
+        fun_l8_n332(x)
+    end
+end
+
+def fun_l7_n90(x)
+    if (x < 1)
+        fun_l8_n776(x)
+    else
+        fun_l8_n362(x)
+    end
+end
+
+def fun_l7_n91(x)
+    if (x < 1)
+        fun_l8_n720(x)
+    else
+        fun_l8_n512(x)
+    end
+end
+
+def fun_l7_n92(x)
+    if (x < 1)
+        fun_l8_n437(x)
+    else
+        fun_l8_n107(x)
+    end
+end
+
+def fun_l7_n93(x)
+    if (x < 1)
+        fun_l8_n143(x)
+    else
+        fun_l8_n493(x)
+    end
+end
+
+def fun_l7_n94(x)
+    if (x < 1)
+        fun_l8_n814(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n95(x)
+    if (x < 1)
+        fun_l8_n117(x)
+    else
+        fun_l8_n18(x)
+    end
+end
+
+def fun_l7_n96(x)
+    if (x < 1)
+        fun_l8_n769(x)
+    else
+        fun_l8_n37(x)
+    end
+end
+
+def fun_l7_n97(x)
+    if (x < 1)
+        fun_l8_n213(x)
+    else
+        fun_l8_n5(x)
+    end
+end
+
+def fun_l7_n98(x)
+    if (x < 1)
+        fun_l8_n608(x)
+    else
+        fun_l8_n551(x)
+    end
+end
+
+def fun_l7_n99(x)
+    if (x < 1)
+        fun_l8_n130(x)
+    else
+        fun_l8_n879(x)
+    end
+end
+
+def fun_l7_n100(x)
+    if (x < 1)
+        fun_l8_n279(x)
+    else
+        fun_l8_n786(x)
+    end
+end
+
+def fun_l7_n101(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n904(x)
+    end
+end
+
+def fun_l7_n102(x)
+    if (x < 1)
+        fun_l8_n661(x)
+    else
+        fun_l8_n873(x)
+    end
+end
+
+def fun_l7_n103(x)
+    if (x < 1)
+        fun_l8_n360(x)
+    else
+        fun_l8_n793(x)
+    end
+end
+
+def fun_l7_n104(x)
+    if (x < 1)
+        fun_l8_n687(x)
+    else
+        fun_l8_n853(x)
+    end
+end
+
+def fun_l7_n105(x)
+    if (x < 1)
+        fun_l8_n168(x)
+    else
+        fun_l8_n280(x)
+    end
+end
+
+def fun_l7_n106(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n222(x)
+    end
+end
+
+def fun_l7_n107(x)
+    if (x < 1)
+        fun_l8_n470(x)
+    else
+        fun_l8_n633(x)
+    end
+end
+
+def fun_l7_n108(x)
+    if (x < 1)
+        fun_l8_n495(x)
+    else
+        fun_l8_n253(x)
+    end
+end
+
+def fun_l7_n109(x)
+    if (x < 1)
+        fun_l8_n369(x)
+    else
+        fun_l8_n108(x)
+    end
+end
+
+def fun_l7_n110(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n162(x)
+    end
+end
+
+def fun_l7_n111(x)
+    if (x < 1)
+        fun_l8_n835(x)
+    else
+        fun_l8_n295(x)
+    end
+end
+
+def fun_l7_n112(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n432(x)
+    end
+end
+
+def fun_l7_n113(x)
+    if (x < 1)
+        fun_l8_n237(x)
+    else
+        fun_l8_n484(x)
+    end
+end
+
+def fun_l7_n114(x)
+    if (x < 1)
+        fun_l8_n755(x)
+    else
+        fun_l8_n819(x)
+    end
+end
+
+def fun_l7_n115(x)
+    if (x < 1)
+        fun_l8_n542(x)
+    else
+        fun_l8_n587(x)
+    end
+end
+
+def fun_l7_n116(x)
+    if (x < 1)
+        fun_l8_n837(x)
+    else
+        fun_l8_n274(x)
+    end
+end
+
+def fun_l7_n117(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n104(x)
+    end
+end
+
+def fun_l7_n118(x)
+    if (x < 1)
+        fun_l8_n201(x)
+    else
+        fun_l8_n340(x)
+    end
+end
+
+def fun_l7_n119(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n213(x)
+    end
+end
+
+def fun_l7_n120(x)
+    if (x < 1)
+        fun_l8_n563(x)
+    else
+        fun_l8_n193(x)
+    end
+end
+
+def fun_l7_n121(x)
+    if (x < 1)
+        fun_l8_n738(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n122(x)
+    if (x < 1)
+        fun_l8_n261(x)
+    else
+        fun_l8_n500(x)
+    end
+end
+
+def fun_l7_n123(x)
+    if (x < 1)
+        fun_l8_n870(x)
+    else
+        fun_l8_n423(x)
+    end
+end
+
+def fun_l7_n124(x)
+    if (x < 1)
+        fun_l8_n405(x)
+    else
+        fun_l8_n749(x)
+    end
+end
+
+def fun_l7_n125(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n126(x)
+    if (x < 1)
+        fun_l8_n382(x)
+    else
+        fun_l8_n379(x)
+    end
+end
+
+def fun_l7_n127(x)
+    if (x < 1)
+        fun_l8_n232(x)
+    else
+        fun_l8_n913(x)
+    end
+end
+
+def fun_l7_n128(x)
+    if (x < 1)
+        fun_l8_n7(x)
+    else
+        fun_l8_n177(x)
+    end
+end
+
+def fun_l7_n129(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n670(x)
+    end
+end
+
+def fun_l7_n130(x)
+    if (x < 1)
+        fun_l8_n361(x)
+    else
+        fun_l8_n132(x)
+    end
+end
+
+def fun_l7_n131(x)
+    if (x < 1)
+        fun_l8_n125(x)
+    else
+        fun_l8_n925(x)
+    end
+end
+
+def fun_l7_n132(x)
+    if (x < 1)
+        fun_l8_n529(x)
+    else
+        fun_l8_n996(x)
+    end
+end
+
+def fun_l7_n133(x)
+    if (x < 1)
+        fun_l8_n283(x)
+    else
+        fun_l8_n112(x)
+    end
+end
+
+def fun_l7_n134(x)
+    if (x < 1)
+        fun_l8_n974(x)
+    else
+        fun_l8_n204(x)
+    end
+end
+
+def fun_l7_n135(x)
+    if (x < 1)
+        fun_l8_n903(x)
+    else
+        fun_l8_n196(x)
+    end
+end
+
+def fun_l7_n136(x)
+    if (x < 1)
+        fun_l8_n59(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n137(x)
+    if (x < 1)
+        fun_l8_n530(x)
+    else
+        fun_l8_n31(x)
+    end
+end
+
+def fun_l7_n138(x)
+    if (x < 1)
+        fun_l8_n990(x)
+    else
+        fun_l8_n924(x)
+    end
+end
+
+def fun_l7_n139(x)
+    if (x < 1)
+        fun_l8_n202(x)
+    else
+        fun_l8_n980(x)
+    end
+end
+
+def fun_l7_n140(x)
+    if (x < 1)
+        fun_l8_n354(x)
+    else
+        fun_l8_n694(x)
+    end
+end
+
+def fun_l7_n141(x)
+    if (x < 1)
+        fun_l8_n306(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n142(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n902(x)
+    end
+end
+
+def fun_l7_n143(x)
+    if (x < 1)
+        fun_l8_n522(x)
+    else
+        fun_l8_n904(x)
+    end
+end
+
+def fun_l7_n144(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n11(x)
+    end
+end
+
+def fun_l7_n145(x)
+    if (x < 1)
+        fun_l8_n147(x)
+    else
+        fun_l8_n21(x)
+    end
+end
+
+def fun_l7_n146(x)
+    if (x < 1)
+        fun_l8_n47(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n147(x)
+    if (x < 1)
+        fun_l8_n306(x)
+    else
+        fun_l8_n309(x)
+    end
+end
+
+def fun_l7_n148(x)
+    if (x < 1)
+        fun_l8_n757(x)
+    else
+        fun_l8_n83(x)
+    end
+end
+
+def fun_l7_n149(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n124(x)
+    end
+end
+
+def fun_l7_n150(x)
+    if (x < 1)
+        fun_l8_n276(x)
+    else
+        fun_l8_n838(x)
+    end
+end
+
+def fun_l7_n151(x)
+    if (x < 1)
+        fun_l8_n148(x)
+    else
+        fun_l8_n653(x)
+    end
+end
+
+def fun_l7_n152(x)
+    if (x < 1)
+        fun_l8_n315(x)
+    else
+        fun_l8_n942(x)
+    end
+end
+
+def fun_l7_n153(x)
+    if (x < 1)
+        fun_l8_n794(x)
+    else
+        fun_l8_n680(x)
+    end
+end
+
+def fun_l7_n154(x)
+    if (x < 1)
+        fun_l8_n508(x)
+    else
+        fun_l8_n427(x)
+    end
+end
+
+def fun_l7_n155(x)
+    if (x < 1)
+        fun_l8_n249(x)
+    else
+        fun_l8_n615(x)
+    end
+end
+
+def fun_l7_n156(x)
+    if (x < 1)
+        fun_l8_n339(x)
+    else
+        fun_l8_n559(x)
+    end
+end
+
+def fun_l7_n157(x)
+    if (x < 1)
+        fun_l8_n772(x)
+    else
+        fun_l8_n128(x)
+    end
+end
+
+def fun_l7_n158(x)
+    if (x < 1)
+        fun_l8_n247(x)
+    else
+        fun_l8_n962(x)
+    end
+end
+
+def fun_l7_n159(x)
+    if (x < 1)
+        fun_l8_n648(x)
+    else
+        fun_l8_n338(x)
+    end
+end
+
+def fun_l7_n160(x)
+    if (x < 1)
+        fun_l8_n104(x)
+    else
+        fun_l8_n757(x)
+    end
+end
+
+def fun_l7_n161(x)
+    if (x < 1)
+        fun_l8_n74(x)
+    else
+        fun_l8_n288(x)
+    end
+end
+
+def fun_l7_n162(x)
+    if (x < 1)
+        fun_l8_n849(x)
+    else
+        fun_l8_n982(x)
+    end
+end
+
+def fun_l7_n163(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n442(x)
+    end
+end
+
+def fun_l7_n164(x)
+    if (x < 1)
+        fun_l8_n268(x)
+    else
+        fun_l8_n717(x)
+    end
+end
+
+def fun_l7_n165(x)
+    if (x < 1)
+        fun_l8_n185(x)
+    else
+        fun_l8_n628(x)
+    end
+end
+
+def fun_l7_n166(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n830(x)
+    end
+end
+
+def fun_l7_n167(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n20(x)
+    end
+end
+
+def fun_l7_n168(x)
+    if (x < 1)
+        fun_l8_n835(x)
+    else
+        fun_l8_n493(x)
+    end
+end
+
+def fun_l7_n169(x)
+    if (x < 1)
+        fun_l8_n559(x)
+    else
+        fun_l8_n561(x)
+    end
+end
+
+def fun_l7_n170(x)
+    if (x < 1)
+        fun_l8_n942(x)
+    else
+        fun_l8_n699(x)
+    end
+end
+
+def fun_l7_n171(x)
+    if (x < 1)
+        fun_l8_n833(x)
+    else
+        fun_l8_n928(x)
+    end
+end
+
+def fun_l7_n172(x)
+    if (x < 1)
+        fun_l8_n564(x)
+    else
+        fun_l8_n972(x)
+    end
+end
+
+def fun_l7_n173(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n125(x)
+    end
+end
+
+def fun_l7_n174(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n813(x)
+    end
+end
+
+def fun_l7_n175(x)
+    if (x < 1)
+        fun_l8_n763(x)
+    else
+        fun_l8_n22(x)
+    end
+end
+
+def fun_l7_n176(x)
+    if (x < 1)
+        fun_l8_n955(x)
+    else
+        fun_l8_n579(x)
+    end
+end
+
+def fun_l7_n177(x)
+    if (x < 1)
+        fun_l8_n577(x)
+    else
+        fun_l8_n675(x)
+    end
+end
+
+def fun_l7_n178(x)
+    if (x < 1)
+        fun_l8_n867(x)
+    else
+        fun_l8_n119(x)
+    end
+end
+
+def fun_l7_n179(x)
+    if (x < 1)
+        fun_l8_n357(x)
+    else
+        fun_l8_n543(x)
+    end
+end
+
+def fun_l7_n180(x)
+    if (x < 1)
+        fun_l8_n67(x)
+    else
+        fun_l8_n643(x)
+    end
+end
+
+def fun_l7_n181(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n931(x)
+    end
+end
+
+def fun_l7_n182(x)
+    if (x < 1)
+        fun_l8_n962(x)
+    else
+        fun_l8_n220(x)
+    end
+end
+
+def fun_l7_n183(x)
+    if (x < 1)
+        fun_l8_n568(x)
+    else
+        fun_l8_n702(x)
+    end
+end
+
+def fun_l7_n184(x)
+    if (x < 1)
+        fun_l8_n877(x)
+    else
+        fun_l8_n376(x)
+    end
+end
+
+def fun_l7_n185(x)
+    if (x < 1)
+        fun_l8_n171(x)
+    else
+        fun_l8_n981(x)
+    end
+end
+
+def fun_l7_n186(x)
+    if (x < 1)
+        fun_l8_n283(x)
+    else
+        fun_l8_n81(x)
+    end
+end
+
+def fun_l7_n187(x)
+    if (x < 1)
+        fun_l8_n318(x)
+    else
+        fun_l8_n7(x)
+    end
+end
+
+def fun_l7_n188(x)
+    if (x < 1)
+        fun_l8_n874(x)
+    else
+        fun_l8_n879(x)
+    end
+end
+
+def fun_l7_n189(x)
+    if (x < 1)
+        fun_l8_n944(x)
+    else
+        fun_l8_n881(x)
+    end
+end
+
+def fun_l7_n190(x)
+    if (x < 1)
+        fun_l8_n462(x)
+    else
+        fun_l8_n570(x)
+    end
+end
+
+def fun_l7_n191(x)
+    if (x < 1)
+        fun_l8_n815(x)
+    else
+        fun_l8_n957(x)
+    end
+end
+
+def fun_l7_n192(x)
+    if (x < 1)
+        fun_l8_n217(x)
+    else
+        fun_l8_n93(x)
+    end
+end
+
+def fun_l7_n193(x)
+    if (x < 1)
+        fun_l8_n708(x)
+    else
+        fun_l8_n323(x)
+    end
+end
+
+def fun_l7_n194(x)
+    if (x < 1)
+        fun_l8_n420(x)
+    else
+        fun_l8_n375(x)
+    end
+end
+
+def fun_l7_n195(x)
+    if (x < 1)
+        fun_l8_n307(x)
+    else
+        fun_l8_n427(x)
+    end
+end
+
+def fun_l7_n196(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n265(x)
+    end
+end
+
+def fun_l7_n197(x)
+    if (x < 1)
+        fun_l8_n547(x)
+    else
+        fun_l8_n687(x)
+    end
+end
+
+def fun_l7_n198(x)
+    if (x < 1)
+        fun_l8_n693(x)
+    else
+        fun_l8_n420(x)
+    end
+end
+
+def fun_l7_n199(x)
+    if (x < 1)
+        fun_l8_n297(x)
+    else
+        fun_l8_n702(x)
+    end
+end
+
+def fun_l7_n200(x)
+    if (x < 1)
+        fun_l8_n418(x)
+    else
+        fun_l8_n758(x)
+    end
+end
+
+def fun_l7_n201(x)
+    if (x < 1)
+        fun_l8_n204(x)
+    else
+        fun_l8_n572(x)
+    end
+end
+
+def fun_l7_n202(x)
+    if (x < 1)
+        fun_l8_n847(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n203(x)
+    if (x < 1)
+        fun_l8_n692(x)
+    else
+        fun_l8_n595(x)
+    end
+end
+
+def fun_l7_n204(x)
+    if (x < 1)
+        fun_l8_n922(x)
+    else
+        fun_l8_n618(x)
+    end
+end
+
+def fun_l7_n205(x)
+    if (x < 1)
+        fun_l8_n431(x)
+    else
+        fun_l8_n135(x)
+    end
+end
+
+def fun_l7_n206(x)
+    if (x < 1)
+        fun_l8_n92(x)
+    else
+        fun_l8_n370(x)
+    end
+end
+
+def fun_l7_n207(x)
+    if (x < 1)
+        fun_l8_n141(x)
+    else
+        fun_l8_n845(x)
+    end
+end
+
+def fun_l7_n208(x)
+    if (x < 1)
+        fun_l8_n552(x)
+    else
+        fun_l8_n917(x)
+    end
+end
+
+def fun_l7_n209(x)
+    if (x < 1)
+        fun_l8_n341(x)
+    else
+        fun_l8_n794(x)
+    end
+end
+
+def fun_l7_n210(x)
+    if (x < 1)
+        fun_l8_n772(x)
+    else
+        fun_l8_n515(x)
+    end
+end
+
+def fun_l7_n211(x)
+    if (x < 1)
+        fun_l8_n37(x)
+    else
+        fun_l8_n635(x)
+    end
+end
+
+def fun_l7_n212(x)
+    if (x < 1)
+        fun_l8_n164(x)
+    else
+        fun_l8_n506(x)
+    end
+end
+
+def fun_l7_n213(x)
+    if (x < 1)
+        fun_l8_n621(x)
+    else
+        fun_l8_n722(x)
+    end
+end
+
+def fun_l7_n214(x)
+    if (x < 1)
+        fun_l8_n475(x)
+    else
+        fun_l8_n854(x)
+    end
+end
+
+def fun_l7_n215(x)
+    if (x < 1)
+        fun_l8_n275(x)
+    else
+        fun_l8_n884(x)
+    end
+end
+
+def fun_l7_n216(x)
+    if (x < 1)
+        fun_l8_n894(x)
+    else
+        fun_l8_n424(x)
+    end
+end
+
+def fun_l7_n217(x)
+    if (x < 1)
+        fun_l8_n32(x)
+    else
+        fun_l8_n698(x)
+    end
+end
+
+def fun_l7_n218(x)
+    if (x < 1)
+        fun_l8_n707(x)
+    else
+        fun_l8_n728(x)
+    end
+end
+
+def fun_l7_n219(x)
+    if (x < 1)
+        fun_l8_n294(x)
+    else
+        fun_l8_n583(x)
+    end
+end
+
+def fun_l7_n220(x)
+    if (x < 1)
+        fun_l8_n577(x)
+    else
+        fun_l8_n881(x)
+    end
+end
+
+def fun_l7_n221(x)
+    if (x < 1)
+        fun_l8_n925(x)
+    else
+        fun_l8_n177(x)
+    end
+end
+
+def fun_l7_n222(x)
+    if (x < 1)
+        fun_l8_n495(x)
+    else
+        fun_l8_n407(x)
+    end
+end
+
+def fun_l7_n223(x)
+    if (x < 1)
+        fun_l8_n11(x)
+    else
+        fun_l8_n753(x)
+    end
+end
+
+def fun_l7_n224(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n546(x)
+    end
+end
+
+def fun_l7_n225(x)
+    if (x < 1)
+        fun_l8_n644(x)
+    else
+        fun_l8_n728(x)
+    end
+end
+
+def fun_l7_n226(x)
+    if (x < 1)
+        fun_l8_n731(x)
+    else
+        fun_l8_n292(x)
+    end
+end
+
+def fun_l7_n227(x)
+    if (x < 1)
+        fun_l8_n653(x)
+    else
+        fun_l8_n521(x)
+    end
+end
+
+def fun_l7_n228(x)
+    if (x < 1)
+        fun_l8_n479(x)
+    else
+        fun_l8_n329(x)
+    end
+end
+
+def fun_l7_n229(x)
+    if (x < 1)
+        fun_l8_n151(x)
+    else
+        fun_l8_n620(x)
+    end
+end
+
+def fun_l7_n230(x)
+    if (x < 1)
+        fun_l8_n58(x)
+    else
+        fun_l8_n369(x)
+    end
+end
+
+def fun_l7_n231(x)
+    if (x < 1)
+        fun_l8_n301(x)
+    else
+        fun_l8_n869(x)
+    end
+end
+
+def fun_l7_n232(x)
+    if (x < 1)
+        fun_l8_n810(x)
+    else
+        fun_l8_n376(x)
+    end
+end
+
+def fun_l7_n233(x)
+    if (x < 1)
+        fun_l8_n19(x)
+    else
+        fun_l8_n278(x)
+    end
+end
+
+def fun_l7_n234(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n826(x)
+    end
+end
+
+def fun_l7_n235(x)
+    if (x < 1)
+        fun_l8_n302(x)
+    else
+        fun_l8_n62(x)
+    end
+end
+
+def fun_l7_n236(x)
+    if (x < 1)
+        fun_l8_n289(x)
+    else
+        fun_l8_n935(x)
+    end
+end
+
+def fun_l7_n237(x)
+    if (x < 1)
+        fun_l8_n217(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n238(x)
+    if (x < 1)
+        fun_l8_n234(x)
+    else
+        fun_l8_n720(x)
+    end
+end
+
+def fun_l7_n239(x)
+    if (x < 1)
+        fun_l8_n158(x)
+    else
+        fun_l8_n409(x)
+    end
+end
+
+def fun_l7_n240(x)
+    if (x < 1)
+        fun_l8_n478(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n241(x)
+    if (x < 1)
+        fun_l8_n115(x)
+    else
+        fun_l8_n406(x)
+    end
+end
+
+def fun_l7_n242(x)
+    if (x < 1)
+        fun_l8_n278(x)
+    else
+        fun_l8_n12(x)
+    end
+end
+
+def fun_l7_n243(x)
+    if (x < 1)
+        fun_l8_n273(x)
+    else
+        fun_l8_n243(x)
+    end
+end
+
+def fun_l7_n244(x)
+    if (x < 1)
+        fun_l8_n909(x)
+    else
+        fun_l8_n721(x)
+    end
+end
+
+def fun_l7_n245(x)
+    if (x < 1)
+        fun_l8_n415(x)
+    else
+        fun_l8_n530(x)
+    end
+end
+
+def fun_l7_n246(x)
+    if (x < 1)
+        fun_l8_n770(x)
+    else
+        fun_l8_n413(x)
+    end
+end
+
+def fun_l7_n247(x)
+    if (x < 1)
+        fun_l8_n228(x)
+    else
+        fun_l8_n668(x)
+    end
+end
+
+def fun_l7_n248(x)
+    if (x < 1)
+        fun_l8_n174(x)
+    else
+        fun_l8_n559(x)
+    end
+end
+
+def fun_l7_n249(x)
+    if (x < 1)
+        fun_l8_n740(x)
+    else
+        fun_l8_n314(x)
+    end
+end
+
+def fun_l7_n250(x)
+    if (x < 1)
+        fun_l8_n293(x)
+    else
+        fun_l8_n835(x)
+    end
+end
+
+def fun_l7_n251(x)
+    if (x < 1)
+        fun_l8_n584(x)
+    else
+        fun_l8_n755(x)
+    end
+end
+
+def fun_l7_n252(x)
+    if (x < 1)
+        fun_l8_n792(x)
+    else
+        fun_l8_n135(x)
+    end
+end
+
+def fun_l7_n253(x)
+    if (x < 1)
+        fun_l8_n116(x)
+    else
+        fun_l8_n82(x)
+    end
+end
+
+def fun_l7_n254(x)
+    if (x < 1)
+        fun_l8_n478(x)
+    else
+        fun_l8_n809(x)
+    end
+end
+
+def fun_l7_n255(x)
+    if (x < 1)
+        fun_l8_n924(x)
+    else
+        fun_l8_n708(x)
+    end
+end
+
+def fun_l7_n256(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n669(x)
+    end
+end
+
+def fun_l7_n257(x)
+    if (x < 1)
+        fun_l8_n300(x)
+    else
+        fun_l8_n166(x)
+    end
+end
+
+def fun_l7_n258(x)
+    if (x < 1)
+        fun_l8_n979(x)
+    else
+        fun_l8_n894(x)
+    end
+end
+
+def fun_l7_n259(x)
+    if (x < 1)
+        fun_l8_n765(x)
+    else
+        fun_l8_n838(x)
+    end
+end
+
+def fun_l7_n260(x)
+    if (x < 1)
+        fun_l8_n812(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n261(x)
+    if (x < 1)
+        fun_l8_n220(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n262(x)
+    if (x < 1)
+        fun_l8_n727(x)
+    else
+        fun_l8_n783(x)
+    end
+end
+
+def fun_l7_n263(x)
+    if (x < 1)
+        fun_l8_n560(x)
+    else
+        fun_l8_n781(x)
+    end
+end
+
+def fun_l7_n264(x)
+    if (x < 1)
+        fun_l8_n709(x)
+    else
+        fun_l8_n33(x)
+    end
+end
+
+def fun_l7_n265(x)
+    if (x < 1)
+        fun_l8_n904(x)
+    else
+        fun_l8_n64(x)
+    end
+end
+
+def fun_l7_n266(x)
+    if (x < 1)
+        fun_l8_n944(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n267(x)
+    if (x < 1)
+        fun_l8_n154(x)
+    else
+        fun_l8_n103(x)
+    end
+end
+
+def fun_l7_n268(x)
+    if (x < 1)
+        fun_l8_n55(x)
+    else
+        fun_l8_n841(x)
+    end
+end
+
+def fun_l7_n269(x)
+    if (x < 1)
+        fun_l8_n914(x)
+    else
+        fun_l8_n108(x)
+    end
+end
+
+def fun_l7_n270(x)
+    if (x < 1)
+        fun_l8_n733(x)
+    else
+        fun_l8_n398(x)
+    end
+end
+
+def fun_l7_n271(x)
+    if (x < 1)
+        fun_l8_n145(x)
+    else
+        fun_l8_n735(x)
+    end
+end
+
+def fun_l7_n272(x)
+    if (x < 1)
+        fun_l8_n404(x)
+    else
+        fun_l8_n216(x)
+    end
+end
+
+def fun_l7_n273(x)
+    if (x < 1)
+        fun_l8_n380(x)
+    else
+        fun_l8_n798(x)
+    end
+end
+
+def fun_l7_n274(x)
+    if (x < 1)
+        fun_l8_n63(x)
+    else
+        fun_l8_n133(x)
+    end
+end
+
+def fun_l7_n275(x)
+    if (x < 1)
+        fun_l8_n878(x)
+    else
+        fun_l8_n284(x)
+    end
+end
+
+def fun_l7_n276(x)
+    if (x < 1)
+        fun_l8_n718(x)
+    else
+        fun_l8_n97(x)
+    end
+end
+
+def fun_l7_n277(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n695(x)
+    end
+end
+
+def fun_l7_n278(x)
+    if (x < 1)
+        fun_l8_n581(x)
+    else
+        fun_l8_n898(x)
+    end
+end
+
+def fun_l7_n279(x)
+    if (x < 1)
+        fun_l8_n247(x)
+    else
+        fun_l8_n526(x)
+    end
+end
+
+def fun_l7_n280(x)
+    if (x < 1)
+        fun_l8_n995(x)
+    else
+        fun_l8_n614(x)
+    end
+end
+
+def fun_l7_n281(x)
+    if (x < 1)
+        fun_l8_n301(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n282(x)
+    if (x < 1)
+        fun_l8_n575(x)
+    else
+        fun_l8_n712(x)
+    end
+end
+
+def fun_l7_n283(x)
+    if (x < 1)
+        fun_l8_n261(x)
+    else
+        fun_l8_n740(x)
+    end
+end
+
+def fun_l7_n284(x)
+    if (x < 1)
+        fun_l8_n284(x)
+    else
+        fun_l8_n350(x)
+    end
+end
+
+def fun_l7_n285(x)
+    if (x < 1)
+        fun_l8_n521(x)
+    else
+        fun_l8_n305(x)
+    end
+end
+
+def fun_l7_n286(x)
+    if (x < 1)
+        fun_l8_n271(x)
+    else
+        fun_l8_n728(x)
+    end
+end
+
+def fun_l7_n287(x)
+    if (x < 1)
+        fun_l8_n292(x)
+    else
+        fun_l8_n799(x)
+    end
+end
+
+def fun_l7_n288(x)
+    if (x < 1)
+        fun_l8_n852(x)
+    else
+        fun_l8_n606(x)
+    end
+end
+
+def fun_l7_n289(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n649(x)
+    end
+end
+
+def fun_l7_n290(x)
+    if (x < 1)
+        fun_l8_n488(x)
+    else
+        fun_l8_n252(x)
+    end
+end
+
+def fun_l7_n291(x)
+    if (x < 1)
+        fun_l8_n815(x)
+    else
+        fun_l8_n690(x)
+    end
+end
+
+def fun_l7_n292(x)
+    if (x < 1)
+        fun_l8_n999(x)
+    else
+        fun_l8_n700(x)
+    end
+end
+
+def fun_l7_n293(x)
+    if (x < 1)
+        fun_l8_n9(x)
+    else
+        fun_l8_n194(x)
+    end
+end
+
+def fun_l7_n294(x)
+    if (x < 1)
+        fun_l8_n390(x)
+    else
+        fun_l8_n772(x)
+    end
+end
+
+def fun_l7_n295(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n587(x)
+    end
+end
+
+def fun_l7_n296(x)
+    if (x < 1)
+        fun_l8_n892(x)
+    else
+        fun_l8_n126(x)
+    end
+end
+
+def fun_l7_n297(x)
+    if (x < 1)
+        fun_l8_n199(x)
+    else
+        fun_l8_n312(x)
+    end
+end
+
+def fun_l7_n298(x)
+    if (x < 1)
+        fun_l8_n534(x)
+    else
+        fun_l8_n640(x)
+    end
+end
+
+def fun_l7_n299(x)
+    if (x < 1)
+        fun_l8_n344(x)
+    else
+        fun_l8_n58(x)
+    end
+end
+
+def fun_l7_n300(x)
+    if (x < 1)
+        fun_l8_n11(x)
+    else
+        fun_l8_n922(x)
+    end
+end
+
+def fun_l7_n301(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n432(x)
+    end
+end
+
+def fun_l7_n302(x)
+    if (x < 1)
+        fun_l8_n292(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n303(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n296(x)
+    end
+end
+
+def fun_l7_n304(x)
+    if (x < 1)
+        fun_l8_n350(x)
+    else
+        fun_l8_n769(x)
+    end
+end
+
+def fun_l7_n305(x)
+    if (x < 1)
+        fun_l8_n959(x)
+    else
+        fun_l8_n292(x)
+    end
+end
+
+def fun_l7_n306(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n507(x)
+    end
+end
+
+def fun_l7_n307(x)
+    if (x < 1)
+        fun_l8_n910(x)
+    else
+        fun_l8_n542(x)
+    end
+end
+
+def fun_l7_n308(x)
+    if (x < 1)
+        fun_l8_n299(x)
+    else
+        fun_l8_n543(x)
+    end
+end
+
+def fun_l7_n309(x)
+    if (x < 1)
+        fun_l8_n145(x)
+    else
+        fun_l8_n393(x)
+    end
+end
+
+def fun_l7_n310(x)
+    if (x < 1)
+        fun_l8_n1(x)
+    else
+        fun_l8_n810(x)
+    end
+end
+
+def fun_l7_n311(x)
+    if (x < 1)
+        fun_l8_n866(x)
+    else
+        fun_l8_n519(x)
+    end
+end
+
+def fun_l7_n312(x)
+    if (x < 1)
+        fun_l8_n730(x)
+    else
+        fun_l8_n912(x)
+    end
+end
+
+def fun_l7_n313(x)
+    if (x < 1)
+        fun_l8_n128(x)
+    else
+        fun_l8_n3(x)
+    end
+end
+
+def fun_l7_n314(x)
+    if (x < 1)
+        fun_l8_n393(x)
+    else
+        fun_l8_n887(x)
+    end
+end
+
+def fun_l7_n315(x)
+    if (x < 1)
+        fun_l8_n165(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n316(x)
+    if (x < 1)
+        fun_l8_n641(x)
+    else
+        fun_l8_n255(x)
+    end
+end
+
+def fun_l7_n317(x)
+    if (x < 1)
+        fun_l8_n265(x)
+    else
+        fun_l8_n754(x)
+    end
+end
+
+def fun_l7_n318(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n163(x)
+    end
+end
+
+def fun_l7_n319(x)
+    if (x < 1)
+        fun_l8_n409(x)
+    else
+        fun_l8_n110(x)
+    end
+end
+
+def fun_l7_n320(x)
+    if (x < 1)
+        fun_l8_n704(x)
+    else
+        fun_l8_n959(x)
+    end
+end
+
+def fun_l7_n321(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n280(x)
+    end
+end
+
+def fun_l7_n322(x)
+    if (x < 1)
+        fun_l8_n107(x)
+    else
+        fun_l8_n403(x)
+    end
+end
+
+def fun_l7_n323(x)
+    if (x < 1)
+        fun_l8_n108(x)
+    else
+        fun_l8_n426(x)
+    end
+end
+
+def fun_l7_n324(x)
+    if (x < 1)
+        fun_l8_n310(x)
+    else
+        fun_l8_n968(x)
+    end
+end
+
+def fun_l7_n325(x)
+    if (x < 1)
+        fun_l8_n600(x)
+    else
+        fun_l8_n850(x)
+    end
+end
+
+def fun_l7_n326(x)
+    if (x < 1)
+        fun_l8_n736(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n327(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n948(x)
+    end
+end
+
+def fun_l7_n328(x)
+    if (x < 1)
+        fun_l8_n625(x)
+    else
+        fun_l8_n644(x)
+    end
+end
+
+def fun_l7_n329(x)
+    if (x < 1)
+        fun_l8_n507(x)
+    else
+        fun_l8_n624(x)
+    end
+end
+
+def fun_l7_n330(x)
+    if (x < 1)
+        fun_l8_n956(x)
+    else
+        fun_l8_n281(x)
+    end
+end
+
+def fun_l7_n331(x)
+    if (x < 1)
+        fun_l8_n72(x)
+    else
+        fun_l8_n695(x)
+    end
+end
+
+def fun_l7_n332(x)
+    if (x < 1)
+        fun_l8_n445(x)
+    else
+        fun_l8_n465(x)
+    end
+end
+
+def fun_l7_n333(x)
+    if (x < 1)
+        fun_l8_n438(x)
+    else
+        fun_l8_n698(x)
+    end
+end
+
+def fun_l7_n334(x)
+    if (x < 1)
+        fun_l8_n242(x)
+    else
+        fun_l8_n837(x)
+    end
+end
+
+def fun_l7_n335(x)
+    if (x < 1)
+        fun_l8_n299(x)
+    else
+        fun_l8_n312(x)
+    end
+end
+
+def fun_l7_n336(x)
+    if (x < 1)
+        fun_l8_n264(x)
+    else
+        fun_l8_n330(x)
+    end
+end
+
+def fun_l7_n337(x)
+    if (x < 1)
+        fun_l8_n251(x)
+    else
+        fun_l8_n459(x)
+    end
+end
+
+def fun_l7_n338(x)
+    if (x < 1)
+        fun_l8_n876(x)
+    else
+        fun_l8_n689(x)
+    end
+end
+
+def fun_l7_n339(x)
+    if (x < 1)
+        fun_l8_n547(x)
+    else
+        fun_l8_n745(x)
+    end
+end
+
+def fun_l7_n340(x)
+    if (x < 1)
+        fun_l8_n493(x)
+    else
+        fun_l8_n877(x)
+    end
+end
+
+def fun_l7_n341(x)
+    if (x < 1)
+        fun_l8_n143(x)
+    else
+        fun_l8_n429(x)
+    end
+end
+
+def fun_l7_n342(x)
+    if (x < 1)
+        fun_l8_n650(x)
+    else
+        fun_l8_n384(x)
+    end
+end
+
+def fun_l7_n343(x)
+    if (x < 1)
+        fun_l8_n897(x)
+    else
+        fun_l8_n980(x)
+    end
+end
+
+def fun_l7_n344(x)
+    if (x < 1)
+        fun_l8_n699(x)
+    else
+        fun_l8_n673(x)
+    end
+end
+
+def fun_l7_n345(x)
+    if (x < 1)
+        fun_l8_n25(x)
+    else
+        fun_l8_n342(x)
+    end
+end
+
+def fun_l7_n346(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n140(x)
+    end
+end
+
+def fun_l7_n347(x)
+    if (x < 1)
+        fun_l8_n661(x)
+    else
+        fun_l8_n153(x)
+    end
+end
+
+def fun_l7_n348(x)
+    if (x < 1)
+        fun_l8_n477(x)
+    else
+        fun_l8_n460(x)
+    end
+end
+
+def fun_l7_n349(x)
+    if (x < 1)
+        fun_l8_n641(x)
+    else
+        fun_l8_n941(x)
+    end
+end
+
+def fun_l7_n350(x)
+    if (x < 1)
+        fun_l8_n952(x)
+    else
+        fun_l8_n886(x)
+    end
+end
+
+def fun_l7_n351(x)
+    if (x < 1)
+        fun_l8_n338(x)
+    else
+        fun_l8_n655(x)
+    end
+end
+
+def fun_l7_n352(x)
+    if (x < 1)
+        fun_l8_n717(x)
+    else
+        fun_l8_n314(x)
+    end
+end
+
+def fun_l7_n353(x)
+    if (x < 1)
+        fun_l8_n645(x)
+    else
+        fun_l8_n464(x)
+    end
+end
+
+def fun_l7_n354(x)
+    if (x < 1)
+        fun_l8_n114(x)
+    else
+        fun_l8_n816(x)
+    end
+end
+
+def fun_l7_n355(x)
+    if (x < 1)
+        fun_l8_n18(x)
+    else
+        fun_l8_n173(x)
+    end
+end
+
+def fun_l7_n356(x)
+    if (x < 1)
+        fun_l8_n214(x)
+    else
+        fun_l8_n834(x)
+    end
+end
+
+def fun_l7_n357(x)
+    if (x < 1)
+        fun_l8_n6(x)
+    else
+        fun_l8_n161(x)
+    end
+end
+
+def fun_l7_n358(x)
+    if (x < 1)
+        fun_l8_n823(x)
+    else
+        fun_l8_n695(x)
+    end
+end
+
+def fun_l7_n359(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n174(x)
+    end
+end
+
+def fun_l7_n360(x)
+    if (x < 1)
+        fun_l8_n904(x)
+    else
+        fun_l8_n240(x)
+    end
+end
+
+def fun_l7_n361(x)
+    if (x < 1)
+        fun_l8_n857(x)
+    else
+        fun_l8_n494(x)
+    end
+end
+
+def fun_l7_n362(x)
+    if (x < 1)
+        fun_l8_n780(x)
+    else
+        fun_l8_n186(x)
+    end
+end
+
+def fun_l7_n363(x)
+    if (x < 1)
+        fun_l8_n575(x)
+    else
+        fun_l8_n510(x)
+    end
+end
+
+def fun_l7_n364(x)
+    if (x < 1)
+        fun_l8_n412(x)
+    else
+        fun_l8_n153(x)
+    end
+end
+
+def fun_l7_n365(x)
+    if (x < 1)
+        fun_l8_n840(x)
+    else
+        fun_l8_n199(x)
+    end
+end
+
+def fun_l7_n366(x)
+    if (x < 1)
+        fun_l8_n162(x)
+    else
+        fun_l8_n971(x)
+    end
+end
+
+def fun_l7_n367(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n128(x)
+    end
+end
+
+def fun_l7_n368(x)
+    if (x < 1)
+        fun_l8_n404(x)
+    else
+        fun_l8_n657(x)
+    end
+end
+
+def fun_l7_n369(x)
+    if (x < 1)
+        fun_l8_n631(x)
+    else
+        fun_l8_n714(x)
+    end
+end
+
+def fun_l7_n370(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n718(x)
+    end
+end
+
+def fun_l7_n371(x)
+    if (x < 1)
+        fun_l8_n284(x)
+    else
+        fun_l8_n474(x)
+    end
+end
+
+def fun_l7_n372(x)
+    if (x < 1)
+        fun_l8_n138(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n373(x)
+    if (x < 1)
+        fun_l8_n78(x)
+    else
+        fun_l8_n750(x)
+    end
+end
+
+def fun_l7_n374(x)
+    if (x < 1)
+        fun_l8_n231(x)
+    else
+        fun_l8_n648(x)
+    end
+end
+
+def fun_l7_n375(x)
+    if (x < 1)
+        fun_l8_n238(x)
+    else
+        fun_l8_n644(x)
+    end
+end
+
+def fun_l7_n376(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n354(x)
+    end
+end
+
+def fun_l7_n377(x)
+    if (x < 1)
+        fun_l8_n332(x)
+    else
+        fun_l8_n739(x)
+    end
+end
+
+def fun_l7_n378(x)
+    if (x < 1)
+        fun_l8_n76(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n379(x)
+    if (x < 1)
+        fun_l8_n781(x)
+    else
+        fun_l8_n918(x)
+    end
+end
+
+def fun_l7_n380(x)
+    if (x < 1)
+        fun_l8_n854(x)
+    else
+        fun_l8_n85(x)
+    end
+end
+
+def fun_l7_n381(x)
+    if (x < 1)
+        fun_l8_n67(x)
+    else
+        fun_l8_n690(x)
+    end
+end
+
+def fun_l7_n382(x)
+    if (x < 1)
+        fun_l8_n425(x)
+    else
+        fun_l8_n643(x)
+    end
+end
+
+def fun_l7_n383(x)
+    if (x < 1)
+        fun_l8_n210(x)
+    else
+        fun_l8_n533(x)
+    end
+end
+
+def fun_l7_n384(x)
+    if (x < 1)
+        fun_l8_n469(x)
+    else
+        fun_l8_n274(x)
+    end
+end
+
+def fun_l7_n385(x)
+    if (x < 1)
+        fun_l8_n398(x)
+    else
+        fun_l8_n583(x)
+    end
+end
+
+def fun_l7_n386(x)
+    if (x < 1)
+        fun_l8_n483(x)
+    else
+        fun_l8_n80(x)
+    end
+end
+
+def fun_l7_n387(x)
+    if (x < 1)
+        fun_l8_n557(x)
+    else
+        fun_l8_n165(x)
+    end
+end
+
+def fun_l7_n388(x)
+    if (x < 1)
+        fun_l8_n335(x)
+    else
+        fun_l8_n656(x)
+    end
+end
+
+def fun_l7_n389(x)
+    if (x < 1)
+        fun_l8_n810(x)
+    else
+        fun_l8_n586(x)
+    end
+end
+
+def fun_l7_n390(x)
+    if (x < 1)
+        fun_l8_n90(x)
+    else
+        fun_l8_n788(x)
+    end
+end
+
+def fun_l7_n391(x)
+    if (x < 1)
+        fun_l8_n709(x)
+    else
+        fun_l8_n948(x)
+    end
+end
+
+def fun_l7_n392(x)
+    if (x < 1)
+        fun_l8_n139(x)
+    else
+        fun_l8_n631(x)
+    end
+end
+
+def fun_l7_n393(x)
+    if (x < 1)
+        fun_l8_n341(x)
+    else
+        fun_l8_n506(x)
+    end
+end
+
+def fun_l7_n394(x)
+    if (x < 1)
+        fun_l8_n435(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n395(x)
+    if (x < 1)
+        fun_l8_n186(x)
+    else
+        fun_l8_n58(x)
+    end
+end
+
+def fun_l7_n396(x)
+    if (x < 1)
+        fun_l8_n512(x)
+    else
+        fun_l8_n87(x)
+    end
+end
+
+def fun_l7_n397(x)
+    if (x < 1)
+        fun_l8_n763(x)
+    else
+        fun_l8_n220(x)
+    end
+end
+
+def fun_l7_n398(x)
+    if (x < 1)
+        fun_l8_n266(x)
+    else
+        fun_l8_n231(x)
+    end
+end
+
+def fun_l7_n399(x)
+    if (x < 1)
+        fun_l8_n308(x)
+    else
+        fun_l8_n512(x)
+    end
+end
+
+def fun_l7_n400(x)
+    if (x < 1)
+        fun_l8_n26(x)
+    else
+        fun_l8_n228(x)
+    end
+end
+
+def fun_l7_n401(x)
+    if (x < 1)
+        fun_l8_n143(x)
+    else
+        fun_l8_n826(x)
+    end
+end
+
+def fun_l7_n402(x)
+    if (x < 1)
+        fun_l8_n893(x)
+    else
+        fun_l8_n334(x)
+    end
+end
+
+def fun_l7_n403(x)
+    if (x < 1)
+        fun_l8_n9(x)
+    else
+        fun_l8_n867(x)
+    end
+end
+
+def fun_l7_n404(x)
+    if (x < 1)
+        fun_l8_n85(x)
+    else
+        fun_l8_n279(x)
+    end
+end
+
+def fun_l7_n405(x)
+    if (x < 1)
+        fun_l8_n30(x)
+    else
+        fun_l8_n85(x)
+    end
+end
+
+def fun_l7_n406(x)
+    if (x < 1)
+        fun_l8_n38(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n407(x)
+    if (x < 1)
+        fun_l8_n630(x)
+    else
+        fun_l8_n262(x)
+    end
+end
+
+def fun_l7_n408(x)
+    if (x < 1)
+        fun_l8_n430(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n409(x)
+    if (x < 1)
+        fun_l8_n131(x)
+    else
+        fun_l8_n66(x)
+    end
+end
+
+def fun_l7_n410(x)
+    if (x < 1)
+        fun_l8_n373(x)
+    else
+        fun_l8_n514(x)
+    end
+end
+
+def fun_l7_n411(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n591(x)
+    end
+end
+
+def fun_l7_n412(x)
+    if (x < 1)
+        fun_l8_n619(x)
+    else
+        fun_l8_n490(x)
+    end
+end
+
+def fun_l7_n413(x)
+    if (x < 1)
+        fun_l8_n318(x)
+    else
+        fun_l8_n456(x)
+    end
+end
+
+def fun_l7_n414(x)
+    if (x < 1)
+        fun_l8_n576(x)
+    else
+        fun_l8_n638(x)
+    end
+end
+
+def fun_l7_n415(x)
+    if (x < 1)
+        fun_l8_n407(x)
+    else
+        fun_l8_n44(x)
+    end
+end
+
+def fun_l7_n416(x)
+    if (x < 1)
+        fun_l8_n970(x)
+    else
+        fun_l8_n564(x)
+    end
+end
+
+def fun_l7_n417(x)
+    if (x < 1)
+        fun_l8_n163(x)
+    else
+        fun_l8_n533(x)
+    end
+end
+
+def fun_l7_n418(x)
+    if (x < 1)
+        fun_l8_n216(x)
+    else
+        fun_l8_n604(x)
+    end
+end
+
+def fun_l7_n419(x)
+    if (x < 1)
+        fun_l8_n505(x)
+    else
+        fun_l8_n620(x)
+    end
+end
+
+def fun_l7_n420(x)
+    if (x < 1)
+        fun_l8_n746(x)
+    else
+        fun_l8_n998(x)
+    end
+end
+
+def fun_l7_n421(x)
+    if (x < 1)
+        fun_l8_n266(x)
+    else
+        fun_l8_n762(x)
+    end
+end
+
+def fun_l7_n422(x)
+    if (x < 1)
+        fun_l8_n216(x)
+    else
+        fun_l8_n995(x)
+    end
+end
+
+def fun_l7_n423(x)
+    if (x < 1)
+        fun_l8_n824(x)
+    else
+        fun_l8_n349(x)
+    end
+end
+
+def fun_l7_n424(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n425(x)
+    if (x < 1)
+        fun_l8_n286(x)
+    else
+        fun_l8_n213(x)
+    end
+end
+
+def fun_l7_n426(x)
+    if (x < 1)
+        fun_l8_n794(x)
+    else
+        fun_l8_n428(x)
+    end
+end
+
+def fun_l7_n427(x)
+    if (x < 1)
+        fun_l8_n404(x)
+    else
+        fun_l8_n202(x)
+    end
+end
+
+def fun_l7_n428(x)
+    if (x < 1)
+        fun_l8_n571(x)
+    else
+        fun_l8_n812(x)
+    end
+end
+
+def fun_l7_n429(x)
+    if (x < 1)
+        fun_l8_n165(x)
+    else
+        fun_l8_n277(x)
+    end
+end
+
+def fun_l7_n430(x)
+    if (x < 1)
+        fun_l8_n138(x)
+    else
+        fun_l8_n230(x)
+    end
+end
+
+def fun_l7_n431(x)
+    if (x < 1)
+        fun_l8_n832(x)
+    else
+        fun_l8_n78(x)
+    end
+end
+
+def fun_l7_n432(x)
+    if (x < 1)
+        fun_l8_n866(x)
+    else
+        fun_l8_n137(x)
+    end
+end
+
+def fun_l7_n433(x)
+    if (x < 1)
+        fun_l8_n92(x)
+    else
+        fun_l8_n638(x)
+    end
+end
+
+def fun_l7_n434(x)
+    if (x < 1)
+        fun_l8_n788(x)
+    else
+        fun_l8_n991(x)
+    end
+end
+
+def fun_l7_n435(x)
+    if (x < 1)
+        fun_l8_n584(x)
+    else
+        fun_l8_n783(x)
+    end
+end
+
+def fun_l7_n436(x)
+    if (x < 1)
+        fun_l8_n786(x)
+    else
+        fun_l8_n771(x)
+    end
+end
+
+def fun_l7_n437(x)
+    if (x < 1)
+        fun_l8_n650(x)
+    else
+        fun_l8_n684(x)
+    end
+end
+
+def fun_l7_n438(x)
+    if (x < 1)
+        fun_l8_n964(x)
+    else
+        fun_l8_n738(x)
+    end
+end
+
+def fun_l7_n439(x)
+    if (x < 1)
+        fun_l8_n356(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n440(x)
+    if (x < 1)
+        fun_l8_n630(x)
+    else
+        fun_l8_n79(x)
+    end
+end
+
+def fun_l7_n441(x)
+    if (x < 1)
+        fun_l8_n326(x)
+    else
+        fun_l8_n667(x)
+    end
+end
+
+def fun_l7_n442(x)
+    if (x < 1)
+        fun_l8_n561(x)
+    else
+        fun_l8_n263(x)
+    end
+end
+
+def fun_l7_n443(x)
+    if (x < 1)
+        fun_l8_n62(x)
+    else
+        fun_l8_n528(x)
+    end
+end
+
+def fun_l7_n444(x)
+    if (x < 1)
+        fun_l8_n156(x)
+    else
+        fun_l8_n496(x)
+    end
+end
+
+def fun_l7_n445(x)
+    if (x < 1)
+        fun_l8_n971(x)
+    else
+        fun_l8_n853(x)
+    end
+end
+
+def fun_l7_n446(x)
+    if (x < 1)
+        fun_l8_n217(x)
+    else
+        fun_l8_n985(x)
+    end
+end
+
+def fun_l7_n447(x)
+    if (x < 1)
+        fun_l8_n569(x)
+    else
+        fun_l8_n320(x)
+    end
+end
+
+def fun_l7_n448(x)
+    if (x < 1)
+        fun_l8_n133(x)
+    else
+        fun_l8_n417(x)
+    end
+end
+
+def fun_l7_n449(x)
+    if (x < 1)
+        fun_l8_n369(x)
+    else
+        fun_l8_n25(x)
+    end
+end
+
+def fun_l7_n450(x)
+    if (x < 1)
+        fun_l8_n735(x)
+    else
+        fun_l8_n573(x)
+    end
+end
+
+def fun_l7_n451(x)
+    if (x < 1)
+        fun_l8_n764(x)
+    else
+        fun_l8_n247(x)
+    end
+end
+
+def fun_l7_n452(x)
+    if (x < 1)
+        fun_l8_n512(x)
+    else
+        fun_l8_n274(x)
+    end
+end
+
+def fun_l7_n453(x)
+    if (x < 1)
+        fun_l8_n388(x)
+    else
+        fun_l8_n438(x)
+    end
+end
+
+def fun_l7_n454(x)
+    if (x < 1)
+        fun_l8_n565(x)
+    else
+        fun_l8_n449(x)
+    end
+end
+
+def fun_l7_n455(x)
+    if (x < 1)
+        fun_l8_n771(x)
+    else
+        fun_l8_n827(x)
+    end
+end
+
+def fun_l7_n456(x)
+    if (x < 1)
+        fun_l8_n538(x)
+    else
+        fun_l8_n270(x)
+    end
+end
+
+def fun_l7_n457(x)
+    if (x < 1)
+        fun_l8_n288(x)
+    else
+        fun_l8_n325(x)
+    end
+end
+
+def fun_l7_n458(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n334(x)
+    end
+end
+
+def fun_l7_n459(x)
+    if (x < 1)
+        fun_l8_n696(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n460(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n580(x)
+    end
+end
+
+def fun_l7_n461(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n162(x)
+    end
+end
+
+def fun_l7_n462(x)
+    if (x < 1)
+        fun_l8_n541(x)
+    else
+        fun_l8_n493(x)
+    end
+end
+
+def fun_l7_n463(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n302(x)
+    end
+end
+
+def fun_l7_n464(x)
+    if (x < 1)
+        fun_l8_n44(x)
+    else
+        fun_l8_n677(x)
+    end
+end
+
+def fun_l7_n465(x)
+    if (x < 1)
+        fun_l8_n312(x)
+    else
+        fun_l8_n716(x)
+    end
+end
+
+def fun_l7_n466(x)
+    if (x < 1)
+        fun_l8_n252(x)
+    else
+        fun_l8_n827(x)
+    end
+end
+
+def fun_l7_n467(x)
+    if (x < 1)
+        fun_l8_n871(x)
+    else
+        fun_l8_n962(x)
+    end
+end
+
+def fun_l7_n468(x)
+    if (x < 1)
+        fun_l8_n323(x)
+    else
+        fun_l8_n813(x)
+    end
+end
+
+def fun_l7_n469(x)
+    if (x < 1)
+        fun_l8_n100(x)
+    else
+        fun_l8_n905(x)
+    end
+end
+
+def fun_l7_n470(x)
+    if (x < 1)
+        fun_l8_n95(x)
+    else
+        fun_l8_n96(x)
+    end
+end
+
+def fun_l7_n471(x)
+    if (x < 1)
+        fun_l8_n398(x)
+    else
+        fun_l8_n40(x)
+    end
+end
+
+def fun_l7_n472(x)
+    if (x < 1)
+        fun_l8_n280(x)
+    else
+        fun_l8_n34(x)
+    end
+end
+
+def fun_l7_n473(x)
+    if (x < 1)
+        fun_l8_n262(x)
+    else
+        fun_l8_n399(x)
+    end
+end
+
+def fun_l7_n474(x)
+    if (x < 1)
+        fun_l8_n126(x)
+    else
+        fun_l8_n208(x)
+    end
+end
+
+def fun_l7_n475(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n697(x)
+    end
+end
+
+def fun_l7_n476(x)
+    if (x < 1)
+        fun_l8_n617(x)
+    else
+        fun_l8_n822(x)
+    end
+end
+
+def fun_l7_n477(x)
+    if (x < 1)
+        fun_l8_n24(x)
+    else
+        fun_l8_n300(x)
+    end
+end
+
+def fun_l7_n478(x)
+    if (x < 1)
+        fun_l8_n864(x)
+    else
+        fun_l8_n357(x)
+    end
+end
+
+def fun_l7_n479(x)
+    if (x < 1)
+        fun_l8_n231(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n480(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n49(x)
+    end
+end
+
+def fun_l7_n481(x)
+    if (x < 1)
+        fun_l8_n43(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n482(x)
+    if (x < 1)
+        fun_l8_n617(x)
+    else
+        fun_l8_n752(x)
+    end
+end
+
+def fun_l7_n483(x)
+    if (x < 1)
+        fun_l8_n65(x)
+    else
+        fun_l8_n796(x)
+    end
+end
+
+def fun_l7_n484(x)
+    if (x < 1)
+        fun_l8_n960(x)
+    else
+        fun_l8_n174(x)
+    end
+end
+
+def fun_l7_n485(x)
+    if (x < 1)
+        fun_l8_n383(x)
+    else
+        fun_l8_n50(x)
+    end
+end
+
+def fun_l7_n486(x)
+    if (x < 1)
+        fun_l8_n269(x)
+    else
+        fun_l8_n413(x)
+    end
+end
+
+def fun_l7_n487(x)
+    if (x < 1)
+        fun_l8_n762(x)
+    else
+        fun_l8_n368(x)
+    end
+end
+
+def fun_l7_n488(x)
+    if (x < 1)
+        fun_l8_n635(x)
+    else
+        fun_l8_n900(x)
+    end
+end
+
+def fun_l7_n489(x)
+    if (x < 1)
+        fun_l8_n707(x)
+    else
+        fun_l8_n376(x)
+    end
+end
+
+def fun_l7_n490(x)
+    if (x < 1)
+        fun_l8_n215(x)
+    else
+        fun_l8_n255(x)
+    end
+end
+
+def fun_l7_n491(x)
+    if (x < 1)
+        fun_l8_n730(x)
+    else
+        fun_l8_n489(x)
+    end
+end
+
+def fun_l7_n492(x)
+    if (x < 1)
+        fun_l8_n896(x)
+    else
+        fun_l8_n501(x)
+    end
+end
+
+def fun_l7_n493(x)
+    if (x < 1)
+        fun_l8_n359(x)
+    else
+        fun_l8_n876(x)
+    end
+end
+
+def fun_l7_n494(x)
+    if (x < 1)
+        fun_l8_n13(x)
+    else
+        fun_l8_n669(x)
+    end
+end
+
+def fun_l7_n495(x)
+    if (x < 1)
+        fun_l8_n442(x)
+    else
+        fun_l8_n975(x)
+    end
+end
+
+def fun_l7_n496(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n240(x)
+    end
+end
+
+def fun_l7_n497(x)
+    if (x < 1)
+        fun_l8_n174(x)
+    else
+        fun_l8_n416(x)
+    end
+end
+
+def fun_l7_n498(x)
+    if (x < 1)
+        fun_l8_n141(x)
+    else
+        fun_l8_n231(x)
+    end
+end
+
+def fun_l7_n499(x)
+    if (x < 1)
+        fun_l8_n868(x)
+    else
+        fun_l8_n370(x)
+    end
+end
+
+def fun_l7_n500(x)
+    if (x < 1)
+        fun_l8_n888(x)
+    else
+        fun_l8_n525(x)
+    end
+end
+
+def fun_l7_n501(x)
+    if (x < 1)
+        fun_l8_n418(x)
+    else
+        fun_l8_n402(x)
+    end
+end
+
+def fun_l7_n502(x)
+    if (x < 1)
+        fun_l8_n910(x)
+    else
+        fun_l8_n308(x)
+    end
+end
+
+def fun_l7_n503(x)
+    if (x < 1)
+        fun_l8_n435(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n504(x)
+    if (x < 1)
+        fun_l8_n716(x)
+    else
+        fun_l8_n768(x)
+    end
+end
+
+def fun_l7_n505(x)
+    if (x < 1)
+        fun_l8_n690(x)
+    else
+        fun_l8_n382(x)
+    end
+end
+
+def fun_l7_n506(x)
+    if (x < 1)
+        fun_l8_n786(x)
+    else
+        fun_l8_n270(x)
+    end
+end
+
+def fun_l7_n507(x)
+    if (x < 1)
+        fun_l8_n317(x)
+    else
+        fun_l8_n802(x)
+    end
+end
+
+def fun_l7_n508(x)
+    if (x < 1)
+        fun_l8_n423(x)
+    else
+        fun_l8_n91(x)
+    end
+end
+
+def fun_l7_n509(x)
+    if (x < 1)
+        fun_l8_n853(x)
+    else
+        fun_l8_n434(x)
+    end
+end
+
+def fun_l7_n510(x)
+    if (x < 1)
+        fun_l8_n691(x)
+    else
+        fun_l8_n458(x)
+    end
+end
+
+def fun_l7_n511(x)
+    if (x < 1)
+        fun_l8_n806(x)
+    else
+        fun_l8_n989(x)
+    end
+end
+
+def fun_l7_n512(x)
+    if (x < 1)
+        fun_l8_n696(x)
+    else
+        fun_l8_n234(x)
+    end
+end
+
+def fun_l7_n513(x)
+    if (x < 1)
+        fun_l8_n370(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n514(x)
+    if (x < 1)
+        fun_l8_n889(x)
+    else
+        fun_l8_n306(x)
+    end
+end
+
+def fun_l7_n515(x)
+    if (x < 1)
+        fun_l8_n147(x)
+    else
+        fun_l8_n527(x)
+    end
+end
+
+def fun_l7_n516(x)
+    if (x < 1)
+        fun_l8_n18(x)
+    else
+        fun_l8_n120(x)
+    end
+end
+
+def fun_l7_n517(x)
+    if (x < 1)
+        fun_l8_n93(x)
+    else
+        fun_l8_n861(x)
+    end
+end
+
+def fun_l7_n518(x)
+    if (x < 1)
+        fun_l8_n954(x)
+    else
+        fun_l8_n864(x)
+    end
+end
+
+def fun_l7_n519(x)
+    if (x < 1)
+        fun_l8_n886(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n520(x)
+    if (x < 1)
+        fun_l8_n525(x)
+    else
+        fun_l8_n73(x)
+    end
+end
+
+def fun_l7_n521(x)
+    if (x < 1)
+        fun_l8_n550(x)
+    else
+        fun_l8_n638(x)
+    end
+end
+
+def fun_l7_n522(x)
+    if (x < 1)
+        fun_l8_n36(x)
+    else
+        fun_l8_n511(x)
+    end
+end
+
+def fun_l7_n523(x)
+    if (x < 1)
+        fun_l8_n346(x)
+    else
+        fun_l8_n257(x)
+    end
+end
+
+def fun_l7_n524(x)
+    if (x < 1)
+        fun_l8_n973(x)
+    else
+        fun_l8_n704(x)
+    end
+end
+
+def fun_l7_n525(x)
+    if (x < 1)
+        fun_l8_n21(x)
+    else
+        fun_l8_n354(x)
+    end
+end
+
+def fun_l7_n526(x)
+    if (x < 1)
+        fun_l8_n394(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n527(x)
+    if (x < 1)
+        fun_l8_n444(x)
+    else
+        fun_l8_n333(x)
+    end
+end
+
+def fun_l7_n528(x)
+    if (x < 1)
+        fun_l8_n743(x)
+    else
+        fun_l8_n579(x)
+    end
+end
+
+def fun_l7_n529(x)
+    if (x < 1)
+        fun_l8_n135(x)
+    else
+        fun_l8_n69(x)
+    end
+end
+
+def fun_l7_n530(x)
+    if (x < 1)
+        fun_l8_n66(x)
+    else
+        fun_l8_n6(x)
+    end
+end
+
+def fun_l7_n531(x)
+    if (x < 1)
+        fun_l8_n84(x)
+    else
+        fun_l8_n392(x)
+    end
+end
+
+def fun_l7_n532(x)
+    if (x < 1)
+        fun_l8_n178(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n533(x)
+    if (x < 1)
+        fun_l8_n695(x)
+    else
+        fun_l8_n696(x)
+    end
+end
+
+def fun_l7_n534(x)
+    if (x < 1)
+        fun_l8_n266(x)
+    else
+        fun_l8_n8(x)
+    end
+end
+
+def fun_l7_n535(x)
+    if (x < 1)
+        fun_l8_n806(x)
+    else
+        fun_l8_n878(x)
+    end
+end
+
+def fun_l7_n536(x)
+    if (x < 1)
+        fun_l8_n775(x)
+    else
+        fun_l8_n778(x)
+    end
+end
+
+def fun_l7_n537(x)
+    if (x < 1)
+        fun_l8_n133(x)
+    else
+        fun_l8_n552(x)
+    end
+end
+
+def fun_l7_n538(x)
+    if (x < 1)
+        fun_l8_n71(x)
+    else
+        fun_l8_n786(x)
+    end
+end
+
+def fun_l7_n539(x)
+    if (x < 1)
+        fun_l8_n679(x)
+    else
+        fun_l8_n407(x)
+    end
+end
+
+def fun_l7_n540(x)
+    if (x < 1)
+        fun_l8_n532(x)
+    else
+        fun_l8_n75(x)
+    end
+end
+
+def fun_l7_n541(x)
+    if (x < 1)
+        fun_l8_n367(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n542(x)
+    if (x < 1)
+        fun_l8_n74(x)
+    else
+        fun_l8_n374(x)
+    end
+end
+
+def fun_l7_n543(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n874(x)
+    end
+end
+
+def fun_l7_n544(x)
+    if (x < 1)
+        fun_l8_n774(x)
+    else
+        fun_l8_n750(x)
+    end
+end
+
+def fun_l7_n545(x)
+    if (x < 1)
+        fun_l8_n503(x)
+    else
+        fun_l8_n933(x)
+    end
+end
+
+def fun_l7_n546(x)
+    if (x < 1)
+        fun_l8_n125(x)
+    else
+        fun_l8_n570(x)
+    end
+end
+
+def fun_l7_n547(x)
+    if (x < 1)
+        fun_l8_n743(x)
+    else
+        fun_l8_n506(x)
+    end
+end
+
+def fun_l7_n548(x)
+    if (x < 1)
+        fun_l8_n297(x)
+    else
+        fun_l8_n70(x)
+    end
+end
+
+def fun_l7_n549(x)
+    if (x < 1)
+        fun_l8_n692(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n550(x)
+    if (x < 1)
+        fun_l8_n446(x)
+    else
+        fun_l8_n432(x)
+    end
+end
+
+def fun_l7_n551(x)
+    if (x < 1)
+        fun_l8_n947(x)
+    else
+        fun_l8_n429(x)
+    end
+end
+
+def fun_l7_n552(x)
+    if (x < 1)
+        fun_l8_n417(x)
+    else
+        fun_l8_n136(x)
+    end
+end
+
+def fun_l7_n553(x)
+    if (x < 1)
+        fun_l8_n236(x)
+    else
+        fun_l8_n291(x)
+    end
+end
+
+def fun_l7_n554(x)
+    if (x < 1)
+        fun_l8_n60(x)
+    else
+        fun_l8_n328(x)
+    end
+end
+
+def fun_l7_n555(x)
+    if (x < 1)
+        fun_l8_n97(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n556(x)
+    if (x < 1)
+        fun_l8_n158(x)
+    else
+        fun_l8_n603(x)
+    end
+end
+
+def fun_l7_n557(x)
+    if (x < 1)
+        fun_l8_n328(x)
+    else
+        fun_l8_n725(x)
+    end
+end
+
+def fun_l7_n558(x)
+    if (x < 1)
+        fun_l8_n25(x)
+    else
+        fun_l8_n933(x)
+    end
+end
+
+def fun_l7_n559(x)
+    if (x < 1)
+        fun_l8_n352(x)
+    else
+        fun_l8_n552(x)
+    end
+end
+
+def fun_l7_n560(x)
+    if (x < 1)
+        fun_l8_n427(x)
+    else
+        fun_l8_n91(x)
+    end
+end
+
+def fun_l7_n561(x)
+    if (x < 1)
+        fun_l8_n293(x)
+    else
+        fun_l8_n749(x)
+    end
+end
+
+def fun_l7_n562(x)
+    if (x < 1)
+        fun_l8_n672(x)
+    else
+        fun_l8_n905(x)
+    end
+end
+
+def fun_l7_n563(x)
+    if (x < 1)
+        fun_l8_n201(x)
+    else
+        fun_l8_n668(x)
+    end
+end
+
+def fun_l7_n564(x)
+    if (x < 1)
+        fun_l8_n109(x)
+    else
+        fun_l8_n401(x)
+    end
+end
+
+def fun_l7_n565(x)
+    if (x < 1)
+        fun_l8_n678(x)
+    else
+        fun_l8_n890(x)
+    end
+end
+
+def fun_l7_n566(x)
+    if (x < 1)
+        fun_l8_n876(x)
+    else
+        fun_l8_n129(x)
+    end
+end
+
+def fun_l7_n567(x)
+    if (x < 1)
+        fun_l8_n908(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n568(x)
+    if (x < 1)
+        fun_l8_n899(x)
+    else
+        fun_l8_n792(x)
+    end
+end
+
+def fun_l7_n569(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n441(x)
+    end
+end
+
+def fun_l7_n570(x)
+    if (x < 1)
+        fun_l8_n338(x)
+    else
+        fun_l8_n877(x)
+    end
+end
+
+def fun_l7_n571(x)
+    if (x < 1)
+        fun_l8_n684(x)
+    else
+        fun_l8_n167(x)
+    end
+end
+
+def fun_l7_n572(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n239(x)
+    end
+end
+
+def fun_l7_n573(x)
+    if (x < 1)
+        fun_l8_n925(x)
+    else
+        fun_l8_n648(x)
+    end
+end
+
+def fun_l7_n574(x)
+    if (x < 1)
+        fun_l8_n825(x)
+    else
+        fun_l8_n811(x)
+    end
+end
+
+def fun_l7_n575(x)
+    if (x < 1)
+        fun_l8_n348(x)
+    else
+        fun_l8_n994(x)
+    end
+end
+
+def fun_l7_n576(x)
+    if (x < 1)
+        fun_l8_n721(x)
+    else
+        fun_l8_n584(x)
+    end
+end
+
+def fun_l7_n577(x)
+    if (x < 1)
+        fun_l8_n827(x)
+    else
+        fun_l8_n968(x)
+    end
+end
+
+def fun_l7_n578(x)
+    if (x < 1)
+        fun_l8_n649(x)
+    else
+        fun_l8_n684(x)
+    end
+end
+
+def fun_l7_n579(x)
+    if (x < 1)
+        fun_l8_n43(x)
+    else
+        fun_l8_n183(x)
+    end
+end
+
+def fun_l7_n580(x)
+    if (x < 1)
+        fun_l8_n516(x)
+    else
+        fun_l8_n893(x)
+    end
+end
+
+def fun_l7_n581(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n677(x)
+    end
+end
+
+def fun_l7_n582(x)
+    if (x < 1)
+        fun_l8_n731(x)
+    else
+        fun_l8_n922(x)
+    end
+end
+
+def fun_l7_n583(x)
+    if (x < 1)
+        fun_l8_n653(x)
+    else
+        fun_l8_n403(x)
+    end
+end
+
+def fun_l7_n584(x)
+    if (x < 1)
+        fun_l8_n534(x)
+    else
+        fun_l8_n155(x)
+    end
+end
+
+def fun_l7_n585(x)
+    if (x < 1)
+        fun_l8_n1(x)
+    else
+        fun_l8_n903(x)
+    end
+end
+
+def fun_l7_n586(x)
+    if (x < 1)
+        fun_l8_n956(x)
+    else
+        fun_l8_n182(x)
+    end
+end
+
+def fun_l7_n587(x)
+    if (x < 1)
+        fun_l8_n590(x)
+    else
+        fun_l8_n707(x)
+    end
+end
+
+def fun_l7_n588(x)
+    if (x < 1)
+        fun_l8_n74(x)
+    else
+        fun_l8_n612(x)
+    end
+end
+
+def fun_l7_n589(x)
+    if (x < 1)
+        fun_l8_n17(x)
+    else
+        fun_l8_n193(x)
+    end
+end
+
+def fun_l7_n590(x)
+    if (x < 1)
+        fun_l8_n650(x)
+    else
+        fun_l8_n863(x)
+    end
+end
+
+def fun_l7_n591(x)
+    if (x < 1)
+        fun_l8_n974(x)
+    else
+        fun_l8_n932(x)
+    end
+end
+
+def fun_l7_n592(x)
+    if (x < 1)
+        fun_l8_n17(x)
+    else
+        fun_l8_n537(x)
+    end
+end
+
+def fun_l7_n593(x)
+    if (x < 1)
+        fun_l8_n118(x)
+    else
+        fun_l8_n588(x)
+    end
+end
+
+def fun_l7_n594(x)
+    if (x < 1)
+        fun_l8_n241(x)
+    else
+        fun_l8_n929(x)
+    end
+end
+
+def fun_l7_n595(x)
+    if (x < 1)
+        fun_l8_n667(x)
+    else
+        fun_l8_n251(x)
+    end
+end
+
+def fun_l7_n596(x)
+    if (x < 1)
+        fun_l8_n473(x)
+    else
+        fun_l8_n189(x)
+    end
+end
+
+def fun_l7_n597(x)
+    if (x < 1)
+        fun_l8_n687(x)
+    else
+        fun_l8_n666(x)
+    end
+end
+
+def fun_l7_n598(x)
+    if (x < 1)
+        fun_l8_n700(x)
+    else
+        fun_l8_n294(x)
+    end
+end
+
+def fun_l7_n599(x)
+    if (x < 1)
+        fun_l8_n144(x)
+    else
+        fun_l8_n656(x)
+    end
+end
+
+def fun_l7_n600(x)
+    if (x < 1)
+        fun_l8_n375(x)
+    else
+        fun_l8_n571(x)
+    end
+end
+
+def fun_l7_n601(x)
+    if (x < 1)
+        fun_l8_n506(x)
+    else
+        fun_l8_n212(x)
+    end
+end
+
+def fun_l7_n602(x)
+    if (x < 1)
+        fun_l8_n770(x)
+    else
+        fun_l8_n491(x)
+    end
+end
+
+def fun_l7_n603(x)
+    if (x < 1)
+        fun_l8_n325(x)
+    else
+        fun_l8_n660(x)
+    end
+end
+
+def fun_l7_n604(x)
+    if (x < 1)
+        fun_l8_n255(x)
+    else
+        fun_l8_n842(x)
+    end
+end
+
+def fun_l7_n605(x)
+    if (x < 1)
+        fun_l8_n149(x)
+    else
+        fun_l8_n648(x)
+    end
+end
+
+def fun_l7_n606(x)
+    if (x < 1)
+        fun_l8_n845(x)
+    else
+        fun_l8_n248(x)
+    end
+end
+
+def fun_l7_n607(x)
+    if (x < 1)
+        fun_l8_n484(x)
+    else
+        fun_l8_n333(x)
+    end
+end
+
+def fun_l7_n608(x)
+    if (x < 1)
+        fun_l8_n287(x)
+    else
+        fun_l8_n341(x)
+    end
+end
+
+def fun_l7_n609(x)
+    if (x < 1)
+        fun_l8_n873(x)
+    else
+        fun_l8_n113(x)
+    end
+end
+
+def fun_l7_n610(x)
+    if (x < 1)
+        fun_l8_n45(x)
+    else
+        fun_l8_n994(x)
+    end
+end
+
+def fun_l7_n611(x)
+    if (x < 1)
+        fun_l8_n427(x)
+    else
+        fun_l8_n359(x)
+    end
+end
+
+def fun_l7_n612(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n189(x)
+    end
+end
+
+def fun_l7_n613(x)
+    if (x < 1)
+        fun_l8_n25(x)
+    else
+        fun_l8_n564(x)
+    end
+end
+
+def fun_l7_n614(x)
+    if (x < 1)
+        fun_l8_n789(x)
+    else
+        fun_l8_n441(x)
+    end
+end
+
+def fun_l7_n615(x)
+    if (x < 1)
+        fun_l8_n353(x)
+    else
+        fun_l8_n217(x)
+    end
+end
+
+def fun_l7_n616(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n559(x)
+    end
+end
+
+def fun_l7_n617(x)
+    if (x < 1)
+        fun_l8_n709(x)
+    else
+        fun_l8_n764(x)
+    end
+end
+
+def fun_l7_n618(x)
+    if (x < 1)
+        fun_l8_n710(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n619(x)
+    if (x < 1)
+        fun_l8_n246(x)
+    else
+        fun_l8_n88(x)
+    end
+end
+
+def fun_l7_n620(x)
+    if (x < 1)
+        fun_l8_n259(x)
+    else
+        fun_l8_n813(x)
+    end
+end
+
+def fun_l7_n621(x)
+    if (x < 1)
+        fun_l8_n250(x)
+    else
+        fun_l8_n566(x)
+    end
+end
+
+def fun_l7_n622(x)
+    if (x < 1)
+        fun_l8_n223(x)
+    else
+        fun_l8_n627(x)
+    end
+end
+
+def fun_l7_n623(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n604(x)
+    end
+end
+
+def fun_l7_n624(x)
+    if (x < 1)
+        fun_l8_n405(x)
+    else
+        fun_l8_n850(x)
+    end
+end
+
+def fun_l7_n625(x)
+    if (x < 1)
+        fun_l8_n278(x)
+    else
+        fun_l8_n643(x)
+    end
+end
+
+def fun_l7_n626(x)
+    if (x < 1)
+        fun_l8_n359(x)
+    else
+        fun_l8_n167(x)
+    end
+end
+
+def fun_l7_n627(x)
+    if (x < 1)
+        fun_l8_n589(x)
+    else
+        fun_l8_n656(x)
+    end
+end
+
+def fun_l7_n628(x)
+    if (x < 1)
+        fun_l8_n612(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n629(x)
+    if (x < 1)
+        fun_l8_n845(x)
+    else
+        fun_l8_n469(x)
+    end
+end
+
+def fun_l7_n630(x)
+    if (x < 1)
+        fun_l8_n833(x)
+    else
+        fun_l8_n92(x)
+    end
+end
+
+def fun_l7_n631(x)
+    if (x < 1)
+        fun_l8_n411(x)
+    else
+        fun_l8_n815(x)
+    end
+end
+
+def fun_l7_n632(x)
+    if (x < 1)
+        fun_l8_n844(x)
+    else
+        fun_l8_n349(x)
+    end
+end
+
+def fun_l7_n633(x)
+    if (x < 1)
+        fun_l8_n333(x)
+    else
+        fun_l8_n468(x)
+    end
+end
+
+def fun_l7_n634(x)
+    if (x < 1)
+        fun_l8_n12(x)
+    else
+        fun_l8_n727(x)
+    end
+end
+
+def fun_l7_n635(x)
+    if (x < 1)
+        fun_l8_n65(x)
+    else
+        fun_l8_n729(x)
+    end
+end
+
+def fun_l7_n636(x)
+    if (x < 1)
+        fun_l8_n54(x)
+    else
+        fun_l8_n524(x)
+    end
+end
+
+def fun_l7_n637(x)
+    if (x < 1)
+        fun_l8_n547(x)
+    else
+        fun_l8_n220(x)
+    end
+end
+
+def fun_l7_n638(x)
+    if (x < 1)
+        fun_l8_n679(x)
+    else
+        fun_l8_n693(x)
+    end
+end
+
+def fun_l7_n639(x)
+    if (x < 1)
+        fun_l8_n428(x)
+    else
+        fun_l8_n938(x)
+    end
+end
+
+def fun_l7_n640(x)
+    if (x < 1)
+        fun_l8_n779(x)
+    else
+        fun_l8_n323(x)
+    end
+end
+
+def fun_l7_n641(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n443(x)
+    end
+end
+
+def fun_l7_n642(x)
+    if (x < 1)
+        fun_l8_n623(x)
+    else
+        fun_l8_n361(x)
+    end
+end
+
+def fun_l7_n643(x)
+    if (x < 1)
+        fun_l8_n524(x)
+    else
+        fun_l8_n19(x)
+    end
+end
+
+def fun_l7_n644(x)
+    if (x < 1)
+        fun_l8_n77(x)
+    else
+        fun_l8_n696(x)
+    end
+end
+
+def fun_l7_n645(x)
+    if (x < 1)
+        fun_l8_n468(x)
+    else
+        fun_l8_n819(x)
+    end
+end
+
+def fun_l7_n646(x)
+    if (x < 1)
+        fun_l8_n319(x)
+    else
+        fun_l8_n921(x)
+    end
+end
+
+def fun_l7_n647(x)
+    if (x < 1)
+        fun_l8_n681(x)
+    else
+        fun_l8_n925(x)
+    end
+end
+
+def fun_l7_n648(x)
+    if (x < 1)
+        fun_l8_n146(x)
+    else
+        fun_l8_n451(x)
+    end
+end
+
+def fun_l7_n649(x)
+    if (x < 1)
+        fun_l8_n871(x)
+    else
+        fun_l8_n707(x)
+    end
+end
+
+def fun_l7_n650(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n556(x)
+    end
+end
+
+def fun_l7_n651(x)
+    if (x < 1)
+        fun_l8_n721(x)
+    else
+        fun_l8_n80(x)
+    end
+end
+
+def fun_l7_n652(x)
+    if (x < 1)
+        fun_l8_n110(x)
+    else
+        fun_l8_n529(x)
+    end
+end
+
+def fun_l7_n653(x)
+    if (x < 1)
+        fun_l8_n107(x)
+    else
+        fun_l8_n876(x)
+    end
+end
+
+def fun_l7_n654(x)
+    if (x < 1)
+        fun_l8_n902(x)
+    else
+        fun_l8_n45(x)
+    end
+end
+
+def fun_l7_n655(x)
+    if (x < 1)
+        fun_l8_n714(x)
+    else
+        fun_l8_n939(x)
+    end
+end
+
+def fun_l7_n656(x)
+    if (x < 1)
+        fun_l8_n761(x)
+    else
+        fun_l8_n940(x)
+    end
+end
+
+def fun_l7_n657(x)
+    if (x < 1)
+        fun_l8_n165(x)
+    else
+        fun_l8_n779(x)
+    end
+end
+
+def fun_l7_n658(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n659(x)
+    if (x < 1)
+        fun_l8_n414(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n660(x)
+    if (x < 1)
+        fun_l8_n963(x)
+    else
+        fun_l8_n887(x)
+    end
+end
+
+def fun_l7_n661(x)
+    if (x < 1)
+        fun_l8_n71(x)
+    else
+        fun_l8_n249(x)
+    end
+end
+
+def fun_l7_n662(x)
+    if (x < 1)
+        fun_l8_n426(x)
+    else
+        fun_l8_n977(x)
+    end
+end
+
+def fun_l7_n663(x)
+    if (x < 1)
+        fun_l8_n924(x)
+    else
+        fun_l8_n606(x)
+    end
+end
+
+def fun_l7_n664(x)
+    if (x < 1)
+        fun_l8_n88(x)
+    else
+        fun_l8_n718(x)
+    end
+end
+
+def fun_l7_n665(x)
+    if (x < 1)
+        fun_l8_n611(x)
+    else
+        fun_l8_n898(x)
+    end
+end
+
+def fun_l7_n666(x)
+    if (x < 1)
+        fun_l8_n656(x)
+    else
+        fun_l8_n116(x)
+    end
+end
+
+def fun_l7_n667(x)
+    if (x < 1)
+        fun_l8_n196(x)
+    else
+        fun_l8_n688(x)
+    end
+end
+
+def fun_l7_n668(x)
+    if (x < 1)
+        fun_l8_n873(x)
+    else
+        fun_l8_n561(x)
+    end
+end
+
+def fun_l7_n669(x)
+    if (x < 1)
+        fun_l8_n947(x)
+    else
+        fun_l8_n64(x)
+    end
+end
+
+def fun_l7_n670(x)
+    if (x < 1)
+        fun_l8_n309(x)
+    else
+        fun_l8_n708(x)
+    end
+end
+
+def fun_l7_n671(x)
+    if (x < 1)
+        fun_l8_n699(x)
+    else
+        fun_l8_n218(x)
+    end
+end
+
+def fun_l7_n672(x)
+    if (x < 1)
+        fun_l8_n930(x)
+    else
+        fun_l8_n387(x)
+    end
+end
+
+def fun_l7_n673(x)
+    if (x < 1)
+        fun_l8_n598(x)
+    else
+        fun_l8_n245(x)
+    end
+end
+
+def fun_l7_n674(x)
+    if (x < 1)
+        fun_l8_n411(x)
+    else
+        fun_l8_n236(x)
+    end
+end
+
+def fun_l7_n675(x)
+    if (x < 1)
+        fun_l8_n193(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n676(x)
+    if (x < 1)
+        fun_l8_n2(x)
+    else
+        fun_l8_n253(x)
+    end
+end
+
+def fun_l7_n677(x)
+    if (x < 1)
+        fun_l8_n839(x)
+    else
+        fun_l8_n919(x)
+    end
+end
+
+def fun_l7_n678(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n245(x)
+    end
+end
+
+def fun_l7_n679(x)
+    if (x < 1)
+        fun_l8_n625(x)
+    else
+        fun_l8_n690(x)
+    end
+end
+
+def fun_l7_n680(x)
+    if (x < 1)
+        fun_l8_n899(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n681(x)
+    if (x < 1)
+        fun_l8_n894(x)
+    else
+        fun_l8_n92(x)
+    end
+end
+
+def fun_l7_n682(x)
+    if (x < 1)
+        fun_l8_n139(x)
+    else
+        fun_l8_n252(x)
+    end
+end
+
+def fun_l7_n683(x)
+    if (x < 1)
+        fun_l8_n978(x)
+    else
+        fun_l8_n84(x)
+    end
+end
+
+def fun_l7_n684(x)
+    if (x < 1)
+        fun_l8_n426(x)
+    else
+        fun_l8_n329(x)
+    end
+end
+
+def fun_l7_n685(x)
+    if (x < 1)
+        fun_l8_n241(x)
+    else
+        fun_l8_n780(x)
+    end
+end
+
+def fun_l7_n686(x)
+    if (x < 1)
+        fun_l8_n793(x)
+    else
+        fun_l8_n534(x)
+    end
+end
+
+def fun_l7_n687(x)
+    if (x < 1)
+        fun_l8_n409(x)
+    else
+        fun_l8_n152(x)
+    end
+end
+
+def fun_l7_n688(x)
+    if (x < 1)
+        fun_l8_n838(x)
+    else
+        fun_l8_n555(x)
+    end
+end
+
+def fun_l7_n689(x)
+    if (x < 1)
+        fun_l8_n634(x)
+    else
+        fun_l8_n27(x)
+    end
+end
+
+def fun_l7_n690(x)
+    if (x < 1)
+        fun_l8_n629(x)
+    else
+        fun_l8_n448(x)
+    end
+end
+
+def fun_l7_n691(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n293(x)
+    end
+end
+
+def fun_l7_n692(x)
+    if (x < 1)
+        fun_l8_n739(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n693(x)
+    if (x < 1)
+        fun_l8_n619(x)
+    else
+        fun_l8_n642(x)
+    end
+end
+
+def fun_l7_n694(x)
+    if (x < 1)
+        fun_l8_n123(x)
+    else
+        fun_l8_n880(x)
+    end
+end
+
+def fun_l7_n695(x)
+    if (x < 1)
+        fun_l8_n695(x)
+    else
+        fun_l8_n364(x)
+    end
+end
+
+def fun_l7_n696(x)
+    if (x < 1)
+        fun_l8_n610(x)
+    else
+        fun_l8_n798(x)
+    end
+end
+
+def fun_l7_n697(x)
+    if (x < 1)
+        fun_l8_n396(x)
+    else
+        fun_l8_n704(x)
+    end
+end
+
+def fun_l7_n698(x)
+    if (x < 1)
+        fun_l8_n759(x)
+    else
+        fun_l8_n880(x)
+    end
+end
+
+def fun_l7_n699(x)
+    if (x < 1)
+        fun_l8_n885(x)
+    else
+        fun_l8_n139(x)
+    end
+end
+
+def fun_l7_n700(x)
+    if (x < 1)
+        fun_l8_n244(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n701(x)
+    if (x < 1)
+        fun_l8_n698(x)
+    else
+        fun_l8_n949(x)
+    end
+end
+
+def fun_l7_n702(x)
+    if (x < 1)
+        fun_l8_n585(x)
+    else
+        fun_l8_n211(x)
+    end
+end
+
+def fun_l7_n703(x)
+    if (x < 1)
+        fun_l8_n834(x)
+    else
+        fun_l8_n111(x)
+    end
+end
+
+def fun_l7_n704(x)
+    if (x < 1)
+        fun_l8_n690(x)
+    else
+        fun_l8_n981(x)
+    end
+end
+
+def fun_l7_n705(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n392(x)
+    end
+end
+
+def fun_l7_n706(x)
+    if (x < 1)
+        fun_l8_n988(x)
+    else
+        fun_l8_n759(x)
+    end
+end
+
+def fun_l7_n707(x)
+    if (x < 1)
+        fun_l8_n917(x)
+    else
+        fun_l8_n326(x)
+    end
+end
+
+def fun_l7_n708(x)
+    if (x < 1)
+        fun_l8_n662(x)
+    else
+        fun_l8_n488(x)
+    end
+end
+
+def fun_l7_n709(x)
+    if (x < 1)
+        fun_l8_n530(x)
+    else
+        fun_l8_n663(x)
+    end
+end
+
+def fun_l7_n710(x)
+    if (x < 1)
+        fun_l8_n344(x)
+    else
+        fun_l8_n282(x)
+    end
+end
+
+def fun_l7_n711(x)
+    if (x < 1)
+        fun_l8_n908(x)
+    else
+        fun_l8_n405(x)
+    end
+end
+
+def fun_l7_n712(x)
+    if (x < 1)
+        fun_l8_n332(x)
+    else
+        fun_l8_n660(x)
+    end
+end
+
+def fun_l7_n713(x)
+    if (x < 1)
+        fun_l8_n37(x)
+    else
+        fun_l8_n689(x)
+    end
+end
+
+def fun_l7_n714(x)
+    if (x < 1)
+        fun_l8_n642(x)
+    else
+        fun_l8_n996(x)
+    end
+end
+
+def fun_l7_n715(x)
+    if (x < 1)
+        fun_l8_n322(x)
+    else
+        fun_l8_n609(x)
+    end
+end
+
+def fun_l7_n716(x)
+    if (x < 1)
+        fun_l8_n567(x)
+    else
+        fun_l8_n492(x)
+    end
+end
+
+def fun_l7_n717(x)
+    if (x < 1)
+        fun_l8_n934(x)
+    else
+        fun_l8_n353(x)
+    end
+end
+
+def fun_l7_n718(x)
+    if (x < 1)
+        fun_l8_n572(x)
+    else
+        fun_l8_n859(x)
+    end
+end
+
+def fun_l7_n719(x)
+    if (x < 1)
+        fun_l8_n777(x)
+    else
+        fun_l8_n810(x)
+    end
+end
+
+def fun_l7_n720(x)
+    if (x < 1)
+        fun_l8_n121(x)
+    else
+        fun_l8_n847(x)
+    end
+end
+
+def fun_l7_n721(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n484(x)
+    end
+end
+
+def fun_l7_n722(x)
+    if (x < 1)
+        fun_l8_n73(x)
+    else
+        fun_l8_n795(x)
+    end
+end
+
+def fun_l7_n723(x)
+    if (x < 1)
+        fun_l8_n950(x)
+    else
+        fun_l8_n382(x)
+    end
+end
+
+def fun_l7_n724(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n644(x)
+    end
+end
+
+def fun_l7_n725(x)
+    if (x < 1)
+        fun_l8_n480(x)
+    else
+        fun_l8_n262(x)
+    end
+end
+
+def fun_l7_n726(x)
+    if (x < 1)
+        fun_l8_n39(x)
+    else
+        fun_l8_n543(x)
+    end
+end
+
+def fun_l7_n727(x)
+    if (x < 1)
+        fun_l8_n934(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n728(x)
+    if (x < 1)
+        fun_l8_n312(x)
+    else
+        fun_l8_n341(x)
+    end
+end
+
+def fun_l7_n729(x)
+    if (x < 1)
+        fun_l8_n284(x)
+    else
+        fun_l8_n884(x)
+    end
+end
+
+def fun_l7_n730(x)
+    if (x < 1)
+        fun_l8_n841(x)
+    else
+        fun_l8_n221(x)
+    end
+end
+
+def fun_l7_n731(x)
+    if (x < 1)
+        fun_l8_n719(x)
+    else
+        fun_l8_n907(x)
+    end
+end
+
+def fun_l7_n732(x)
+    if (x < 1)
+        fun_l8_n422(x)
+    else
+        fun_l8_n65(x)
+    end
+end
+
+def fun_l7_n733(x)
+    if (x < 1)
+        fun_l8_n324(x)
+    else
+        fun_l8_n811(x)
+    end
+end
+
+def fun_l7_n734(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n622(x)
+    end
+end
+
+def fun_l7_n735(x)
+    if (x < 1)
+        fun_l8_n20(x)
+    else
+        fun_l8_n205(x)
+    end
+end
+
+def fun_l7_n736(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n908(x)
+    end
+end
+
+def fun_l7_n737(x)
+    if (x < 1)
+        fun_l8_n576(x)
+    else
+        fun_l8_n789(x)
+    end
+end
+
+def fun_l7_n738(x)
+    if (x < 1)
+        fun_l8_n353(x)
+    else
+        fun_l8_n286(x)
+    end
+end
+
+def fun_l7_n739(x)
+    if (x < 1)
+        fun_l8_n614(x)
+    else
+        fun_l8_n121(x)
+    end
+end
+
+def fun_l7_n740(x)
+    if (x < 1)
+        fun_l8_n79(x)
+    else
+        fun_l8_n637(x)
+    end
+end
+
+def fun_l7_n741(x)
+    if (x < 1)
+        fun_l8_n808(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n742(x)
+    if (x < 1)
+        fun_l8_n590(x)
+    else
+        fun_l8_n198(x)
+    end
+end
+
+def fun_l7_n743(x)
+    if (x < 1)
+        fun_l8_n498(x)
+    else
+        fun_l8_n379(x)
+    end
+end
+
+def fun_l7_n744(x)
+    if (x < 1)
+        fun_l8_n599(x)
+    else
+        fun_l8_n359(x)
+    end
+end
+
+def fun_l7_n745(x)
+    if (x < 1)
+        fun_l8_n898(x)
+    else
+        fun_l8_n520(x)
+    end
+end
+
+def fun_l7_n746(x)
+    if (x < 1)
+        fun_l8_n835(x)
+    else
+        fun_l8_n131(x)
+    end
+end
+
+def fun_l7_n747(x)
+    if (x < 1)
+        fun_l8_n648(x)
+    else
+        fun_l8_n248(x)
+    end
+end
+
+def fun_l7_n748(x)
+    if (x < 1)
+        fun_l8_n451(x)
+    else
+        fun_l8_n352(x)
+    end
+end
+
+def fun_l7_n749(x)
+    if (x < 1)
+        fun_l8_n69(x)
+    else
+        fun_l8_n974(x)
+    end
+end
+
+def fun_l7_n750(x)
+    if (x < 1)
+        fun_l8_n108(x)
+    else
+        fun_l8_n744(x)
+    end
+end
+
+def fun_l7_n751(x)
+    if (x < 1)
+        fun_l8_n171(x)
+    else
+        fun_l8_n305(x)
+    end
+end
+
+def fun_l7_n752(x)
+    if (x < 1)
+        fun_l8_n180(x)
+    else
+        fun_l8_n293(x)
+    end
+end
+
+def fun_l7_n753(x)
+    if (x < 1)
+        fun_l8_n555(x)
+    else
+        fun_l8_n882(x)
+    end
+end
+
+def fun_l7_n754(x)
+    if (x < 1)
+        fun_l8_n756(x)
+    else
+        fun_l8_n604(x)
+    end
+end
+
+def fun_l7_n755(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n708(x)
+    end
+end
+
+def fun_l7_n756(x)
+    if (x < 1)
+        fun_l8_n65(x)
+    else
+        fun_l8_n474(x)
+    end
+end
+
+def fun_l7_n757(x)
+    if (x < 1)
+        fun_l8_n43(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n758(x)
+    if (x < 1)
+        fun_l8_n90(x)
+    else
+        fun_l8_n968(x)
+    end
+end
+
+def fun_l7_n759(x)
+    if (x < 1)
+        fun_l8_n599(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n760(x)
+    if (x < 1)
+        fun_l8_n344(x)
+    else
+        fun_l8_n122(x)
+    end
+end
+
+def fun_l7_n761(x)
+    if (x < 1)
+        fun_l8_n289(x)
+    else
+        fun_l8_n867(x)
+    end
+end
+
+def fun_l7_n762(x)
+    if (x < 1)
+        fun_l8_n107(x)
+    else
+        fun_l8_n950(x)
+    end
+end
+
+def fun_l7_n763(x)
+    if (x < 1)
+        fun_l8_n405(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n764(x)
+    if (x < 1)
+        fun_l8_n91(x)
+    else
+        fun_l8_n760(x)
+    end
+end
+
+def fun_l7_n765(x)
+    if (x < 1)
+        fun_l8_n268(x)
+    else
+        fun_l8_n451(x)
+    end
+end
+
+def fun_l7_n766(x)
+    if (x < 1)
+        fun_l8_n693(x)
+    else
+        fun_l8_n150(x)
+    end
+end
+
+def fun_l7_n767(x)
+    if (x < 1)
+        fun_l8_n622(x)
+    else
+        fun_l8_n114(x)
+    end
+end
+
+def fun_l7_n768(x)
+    if (x < 1)
+        fun_l8_n662(x)
+    else
+        fun_l8_n514(x)
+    end
+end
+
+def fun_l7_n769(x)
+    if (x < 1)
+        fun_l8_n440(x)
+    else
+        fun_l8_n537(x)
+    end
+end
+
+def fun_l7_n770(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n513(x)
+    end
+end
+
+def fun_l7_n771(x)
+    if (x < 1)
+        fun_l8_n394(x)
+    else
+        fun_l8_n857(x)
+    end
+end
+
+def fun_l7_n772(x)
+    if (x < 1)
+        fun_l8_n635(x)
+    else
+        fun_l8_n696(x)
+    end
+end
+
+def fun_l7_n773(x)
+    if (x < 1)
+        fun_l8_n687(x)
+    else
+        fun_l8_n926(x)
+    end
+end
+
+def fun_l7_n774(x)
+    if (x < 1)
+        fun_l8_n54(x)
+    else
+        fun_l8_n410(x)
+    end
+end
+
+def fun_l7_n775(x)
+    if (x < 1)
+        fun_l8_n825(x)
+    else
+        fun_l8_n339(x)
+    end
+end
+
+def fun_l7_n776(x)
+    if (x < 1)
+        fun_l8_n130(x)
+    else
+        fun_l8_n48(x)
+    end
+end
+
+def fun_l7_n777(x)
+    if (x < 1)
+        fun_l8_n627(x)
+    else
+        fun_l8_n191(x)
+    end
+end
+
+def fun_l7_n778(x)
+    if (x < 1)
+        fun_l8_n843(x)
+    else
+        fun_l8_n627(x)
+    end
+end
+
+def fun_l7_n779(x)
+    if (x < 1)
+        fun_l8_n950(x)
+    else
+        fun_l8_n247(x)
+    end
+end
+
+def fun_l7_n780(x)
+    if (x < 1)
+        fun_l8_n865(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n781(x)
+    if (x < 1)
+        fun_l8_n440(x)
+    else
+        fun_l8_n326(x)
+    end
+end
+
+def fun_l7_n782(x)
+    if (x < 1)
+        fun_l8_n463(x)
+    else
+        fun_l8_n808(x)
+    end
+end
+
+def fun_l7_n783(x)
+    if (x < 1)
+        fun_l8_n44(x)
+    else
+        fun_l8_n888(x)
+    end
+end
+
+def fun_l7_n784(x)
+    if (x < 1)
+        fun_l8_n690(x)
+    else
+        fun_l8_n673(x)
+    end
+end
+
+def fun_l7_n785(x)
+    if (x < 1)
+        fun_l8_n641(x)
+    else
+        fun_l8_n367(x)
+    end
+end
+
+def fun_l7_n786(x)
+    if (x < 1)
+        fun_l8_n193(x)
+    else
+        fun_l8_n764(x)
+    end
+end
+
+def fun_l7_n787(x)
+    if (x < 1)
+        fun_l8_n604(x)
+    else
+        fun_l8_n527(x)
+    end
+end
+
+def fun_l7_n788(x)
+    if (x < 1)
+        fun_l8_n626(x)
+    else
+        fun_l8_n101(x)
+    end
+end
+
+def fun_l7_n789(x)
+    if (x < 1)
+        fun_l8_n152(x)
+    else
+        fun_l8_n9(x)
+    end
+end
+
+def fun_l7_n790(x)
+    if (x < 1)
+        fun_l8_n541(x)
+    else
+        fun_l8_n789(x)
+    end
+end
+
+def fun_l7_n791(x)
+    if (x < 1)
+        fun_l8_n706(x)
+    else
+        fun_l8_n577(x)
+    end
+end
+
+def fun_l7_n792(x)
+    if (x < 1)
+        fun_l8_n480(x)
+    else
+        fun_l8_n284(x)
+    end
+end
+
+def fun_l7_n793(x)
+    if (x < 1)
+        fun_l8_n157(x)
+    else
+        fun_l8_n620(x)
+    end
+end
+
+def fun_l7_n794(x)
+    if (x < 1)
+        fun_l8_n666(x)
+    else
+        fun_l8_n755(x)
+    end
+end
+
+def fun_l7_n795(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n20(x)
+    end
+end
+
+def fun_l7_n796(x)
+    if (x < 1)
+        fun_l8_n750(x)
+    else
+        fun_l8_n974(x)
+    end
+end
+
+def fun_l7_n797(x)
+    if (x < 1)
+        fun_l8_n812(x)
+    else
+        fun_l8_n915(x)
+    end
+end
+
+def fun_l7_n798(x)
+    if (x < 1)
+        fun_l8_n297(x)
+    else
+        fun_l8_n8(x)
+    end
+end
+
+def fun_l7_n799(x)
+    if (x < 1)
+        fun_l8_n385(x)
+    else
+        fun_l8_n920(x)
+    end
+end
+
+def fun_l7_n800(x)
+    if (x < 1)
+        fun_l8_n322(x)
+    else
+        fun_l8_n603(x)
+    end
+end
+
+def fun_l7_n801(x)
+    if (x < 1)
+        fun_l8_n825(x)
+    else
+        fun_l8_n702(x)
+    end
+end
+
+def fun_l7_n802(x)
+    if (x < 1)
+        fun_l8_n902(x)
+    else
+        fun_l8_n978(x)
+    end
+end
+
+def fun_l7_n803(x)
+    if (x < 1)
+        fun_l8_n921(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n804(x)
+    if (x < 1)
+        fun_l8_n171(x)
+    else
+        fun_l8_n630(x)
+    end
+end
+
+def fun_l7_n805(x)
+    if (x < 1)
+        fun_l8_n469(x)
+    else
+        fun_l8_n265(x)
+    end
+end
+
+def fun_l7_n806(x)
+    if (x < 1)
+        fun_l8_n367(x)
+    else
+        fun_l8_n820(x)
+    end
+end
+
+def fun_l7_n807(x)
+    if (x < 1)
+        fun_l8_n242(x)
+    else
+        fun_l8_n707(x)
+    end
+end
+
+def fun_l7_n808(x)
+    if (x < 1)
+        fun_l8_n512(x)
+    else
+        fun_l8_n139(x)
+    end
+end
+
+def fun_l7_n809(x)
+    if (x < 1)
+        fun_l8_n17(x)
+    else
+        fun_l8_n615(x)
+    end
+end
+
+def fun_l7_n810(x)
+    if (x < 1)
+        fun_l8_n600(x)
+    else
+        fun_l8_n6(x)
+    end
+end
+
+def fun_l7_n811(x)
+    if (x < 1)
+        fun_l8_n342(x)
+    else
+        fun_l8_n194(x)
+    end
+end
+
+def fun_l7_n812(x)
+    if (x < 1)
+        fun_l8_n191(x)
+    else
+        fun_l8_n864(x)
+    end
+end
+
+def fun_l7_n813(x)
+    if (x < 1)
+        fun_l8_n577(x)
+    else
+        fun_l8_n113(x)
+    end
+end
+
+def fun_l7_n814(x)
+    if (x < 1)
+        fun_l8_n729(x)
+    else
+        fun_l8_n989(x)
+    end
+end
+
+def fun_l7_n815(x)
+    if (x < 1)
+        fun_l8_n707(x)
+    else
+        fun_l8_n846(x)
+    end
+end
+
+def fun_l7_n816(x)
+    if (x < 1)
+        fun_l8_n874(x)
+    else
+        fun_l8_n790(x)
+    end
+end
+
+def fun_l7_n817(x)
+    if (x < 1)
+        fun_l8_n968(x)
+    else
+        fun_l8_n215(x)
+    end
+end
+
+def fun_l7_n818(x)
+    if (x < 1)
+        fun_l8_n444(x)
+    else
+        fun_l8_n182(x)
+    end
+end
+
+def fun_l7_n819(x)
+    if (x < 1)
+        fun_l8_n103(x)
+    else
+        fun_l8_n134(x)
+    end
+end
+
+def fun_l7_n820(x)
+    if (x < 1)
+        fun_l8_n718(x)
+    else
+        fun_l8_n950(x)
+    end
+end
+
+def fun_l7_n821(x)
+    if (x < 1)
+        fun_l8_n439(x)
+    else
+        fun_l8_n68(x)
+    end
+end
+
+def fun_l7_n822(x)
+    if (x < 1)
+        fun_l8_n961(x)
+    else
+        fun_l8_n593(x)
+    end
+end
+
+def fun_l7_n823(x)
+    if (x < 1)
+        fun_l8_n212(x)
+    else
+        fun_l8_n346(x)
+    end
+end
+
+def fun_l7_n824(x)
+    if (x < 1)
+        fun_l8_n926(x)
+    else
+        fun_l8_n225(x)
+    end
+end
+
+def fun_l7_n825(x)
+    if (x < 1)
+        fun_l8_n880(x)
+    else
+        fun_l8_n527(x)
+    end
+end
+
+def fun_l7_n826(x)
+    if (x < 1)
+        fun_l8_n13(x)
+    else
+        fun_l8_n436(x)
+    end
+end
+
+def fun_l7_n827(x)
+    if (x < 1)
+        fun_l8_n19(x)
+    else
+        fun_l8_n201(x)
+    end
+end
+
+def fun_l7_n828(x)
+    if (x < 1)
+        fun_l8_n568(x)
+    else
+        fun_l8_n450(x)
+    end
+end
+
+def fun_l7_n829(x)
+    if (x < 1)
+        fun_l8_n543(x)
+    else
+        fun_l8_n606(x)
+    end
+end
+
+def fun_l7_n830(x)
+    if (x < 1)
+        fun_l8_n503(x)
+    else
+        fun_l8_n104(x)
+    end
+end
+
+def fun_l7_n831(x)
+    if (x < 1)
+        fun_l8_n185(x)
+    else
+        fun_l8_n1(x)
+    end
+end
+
+def fun_l7_n832(x)
+    if (x < 1)
+        fun_l8_n598(x)
+    else
+        fun_l8_n637(x)
+    end
+end
+
+def fun_l7_n833(x)
+    if (x < 1)
+        fun_l8_n936(x)
+    else
+        fun_l8_n554(x)
+    end
+end
+
+def fun_l7_n834(x)
+    if (x < 1)
+        fun_l8_n864(x)
+    else
+        fun_l8_n766(x)
+    end
+end
+
+def fun_l7_n835(x)
+    if (x < 1)
+        fun_l8_n11(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n836(x)
+    if (x < 1)
+        fun_l8_n596(x)
+    else
+        fun_l8_n429(x)
+    end
+end
+
+def fun_l7_n837(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n838(x)
+    if (x < 1)
+        fun_l8_n905(x)
+    else
+        fun_l8_n605(x)
+    end
+end
+
+def fun_l7_n839(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n44(x)
+    end
+end
+
+def fun_l7_n840(x)
+    if (x < 1)
+        fun_l8_n195(x)
+    else
+        fun_l8_n368(x)
+    end
+end
+
+def fun_l7_n841(x)
+    if (x < 1)
+        fun_l8_n432(x)
+    else
+        fun_l8_n368(x)
+    end
+end
+
+def fun_l7_n842(x)
+    if (x < 1)
+        fun_l8_n145(x)
+    else
+        fun_l8_n180(x)
+    end
+end
+
+def fun_l7_n843(x)
+    if (x < 1)
+        fun_l8_n124(x)
+    else
+        fun_l8_n358(x)
+    end
+end
+
+def fun_l7_n844(x)
+    if (x < 1)
+        fun_l8_n87(x)
+    else
+        fun_l8_n364(x)
+    end
+end
+
+def fun_l7_n845(x)
+    if (x < 1)
+        fun_l8_n133(x)
+    else
+        fun_l8_n849(x)
+    end
+end
+
+def fun_l7_n846(x)
+    if (x < 1)
+        fun_l8_n686(x)
+    else
+        fun_l8_n556(x)
+    end
+end
+
+def fun_l7_n847(x)
+    if (x < 1)
+        fun_l8_n732(x)
+    else
+        fun_l8_n536(x)
+    end
+end
+
+def fun_l7_n848(x)
+    if (x < 1)
+        fun_l8_n950(x)
+    else
+        fun_l8_n173(x)
+    end
+end
+
+def fun_l7_n849(x)
+    if (x < 1)
+        fun_l8_n694(x)
+    else
+        fun_l8_n747(x)
+    end
+end
+
+def fun_l7_n850(x)
+    if (x < 1)
+        fun_l8_n421(x)
+    else
+        fun_l8_n940(x)
+    end
+end
+
+def fun_l7_n851(x)
+    if (x < 1)
+        fun_l8_n359(x)
+    else
+        fun_l8_n239(x)
+    end
+end
+
+def fun_l7_n852(x)
+    if (x < 1)
+        fun_l8_n731(x)
+    else
+        fun_l8_n530(x)
+    end
+end
+
+def fun_l7_n853(x)
+    if (x < 1)
+        fun_l8_n887(x)
+    else
+        fun_l8_n548(x)
+    end
+end
+
+def fun_l7_n854(x)
+    if (x < 1)
+        fun_l8_n47(x)
+    else
+        fun_l8_n675(x)
+    end
+end
+
+def fun_l7_n855(x)
+    if (x < 1)
+        fun_l8_n534(x)
+    else
+        fun_l8_n34(x)
+    end
+end
+
+def fun_l7_n856(x)
+    if (x < 1)
+        fun_l8_n935(x)
+    else
+        fun_l8_n402(x)
+    end
+end
+
+def fun_l7_n857(x)
+    if (x < 1)
+        fun_l8_n873(x)
+    else
+        fun_l8_n864(x)
+    end
+end
+
+def fun_l7_n858(x)
+    if (x < 1)
+        fun_l8_n325(x)
+    else
+        fun_l8_n495(x)
+    end
+end
+
+def fun_l7_n859(x)
+    if (x < 1)
+        fun_l8_n758(x)
+    else
+        fun_l8_n63(x)
+    end
+end
+
+def fun_l7_n860(x)
+    if (x < 1)
+        fun_l8_n811(x)
+    else
+        fun_l8_n150(x)
+    end
+end
+
+def fun_l7_n861(x)
+    if (x < 1)
+        fun_l8_n666(x)
+    else
+        fun_l8_n282(x)
+    end
+end
+
+def fun_l7_n862(x)
+    if (x < 1)
+        fun_l8_n123(x)
+    else
+        fun_l8_n893(x)
+    end
+end
+
+def fun_l7_n863(x)
+    if (x < 1)
+        fun_l8_n681(x)
+    else
+        fun_l8_n640(x)
+    end
+end
+
+def fun_l7_n864(x)
+    if (x < 1)
+        fun_l8_n861(x)
+    else
+        fun_l8_n922(x)
+    end
+end
+
+def fun_l7_n865(x)
+    if (x < 1)
+        fun_l8_n8(x)
+    else
+        fun_l8_n14(x)
+    end
+end
+
+def fun_l7_n866(x)
+    if (x < 1)
+        fun_l8_n713(x)
+    else
+        fun_l8_n802(x)
+    end
+end
+
+def fun_l7_n867(x)
+    if (x < 1)
+        fun_l8_n654(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n868(x)
+    if (x < 1)
+        fun_l8_n308(x)
+    else
+        fun_l8_n504(x)
+    end
+end
+
+def fun_l7_n869(x)
+    if (x < 1)
+        fun_l8_n67(x)
+    else
+        fun_l8_n592(x)
+    end
+end
+
+def fun_l7_n870(x)
+    if (x < 1)
+        fun_l8_n295(x)
+    else
+        fun_l8_n585(x)
+    end
+end
+
+def fun_l7_n871(x)
+    if (x < 1)
+        fun_l8_n121(x)
+    else
+        fun_l8_n797(x)
+    end
+end
+
+def fun_l7_n872(x)
+    if (x < 1)
+        fun_l8_n234(x)
+    else
+        fun_l8_n834(x)
+    end
+end
+
+def fun_l7_n873(x)
+    if (x < 1)
+        fun_l8_n287(x)
+    else
+        fun_l8_n731(x)
+    end
+end
+
+def fun_l7_n874(x)
+    if (x < 1)
+        fun_l8_n460(x)
+    else
+        fun_l8_n261(x)
+    end
+end
+
+def fun_l7_n875(x)
+    if (x < 1)
+        fun_l8_n211(x)
+    else
+        fun_l8_n199(x)
+    end
+end
+
+def fun_l7_n876(x)
+    if (x < 1)
+        fun_l8_n256(x)
+    else
+        fun_l8_n547(x)
+    end
+end
+
+def fun_l7_n877(x)
+    if (x < 1)
+        fun_l8_n560(x)
+    else
+        fun_l8_n202(x)
+    end
+end
+
+def fun_l7_n878(x)
+    if (x < 1)
+        fun_l8_n5(x)
+    else
+        fun_l8_n955(x)
+    end
+end
+
+def fun_l7_n879(x)
+    if (x < 1)
+        fun_l8_n908(x)
+    else
+        fun_l8_n677(x)
+    end
+end
+
+def fun_l7_n880(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n226(x)
+    end
+end
+
+def fun_l7_n881(x)
+    if (x < 1)
+        fun_l8_n970(x)
+    else
+        fun_l8_n939(x)
+    end
+end
+
+def fun_l7_n882(x)
+    if (x < 1)
+        fun_l8_n562(x)
+    else
+        fun_l8_n420(x)
+    end
+end
+
+def fun_l7_n883(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n35(x)
+    end
+end
+
+def fun_l7_n884(x)
+    if (x < 1)
+        fun_l8_n459(x)
+    else
+        fun_l8_n155(x)
+    end
+end
+
+def fun_l7_n885(x)
+    if (x < 1)
+        fun_l8_n257(x)
+    else
+        fun_l8_n704(x)
+    end
+end
+
+def fun_l7_n886(x)
+    if (x < 1)
+        fun_l8_n393(x)
+    else
+        fun_l8_n741(x)
+    end
+end
+
+def fun_l7_n887(x)
+    if (x < 1)
+        fun_l8_n333(x)
+    else
+        fun_l8_n225(x)
+    end
+end
+
+def fun_l7_n888(x)
+    if (x < 1)
+        fun_l8_n614(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n889(x)
+    if (x < 1)
+        fun_l8_n229(x)
+    else
+        fun_l8_n519(x)
+    end
+end
+
+def fun_l7_n890(x)
+    if (x < 1)
+        fun_l8_n651(x)
+    else
+        fun_l8_n68(x)
+    end
+end
+
+def fun_l7_n891(x)
+    if (x < 1)
+        fun_l8_n987(x)
+    else
+        fun_l8_n905(x)
+    end
+end
+
+def fun_l7_n892(x)
+    if (x < 1)
+        fun_l8_n698(x)
+    else
+        fun_l8_n942(x)
+    end
+end
+
+def fun_l7_n893(x)
+    if (x < 1)
+        fun_l8_n559(x)
+    else
+        fun_l8_n613(x)
+    end
+end
+
+def fun_l7_n894(x)
+    if (x < 1)
+        fun_l8_n402(x)
+    else
+        fun_l8_n966(x)
+    end
+end
+
+def fun_l7_n895(x)
+    if (x < 1)
+        fun_l8_n475(x)
+    else
+        fun_l8_n158(x)
+    end
+end
+
+def fun_l7_n896(x)
+    if (x < 1)
+        fun_l8_n420(x)
+    else
+        fun_l8_n113(x)
+    end
+end
+
+def fun_l7_n897(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n272(x)
+    end
+end
+
+def fun_l7_n898(x)
+    if (x < 1)
+        fun_l8_n252(x)
+    else
+        fun_l8_n821(x)
+    end
+end
+
+def fun_l7_n899(x)
+    if (x < 1)
+        fun_l8_n736(x)
+    else
+        fun_l8_n174(x)
+    end
+end
+
+def fun_l7_n900(x)
+    if (x < 1)
+        fun_l8_n151(x)
+    else
+        fun_l8_n611(x)
+    end
+end
+
+def fun_l7_n901(x)
+    if (x < 1)
+        fun_l8_n3(x)
+    else
+        fun_l8_n221(x)
+    end
+end
+
+def fun_l7_n902(x)
+    if (x < 1)
+        fun_l8_n319(x)
+    else
+        fun_l8_n930(x)
+    end
+end
+
+def fun_l7_n903(x)
+    if (x < 1)
+        fun_l8_n619(x)
+    else
+        fun_l8_n491(x)
+    end
+end
+
+def fun_l7_n904(x)
+    if (x < 1)
+        fun_l8_n144(x)
+    else
+        fun_l8_n304(x)
+    end
+end
+
+def fun_l7_n905(x)
+    if (x < 1)
+        fun_l8_n721(x)
+    else
+        fun_l8_n996(x)
+    end
+end
+
+def fun_l7_n906(x)
+    if (x < 1)
+        fun_l8_n700(x)
+    else
+        fun_l8_n688(x)
+    end
+end
+
+def fun_l7_n907(x)
+    if (x < 1)
+        fun_l8_n202(x)
+    else
+        fun_l8_n668(x)
+    end
+end
+
+def fun_l7_n908(x)
+    if (x < 1)
+        fun_l8_n514(x)
+    else
+        fun_l8_n306(x)
+    end
+end
+
+def fun_l7_n909(x)
+    if (x < 1)
+        fun_l8_n592(x)
+    else
+        fun_l8_n43(x)
+    end
+end
+
+def fun_l7_n910(x)
+    if (x < 1)
+        fun_l8_n743(x)
+    else
+        fun_l8_n406(x)
+    end
+end
+
+def fun_l7_n911(x)
+    if (x < 1)
+        fun_l8_n801(x)
+    else
+        fun_l8_n91(x)
+    end
+end
+
+def fun_l7_n912(x)
+    if (x < 1)
+        fun_l8_n392(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n913(x)
+    if (x < 1)
+        fun_l8_n175(x)
+    else
+        fun_l8_n578(x)
+    end
+end
+
+def fun_l7_n914(x)
+    if (x < 1)
+        fun_l8_n155(x)
+    else
+        fun_l8_n795(x)
+    end
+end
+
+def fun_l7_n915(x)
+    if (x < 1)
+        fun_l8_n394(x)
+    else
+        fun_l8_n89(x)
+    end
+end
+
+def fun_l7_n916(x)
+    if (x < 1)
+        fun_l8_n59(x)
+    else
+        fun_l8_n345(x)
+    end
+end
+
+def fun_l7_n917(x)
+    if (x < 1)
+        fun_l8_n450(x)
+    else
+        fun_l8_n136(x)
+    end
+end
+
+def fun_l7_n918(x)
+    if (x < 1)
+        fun_l8_n530(x)
+    else
+        fun_l8_n233(x)
+    end
+end
+
+def fun_l7_n919(x)
+    if (x < 1)
+        fun_l8_n632(x)
+    else
+        fun_l8_n631(x)
+    end
+end
+
+def fun_l7_n920(x)
+    if (x < 1)
+        fun_l8_n252(x)
+    else
+        fun_l8_n95(x)
+    end
+end
+
+def fun_l7_n921(x)
+    if (x < 1)
+        fun_l8_n980(x)
+    else
+        fun_l8_n819(x)
+    end
+end
+
+def fun_l7_n922(x)
+    if (x < 1)
+        fun_l8_n866(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n923(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n83(x)
+    end
+end
+
+def fun_l7_n924(x)
+    if (x < 1)
+        fun_l8_n162(x)
+    else
+        fun_l8_n193(x)
+    end
+end
+
+def fun_l7_n925(x)
+    if (x < 1)
+        fun_l8_n78(x)
+    else
+        fun_l8_n546(x)
+    end
+end
+
+def fun_l7_n926(x)
+    if (x < 1)
+        fun_l8_n102(x)
+    else
+        fun_l8_n847(x)
+    end
+end
+
+def fun_l7_n927(x)
+    if (x < 1)
+        fun_l8_n84(x)
+    else
+        fun_l8_n257(x)
+    end
+end
+
+def fun_l7_n928(x)
+    if (x < 1)
+        fun_l8_n195(x)
+    else
+        fun_l8_n200(x)
+    end
+end
+
+def fun_l7_n929(x)
+    if (x < 1)
+        fun_l8_n245(x)
+    else
+        fun_l8_n926(x)
+    end
+end
+
+def fun_l7_n930(x)
+    if (x < 1)
+        fun_l8_n651(x)
+    else
+        fun_l8_n308(x)
+    end
+end
+
+def fun_l7_n931(x)
+    if (x < 1)
+        fun_l8_n312(x)
+    else
+        fun_l8_n901(x)
+    end
+end
+
+def fun_l7_n932(x)
+    if (x < 1)
+        fun_l8_n221(x)
+    else
+        fun_l8_n775(x)
+    end
+end
+
+def fun_l7_n933(x)
+    if (x < 1)
+        fun_l8_n397(x)
+    else
+        fun_l8_n973(x)
+    end
+end
+
+def fun_l7_n934(x)
+    if (x < 1)
+        fun_l8_n788(x)
+    else
+        fun_l8_n952(x)
+    end
+end
+
+def fun_l7_n935(x)
+    if (x < 1)
+        fun_l8_n965(x)
+    else
+        fun_l8_n861(x)
+    end
+end
+
+def fun_l7_n936(x)
+    if (x < 1)
+        fun_l8_n969(x)
+    else
+        fun_l8_n773(x)
+    end
+end
+
+def fun_l7_n937(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n237(x)
+    end
+end
+
+def fun_l7_n938(x)
+    if (x < 1)
+        fun_l8_n369(x)
+    else
+        fun_l8_n444(x)
+    end
+end
+
+def fun_l7_n939(x)
+    if (x < 1)
+        fun_l8_n863(x)
+    else
+        fun_l8_n515(x)
+    end
+end
+
+def fun_l7_n940(x)
+    if (x < 1)
+        fun_l8_n573(x)
+    else
+        fun_l8_n356(x)
+    end
+end
+
+def fun_l7_n941(x)
+    if (x < 1)
+        fun_l8_n188(x)
+    else
+        fun_l8_n171(x)
+    end
+end
+
+def fun_l7_n942(x)
+    if (x < 1)
+        fun_l8_n483(x)
+    else
+        fun_l8_n556(x)
+    end
+end
+
+def fun_l7_n943(x)
+    if (x < 1)
+        fun_l8_n935(x)
+    else
+        fun_l8_n723(x)
+    end
+end
+
+def fun_l7_n944(x)
+    if (x < 1)
+        fun_l8_n451(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n945(x)
+    if (x < 1)
+        fun_l8_n651(x)
+    else
+        fun_l8_n891(x)
+    end
+end
+
+def fun_l7_n946(x)
+    if (x < 1)
+        fun_l8_n225(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n947(x)
+    if (x < 1)
+        fun_l8_n704(x)
+    else
+        fun_l8_n456(x)
+    end
+end
+
+def fun_l7_n948(x)
+    if (x < 1)
+        fun_l8_n995(x)
+    else
+        fun_l8_n816(x)
+    end
+end
+
+def fun_l7_n949(x)
+    if (x < 1)
+        fun_l8_n287(x)
+    else
+        fun_l8_n140(x)
+    end
+end
+
+def fun_l7_n950(x)
+    if (x < 1)
+        fun_l8_n302(x)
+    else
+        fun_l8_n582(x)
+    end
+end
+
+def fun_l7_n951(x)
+    if (x < 1)
+        fun_l8_n58(x)
+    else
+        fun_l8_n759(x)
+    end
+end
+
+def fun_l7_n952(x)
+    if (x < 1)
+        fun_l8_n54(x)
+    else
+        fun_l8_n812(x)
+    end
+end
+
+def fun_l7_n953(x)
+    if (x < 1)
+        fun_l8_n263(x)
+    else
+        fun_l8_n801(x)
+    end
+end
+
+def fun_l7_n954(x)
+    if (x < 1)
+        fun_l8_n507(x)
+    else
+        fun_l8_n781(x)
+    end
+end
+
+def fun_l7_n955(x)
+    if (x < 1)
+        fun_l8_n328(x)
+    else
+        fun_l8_n886(x)
+    end
+end
+
+def fun_l7_n956(x)
+    if (x < 1)
+        fun_l8_n653(x)
+    else
+        fun_l8_n847(x)
+    end
+end
+
+def fun_l7_n957(x)
+    if (x < 1)
+        fun_l8_n594(x)
+    else
+        fun_l8_n9(x)
+    end
+end
+
+def fun_l7_n958(x)
+    if (x < 1)
+        fun_l8_n818(x)
+    else
+        fun_l8_n912(x)
+    end
+end
+
+def fun_l7_n959(x)
+    if (x < 1)
+        fun_l8_n941(x)
+    else
+        fun_l8_n394(x)
+    end
+end
+
+def fun_l7_n960(x)
+    if (x < 1)
+        fun_l8_n151(x)
+    else
+        fun_l8_n426(x)
+    end
+end
+
+def fun_l7_n961(x)
+    if (x < 1)
+        fun_l8_n276(x)
+    else
+        fun_l8_n458(x)
+    end
+end
+
+def fun_l7_n962(x)
+    if (x < 1)
+        fun_l8_n310(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n963(x)
+    if (x < 1)
+        fun_l8_n103(x)
+    else
+        fun_l8_n995(x)
+    end
+end
+
+def fun_l7_n964(x)
+    if (x < 1)
+        fun_l8_n808(x)
+    else
+        fun_l8_n41(x)
+    end
+end
+
+def fun_l7_n965(x)
+    if (x < 1)
+        fun_l8_n840(x)
+    else
+        fun_l8_n143(x)
+    end
+end
+
+def fun_l7_n966(x)
+    if (x < 1)
+        fun_l8_n855(x)
+    else
+        fun_l8_n38(x)
+    end
+end
+
+def fun_l7_n967(x)
+    if (x < 1)
+        fun_l8_n316(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n968(x)
+    if (x < 1)
+        fun_l8_n856(x)
+    else
+        fun_l8_n182(x)
+    end
+end
+
+def fun_l7_n969(x)
+    if (x < 1)
+        fun_l8_n436(x)
+    else
+        fun_l8_n460(x)
+    end
+end
+
+def fun_l7_n970(x)
+    if (x < 1)
+        fun_l8_n187(x)
+    else
+        fun_l8_n90(x)
+    end
+end
+
+def fun_l7_n971(x)
+    if (x < 1)
+        fun_l8_n689(x)
+    else
+        fun_l8_n921(x)
+    end
+end
+
+def fun_l7_n972(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n79(x)
+    end
+end
+
+def fun_l7_n973(x)
+    if (x < 1)
+        fun_l8_n137(x)
+    else
+        fun_l8_n17(x)
+    end
+end
+
+def fun_l7_n974(x)
+    if (x < 1)
+        fun_l8_n813(x)
+    else
+        fun_l8_n944(x)
+    end
+end
+
+def fun_l7_n975(x)
+    if (x < 1)
+        fun_l8_n589(x)
+    else
+        fun_l8_n416(x)
+    end
+end
+
+def fun_l7_n976(x)
+    if (x < 1)
+        fun_l8_n763(x)
+    else
+        fun_l8_n289(x)
+    end
+end
+
+def fun_l7_n977(x)
+    if (x < 1)
+        fun_l8_n118(x)
+    else
+        fun_l8_n998(x)
+    end
+end
+
+def fun_l7_n978(x)
+    if (x < 1)
+        fun_l8_n382(x)
+    else
+        fun_l8_n216(x)
+    end
+end
+
+def fun_l7_n979(x)
+    if (x < 1)
+        fun_l8_n304(x)
+    else
+        fun_l8_n586(x)
+    end
+end
+
+def fun_l7_n980(x)
+    if (x < 1)
+        fun_l8_n693(x)
+    else
+        fun_l8_n118(x)
+    end
+end
+
+def fun_l7_n981(x)
+    if (x < 1)
+        fun_l8_n669(x)
+    else
+        fun_l8_n796(x)
+    end
+end
+
+def fun_l7_n982(x)
+    if (x < 1)
+        fun_l8_n187(x)
+    else
+        fun_l8_n143(x)
+    end
+end
+
+def fun_l7_n983(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n172(x)
+    end
+end
+
+def fun_l7_n984(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n670(x)
+    end
+end
+
+def fun_l7_n985(x)
+    if (x < 1)
+        fun_l8_n275(x)
+    else
+        fun_l8_n520(x)
+    end
+end
+
+def fun_l7_n986(x)
+    if (x < 1)
+        fun_l8_n841(x)
+    else
+        fun_l8_n446(x)
+    end
+end
+
+def fun_l7_n987(x)
+    if (x < 1)
+        fun_l8_n712(x)
+    else
+        fun_l8_n976(x)
+    end
+end
+
+def fun_l7_n988(x)
+    if (x < 1)
+        fun_l8_n115(x)
+    else
+        fun_l8_n222(x)
+    end
+end
+
+def fun_l7_n989(x)
+    if (x < 1)
+        fun_l8_n23(x)
+    else
+        fun_l8_n665(x)
+    end
+end
+
+def fun_l7_n990(x)
+    if (x < 1)
+        fun_l8_n416(x)
+    else
+        fun_l8_n455(x)
+    end
+end
+
+def fun_l7_n991(x)
+    if (x < 1)
+        fun_l8_n556(x)
+    else
+        fun_l8_n971(x)
+    end
+end
+
+def fun_l7_n992(x)
+    if (x < 1)
+        fun_l8_n726(x)
+    else
+        fun_l8_n312(x)
+    end
+end
+
+def fun_l7_n993(x)
+    if (x < 1)
+        fun_l8_n354(x)
+    else
+        fun_l8_n860(x)
+    end
+end
+
+def fun_l7_n994(x)
+    if (x < 1)
+        fun_l8_n62(x)
+    else
+        fun_l8_n290(x)
+    end
+end
+
+def fun_l7_n995(x)
+    if (x < 1)
+        fun_l8_n695(x)
+    else
+        fun_l8_n881(x)
+    end
+end
+
+def fun_l7_n996(x)
+    if (x < 1)
+        fun_l8_n938(x)
+    else
+        fun_l8_n566(x)
+    end
+end
+
+def fun_l7_n997(x)
+    if (x < 1)
+        fun_l8_n379(x)
+    else
+        fun_l8_n731(x)
+    end
+end
+
+def fun_l7_n998(x)
+    if (x < 1)
+        fun_l8_n320(x)
+    else
+        fun_l8_n339(x)
+    end
+end
+
+def fun_l7_n999(x)
+    if (x < 1)
+        fun_l8_n219(x)
+    else
+        fun_l8_n320(x)
+    end
+end
+
+def fun_l8_n0(x)
+    if (x < 1)
+        fun_l9_n590(x)
+    else
+        fun_l9_n825(x)
+    end
+end
+
+def fun_l8_n1(x)
+    if (x < 1)
+        fun_l9_n301(x)
+    else
+        fun_l9_n457(x)
+    end
+end
+
+def fun_l8_n2(x)
+    if (x < 1)
+        fun_l9_n637(x)
+    else
+        fun_l9_n909(x)
+    end
+end
+
+def fun_l8_n3(x)
+    if (x < 1)
+        fun_l9_n485(x)
+    else
+        fun_l9_n603(x)
+    end
+end
+
+def fun_l8_n4(x)
+    if (x < 1)
+        fun_l9_n465(x)
+    else
+        fun_l9_n39(x)
+    end
+end
+
+def fun_l8_n5(x)
+    if (x < 1)
+        fun_l9_n861(x)
+    else
+        fun_l9_n153(x)
+    end
+end
+
+def fun_l8_n6(x)
+    if (x < 1)
+        fun_l9_n130(x)
+    else
+        fun_l9_n401(x)
+    end
+end
+
+def fun_l8_n7(x)
+    if (x < 1)
+        fun_l9_n726(x)
+    else
+        fun_l9_n248(x)
+    end
+end
+
+def fun_l8_n8(x)
+    if (x < 1)
+        fun_l9_n607(x)
+    else
+        fun_l9_n681(x)
+    end
+end
+
+def fun_l8_n9(x)
+    if (x < 1)
+        fun_l9_n862(x)
+    else
+        fun_l9_n8(x)
+    end
+end
+
+def fun_l8_n10(x)
+    if (x < 1)
+        fun_l9_n607(x)
+    else
+        fun_l9_n373(x)
+    end
+end
+
+def fun_l8_n11(x)
+    if (x < 1)
+        fun_l9_n692(x)
+    else
+        fun_l9_n31(x)
+    end
+end
+
+def fun_l8_n12(x)
+    if (x < 1)
+        fun_l9_n412(x)
+    else
+        fun_l9_n576(x)
+    end
+end
+
+def fun_l8_n13(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n281(x)
+    end
+end
+
+def fun_l8_n14(x)
+    if (x < 1)
+        fun_l9_n986(x)
+    else
+        fun_l9_n99(x)
+    end
+end
+
+def fun_l8_n15(x)
+    if (x < 1)
+        fun_l9_n807(x)
+    else
+        fun_l9_n807(x)
+    end
+end
+
+def fun_l8_n16(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n51(x)
+    end
+end
+
+def fun_l8_n17(x)
+    if (x < 1)
+        fun_l9_n193(x)
+    else
+        fun_l9_n673(x)
+    end
+end
+
+def fun_l8_n18(x)
+    if (x < 1)
+        fun_l9_n897(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n19(x)
+    if (x < 1)
+        fun_l9_n288(x)
+    else
+        fun_l9_n337(x)
+    end
+end
+
+def fun_l8_n20(x)
+    if (x < 1)
+        fun_l9_n754(x)
+    else
+        fun_l9_n581(x)
+    end
+end
+
+def fun_l8_n21(x)
+    if (x < 1)
+        fun_l9_n265(x)
+    else
+        fun_l9_n205(x)
+    end
+end
+
+def fun_l8_n22(x)
+    if (x < 1)
+        fun_l9_n784(x)
+    else
+        fun_l9_n428(x)
+    end
+end
+
+def fun_l8_n23(x)
+    if (x < 1)
+        fun_l9_n821(x)
+    else
+        fun_l9_n930(x)
+    end
+end
+
+def fun_l8_n24(x)
+    if (x < 1)
+        fun_l9_n237(x)
+    else
+        fun_l9_n681(x)
+    end
+end
+
+def fun_l8_n25(x)
+    if (x < 1)
+        fun_l9_n32(x)
+    else
+        fun_l9_n405(x)
+    end
+end
+
+def fun_l8_n26(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n802(x)
+    end
+end
+
+def fun_l8_n27(x)
+    if (x < 1)
+        fun_l9_n4(x)
+    else
+        fun_l9_n288(x)
+    end
+end
+
+def fun_l8_n28(x)
+    if (x < 1)
+        fun_l9_n9(x)
+    else
+        fun_l9_n180(x)
+    end
+end
+
+def fun_l8_n29(x)
+    if (x < 1)
+        fun_l9_n585(x)
+    else
+        fun_l9_n396(x)
+    end
+end
+
+def fun_l8_n30(x)
+    if (x < 1)
+        fun_l9_n954(x)
+    else
+        fun_l9_n603(x)
+    end
+end
+
+def fun_l8_n31(x)
+    if (x < 1)
+        fun_l9_n808(x)
+    else
+        fun_l9_n770(x)
+    end
+end
+
+def fun_l8_n32(x)
+    if (x < 1)
+        fun_l9_n442(x)
+    else
+        fun_l9_n243(x)
+    end
+end
+
+def fun_l8_n33(x)
+    if (x < 1)
+        fun_l9_n139(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n34(x)
+    if (x < 1)
+        fun_l9_n270(x)
+    else
+        fun_l9_n333(x)
+    end
+end
+
+def fun_l8_n35(x)
+    if (x < 1)
+        fun_l9_n542(x)
+    else
+        fun_l9_n38(x)
+    end
+end
+
+def fun_l8_n36(x)
+    if (x < 1)
+        fun_l9_n892(x)
+    else
+        fun_l9_n517(x)
+    end
+end
+
+def fun_l8_n37(x)
+    if (x < 1)
+        fun_l9_n599(x)
+    else
+        fun_l9_n692(x)
+    end
+end
+
+def fun_l8_n38(x)
+    if (x < 1)
+        fun_l9_n0(x)
+    else
+        fun_l9_n879(x)
+    end
+end
+
+def fun_l8_n39(x)
+    if (x < 1)
+        fun_l9_n835(x)
+    else
+        fun_l9_n134(x)
+    end
+end
+
+def fun_l8_n40(x)
+    if (x < 1)
+        fun_l9_n151(x)
+    else
+        fun_l9_n546(x)
+    end
+end
+
+def fun_l8_n41(x)
+    if (x < 1)
+        fun_l9_n214(x)
+    else
+        fun_l9_n652(x)
+    end
+end
+
+def fun_l8_n42(x)
+    if (x < 1)
+        fun_l9_n239(x)
+    else
+        fun_l9_n123(x)
+    end
+end
+
+def fun_l8_n43(x)
+    if (x < 1)
+        fun_l9_n763(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n44(x)
+    if (x < 1)
+        fun_l9_n449(x)
+    else
+        fun_l9_n343(x)
+    end
+end
+
+def fun_l8_n45(x)
+    if (x < 1)
+        fun_l9_n727(x)
+    else
+        fun_l9_n47(x)
+    end
+end
+
+def fun_l8_n46(x)
+    if (x < 1)
+        fun_l9_n684(x)
+    else
+        fun_l9_n711(x)
+    end
+end
+
+def fun_l8_n47(x)
+    if (x < 1)
+        fun_l9_n895(x)
+    else
+        fun_l9_n864(x)
+    end
+end
+
+def fun_l8_n48(x)
+    if (x < 1)
+        fun_l9_n544(x)
+    else
+        fun_l9_n358(x)
+    end
+end
+
+def fun_l8_n49(x)
+    if (x < 1)
+        fun_l9_n829(x)
+    else
+        fun_l9_n411(x)
+    end
+end
+
+def fun_l8_n50(x)
+    if (x < 1)
+        fun_l9_n673(x)
+    else
+        fun_l9_n640(x)
+    end
+end
+
+def fun_l8_n51(x)
+    if (x < 1)
+        fun_l9_n9(x)
+    else
+        fun_l9_n690(x)
+    end
+end
+
+def fun_l8_n52(x)
+    if (x < 1)
+        fun_l9_n293(x)
+    else
+        fun_l9_n889(x)
+    end
+end
+
+def fun_l8_n53(x)
+    if (x < 1)
+        fun_l9_n141(x)
+    else
+        fun_l9_n554(x)
+    end
+end
+
+def fun_l8_n54(x)
+    if (x < 1)
+        fun_l9_n982(x)
+    else
+        fun_l9_n955(x)
+    end
+end
+
+def fun_l8_n55(x)
+    if (x < 1)
+        fun_l9_n382(x)
+    else
+        fun_l9_n897(x)
+    end
+end
+
+def fun_l8_n56(x)
+    if (x < 1)
+        fun_l9_n332(x)
+    else
+        fun_l9_n550(x)
+    end
+end
+
+def fun_l8_n57(x)
+    if (x < 1)
+        fun_l9_n46(x)
+    else
+        fun_l9_n569(x)
+    end
+end
+
+def fun_l8_n58(x)
+    if (x < 1)
+        fun_l9_n556(x)
+    else
+        fun_l9_n0(x)
+    end
+end
+
+def fun_l8_n59(x)
+    if (x < 1)
+        fun_l9_n931(x)
+    else
+        fun_l9_n995(x)
+    end
+end
+
+def fun_l8_n60(x)
+    if (x < 1)
+        fun_l9_n470(x)
+    else
+        fun_l9_n679(x)
+    end
+end
+
+def fun_l8_n61(x)
+    if (x < 1)
+        fun_l9_n269(x)
+    else
+        fun_l9_n742(x)
+    end
+end
+
+def fun_l8_n62(x)
+    if (x < 1)
+        fun_l9_n542(x)
+    else
+        fun_l9_n556(x)
+    end
+end
+
+def fun_l8_n63(x)
+    if (x < 1)
+        fun_l9_n713(x)
+    else
+        fun_l9_n249(x)
+    end
+end
+
+def fun_l8_n64(x)
+    if (x < 1)
+        fun_l9_n842(x)
+    else
+        fun_l9_n566(x)
+    end
+end
+
+def fun_l8_n65(x)
+    if (x < 1)
+        fun_l9_n708(x)
+    else
+        fun_l9_n3(x)
+    end
+end
+
+def fun_l8_n66(x)
+    if (x < 1)
+        fun_l9_n845(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n67(x)
+    if (x < 1)
+        fun_l9_n823(x)
+    else
+        fun_l9_n326(x)
+    end
+end
+
+def fun_l8_n68(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n888(x)
+    end
+end
+
+def fun_l8_n69(x)
+    if (x < 1)
+        fun_l9_n454(x)
+    else
+        fun_l9_n601(x)
+    end
+end
+
+def fun_l8_n70(x)
+    if (x < 1)
+        fun_l9_n636(x)
+    else
+        fun_l9_n482(x)
+    end
+end
+
+def fun_l8_n71(x)
+    if (x < 1)
+        fun_l9_n778(x)
+    else
+        fun_l9_n678(x)
+    end
+end
+
+def fun_l8_n72(x)
+    if (x < 1)
+        fun_l9_n715(x)
+    else
+        fun_l9_n851(x)
+    end
+end
+
+def fun_l8_n73(x)
+    if (x < 1)
+        fun_l9_n330(x)
+    else
+        fun_l9_n84(x)
+    end
+end
+
+def fun_l8_n74(x)
+    if (x < 1)
+        fun_l9_n524(x)
+    else
+        fun_l9_n109(x)
+    end
+end
+
+def fun_l8_n75(x)
+    if (x < 1)
+        fun_l9_n610(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n76(x)
+    if (x < 1)
+        fun_l9_n964(x)
+    else
+        fun_l9_n893(x)
+    end
+end
+
+def fun_l8_n77(x)
+    if (x < 1)
+        fun_l9_n653(x)
+    else
+        fun_l9_n451(x)
+    end
+end
+
+def fun_l8_n78(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n29(x)
+    end
+end
+
+def fun_l8_n79(x)
+    if (x < 1)
+        fun_l9_n219(x)
+    else
+        fun_l9_n25(x)
+    end
+end
+
+def fun_l8_n80(x)
+    if (x < 1)
+        fun_l9_n471(x)
+    else
+        fun_l9_n217(x)
+    end
+end
+
+def fun_l8_n81(x)
+    if (x < 1)
+        fun_l9_n339(x)
+    else
+        fun_l9_n365(x)
+    end
+end
+
+def fun_l8_n82(x)
+    if (x < 1)
+        fun_l9_n808(x)
+    else
+        fun_l9_n501(x)
+    end
+end
+
+def fun_l8_n83(x)
+    if (x < 1)
+        fun_l9_n23(x)
+    else
+        fun_l9_n252(x)
+    end
+end
+
+def fun_l8_n84(x)
+    if (x < 1)
+        fun_l9_n628(x)
+    else
+        fun_l9_n514(x)
+    end
+end
+
+def fun_l8_n85(x)
+    if (x < 1)
+        fun_l9_n22(x)
+    else
+        fun_l9_n465(x)
+    end
+end
+
+def fun_l8_n86(x)
+    if (x < 1)
+        fun_l9_n553(x)
+    else
+        fun_l9_n788(x)
+    end
+end
+
+def fun_l8_n87(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n945(x)
+    end
+end
+
+def fun_l8_n88(x)
+    if (x < 1)
+        fun_l9_n886(x)
+    else
+        fun_l9_n438(x)
+    end
+end
+
+def fun_l8_n89(x)
+    if (x < 1)
+        fun_l9_n821(x)
+    else
+        fun_l9_n697(x)
+    end
+end
+
+def fun_l8_n90(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n39(x)
+    end
+end
+
+def fun_l8_n91(x)
+    if (x < 1)
+        fun_l9_n135(x)
+    else
+        fun_l9_n736(x)
+    end
+end
+
+def fun_l8_n92(x)
+    if (x < 1)
+        fun_l9_n225(x)
+    else
+        fun_l9_n125(x)
+    end
+end
+
+def fun_l8_n93(x)
+    if (x < 1)
+        fun_l9_n201(x)
+    else
+        fun_l9_n320(x)
+    end
+end
+
+def fun_l8_n94(x)
+    if (x < 1)
+        fun_l9_n30(x)
+    else
+        fun_l9_n938(x)
+    end
+end
+
+def fun_l8_n95(x)
+    if (x < 1)
+        fun_l9_n987(x)
+    else
+        fun_l9_n141(x)
+    end
+end
+
+def fun_l8_n96(x)
+    if (x < 1)
+        fun_l9_n968(x)
+    else
+        fun_l9_n999(x)
+    end
+end
+
+def fun_l8_n97(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n927(x)
+    end
+end
+
+def fun_l8_n98(x)
+    if (x < 1)
+        fun_l9_n720(x)
+    else
+        fun_l9_n717(x)
+    end
+end
+
+def fun_l8_n99(x)
+    if (x < 1)
+        fun_l9_n907(x)
+    else
+        fun_l9_n8(x)
+    end
+end
+
+def fun_l8_n100(x)
+    if (x < 1)
+        fun_l9_n973(x)
+    else
+        fun_l9_n379(x)
+    end
+end
+
+def fun_l8_n101(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n530(x)
+    end
+end
+
+def fun_l8_n102(x)
+    if (x < 1)
+        fun_l9_n411(x)
+    else
+        fun_l9_n560(x)
+    end
+end
+
+def fun_l8_n103(x)
+    if (x < 1)
+        fun_l9_n54(x)
+    else
+        fun_l9_n813(x)
+    end
+end
+
+def fun_l8_n104(x)
+    if (x < 1)
+        fun_l9_n217(x)
+    else
+        fun_l9_n455(x)
+    end
+end
+
+def fun_l8_n105(x)
+    if (x < 1)
+        fun_l9_n667(x)
+    else
+        fun_l9_n92(x)
+    end
+end
+
+def fun_l8_n106(x)
+    if (x < 1)
+        fun_l9_n933(x)
+    else
+        fun_l9_n727(x)
+    end
+end
+
+def fun_l8_n107(x)
+    if (x < 1)
+        fun_l9_n578(x)
+    else
+        fun_l9_n350(x)
+    end
+end
+
+def fun_l8_n108(x)
+    if (x < 1)
+        fun_l9_n75(x)
+    else
+        fun_l9_n439(x)
+    end
+end
+
+def fun_l8_n109(x)
+    if (x < 1)
+        fun_l9_n21(x)
+    else
+        fun_l9_n112(x)
+    end
+end
+
+def fun_l8_n110(x)
+    if (x < 1)
+        fun_l9_n57(x)
+    else
+        fun_l9_n553(x)
+    end
+end
+
+def fun_l8_n111(x)
+    if (x < 1)
+        fun_l9_n347(x)
+    else
+        fun_l9_n285(x)
+    end
+end
+
+def fun_l8_n112(x)
+    if (x < 1)
+        fun_l9_n837(x)
+    else
+        fun_l9_n793(x)
+    end
+end
+
+def fun_l8_n113(x)
+    if (x < 1)
+        fun_l9_n517(x)
+    else
+        fun_l9_n668(x)
+    end
+end
+
+def fun_l8_n114(x)
+    if (x < 1)
+        fun_l9_n486(x)
+    else
+        fun_l9_n872(x)
+    end
+end
+
+def fun_l8_n115(x)
+    if (x < 1)
+        fun_l9_n454(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n116(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n263(x)
+    end
+end
+
+def fun_l8_n117(x)
+    if (x < 1)
+        fun_l9_n878(x)
+    else
+        fun_l9_n21(x)
+    end
+end
+
+def fun_l8_n118(x)
+    if (x < 1)
+        fun_l9_n564(x)
+    else
+        fun_l9_n409(x)
+    end
+end
+
+def fun_l8_n119(x)
+    if (x < 1)
+        fun_l9_n511(x)
+    else
+        fun_l9_n800(x)
+    end
+end
+
+def fun_l8_n120(x)
+    if (x < 1)
+        fun_l9_n501(x)
+    else
+        fun_l9_n305(x)
+    end
+end
+
+def fun_l8_n121(x)
+    if (x < 1)
+        fun_l9_n630(x)
+    else
+        fun_l9_n319(x)
+    end
+end
+
+def fun_l8_n122(x)
+    if (x < 1)
+        fun_l9_n271(x)
+    else
+        fun_l9_n639(x)
+    end
+end
+
+def fun_l8_n123(x)
+    if (x < 1)
+        fun_l9_n812(x)
+    else
+        fun_l9_n735(x)
+    end
+end
+
+def fun_l8_n124(x)
+    if (x < 1)
+        fun_l9_n828(x)
+    else
+        fun_l9_n203(x)
+    end
+end
+
+def fun_l8_n125(x)
+    if (x < 1)
+        fun_l9_n228(x)
+    else
+        fun_l9_n536(x)
+    end
+end
+
+def fun_l8_n126(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n325(x)
+    end
+end
+
+def fun_l8_n127(x)
+    if (x < 1)
+        fun_l9_n19(x)
+    else
+        fun_l9_n324(x)
+    end
+end
+
+def fun_l8_n128(x)
+    if (x < 1)
+        fun_l9_n419(x)
+    else
+        fun_l9_n425(x)
+    end
+end
+
+def fun_l8_n129(x)
+    if (x < 1)
+        fun_l9_n384(x)
+    else
+        fun_l9_n550(x)
+    end
+end
+
+def fun_l8_n130(x)
+    if (x < 1)
+        fun_l9_n956(x)
+    else
+        fun_l9_n270(x)
+    end
+end
+
+def fun_l8_n131(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n132(x)
+    if (x < 1)
+        fun_l9_n317(x)
+    else
+        fun_l9_n909(x)
+    end
+end
+
+def fun_l8_n133(x)
+    if (x < 1)
+        fun_l9_n131(x)
+    else
+        fun_l9_n108(x)
+    end
+end
+
+def fun_l8_n134(x)
+    if (x < 1)
+        fun_l9_n648(x)
+    else
+        fun_l9_n473(x)
+    end
+end
+
+def fun_l8_n135(x)
+    if (x < 1)
+        fun_l9_n837(x)
+    else
+        fun_l9_n89(x)
+    end
+end
+
+def fun_l8_n136(x)
+    if (x < 1)
+        fun_l9_n637(x)
+    else
+        fun_l9_n394(x)
+    end
+end
+
+def fun_l8_n137(x)
+    if (x < 1)
+        fun_l9_n608(x)
+    else
+        fun_l9_n283(x)
+    end
+end
+
+def fun_l8_n138(x)
+    if (x < 1)
+        fun_l9_n728(x)
+    else
+        fun_l9_n586(x)
+    end
+end
+
+def fun_l8_n139(x)
+    if (x < 1)
+        fun_l9_n689(x)
+    else
+        fun_l9_n700(x)
+    end
+end
+
+def fun_l8_n140(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n98(x)
+    end
+end
+
+def fun_l8_n141(x)
+    if (x < 1)
+        fun_l9_n696(x)
+    else
+        fun_l9_n951(x)
+    end
+end
+
+def fun_l8_n142(x)
+    if (x < 1)
+        fun_l9_n28(x)
+    else
+        fun_l9_n714(x)
+    end
+end
+
+def fun_l8_n143(x)
+    if (x < 1)
+        fun_l9_n438(x)
+    else
+        fun_l9_n934(x)
+    end
+end
+
+def fun_l8_n144(x)
+    if (x < 1)
+        fun_l9_n738(x)
+    else
+        fun_l9_n473(x)
+    end
+end
+
+def fun_l8_n145(x)
+    if (x < 1)
+        fun_l9_n201(x)
+    else
+        fun_l9_n634(x)
+    end
+end
+
+def fun_l8_n146(x)
+    if (x < 1)
+        fun_l9_n391(x)
+    else
+        fun_l9_n703(x)
+    end
+end
+
+def fun_l8_n147(x)
+    if (x < 1)
+        fun_l9_n740(x)
+    else
+        fun_l9_n265(x)
+    end
+end
+
+def fun_l8_n148(x)
+    if (x < 1)
+        fun_l9_n303(x)
+    else
+        fun_l9_n162(x)
+    end
+end
+
+def fun_l8_n149(x)
+    if (x < 1)
+        fun_l9_n518(x)
+    else
+        fun_l9_n899(x)
+    end
+end
+
+def fun_l8_n150(x)
+    if (x < 1)
+        fun_l9_n847(x)
+    else
+        fun_l9_n840(x)
+    end
+end
+
+def fun_l8_n151(x)
+    if (x < 1)
+        fun_l9_n567(x)
+    else
+        fun_l9_n29(x)
+    end
+end
+
+def fun_l8_n152(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n578(x)
+    end
+end
+
+def fun_l8_n153(x)
+    if (x < 1)
+        fun_l9_n617(x)
+    else
+        fun_l9_n703(x)
+    end
+end
+
+def fun_l8_n154(x)
+    if (x < 1)
+        fun_l9_n673(x)
+    else
+        fun_l9_n663(x)
+    end
+end
+
+def fun_l8_n155(x)
+    if (x < 1)
+        fun_l9_n456(x)
+    else
+        fun_l9_n406(x)
+    end
+end
+
+def fun_l8_n156(x)
+    if (x < 1)
+        fun_l9_n297(x)
+    else
+        fun_l9_n444(x)
+    end
+end
+
+def fun_l8_n157(x)
+    if (x < 1)
+        fun_l9_n300(x)
+    else
+        fun_l9_n179(x)
+    end
+end
+
+def fun_l8_n158(x)
+    if (x < 1)
+        fun_l9_n646(x)
+    else
+        fun_l9_n9(x)
+    end
+end
+
+def fun_l8_n159(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n228(x)
+    end
+end
+
+def fun_l8_n160(x)
+    if (x < 1)
+        fun_l9_n814(x)
+    else
+        fun_l9_n775(x)
+    end
+end
+
+def fun_l8_n161(x)
+    if (x < 1)
+        fun_l9_n748(x)
+    else
+        fun_l9_n849(x)
+    end
+end
+
+def fun_l8_n162(x)
+    if (x < 1)
+        fun_l9_n209(x)
+    else
+        fun_l9_n273(x)
+    end
+end
+
+def fun_l8_n163(x)
+    if (x < 1)
+        fun_l9_n116(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n164(x)
+    if (x < 1)
+        fun_l9_n714(x)
+    else
+        fun_l9_n621(x)
+    end
+end
+
+def fun_l8_n165(x)
+    if (x < 1)
+        fun_l9_n619(x)
+    else
+        fun_l9_n365(x)
+    end
+end
+
+def fun_l8_n166(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n745(x)
+    end
+end
+
+def fun_l8_n167(x)
+    if (x < 1)
+        fun_l9_n12(x)
+    else
+        fun_l9_n633(x)
+    end
+end
+
+def fun_l8_n168(x)
+    if (x < 1)
+        fun_l9_n619(x)
+    else
+        fun_l9_n31(x)
+    end
+end
+
+def fun_l8_n169(x)
+    if (x < 1)
+        fun_l9_n685(x)
+    else
+        fun_l9_n107(x)
+    end
+end
+
+def fun_l8_n170(x)
+    if (x < 1)
+        fun_l9_n636(x)
+    else
+        fun_l9_n280(x)
+    end
+end
+
+def fun_l8_n171(x)
+    if (x < 1)
+        fun_l9_n254(x)
+    else
+        fun_l9_n742(x)
+    end
+end
+
+def fun_l8_n172(x)
+    if (x < 1)
+        fun_l9_n829(x)
+    else
+        fun_l9_n632(x)
+    end
+end
+
+def fun_l8_n173(x)
+    if (x < 1)
+        fun_l9_n341(x)
+    else
+        fun_l9_n186(x)
+    end
+end
+
+def fun_l8_n174(x)
+    if (x < 1)
+        fun_l9_n903(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n175(x)
+    if (x < 1)
+        fun_l9_n416(x)
+    else
+        fun_l9_n318(x)
+    end
+end
+
+def fun_l8_n176(x)
+    if (x < 1)
+        fun_l9_n893(x)
+    else
+        fun_l9_n438(x)
+    end
+end
+
+def fun_l8_n177(x)
+    if (x < 1)
+        fun_l9_n551(x)
+    else
+        fun_l9_n312(x)
+    end
+end
+
+def fun_l8_n178(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n179(x)
+    if (x < 1)
+        fun_l9_n547(x)
+    else
+        fun_l9_n804(x)
+    end
+end
+
+def fun_l8_n180(x)
+    if (x < 1)
+        fun_l9_n589(x)
+    else
+        fun_l9_n246(x)
+    end
+end
+
+def fun_l8_n181(x)
+    if (x < 1)
+        fun_l9_n67(x)
+    else
+        fun_l9_n345(x)
+    end
+end
+
+def fun_l8_n182(x)
+    if (x < 1)
+        fun_l9_n958(x)
+    else
+        fun_l9_n923(x)
+    end
+end
+
+def fun_l8_n183(x)
+    if (x < 1)
+        fun_l9_n418(x)
+    else
+        fun_l9_n532(x)
+    end
+end
+
+def fun_l8_n184(x)
+    if (x < 1)
+        fun_l9_n372(x)
+    else
+        fun_l9_n808(x)
+    end
+end
+
+def fun_l8_n185(x)
+    if (x < 1)
+        fun_l9_n849(x)
+    else
+        fun_l9_n755(x)
+    end
+end
+
+def fun_l8_n186(x)
+    if (x < 1)
+        fun_l9_n544(x)
+    else
+        fun_l9_n73(x)
+    end
+end
+
+def fun_l8_n187(x)
+    if (x < 1)
+        fun_l9_n729(x)
+    else
+        fun_l9_n295(x)
+    end
+end
+
+def fun_l8_n188(x)
+    if (x < 1)
+        fun_l9_n782(x)
+    else
+        fun_l9_n117(x)
+    end
+end
+
+def fun_l8_n189(x)
+    if (x < 1)
+        fun_l9_n947(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n190(x)
+    if (x < 1)
+        fun_l9_n989(x)
+    else
+        fun_l9_n444(x)
+    end
+end
+
+def fun_l8_n191(x)
+    if (x < 1)
+        fun_l9_n394(x)
+    else
+        fun_l9_n741(x)
+    end
+end
+
+def fun_l8_n192(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n333(x)
+    end
+end
+
+def fun_l8_n193(x)
+    if (x < 1)
+        fun_l9_n73(x)
+    else
+        fun_l9_n227(x)
+    end
+end
+
+def fun_l8_n194(x)
+    if (x < 1)
+        fun_l9_n946(x)
+    else
+        fun_l9_n354(x)
+    end
+end
+
+def fun_l8_n195(x)
+    if (x < 1)
+        fun_l9_n383(x)
+    else
+        fun_l9_n863(x)
+    end
+end
+
+def fun_l8_n196(x)
+    if (x < 1)
+        fun_l9_n441(x)
+    else
+        fun_l9_n947(x)
+    end
+end
+
+def fun_l8_n197(x)
+    if (x < 1)
+        fun_l9_n506(x)
+    else
+        fun_l9_n45(x)
+    end
+end
+
+def fun_l8_n198(x)
+    if (x < 1)
+        fun_l9_n890(x)
+    else
+        fun_l9_n341(x)
+    end
+end
+
+def fun_l8_n199(x)
+    if (x < 1)
+        fun_l9_n75(x)
+    else
+        fun_l9_n56(x)
+    end
+end
+
+def fun_l8_n200(x)
+    if (x < 1)
+        fun_l9_n386(x)
+    else
+        fun_l9_n280(x)
+    end
+end
+
+def fun_l8_n201(x)
+    if (x < 1)
+        fun_l9_n364(x)
+    else
+        fun_l9_n424(x)
+    end
+end
+
+def fun_l8_n202(x)
+    if (x < 1)
+        fun_l9_n923(x)
+    else
+        fun_l9_n326(x)
+    end
+end
+
+def fun_l8_n203(x)
+    if (x < 1)
+        fun_l9_n692(x)
+    else
+        fun_l9_n502(x)
+    end
+end
+
+def fun_l8_n204(x)
+    if (x < 1)
+        fun_l9_n508(x)
+    else
+        fun_l9_n561(x)
+    end
+end
+
+def fun_l8_n205(x)
+    if (x < 1)
+        fun_l9_n496(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n206(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n447(x)
+    end
+end
+
+def fun_l8_n207(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n782(x)
+    end
+end
+
+def fun_l8_n208(x)
+    if (x < 1)
+        fun_l9_n505(x)
+    else
+        fun_l9_n32(x)
+    end
+end
+
+def fun_l8_n209(x)
+    if (x < 1)
+        fun_l9_n591(x)
+    else
+        fun_l9_n967(x)
+    end
+end
+
+def fun_l8_n210(x)
+    if (x < 1)
+        fun_l9_n537(x)
+    else
+        fun_l9_n380(x)
+    end
+end
+
+def fun_l8_n211(x)
+    if (x < 1)
+        fun_l9_n19(x)
+    else
+        fun_l9_n362(x)
+    end
+end
+
+def fun_l8_n212(x)
+    if (x < 1)
+        fun_l9_n759(x)
+    else
+        fun_l9_n835(x)
+    end
+end
+
+def fun_l8_n213(x)
+    if (x < 1)
+        fun_l9_n518(x)
+    else
+        fun_l9_n294(x)
+    end
+end
+
+def fun_l8_n214(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n687(x)
+    end
+end
+
+def fun_l8_n215(x)
+    if (x < 1)
+        fun_l9_n114(x)
+    else
+        fun_l9_n130(x)
+    end
+end
+
+def fun_l8_n216(x)
+    if (x < 1)
+        fun_l9_n829(x)
+    else
+        fun_l9_n8(x)
+    end
+end
+
+def fun_l8_n217(x)
+    if (x < 1)
+        fun_l9_n875(x)
+    else
+        fun_l9_n392(x)
+    end
+end
+
+def fun_l8_n218(x)
+    if (x < 1)
+        fun_l9_n13(x)
+    else
+        fun_l9_n907(x)
+    end
+end
+
+def fun_l8_n219(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n77(x)
+    end
+end
+
+def fun_l8_n220(x)
+    if (x < 1)
+        fun_l9_n404(x)
+    else
+        fun_l9_n12(x)
+    end
+end
+
+def fun_l8_n221(x)
+    if (x < 1)
+        fun_l9_n244(x)
+    else
+        fun_l9_n231(x)
+    end
+end
+
+def fun_l8_n222(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n458(x)
+    end
+end
+
+def fun_l8_n223(x)
+    if (x < 1)
+        fun_l9_n570(x)
+    else
+        fun_l9_n44(x)
+    end
+end
+
+def fun_l8_n224(x)
+    if (x < 1)
+        fun_l9_n651(x)
+    else
+        fun_l9_n836(x)
+    end
+end
+
+def fun_l8_n225(x)
+    if (x < 1)
+        fun_l9_n518(x)
+    else
+        fun_l9_n845(x)
+    end
+end
+
+def fun_l8_n226(x)
+    if (x < 1)
+        fun_l9_n92(x)
+    else
+        fun_l9_n637(x)
+    end
+end
+
+def fun_l8_n227(x)
+    if (x < 1)
+        fun_l9_n990(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n228(x)
+    if (x < 1)
+        fun_l9_n465(x)
+    else
+        fun_l9_n764(x)
+    end
+end
+
+def fun_l8_n229(x)
+    if (x < 1)
+        fun_l9_n7(x)
+    else
+        fun_l9_n981(x)
+    end
+end
+
+def fun_l8_n230(x)
+    if (x < 1)
+        fun_l9_n250(x)
+    else
+        fun_l9_n690(x)
+    end
+end
+
+def fun_l8_n231(x)
+    if (x < 1)
+        fun_l9_n101(x)
+    else
+        fun_l9_n342(x)
+    end
+end
+
+def fun_l8_n232(x)
+    if (x < 1)
+        fun_l9_n659(x)
+    else
+        fun_l9_n216(x)
+    end
+end
+
+def fun_l8_n233(x)
+    if (x < 1)
+        fun_l9_n129(x)
+    else
+        fun_l9_n439(x)
+    end
+end
+
+def fun_l8_n234(x)
+    if (x < 1)
+        fun_l9_n616(x)
+    else
+        fun_l9_n700(x)
+    end
+end
+
+def fun_l8_n235(x)
+    if (x < 1)
+        fun_l9_n850(x)
+    else
+        fun_l9_n254(x)
+    end
+end
+
+def fun_l8_n236(x)
+    if (x < 1)
+        fun_l9_n186(x)
+    else
+        fun_l9_n592(x)
+    end
+end
+
+def fun_l8_n237(x)
+    if (x < 1)
+        fun_l9_n895(x)
+    else
+        fun_l9_n752(x)
+    end
+end
+
+def fun_l8_n238(x)
+    if (x < 1)
+        fun_l9_n496(x)
+    else
+        fun_l9_n784(x)
+    end
+end
+
+def fun_l8_n239(x)
+    if (x < 1)
+        fun_l9_n579(x)
+    else
+        fun_l9_n144(x)
+    end
+end
+
+def fun_l8_n240(x)
+    if (x < 1)
+        fun_l9_n805(x)
+    else
+        fun_l9_n851(x)
+    end
+end
+
+def fun_l8_n241(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n332(x)
+    end
+end
+
+def fun_l8_n242(x)
+    if (x < 1)
+        fun_l9_n898(x)
+    else
+        fun_l9_n285(x)
+    end
+end
+
+def fun_l8_n243(x)
+    if (x < 1)
+        fun_l9_n729(x)
+    else
+        fun_l9_n149(x)
+    end
+end
+
+def fun_l8_n244(x)
+    if (x < 1)
+        fun_l9_n881(x)
+    else
+        fun_l9_n356(x)
+    end
+end
+
+def fun_l8_n245(x)
+    if (x < 1)
+        fun_l9_n351(x)
+    else
+        fun_l9_n805(x)
+    end
+end
+
+def fun_l8_n246(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n200(x)
+    end
+end
+
+def fun_l8_n247(x)
+    if (x < 1)
+        fun_l9_n706(x)
+    else
+        fun_l9_n917(x)
+    end
+end
+
+def fun_l8_n248(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n755(x)
+    end
+end
+
+def fun_l8_n249(x)
+    if (x < 1)
+        fun_l9_n859(x)
+    else
+        fun_l9_n496(x)
+    end
+end
+
+def fun_l8_n250(x)
+    if (x < 1)
+        fun_l9_n443(x)
+    else
+        fun_l9_n113(x)
+    end
+end
+
+def fun_l8_n251(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n195(x)
+    end
+end
+
+def fun_l8_n252(x)
+    if (x < 1)
+        fun_l9_n357(x)
+    else
+        fun_l9_n694(x)
+    end
+end
+
+def fun_l8_n253(x)
+    if (x < 1)
+        fun_l9_n387(x)
+    else
+        fun_l9_n820(x)
+    end
+end
+
+def fun_l8_n254(x)
+    if (x < 1)
+        fun_l9_n909(x)
+    else
+        fun_l9_n559(x)
+    end
+end
+
+def fun_l8_n255(x)
+    if (x < 1)
+        fun_l9_n474(x)
+    else
+        fun_l9_n864(x)
+    end
+end
+
+def fun_l8_n256(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n672(x)
+    end
+end
+
+def fun_l8_n257(x)
+    if (x < 1)
+        fun_l9_n915(x)
+    else
+        fun_l9_n177(x)
+    end
+end
+
+def fun_l8_n258(x)
+    if (x < 1)
+        fun_l9_n917(x)
+    else
+        fun_l9_n210(x)
+    end
+end
+
+def fun_l8_n259(x)
+    if (x < 1)
+        fun_l9_n851(x)
+    else
+        fun_l9_n342(x)
+    end
+end
+
+def fun_l8_n260(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n412(x)
+    end
+end
+
+def fun_l8_n261(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n62(x)
+    end
+end
+
+def fun_l8_n262(x)
+    if (x < 1)
+        fun_l9_n706(x)
+    else
+        fun_l9_n903(x)
+    end
+end
+
+def fun_l8_n263(x)
+    if (x < 1)
+        fun_l9_n403(x)
+    else
+        fun_l9_n994(x)
+    end
+end
+
+def fun_l8_n264(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n126(x)
+    end
+end
+
+def fun_l8_n265(x)
+    if (x < 1)
+        fun_l9_n216(x)
+    else
+        fun_l9_n573(x)
+    end
+end
+
+def fun_l8_n266(x)
+    if (x < 1)
+        fun_l9_n174(x)
+    else
+        fun_l9_n495(x)
+    end
+end
+
+def fun_l8_n267(x)
+    if (x < 1)
+        fun_l9_n802(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n268(x)
+    if (x < 1)
+        fun_l9_n148(x)
+    else
+        fun_l9_n399(x)
+    end
+end
+
+def fun_l8_n269(x)
+    if (x < 1)
+        fun_l9_n675(x)
+    else
+        fun_l9_n596(x)
+    end
+end
+
+def fun_l8_n270(x)
+    if (x < 1)
+        fun_l9_n306(x)
+    else
+        fun_l9_n413(x)
+    end
+end
+
+def fun_l8_n271(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n569(x)
+    end
+end
+
+def fun_l8_n272(x)
+    if (x < 1)
+        fun_l9_n6(x)
+    else
+        fun_l9_n531(x)
+    end
+end
+
+def fun_l8_n273(x)
+    if (x < 1)
+        fun_l9_n516(x)
+    else
+        fun_l9_n172(x)
+    end
+end
+
+def fun_l8_n274(x)
+    if (x < 1)
+        fun_l9_n641(x)
+    else
+        fun_l9_n85(x)
+    end
+end
+
+def fun_l8_n275(x)
+    if (x < 1)
+        fun_l9_n258(x)
+    else
+        fun_l9_n773(x)
+    end
+end
+
+def fun_l8_n276(x)
+    if (x < 1)
+        fun_l9_n233(x)
+    else
+        fun_l9_n222(x)
+    end
+end
+
+def fun_l8_n277(x)
+    if (x < 1)
+        fun_l9_n615(x)
+    else
+        fun_l9_n598(x)
+    end
+end
+
+def fun_l8_n278(x)
+    if (x < 1)
+        fun_l9_n126(x)
+    else
+        fun_l9_n270(x)
+    end
+end
+
+def fun_l8_n279(x)
+    if (x < 1)
+        fun_l9_n186(x)
+    else
+        fun_l9_n78(x)
+    end
+end
+
+def fun_l8_n280(x)
+    if (x < 1)
+        fun_l9_n731(x)
+    else
+        fun_l9_n114(x)
+    end
+end
+
+def fun_l8_n281(x)
+    if (x < 1)
+        fun_l9_n513(x)
+    else
+        fun_l9_n69(x)
+    end
+end
+
+def fun_l8_n282(x)
+    if (x < 1)
+        fun_l9_n208(x)
+    else
+        fun_l9_n466(x)
+    end
+end
+
+def fun_l8_n283(x)
+    if (x < 1)
+        fun_l9_n958(x)
+    else
+        fun_l9_n86(x)
+    end
+end
+
+def fun_l8_n284(x)
+    if (x < 1)
+        fun_l9_n663(x)
+    else
+        fun_l9_n619(x)
+    end
+end
+
+def fun_l8_n285(x)
+    if (x < 1)
+        fun_l9_n698(x)
+    else
+        fun_l9_n97(x)
+    end
+end
+
+def fun_l8_n286(x)
+    if (x < 1)
+        fun_l9_n544(x)
+    else
+        fun_l9_n791(x)
+    end
+end
+
+def fun_l8_n287(x)
+    if (x < 1)
+        fun_l9_n51(x)
+    else
+        fun_l9_n415(x)
+    end
+end
+
+def fun_l8_n288(x)
+    if (x < 1)
+        fun_l9_n942(x)
+    else
+        fun_l9_n11(x)
+    end
+end
+
+def fun_l8_n289(x)
+    if (x < 1)
+        fun_l9_n386(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n290(x)
+    if (x < 1)
+        fun_l9_n983(x)
+    else
+        fun_l9_n81(x)
+    end
+end
+
+def fun_l8_n291(x)
+    if (x < 1)
+        fun_l9_n403(x)
+    else
+        fun_l9_n628(x)
+    end
+end
+
+def fun_l8_n292(x)
+    if (x < 1)
+        fun_l9_n479(x)
+    else
+        fun_l9_n379(x)
+    end
+end
+
+def fun_l8_n293(x)
+    if (x < 1)
+        fun_l9_n284(x)
+    else
+        fun_l9_n109(x)
+    end
+end
+
+def fun_l8_n294(x)
+    if (x < 1)
+        fun_l9_n29(x)
+    else
+        fun_l9_n802(x)
+    end
+end
+
+def fun_l8_n295(x)
+    if (x < 1)
+        fun_l9_n579(x)
+    else
+        fun_l9_n371(x)
+    end
+end
+
+def fun_l8_n296(x)
+    if (x < 1)
+        fun_l9_n96(x)
+    else
+        fun_l9_n632(x)
+    end
+end
+
+def fun_l8_n297(x)
+    if (x < 1)
+        fun_l9_n442(x)
+    else
+        fun_l9_n396(x)
+    end
+end
+
+def fun_l8_n298(x)
+    if (x < 1)
+        fun_l9_n902(x)
+    else
+        fun_l9_n804(x)
+    end
+end
+
+def fun_l8_n299(x)
+    if (x < 1)
+        fun_l9_n561(x)
+    else
+        fun_l9_n952(x)
+    end
+end
+
+def fun_l8_n300(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n819(x)
+    end
+end
+
+def fun_l8_n301(x)
+    if (x < 1)
+        fun_l9_n97(x)
+    else
+        fun_l9_n892(x)
+    end
+end
+
+def fun_l8_n302(x)
+    if (x < 1)
+        fun_l9_n67(x)
+    else
+        fun_l9_n765(x)
+    end
+end
+
+def fun_l8_n303(x)
+    if (x < 1)
+        fun_l9_n166(x)
+    else
+        fun_l9_n769(x)
+    end
+end
+
+def fun_l8_n304(x)
+    if (x < 1)
+        fun_l9_n592(x)
+    else
+        fun_l9_n423(x)
+    end
+end
+
+def fun_l8_n305(x)
+    if (x < 1)
+        fun_l9_n354(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n306(x)
+    if (x < 1)
+        fun_l9_n857(x)
+    else
+        fun_l9_n18(x)
+    end
+end
+
+def fun_l8_n307(x)
+    if (x < 1)
+        fun_l9_n445(x)
+    else
+        fun_l9_n796(x)
+    end
+end
+
+def fun_l8_n308(x)
+    if (x < 1)
+        fun_l9_n293(x)
+    else
+        fun_l9_n304(x)
+    end
+end
+
+def fun_l8_n309(x)
+    if (x < 1)
+        fun_l9_n859(x)
+    else
+        fun_l9_n282(x)
+    end
+end
+
+def fun_l8_n310(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n90(x)
+    end
+end
+
+def fun_l8_n311(x)
+    if (x < 1)
+        fun_l9_n997(x)
+    else
+        fun_l9_n201(x)
+    end
+end
+
+def fun_l8_n312(x)
+    if (x < 1)
+        fun_l9_n140(x)
+    else
+        fun_l9_n772(x)
+    end
+end
+
+def fun_l8_n313(x)
+    if (x < 1)
+        fun_l9_n761(x)
+    else
+        fun_l9_n980(x)
+    end
+end
+
+def fun_l8_n314(x)
+    if (x < 1)
+        fun_l9_n357(x)
+    else
+        fun_l9_n552(x)
+    end
+end
+
+def fun_l8_n315(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n412(x)
+    end
+end
+
+def fun_l8_n316(x)
+    if (x < 1)
+        fun_l9_n700(x)
+    else
+        fun_l9_n551(x)
+    end
+end
+
+def fun_l8_n317(x)
+    if (x < 1)
+        fun_l9_n623(x)
+    else
+        fun_l9_n219(x)
+    end
+end
+
+def fun_l8_n318(x)
+    if (x < 1)
+        fun_l9_n613(x)
+    else
+        fun_l9_n959(x)
+    end
+end
+
+def fun_l8_n319(x)
+    if (x < 1)
+        fun_l9_n978(x)
+    else
+        fun_l9_n596(x)
+    end
+end
+
+def fun_l8_n320(x)
+    if (x < 1)
+        fun_l9_n542(x)
+    else
+        fun_l9_n527(x)
+    end
+end
+
+def fun_l8_n321(x)
+    if (x < 1)
+        fun_l9_n877(x)
+    else
+        fun_l9_n108(x)
+    end
+end
+
+def fun_l8_n322(x)
+    if (x < 1)
+        fun_l9_n817(x)
+    else
+        fun_l9_n476(x)
+    end
+end
+
+def fun_l8_n323(x)
+    if (x < 1)
+        fun_l9_n765(x)
+    else
+        fun_l9_n672(x)
+    end
+end
+
+def fun_l8_n324(x)
+    if (x < 1)
+        fun_l9_n863(x)
+    else
+        fun_l9_n605(x)
+    end
+end
+
+def fun_l8_n325(x)
+    if (x < 1)
+        fun_l9_n566(x)
+    else
+        fun_l9_n592(x)
+    end
+end
+
+def fun_l8_n326(x)
+    if (x < 1)
+        fun_l9_n607(x)
+    else
+        fun_l9_n968(x)
+    end
+end
+
+def fun_l8_n327(x)
+    if (x < 1)
+        fun_l9_n36(x)
+    else
+        fun_l9_n380(x)
+    end
+end
+
+def fun_l8_n328(x)
+    if (x < 1)
+        fun_l9_n597(x)
+    else
+        fun_l9_n664(x)
+    end
+end
+
+def fun_l8_n329(x)
+    if (x < 1)
+        fun_l9_n195(x)
+    else
+        fun_l9_n268(x)
+    end
+end
+
+def fun_l8_n330(x)
+    if (x < 1)
+        fun_l9_n419(x)
+    else
+        fun_l9_n715(x)
+    end
+end
+
+def fun_l8_n331(x)
+    if (x < 1)
+        fun_l9_n451(x)
+    else
+        fun_l9_n518(x)
+    end
+end
+
+def fun_l8_n332(x)
+    if (x < 1)
+        fun_l9_n106(x)
+    else
+        fun_l9_n236(x)
+    end
+end
+
+def fun_l8_n333(x)
+    if (x < 1)
+        fun_l9_n611(x)
+    else
+        fun_l9_n825(x)
+    end
+end
+
+def fun_l8_n334(x)
+    if (x < 1)
+        fun_l9_n394(x)
+    else
+        fun_l9_n34(x)
+    end
+end
+
+def fun_l8_n335(x)
+    if (x < 1)
+        fun_l9_n63(x)
+    else
+        fun_l9_n58(x)
+    end
+end
+
+def fun_l8_n336(x)
+    if (x < 1)
+        fun_l9_n475(x)
+    else
+        fun_l9_n455(x)
+    end
+end
+
+def fun_l8_n337(x)
+    if (x < 1)
+        fun_l9_n836(x)
+    else
+        fun_l9_n318(x)
+    end
+end
+
+def fun_l8_n338(x)
+    if (x < 1)
+        fun_l9_n844(x)
+    else
+        fun_l9_n21(x)
+    end
+end
+
+def fun_l8_n339(x)
+    if (x < 1)
+        fun_l9_n628(x)
+    else
+        fun_l9_n721(x)
+    end
+end
+
+def fun_l8_n340(x)
+    if (x < 1)
+        fun_l9_n966(x)
+    else
+        fun_l9_n833(x)
+    end
+end
+
+def fun_l8_n341(x)
+    if (x < 1)
+        fun_l9_n267(x)
+    else
+        fun_l9_n28(x)
+    end
+end
+
+def fun_l8_n342(x)
+    if (x < 1)
+        fun_l9_n204(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n343(x)
+    if (x < 1)
+        fun_l9_n151(x)
+    else
+        fun_l9_n382(x)
+    end
+end
+
+def fun_l8_n344(x)
+    if (x < 1)
+        fun_l9_n409(x)
+    else
+        fun_l9_n591(x)
+    end
+end
+
+def fun_l8_n345(x)
+    if (x < 1)
+        fun_l9_n680(x)
+    else
+        fun_l9_n912(x)
+    end
+end
+
+def fun_l8_n346(x)
+    if (x < 1)
+        fun_l9_n150(x)
+    else
+        fun_l9_n34(x)
+    end
+end
+
+def fun_l8_n347(x)
+    if (x < 1)
+        fun_l9_n538(x)
+    else
+        fun_l9_n441(x)
+    end
+end
+
+def fun_l8_n348(x)
+    if (x < 1)
+        fun_l9_n707(x)
+    else
+        fun_l9_n199(x)
+    end
+end
+
+def fun_l8_n349(x)
+    if (x < 1)
+        fun_l9_n245(x)
+    else
+        fun_l9_n809(x)
+    end
+end
+
+def fun_l8_n350(x)
+    if (x < 1)
+        fun_l9_n16(x)
+    else
+        fun_l9_n565(x)
+    end
+end
+
+def fun_l8_n351(x)
+    if (x < 1)
+        fun_l9_n857(x)
+    else
+        fun_l9_n37(x)
+    end
+end
+
+def fun_l8_n352(x)
+    if (x < 1)
+        fun_l9_n816(x)
+    else
+        fun_l9_n941(x)
+    end
+end
+
+def fun_l8_n353(x)
+    if (x < 1)
+        fun_l9_n605(x)
+    else
+        fun_l9_n476(x)
+    end
+end
+
+def fun_l8_n354(x)
+    if (x < 1)
+        fun_l9_n641(x)
+    else
+        fun_l9_n319(x)
+    end
+end
+
+def fun_l8_n355(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n676(x)
+    end
+end
+
+def fun_l8_n356(x)
+    if (x < 1)
+        fun_l9_n826(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n357(x)
+    if (x < 1)
+        fun_l9_n17(x)
+    else
+        fun_l9_n486(x)
+    end
+end
+
+def fun_l8_n358(x)
+    if (x < 1)
+        fun_l9_n90(x)
+    else
+        fun_l9_n744(x)
+    end
+end
+
+def fun_l8_n359(x)
+    if (x < 1)
+        fun_l9_n745(x)
+    else
+        fun_l9_n158(x)
+    end
+end
+
+def fun_l8_n360(x)
+    if (x < 1)
+        fun_l9_n261(x)
+    else
+        fun_l9_n878(x)
+    end
+end
+
+def fun_l8_n361(x)
+    if (x < 1)
+        fun_l9_n832(x)
+    else
+        fun_l9_n905(x)
+    end
+end
+
+def fun_l8_n362(x)
+    if (x < 1)
+        fun_l9_n879(x)
+    else
+        fun_l9_n475(x)
+    end
+end
+
+def fun_l8_n363(x)
+    if (x < 1)
+        fun_l9_n586(x)
+    else
+        fun_l9_n272(x)
+    end
+end
+
+def fun_l8_n364(x)
+    if (x < 1)
+        fun_l9_n469(x)
+    else
+        fun_l9_n918(x)
+    end
+end
+
+def fun_l8_n365(x)
+    if (x < 1)
+        fun_l9_n568(x)
+    else
+        fun_l9_n777(x)
+    end
+end
+
+def fun_l8_n366(x)
+    if (x < 1)
+        fun_l9_n662(x)
+    else
+        fun_l9_n957(x)
+    end
+end
+
+def fun_l8_n367(x)
+    if (x < 1)
+        fun_l9_n26(x)
+    else
+        fun_l9_n593(x)
+    end
+end
+
+def fun_l8_n368(x)
+    if (x < 1)
+        fun_l9_n766(x)
+    else
+        fun_l9_n598(x)
+    end
+end
+
+def fun_l8_n369(x)
+    if (x < 1)
+        fun_l9_n362(x)
+    else
+        fun_l9_n491(x)
+    end
+end
+
+def fun_l8_n370(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n585(x)
+    end
+end
+
+def fun_l8_n371(x)
+    if (x < 1)
+        fun_l9_n301(x)
+    else
+        fun_l9_n796(x)
+    end
+end
+
+def fun_l8_n372(x)
+    if (x < 1)
+        fun_l9_n527(x)
+    else
+        fun_l9_n31(x)
+    end
+end
+
+def fun_l8_n373(x)
+    if (x < 1)
+        fun_l9_n461(x)
+    else
+        fun_l9_n42(x)
+    end
+end
+
+def fun_l8_n374(x)
+    if (x < 1)
+        fun_l9_n288(x)
+    else
+        fun_l9_n534(x)
+    end
+end
+
+def fun_l8_n375(x)
+    if (x < 1)
+        fun_l9_n558(x)
+    else
+        fun_l9_n403(x)
+    end
+end
+
+def fun_l8_n376(x)
+    if (x < 1)
+        fun_l9_n835(x)
+    else
+        fun_l9_n390(x)
+    end
+end
+
+def fun_l8_n377(x)
+    if (x < 1)
+        fun_l9_n658(x)
+    else
+        fun_l9_n768(x)
+    end
+end
+
+def fun_l8_n378(x)
+    if (x < 1)
+        fun_l9_n856(x)
+    else
+        fun_l9_n299(x)
+    end
+end
+
+def fun_l8_n379(x)
+    if (x < 1)
+        fun_l9_n196(x)
+    else
+        fun_l9_n540(x)
+    end
+end
+
+def fun_l8_n380(x)
+    if (x < 1)
+        fun_l9_n70(x)
+    else
+        fun_l9_n627(x)
+    end
+end
+
+def fun_l8_n381(x)
+    if (x < 1)
+        fun_l9_n28(x)
+    else
+        fun_l9_n377(x)
+    end
+end
+
+def fun_l8_n382(x)
+    if (x < 1)
+        fun_l9_n955(x)
+    else
+        fun_l9_n124(x)
+    end
+end
+
+def fun_l8_n383(x)
+    if (x < 1)
+        fun_l9_n16(x)
+    else
+        fun_l9_n783(x)
+    end
+end
+
+def fun_l8_n384(x)
+    if (x < 1)
+        fun_l9_n843(x)
+    else
+        fun_l9_n801(x)
+    end
+end
+
+def fun_l8_n385(x)
+    if (x < 1)
+        fun_l9_n876(x)
+    else
+        fun_l9_n152(x)
+    end
+end
+
+def fun_l8_n386(x)
+    if (x < 1)
+        fun_l9_n6(x)
+    else
+        fun_l9_n432(x)
+    end
+end
+
+def fun_l8_n387(x)
+    if (x < 1)
+        fun_l9_n636(x)
+    else
+        fun_l9_n325(x)
+    end
+end
+
+def fun_l8_n388(x)
+    if (x < 1)
+        fun_l9_n267(x)
+    else
+        fun_l9_n716(x)
+    end
+end
+
+def fun_l8_n389(x)
+    if (x < 1)
+        fun_l9_n898(x)
+    else
+        fun_l9_n776(x)
+    end
+end
+
+def fun_l8_n390(x)
+    if (x < 1)
+        fun_l9_n481(x)
+    else
+        fun_l9_n878(x)
+    end
+end
+
+def fun_l8_n391(x)
+    if (x < 1)
+        fun_l9_n398(x)
+    else
+        fun_l9_n159(x)
+    end
+end
+
+def fun_l8_n392(x)
+    if (x < 1)
+        fun_l9_n889(x)
+    else
+        fun_l9_n517(x)
+    end
+end
+
+def fun_l8_n393(x)
+    if (x < 1)
+        fun_l9_n460(x)
+    else
+        fun_l9_n440(x)
+    end
+end
+
+def fun_l8_n394(x)
+    if (x < 1)
+        fun_l9_n576(x)
+    else
+        fun_l9_n421(x)
+    end
+end
+
+def fun_l8_n395(x)
+    if (x < 1)
+        fun_l9_n310(x)
+    else
+        fun_l9_n646(x)
+    end
+end
+
+def fun_l8_n396(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n414(x)
+    end
+end
+
+def fun_l8_n397(x)
+    if (x < 1)
+        fun_l9_n330(x)
+    else
+        fun_l9_n520(x)
+    end
+end
+
+def fun_l8_n398(x)
+    if (x < 1)
+        fun_l9_n175(x)
+    else
+        fun_l9_n975(x)
+    end
+end
+
+def fun_l8_n399(x)
+    if (x < 1)
+        fun_l9_n443(x)
+    else
+        fun_l9_n964(x)
+    end
+end
+
+def fun_l8_n400(x)
+    if (x < 1)
+        fun_l9_n810(x)
+    else
+        fun_l9_n102(x)
+    end
+end
+
+def fun_l8_n401(x)
+    if (x < 1)
+        fun_l9_n352(x)
+    else
+        fun_l9_n295(x)
+    end
+end
+
+def fun_l8_n402(x)
+    if (x < 1)
+        fun_l9_n980(x)
+    else
+        fun_l9_n974(x)
+    end
+end
+
+def fun_l8_n403(x)
+    if (x < 1)
+        fun_l9_n169(x)
+    else
+        fun_l9_n877(x)
+    end
+end
+
+def fun_l8_n404(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n306(x)
+    end
+end
+
+def fun_l8_n405(x)
+    if (x < 1)
+        fun_l9_n183(x)
+    else
+        fun_l9_n704(x)
+    end
+end
+
+def fun_l8_n406(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n684(x)
+    end
+end
+
+def fun_l8_n407(x)
+    if (x < 1)
+        fun_l9_n526(x)
+    else
+        fun_l9_n287(x)
+    end
+end
+
+def fun_l8_n408(x)
+    if (x < 1)
+        fun_l9_n377(x)
+    else
+        fun_l9_n351(x)
+    end
+end
+
+def fun_l8_n409(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n738(x)
+    end
+end
+
+def fun_l8_n410(x)
+    if (x < 1)
+        fun_l9_n61(x)
+    else
+        fun_l9_n499(x)
+    end
+end
+
+def fun_l8_n411(x)
+    if (x < 1)
+        fun_l9_n156(x)
+    else
+        fun_l9_n247(x)
+    end
+end
+
+def fun_l8_n412(x)
+    if (x < 1)
+        fun_l9_n431(x)
+    else
+        fun_l9_n636(x)
+    end
+end
+
+def fun_l8_n413(x)
+    if (x < 1)
+        fun_l9_n540(x)
+    else
+        fun_l9_n329(x)
+    end
+end
+
+def fun_l8_n414(x)
+    if (x < 1)
+        fun_l9_n49(x)
+    else
+        fun_l9_n979(x)
+    end
+end
+
+def fun_l8_n415(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n487(x)
+    end
+end
+
+def fun_l8_n416(x)
+    if (x < 1)
+        fun_l9_n679(x)
+    else
+        fun_l9_n644(x)
+    end
+end
+
+def fun_l8_n417(x)
+    if (x < 1)
+        fun_l9_n907(x)
+    else
+        fun_l9_n324(x)
+    end
+end
+
+def fun_l8_n418(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n495(x)
+    end
+end
+
+def fun_l8_n419(x)
+    if (x < 1)
+        fun_l9_n273(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n420(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n205(x)
+    end
+end
+
+def fun_l8_n421(x)
+    if (x < 1)
+        fun_l9_n484(x)
+    else
+        fun_l9_n80(x)
+    end
+end
+
+def fun_l8_n422(x)
+    if (x < 1)
+        fun_l9_n908(x)
+    else
+        fun_l9_n514(x)
+    end
+end
+
+def fun_l8_n423(x)
+    if (x < 1)
+        fun_l9_n265(x)
+    else
+        fun_l9_n190(x)
+    end
+end
+
+def fun_l8_n424(x)
+    if (x < 1)
+        fun_l9_n463(x)
+    else
+        fun_l9_n714(x)
+    end
+end
+
+def fun_l8_n425(x)
+    if (x < 1)
+        fun_l9_n780(x)
+    else
+        fun_l9_n444(x)
+    end
+end
+
+def fun_l8_n426(x)
+    if (x < 1)
+        fun_l9_n418(x)
+    else
+        fun_l9_n518(x)
+    end
+end
+
+def fun_l8_n427(x)
+    if (x < 1)
+        fun_l9_n912(x)
+    else
+        fun_l9_n27(x)
+    end
+end
+
+def fun_l8_n428(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n547(x)
+    end
+end
+
+def fun_l8_n429(x)
+    if (x < 1)
+        fun_l9_n760(x)
+    else
+        fun_l9_n466(x)
+    end
+end
+
+def fun_l8_n430(x)
+    if (x < 1)
+        fun_l9_n726(x)
+    else
+        fun_l9_n609(x)
+    end
+end
+
+def fun_l8_n431(x)
+    if (x < 1)
+        fun_l9_n206(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n432(x)
+    if (x < 1)
+        fun_l9_n396(x)
+    else
+        fun_l9_n325(x)
+    end
+end
+
+def fun_l8_n433(x)
+    if (x < 1)
+        fun_l9_n100(x)
+    else
+        fun_l9_n519(x)
+    end
+end
+
+def fun_l8_n434(x)
+    if (x < 1)
+        fun_l9_n923(x)
+    else
+        fun_l9_n387(x)
+    end
+end
+
+def fun_l8_n435(x)
+    if (x < 1)
+        fun_l9_n334(x)
+    else
+        fun_l9_n866(x)
+    end
+end
+
+def fun_l8_n436(x)
+    if (x < 1)
+        fun_l9_n896(x)
+    else
+        fun_l9_n780(x)
+    end
+end
+
+def fun_l8_n437(x)
+    if (x < 1)
+        fun_l9_n328(x)
+    else
+        fun_l9_n776(x)
+    end
+end
+
+def fun_l8_n438(x)
+    if (x < 1)
+        fun_l9_n414(x)
+    else
+        fun_l9_n884(x)
+    end
+end
+
+def fun_l8_n439(x)
+    if (x < 1)
+        fun_l9_n528(x)
+    else
+        fun_l9_n419(x)
+    end
+end
+
+def fun_l8_n440(x)
+    if (x < 1)
+        fun_l9_n192(x)
+    else
+        fun_l9_n973(x)
+    end
+end
+
+def fun_l8_n441(x)
+    if (x < 1)
+        fun_l9_n679(x)
+    else
+        fun_l9_n135(x)
+    end
+end
+
+def fun_l8_n442(x)
+    if (x < 1)
+        fun_l9_n294(x)
+    else
+        fun_l9_n138(x)
+    end
+end
+
+def fun_l8_n443(x)
+    if (x < 1)
+        fun_l9_n784(x)
+    else
+        fun_l9_n940(x)
+    end
+end
+
+def fun_l8_n444(x)
+    if (x < 1)
+        fun_l9_n834(x)
+    else
+        fun_l9_n127(x)
+    end
+end
+
+def fun_l8_n445(x)
+    if (x < 1)
+        fun_l9_n217(x)
+    else
+        fun_l9_n788(x)
+    end
+end
+
+def fun_l8_n446(x)
+    if (x < 1)
+        fun_l9_n173(x)
+    else
+        fun_l9_n49(x)
+    end
+end
+
+def fun_l8_n447(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n384(x)
+    end
+end
+
+def fun_l8_n448(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n761(x)
+    end
+end
+
+def fun_l8_n449(x)
+    if (x < 1)
+        fun_l9_n633(x)
+    else
+        fun_l9_n555(x)
+    end
+end
+
+def fun_l8_n450(x)
+    if (x < 1)
+        fun_l9_n25(x)
+    else
+        fun_l9_n714(x)
+    end
+end
+
+def fun_l8_n451(x)
+    if (x < 1)
+        fun_l9_n960(x)
+    else
+        fun_l9_n371(x)
+    end
+end
+
+def fun_l8_n452(x)
+    if (x < 1)
+        fun_l9_n733(x)
+    else
+        fun_l9_n996(x)
+    end
+end
+
+def fun_l8_n453(x)
+    if (x < 1)
+        fun_l9_n628(x)
+    else
+        fun_l9_n512(x)
+    end
+end
+
+def fun_l8_n454(x)
+    if (x < 1)
+        fun_l9_n406(x)
+    else
+        fun_l9_n671(x)
+    end
+end
+
+def fun_l8_n455(x)
+    if (x < 1)
+        fun_l9_n47(x)
+    else
+        fun_l9_n102(x)
+    end
+end
+
+def fun_l8_n456(x)
+    if (x < 1)
+        fun_l9_n85(x)
+    else
+        fun_l9_n591(x)
+    end
+end
+
+def fun_l8_n457(x)
+    if (x < 1)
+        fun_l9_n234(x)
+    else
+        fun_l9_n209(x)
+    end
+end
+
+def fun_l8_n458(x)
+    if (x < 1)
+        fun_l9_n186(x)
+    else
+        fun_l9_n928(x)
+    end
+end
+
+def fun_l8_n459(x)
+    if (x < 1)
+        fun_l9_n36(x)
+    else
+        fun_l9_n783(x)
+    end
+end
+
+def fun_l8_n460(x)
+    if (x < 1)
+        fun_l9_n775(x)
+    else
+        fun_l9_n641(x)
+    end
+end
+
+def fun_l8_n461(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n740(x)
+    end
+end
+
+def fun_l8_n462(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n113(x)
+    end
+end
+
+def fun_l8_n463(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n574(x)
+    end
+end
+
+def fun_l8_n464(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n776(x)
+    end
+end
+
+def fun_l8_n465(x)
+    if (x < 1)
+        fun_l9_n252(x)
+    else
+        fun_l9_n182(x)
+    end
+end
+
+def fun_l8_n466(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n849(x)
+    end
+end
+
+def fun_l8_n467(x)
+    if (x < 1)
+        fun_l9_n393(x)
+    else
+        fun_l9_n437(x)
+    end
+end
+
+def fun_l8_n468(x)
+    if (x < 1)
+        fun_l9_n269(x)
+    else
+        fun_l9_n381(x)
+    end
+end
+
+def fun_l8_n469(x)
+    if (x < 1)
+        fun_l9_n97(x)
+    else
+        fun_l9_n184(x)
+    end
+end
+
+def fun_l8_n470(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n621(x)
+    end
+end
+
+def fun_l8_n471(x)
+    if (x < 1)
+        fun_l9_n627(x)
+    else
+        fun_l9_n793(x)
+    end
+end
+
+def fun_l8_n472(x)
+    if (x < 1)
+        fun_l9_n117(x)
+    else
+        fun_l9_n318(x)
+    end
+end
+
+def fun_l8_n473(x)
+    if (x < 1)
+        fun_l9_n238(x)
+    else
+        fun_l9_n559(x)
+    end
+end
+
+def fun_l8_n474(x)
+    if (x < 1)
+        fun_l9_n81(x)
+    else
+        fun_l9_n355(x)
+    end
+end
+
+def fun_l8_n475(x)
+    if (x < 1)
+        fun_l9_n889(x)
+    else
+        fun_l9_n940(x)
+    end
+end
+
+def fun_l8_n476(x)
+    if (x < 1)
+        fun_l9_n358(x)
+    else
+        fun_l9_n52(x)
+    end
+end
+
+def fun_l8_n477(x)
+    if (x < 1)
+        fun_l9_n144(x)
+    else
+        fun_l9_n575(x)
+    end
+end
+
+def fun_l8_n478(x)
+    if (x < 1)
+        fun_l9_n975(x)
+    else
+        fun_l9_n740(x)
+    end
+end
+
+def fun_l8_n479(x)
+    if (x < 1)
+        fun_l9_n552(x)
+    else
+        fun_l9_n169(x)
+    end
+end
+
+def fun_l8_n480(x)
+    if (x < 1)
+        fun_l9_n854(x)
+    else
+        fun_l9_n524(x)
+    end
+end
+
+def fun_l8_n481(x)
+    if (x < 1)
+        fun_l9_n461(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n482(x)
+    if (x < 1)
+        fun_l9_n809(x)
+    else
+        fun_l9_n844(x)
+    end
+end
+
+def fun_l8_n483(x)
+    if (x < 1)
+        fun_l9_n741(x)
+    else
+        fun_l9_n327(x)
+    end
+end
+
+def fun_l8_n484(x)
+    if (x < 1)
+        fun_l9_n560(x)
+    else
+        fun_l9_n385(x)
+    end
+end
+
+def fun_l8_n485(x)
+    if (x < 1)
+        fun_l9_n798(x)
+    else
+        fun_l9_n154(x)
+    end
+end
+
+def fun_l8_n486(x)
+    if (x < 1)
+        fun_l9_n892(x)
+    else
+        fun_l9_n367(x)
+    end
+end
+
+def fun_l8_n487(x)
+    if (x < 1)
+        fun_l9_n423(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n488(x)
+    if (x < 1)
+        fun_l9_n618(x)
+    else
+        fun_l9_n649(x)
+    end
+end
+
+def fun_l8_n489(x)
+    if (x < 1)
+        fun_l9_n261(x)
+    else
+        fun_l9_n495(x)
+    end
+end
+
+def fun_l8_n490(x)
+    if (x < 1)
+        fun_l9_n566(x)
+    else
+        fun_l9_n405(x)
+    end
+end
+
+def fun_l8_n491(x)
+    if (x < 1)
+        fun_l9_n718(x)
+    else
+        fun_l9_n674(x)
+    end
+end
+
+def fun_l8_n492(x)
+    if (x < 1)
+        fun_l9_n487(x)
+    else
+        fun_l9_n95(x)
+    end
+end
+
+def fun_l8_n493(x)
+    if (x < 1)
+        fun_l9_n473(x)
+    else
+        fun_l9_n722(x)
+    end
+end
+
+def fun_l8_n494(x)
+    if (x < 1)
+        fun_l9_n460(x)
+    else
+        fun_l9_n157(x)
+    end
+end
+
+def fun_l8_n495(x)
+    if (x < 1)
+        fun_l9_n812(x)
+    else
+        fun_l9_n807(x)
+    end
+end
+
+def fun_l8_n496(x)
+    if (x < 1)
+        fun_l9_n609(x)
+    else
+        fun_l9_n697(x)
+    end
+end
+
+def fun_l8_n497(x)
+    if (x < 1)
+        fun_l9_n894(x)
+    else
+        fun_l9_n580(x)
+    end
+end
+
+def fun_l8_n498(x)
+    if (x < 1)
+        fun_l9_n642(x)
+    else
+        fun_l9_n13(x)
+    end
+end
+
+def fun_l8_n499(x)
+    if (x < 1)
+        fun_l9_n961(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n500(x)
+    if (x < 1)
+        fun_l9_n587(x)
+    else
+        fun_l9_n828(x)
+    end
+end
+
+def fun_l8_n501(x)
+    if (x < 1)
+        fun_l9_n30(x)
+    else
+        fun_l9_n966(x)
+    end
+end
+
+def fun_l8_n502(x)
+    if (x < 1)
+        fun_l9_n436(x)
+    else
+        fun_l9_n170(x)
+    end
+end
+
+def fun_l8_n503(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n927(x)
+    end
+end
+
+def fun_l8_n504(x)
+    if (x < 1)
+        fun_l9_n326(x)
+    else
+        fun_l9_n223(x)
+    end
+end
+
+def fun_l8_n505(x)
+    if (x < 1)
+        fun_l9_n911(x)
+    else
+        fun_l9_n746(x)
+    end
+end
+
+def fun_l8_n506(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n773(x)
+    end
+end
+
+def fun_l8_n507(x)
+    if (x < 1)
+        fun_l9_n514(x)
+    else
+        fun_l9_n882(x)
+    end
+end
+
+def fun_l8_n508(x)
+    if (x < 1)
+        fun_l9_n918(x)
+    else
+        fun_l9_n713(x)
+    end
+end
+
+def fun_l8_n509(x)
+    if (x < 1)
+        fun_l9_n694(x)
+    else
+        fun_l9_n950(x)
+    end
+end
+
+def fun_l8_n510(x)
+    if (x < 1)
+        fun_l9_n77(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n511(x)
+    if (x < 1)
+        fun_l9_n506(x)
+    else
+        fun_l9_n144(x)
+    end
+end
+
+def fun_l8_n512(x)
+    if (x < 1)
+        fun_l9_n69(x)
+    else
+        fun_l9_n308(x)
+    end
+end
+
+def fun_l8_n513(x)
+    if (x < 1)
+        fun_l9_n377(x)
+    else
+        fun_l9_n531(x)
+    end
+end
+
+def fun_l8_n514(x)
+    if (x < 1)
+        fun_l9_n342(x)
+    else
+        fun_l9_n265(x)
+    end
+end
+
+def fun_l8_n515(x)
+    if (x < 1)
+        fun_l9_n453(x)
+    else
+        fun_l9_n227(x)
+    end
+end
+
+def fun_l8_n516(x)
+    if (x < 1)
+        fun_l9_n396(x)
+    else
+        fun_l9_n130(x)
+    end
+end
+
+def fun_l8_n517(x)
+    if (x < 1)
+        fun_l9_n715(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n518(x)
+    if (x < 1)
+        fun_l9_n326(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n519(x)
+    if (x < 1)
+        fun_l9_n535(x)
+    else
+        fun_l9_n41(x)
+    end
+end
+
+def fun_l8_n520(x)
+    if (x < 1)
+        fun_l9_n985(x)
+    else
+        fun_l9_n942(x)
+    end
+end
+
+def fun_l8_n521(x)
+    if (x < 1)
+        fun_l9_n347(x)
+    else
+        fun_l9_n263(x)
+    end
+end
+
+def fun_l8_n522(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n378(x)
+    end
+end
+
+def fun_l8_n523(x)
+    if (x < 1)
+        fun_l9_n362(x)
+    else
+        fun_l9_n630(x)
+    end
+end
+
+def fun_l8_n524(x)
+    if (x < 1)
+        fun_l9_n382(x)
+    else
+        fun_l9_n256(x)
+    end
+end
+
+def fun_l8_n525(x)
+    if (x < 1)
+        fun_l9_n444(x)
+    else
+        fun_l9_n756(x)
+    end
+end
+
+def fun_l8_n526(x)
+    if (x < 1)
+        fun_l9_n5(x)
+    else
+        fun_l9_n754(x)
+    end
+end
+
+def fun_l8_n527(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n279(x)
+    end
+end
+
+def fun_l8_n528(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n246(x)
+    end
+end
+
+def fun_l8_n529(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n890(x)
+    end
+end
+
+def fun_l8_n530(x)
+    if (x < 1)
+        fun_l9_n624(x)
+    else
+        fun_l9_n548(x)
+    end
+end
+
+def fun_l8_n531(x)
+    if (x < 1)
+        fun_l9_n615(x)
+    else
+        fun_l9_n948(x)
+    end
+end
+
+def fun_l8_n532(x)
+    if (x < 1)
+        fun_l9_n519(x)
+    else
+        fun_l9_n583(x)
+    end
+end
+
+def fun_l8_n533(x)
+    if (x < 1)
+        fun_l9_n292(x)
+    else
+        fun_l9_n827(x)
+    end
+end
+
+def fun_l8_n534(x)
+    if (x < 1)
+        fun_l9_n893(x)
+    else
+        fun_l9_n877(x)
+    end
+end
+
+def fun_l8_n535(x)
+    if (x < 1)
+        fun_l9_n873(x)
+    else
+        fun_l9_n399(x)
+    end
+end
+
+def fun_l8_n536(x)
+    if (x < 1)
+        fun_l9_n497(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n537(x)
+    if (x < 1)
+        fun_l9_n404(x)
+    else
+        fun_l9_n815(x)
+    end
+end
+
+def fun_l8_n538(x)
+    if (x < 1)
+        fun_l9_n258(x)
+    else
+        fun_l9_n810(x)
+    end
+end
+
+def fun_l8_n539(x)
+    if (x < 1)
+        fun_l9_n907(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n540(x)
+    if (x < 1)
+        fun_l9_n752(x)
+    else
+        fun_l9_n597(x)
+    end
+end
+
+def fun_l8_n541(x)
+    if (x < 1)
+        fun_l9_n802(x)
+    else
+        fun_l9_n45(x)
+    end
+end
+
+def fun_l8_n542(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n470(x)
+    end
+end
+
+def fun_l8_n543(x)
+    if (x < 1)
+        fun_l9_n353(x)
+    else
+        fun_l9_n238(x)
+    end
+end
+
+def fun_l8_n544(x)
+    if (x < 1)
+        fun_l9_n656(x)
+    else
+        fun_l9_n569(x)
+    end
+end
+
+def fun_l8_n545(x)
+    if (x < 1)
+        fun_l9_n494(x)
+    else
+        fun_l9_n566(x)
+    end
+end
+
+def fun_l8_n546(x)
+    if (x < 1)
+        fun_l9_n65(x)
+    else
+        fun_l9_n896(x)
+    end
+end
+
+def fun_l8_n547(x)
+    if (x < 1)
+        fun_l9_n995(x)
+    else
+        fun_l9_n727(x)
+    end
+end
+
+def fun_l8_n548(x)
+    if (x < 1)
+        fun_l9_n562(x)
+    else
+        fun_l9_n759(x)
+    end
+end
+
+def fun_l8_n549(x)
+    if (x < 1)
+        fun_l9_n210(x)
+    else
+        fun_l9_n734(x)
+    end
+end
+
+def fun_l8_n550(x)
+    if (x < 1)
+        fun_l9_n482(x)
+    else
+        fun_l9_n11(x)
+    end
+end
+
+def fun_l8_n551(x)
+    if (x < 1)
+        fun_l9_n86(x)
+    else
+        fun_l9_n867(x)
+    end
+end
+
+def fun_l8_n552(x)
+    if (x < 1)
+        fun_l9_n647(x)
+    else
+        fun_l9_n293(x)
+    end
+end
+
+def fun_l8_n553(x)
+    if (x < 1)
+        fun_l9_n98(x)
+    else
+        fun_l9_n868(x)
+    end
+end
+
+def fun_l8_n554(x)
+    if (x < 1)
+        fun_l9_n380(x)
+    else
+        fun_l9_n2(x)
+    end
+end
+
+def fun_l8_n555(x)
+    if (x < 1)
+        fun_l9_n274(x)
+    else
+        fun_l9_n489(x)
+    end
+end
+
+def fun_l8_n556(x)
+    if (x < 1)
+        fun_l9_n623(x)
+    else
+        fun_l9_n848(x)
+    end
+end
+
+def fun_l8_n557(x)
+    if (x < 1)
+        fun_l9_n642(x)
+    else
+        fun_l9_n890(x)
+    end
+end
+
+def fun_l8_n558(x)
+    if (x < 1)
+        fun_l9_n247(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n559(x)
+    if (x < 1)
+        fun_l9_n896(x)
+    else
+        fun_l9_n937(x)
+    end
+end
+
+def fun_l8_n560(x)
+    if (x < 1)
+        fun_l9_n592(x)
+    else
+        fun_l9_n211(x)
+    end
+end
+
+def fun_l8_n561(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n971(x)
+    end
+end
+
+def fun_l8_n562(x)
+    if (x < 1)
+        fun_l9_n663(x)
+    else
+        fun_l9_n147(x)
+    end
+end
+
+def fun_l8_n563(x)
+    if (x < 1)
+        fun_l9_n722(x)
+    else
+        fun_l9_n649(x)
+    end
+end
+
+def fun_l8_n564(x)
+    if (x < 1)
+        fun_l9_n605(x)
+    else
+        fun_l9_n58(x)
+    end
+end
+
+def fun_l8_n565(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n617(x)
+    end
+end
+
+def fun_l8_n566(x)
+    if (x < 1)
+        fun_l9_n772(x)
+    else
+        fun_l9_n428(x)
+    end
+end
+
+def fun_l8_n567(x)
+    if (x < 1)
+        fun_l9_n870(x)
+    else
+        fun_l9_n672(x)
+    end
+end
+
+def fun_l8_n568(x)
+    if (x < 1)
+        fun_l9_n946(x)
+    else
+        fun_l9_n465(x)
+    end
+end
+
+def fun_l8_n569(x)
+    if (x < 1)
+        fun_l9_n507(x)
+    else
+        fun_l9_n346(x)
+    end
+end
+
+def fun_l8_n570(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n70(x)
+    end
+end
+
+def fun_l8_n571(x)
+    if (x < 1)
+        fun_l9_n549(x)
+    else
+        fun_l9_n831(x)
+    end
+end
+
+def fun_l8_n572(x)
+    if (x < 1)
+        fun_l9_n463(x)
+    else
+        fun_l9_n843(x)
+    end
+end
+
+def fun_l8_n573(x)
+    if (x < 1)
+        fun_l9_n676(x)
+    else
+        fun_l9_n651(x)
+    end
+end
+
+def fun_l8_n574(x)
+    if (x < 1)
+        fun_l9_n648(x)
+    else
+        fun_l9_n562(x)
+    end
+end
+
+def fun_l8_n575(x)
+    if (x < 1)
+        fun_l9_n771(x)
+    else
+        fun_l9_n549(x)
+    end
+end
+
+def fun_l8_n576(x)
+    if (x < 1)
+        fun_l9_n899(x)
+    else
+        fun_l9_n436(x)
+    end
+end
+
+def fun_l8_n577(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n708(x)
+    end
+end
+
+def fun_l8_n578(x)
+    if (x < 1)
+        fun_l9_n49(x)
+    else
+        fun_l9_n559(x)
+    end
+end
+
+def fun_l8_n579(x)
+    if (x < 1)
+        fun_l9_n937(x)
+    else
+        fun_l9_n962(x)
+    end
+end
+
+def fun_l8_n580(x)
+    if (x < 1)
+        fun_l9_n970(x)
+    else
+        fun_l9_n203(x)
+    end
+end
+
+def fun_l8_n581(x)
+    if (x < 1)
+        fun_l9_n901(x)
+    else
+        fun_l9_n666(x)
+    end
+end
+
+def fun_l8_n582(x)
+    if (x < 1)
+        fun_l9_n79(x)
+    else
+        fun_l9_n260(x)
+    end
+end
+
+def fun_l8_n583(x)
+    if (x < 1)
+        fun_l9_n167(x)
+    else
+        fun_l9_n512(x)
+    end
+end
+
+def fun_l8_n584(x)
+    if (x < 1)
+        fun_l9_n750(x)
+    else
+        fun_l9_n406(x)
+    end
+end
+
+def fun_l8_n585(x)
+    if (x < 1)
+        fun_l9_n118(x)
+    else
+        fun_l9_n525(x)
+    end
+end
+
+def fun_l8_n586(x)
+    if (x < 1)
+        fun_l9_n573(x)
+    else
+        fun_l9_n657(x)
+    end
+end
+
+def fun_l8_n587(x)
+    if (x < 1)
+        fun_l9_n228(x)
+    else
+        fun_l9_n903(x)
+    end
+end
+
+def fun_l8_n588(x)
+    if (x < 1)
+        fun_l9_n971(x)
+    else
+        fun_l9_n608(x)
+    end
+end
+
+def fun_l8_n589(x)
+    if (x < 1)
+        fun_l9_n334(x)
+    else
+        fun_l9_n704(x)
+    end
+end
+
+def fun_l8_n590(x)
+    if (x < 1)
+        fun_l9_n398(x)
+    else
+        fun_l9_n500(x)
+    end
+end
+
+def fun_l8_n591(x)
+    if (x < 1)
+        fun_l9_n196(x)
+    else
+        fun_l9_n616(x)
+    end
+end
+
+def fun_l8_n592(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n655(x)
+    end
+end
+
+def fun_l8_n593(x)
+    if (x < 1)
+        fun_l9_n864(x)
+    else
+        fun_l9_n697(x)
+    end
+end
+
+def fun_l8_n594(x)
+    if (x < 1)
+        fun_l9_n35(x)
+    else
+        fun_l9_n554(x)
+    end
+end
+
+def fun_l8_n595(x)
+    if (x < 1)
+        fun_l9_n480(x)
+    else
+        fun_l9_n688(x)
+    end
+end
+
+def fun_l8_n596(x)
+    if (x < 1)
+        fun_l9_n846(x)
+    else
+        fun_l9_n403(x)
+    end
+end
+
+def fun_l8_n597(x)
+    if (x < 1)
+        fun_l9_n522(x)
+    else
+        fun_l9_n532(x)
+    end
+end
+
+def fun_l8_n598(x)
+    if (x < 1)
+        fun_l9_n800(x)
+    else
+        fun_l9_n531(x)
+    end
+end
+
+def fun_l8_n599(x)
+    if (x < 1)
+        fun_l9_n64(x)
+    else
+        fun_l9_n876(x)
+    end
+end
+
+def fun_l8_n600(x)
+    if (x < 1)
+        fun_l9_n614(x)
+    else
+        fun_l9_n660(x)
+    end
+end
+
+def fun_l8_n601(x)
+    if (x < 1)
+        fun_l9_n119(x)
+    else
+        fun_l9_n998(x)
+    end
+end
+
+def fun_l8_n602(x)
+    if (x < 1)
+        fun_l9_n549(x)
+    else
+        fun_l9_n911(x)
+    end
+end
+
+def fun_l8_n603(x)
+    if (x < 1)
+        fun_l9_n659(x)
+    else
+        fun_l9_n664(x)
+    end
+end
+
+def fun_l8_n604(x)
+    if (x < 1)
+        fun_l9_n570(x)
+    else
+        fun_l9_n960(x)
+    end
+end
+
+def fun_l8_n605(x)
+    if (x < 1)
+        fun_l9_n82(x)
+    else
+        fun_l9_n658(x)
+    end
+end
+
+def fun_l8_n606(x)
+    if (x < 1)
+        fun_l9_n379(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n607(x)
+    if (x < 1)
+        fun_l9_n104(x)
+    else
+        fun_l9_n869(x)
+    end
+end
+
+def fun_l8_n608(x)
+    if (x < 1)
+        fun_l9_n874(x)
+    else
+        fun_l9_n63(x)
+    end
+end
+
+def fun_l8_n609(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n667(x)
+    end
+end
+
+def fun_l8_n610(x)
+    if (x < 1)
+        fun_l9_n1(x)
+    else
+        fun_l9_n524(x)
+    end
+end
+
+def fun_l8_n611(x)
+    if (x < 1)
+        fun_l9_n523(x)
+    else
+        fun_l9_n230(x)
+    end
+end
+
+def fun_l8_n612(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n129(x)
+    end
+end
+
+def fun_l8_n613(x)
+    if (x < 1)
+        fun_l9_n591(x)
+    else
+        fun_l9_n551(x)
+    end
+end
+
+def fun_l8_n614(x)
+    if (x < 1)
+        fun_l9_n860(x)
+    else
+        fun_l9_n358(x)
+    end
+end
+
+def fun_l8_n615(x)
+    if (x < 1)
+        fun_l9_n387(x)
+    else
+        fun_l9_n425(x)
+    end
+end
+
+def fun_l8_n616(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n449(x)
+    end
+end
+
+def fun_l8_n617(x)
+    if (x < 1)
+        fun_l9_n627(x)
+    else
+        fun_l9_n399(x)
+    end
+end
+
+def fun_l8_n618(x)
+    if (x < 1)
+        fun_l9_n244(x)
+    else
+        fun_l9_n24(x)
+    end
+end
+
+def fun_l8_n619(x)
+    if (x < 1)
+        fun_l9_n574(x)
+    else
+        fun_l9_n640(x)
+    end
+end
+
+def fun_l8_n620(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n6(x)
+    end
+end
+
+def fun_l8_n621(x)
+    if (x < 1)
+        fun_l9_n148(x)
+    else
+        fun_l9_n718(x)
+    end
+end
+
+def fun_l8_n622(x)
+    if (x < 1)
+        fun_l9_n151(x)
+    else
+        fun_l9_n56(x)
+    end
+end
+
+def fun_l8_n623(x)
+    if (x < 1)
+        fun_l9_n672(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n624(x)
+    if (x < 1)
+        fun_l9_n948(x)
+    else
+        fun_l9_n530(x)
+    end
+end
+
+def fun_l8_n625(x)
+    if (x < 1)
+        fun_l9_n0(x)
+    else
+        fun_l9_n334(x)
+    end
+end
+
+def fun_l8_n626(x)
+    if (x < 1)
+        fun_l9_n736(x)
+    else
+        fun_l9_n922(x)
+    end
+end
+
+def fun_l8_n627(x)
+    if (x < 1)
+        fun_l9_n291(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n628(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n4(x)
+    end
+end
+
+def fun_l8_n629(x)
+    if (x < 1)
+        fun_l9_n890(x)
+    else
+        fun_l9_n297(x)
+    end
+end
+
+def fun_l8_n630(x)
+    if (x < 1)
+        fun_l9_n860(x)
+    else
+        fun_l9_n74(x)
+    end
+end
+
+def fun_l8_n631(x)
+    if (x < 1)
+        fun_l9_n400(x)
+    else
+        fun_l9_n584(x)
+    end
+end
+
+def fun_l8_n632(x)
+    if (x < 1)
+        fun_l9_n714(x)
+    else
+        fun_l9_n200(x)
+    end
+end
+
+def fun_l8_n633(x)
+    if (x < 1)
+        fun_l9_n433(x)
+    else
+        fun_l9_n489(x)
+    end
+end
+
+def fun_l8_n634(x)
+    if (x < 1)
+        fun_l9_n974(x)
+    else
+        fun_l9_n25(x)
+    end
+end
+
+def fun_l8_n635(x)
+    if (x < 1)
+        fun_l9_n739(x)
+    else
+        fun_l9_n695(x)
+    end
+end
+
+def fun_l8_n636(x)
+    if (x < 1)
+        fun_l9_n855(x)
+    else
+        fun_l9_n898(x)
+    end
+end
+
+def fun_l8_n637(x)
+    if (x < 1)
+        fun_l9_n868(x)
+    else
+        fun_l9_n825(x)
+    end
+end
+
+def fun_l8_n638(x)
+    if (x < 1)
+        fun_l9_n537(x)
+    else
+        fun_l9_n417(x)
+    end
+end
+
+def fun_l8_n639(x)
+    if (x < 1)
+        fun_l9_n975(x)
+    else
+        fun_l9_n484(x)
+    end
+end
+
+def fun_l8_n640(x)
+    if (x < 1)
+        fun_l9_n228(x)
+    else
+        fun_l9_n964(x)
+    end
+end
+
+def fun_l8_n641(x)
+    if (x < 1)
+        fun_l9_n743(x)
+    else
+        fun_l9_n986(x)
+    end
+end
+
+def fun_l8_n642(x)
+    if (x < 1)
+        fun_l9_n763(x)
+    else
+        fun_l9_n747(x)
+    end
+end
+
+def fun_l8_n643(x)
+    if (x < 1)
+        fun_l9_n77(x)
+    else
+        fun_l9_n149(x)
+    end
+end
+
+def fun_l8_n644(x)
+    if (x < 1)
+        fun_l9_n393(x)
+    else
+        fun_l9_n694(x)
+    end
+end
+
+def fun_l8_n645(x)
+    if (x < 1)
+        fun_l9_n196(x)
+    else
+        fun_l9_n211(x)
+    end
+end
+
+def fun_l8_n646(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n649(x)
+    end
+end
+
+def fun_l8_n647(x)
+    if (x < 1)
+        fun_l9_n669(x)
+    else
+        fun_l9_n12(x)
+    end
+end
+
+def fun_l8_n648(x)
+    if (x < 1)
+        fun_l9_n175(x)
+    else
+        fun_l9_n388(x)
+    end
+end
+
+def fun_l8_n649(x)
+    if (x < 1)
+        fun_l9_n122(x)
+    else
+        fun_l9_n736(x)
+    end
+end
+
+def fun_l8_n650(x)
+    if (x < 1)
+        fun_l9_n817(x)
+    else
+        fun_l9_n274(x)
+    end
+end
+
+def fun_l8_n651(x)
+    if (x < 1)
+        fun_l9_n919(x)
+    else
+        fun_l9_n538(x)
+    end
+end
+
+def fun_l8_n652(x)
+    if (x < 1)
+        fun_l9_n171(x)
+    else
+        fun_l9_n895(x)
+    end
+end
+
+def fun_l8_n653(x)
+    if (x < 1)
+        fun_l9_n417(x)
+    else
+        fun_l9_n618(x)
+    end
+end
+
+def fun_l8_n654(x)
+    if (x < 1)
+        fun_l9_n709(x)
+    else
+        fun_l9_n892(x)
+    end
+end
+
+def fun_l8_n655(x)
+    if (x < 1)
+        fun_l9_n906(x)
+    else
+        fun_l9_n602(x)
+    end
+end
+
+def fun_l8_n656(x)
+    if (x < 1)
+        fun_l9_n769(x)
+    else
+        fun_l9_n554(x)
+    end
+end
+
+def fun_l8_n657(x)
+    if (x < 1)
+        fun_l9_n468(x)
+    else
+        fun_l9_n320(x)
+    end
+end
+
+def fun_l8_n658(x)
+    if (x < 1)
+        fun_l9_n38(x)
+    else
+        fun_l9_n947(x)
+    end
+end
+
+def fun_l8_n659(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n327(x)
+    end
+end
+
+def fun_l8_n660(x)
+    if (x < 1)
+        fun_l9_n452(x)
+    else
+        fun_l9_n313(x)
+    end
+end
+
+def fun_l8_n661(x)
+    if (x < 1)
+        fun_l9_n568(x)
+    else
+        fun_l9_n383(x)
+    end
+end
+
+def fun_l8_n662(x)
+    if (x < 1)
+        fun_l9_n795(x)
+    else
+        fun_l9_n680(x)
+    end
+end
+
+def fun_l8_n663(x)
+    if (x < 1)
+        fun_l9_n152(x)
+    else
+        fun_l9_n846(x)
+    end
+end
+
+def fun_l8_n664(x)
+    if (x < 1)
+        fun_l9_n585(x)
+    else
+        fun_l9_n670(x)
+    end
+end
+
+def fun_l8_n665(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n799(x)
+    end
+end
+
+def fun_l8_n666(x)
+    if (x < 1)
+        fun_l9_n699(x)
+    else
+        fun_l9_n311(x)
+    end
+end
+
+def fun_l8_n667(x)
+    if (x < 1)
+        fun_l9_n558(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n668(x)
+    if (x < 1)
+        fun_l9_n825(x)
+    else
+        fun_l9_n534(x)
+    end
+end
+
+def fun_l8_n669(x)
+    if (x < 1)
+        fun_l9_n143(x)
+    else
+        fun_l9_n21(x)
+    end
+end
+
+def fun_l8_n670(x)
+    if (x < 1)
+        fun_l9_n827(x)
+    else
+        fun_l9_n679(x)
+    end
+end
+
+def fun_l8_n671(x)
+    if (x < 1)
+        fun_l9_n704(x)
+    else
+        fun_l9_n922(x)
+    end
+end
+
+def fun_l8_n672(x)
+    if (x < 1)
+        fun_l9_n776(x)
+    else
+        fun_l9_n867(x)
+    end
+end
+
+def fun_l8_n673(x)
+    if (x < 1)
+        fun_l9_n871(x)
+    else
+        fun_l9_n315(x)
+    end
+end
+
+def fun_l8_n674(x)
+    if (x < 1)
+        fun_l9_n860(x)
+    else
+        fun_l9_n945(x)
+    end
+end
+
+def fun_l8_n675(x)
+    if (x < 1)
+        fun_l9_n890(x)
+    else
+        fun_l9_n629(x)
+    end
+end
+
+def fun_l8_n676(x)
+    if (x < 1)
+        fun_l9_n91(x)
+    else
+        fun_l9_n35(x)
+    end
+end
+
+def fun_l8_n677(x)
+    if (x < 1)
+        fun_l9_n825(x)
+    else
+        fun_l9_n922(x)
+    end
+end
+
+def fun_l8_n678(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n156(x)
+    end
+end
+
+def fun_l8_n679(x)
+    if (x < 1)
+        fun_l9_n455(x)
+    else
+        fun_l9_n809(x)
+    end
+end
+
+def fun_l8_n680(x)
+    if (x < 1)
+        fun_l9_n213(x)
+    else
+        fun_l9_n944(x)
+    end
+end
+
+def fun_l8_n681(x)
+    if (x < 1)
+        fun_l9_n760(x)
+    else
+        fun_l9_n137(x)
+    end
+end
+
+def fun_l8_n682(x)
+    if (x < 1)
+        fun_l9_n998(x)
+    else
+        fun_l9_n703(x)
+    end
+end
+
+def fun_l8_n683(x)
+    if (x < 1)
+        fun_l9_n988(x)
+    else
+        fun_l9_n952(x)
+    end
+end
+
+def fun_l8_n684(x)
+    if (x < 1)
+        fun_l9_n583(x)
+    else
+        fun_l9_n890(x)
+    end
+end
+
+def fun_l8_n685(x)
+    if (x < 1)
+        fun_l9_n879(x)
+    else
+        fun_l9_n978(x)
+    end
+end
+
+def fun_l8_n686(x)
+    if (x < 1)
+        fun_l9_n6(x)
+    else
+        fun_l9_n978(x)
+    end
+end
+
+def fun_l8_n687(x)
+    if (x < 1)
+        fun_l9_n67(x)
+    else
+        fun_l9_n149(x)
+    end
+end
+
+def fun_l8_n688(x)
+    if (x < 1)
+        fun_l9_n386(x)
+    else
+        fun_l9_n293(x)
+    end
+end
+
+def fun_l8_n689(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n140(x)
+    end
+end
+
+def fun_l8_n690(x)
+    if (x < 1)
+        fun_l9_n92(x)
+    else
+        fun_l9_n550(x)
+    end
+end
+
+def fun_l8_n691(x)
+    if (x < 1)
+        fun_l9_n456(x)
+    else
+        fun_l9_n976(x)
+    end
+end
+
+def fun_l8_n692(x)
+    if (x < 1)
+        fun_l9_n516(x)
+    else
+        fun_l9_n145(x)
+    end
+end
+
+def fun_l8_n693(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n647(x)
+    end
+end
+
+def fun_l8_n694(x)
+    if (x < 1)
+        fun_l9_n348(x)
+    else
+        fun_l9_n86(x)
+    end
+end
+
+def fun_l8_n695(x)
+    if (x < 1)
+        fun_l9_n546(x)
+    else
+        fun_l9_n320(x)
+    end
+end
+
+def fun_l8_n696(x)
+    if (x < 1)
+        fun_l9_n588(x)
+    else
+        fun_l9_n285(x)
+    end
+end
+
+def fun_l8_n697(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n710(x)
+    end
+end
+
+def fun_l8_n698(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n217(x)
+    end
+end
+
+def fun_l8_n699(x)
+    if (x < 1)
+        fun_l9_n714(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n700(x)
+    if (x < 1)
+        fun_l9_n378(x)
+    else
+        fun_l9_n122(x)
+    end
+end
+
+def fun_l8_n701(x)
+    if (x < 1)
+        fun_l9_n696(x)
+    else
+        fun_l9_n577(x)
+    end
+end
+
+def fun_l8_n702(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n578(x)
+    end
+end
+
+def fun_l8_n703(x)
+    if (x < 1)
+        fun_l9_n502(x)
+    else
+        fun_l9_n410(x)
+    end
+end
+
+def fun_l8_n704(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n532(x)
+    end
+end
+
+def fun_l8_n705(x)
+    if (x < 1)
+        fun_l9_n662(x)
+    else
+        fun_l9_n361(x)
+    end
+end
+
+def fun_l8_n706(x)
+    if (x < 1)
+        fun_l9_n109(x)
+    else
+        fun_l9_n380(x)
+    end
+end
+
+def fun_l8_n707(x)
+    if (x < 1)
+        fun_l9_n653(x)
+    else
+        fun_l9_n566(x)
+    end
+end
+
+def fun_l8_n708(x)
+    if (x < 1)
+        fun_l9_n587(x)
+    else
+        fun_l9_n465(x)
+    end
+end
+
+def fun_l8_n709(x)
+    if (x < 1)
+        fun_l9_n523(x)
+    else
+        fun_l9_n274(x)
+    end
+end
+
+def fun_l8_n710(x)
+    if (x < 1)
+        fun_l9_n459(x)
+    else
+        fun_l9_n872(x)
+    end
+end
+
+def fun_l8_n711(x)
+    if (x < 1)
+        fun_l9_n71(x)
+    else
+        fun_l9_n135(x)
+    end
+end
+
+def fun_l8_n712(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n405(x)
+    end
+end
+
+def fun_l8_n713(x)
+    if (x < 1)
+        fun_l9_n233(x)
+    else
+        fun_l9_n232(x)
+    end
+end
+
+def fun_l8_n714(x)
+    if (x < 1)
+        fun_l9_n29(x)
+    else
+        fun_l9_n23(x)
+    end
+end
+
+def fun_l8_n715(x)
+    if (x < 1)
+        fun_l9_n44(x)
+    else
+        fun_l9_n185(x)
+    end
+end
+
+def fun_l8_n716(x)
+    if (x < 1)
+        fun_l9_n980(x)
+    else
+        fun_l9_n967(x)
+    end
+end
+
+def fun_l8_n717(x)
+    if (x < 1)
+        fun_l9_n323(x)
+    else
+        fun_l9_n636(x)
+    end
+end
+
+def fun_l8_n718(x)
+    if (x < 1)
+        fun_l9_n733(x)
+    else
+        fun_l9_n10(x)
+    end
+end
+
+def fun_l8_n719(x)
+    if (x < 1)
+        fun_l9_n100(x)
+    else
+        fun_l9_n123(x)
+    end
+end
+
+def fun_l8_n720(x)
+    if (x < 1)
+        fun_l9_n572(x)
+    else
+        fun_l9_n813(x)
+    end
+end
+
+def fun_l8_n721(x)
+    if (x < 1)
+        fun_l9_n634(x)
+    else
+        fun_l9_n152(x)
+    end
+end
+
+def fun_l8_n722(x)
+    if (x < 1)
+        fun_l9_n527(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n723(x)
+    if (x < 1)
+        fun_l9_n202(x)
+    else
+        fun_l9_n294(x)
+    end
+end
+
+def fun_l8_n724(x)
+    if (x < 1)
+        fun_l9_n668(x)
+    else
+        fun_l9_n792(x)
+    end
+end
+
+def fun_l8_n725(x)
+    if (x < 1)
+        fun_l9_n309(x)
+    else
+        fun_l9_n612(x)
+    end
+end
+
+def fun_l8_n726(x)
+    if (x < 1)
+        fun_l9_n320(x)
+    else
+        fun_l9_n459(x)
+    end
+end
+
+def fun_l8_n727(x)
+    if (x < 1)
+        fun_l9_n355(x)
+    else
+        fun_l9_n321(x)
+    end
+end
+
+def fun_l8_n728(x)
+    if (x < 1)
+        fun_l9_n237(x)
+    else
+        fun_l9_n135(x)
+    end
+end
+
+def fun_l8_n729(x)
+    if (x < 1)
+        fun_l9_n980(x)
+    else
+        fun_l9_n209(x)
+    end
+end
+
+def fun_l8_n730(x)
+    if (x < 1)
+        fun_l9_n957(x)
+    else
+        fun_l9_n481(x)
+    end
+end
+
+def fun_l8_n731(x)
+    if (x < 1)
+        fun_l9_n594(x)
+    else
+        fun_l9_n396(x)
+    end
+end
+
+def fun_l8_n732(x)
+    if (x < 1)
+        fun_l9_n916(x)
+    else
+        fun_l9_n473(x)
+    end
+end
+
+def fun_l8_n733(x)
+    if (x < 1)
+        fun_l9_n376(x)
+    else
+        fun_l9_n231(x)
+    end
+end
+
+def fun_l8_n734(x)
+    if (x < 1)
+        fun_l9_n758(x)
+    else
+        fun_l9_n111(x)
+    end
+end
+
+def fun_l8_n735(x)
+    if (x < 1)
+        fun_l9_n131(x)
+    else
+        fun_l9_n586(x)
+    end
+end
+
+def fun_l8_n736(x)
+    if (x < 1)
+        fun_l9_n290(x)
+    else
+        fun_l9_n227(x)
+    end
+end
+
+def fun_l8_n737(x)
+    if (x < 1)
+        fun_l9_n784(x)
+    else
+        fun_l9_n869(x)
+    end
+end
+
+def fun_l8_n738(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n79(x)
+    end
+end
+
+def fun_l8_n739(x)
+    if (x < 1)
+        fun_l9_n489(x)
+    else
+        fun_l9_n347(x)
+    end
+end
+
+def fun_l8_n740(x)
+    if (x < 1)
+        fun_l9_n4(x)
+    else
+        fun_l9_n587(x)
+    end
+end
+
+def fun_l8_n741(x)
+    if (x < 1)
+        fun_l9_n949(x)
+    else
+        fun_l9_n196(x)
+    end
+end
+
+def fun_l8_n742(x)
+    if (x < 1)
+        fun_l9_n577(x)
+    else
+        fun_l9_n562(x)
+    end
+end
+
+def fun_l8_n743(x)
+    if (x < 1)
+        fun_l9_n656(x)
+    else
+        fun_l9_n685(x)
+    end
+end
+
+def fun_l8_n744(x)
+    if (x < 1)
+        fun_l9_n792(x)
+    else
+        fun_l9_n572(x)
+    end
+end
+
+def fun_l8_n745(x)
+    if (x < 1)
+        fun_l9_n318(x)
+    else
+        fun_l9_n335(x)
+    end
+end
+
+def fun_l8_n746(x)
+    if (x < 1)
+        fun_l9_n59(x)
+    else
+        fun_l9_n109(x)
+    end
+end
+
+def fun_l8_n747(x)
+    if (x < 1)
+        fun_l9_n276(x)
+    else
+        fun_l9_n567(x)
+    end
+end
+
+def fun_l8_n748(x)
+    if (x < 1)
+        fun_l9_n902(x)
+    else
+        fun_l9_n220(x)
+    end
+end
+
+def fun_l8_n749(x)
+    if (x < 1)
+        fun_l9_n208(x)
+    else
+        fun_l9_n108(x)
+    end
+end
+
+def fun_l8_n750(x)
+    if (x < 1)
+        fun_l9_n927(x)
+    else
+        fun_l9_n950(x)
+    end
+end
+
+def fun_l8_n751(x)
+    if (x < 1)
+        fun_l9_n371(x)
+    else
+        fun_l9_n72(x)
+    end
+end
+
+def fun_l8_n752(x)
+    if (x < 1)
+        fun_l9_n455(x)
+    else
+        fun_l9_n467(x)
+    end
+end
+
+def fun_l8_n753(x)
+    if (x < 1)
+        fun_l9_n344(x)
+    else
+        fun_l9_n82(x)
+    end
+end
+
+def fun_l8_n754(x)
+    if (x < 1)
+        fun_l9_n902(x)
+    else
+        fun_l9_n219(x)
+    end
+end
+
+def fun_l8_n755(x)
+    if (x < 1)
+        fun_l9_n101(x)
+    else
+        fun_l9_n523(x)
+    end
+end
+
+def fun_l8_n756(x)
+    if (x < 1)
+        fun_l9_n517(x)
+    else
+        fun_l9_n97(x)
+    end
+end
+
+def fun_l8_n757(x)
+    if (x < 1)
+        fun_l9_n571(x)
+    else
+        fun_l9_n650(x)
+    end
+end
+
+def fun_l8_n758(x)
+    if (x < 1)
+        fun_l9_n701(x)
+    else
+        fun_l9_n962(x)
+    end
+end
+
+def fun_l8_n759(x)
+    if (x < 1)
+        fun_l9_n589(x)
+    else
+        fun_l9_n808(x)
+    end
+end
+
+def fun_l8_n760(x)
+    if (x < 1)
+        fun_l9_n570(x)
+    else
+        fun_l9_n90(x)
+    end
+end
+
+def fun_l8_n761(x)
+    if (x < 1)
+        fun_l9_n792(x)
+    else
+        fun_l9_n673(x)
+    end
+end
+
+def fun_l8_n762(x)
+    if (x < 1)
+        fun_l9_n514(x)
+    else
+        fun_l9_n771(x)
+    end
+end
+
+def fun_l8_n763(x)
+    if (x < 1)
+        fun_l9_n404(x)
+    else
+        fun_l9_n264(x)
+    end
+end
+
+def fun_l8_n764(x)
+    if (x < 1)
+        fun_l9_n270(x)
+    else
+        fun_l9_n738(x)
+    end
+end
+
+def fun_l8_n765(x)
+    if (x < 1)
+        fun_l9_n915(x)
+    else
+        fun_l9_n901(x)
+    end
+end
+
+def fun_l8_n766(x)
+    if (x < 1)
+        fun_l9_n120(x)
+    else
+        fun_l9_n176(x)
+    end
+end
+
+def fun_l8_n767(x)
+    if (x < 1)
+        fun_l9_n470(x)
+    else
+        fun_l9_n837(x)
+    end
+end
+
+def fun_l8_n768(x)
+    if (x < 1)
+        fun_l9_n912(x)
+    else
+        fun_l9_n898(x)
+    end
+end
+
+def fun_l8_n769(x)
+    if (x < 1)
+        fun_l9_n76(x)
+    else
+        fun_l9_n350(x)
+    end
+end
+
+def fun_l8_n770(x)
+    if (x < 1)
+        fun_l9_n487(x)
+    else
+        fun_l9_n572(x)
+    end
+end
+
+def fun_l8_n771(x)
+    if (x < 1)
+        fun_l9_n823(x)
+    else
+        fun_l9_n815(x)
+    end
+end
+
+def fun_l8_n772(x)
+    if (x < 1)
+        fun_l9_n655(x)
+    else
+        fun_l9_n968(x)
+    end
+end
+
+def fun_l8_n773(x)
+    if (x < 1)
+        fun_l9_n824(x)
+    else
+        fun_l9_n741(x)
+    end
+end
+
+def fun_l8_n774(x)
+    if (x < 1)
+        fun_l9_n143(x)
+    else
+        fun_l9_n641(x)
+    end
+end
+
+def fun_l8_n775(x)
+    if (x < 1)
+        fun_l9_n985(x)
+    else
+        fun_l9_n592(x)
+    end
+end
+
+def fun_l8_n776(x)
+    if (x < 1)
+        fun_l9_n686(x)
+    else
+        fun_l9_n234(x)
+    end
+end
+
+def fun_l8_n777(x)
+    if (x < 1)
+        fun_l9_n540(x)
+    else
+        fun_l9_n794(x)
+    end
+end
+
+def fun_l8_n778(x)
+    if (x < 1)
+        fun_l9_n154(x)
+    else
+        fun_l9_n656(x)
+    end
+end
+
+def fun_l8_n779(x)
+    if (x < 1)
+        fun_l9_n836(x)
+    else
+        fun_l9_n756(x)
+    end
+end
+
+def fun_l8_n780(x)
+    if (x < 1)
+        fun_l9_n98(x)
+    else
+        fun_l9_n233(x)
+    end
+end
+
+def fun_l8_n781(x)
+    if (x < 1)
+        fun_l9_n584(x)
+    else
+        fun_l9_n398(x)
+    end
+end
+
+def fun_l8_n782(x)
+    if (x < 1)
+        fun_l9_n851(x)
+    else
+        fun_l9_n967(x)
+    end
+end
+
+def fun_l8_n783(x)
+    if (x < 1)
+        fun_l9_n868(x)
+    else
+        fun_l9_n57(x)
+    end
+end
+
+def fun_l8_n784(x)
+    if (x < 1)
+        fun_l9_n782(x)
+    else
+        fun_l9_n214(x)
+    end
+end
+
+def fun_l8_n785(x)
+    if (x < 1)
+        fun_l9_n79(x)
+    else
+        fun_l9_n489(x)
+    end
+end
+
+def fun_l8_n786(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n918(x)
+    end
+end
+
+def fun_l8_n787(x)
+    if (x < 1)
+        fun_l9_n985(x)
+    else
+        fun_l9_n781(x)
+    end
+end
+
+def fun_l8_n788(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n542(x)
+    end
+end
+
+def fun_l8_n789(x)
+    if (x < 1)
+        fun_l9_n982(x)
+    else
+        fun_l9_n834(x)
+    end
+end
+
+def fun_l8_n790(x)
+    if (x < 1)
+        fun_l9_n482(x)
+    else
+        fun_l9_n424(x)
+    end
+end
+
+def fun_l8_n791(x)
+    if (x < 1)
+        fun_l9_n289(x)
+    else
+        fun_l9_n487(x)
+    end
+end
+
+def fun_l8_n792(x)
+    if (x < 1)
+        fun_l9_n820(x)
+    else
+        fun_l9_n242(x)
+    end
+end
+
+def fun_l8_n793(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n356(x)
+    end
+end
+
+def fun_l8_n794(x)
+    if (x < 1)
+        fun_l9_n142(x)
+    else
+        fun_l9_n607(x)
+    end
+end
+
+def fun_l8_n795(x)
+    if (x < 1)
+        fun_l9_n21(x)
+    else
+        fun_l9_n14(x)
+    end
+end
+
+def fun_l8_n796(x)
+    if (x < 1)
+        fun_l9_n147(x)
+    else
+        fun_l9_n767(x)
+    end
+end
+
+def fun_l8_n797(x)
+    if (x < 1)
+        fun_l9_n427(x)
+    else
+        fun_l9_n854(x)
+    end
+end
+
+def fun_l8_n798(x)
+    if (x < 1)
+        fun_l9_n557(x)
+    else
+        fun_l9_n729(x)
+    end
+end
+
+def fun_l8_n799(x)
+    if (x < 1)
+        fun_l9_n150(x)
+    else
+        fun_l9_n180(x)
+    end
+end
+
+def fun_l8_n800(x)
+    if (x < 1)
+        fun_l9_n888(x)
+    else
+        fun_l9_n612(x)
+    end
+end
+
+def fun_l8_n801(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n370(x)
+    end
+end
+
+def fun_l8_n802(x)
+    if (x < 1)
+        fun_l9_n759(x)
+    else
+        fun_l9_n446(x)
+    end
+end
+
+def fun_l8_n803(x)
+    if (x < 1)
+        fun_l9_n182(x)
+    else
+        fun_l9_n705(x)
+    end
+end
+
+def fun_l8_n804(x)
+    if (x < 1)
+        fun_l9_n474(x)
+    else
+        fun_l9_n461(x)
+    end
+end
+
+def fun_l8_n805(x)
+    if (x < 1)
+        fun_l9_n897(x)
+    else
+        fun_l9_n935(x)
+    end
+end
+
+def fun_l8_n806(x)
+    if (x < 1)
+        fun_l9_n793(x)
+    else
+        fun_l9_n981(x)
+    end
+end
+
+def fun_l8_n807(x)
+    if (x < 1)
+        fun_l9_n124(x)
+    else
+        fun_l9_n528(x)
+    end
+end
+
+def fun_l8_n808(x)
+    if (x < 1)
+        fun_l9_n637(x)
+    else
+        fun_l9_n989(x)
+    end
+end
+
+def fun_l8_n809(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n196(x)
+    end
+end
+
+def fun_l8_n810(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n806(x)
+    end
+end
+
+def fun_l8_n811(x)
+    if (x < 1)
+        fun_l9_n541(x)
+    else
+        fun_l9_n6(x)
+    end
+end
+
+def fun_l8_n812(x)
+    if (x < 1)
+        fun_l9_n346(x)
+    else
+        fun_l9_n496(x)
+    end
+end
+
+def fun_l8_n813(x)
+    if (x < 1)
+        fun_l9_n374(x)
+    else
+        fun_l9_n739(x)
+    end
+end
+
+def fun_l8_n814(x)
+    if (x < 1)
+        fun_l9_n121(x)
+    else
+        fun_l9_n184(x)
+    end
+end
+
+def fun_l8_n815(x)
+    if (x < 1)
+        fun_l9_n460(x)
+    else
+        fun_l9_n759(x)
+    end
+end
+
+def fun_l8_n816(x)
+    if (x < 1)
+        fun_l9_n598(x)
+    else
+        fun_l9_n638(x)
+    end
+end
+
+def fun_l8_n817(x)
+    if (x < 1)
+        fun_l9_n986(x)
+    else
+        fun_l9_n658(x)
+    end
+end
+
+def fun_l8_n818(x)
+    if (x < 1)
+        fun_l9_n169(x)
+    else
+        fun_l9_n696(x)
+    end
+end
+
+def fun_l8_n819(x)
+    if (x < 1)
+        fun_l9_n885(x)
+    else
+        fun_l9_n74(x)
+    end
+end
+
+def fun_l8_n820(x)
+    if (x < 1)
+        fun_l9_n24(x)
+    else
+        fun_l9_n87(x)
+    end
+end
+
+def fun_l8_n821(x)
+    if (x < 1)
+        fun_l9_n59(x)
+    else
+        fun_l9_n843(x)
+    end
+end
+
+def fun_l8_n822(x)
+    if (x < 1)
+        fun_l9_n640(x)
+    else
+        fun_l9_n360(x)
+    end
+end
+
+def fun_l8_n823(x)
+    if (x < 1)
+        fun_l9_n355(x)
+    else
+        fun_l9_n28(x)
+    end
+end
+
+def fun_l8_n824(x)
+    if (x < 1)
+        fun_l9_n553(x)
+    else
+        fun_l9_n475(x)
+    end
+end
+
+def fun_l8_n825(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n790(x)
+    end
+end
+
+def fun_l8_n826(x)
+    if (x < 1)
+        fun_l9_n787(x)
+    else
+        fun_l9_n226(x)
+    end
+end
+
+def fun_l8_n827(x)
+    if (x < 1)
+        fun_l9_n622(x)
+    else
+        fun_l9_n711(x)
+    end
+end
+
+def fun_l8_n828(x)
+    if (x < 1)
+        fun_l9_n399(x)
+    else
+        fun_l9_n7(x)
+    end
+end
+
+def fun_l8_n829(x)
+    if (x < 1)
+        fun_l9_n589(x)
+    else
+        fun_l9_n276(x)
+    end
+end
+
+def fun_l8_n830(x)
+    if (x < 1)
+        fun_l9_n83(x)
+    else
+        fun_l9_n126(x)
+    end
+end
+
+def fun_l8_n831(x)
+    if (x < 1)
+        fun_l9_n576(x)
+    else
+        fun_l9_n855(x)
+    end
+end
+
+def fun_l8_n832(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n638(x)
+    end
+end
+
+def fun_l8_n833(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n154(x)
+    end
+end
+
+def fun_l8_n834(x)
+    if (x < 1)
+        fun_l9_n268(x)
+    else
+        fun_l9_n85(x)
+    end
+end
+
+def fun_l8_n835(x)
+    if (x < 1)
+        fun_l9_n32(x)
+    else
+        fun_l9_n678(x)
+    end
+end
+
+def fun_l8_n836(x)
+    if (x < 1)
+        fun_l9_n537(x)
+    else
+        fun_l9_n984(x)
+    end
+end
+
+def fun_l8_n837(x)
+    if (x < 1)
+        fun_l9_n798(x)
+    else
+        fun_l9_n221(x)
+    end
+end
+
+def fun_l8_n838(x)
+    if (x < 1)
+        fun_l9_n153(x)
+    else
+        fun_l9_n414(x)
+    end
+end
+
+def fun_l8_n839(x)
+    if (x < 1)
+        fun_l9_n904(x)
+    else
+        fun_l9_n847(x)
+    end
+end
+
+def fun_l8_n840(x)
+    if (x < 1)
+        fun_l9_n501(x)
+    else
+        fun_l9_n971(x)
+    end
+end
+
+def fun_l8_n841(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n719(x)
+    end
+end
+
+def fun_l8_n842(x)
+    if (x < 1)
+        fun_l9_n343(x)
+    else
+        fun_l9_n365(x)
+    end
+end
+
+def fun_l8_n843(x)
+    if (x < 1)
+        fun_l9_n541(x)
+    else
+        fun_l9_n800(x)
+    end
+end
+
+def fun_l8_n844(x)
+    if (x < 1)
+        fun_l9_n122(x)
+    else
+        fun_l9_n662(x)
+    end
+end
+
+def fun_l8_n845(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n688(x)
+    end
+end
+
+def fun_l8_n846(x)
+    if (x < 1)
+        fun_l9_n668(x)
+    else
+        fun_l9_n805(x)
+    end
+end
+
+def fun_l8_n847(x)
+    if (x < 1)
+        fun_l9_n785(x)
+    else
+        fun_l9_n917(x)
+    end
+end
+
+def fun_l8_n848(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n782(x)
+    end
+end
+
+def fun_l8_n849(x)
+    if (x < 1)
+        fun_l9_n402(x)
+    else
+        fun_l9_n398(x)
+    end
+end
+
+def fun_l8_n850(x)
+    if (x < 1)
+        fun_l9_n708(x)
+    else
+        fun_l9_n199(x)
+    end
+end
+
+def fun_l8_n851(x)
+    if (x < 1)
+        fun_l9_n950(x)
+    else
+        fun_l9_n308(x)
+    end
+end
+
+def fun_l8_n852(x)
+    if (x < 1)
+        fun_l9_n524(x)
+    else
+        fun_l9_n411(x)
+    end
+end
+
+def fun_l8_n853(x)
+    if (x < 1)
+        fun_l9_n467(x)
+    else
+        fun_l9_n807(x)
+    end
+end
+
+def fun_l8_n854(x)
+    if (x < 1)
+        fun_l9_n316(x)
+    else
+        fun_l9_n717(x)
+    end
+end
+
+def fun_l8_n855(x)
+    if (x < 1)
+        fun_l9_n955(x)
+    else
+        fun_l9_n631(x)
+    end
+end
+
+def fun_l8_n856(x)
+    if (x < 1)
+        fun_l9_n244(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n857(x)
+    if (x < 1)
+        fun_l9_n574(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n858(x)
+    if (x < 1)
+        fun_l9_n80(x)
+    else
+        fun_l9_n888(x)
+    end
+end
+
+def fun_l8_n859(x)
+    if (x < 1)
+        fun_l9_n675(x)
+    else
+        fun_l9_n71(x)
+    end
+end
+
+def fun_l8_n860(x)
+    if (x < 1)
+        fun_l9_n375(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n861(x)
+    if (x < 1)
+        fun_l9_n450(x)
+    else
+        fun_l9_n705(x)
+    end
+end
+
+def fun_l8_n862(x)
+    if (x < 1)
+        fun_l9_n358(x)
+    else
+        fun_l9_n614(x)
+    end
+end
+
+def fun_l8_n863(x)
+    if (x < 1)
+        fun_l9_n690(x)
+    else
+        fun_l9_n73(x)
+    end
+end
+
+def fun_l8_n864(x)
+    if (x < 1)
+        fun_l9_n806(x)
+    else
+        fun_l9_n85(x)
+    end
+end
+
+def fun_l8_n865(x)
+    if (x < 1)
+        fun_l9_n251(x)
+    else
+        fun_l9_n657(x)
+    end
+end
+
+def fun_l8_n866(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n199(x)
+    end
+end
+
+def fun_l8_n867(x)
+    if (x < 1)
+        fun_l9_n265(x)
+    else
+        fun_l9_n937(x)
+    end
+end
+
+def fun_l8_n868(x)
+    if (x < 1)
+        fun_l9_n610(x)
+    else
+        fun_l9_n7(x)
+    end
+end
+
+def fun_l8_n869(x)
+    if (x < 1)
+        fun_l9_n703(x)
+    else
+        fun_l9_n74(x)
+    end
+end
+
+def fun_l8_n870(x)
+    if (x < 1)
+        fun_l9_n869(x)
+    else
+        fun_l9_n665(x)
+    end
+end
+
+def fun_l8_n871(x)
+    if (x < 1)
+        fun_l9_n808(x)
+    else
+        fun_l9_n686(x)
+    end
+end
+
+def fun_l8_n872(x)
+    if (x < 1)
+        fun_l9_n678(x)
+    else
+        fun_l9_n709(x)
+    end
+end
+
+def fun_l8_n873(x)
+    if (x < 1)
+        fun_l9_n557(x)
+    else
+        fun_l9_n63(x)
+    end
+end
+
+def fun_l8_n874(x)
+    if (x < 1)
+        fun_l9_n214(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n875(x)
+    if (x < 1)
+        fun_l9_n218(x)
+    else
+        fun_l9_n810(x)
+    end
+end
+
+def fun_l8_n876(x)
+    if (x < 1)
+        fun_l9_n365(x)
+    else
+        fun_l9_n257(x)
+    end
+end
+
+def fun_l8_n877(x)
+    if (x < 1)
+        fun_l9_n51(x)
+    else
+        fun_l9_n68(x)
+    end
+end
+
+def fun_l8_n878(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n55(x)
+    end
+end
+
+def fun_l8_n879(x)
+    if (x < 1)
+        fun_l9_n686(x)
+    else
+        fun_l9_n226(x)
+    end
+end
+
+def fun_l8_n880(x)
+    if (x < 1)
+        fun_l9_n283(x)
+    else
+        fun_l9_n270(x)
+    end
+end
+
+def fun_l8_n881(x)
+    if (x < 1)
+        fun_l9_n811(x)
+    else
+        fun_l9_n820(x)
+    end
+end
+
+def fun_l8_n882(x)
+    if (x < 1)
+        fun_l9_n342(x)
+    else
+        fun_l9_n919(x)
+    end
+end
+
+def fun_l8_n883(x)
+    if (x < 1)
+        fun_l9_n515(x)
+    else
+        fun_l9_n24(x)
+    end
+end
+
+def fun_l8_n884(x)
+    if (x < 1)
+        fun_l9_n0(x)
+    else
+        fun_l9_n150(x)
+    end
+end
+
+def fun_l8_n885(x)
+    if (x < 1)
+        fun_l9_n481(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n886(x)
+    if (x < 1)
+        fun_l9_n252(x)
+    else
+        fun_l9_n544(x)
+    end
+end
+
+def fun_l8_n887(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n402(x)
+    end
+end
+
+def fun_l8_n888(x)
+    if (x < 1)
+        fun_l9_n78(x)
+    else
+        fun_l9_n779(x)
+    end
+end
+
+def fun_l8_n889(x)
+    if (x < 1)
+        fun_l9_n249(x)
+    else
+        fun_l9_n331(x)
+    end
+end
+
+def fun_l8_n890(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n115(x)
+    end
+end
+
+def fun_l8_n891(x)
+    if (x < 1)
+        fun_l9_n832(x)
+    else
+        fun_l9_n34(x)
+    end
+end
+
+def fun_l8_n892(x)
+    if (x < 1)
+        fun_l9_n919(x)
+    else
+        fun_l9_n620(x)
+    end
+end
+
+def fun_l8_n893(x)
+    if (x < 1)
+        fun_l9_n360(x)
+    else
+        fun_l9_n189(x)
+    end
+end
+
+def fun_l8_n894(x)
+    if (x < 1)
+        fun_l9_n736(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n895(x)
+    if (x < 1)
+        fun_l9_n56(x)
+    else
+        fun_l9_n826(x)
+    end
+end
+
+def fun_l8_n896(x)
+    if (x < 1)
+        fun_l9_n159(x)
+    else
+        fun_l9_n523(x)
+    end
+end
+
+def fun_l8_n897(x)
+    if (x < 1)
+        fun_l9_n630(x)
+    else
+        fun_l9_n601(x)
+    end
+end
+
+def fun_l8_n898(x)
+    if (x < 1)
+        fun_l9_n434(x)
+    else
+        fun_l9_n919(x)
+    end
+end
+
+def fun_l8_n899(x)
+    if (x < 1)
+        fun_l9_n872(x)
+    else
+        fun_l9_n652(x)
+    end
+end
+
+def fun_l8_n900(x)
+    if (x < 1)
+        fun_l9_n550(x)
+    else
+        fun_l9_n124(x)
+    end
+end
+
+def fun_l8_n901(x)
+    if (x < 1)
+        fun_l9_n56(x)
+    else
+        fun_l9_n422(x)
+    end
+end
+
+def fun_l8_n902(x)
+    if (x < 1)
+        fun_l9_n297(x)
+    else
+        fun_l9_n281(x)
+    end
+end
+
+def fun_l8_n903(x)
+    if (x < 1)
+        fun_l9_n764(x)
+    else
+        fun_l9_n942(x)
+    end
+end
+
+def fun_l8_n904(x)
+    if (x < 1)
+        fun_l9_n700(x)
+    else
+        fun_l9_n525(x)
+    end
+end
+
+def fun_l8_n905(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n871(x)
+    end
+end
+
+def fun_l8_n906(x)
+    if (x < 1)
+        fun_l9_n385(x)
+    else
+        fun_l9_n999(x)
+    end
+end
+
+def fun_l8_n907(x)
+    if (x < 1)
+        fun_l9_n63(x)
+    else
+        fun_l9_n137(x)
+    end
+end
+
+def fun_l8_n908(x)
+    if (x < 1)
+        fun_l9_n793(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n909(x)
+    if (x < 1)
+        fun_l9_n141(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n910(x)
+    if (x < 1)
+        fun_l9_n764(x)
+    else
+        fun_l9_n334(x)
+    end
+end
+
+def fun_l8_n911(x)
+    if (x < 1)
+        fun_l9_n429(x)
+    else
+        fun_l9_n309(x)
+    end
+end
+
+def fun_l8_n912(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n662(x)
+    end
+end
+
+def fun_l8_n913(x)
+    if (x < 1)
+        fun_l9_n467(x)
+    else
+        fun_l9_n817(x)
+    end
+end
+
+def fun_l8_n914(x)
+    if (x < 1)
+        fun_l9_n318(x)
+    else
+        fun_l9_n942(x)
+    end
+end
+
+def fun_l8_n915(x)
+    if (x < 1)
+        fun_l9_n442(x)
+    else
+        fun_l9_n987(x)
+    end
+end
+
+def fun_l8_n916(x)
+    if (x < 1)
+        fun_l9_n657(x)
+    else
+        fun_l9_n736(x)
+    end
+end
+
+def fun_l8_n917(x)
+    if (x < 1)
+        fun_l9_n839(x)
+    else
+        fun_l9_n897(x)
+    end
+end
+
+def fun_l8_n918(x)
+    if (x < 1)
+        fun_l9_n659(x)
+    else
+        fun_l9_n766(x)
+    end
+end
+
+def fun_l8_n919(x)
+    if (x < 1)
+        fun_l9_n523(x)
+    else
+        fun_l9_n54(x)
+    end
+end
+
+def fun_l8_n920(x)
+    if (x < 1)
+        fun_l9_n298(x)
+    else
+        fun_l9_n169(x)
+    end
+end
+
+def fun_l8_n921(x)
+    if (x < 1)
+        fun_l9_n752(x)
+    else
+        fun_l9_n281(x)
+    end
+end
+
+def fun_l8_n922(x)
+    if (x < 1)
+        fun_l9_n703(x)
+    else
+        fun_l9_n874(x)
+    end
+end
+
+def fun_l8_n923(x)
+    if (x < 1)
+        fun_l9_n218(x)
+    else
+        fun_l9_n880(x)
+    end
+end
+
+def fun_l8_n924(x)
+    if (x < 1)
+        fun_l9_n699(x)
+    else
+        fun_l9_n357(x)
+    end
+end
+
+def fun_l8_n925(x)
+    if (x < 1)
+        fun_l9_n279(x)
+    else
+        fun_l9_n300(x)
+    end
+end
+
+def fun_l8_n926(x)
+    if (x < 1)
+        fun_l9_n955(x)
+    else
+        fun_l9_n522(x)
+    end
+end
+
+def fun_l8_n927(x)
+    if (x < 1)
+        fun_l9_n943(x)
+    else
+        fun_l9_n597(x)
+    end
+end
+
+def fun_l8_n928(x)
+    if (x < 1)
+        fun_l9_n828(x)
+    else
+        fun_l9_n658(x)
+    end
+end
+
+def fun_l8_n929(x)
+    if (x < 1)
+        fun_l9_n160(x)
+    else
+        fun_l9_n536(x)
+    end
+end
+
+def fun_l8_n930(x)
+    if (x < 1)
+        fun_l9_n422(x)
+    else
+        fun_l9_n848(x)
+    end
+end
+
+def fun_l8_n931(x)
+    if (x < 1)
+        fun_l9_n66(x)
+    else
+        fun_l9_n298(x)
+    end
+end
+
+def fun_l8_n932(x)
+    if (x < 1)
+        fun_l9_n871(x)
+    else
+        fun_l9_n443(x)
+    end
+end
+
+def fun_l8_n933(x)
+    if (x < 1)
+        fun_l9_n876(x)
+    else
+        fun_l9_n459(x)
+    end
+end
+
+def fun_l8_n934(x)
+    if (x < 1)
+        fun_l9_n319(x)
+    else
+        fun_l9_n921(x)
+    end
+end
+
+def fun_l8_n935(x)
+    if (x < 1)
+        fun_l9_n741(x)
+    else
+        fun_l9_n659(x)
+    end
+end
+
+def fun_l8_n936(x)
+    if (x < 1)
+        fun_l9_n713(x)
+    else
+        fun_l9_n800(x)
+    end
+end
+
+def fun_l8_n937(x)
+    if (x < 1)
+        fun_l9_n945(x)
+    else
+        fun_l9_n548(x)
+    end
+end
+
+def fun_l8_n938(x)
+    if (x < 1)
+        fun_l9_n732(x)
+    else
+        fun_l9_n10(x)
+    end
+end
+
+def fun_l8_n939(x)
+    if (x < 1)
+        fun_l9_n5(x)
+    else
+        fun_l9_n864(x)
+    end
+end
+
+def fun_l8_n940(x)
+    if (x < 1)
+        fun_l9_n353(x)
+    else
+        fun_l9_n46(x)
+    end
+end
+
+def fun_l8_n941(x)
+    if (x < 1)
+        fun_l9_n622(x)
+    else
+        fun_l9_n430(x)
+    end
+end
+
+def fun_l8_n942(x)
+    if (x < 1)
+        fun_l9_n120(x)
+    else
+        fun_l9_n265(x)
+    end
+end
+
+def fun_l8_n943(x)
+    if (x < 1)
+        fun_l9_n272(x)
+    else
+        fun_l9_n290(x)
+    end
+end
+
+def fun_l8_n944(x)
+    if (x < 1)
+        fun_l9_n527(x)
+    else
+        fun_l9_n830(x)
+    end
+end
+
+def fun_l8_n945(x)
+    if (x < 1)
+        fun_l9_n202(x)
+    else
+        fun_l9_n597(x)
+    end
+end
+
+def fun_l8_n946(x)
+    if (x < 1)
+        fun_l9_n797(x)
+    else
+        fun_l9_n984(x)
+    end
+end
+
+def fun_l8_n947(x)
+    if (x < 1)
+        fun_l9_n3(x)
+    else
+        fun_l9_n173(x)
+    end
+end
+
+def fun_l8_n948(x)
+    if (x < 1)
+        fun_l9_n658(x)
+    else
+        fun_l9_n48(x)
+    end
+end
+
+def fun_l8_n949(x)
+    if (x < 1)
+        fun_l9_n302(x)
+    else
+        fun_l9_n549(x)
+    end
+end
+
+def fun_l8_n950(x)
+    if (x < 1)
+        fun_l9_n450(x)
+    else
+        fun_l9_n442(x)
+    end
+end
+
+def fun_l8_n951(x)
+    if (x < 1)
+        fun_l9_n32(x)
+    else
+        fun_l9_n287(x)
+    end
+end
+
+def fun_l8_n952(x)
+    if (x < 1)
+        fun_l9_n427(x)
+    else
+        fun_l9_n67(x)
+    end
+end
+
+def fun_l8_n953(x)
+    if (x < 1)
+        fun_l9_n153(x)
+    else
+        fun_l9_n748(x)
+    end
+end
+
+def fun_l8_n954(x)
+    if (x < 1)
+        fun_l9_n528(x)
+    else
+        fun_l9_n754(x)
+    end
+end
+
+def fun_l8_n955(x)
+    if (x < 1)
+        fun_l9_n722(x)
+    else
+        fun_l9_n982(x)
+    end
+end
+
+def fun_l8_n956(x)
+    if (x < 1)
+        fun_l9_n857(x)
+    else
+        fun_l9_n286(x)
+    end
+end
+
+def fun_l8_n957(x)
+    if (x < 1)
+        fun_l9_n579(x)
+    else
+        fun_l9_n830(x)
+    end
+end
+
+def fun_l8_n958(x)
+    if (x < 1)
+        fun_l9_n913(x)
+    else
+        fun_l9_n918(x)
+    end
+end
+
+def fun_l8_n959(x)
+    if (x < 1)
+        fun_l9_n575(x)
+    else
+        fun_l9_n441(x)
+    end
+end
+
+def fun_l8_n960(x)
+    if (x < 1)
+        fun_l9_n774(x)
+    else
+        fun_l9_n426(x)
+    end
+end
+
+def fun_l8_n961(x)
+    if (x < 1)
+        fun_l9_n415(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n962(x)
+    if (x < 1)
+        fun_l9_n187(x)
+    else
+        fun_l9_n101(x)
+    end
+end
+
+def fun_l8_n963(x)
+    if (x < 1)
+        fun_l9_n146(x)
+    else
+        fun_l9_n911(x)
+    end
+end
+
+def fun_l8_n964(x)
+    if (x < 1)
+        fun_l9_n758(x)
+    else
+        fun_l9_n46(x)
+    end
+end
+
+def fun_l8_n965(x)
+    if (x < 1)
+        fun_l9_n316(x)
+    else
+        fun_l9_n874(x)
+    end
+end
+
+def fun_l8_n966(x)
+    if (x < 1)
+        fun_l9_n604(x)
+    else
+        fun_l9_n933(x)
+    end
+end
+
+def fun_l8_n967(x)
+    if (x < 1)
+        fun_l9_n185(x)
+    else
+        fun_l9_n729(x)
+    end
+end
+
+def fun_l8_n968(x)
+    if (x < 1)
+        fun_l9_n735(x)
+    else
+        fun_l9_n347(x)
+    end
+end
+
+def fun_l8_n969(x)
+    if (x < 1)
+        fun_l9_n796(x)
+    else
+        fun_l9_n163(x)
+    end
+end
+
+def fun_l8_n970(x)
+    if (x < 1)
+        fun_l9_n535(x)
+    else
+        fun_l9_n184(x)
+    end
+end
+
+def fun_l8_n971(x)
+    if (x < 1)
+        fun_l9_n919(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n972(x)
+    if (x < 1)
+        fun_l9_n296(x)
+    else
+        fun_l9_n822(x)
+    end
+end
+
+def fun_l8_n973(x)
+    if (x < 1)
+        fun_l9_n503(x)
+    else
+        fun_l9_n979(x)
+    end
+end
+
+def fun_l8_n974(x)
+    if (x < 1)
+        fun_l9_n598(x)
+    else
+        fun_l9_n916(x)
+    end
+end
+
+def fun_l8_n975(x)
+    if (x < 1)
+        fun_l9_n119(x)
+    else
+        fun_l9_n138(x)
+    end
+end
+
+def fun_l8_n976(x)
+    if (x < 1)
+        fun_l9_n92(x)
+    else
+        fun_l9_n244(x)
+    end
+end
+
+def fun_l8_n977(x)
+    if (x < 1)
+        fun_l9_n250(x)
+    else
+        fun_l9_n496(x)
+    end
+end
+
+def fun_l8_n978(x)
+    if (x < 1)
+        fun_l9_n665(x)
+    else
+        fun_l9_n617(x)
+    end
+end
+
+def fun_l8_n979(x)
+    if (x < 1)
+        fun_l9_n212(x)
+    else
+        fun_l9_n63(x)
+    end
+end
+
+def fun_l8_n980(x)
+    if (x < 1)
+        fun_l9_n304(x)
+    else
+        fun_l9_n373(x)
+    end
+end
+
+def fun_l8_n981(x)
+    if (x < 1)
+        fun_l9_n70(x)
+    else
+        fun_l9_n194(x)
+    end
+end
+
+def fun_l8_n982(x)
+    if (x < 1)
+        fun_l9_n996(x)
+    else
+        fun_l9_n821(x)
+    end
+end
+
+def fun_l8_n983(x)
+    if (x < 1)
+        fun_l9_n109(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n984(x)
+    if (x < 1)
+        fun_l9_n342(x)
+    else
+        fun_l9_n768(x)
+    end
+end
+
+def fun_l8_n985(x)
+    if (x < 1)
+        fun_l9_n12(x)
+    else
+        fun_l9_n55(x)
+    end
+end
+
+def fun_l8_n986(x)
+    if (x < 1)
+        fun_l9_n663(x)
+    else
+        fun_l9_n963(x)
+    end
+end
+
+def fun_l8_n987(x)
+    if (x < 1)
+        fun_l9_n108(x)
+    else
+        fun_l9_n139(x)
+    end
+end
+
+def fun_l8_n988(x)
+    if (x < 1)
+        fun_l9_n256(x)
+    else
+        fun_l9_n55(x)
+    end
+end
+
+def fun_l8_n989(x)
+    if (x < 1)
+        fun_l9_n261(x)
+    else
+        fun_l9_n962(x)
+    end
+end
+
+def fun_l8_n990(x)
+    if (x < 1)
+        fun_l9_n581(x)
+    else
+        fun_l9_n558(x)
+    end
+end
+
+def fun_l8_n991(x)
+    if (x < 1)
+        fun_l9_n379(x)
+    else
+        fun_l9_n179(x)
+    end
+end
+
+def fun_l8_n992(x)
+    if (x < 1)
+        fun_l9_n256(x)
+    else
+        fun_l9_n158(x)
+    end
+end
+
+def fun_l8_n993(x)
+    if (x < 1)
+        fun_l9_n75(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n994(x)
+    if (x < 1)
+        fun_l9_n1(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n995(x)
+    if (x < 1)
+        fun_l9_n52(x)
+    else
+        fun_l9_n706(x)
+    end
+end
+
+def fun_l8_n996(x)
+    if (x < 1)
+        fun_l9_n583(x)
+    else
+        fun_l9_n769(x)
+    end
+end
+
+def fun_l8_n997(x)
+    if (x < 1)
+        fun_l9_n91(x)
+    else
+        fun_l9_n86(x)
+    end
+end
+
+def fun_l8_n998(x)
+    if (x < 1)
+        fun_l9_n605(x)
+    else
+        fun_l9_n106(x)
+    end
+end
+
+def fun_l8_n999(x)
+    if (x < 1)
+        fun_l9_n634(x)
+    else
+        fun_l9_n110(x)
+    end
+end
+
+def fun_l9_n0(x)
+    if (x < 1)
+        fun_l10_n583(x)
+    else
+        fun_l10_n168(x)
+    end
+end
+
+def fun_l9_n1(x)
+    if (x < 1)
+        fun_l10_n523(x)
+    else
+        fun_l10_n486(x)
+    end
+end
+
+def fun_l9_n2(x)
+    if (x < 1)
+        fun_l10_n869(x)
+    else
+        fun_l10_n480(x)
+    end
+end
+
+def fun_l9_n3(x)
+    if (x < 1)
+        fun_l10_n227(x)
+    else
+        fun_l10_n798(x)
+    end
+end
+
+def fun_l9_n4(x)
+    if (x < 1)
+        fun_l10_n8(x)
+    else
+        fun_l10_n984(x)
+    end
+end
+
+def fun_l9_n5(x)
+    if (x < 1)
+        fun_l10_n757(x)
+    else
+        fun_l10_n791(x)
+    end
+end
+
+def fun_l9_n6(x)
+    if (x < 1)
+        fun_l10_n131(x)
+    else
+        fun_l10_n44(x)
+    end
+end
+
+def fun_l9_n7(x)
+    if (x < 1)
+        fun_l10_n292(x)
+    else
+        fun_l10_n793(x)
+    end
+end
+
+def fun_l9_n8(x)
+    if (x < 1)
+        fun_l10_n237(x)
+    else
+        fun_l10_n439(x)
+    end
+end
+
+def fun_l9_n9(x)
+    if (x < 1)
+        fun_l10_n99(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n10(x)
+    if (x < 1)
+        fun_l10_n702(x)
+    else
+        fun_l10_n983(x)
+    end
+end
+
+def fun_l9_n11(x)
+    if (x < 1)
+        fun_l10_n843(x)
+    else
+        fun_l10_n774(x)
+    end
+end
+
+def fun_l9_n12(x)
+    if (x < 1)
+        fun_l10_n720(x)
+    else
+        fun_l10_n238(x)
+    end
+end
+
+def fun_l9_n13(x)
+    if (x < 1)
+        fun_l10_n339(x)
+    else
+        fun_l10_n613(x)
+    end
+end
+
+def fun_l9_n14(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n836(x)
+    end
+end
+
+def fun_l9_n15(x)
+    if (x < 1)
+        fun_l10_n542(x)
+    else
+        fun_l10_n90(x)
+    end
+end
+
+def fun_l9_n16(x)
+    if (x < 1)
+        fun_l10_n931(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n17(x)
+    if (x < 1)
+        fun_l10_n568(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n18(x)
+    if (x < 1)
+        fun_l10_n108(x)
+    else
+        fun_l10_n245(x)
+    end
+end
+
+def fun_l9_n19(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n644(x)
+    end
+end
+
+def fun_l9_n20(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n21(x)
+    if (x < 1)
+        fun_l10_n84(x)
+    else
+        fun_l10_n821(x)
+    end
+end
+
+def fun_l9_n22(x)
+    if (x < 1)
+        fun_l10_n391(x)
+    else
+        fun_l10_n154(x)
+    end
+end
+
+def fun_l9_n23(x)
+    if (x < 1)
+        fun_l10_n591(x)
+    else
+        fun_l10_n443(x)
+    end
+end
+
+def fun_l9_n24(x)
+    if (x < 1)
+        fun_l10_n105(x)
+    else
+        fun_l10_n652(x)
+    end
+end
+
+def fun_l9_n25(x)
+    if (x < 1)
+        fun_l10_n495(x)
+    else
+        fun_l10_n185(x)
+    end
+end
+
+def fun_l9_n26(x)
+    if (x < 1)
+        fun_l10_n160(x)
+    else
+        fun_l10_n77(x)
+    end
+end
+
+def fun_l9_n27(x)
+    if (x < 1)
+        fun_l10_n307(x)
+    else
+        fun_l10_n813(x)
+    end
+end
+
+def fun_l9_n28(x)
+    if (x < 1)
+        fun_l10_n651(x)
+    else
+        fun_l10_n198(x)
+    end
+end
+
+def fun_l9_n29(x)
+    if (x < 1)
+        fun_l10_n689(x)
+    else
+        fun_l10_n995(x)
+    end
+end
+
+def fun_l9_n30(x)
+    if (x < 1)
+        fun_l10_n52(x)
+    else
+        fun_l10_n846(x)
+    end
+end
+
+def fun_l9_n31(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n758(x)
+    end
+end
+
+def fun_l9_n32(x)
+    if (x < 1)
+        fun_l10_n675(x)
+    else
+        fun_l10_n240(x)
+    end
+end
+
+def fun_l9_n33(x)
+    if (x < 1)
+        fun_l10_n660(x)
+    else
+        fun_l10_n826(x)
+    end
+end
+
+def fun_l9_n34(x)
+    if (x < 1)
+        fun_l10_n858(x)
+    else
+        fun_l10_n120(x)
+    end
+end
+
+def fun_l9_n35(x)
+    if (x < 1)
+        fun_l10_n28(x)
+    else
+        fun_l10_n870(x)
+    end
+end
+
+def fun_l9_n36(x)
+    if (x < 1)
+        fun_l10_n275(x)
+    else
+        fun_l10_n376(x)
+    end
+end
+
+def fun_l9_n37(x)
+    if (x < 1)
+        fun_l10_n852(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n38(x)
+    if (x < 1)
+        fun_l10_n608(x)
+    else
+        fun_l10_n740(x)
+    end
+end
+
+def fun_l9_n39(x)
+    if (x < 1)
+        fun_l10_n856(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n40(x)
+    if (x < 1)
+        fun_l10_n979(x)
+    else
+        fun_l10_n37(x)
+    end
+end
+
+def fun_l9_n41(x)
+    if (x < 1)
+        fun_l10_n752(x)
+    else
+        fun_l10_n94(x)
+    end
+end
+
+def fun_l9_n42(x)
+    if (x < 1)
+        fun_l10_n653(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n43(x)
+    if (x < 1)
+        fun_l10_n860(x)
+    else
+        fun_l10_n658(x)
+    end
+end
+
+def fun_l9_n44(x)
+    if (x < 1)
+        fun_l10_n952(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n45(x)
+    if (x < 1)
+        fun_l10_n70(x)
+    else
+        fun_l10_n297(x)
+    end
+end
+
+def fun_l9_n46(x)
+    if (x < 1)
+        fun_l10_n100(x)
+    else
+        fun_l10_n154(x)
+    end
+end
+
+def fun_l9_n47(x)
+    if (x < 1)
+        fun_l10_n746(x)
+    else
+        fun_l10_n937(x)
+    end
+end
+
+def fun_l9_n48(x)
+    if (x < 1)
+        fun_l10_n341(x)
+    else
+        fun_l10_n200(x)
+    end
+end
+
+def fun_l9_n49(x)
+    if (x < 1)
+        fun_l10_n317(x)
+    else
+        fun_l10_n607(x)
+    end
+end
+
+def fun_l9_n50(x)
+    if (x < 1)
+        fun_l10_n194(x)
+    else
+        fun_l10_n499(x)
+    end
+end
+
+def fun_l9_n51(x)
+    if (x < 1)
+        fun_l10_n936(x)
+    else
+        fun_l10_n387(x)
+    end
+end
+
+def fun_l9_n52(x)
+    if (x < 1)
+        fun_l10_n660(x)
+    else
+        fun_l10_n734(x)
+    end
+end
+
+def fun_l9_n53(x)
+    if (x < 1)
+        fun_l10_n523(x)
+    else
+        fun_l10_n532(x)
+    end
+end
+
+def fun_l9_n54(x)
+    if (x < 1)
+        fun_l10_n847(x)
+    else
+        fun_l10_n586(x)
+    end
+end
+
+def fun_l9_n55(x)
+    if (x < 1)
+        fun_l10_n378(x)
+    else
+        fun_l10_n226(x)
+    end
+end
+
+def fun_l9_n56(x)
+    if (x < 1)
+        fun_l10_n55(x)
+    else
+        fun_l10_n823(x)
+    end
+end
+
+def fun_l9_n57(x)
+    if (x < 1)
+        fun_l10_n931(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n58(x)
+    if (x < 1)
+        fun_l10_n603(x)
+    else
+        fun_l10_n746(x)
+    end
+end
+
+def fun_l9_n59(x)
+    if (x < 1)
+        fun_l10_n174(x)
+    else
+        fun_l10_n196(x)
+    end
+end
+
+def fun_l9_n60(x)
+    if (x < 1)
+        fun_l10_n45(x)
+    else
+        fun_l10_n907(x)
+    end
+end
+
+def fun_l9_n61(x)
+    if (x < 1)
+        fun_l10_n282(x)
+    else
+        fun_l10_n478(x)
+    end
+end
+
+def fun_l9_n62(x)
+    if (x < 1)
+        fun_l10_n558(x)
+    else
+        fun_l10_n354(x)
+    end
+end
+
+def fun_l9_n63(x)
+    if (x < 1)
+        fun_l10_n729(x)
+    else
+        fun_l10_n275(x)
+    end
+end
+
+def fun_l9_n64(x)
+    if (x < 1)
+        fun_l10_n804(x)
+    else
+        fun_l10_n873(x)
+    end
+end
+
+def fun_l9_n65(x)
+    if (x < 1)
+        fun_l10_n901(x)
+    else
+        fun_l10_n684(x)
+    end
+end
+
+def fun_l9_n66(x)
+    if (x < 1)
+        fun_l10_n542(x)
+    else
+        fun_l10_n668(x)
+    end
+end
+
+def fun_l9_n67(x)
+    if (x < 1)
+        fun_l10_n112(x)
+    else
+        fun_l10_n48(x)
+    end
+end
+
+def fun_l9_n68(x)
+    if (x < 1)
+        fun_l10_n78(x)
+    else
+        fun_l10_n50(x)
+    end
+end
+
+def fun_l9_n69(x)
+    if (x < 1)
+        fun_l10_n595(x)
+    else
+        fun_l10_n163(x)
+    end
+end
+
+def fun_l9_n70(x)
+    if (x < 1)
+        fun_l10_n839(x)
+    else
+        fun_l10_n811(x)
+    end
+end
+
+def fun_l9_n71(x)
+    if (x < 1)
+        fun_l10_n704(x)
+    else
+        fun_l10_n81(x)
+    end
+end
+
+def fun_l9_n72(x)
+    if (x < 1)
+        fun_l10_n708(x)
+    else
+        fun_l10_n711(x)
+    end
+end
+
+def fun_l9_n73(x)
+    if (x < 1)
+        fun_l10_n948(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n74(x)
+    if (x < 1)
+        fun_l10_n168(x)
+    else
+        fun_l10_n415(x)
+    end
+end
+
+def fun_l9_n75(x)
+    if (x < 1)
+        fun_l10_n191(x)
+    else
+        fun_l10_n547(x)
+    end
+end
+
+def fun_l9_n76(x)
+    if (x < 1)
+        fun_l10_n163(x)
+    else
+        fun_l10_n246(x)
+    end
+end
+
+def fun_l9_n77(x)
+    if (x < 1)
+        fun_l10_n948(x)
+    else
+        fun_l10_n80(x)
+    end
+end
+
+def fun_l9_n78(x)
+    if (x < 1)
+        fun_l10_n178(x)
+    else
+        fun_l10_n698(x)
+    end
+end
+
+def fun_l9_n79(x)
+    if (x < 1)
+        fun_l10_n150(x)
+    else
+        fun_l10_n545(x)
+    end
+end
+
+def fun_l9_n80(x)
+    if (x < 1)
+        fun_l10_n808(x)
+    else
+        fun_l10_n668(x)
+    end
+end
+
+def fun_l9_n81(x)
+    if (x < 1)
+        fun_l10_n597(x)
+    else
+        fun_l10_n908(x)
+    end
+end
+
+def fun_l9_n82(x)
+    if (x < 1)
+        fun_l10_n868(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n83(x)
+    if (x < 1)
+        fun_l10_n432(x)
+    else
+        fun_l10_n281(x)
+    end
+end
+
+def fun_l9_n84(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n85(x)
+    if (x < 1)
+        fun_l10_n828(x)
+    else
+        fun_l10_n876(x)
+    end
+end
+
+def fun_l9_n86(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n283(x)
+    end
+end
+
+def fun_l9_n87(x)
+    if (x < 1)
+        fun_l10_n108(x)
+    else
+        fun_l10_n157(x)
+    end
+end
+
+def fun_l9_n88(x)
+    if (x < 1)
+        fun_l10_n576(x)
+    else
+        fun_l10_n448(x)
+    end
+end
+
+def fun_l9_n89(x)
+    if (x < 1)
+        fun_l10_n633(x)
+    else
+        fun_l10_n43(x)
+    end
+end
+
+def fun_l9_n90(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n44(x)
+    end
+end
+
+def fun_l9_n91(x)
+    if (x < 1)
+        fun_l10_n656(x)
+    else
+        fun_l10_n586(x)
+    end
+end
+
+def fun_l9_n92(x)
+    if (x < 1)
+        fun_l10_n366(x)
+    else
+        fun_l10_n613(x)
+    end
+end
+
+def fun_l9_n93(x)
+    if (x < 1)
+        fun_l10_n174(x)
+    else
+        fun_l10_n250(x)
+    end
+end
+
+def fun_l9_n94(x)
+    if (x < 1)
+        fun_l10_n911(x)
+    else
+        fun_l10_n877(x)
+    end
+end
+
+def fun_l9_n95(x)
+    if (x < 1)
+        fun_l10_n940(x)
+    else
+        fun_l10_n334(x)
+    end
+end
+
+def fun_l9_n96(x)
+    if (x < 1)
+        fun_l10_n473(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n97(x)
+    if (x < 1)
+        fun_l10_n550(x)
+    else
+        fun_l10_n80(x)
+    end
+end
+
+def fun_l9_n98(x)
+    if (x < 1)
+        fun_l10_n46(x)
+    else
+        fun_l10_n716(x)
+    end
+end
+
+def fun_l9_n99(x)
+    if (x < 1)
+        fun_l10_n294(x)
+    else
+        fun_l10_n615(x)
+    end
+end
+
+def fun_l9_n100(x)
+    if (x < 1)
+        fun_l10_n286(x)
+    else
+        fun_l10_n120(x)
+    end
+end
+
+def fun_l9_n101(x)
+    if (x < 1)
+        fun_l10_n674(x)
+    else
+        fun_l10_n498(x)
+    end
+end
+
+def fun_l9_n102(x)
+    if (x < 1)
+        fun_l10_n700(x)
+    else
+        fun_l10_n35(x)
+    end
+end
+
+def fun_l9_n103(x)
+    if (x < 1)
+        fun_l10_n225(x)
+    else
+        fun_l10_n206(x)
+    end
+end
+
+def fun_l9_n104(x)
+    if (x < 1)
+        fun_l10_n594(x)
+    else
+        fun_l10_n679(x)
+    end
+end
+
+def fun_l9_n105(x)
+    if (x < 1)
+        fun_l10_n148(x)
+    else
+        fun_l10_n449(x)
+    end
+end
+
+def fun_l9_n106(x)
+    if (x < 1)
+        fun_l10_n125(x)
+    else
+        fun_l10_n761(x)
+    end
+end
+
+def fun_l9_n107(x)
+    if (x < 1)
+        fun_l10_n642(x)
+    else
+        fun_l10_n988(x)
+    end
+end
+
+def fun_l9_n108(x)
+    if (x < 1)
+        fun_l10_n952(x)
+    else
+        fun_l10_n436(x)
+    end
+end
+
+def fun_l9_n109(x)
+    if (x < 1)
+        fun_l10_n955(x)
+    else
+        fun_l10_n380(x)
+    end
+end
+
+def fun_l9_n110(x)
+    if (x < 1)
+        fun_l10_n813(x)
+    else
+        fun_l10_n837(x)
+    end
+end
+
+def fun_l9_n111(x)
+    if (x < 1)
+        fun_l10_n471(x)
+    else
+        fun_l10_n69(x)
+    end
+end
+
+def fun_l9_n112(x)
+    if (x < 1)
+        fun_l10_n614(x)
+    else
+        fun_l10_n665(x)
+    end
+end
+
+def fun_l9_n113(x)
+    if (x < 1)
+        fun_l10_n485(x)
+    else
+        fun_l10_n276(x)
+    end
+end
+
+def fun_l9_n114(x)
+    if (x < 1)
+        fun_l10_n171(x)
+    else
+        fun_l10_n457(x)
+    end
+end
+
+def fun_l9_n115(x)
+    if (x < 1)
+        fun_l10_n106(x)
+    else
+        fun_l10_n555(x)
+    end
+end
+
+def fun_l9_n116(x)
+    if (x < 1)
+        fun_l10_n231(x)
+    else
+        fun_l10_n163(x)
+    end
+end
+
+def fun_l9_n117(x)
+    if (x < 1)
+        fun_l10_n569(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n118(x)
+    if (x < 1)
+        fun_l10_n946(x)
+    else
+        fun_l10_n174(x)
+    end
+end
+
+def fun_l9_n119(x)
+    if (x < 1)
+        fun_l10_n716(x)
+    else
+        fun_l10_n882(x)
+    end
+end
+
+def fun_l9_n120(x)
+    if (x < 1)
+        fun_l10_n628(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n121(x)
+    if (x < 1)
+        fun_l10_n699(x)
+    else
+        fun_l10_n384(x)
+    end
+end
+
+def fun_l9_n122(x)
+    if (x < 1)
+        fun_l10_n180(x)
+    else
+        fun_l10_n98(x)
+    end
+end
+
+def fun_l9_n123(x)
+    if (x < 1)
+        fun_l10_n177(x)
+    else
+        fun_l10_n635(x)
+    end
+end
+
+def fun_l9_n124(x)
+    if (x < 1)
+        fun_l10_n398(x)
+    else
+        fun_l10_n121(x)
+    end
+end
+
+def fun_l9_n125(x)
+    if (x < 1)
+        fun_l10_n866(x)
+    else
+        fun_l10_n595(x)
+    end
+end
+
+def fun_l9_n126(x)
+    if (x < 1)
+        fun_l10_n9(x)
+    else
+        fun_l10_n901(x)
+    end
+end
+
+def fun_l9_n127(x)
+    if (x < 1)
+        fun_l10_n579(x)
+    else
+        fun_l10_n640(x)
+    end
+end
+
+def fun_l9_n128(x)
+    if (x < 1)
+        fun_l10_n884(x)
+    else
+        fun_l10_n327(x)
+    end
+end
+
+def fun_l9_n129(x)
+    if (x < 1)
+        fun_l10_n553(x)
+    else
+        fun_l10_n73(x)
+    end
+end
+
+def fun_l9_n130(x)
+    if (x < 1)
+        fun_l10_n372(x)
+    else
+        fun_l10_n450(x)
+    end
+end
+
+def fun_l9_n131(x)
+    if (x < 1)
+        fun_l10_n748(x)
+    else
+        fun_l10_n534(x)
+    end
+end
+
+def fun_l9_n132(x)
+    if (x < 1)
+        fun_l10_n529(x)
+    else
+        fun_l10_n689(x)
+    end
+end
+
+def fun_l9_n133(x)
+    if (x < 1)
+        fun_l10_n24(x)
+    else
+        fun_l10_n677(x)
+    end
+end
+
+def fun_l9_n134(x)
+    if (x < 1)
+        fun_l10_n4(x)
+    else
+        fun_l10_n482(x)
+    end
+end
+
+def fun_l9_n135(x)
+    if (x < 1)
+        fun_l10_n314(x)
+    else
+        fun_l10_n509(x)
+    end
+end
+
+def fun_l9_n136(x)
+    if (x < 1)
+        fun_l10_n160(x)
+    else
+        fun_l10_n342(x)
+    end
+end
+
+def fun_l9_n137(x)
+    if (x < 1)
+        fun_l10_n289(x)
+    else
+        fun_l10_n910(x)
+    end
+end
+
+def fun_l9_n138(x)
+    if (x < 1)
+        fun_l10_n926(x)
+    else
+        fun_l10_n752(x)
+    end
+end
+
+def fun_l9_n139(x)
+    if (x < 1)
+        fun_l10_n303(x)
+    else
+        fun_l10_n399(x)
+    end
+end
+
+def fun_l9_n140(x)
+    if (x < 1)
+        fun_l10_n11(x)
+    else
+        fun_l10_n241(x)
+    end
+end
+
+def fun_l9_n141(x)
+    if (x < 1)
+        fun_l10_n528(x)
+    else
+        fun_l10_n727(x)
+    end
+end
+
+def fun_l9_n142(x)
+    if (x < 1)
+        fun_l10_n572(x)
+    else
+        fun_l10_n132(x)
+    end
+end
+
+def fun_l9_n143(x)
+    if (x < 1)
+        fun_l10_n858(x)
+    else
+        fun_l10_n712(x)
+    end
+end
+
+def fun_l9_n144(x)
+    if (x < 1)
+        fun_l10_n662(x)
+    else
+        fun_l10_n128(x)
+    end
+end
+
+def fun_l9_n145(x)
+    if (x < 1)
+        fun_l10_n668(x)
+    else
+        fun_l10_n483(x)
+    end
+end
+
+def fun_l9_n146(x)
+    if (x < 1)
+        fun_l10_n401(x)
+    else
+        fun_l10_n330(x)
+    end
+end
+
+def fun_l9_n147(x)
+    if (x < 1)
+        fun_l10_n103(x)
+    else
+        fun_l10_n859(x)
+    end
+end
+
+def fun_l9_n148(x)
+    if (x < 1)
+        fun_l10_n129(x)
+    else
+        fun_l10_n628(x)
+    end
+end
+
+def fun_l9_n149(x)
+    if (x < 1)
+        fun_l10_n898(x)
+    else
+        fun_l10_n984(x)
+    end
+end
+
+def fun_l9_n150(x)
+    if (x < 1)
+        fun_l10_n574(x)
+    else
+        fun_l10_n59(x)
+    end
+end
+
+def fun_l9_n151(x)
+    if (x < 1)
+        fun_l10_n759(x)
+    else
+        fun_l10_n782(x)
+    end
+end
+
+def fun_l9_n152(x)
+    if (x < 1)
+        fun_l10_n588(x)
+    else
+        fun_l10_n383(x)
+    end
+end
+
+def fun_l9_n153(x)
+    if (x < 1)
+        fun_l10_n889(x)
+    else
+        fun_l10_n628(x)
+    end
+end
+
+def fun_l9_n154(x)
+    if (x < 1)
+        fun_l10_n376(x)
+    else
+        fun_l10_n442(x)
+    end
+end
+
+def fun_l9_n155(x)
+    if (x < 1)
+        fun_l10_n497(x)
+    else
+        fun_l10_n269(x)
+    end
+end
+
+def fun_l9_n156(x)
+    if (x < 1)
+        fun_l10_n976(x)
+    else
+        fun_l10_n829(x)
+    end
+end
+
+def fun_l9_n157(x)
+    if (x < 1)
+        fun_l10_n366(x)
+    else
+        fun_l10_n416(x)
+    end
+end
+
+def fun_l9_n158(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n19(x)
+    end
+end
+
+def fun_l9_n159(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n129(x)
+    end
+end
+
+def fun_l9_n160(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n385(x)
+    end
+end
+
+def fun_l9_n161(x)
+    if (x < 1)
+        fun_l10_n626(x)
+    else
+        fun_l10_n686(x)
+    end
+end
+
+def fun_l9_n162(x)
+    if (x < 1)
+        fun_l10_n165(x)
+    else
+        fun_l10_n922(x)
+    end
+end
+
+def fun_l9_n163(x)
+    if (x < 1)
+        fun_l10_n670(x)
+    else
+        fun_l10_n889(x)
+    end
+end
+
+def fun_l9_n164(x)
+    if (x < 1)
+        fun_l10_n346(x)
+    else
+        fun_l10_n292(x)
+    end
+end
+
+def fun_l9_n165(x)
+    if (x < 1)
+        fun_l10_n812(x)
+    else
+        fun_l10_n799(x)
+    end
+end
+
+def fun_l9_n166(x)
+    if (x < 1)
+        fun_l10_n21(x)
+    else
+        fun_l10_n641(x)
+    end
+end
+
+def fun_l9_n167(x)
+    if (x < 1)
+        fun_l10_n268(x)
+    else
+        fun_l10_n943(x)
+    end
+end
+
+def fun_l9_n168(x)
+    if (x < 1)
+        fun_l10_n349(x)
+    else
+        fun_l10_n620(x)
+    end
+end
+
+def fun_l9_n169(x)
+    if (x < 1)
+        fun_l10_n894(x)
+    else
+        fun_l10_n625(x)
+    end
+end
+
+def fun_l9_n170(x)
+    if (x < 1)
+        fun_l10_n732(x)
+    else
+        fun_l10_n518(x)
+    end
+end
+
+def fun_l9_n171(x)
+    if (x < 1)
+        fun_l10_n272(x)
+    else
+        fun_l10_n148(x)
+    end
+end
+
+def fun_l9_n172(x)
+    if (x < 1)
+        fun_l10_n701(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n173(x)
+    if (x < 1)
+        fun_l10_n833(x)
+    else
+        fun_l10_n853(x)
+    end
+end
+
+def fun_l9_n174(x)
+    if (x < 1)
+        fun_l10_n643(x)
+    else
+        fun_l10_n314(x)
+    end
+end
+
+def fun_l9_n175(x)
+    if (x < 1)
+        fun_l10_n217(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n176(x)
+    if (x < 1)
+        fun_l10_n204(x)
+    else
+        fun_l10_n990(x)
+    end
+end
+
+def fun_l9_n177(x)
+    if (x < 1)
+        fun_l10_n130(x)
+    else
+        fun_l10_n829(x)
+    end
+end
+
+def fun_l9_n178(x)
+    if (x < 1)
+        fun_l10_n260(x)
+    else
+        fun_l10_n881(x)
+    end
+end
+
+def fun_l9_n179(x)
+    if (x < 1)
+        fun_l10_n728(x)
+    else
+        fun_l10_n491(x)
+    end
+end
+
+def fun_l9_n180(x)
+    if (x < 1)
+        fun_l10_n456(x)
+    else
+        fun_l10_n221(x)
+    end
+end
+
+def fun_l9_n181(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n166(x)
+    end
+end
+
+def fun_l9_n182(x)
+    if (x < 1)
+        fun_l10_n427(x)
+    else
+        fun_l10_n452(x)
+    end
+end
+
+def fun_l9_n183(x)
+    if (x < 1)
+        fun_l10_n754(x)
+    else
+        fun_l10_n54(x)
+    end
+end
+
+def fun_l9_n184(x)
+    if (x < 1)
+        fun_l10_n137(x)
+    else
+        fun_l10_n155(x)
+    end
+end
+
+def fun_l9_n185(x)
+    if (x < 1)
+        fun_l10_n611(x)
+    else
+        fun_l10_n573(x)
+    end
+end
+
+def fun_l9_n186(x)
+    if (x < 1)
+        fun_l10_n694(x)
+    else
+        fun_l10_n890(x)
+    end
+end
+
+def fun_l9_n187(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n102(x)
+    end
+end
+
+def fun_l9_n188(x)
+    if (x < 1)
+        fun_l10_n400(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n189(x)
+    if (x < 1)
+        fun_l10_n783(x)
+    else
+        fun_l10_n620(x)
+    end
+end
+
+def fun_l9_n190(x)
+    if (x < 1)
+        fun_l10_n209(x)
+    else
+        fun_l10_n777(x)
+    end
+end
+
+def fun_l9_n191(x)
+    if (x < 1)
+        fun_l10_n760(x)
+    else
+        fun_l10_n299(x)
+    end
+end
+
+def fun_l9_n192(x)
+    if (x < 1)
+        fun_l10_n306(x)
+    else
+        fun_l10_n509(x)
+    end
+end
+
+def fun_l9_n193(x)
+    if (x < 1)
+        fun_l10_n842(x)
+    else
+        fun_l10_n0(x)
+    end
+end
+
+def fun_l9_n194(x)
+    if (x < 1)
+        fun_l10_n620(x)
+    else
+        fun_l10_n757(x)
+    end
+end
+
+def fun_l9_n195(x)
+    if (x < 1)
+        fun_l10_n944(x)
+    else
+        fun_l10_n257(x)
+    end
+end
+
+def fun_l9_n196(x)
+    if (x < 1)
+        fun_l10_n222(x)
+    else
+        fun_l10_n11(x)
+    end
+end
+
+def fun_l9_n197(x)
+    if (x < 1)
+        fun_l10_n419(x)
+    else
+        fun_l10_n704(x)
+    end
+end
+
+def fun_l9_n198(x)
+    if (x < 1)
+        fun_l10_n656(x)
+    else
+        fun_l10_n341(x)
+    end
+end
+
+def fun_l9_n199(x)
+    if (x < 1)
+        fun_l10_n129(x)
+    else
+        fun_l10_n815(x)
+    end
+end
+
+def fun_l9_n200(x)
+    if (x < 1)
+        fun_l10_n768(x)
+    else
+        fun_l10_n924(x)
+    end
+end
+
+def fun_l9_n201(x)
+    if (x < 1)
+        fun_l10_n439(x)
+    else
+        fun_l10_n361(x)
+    end
+end
+
+def fun_l9_n202(x)
+    if (x < 1)
+        fun_l10_n421(x)
+    else
+        fun_l10_n937(x)
+    end
+end
+
+def fun_l9_n203(x)
+    if (x < 1)
+        fun_l10_n323(x)
+    else
+        fun_l10_n262(x)
+    end
+end
+
+def fun_l9_n204(x)
+    if (x < 1)
+        fun_l10_n335(x)
+    else
+        fun_l10_n87(x)
+    end
+end
+
+def fun_l9_n205(x)
+    if (x < 1)
+        fun_l10_n973(x)
+    else
+        fun_l10_n262(x)
+    end
+end
+
+def fun_l9_n206(x)
+    if (x < 1)
+        fun_l10_n494(x)
+    else
+        fun_l10_n430(x)
+    end
+end
+
+def fun_l9_n207(x)
+    if (x < 1)
+        fun_l10_n482(x)
+    else
+        fun_l10_n828(x)
+    end
+end
+
+def fun_l9_n208(x)
+    if (x < 1)
+        fun_l10_n820(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n209(x)
+    if (x < 1)
+        fun_l10_n669(x)
+    else
+        fun_l10_n176(x)
+    end
+end
+
+def fun_l9_n210(x)
+    if (x < 1)
+        fun_l10_n165(x)
+    else
+        fun_l10_n963(x)
+    end
+end
+
+def fun_l9_n211(x)
+    if (x < 1)
+        fun_l10_n772(x)
+    else
+        fun_l10_n49(x)
+    end
+end
+
+def fun_l9_n212(x)
+    if (x < 1)
+        fun_l10_n167(x)
+    else
+        fun_l10_n598(x)
+    end
+end
+
+def fun_l9_n213(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n214(x)
+    if (x < 1)
+        fun_l10_n39(x)
+    else
+        fun_l10_n470(x)
+    end
+end
+
+def fun_l9_n215(x)
+    if (x < 1)
+        fun_l10_n489(x)
+    else
+        fun_l10_n812(x)
+    end
+end
+
+def fun_l9_n216(x)
+    if (x < 1)
+        fun_l10_n390(x)
+    else
+        fun_l10_n928(x)
+    end
+end
+
+def fun_l9_n217(x)
+    if (x < 1)
+        fun_l10_n909(x)
+    else
+        fun_l10_n876(x)
+    end
+end
+
+def fun_l9_n218(x)
+    if (x < 1)
+        fun_l10_n781(x)
+    else
+        fun_l10_n799(x)
+    end
+end
+
+def fun_l9_n219(x)
+    if (x < 1)
+        fun_l10_n958(x)
+    else
+        fun_l10_n697(x)
+    end
+end
+
+def fun_l9_n220(x)
+    if (x < 1)
+        fun_l10_n577(x)
+    else
+        fun_l10_n667(x)
+    end
+end
+
+def fun_l9_n221(x)
+    if (x < 1)
+        fun_l10_n206(x)
+    else
+        fun_l10_n573(x)
+    end
+end
+
+def fun_l9_n222(x)
+    if (x < 1)
+        fun_l10_n389(x)
+    else
+        fun_l10_n659(x)
+    end
+end
+
+def fun_l9_n223(x)
+    if (x < 1)
+        fun_l10_n951(x)
+    else
+        fun_l10_n572(x)
+    end
+end
+
+def fun_l9_n224(x)
+    if (x < 1)
+        fun_l10_n158(x)
+    else
+        fun_l10_n500(x)
+    end
+end
+
+def fun_l9_n225(x)
+    if (x < 1)
+        fun_l10_n681(x)
+    else
+        fun_l10_n983(x)
+    end
+end
+
+def fun_l9_n226(x)
+    if (x < 1)
+        fun_l10_n987(x)
+    else
+        fun_l10_n116(x)
+    end
+end
+
+def fun_l9_n227(x)
+    if (x < 1)
+        fun_l10_n347(x)
+    else
+        fun_l10_n606(x)
+    end
+end
+
+def fun_l9_n228(x)
+    if (x < 1)
+        fun_l10_n566(x)
+    else
+        fun_l10_n77(x)
+    end
+end
+
+def fun_l9_n229(x)
+    if (x < 1)
+        fun_l10_n879(x)
+    else
+        fun_l10_n66(x)
+    end
+end
+
+def fun_l9_n230(x)
+    if (x < 1)
+        fun_l10_n355(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n231(x)
+    if (x < 1)
+        fun_l10_n938(x)
+    else
+        fun_l10_n5(x)
+    end
+end
+
+def fun_l9_n232(x)
+    if (x < 1)
+        fun_l10_n684(x)
+    else
+        fun_l10_n528(x)
+    end
+end
+
+def fun_l9_n233(x)
+    if (x < 1)
+        fun_l10_n500(x)
+    else
+        fun_l10_n246(x)
+    end
+end
+
+def fun_l9_n234(x)
+    if (x < 1)
+        fun_l10_n610(x)
+    else
+        fun_l10_n61(x)
+    end
+end
+
+def fun_l9_n235(x)
+    if (x < 1)
+        fun_l10_n199(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n236(x)
+    if (x < 1)
+        fun_l10_n820(x)
+    else
+        fun_l10_n633(x)
+    end
+end
+
+def fun_l9_n237(x)
+    if (x < 1)
+        fun_l10_n216(x)
+    else
+        fun_l10_n546(x)
+    end
+end
+
+def fun_l9_n238(x)
+    if (x < 1)
+        fun_l10_n555(x)
+    else
+        fun_l10_n153(x)
+    end
+end
+
+def fun_l9_n239(x)
+    if (x < 1)
+        fun_l10_n236(x)
+    else
+        fun_l10_n231(x)
+    end
+end
+
+def fun_l9_n240(x)
+    if (x < 1)
+        fun_l10_n775(x)
+    else
+        fun_l10_n823(x)
+    end
+end
+
+def fun_l9_n241(x)
+    if (x < 1)
+        fun_l10_n275(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n242(x)
+    if (x < 1)
+        fun_l10_n239(x)
+    else
+        fun_l10_n791(x)
+    end
+end
+
+def fun_l9_n243(x)
+    if (x < 1)
+        fun_l10_n639(x)
+    else
+        fun_l10_n972(x)
+    end
+end
+
+def fun_l9_n244(x)
+    if (x < 1)
+        fun_l10_n5(x)
+    else
+        fun_l10_n510(x)
+    end
+end
+
+def fun_l9_n245(x)
+    if (x < 1)
+        fun_l10_n256(x)
+    else
+        fun_l10_n298(x)
+    end
+end
+
+def fun_l9_n246(x)
+    if (x < 1)
+        fun_l10_n139(x)
+    else
+        fun_l10_n385(x)
+    end
+end
+
+def fun_l9_n247(x)
+    if (x < 1)
+        fun_l10_n4(x)
+    else
+        fun_l10_n323(x)
+    end
+end
+
+def fun_l9_n248(x)
+    if (x < 1)
+        fun_l10_n166(x)
+    else
+        fun_l10_n539(x)
+    end
+end
+
+def fun_l9_n249(x)
+    if (x < 1)
+        fun_l10_n374(x)
+    else
+        fun_l10_n351(x)
+    end
+end
+
+def fun_l9_n250(x)
+    if (x < 1)
+        fun_l10_n650(x)
+    else
+        fun_l10_n791(x)
+    end
+end
+
+def fun_l9_n251(x)
+    if (x < 1)
+        fun_l10_n799(x)
+    else
+        fun_l10_n990(x)
+    end
+end
+
+def fun_l9_n252(x)
+    if (x < 1)
+        fun_l10_n388(x)
+    else
+        fun_l10_n887(x)
+    end
+end
+
+def fun_l9_n253(x)
+    if (x < 1)
+        fun_l10_n564(x)
+    else
+        fun_l10_n997(x)
+    end
+end
+
+def fun_l9_n254(x)
+    if (x < 1)
+        fun_l10_n580(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n255(x)
+    if (x < 1)
+        fun_l10_n0(x)
+    else
+        fun_l10_n480(x)
+    end
+end
+
+def fun_l9_n256(x)
+    if (x < 1)
+        fun_l10_n606(x)
+    else
+        fun_l10_n48(x)
+    end
+end
+
+def fun_l9_n257(x)
+    if (x < 1)
+        fun_l10_n601(x)
+    else
+        fun_l10_n657(x)
+    end
+end
+
+def fun_l9_n258(x)
+    if (x < 1)
+        fun_l10_n419(x)
+    else
+        fun_l10_n909(x)
+    end
+end
+
+def fun_l9_n259(x)
+    if (x < 1)
+        fun_l10_n194(x)
+    else
+        fun_l10_n961(x)
+    end
+end
+
+def fun_l9_n260(x)
+    if (x < 1)
+        fun_l10_n876(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n261(x)
+    if (x < 1)
+        fun_l10_n643(x)
+    else
+        fun_l10_n905(x)
+    end
+end
+
+def fun_l9_n262(x)
+    if (x < 1)
+        fun_l10_n105(x)
+    else
+        fun_l10_n61(x)
+    end
+end
+
+def fun_l9_n263(x)
+    if (x < 1)
+        fun_l10_n610(x)
+    else
+        fun_l10_n527(x)
+    end
+end
+
+def fun_l9_n264(x)
+    if (x < 1)
+        fun_l10_n183(x)
+    else
+        fun_l10_n51(x)
+    end
+end
+
+def fun_l9_n265(x)
+    if (x < 1)
+        fun_l10_n800(x)
+    else
+        fun_l10_n103(x)
+    end
+end
+
+def fun_l9_n266(x)
+    if (x < 1)
+        fun_l10_n501(x)
+    else
+        fun_l10_n293(x)
+    end
+end
+
+def fun_l9_n267(x)
+    if (x < 1)
+        fun_l10_n207(x)
+    else
+        fun_l10_n162(x)
+    end
+end
+
+def fun_l9_n268(x)
+    if (x < 1)
+        fun_l10_n901(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n269(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n270(x)
+    if (x < 1)
+        fun_l10_n445(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n271(x)
+    if (x < 1)
+        fun_l10_n585(x)
+    else
+        fun_l10_n371(x)
+    end
+end
+
+def fun_l9_n272(x)
+    if (x < 1)
+        fun_l10_n137(x)
+    else
+        fun_l10_n678(x)
+    end
+end
+
+def fun_l9_n273(x)
+    if (x < 1)
+        fun_l10_n284(x)
+    else
+        fun_l10_n801(x)
+    end
+end
+
+def fun_l9_n274(x)
+    if (x < 1)
+        fun_l10_n829(x)
+    else
+        fun_l10_n456(x)
+    end
+end
+
+def fun_l9_n275(x)
+    if (x < 1)
+        fun_l10_n663(x)
+    else
+        fun_l10_n529(x)
+    end
+end
+
+def fun_l9_n276(x)
+    if (x < 1)
+        fun_l10_n154(x)
+    else
+        fun_l10_n421(x)
+    end
+end
+
+def fun_l9_n277(x)
+    if (x < 1)
+        fun_l10_n778(x)
+    else
+        fun_l10_n325(x)
+    end
+end
+
+def fun_l9_n278(x)
+    if (x < 1)
+        fun_l10_n179(x)
+    else
+        fun_l10_n369(x)
+    end
+end
+
+def fun_l9_n279(x)
+    if (x < 1)
+        fun_l10_n800(x)
+    else
+        fun_l10_n488(x)
+    end
+end
+
+def fun_l9_n280(x)
+    if (x < 1)
+        fun_l10_n617(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n281(x)
+    if (x < 1)
+        fun_l10_n951(x)
+    else
+        fun_l10_n763(x)
+    end
+end
+
+def fun_l9_n282(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n541(x)
+    end
+end
+
+def fun_l9_n283(x)
+    if (x < 1)
+        fun_l10_n664(x)
+    else
+        fun_l10_n854(x)
+    end
+end
+
+def fun_l9_n284(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n285(x)
+    if (x < 1)
+        fun_l10_n211(x)
+    else
+        fun_l10_n733(x)
+    end
+end
+
+def fun_l9_n286(x)
+    if (x < 1)
+        fun_l10_n524(x)
+    else
+        fun_l10_n850(x)
+    end
+end
+
+def fun_l9_n287(x)
+    if (x < 1)
+        fun_l10_n270(x)
+    else
+        fun_l10_n798(x)
+    end
+end
+
+def fun_l9_n288(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n408(x)
+    end
+end
+
+def fun_l9_n289(x)
+    if (x < 1)
+        fun_l10_n873(x)
+    else
+        fun_l10_n298(x)
+    end
+end
+
+def fun_l9_n290(x)
+    if (x < 1)
+        fun_l10_n535(x)
+    else
+        fun_l10_n946(x)
+    end
+end
+
+def fun_l9_n291(x)
+    if (x < 1)
+        fun_l10_n290(x)
+    else
+        fun_l10_n631(x)
+    end
+end
+
+def fun_l9_n292(x)
+    if (x < 1)
+        fun_l10_n223(x)
+    else
+        fun_l10_n165(x)
+    end
+end
+
+def fun_l9_n293(x)
+    if (x < 1)
+        fun_l10_n768(x)
+    else
+        fun_l10_n512(x)
+    end
+end
+
+def fun_l9_n294(x)
+    if (x < 1)
+        fun_l10_n133(x)
+    else
+        fun_l10_n986(x)
+    end
+end
+
+def fun_l9_n295(x)
+    if (x < 1)
+        fun_l10_n657(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n296(x)
+    if (x < 1)
+        fun_l10_n444(x)
+    else
+        fun_l10_n490(x)
+    end
+end
+
+def fun_l9_n297(x)
+    if (x < 1)
+        fun_l10_n478(x)
+    else
+        fun_l10_n979(x)
+    end
+end
+
+def fun_l9_n298(x)
+    if (x < 1)
+        fun_l10_n994(x)
+    else
+        fun_l10_n945(x)
+    end
+end
+
+def fun_l9_n299(x)
+    if (x < 1)
+        fun_l10_n865(x)
+    else
+        fun_l10_n206(x)
+    end
+end
+
+def fun_l9_n300(x)
+    if (x < 1)
+        fun_l10_n678(x)
+    else
+        fun_l10_n103(x)
+    end
+end
+
+def fun_l9_n301(x)
+    if (x < 1)
+        fun_l10_n115(x)
+    else
+        fun_l10_n742(x)
+    end
+end
+
+def fun_l9_n302(x)
+    if (x < 1)
+        fun_l10_n677(x)
+    else
+        fun_l10_n446(x)
+    end
+end
+
+def fun_l9_n303(x)
+    if (x < 1)
+        fun_l10_n144(x)
+    else
+        fun_l10_n856(x)
+    end
+end
+
+def fun_l9_n304(x)
+    if (x < 1)
+        fun_l10_n751(x)
+    else
+        fun_l10_n989(x)
+    end
+end
+
+def fun_l9_n305(x)
+    if (x < 1)
+        fun_l10_n200(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n306(x)
+    if (x < 1)
+        fun_l10_n685(x)
+    else
+        fun_l10_n663(x)
+    end
+end
+
+def fun_l9_n307(x)
+    if (x < 1)
+        fun_l10_n831(x)
+    else
+        fun_l10_n770(x)
+    end
+end
+
+def fun_l9_n308(x)
+    if (x < 1)
+        fun_l10_n467(x)
+    else
+        fun_l10_n715(x)
+    end
+end
+
+def fun_l9_n309(x)
+    if (x < 1)
+        fun_l10_n676(x)
+    else
+        fun_l10_n885(x)
+    end
+end
+
+def fun_l9_n310(x)
+    if (x < 1)
+        fun_l10_n382(x)
+    else
+        fun_l10_n687(x)
+    end
+end
+
+def fun_l9_n311(x)
+    if (x < 1)
+        fun_l10_n489(x)
+    else
+        fun_l10_n810(x)
+    end
+end
+
+def fun_l9_n312(x)
+    if (x < 1)
+        fun_l10_n922(x)
+    else
+        fun_l10_n81(x)
+    end
+end
+
+def fun_l9_n313(x)
+    if (x < 1)
+        fun_l10_n788(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n314(x)
+    if (x < 1)
+        fun_l10_n830(x)
+    else
+        fun_l10_n486(x)
+    end
+end
+
+def fun_l9_n315(x)
+    if (x < 1)
+        fun_l10_n848(x)
+    else
+        fun_l10_n250(x)
+    end
+end
+
+def fun_l9_n316(x)
+    if (x < 1)
+        fun_l10_n933(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n317(x)
+    if (x < 1)
+        fun_l10_n659(x)
+    else
+        fun_l10_n91(x)
+    end
+end
+
+def fun_l9_n318(x)
+    if (x < 1)
+        fun_l10_n417(x)
+    else
+        fun_l10_n99(x)
+    end
+end
+
+def fun_l9_n319(x)
+    if (x < 1)
+        fun_l10_n781(x)
+    else
+        fun_l10_n770(x)
+    end
+end
+
+def fun_l9_n320(x)
+    if (x < 1)
+        fun_l10_n820(x)
+    else
+        fun_l10_n836(x)
+    end
+end
+
+def fun_l9_n321(x)
+    if (x < 1)
+        fun_l10_n865(x)
+    else
+        fun_l10_n232(x)
+    end
+end
+
+def fun_l9_n322(x)
+    if (x < 1)
+        fun_l10_n793(x)
+    else
+        fun_l10_n856(x)
+    end
+end
+
+def fun_l9_n323(x)
+    if (x < 1)
+        fun_l10_n91(x)
+    else
+        fun_l10_n356(x)
+    end
+end
+
+def fun_l9_n324(x)
+    if (x < 1)
+        fun_l10_n262(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n325(x)
+    if (x < 1)
+        fun_l10_n733(x)
+    else
+        fun_l10_n866(x)
+    end
+end
+
+def fun_l9_n326(x)
+    if (x < 1)
+        fun_l10_n798(x)
+    else
+        fun_l10_n703(x)
+    end
+end
+
+def fun_l9_n327(x)
+    if (x < 1)
+        fun_l10_n478(x)
+    else
+        fun_l10_n181(x)
+    end
+end
+
+def fun_l9_n328(x)
+    if (x < 1)
+        fun_l10_n66(x)
+    else
+        fun_l10_n736(x)
+    end
+end
+
+def fun_l9_n329(x)
+    if (x < 1)
+        fun_l10_n388(x)
+    else
+        fun_l10_n122(x)
+    end
+end
+
+def fun_l9_n330(x)
+    if (x < 1)
+        fun_l10_n382(x)
+    else
+        fun_l10_n85(x)
+    end
+end
+
+def fun_l9_n331(x)
+    if (x < 1)
+        fun_l10_n987(x)
+    else
+        fun_l10_n769(x)
+    end
+end
+
+def fun_l9_n332(x)
+    if (x < 1)
+        fun_l10_n644(x)
+    else
+        fun_l10_n230(x)
+    end
+end
+
+def fun_l9_n333(x)
+    if (x < 1)
+        fun_l10_n604(x)
+    else
+        fun_l10_n157(x)
+    end
+end
+
+def fun_l9_n334(x)
+    if (x < 1)
+        fun_l10_n50(x)
+    else
+        fun_l10_n417(x)
+    end
+end
+
+def fun_l9_n335(x)
+    if (x < 1)
+        fun_l10_n37(x)
+    else
+        fun_l10_n564(x)
+    end
+end
+
+def fun_l9_n336(x)
+    if (x < 1)
+        fun_l10_n265(x)
+    else
+        fun_l10_n330(x)
+    end
+end
+
+def fun_l9_n337(x)
+    if (x < 1)
+        fun_l10_n816(x)
+    else
+        fun_l10_n723(x)
+    end
+end
+
+def fun_l9_n338(x)
+    if (x < 1)
+        fun_l10_n583(x)
+    else
+        fun_l10_n193(x)
+    end
+end
+
+def fun_l9_n339(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n710(x)
+    end
+end
+
+def fun_l9_n340(x)
+    if (x < 1)
+        fun_l10_n594(x)
+    else
+        fun_l10_n323(x)
+    end
+end
+
+def fun_l9_n341(x)
+    if (x < 1)
+        fun_l10_n727(x)
+    else
+        fun_l10_n305(x)
+    end
+end
+
+def fun_l9_n342(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n917(x)
+    end
+end
+
+def fun_l9_n343(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n36(x)
+    end
+end
+
+def fun_l9_n344(x)
+    if (x < 1)
+        fun_l10_n792(x)
+    else
+        fun_l10_n438(x)
+    end
+end
+
+def fun_l9_n345(x)
+    if (x < 1)
+        fun_l10_n399(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n346(x)
+    if (x < 1)
+        fun_l10_n110(x)
+    else
+        fun_l10_n120(x)
+    end
+end
+
+def fun_l9_n347(x)
+    if (x < 1)
+        fun_l10_n521(x)
+    else
+        fun_l10_n111(x)
+    end
+end
+
+def fun_l9_n348(x)
+    if (x < 1)
+        fun_l10_n134(x)
+    else
+        fun_l10_n49(x)
+    end
+end
+
+def fun_l9_n349(x)
+    if (x < 1)
+        fun_l10_n353(x)
+    else
+        fun_l10_n156(x)
+    end
+end
+
+def fun_l9_n350(x)
+    if (x < 1)
+        fun_l10_n532(x)
+    else
+        fun_l10_n796(x)
+    end
+end
+
+def fun_l9_n351(x)
+    if (x < 1)
+        fun_l10_n896(x)
+    else
+        fun_l10_n176(x)
+    end
+end
+
+def fun_l9_n352(x)
+    if (x < 1)
+        fun_l10_n857(x)
+    else
+        fun_l10_n798(x)
+    end
+end
+
+def fun_l9_n353(x)
+    if (x < 1)
+        fun_l10_n676(x)
+    else
+        fun_l10_n870(x)
+    end
+end
+
+def fun_l9_n354(x)
+    if (x < 1)
+        fun_l10_n806(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n355(x)
+    if (x < 1)
+        fun_l10_n841(x)
+    else
+        fun_l10_n918(x)
+    end
+end
+
+def fun_l9_n356(x)
+    if (x < 1)
+        fun_l10_n226(x)
+    else
+        fun_l10_n514(x)
+    end
+end
+
+def fun_l9_n357(x)
+    if (x < 1)
+        fun_l10_n289(x)
+    else
+        fun_l10_n911(x)
+    end
+end
+
+def fun_l9_n358(x)
+    if (x < 1)
+        fun_l10_n697(x)
+    else
+        fun_l10_n138(x)
+    end
+end
+
+def fun_l9_n359(x)
+    if (x < 1)
+        fun_l10_n432(x)
+    else
+        fun_l10_n88(x)
+    end
+end
+
+def fun_l9_n360(x)
+    if (x < 1)
+        fun_l10_n351(x)
+    else
+        fun_l10_n968(x)
+    end
+end
+
+def fun_l9_n361(x)
+    if (x < 1)
+        fun_l10_n782(x)
+    else
+        fun_l10_n506(x)
+    end
+end
+
+def fun_l9_n362(x)
+    if (x < 1)
+        fun_l10_n875(x)
+    else
+        fun_l10_n459(x)
+    end
+end
+
+def fun_l9_n363(x)
+    if (x < 1)
+        fun_l10_n2(x)
+    else
+        fun_l10_n468(x)
+    end
+end
+
+def fun_l9_n364(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n538(x)
+    end
+end
+
+def fun_l9_n365(x)
+    if (x < 1)
+        fun_l10_n203(x)
+    else
+        fun_l10_n890(x)
+    end
+end
+
+def fun_l9_n366(x)
+    if (x < 1)
+        fun_l10_n612(x)
+    else
+        fun_l10_n483(x)
+    end
+end
+
+def fun_l9_n367(x)
+    if (x < 1)
+        fun_l10_n465(x)
+    else
+        fun_l10_n724(x)
+    end
+end
+
+def fun_l9_n368(x)
+    if (x < 1)
+        fun_l10_n745(x)
+    else
+        fun_l10_n92(x)
+    end
+end
+
+def fun_l9_n369(x)
+    if (x < 1)
+        fun_l10_n312(x)
+    else
+        fun_l10_n754(x)
+    end
+end
+
+def fun_l9_n370(x)
+    if (x < 1)
+        fun_l10_n432(x)
+    else
+        fun_l10_n234(x)
+    end
+end
+
+def fun_l9_n371(x)
+    if (x < 1)
+        fun_l10_n629(x)
+    else
+        fun_l10_n751(x)
+    end
+end
+
+def fun_l9_n372(x)
+    if (x < 1)
+        fun_l10_n142(x)
+    else
+        fun_l10_n381(x)
+    end
+end
+
+def fun_l9_n373(x)
+    if (x < 1)
+        fun_l10_n490(x)
+    else
+        fun_l10_n405(x)
+    end
+end
+
+def fun_l9_n374(x)
+    if (x < 1)
+        fun_l10_n197(x)
+    else
+        fun_l10_n574(x)
+    end
+end
+
+def fun_l9_n375(x)
+    if (x < 1)
+        fun_l10_n808(x)
+    else
+        fun_l10_n753(x)
+    end
+end
+
+def fun_l9_n376(x)
+    if (x < 1)
+        fun_l10_n195(x)
+    else
+        fun_l10_n186(x)
+    end
+end
+
+def fun_l9_n377(x)
+    if (x < 1)
+        fun_l10_n172(x)
+    else
+        fun_l10_n233(x)
+    end
+end
+
+def fun_l9_n378(x)
+    if (x < 1)
+        fun_l10_n723(x)
+    else
+        fun_l10_n919(x)
+    end
+end
+
+def fun_l9_n379(x)
+    if (x < 1)
+        fun_l10_n937(x)
+    else
+        fun_l10_n149(x)
+    end
+end
+
+def fun_l9_n380(x)
+    if (x < 1)
+        fun_l10_n676(x)
+    else
+        fun_l10_n502(x)
+    end
+end
+
+def fun_l9_n381(x)
+    if (x < 1)
+        fun_l10_n756(x)
+    else
+        fun_l10_n346(x)
+    end
+end
+
+def fun_l9_n382(x)
+    if (x < 1)
+        fun_l10_n477(x)
+    else
+        fun_l10_n179(x)
+    end
+end
+
+def fun_l9_n383(x)
+    if (x < 1)
+        fun_l10_n729(x)
+    else
+        fun_l10_n862(x)
+    end
+end
+
+def fun_l9_n384(x)
+    if (x < 1)
+        fun_l10_n406(x)
+    else
+        fun_l10_n145(x)
+    end
+end
+
+def fun_l9_n385(x)
+    if (x < 1)
+        fun_l10_n239(x)
+    else
+        fun_l10_n169(x)
+    end
+end
+
+def fun_l9_n386(x)
+    if (x < 1)
+        fun_l10_n596(x)
+    else
+        fun_l10_n971(x)
+    end
+end
+
+def fun_l9_n387(x)
+    if (x < 1)
+        fun_l10_n466(x)
+    else
+        fun_l10_n488(x)
+    end
+end
+
+def fun_l9_n388(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n553(x)
+    end
+end
+
+def fun_l9_n389(x)
+    if (x < 1)
+        fun_l10_n776(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n390(x)
+    if (x < 1)
+        fun_l10_n872(x)
+    else
+        fun_l10_n901(x)
+    end
+end
+
+def fun_l9_n391(x)
+    if (x < 1)
+        fun_l10_n579(x)
+    else
+        fun_l10_n906(x)
+    end
+end
+
+def fun_l9_n392(x)
+    if (x < 1)
+        fun_l10_n734(x)
+    else
+        fun_l10_n195(x)
+    end
+end
+
+def fun_l9_n393(x)
+    if (x < 1)
+        fun_l10_n691(x)
+    else
+        fun_l10_n68(x)
+    end
+end
+
+def fun_l9_n394(x)
+    if (x < 1)
+        fun_l10_n446(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n395(x)
+    if (x < 1)
+        fun_l10_n708(x)
+    else
+        fun_l10_n319(x)
+    end
+end
+
+def fun_l9_n396(x)
+    if (x < 1)
+        fun_l10_n414(x)
+    else
+        fun_l10_n152(x)
+    end
+end
+
+def fun_l9_n397(x)
+    if (x < 1)
+        fun_l10_n637(x)
+    else
+        fun_l10_n662(x)
+    end
+end
+
+def fun_l9_n398(x)
+    if (x < 1)
+        fun_l10_n990(x)
+    else
+        fun_l10_n547(x)
+    end
+end
+
+def fun_l9_n399(x)
+    if (x < 1)
+        fun_l10_n43(x)
+    else
+        fun_l10_n845(x)
+    end
+end
+
+def fun_l9_n400(x)
+    if (x < 1)
+        fun_l10_n843(x)
+    else
+        fun_l10_n876(x)
+    end
+end
+
+def fun_l9_n401(x)
+    if (x < 1)
+        fun_l10_n925(x)
+    else
+        fun_l10_n221(x)
+    end
+end
+
+def fun_l9_n402(x)
+    if (x < 1)
+        fun_l10_n420(x)
+    else
+        fun_l10_n267(x)
+    end
+end
+
+def fun_l9_n403(x)
+    if (x < 1)
+        fun_l10_n78(x)
+    else
+        fun_l10_n316(x)
+    end
+end
+
+def fun_l9_n404(x)
+    if (x < 1)
+        fun_l10_n291(x)
+    else
+        fun_l10_n614(x)
+    end
+end
+
+def fun_l9_n405(x)
+    if (x < 1)
+        fun_l10_n956(x)
+    else
+        fun_l10_n550(x)
+    end
+end
+
+def fun_l9_n406(x)
+    if (x < 1)
+        fun_l10_n232(x)
+    else
+        fun_l10_n53(x)
+    end
+end
+
+def fun_l9_n407(x)
+    if (x < 1)
+        fun_l10_n171(x)
+    else
+        fun_l10_n51(x)
+    end
+end
+
+def fun_l9_n408(x)
+    if (x < 1)
+        fun_l10_n401(x)
+    else
+        fun_l10_n932(x)
+    end
+end
+
+def fun_l9_n409(x)
+    if (x < 1)
+        fun_l10_n863(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n410(x)
+    if (x < 1)
+        fun_l10_n64(x)
+    else
+        fun_l10_n721(x)
+    end
+end
+
+def fun_l9_n411(x)
+    if (x < 1)
+        fun_l10_n539(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n412(x)
+    if (x < 1)
+        fun_l10_n660(x)
+    else
+        fun_l10_n852(x)
+    end
+end
+
+def fun_l9_n413(x)
+    if (x < 1)
+        fun_l10_n777(x)
+    else
+        fun_l10_n366(x)
+    end
+end
+
+def fun_l9_n414(x)
+    if (x < 1)
+        fun_l10_n695(x)
+    else
+        fun_l10_n538(x)
+    end
+end
+
+def fun_l9_n415(x)
+    if (x < 1)
+        fun_l10_n208(x)
+    else
+        fun_l10_n892(x)
+    end
+end
+
+def fun_l9_n416(x)
+    if (x < 1)
+        fun_l10_n632(x)
+    else
+        fun_l10_n463(x)
+    end
+end
+
+def fun_l9_n417(x)
+    if (x < 1)
+        fun_l10_n238(x)
+    else
+        fun_l10_n55(x)
+    end
+end
+
+def fun_l9_n418(x)
+    if (x < 1)
+        fun_l10_n276(x)
+    else
+        fun_l10_n526(x)
+    end
+end
+
+def fun_l9_n419(x)
+    if (x < 1)
+        fun_l10_n625(x)
+    else
+        fun_l10_n806(x)
+    end
+end
+
+def fun_l9_n420(x)
+    if (x < 1)
+        fun_l10_n899(x)
+    else
+        fun_l10_n594(x)
+    end
+end
+
+def fun_l9_n421(x)
+    if (x < 1)
+        fun_l10_n725(x)
+    else
+        fun_l10_n461(x)
+    end
+end
+
+def fun_l9_n422(x)
+    if (x < 1)
+        fun_l10_n187(x)
+    else
+        fun_l10_n953(x)
+    end
+end
+
+def fun_l9_n423(x)
+    if (x < 1)
+        fun_l10_n698(x)
+    else
+        fun_l10_n751(x)
+    end
+end
+
+def fun_l9_n424(x)
+    if (x < 1)
+        fun_l10_n115(x)
+    else
+        fun_l10_n321(x)
+    end
+end
+
+def fun_l9_n425(x)
+    if (x < 1)
+        fun_l10_n775(x)
+    else
+        fun_l10_n100(x)
+    end
+end
+
+def fun_l9_n426(x)
+    if (x < 1)
+        fun_l10_n177(x)
+    else
+        fun_l10_n565(x)
+    end
+end
+
+def fun_l9_n427(x)
+    if (x < 1)
+        fun_l10_n568(x)
+    else
+        fun_l10_n234(x)
+    end
+end
+
+def fun_l9_n428(x)
+    if (x < 1)
+        fun_l10_n787(x)
+    else
+        fun_l10_n815(x)
+    end
+end
+
+def fun_l9_n429(x)
+    if (x < 1)
+        fun_l10_n580(x)
+    else
+        fun_l10_n990(x)
+    end
+end
+
+def fun_l9_n430(x)
+    if (x < 1)
+        fun_l10_n680(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n431(x)
+    if (x < 1)
+        fun_l10_n650(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n432(x)
+    if (x < 1)
+        fun_l10_n377(x)
+    else
+        fun_l10_n232(x)
+    end
+end
+
+def fun_l9_n433(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n948(x)
+    end
+end
+
+def fun_l9_n434(x)
+    if (x < 1)
+        fun_l10_n126(x)
+    else
+        fun_l10_n220(x)
+    end
+end
+
+def fun_l9_n435(x)
+    if (x < 1)
+        fun_l10_n395(x)
+    else
+        fun_l10_n732(x)
+    end
+end
+
+def fun_l9_n436(x)
+    if (x < 1)
+        fun_l10_n194(x)
+    else
+        fun_l10_n159(x)
+    end
+end
+
+def fun_l9_n437(x)
+    if (x < 1)
+        fun_l10_n123(x)
+    else
+        fun_l10_n40(x)
+    end
+end
+
+def fun_l9_n438(x)
+    if (x < 1)
+        fun_l10_n241(x)
+    else
+        fun_l10_n861(x)
+    end
+end
+
+def fun_l9_n439(x)
+    if (x < 1)
+        fun_l10_n333(x)
+    else
+        fun_l10_n950(x)
+    end
+end
+
+def fun_l9_n440(x)
+    if (x < 1)
+        fun_l10_n116(x)
+    else
+        fun_l10_n832(x)
+    end
+end
+
+def fun_l9_n441(x)
+    if (x < 1)
+        fun_l10_n598(x)
+    else
+        fun_l10_n68(x)
+    end
+end
+
+def fun_l9_n442(x)
+    if (x < 1)
+        fun_l10_n234(x)
+    else
+        fun_l10_n277(x)
+    end
+end
+
+def fun_l9_n443(x)
+    if (x < 1)
+        fun_l10_n943(x)
+    else
+        fun_l10_n895(x)
+    end
+end
+
+def fun_l9_n444(x)
+    if (x < 1)
+        fun_l10_n490(x)
+    else
+        fun_l10_n512(x)
+    end
+end
+
+def fun_l9_n445(x)
+    if (x < 1)
+        fun_l10_n54(x)
+    else
+        fun_l10_n74(x)
+    end
+end
+
+def fun_l9_n446(x)
+    if (x < 1)
+        fun_l10_n214(x)
+    else
+        fun_l10_n858(x)
+    end
+end
+
+def fun_l9_n447(x)
+    if (x < 1)
+        fun_l10_n274(x)
+    else
+        fun_l10_n255(x)
+    end
+end
+
+def fun_l9_n448(x)
+    if (x < 1)
+        fun_l10_n307(x)
+    else
+        fun_l10_n197(x)
+    end
+end
+
+def fun_l9_n449(x)
+    if (x < 1)
+        fun_l10_n152(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n450(x)
+    if (x < 1)
+        fun_l10_n773(x)
+    else
+        fun_l10_n582(x)
+    end
+end
+
+def fun_l9_n451(x)
+    if (x < 1)
+        fun_l10_n757(x)
+    else
+        fun_l10_n298(x)
+    end
+end
+
+def fun_l9_n452(x)
+    if (x < 1)
+        fun_l10_n648(x)
+    else
+        fun_l10_n826(x)
+    end
+end
+
+def fun_l9_n453(x)
+    if (x < 1)
+        fun_l10_n209(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n454(x)
+    if (x < 1)
+        fun_l10_n448(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n455(x)
+    if (x < 1)
+        fun_l10_n975(x)
+    else
+        fun_l10_n45(x)
+    end
+end
+
+def fun_l9_n456(x)
+    if (x < 1)
+        fun_l10_n938(x)
+    else
+        fun_l10_n354(x)
+    end
+end
+
+def fun_l9_n457(x)
+    if (x < 1)
+        fun_l10_n723(x)
+    else
+        fun_l10_n511(x)
+    end
+end
+
+def fun_l9_n458(x)
+    if (x < 1)
+        fun_l10_n864(x)
+    else
+        fun_l10_n688(x)
+    end
+end
+
+def fun_l9_n459(x)
+    if (x < 1)
+        fun_l10_n283(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n460(x)
+    if (x < 1)
+        fun_l10_n167(x)
+    else
+        fun_l10_n639(x)
+    end
+end
+
+def fun_l9_n461(x)
+    if (x < 1)
+        fun_l10_n493(x)
+    else
+        fun_l10_n538(x)
+    end
+end
+
+def fun_l9_n462(x)
+    if (x < 1)
+        fun_l10_n392(x)
+    else
+        fun_l10_n434(x)
+    end
+end
+
+def fun_l9_n463(x)
+    if (x < 1)
+        fun_l10_n958(x)
+    else
+        fun_l10_n305(x)
+    end
+end
+
+def fun_l9_n464(x)
+    if (x < 1)
+        fun_l10_n516(x)
+    else
+        fun_l10_n375(x)
+    end
+end
+
+def fun_l9_n465(x)
+    if (x < 1)
+        fun_l10_n371(x)
+    else
+        fun_l10_n596(x)
+    end
+end
+
+def fun_l9_n466(x)
+    if (x < 1)
+        fun_l10_n435(x)
+    else
+        fun_l10_n176(x)
+    end
+end
+
+def fun_l9_n467(x)
+    if (x < 1)
+        fun_l10_n391(x)
+    else
+        fun_l10_n83(x)
+    end
+end
+
+def fun_l9_n468(x)
+    if (x < 1)
+        fun_l10_n751(x)
+    else
+        fun_l10_n632(x)
+    end
+end
+
+def fun_l9_n469(x)
+    if (x < 1)
+        fun_l10_n14(x)
+    else
+        fun_l10_n530(x)
+    end
+end
+
+def fun_l9_n470(x)
+    if (x < 1)
+        fun_l10_n663(x)
+    else
+        fun_l10_n844(x)
+    end
+end
+
+def fun_l9_n471(x)
+    if (x < 1)
+        fun_l10_n82(x)
+    else
+        fun_l10_n493(x)
+    end
+end
+
+def fun_l9_n472(x)
+    if (x < 1)
+        fun_l10_n614(x)
+    else
+        fun_l10_n277(x)
+    end
+end
+
+def fun_l9_n473(x)
+    if (x < 1)
+        fun_l10_n492(x)
+    else
+        fun_l10_n492(x)
+    end
+end
+
+def fun_l9_n474(x)
+    if (x < 1)
+        fun_l10_n440(x)
+    else
+        fun_l10_n665(x)
+    end
+end
+
+def fun_l9_n475(x)
+    if (x < 1)
+        fun_l10_n284(x)
+    else
+        fun_l10_n513(x)
+    end
+end
+
+def fun_l9_n476(x)
+    if (x < 1)
+        fun_l10_n690(x)
+    else
+        fun_l10_n507(x)
+    end
+end
+
+def fun_l9_n477(x)
+    if (x < 1)
+        fun_l10_n281(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n478(x)
+    if (x < 1)
+        fun_l10_n903(x)
+    else
+        fun_l10_n866(x)
+    end
+end
+
+def fun_l9_n479(x)
+    if (x < 1)
+        fun_l10_n880(x)
+    else
+        fun_l10_n310(x)
+    end
+end
+
+def fun_l9_n480(x)
+    if (x < 1)
+        fun_l10_n69(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n481(x)
+    if (x < 1)
+        fun_l10_n316(x)
+    else
+        fun_l10_n692(x)
+    end
+end
+
+def fun_l9_n482(x)
+    if (x < 1)
+        fun_l10_n875(x)
+    else
+        fun_l10_n384(x)
+    end
+end
+
+def fun_l9_n483(x)
+    if (x < 1)
+        fun_l10_n496(x)
+    else
+        fun_l10_n81(x)
+    end
+end
+
+def fun_l9_n484(x)
+    if (x < 1)
+        fun_l10_n336(x)
+    else
+        fun_l10_n193(x)
+    end
+end
+
+def fun_l9_n485(x)
+    if (x < 1)
+        fun_l10_n541(x)
+    else
+        fun_l10_n465(x)
+    end
+end
+
+def fun_l9_n486(x)
+    if (x < 1)
+        fun_l10_n197(x)
+    else
+        fun_l10_n844(x)
+    end
+end
+
+def fun_l9_n487(x)
+    if (x < 1)
+        fun_l10_n652(x)
+    else
+        fun_l10_n736(x)
+    end
+end
+
+def fun_l9_n488(x)
+    if (x < 1)
+        fun_l10_n960(x)
+    else
+        fun_l10_n912(x)
+    end
+end
+
+def fun_l9_n489(x)
+    if (x < 1)
+        fun_l10_n238(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n490(x)
+    if (x < 1)
+        fun_l10_n505(x)
+    else
+        fun_l10_n204(x)
+    end
+end
+
+def fun_l9_n491(x)
+    if (x < 1)
+        fun_l10_n960(x)
+    else
+        fun_l10_n198(x)
+    end
+end
+
+def fun_l9_n492(x)
+    if (x < 1)
+        fun_l10_n148(x)
+    else
+        fun_l10_n669(x)
+    end
+end
+
+def fun_l9_n493(x)
+    if (x < 1)
+        fun_l10_n860(x)
+    else
+        fun_l10_n676(x)
+    end
+end
+
+def fun_l9_n494(x)
+    if (x < 1)
+        fun_l10_n77(x)
+    else
+        fun_l10_n945(x)
+    end
+end
+
+def fun_l9_n495(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n588(x)
+    end
+end
+
+def fun_l9_n496(x)
+    if (x < 1)
+        fun_l10_n159(x)
+    else
+        fun_l10_n727(x)
+    end
+end
+
+def fun_l9_n497(x)
+    if (x < 1)
+        fun_l10_n803(x)
+    else
+        fun_l10_n292(x)
+    end
+end
+
+def fun_l9_n498(x)
+    if (x < 1)
+        fun_l10_n308(x)
+    else
+        fun_l10_n46(x)
+    end
+end
+
+def fun_l9_n499(x)
+    if (x < 1)
+        fun_l10_n511(x)
+    else
+        fun_l10_n766(x)
+    end
+end
+
+def fun_l9_n500(x)
+    if (x < 1)
+        fun_l10_n753(x)
+    else
+        fun_l10_n235(x)
+    end
+end
+
+def fun_l9_n501(x)
+    if (x < 1)
+        fun_l10_n776(x)
+    else
+        fun_l10_n779(x)
+    end
+end
+
+def fun_l9_n502(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n969(x)
+    end
+end
+
+def fun_l9_n503(x)
+    if (x < 1)
+        fun_l10_n511(x)
+    else
+        fun_l10_n678(x)
+    end
+end
+
+def fun_l9_n504(x)
+    if (x < 1)
+        fun_l10_n578(x)
+    else
+        fun_l10_n689(x)
+    end
+end
+
+def fun_l9_n505(x)
+    if (x < 1)
+        fun_l10_n434(x)
+    else
+        fun_l10_n0(x)
+    end
+end
+
+def fun_l9_n506(x)
+    if (x < 1)
+        fun_l10_n121(x)
+    else
+        fun_l10_n488(x)
+    end
+end
+
+def fun_l9_n507(x)
+    if (x < 1)
+        fun_l10_n865(x)
+    else
+        fun_l10_n540(x)
+    end
+end
+
+def fun_l9_n508(x)
+    if (x < 1)
+        fun_l10_n809(x)
+    else
+        fun_l10_n764(x)
+    end
+end
+
+def fun_l9_n509(x)
+    if (x < 1)
+        fun_l10_n463(x)
+    else
+        fun_l10_n141(x)
+    end
+end
+
+def fun_l9_n510(x)
+    if (x < 1)
+        fun_l10_n442(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n511(x)
+    if (x < 1)
+        fun_l10_n971(x)
+    else
+        fun_l10_n57(x)
+    end
+end
+
+def fun_l9_n512(x)
+    if (x < 1)
+        fun_l10_n892(x)
+    else
+        fun_l10_n612(x)
+    end
+end
+
+def fun_l9_n513(x)
+    if (x < 1)
+        fun_l10_n864(x)
+    else
+        fun_l10_n438(x)
+    end
+end
+
+def fun_l9_n514(x)
+    if (x < 1)
+        fun_l10_n504(x)
+    else
+        fun_l10_n100(x)
+    end
+end
+
+def fun_l9_n515(x)
+    if (x < 1)
+        fun_l10_n881(x)
+    else
+        fun_l10_n621(x)
+    end
+end
+
+def fun_l9_n516(x)
+    if (x < 1)
+        fun_l10_n170(x)
+    else
+        fun_l10_n435(x)
+    end
+end
+
+def fun_l9_n517(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n537(x)
+    end
+end
+
+def fun_l9_n518(x)
+    if (x < 1)
+        fun_l10_n369(x)
+    else
+        fun_l10_n832(x)
+    end
+end
+
+def fun_l9_n519(x)
+    if (x < 1)
+        fun_l10_n654(x)
+    else
+        fun_l10_n364(x)
+    end
+end
+
+def fun_l9_n520(x)
+    if (x < 1)
+        fun_l10_n410(x)
+    else
+        fun_l10_n10(x)
+    end
+end
+
+def fun_l9_n521(x)
+    if (x < 1)
+        fun_l10_n814(x)
+    else
+        fun_l10_n569(x)
+    end
+end
+
+def fun_l9_n522(x)
+    if (x < 1)
+        fun_l10_n787(x)
+    else
+        fun_l10_n333(x)
+    end
+end
+
+def fun_l9_n523(x)
+    if (x < 1)
+        fun_l10_n336(x)
+    else
+        fun_l10_n720(x)
+    end
+end
+
+def fun_l9_n524(x)
+    if (x < 1)
+        fun_l10_n34(x)
+    else
+        fun_l10_n643(x)
+    end
+end
+
+def fun_l9_n525(x)
+    if (x < 1)
+        fun_l10_n147(x)
+    else
+        fun_l10_n62(x)
+    end
+end
+
+def fun_l9_n526(x)
+    if (x < 1)
+        fun_l10_n431(x)
+    else
+        fun_l10_n452(x)
+    end
+end
+
+def fun_l9_n527(x)
+    if (x < 1)
+        fun_l10_n374(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n528(x)
+    if (x < 1)
+        fun_l10_n604(x)
+    else
+        fun_l10_n274(x)
+    end
+end
+
+def fun_l9_n529(x)
+    if (x < 1)
+        fun_l10_n470(x)
+    else
+        fun_l10_n764(x)
+    end
+end
+
+def fun_l9_n530(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n531(x)
+    if (x < 1)
+        fun_l10_n427(x)
+    else
+        fun_l10_n464(x)
+    end
+end
+
+def fun_l9_n532(x)
+    if (x < 1)
+        fun_l10_n553(x)
+    else
+        fun_l10_n605(x)
+    end
+end
+
+def fun_l9_n533(x)
+    if (x < 1)
+        fun_l10_n59(x)
+    else
+        fun_l10_n794(x)
+    end
+end
+
+def fun_l9_n534(x)
+    if (x < 1)
+        fun_l10_n168(x)
+    else
+        fun_l10_n740(x)
+    end
+end
+
+def fun_l9_n535(x)
+    if (x < 1)
+        fun_l10_n227(x)
+    else
+        fun_l10_n651(x)
+    end
+end
+
+def fun_l9_n536(x)
+    if (x < 1)
+        fun_l10_n904(x)
+    else
+        fun_l10_n552(x)
+    end
+end
+
+def fun_l9_n537(x)
+    if (x < 1)
+        fun_l10_n389(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n538(x)
+    if (x < 1)
+        fun_l10_n622(x)
+    else
+        fun_l10_n100(x)
+    end
+end
+
+def fun_l9_n539(x)
+    if (x < 1)
+        fun_l10_n117(x)
+    else
+        fun_l10_n715(x)
+    end
+end
+
+def fun_l9_n540(x)
+    if (x < 1)
+        fun_l10_n959(x)
+    else
+        fun_l10_n391(x)
+    end
+end
+
+def fun_l9_n541(x)
+    if (x < 1)
+        fun_l10_n733(x)
+    else
+        fun_l10_n393(x)
+    end
+end
+
+def fun_l9_n542(x)
+    if (x < 1)
+        fun_l10_n171(x)
+    else
+        fun_l10_n299(x)
+    end
+end
+
+def fun_l9_n543(x)
+    if (x < 1)
+        fun_l10_n655(x)
+    else
+        fun_l10_n285(x)
+    end
+end
+
+def fun_l9_n544(x)
+    if (x < 1)
+        fun_l10_n819(x)
+    else
+        fun_l10_n817(x)
+    end
+end
+
+def fun_l9_n545(x)
+    if (x < 1)
+        fun_l10_n938(x)
+    else
+        fun_l10_n54(x)
+    end
+end
+
+def fun_l9_n546(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n6(x)
+    end
+end
+
+def fun_l9_n547(x)
+    if (x < 1)
+        fun_l10_n203(x)
+    else
+        fun_l10_n626(x)
+    end
+end
+
+def fun_l9_n548(x)
+    if (x < 1)
+        fun_l10_n643(x)
+    else
+        fun_l10_n761(x)
+    end
+end
+
+def fun_l9_n549(x)
+    if (x < 1)
+        fun_l10_n450(x)
+    else
+        fun_l10_n673(x)
+    end
+end
+
+def fun_l9_n550(x)
+    if (x < 1)
+        fun_l10_n496(x)
+    else
+        fun_l10_n568(x)
+    end
+end
+
+def fun_l9_n551(x)
+    if (x < 1)
+        fun_l10_n30(x)
+    else
+        fun_l10_n518(x)
+    end
+end
+
+def fun_l9_n552(x)
+    if (x < 1)
+        fun_l10_n398(x)
+    else
+        fun_l10_n858(x)
+    end
+end
+
+def fun_l9_n553(x)
+    if (x < 1)
+        fun_l10_n253(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n554(x)
+    if (x < 1)
+        fun_l10_n493(x)
+    else
+        fun_l10_n750(x)
+    end
+end
+
+def fun_l9_n555(x)
+    if (x < 1)
+        fun_l10_n111(x)
+    else
+        fun_l10_n279(x)
+    end
+end
+
+def fun_l9_n556(x)
+    if (x < 1)
+        fun_l10_n927(x)
+    else
+        fun_l10_n793(x)
+    end
+end
+
+def fun_l9_n557(x)
+    if (x < 1)
+        fun_l10_n530(x)
+    else
+        fun_l10_n182(x)
+    end
+end
+
+def fun_l9_n558(x)
+    if (x < 1)
+        fun_l10_n434(x)
+    else
+        fun_l10_n453(x)
+    end
+end
+
+def fun_l9_n559(x)
+    if (x < 1)
+        fun_l10_n480(x)
+    else
+        fun_l10_n590(x)
+    end
+end
+
+def fun_l9_n560(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n280(x)
+    end
+end
+
+def fun_l9_n561(x)
+    if (x < 1)
+        fun_l10_n107(x)
+    else
+        fun_l10_n716(x)
+    end
+end
+
+def fun_l9_n562(x)
+    if (x < 1)
+        fun_l10_n15(x)
+    else
+        fun_l10_n671(x)
+    end
+end
+
+def fun_l9_n563(x)
+    if (x < 1)
+        fun_l10_n544(x)
+    else
+        fun_l10_n571(x)
+    end
+end
+
+def fun_l9_n564(x)
+    if (x < 1)
+        fun_l10_n482(x)
+    else
+        fun_l10_n885(x)
+    end
+end
+
+def fun_l9_n565(x)
+    if (x < 1)
+        fun_l10_n465(x)
+    else
+        fun_l10_n916(x)
+    end
+end
+
+def fun_l9_n566(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n684(x)
+    end
+end
+
+def fun_l9_n567(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n568(x)
+    if (x < 1)
+        fun_l10_n604(x)
+    else
+        fun_l10_n899(x)
+    end
+end
+
+def fun_l9_n569(x)
+    if (x < 1)
+        fun_l10_n138(x)
+    else
+        fun_l10_n164(x)
+    end
+end
+
+def fun_l9_n570(x)
+    if (x < 1)
+        fun_l10_n993(x)
+    else
+        fun_l10_n94(x)
+    end
+end
+
+def fun_l9_n571(x)
+    if (x < 1)
+        fun_l10_n602(x)
+    else
+        fun_l10_n989(x)
+    end
+end
+
+def fun_l9_n572(x)
+    if (x < 1)
+        fun_l10_n700(x)
+    else
+        fun_l10_n308(x)
+    end
+end
+
+def fun_l9_n573(x)
+    if (x < 1)
+        fun_l10_n773(x)
+    else
+        fun_l10_n945(x)
+    end
+end
+
+def fun_l9_n574(x)
+    if (x < 1)
+        fun_l10_n148(x)
+    else
+        fun_l10_n608(x)
+    end
+end
+
+def fun_l9_n575(x)
+    if (x < 1)
+        fun_l10_n439(x)
+    else
+        fun_l10_n908(x)
+    end
+end
+
+def fun_l9_n576(x)
+    if (x < 1)
+        fun_l10_n174(x)
+    else
+        fun_l10_n872(x)
+    end
+end
+
+def fun_l9_n577(x)
+    if (x < 1)
+        fun_l10_n291(x)
+    else
+        fun_l10_n265(x)
+    end
+end
+
+def fun_l9_n578(x)
+    if (x < 1)
+        fun_l10_n425(x)
+    else
+        fun_l10_n928(x)
+    end
+end
+
+def fun_l9_n579(x)
+    if (x < 1)
+        fun_l10_n674(x)
+    else
+        fun_l10_n666(x)
+    end
+end
+
+def fun_l9_n580(x)
+    if (x < 1)
+        fun_l10_n784(x)
+    else
+        fun_l10_n147(x)
+    end
+end
+
+def fun_l9_n581(x)
+    if (x < 1)
+        fun_l10_n550(x)
+    else
+        fun_l10_n119(x)
+    end
+end
+
+def fun_l9_n582(x)
+    if (x < 1)
+        fun_l10_n953(x)
+    else
+        fun_l10_n269(x)
+    end
+end
+
+def fun_l9_n583(x)
+    if (x < 1)
+        fun_l10_n575(x)
+    else
+        fun_l10_n79(x)
+    end
+end
+
+def fun_l9_n584(x)
+    if (x < 1)
+        fun_l10_n498(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n585(x)
+    if (x < 1)
+        fun_l10_n728(x)
+    else
+        fun_l10_n92(x)
+    end
+end
+
+def fun_l9_n586(x)
+    if (x < 1)
+        fun_l10_n344(x)
+    else
+        fun_l10_n753(x)
+    end
+end
+
+def fun_l9_n587(x)
+    if (x < 1)
+        fun_l10_n911(x)
+    else
+        fun_l10_n327(x)
+    end
+end
+
+def fun_l9_n588(x)
+    if (x < 1)
+        fun_l10_n422(x)
+    else
+        fun_l10_n224(x)
+    end
+end
+
+def fun_l9_n589(x)
+    if (x < 1)
+        fun_l10_n311(x)
+    else
+        fun_l10_n457(x)
+    end
+end
+
+def fun_l9_n590(x)
+    if (x < 1)
+        fun_l10_n705(x)
+    else
+        fun_l10_n136(x)
+    end
+end
+
+def fun_l9_n591(x)
+    if (x < 1)
+        fun_l10_n338(x)
+    else
+        fun_l10_n14(x)
+    end
+end
+
+def fun_l9_n592(x)
+    if (x < 1)
+        fun_l10_n144(x)
+    else
+        fun_l10_n671(x)
+    end
+end
+
+def fun_l9_n593(x)
+    if (x < 1)
+        fun_l10_n402(x)
+    else
+        fun_l10_n218(x)
+    end
+end
+
+def fun_l9_n594(x)
+    if (x < 1)
+        fun_l10_n854(x)
+    else
+        fun_l10_n198(x)
+    end
+end
+
+def fun_l9_n595(x)
+    if (x < 1)
+        fun_l10_n932(x)
+    else
+        fun_l10_n181(x)
+    end
+end
+
+def fun_l9_n596(x)
+    if (x < 1)
+        fun_l10_n373(x)
+    else
+        fun_l10_n937(x)
+    end
+end
+
+def fun_l9_n597(x)
+    if (x < 1)
+        fun_l10_n181(x)
+    else
+        fun_l10_n925(x)
+    end
+end
+
+def fun_l9_n598(x)
+    if (x < 1)
+        fun_l10_n263(x)
+    else
+        fun_l10_n98(x)
+    end
+end
+
+def fun_l9_n599(x)
+    if (x < 1)
+        fun_l10_n736(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n600(x)
+    if (x < 1)
+        fun_l10_n576(x)
+    else
+        fun_l10_n998(x)
+    end
+end
+
+def fun_l9_n601(x)
+    if (x < 1)
+        fun_l10_n577(x)
+    else
+        fun_l10_n559(x)
+    end
+end
+
+def fun_l9_n602(x)
+    if (x < 1)
+        fun_l10_n143(x)
+    else
+        fun_l10_n993(x)
+    end
+end
+
+def fun_l9_n603(x)
+    if (x < 1)
+        fun_l10_n35(x)
+    else
+        fun_l10_n132(x)
+    end
+end
+
+def fun_l9_n604(x)
+    if (x < 1)
+        fun_l10_n715(x)
+    else
+        fun_l10_n933(x)
+    end
+end
+
+def fun_l9_n605(x)
+    if (x < 1)
+        fun_l10_n570(x)
+    else
+        fun_l10_n455(x)
+    end
+end
+
+def fun_l9_n606(x)
+    if (x < 1)
+        fun_l10_n225(x)
+    else
+        fun_l10_n216(x)
+    end
+end
+
+def fun_l9_n607(x)
+    if (x < 1)
+        fun_l10_n431(x)
+    else
+        fun_l10_n285(x)
+    end
+end
+
+def fun_l9_n608(x)
+    if (x < 1)
+        fun_l10_n647(x)
+    else
+        fun_l10_n221(x)
+    end
+end
+
+def fun_l9_n609(x)
+    if (x < 1)
+        fun_l10_n348(x)
+    else
+        fun_l10_n849(x)
+    end
+end
+
+def fun_l9_n610(x)
+    if (x < 1)
+        fun_l10_n301(x)
+    else
+        fun_l10_n500(x)
+    end
+end
+
+def fun_l9_n611(x)
+    if (x < 1)
+        fun_l10_n152(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n612(x)
+    if (x < 1)
+        fun_l10_n339(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n613(x)
+    if (x < 1)
+        fun_l10_n427(x)
+    else
+        fun_l10_n779(x)
+    end
+end
+
+def fun_l9_n614(x)
+    if (x < 1)
+        fun_l10_n60(x)
+    else
+        fun_l10_n199(x)
+    end
+end
+
+def fun_l9_n615(x)
+    if (x < 1)
+        fun_l10_n616(x)
+    else
+        fun_l10_n33(x)
+    end
+end
+
+def fun_l9_n616(x)
+    if (x < 1)
+        fun_l10_n940(x)
+    else
+        fun_l10_n981(x)
+    end
+end
+
+def fun_l9_n617(x)
+    if (x < 1)
+        fun_l10_n594(x)
+    else
+        fun_l10_n321(x)
+    end
+end
+
+def fun_l9_n618(x)
+    if (x < 1)
+        fun_l10_n233(x)
+    else
+        fun_l10_n500(x)
+    end
+end
+
+def fun_l9_n619(x)
+    if (x < 1)
+        fun_l10_n169(x)
+    else
+        fun_l10_n883(x)
+    end
+end
+
+def fun_l9_n620(x)
+    if (x < 1)
+        fun_l10_n611(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n621(x)
+    if (x < 1)
+        fun_l10_n155(x)
+    else
+        fun_l10_n547(x)
+    end
+end
+
+def fun_l9_n622(x)
+    if (x < 1)
+        fun_l10_n244(x)
+    else
+        fun_l10_n760(x)
+    end
+end
+
+def fun_l9_n623(x)
+    if (x < 1)
+        fun_l10_n893(x)
+    else
+        fun_l10_n13(x)
+    end
+end
+
+def fun_l9_n624(x)
+    if (x < 1)
+        fun_l10_n465(x)
+    else
+        fun_l10_n276(x)
+    end
+end
+
+def fun_l9_n625(x)
+    if (x < 1)
+        fun_l10_n196(x)
+    else
+        fun_l10_n920(x)
+    end
+end
+
+def fun_l9_n626(x)
+    if (x < 1)
+        fun_l10_n235(x)
+    else
+        fun_l10_n962(x)
+    end
+end
+
+def fun_l9_n627(x)
+    if (x < 1)
+        fun_l10_n361(x)
+    else
+        fun_l10_n162(x)
+    end
+end
+
+def fun_l9_n628(x)
+    if (x < 1)
+        fun_l10_n110(x)
+    else
+        fun_l10_n574(x)
+    end
+end
+
+def fun_l9_n629(x)
+    if (x < 1)
+        fun_l10_n861(x)
+    else
+        fun_l10_n839(x)
+    end
+end
+
+def fun_l9_n630(x)
+    if (x < 1)
+        fun_l10_n386(x)
+    else
+        fun_l10_n741(x)
+    end
+end
+
+def fun_l9_n631(x)
+    if (x < 1)
+        fun_l10_n426(x)
+    else
+        fun_l10_n430(x)
+    end
+end
+
+def fun_l9_n632(x)
+    if (x < 1)
+        fun_l10_n231(x)
+    else
+        fun_l10_n353(x)
+    end
+end
+
+def fun_l9_n633(x)
+    if (x < 1)
+        fun_l10_n945(x)
+    else
+        fun_l10_n199(x)
+    end
+end
+
+def fun_l9_n634(x)
+    if (x < 1)
+        fun_l10_n607(x)
+    else
+        fun_l10_n388(x)
+    end
+end
+
+def fun_l9_n635(x)
+    if (x < 1)
+        fun_l10_n214(x)
+    else
+        fun_l10_n135(x)
+    end
+end
+
+def fun_l9_n636(x)
+    if (x < 1)
+        fun_l10_n642(x)
+    else
+        fun_l10_n522(x)
+    end
+end
+
+def fun_l9_n637(x)
+    if (x < 1)
+        fun_l10_n605(x)
+    else
+        fun_l10_n336(x)
+    end
+end
+
+def fun_l9_n638(x)
+    if (x < 1)
+        fun_l10_n719(x)
+    else
+        fun_l10_n213(x)
+    end
+end
+
+def fun_l9_n639(x)
+    if (x < 1)
+        fun_l10_n202(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n640(x)
+    if (x < 1)
+        fun_l10_n242(x)
+    else
+        fun_l10_n596(x)
+    end
+end
+
+def fun_l9_n641(x)
+    if (x < 1)
+        fun_l10_n851(x)
+    else
+        fun_l10_n216(x)
+    end
+end
+
+def fun_l9_n642(x)
+    if (x < 1)
+        fun_l10_n645(x)
+    else
+        fun_l10_n890(x)
+    end
+end
+
+def fun_l9_n643(x)
+    if (x < 1)
+        fun_l10_n241(x)
+    else
+        fun_l10_n350(x)
+    end
+end
+
+def fun_l9_n644(x)
+    if (x < 1)
+        fun_l10_n597(x)
+    else
+        fun_l10_n350(x)
+    end
+end
+
+def fun_l9_n645(x)
+    if (x < 1)
+        fun_l10_n170(x)
+    else
+        fun_l10_n962(x)
+    end
+end
+
+def fun_l9_n646(x)
+    if (x < 1)
+        fun_l10_n229(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n647(x)
+    if (x < 1)
+        fun_l10_n473(x)
+    else
+        fun_l10_n942(x)
+    end
+end
+
+def fun_l9_n648(x)
+    if (x < 1)
+        fun_l10_n630(x)
+    else
+        fun_l10_n630(x)
+    end
+end
+
+def fun_l9_n649(x)
+    if (x < 1)
+        fun_l10_n183(x)
+    else
+        fun_l10_n313(x)
+    end
+end
+
+def fun_l9_n650(x)
+    if (x < 1)
+        fun_l10_n951(x)
+    else
+        fun_l10_n394(x)
+    end
+end
+
+def fun_l9_n651(x)
+    if (x < 1)
+        fun_l10_n107(x)
+    else
+        fun_l10_n849(x)
+    end
+end
+
+def fun_l9_n652(x)
+    if (x < 1)
+        fun_l10_n678(x)
+    else
+        fun_l10_n768(x)
+    end
+end
+
+def fun_l9_n653(x)
+    if (x < 1)
+        fun_l10_n534(x)
+    else
+        fun_l10_n410(x)
+    end
+end
+
+def fun_l9_n654(x)
+    if (x < 1)
+        fun_l10_n694(x)
+    else
+        fun_l10_n134(x)
+    end
+end
+
+def fun_l9_n655(x)
+    if (x < 1)
+        fun_l10_n751(x)
+    else
+        fun_l10_n923(x)
+    end
+end
+
+def fun_l9_n656(x)
+    if (x < 1)
+        fun_l10_n957(x)
+    else
+        fun_l10_n489(x)
+    end
+end
+
+def fun_l9_n657(x)
+    if (x < 1)
+        fun_l10_n612(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n658(x)
+    if (x < 1)
+        fun_l10_n814(x)
+    else
+        fun_l10_n801(x)
+    end
+end
+
+def fun_l9_n659(x)
+    if (x < 1)
+        fun_l10_n297(x)
+    else
+        fun_l10_n344(x)
+    end
+end
+
+def fun_l9_n660(x)
+    if (x < 1)
+        fun_l10_n674(x)
+    else
+        fun_l10_n780(x)
+    end
+end
+
+def fun_l9_n661(x)
+    if (x < 1)
+        fun_l10_n302(x)
+    else
+        fun_l10_n184(x)
+    end
+end
+
+def fun_l9_n662(x)
+    if (x < 1)
+        fun_l10_n308(x)
+    else
+        fun_l10_n302(x)
+    end
+end
+
+def fun_l9_n663(x)
+    if (x < 1)
+        fun_l10_n825(x)
+    else
+        fun_l10_n866(x)
+    end
+end
+
+def fun_l9_n664(x)
+    if (x < 1)
+        fun_l10_n771(x)
+    else
+        fun_l10_n141(x)
+    end
+end
+
+def fun_l9_n665(x)
+    if (x < 1)
+        fun_l10_n369(x)
+    else
+        fun_l10_n63(x)
+    end
+end
+
+def fun_l9_n666(x)
+    if (x < 1)
+        fun_l10_n198(x)
+    else
+        fun_l10_n793(x)
+    end
+end
+
+def fun_l9_n667(x)
+    if (x < 1)
+        fun_l10_n800(x)
+    else
+        fun_l10_n748(x)
+    end
+end
+
+def fun_l9_n668(x)
+    if (x < 1)
+        fun_l10_n809(x)
+    else
+        fun_l10_n673(x)
+    end
+end
+
+def fun_l9_n669(x)
+    if (x < 1)
+        fun_l10_n438(x)
+    else
+        fun_l10_n301(x)
+    end
+end
+
+def fun_l9_n670(x)
+    if (x < 1)
+        fun_l10_n802(x)
+    else
+        fun_l10_n882(x)
+    end
+end
+
+def fun_l9_n671(x)
+    if (x < 1)
+        fun_l10_n690(x)
+    else
+        fun_l10_n524(x)
+    end
+end
+
+def fun_l9_n672(x)
+    if (x < 1)
+        fun_l10_n996(x)
+    else
+        fun_l10_n68(x)
+    end
+end
+
+def fun_l9_n673(x)
+    if (x < 1)
+        fun_l10_n773(x)
+    else
+        fun_l10_n26(x)
+    end
+end
+
+def fun_l9_n674(x)
+    if (x < 1)
+        fun_l10_n252(x)
+    else
+        fun_l10_n680(x)
+    end
+end
+
+def fun_l9_n675(x)
+    if (x < 1)
+        fun_l10_n466(x)
+    else
+        fun_l10_n885(x)
+    end
+end
+
+def fun_l9_n676(x)
+    if (x < 1)
+        fun_l10_n746(x)
+    else
+        fun_l10_n968(x)
+    end
+end
+
+def fun_l9_n677(x)
+    if (x < 1)
+        fun_l10_n827(x)
+    else
+        fun_l10_n69(x)
+    end
+end
+
+def fun_l9_n678(x)
+    if (x < 1)
+        fun_l10_n158(x)
+    else
+        fun_l10_n780(x)
+    end
+end
+
+def fun_l9_n679(x)
+    if (x < 1)
+        fun_l10_n267(x)
+    else
+        fun_l10_n907(x)
+    end
+end
+
+def fun_l9_n680(x)
+    if (x < 1)
+        fun_l10_n378(x)
+    else
+        fun_l10_n668(x)
+    end
+end
+
+def fun_l9_n681(x)
+    if (x < 1)
+        fun_l10_n481(x)
+    else
+        fun_l10_n421(x)
+    end
+end
+
+def fun_l9_n682(x)
+    if (x < 1)
+        fun_l10_n501(x)
+    else
+        fun_l10_n277(x)
+    end
+end
+
+def fun_l9_n683(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n604(x)
+    end
+end
+
+def fun_l9_n684(x)
+    if (x < 1)
+        fun_l10_n483(x)
+    else
+        fun_l10_n761(x)
+    end
+end
+
+def fun_l9_n685(x)
+    if (x < 1)
+        fun_l10_n41(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n686(x)
+    if (x < 1)
+        fun_l10_n549(x)
+    else
+        fun_l10_n319(x)
+    end
+end
+
+def fun_l9_n687(x)
+    if (x < 1)
+        fun_l10_n246(x)
+    else
+        fun_l10_n854(x)
+    end
+end
+
+def fun_l9_n688(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n43(x)
+    end
+end
+
+def fun_l9_n689(x)
+    if (x < 1)
+        fun_l10_n994(x)
+    else
+        fun_l10_n549(x)
+    end
+end
+
+def fun_l9_n690(x)
+    if (x < 1)
+        fun_l10_n439(x)
+    else
+        fun_l10_n560(x)
+    end
+end
+
+def fun_l9_n691(x)
+    if (x < 1)
+        fun_l10_n227(x)
+    else
+        fun_l10_n877(x)
+    end
+end
+
+def fun_l9_n692(x)
+    if (x < 1)
+        fun_l10_n644(x)
+    else
+        fun_l10_n350(x)
+    end
+end
+
+def fun_l9_n693(x)
+    if (x < 1)
+        fun_l10_n543(x)
+    else
+        fun_l10_n638(x)
+    end
+end
+
+def fun_l9_n694(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n187(x)
+    end
+end
+
+def fun_l9_n695(x)
+    if (x < 1)
+        fun_l10_n1(x)
+    else
+        fun_l10_n540(x)
+    end
+end
+
+def fun_l9_n696(x)
+    if (x < 1)
+        fun_l10_n306(x)
+    else
+        fun_l10_n290(x)
+    end
+end
+
+def fun_l9_n697(x)
+    if (x < 1)
+        fun_l10_n140(x)
+    else
+        fun_l10_n72(x)
+    end
+end
+
+def fun_l9_n698(x)
+    if (x < 1)
+        fun_l10_n43(x)
+    else
+        fun_l10_n257(x)
+    end
+end
+
+def fun_l9_n699(x)
+    if (x < 1)
+        fun_l10_n91(x)
+    else
+        fun_l10_n816(x)
+    end
+end
+
+def fun_l9_n700(x)
+    if (x < 1)
+        fun_l10_n420(x)
+    else
+        fun_l10_n763(x)
+    end
+end
+
+def fun_l9_n701(x)
+    if (x < 1)
+        fun_l10_n429(x)
+    else
+        fun_l10_n28(x)
+    end
+end
+
+def fun_l9_n702(x)
+    if (x < 1)
+        fun_l10_n615(x)
+    else
+        fun_l10_n995(x)
+    end
+end
+
+def fun_l9_n703(x)
+    if (x < 1)
+        fun_l10_n776(x)
+    else
+        fun_l10_n85(x)
+    end
+end
+
+def fun_l9_n704(x)
+    if (x < 1)
+        fun_l10_n795(x)
+    else
+        fun_l10_n542(x)
+    end
+end
+
+def fun_l9_n705(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n166(x)
+    end
+end
+
+def fun_l9_n706(x)
+    if (x < 1)
+        fun_l10_n99(x)
+    else
+        fun_l10_n400(x)
+    end
+end
+
+def fun_l9_n707(x)
+    if (x < 1)
+        fun_l10_n292(x)
+    else
+        fun_l10_n801(x)
+    end
+end
+
+def fun_l9_n708(x)
+    if (x < 1)
+        fun_l10_n303(x)
+    else
+        fun_l10_n380(x)
+    end
+end
+
+def fun_l9_n709(x)
+    if (x < 1)
+        fun_l10_n369(x)
+    else
+        fun_l10_n938(x)
+    end
+end
+
+def fun_l9_n710(x)
+    if (x < 1)
+        fun_l10_n652(x)
+    else
+        fun_l10_n453(x)
+    end
+end
+
+def fun_l9_n711(x)
+    if (x < 1)
+        fun_l10_n770(x)
+    else
+        fun_l10_n32(x)
+    end
+end
+
+def fun_l9_n712(x)
+    if (x < 1)
+        fun_l10_n261(x)
+    else
+        fun_l10_n485(x)
+    end
+end
+
+def fun_l9_n713(x)
+    if (x < 1)
+        fun_l10_n935(x)
+    else
+        fun_l10_n39(x)
+    end
+end
+
+def fun_l9_n714(x)
+    if (x < 1)
+        fun_l10_n332(x)
+    else
+        fun_l10_n309(x)
+    end
+end
+
+def fun_l9_n715(x)
+    if (x < 1)
+        fun_l10_n824(x)
+    else
+        fun_l10_n614(x)
+    end
+end
+
+def fun_l9_n716(x)
+    if (x < 1)
+        fun_l10_n468(x)
+    else
+        fun_l10_n341(x)
+    end
+end
+
+def fun_l9_n717(x)
+    if (x < 1)
+        fun_l10_n425(x)
+    else
+        fun_l10_n67(x)
+    end
+end
+
+def fun_l9_n718(x)
+    if (x < 1)
+        fun_l10_n199(x)
+    else
+        fun_l10_n423(x)
+    end
+end
+
+def fun_l9_n719(x)
+    if (x < 1)
+        fun_l10_n294(x)
+    else
+        fun_l10_n484(x)
+    end
+end
+
+def fun_l9_n720(x)
+    if (x < 1)
+        fun_l10_n276(x)
+    else
+        fun_l10_n799(x)
+    end
+end
+
+def fun_l9_n721(x)
+    if (x < 1)
+        fun_l10_n98(x)
+    else
+        fun_l10_n278(x)
+    end
+end
+
+def fun_l9_n722(x)
+    if (x < 1)
+        fun_l10_n689(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n723(x)
+    if (x < 1)
+        fun_l10_n786(x)
+    else
+        fun_l10_n409(x)
+    end
+end
+
+def fun_l9_n724(x)
+    if (x < 1)
+        fun_l10_n874(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n725(x)
+    if (x < 1)
+        fun_l10_n806(x)
+    else
+        fun_l10_n529(x)
+    end
+end
+
+def fun_l9_n726(x)
+    if (x < 1)
+        fun_l10_n847(x)
+    else
+        fun_l10_n427(x)
+    end
+end
+
+def fun_l9_n727(x)
+    if (x < 1)
+        fun_l10_n285(x)
+    else
+        fun_l10_n878(x)
+    end
+end
+
+def fun_l9_n728(x)
+    if (x < 1)
+        fun_l10_n829(x)
+    else
+        fun_l10_n341(x)
+    end
+end
+
+def fun_l9_n729(x)
+    if (x < 1)
+        fun_l10_n797(x)
+    else
+        fun_l10_n865(x)
+    end
+end
+
+def fun_l9_n730(x)
+    if (x < 1)
+        fun_l10_n689(x)
+    else
+        fun_l10_n241(x)
+    end
+end
+
+def fun_l9_n731(x)
+    if (x < 1)
+        fun_l10_n764(x)
+    else
+        fun_l10_n451(x)
+    end
+end
+
+def fun_l9_n732(x)
+    if (x < 1)
+        fun_l10_n147(x)
+    else
+        fun_l10_n998(x)
+    end
+end
+
+def fun_l9_n733(x)
+    if (x < 1)
+        fun_l10_n192(x)
+    else
+        fun_l10_n293(x)
+    end
+end
+
+def fun_l9_n734(x)
+    if (x < 1)
+        fun_l10_n207(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n735(x)
+    if (x < 1)
+        fun_l10_n457(x)
+    else
+        fun_l10_n93(x)
+    end
+end
+
+def fun_l9_n736(x)
+    if (x < 1)
+        fun_l10_n130(x)
+    else
+        fun_l10_n512(x)
+    end
+end
+
+def fun_l9_n737(x)
+    if (x < 1)
+        fun_l10_n86(x)
+    else
+        fun_l10_n409(x)
+    end
+end
+
+def fun_l9_n738(x)
+    if (x < 1)
+        fun_l10_n783(x)
+    else
+        fun_l10_n981(x)
+    end
+end
+
+def fun_l9_n739(x)
+    if (x < 1)
+        fun_l10_n927(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n740(x)
+    if (x < 1)
+        fun_l10_n719(x)
+    else
+        fun_l10_n422(x)
+    end
+end
+
+def fun_l9_n741(x)
+    if (x < 1)
+        fun_l10_n287(x)
+    else
+        fun_l10_n139(x)
+    end
+end
+
+def fun_l9_n742(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n687(x)
+    end
+end
+
+def fun_l9_n743(x)
+    if (x < 1)
+        fun_l10_n550(x)
+    else
+        fun_l10_n972(x)
+    end
+end
+
+def fun_l9_n744(x)
+    if (x < 1)
+        fun_l10_n5(x)
+    else
+        fun_l10_n306(x)
+    end
+end
+
+def fun_l9_n745(x)
+    if (x < 1)
+        fun_l10_n755(x)
+    else
+        fun_l10_n849(x)
+    end
+end
+
+def fun_l9_n746(x)
+    if (x < 1)
+        fun_l10_n912(x)
+    else
+        fun_l10_n307(x)
+    end
+end
+
+def fun_l9_n747(x)
+    if (x < 1)
+        fun_l10_n181(x)
+    else
+        fun_l10_n476(x)
+    end
+end
+
+def fun_l9_n748(x)
+    if (x < 1)
+        fun_l10_n353(x)
+    else
+        fun_l10_n412(x)
+    end
+end
+
+def fun_l9_n749(x)
+    if (x < 1)
+        fun_l10_n187(x)
+    else
+        fun_l10_n591(x)
+    end
+end
+
+def fun_l9_n750(x)
+    if (x < 1)
+        fun_l10_n464(x)
+    else
+        fun_l10_n581(x)
+    end
+end
+
+def fun_l9_n751(x)
+    if (x < 1)
+        fun_l10_n1(x)
+    else
+        fun_l10_n557(x)
+    end
+end
+
+def fun_l9_n752(x)
+    if (x < 1)
+        fun_l10_n788(x)
+    else
+        fun_l10_n438(x)
+    end
+end
+
+def fun_l9_n753(x)
+    if (x < 1)
+        fun_l10_n535(x)
+    else
+        fun_l10_n13(x)
+    end
+end
+
+def fun_l9_n754(x)
+    if (x < 1)
+        fun_l10_n811(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n755(x)
+    if (x < 1)
+        fun_l10_n328(x)
+    else
+        fun_l10_n44(x)
+    end
+end
+
+def fun_l9_n756(x)
+    if (x < 1)
+        fun_l10_n839(x)
+    else
+        fun_l10_n16(x)
+    end
+end
+
+def fun_l9_n757(x)
+    if (x < 1)
+        fun_l10_n778(x)
+    else
+        fun_l10_n865(x)
+    end
+end
+
+def fun_l9_n758(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n783(x)
+    end
+end
+
+def fun_l9_n759(x)
+    if (x < 1)
+        fun_l10_n293(x)
+    else
+        fun_l10_n140(x)
+    end
+end
+
+def fun_l9_n760(x)
+    if (x < 1)
+        fun_l10_n814(x)
+    else
+        fun_l10_n497(x)
+    end
+end
+
+def fun_l9_n761(x)
+    if (x < 1)
+        fun_l10_n922(x)
+    else
+        fun_l10_n986(x)
+    end
+end
+
+def fun_l9_n762(x)
+    if (x < 1)
+        fun_l10_n100(x)
+    else
+        fun_l10_n346(x)
+    end
+end
+
+def fun_l9_n763(x)
+    if (x < 1)
+        fun_l10_n738(x)
+    else
+        fun_l10_n223(x)
+    end
+end
+
+def fun_l9_n764(x)
+    if (x < 1)
+        fun_l10_n168(x)
+    else
+        fun_l10_n367(x)
+    end
+end
+
+def fun_l9_n765(x)
+    if (x < 1)
+        fun_l10_n929(x)
+    else
+        fun_l10_n684(x)
+    end
+end
+
+def fun_l9_n766(x)
+    if (x < 1)
+        fun_l10_n940(x)
+    else
+        fun_l10_n497(x)
+    end
+end
+
+def fun_l9_n767(x)
+    if (x < 1)
+        fun_l10_n198(x)
+    else
+        fun_l10_n386(x)
+    end
+end
+
+def fun_l9_n768(x)
+    if (x < 1)
+        fun_l10_n667(x)
+    else
+        fun_l10_n913(x)
+    end
+end
+
+def fun_l9_n769(x)
+    if (x < 1)
+        fun_l10_n210(x)
+    else
+        fun_l10_n233(x)
+    end
+end
+
+def fun_l9_n770(x)
+    if (x < 1)
+        fun_l10_n819(x)
+    else
+        fun_l10_n755(x)
+    end
+end
+
+def fun_l9_n771(x)
+    if (x < 1)
+        fun_l10_n519(x)
+    else
+        fun_l10_n554(x)
+    end
+end
+
+def fun_l9_n772(x)
+    if (x < 1)
+        fun_l10_n880(x)
+    else
+        fun_l10_n280(x)
+    end
+end
+
+def fun_l9_n773(x)
+    if (x < 1)
+        fun_l10_n368(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n774(x)
+    if (x < 1)
+        fun_l10_n447(x)
+    else
+        fun_l10_n918(x)
+    end
+end
+
+def fun_l9_n775(x)
+    if (x < 1)
+        fun_l10_n222(x)
+    else
+        fun_l10_n35(x)
+    end
+end
+
+def fun_l9_n776(x)
+    if (x < 1)
+        fun_l10_n339(x)
+    else
+        fun_l10_n309(x)
+    end
+end
+
+def fun_l9_n777(x)
+    if (x < 1)
+        fun_l10_n948(x)
+    else
+        fun_l10_n967(x)
+    end
+end
+
+def fun_l9_n778(x)
+    if (x < 1)
+        fun_l10_n561(x)
+    else
+        fun_l10_n202(x)
+    end
+end
+
+def fun_l9_n779(x)
+    if (x < 1)
+        fun_l10_n863(x)
+    else
+        fun_l10_n356(x)
+    end
+end
+
+def fun_l9_n780(x)
+    if (x < 1)
+        fun_l10_n459(x)
+    else
+        fun_l10_n358(x)
+    end
+end
+
+def fun_l9_n781(x)
+    if (x < 1)
+        fun_l10_n543(x)
+    else
+        fun_l10_n229(x)
+    end
+end
+
+def fun_l9_n782(x)
+    if (x < 1)
+        fun_l10_n422(x)
+    else
+        fun_l10_n448(x)
+    end
+end
+
+def fun_l9_n783(x)
+    if (x < 1)
+        fun_l10_n222(x)
+    else
+        fun_l10_n63(x)
+    end
+end
+
+def fun_l9_n784(x)
+    if (x < 1)
+        fun_l10_n520(x)
+    else
+        fun_l10_n443(x)
+    end
+end
+
+def fun_l9_n785(x)
+    if (x < 1)
+        fun_l10_n894(x)
+    else
+        fun_l10_n379(x)
+    end
+end
+
+def fun_l9_n786(x)
+    if (x < 1)
+        fun_l10_n362(x)
+    else
+        fun_l10_n676(x)
+    end
+end
+
+def fun_l9_n787(x)
+    if (x < 1)
+        fun_l10_n545(x)
+    else
+        fun_l10_n263(x)
+    end
+end
+
+def fun_l9_n788(x)
+    if (x < 1)
+        fun_l10_n322(x)
+    else
+        fun_l10_n631(x)
+    end
+end
+
+def fun_l9_n789(x)
+    if (x < 1)
+        fun_l10_n916(x)
+    else
+        fun_l10_n877(x)
+    end
+end
+
+def fun_l9_n790(x)
+    if (x < 1)
+        fun_l10_n443(x)
+    else
+        fun_l10_n640(x)
+    end
+end
+
+def fun_l9_n791(x)
+    if (x < 1)
+        fun_l10_n202(x)
+    else
+        fun_l10_n686(x)
+    end
+end
+
+def fun_l9_n792(x)
+    if (x < 1)
+        fun_l10_n143(x)
+    else
+        fun_l10_n200(x)
+    end
+end
+
+def fun_l9_n793(x)
+    if (x < 1)
+        fun_l10_n939(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n794(x)
+    if (x < 1)
+        fun_l10_n506(x)
+    else
+        fun_l10_n782(x)
+    end
+end
+
+def fun_l9_n795(x)
+    if (x < 1)
+        fun_l10_n619(x)
+    else
+        fun_l10_n439(x)
+    end
+end
+
+def fun_l9_n796(x)
+    if (x < 1)
+        fun_l10_n748(x)
+    else
+        fun_l10_n61(x)
+    end
+end
+
+def fun_l9_n797(x)
+    if (x < 1)
+        fun_l10_n217(x)
+    else
+        fun_l10_n816(x)
+    end
+end
+
+def fun_l9_n798(x)
+    if (x < 1)
+        fun_l10_n310(x)
+    else
+        fun_l10_n445(x)
+    end
+end
+
+def fun_l9_n799(x)
+    if (x < 1)
+        fun_l10_n262(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n800(x)
+    if (x < 1)
+        fun_l10_n807(x)
+    else
+        fun_l10_n566(x)
+    end
+end
+
+def fun_l9_n801(x)
+    if (x < 1)
+        fun_l10_n466(x)
+    else
+        fun_l10_n287(x)
+    end
+end
+
+def fun_l9_n802(x)
+    if (x < 1)
+        fun_l10_n205(x)
+    else
+        fun_l10_n415(x)
+    end
+end
+
+def fun_l9_n803(x)
+    if (x < 1)
+        fun_l10_n618(x)
+    else
+        fun_l10_n87(x)
+    end
+end
+
+def fun_l9_n804(x)
+    if (x < 1)
+        fun_l10_n248(x)
+    else
+        fun_l10_n32(x)
+    end
+end
+
+def fun_l9_n805(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n844(x)
+    end
+end
+
+def fun_l9_n806(x)
+    if (x < 1)
+        fun_l10_n554(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n807(x)
+    if (x < 1)
+        fun_l10_n774(x)
+    else
+        fun_l10_n486(x)
+    end
+end
+
+def fun_l9_n808(x)
+    if (x < 1)
+        fun_l10_n500(x)
+    else
+        fun_l10_n926(x)
+    end
+end
+
+def fun_l9_n809(x)
+    if (x < 1)
+        fun_l10_n601(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n810(x)
+    if (x < 1)
+        fun_l10_n770(x)
+    else
+        fun_l10_n948(x)
+    end
+end
+
+def fun_l9_n811(x)
+    if (x < 1)
+        fun_l10_n658(x)
+    else
+        fun_l10_n840(x)
+    end
+end
+
+def fun_l9_n812(x)
+    if (x < 1)
+        fun_l10_n913(x)
+    else
+        fun_l10_n892(x)
+    end
+end
+
+def fun_l9_n813(x)
+    if (x < 1)
+        fun_l10_n440(x)
+    else
+        fun_l10_n204(x)
+    end
+end
+
+def fun_l9_n814(x)
+    if (x < 1)
+        fun_l10_n273(x)
+    else
+        fun_l10_n816(x)
+    end
+end
+
+def fun_l9_n815(x)
+    if (x < 1)
+        fun_l10_n190(x)
+    else
+        fun_l10_n735(x)
+    end
+end
+
+def fun_l9_n816(x)
+    if (x < 1)
+        fun_l10_n77(x)
+    else
+        fun_l10_n30(x)
+    end
+end
+
+def fun_l9_n817(x)
+    if (x < 1)
+        fun_l10_n697(x)
+    else
+        fun_l10_n985(x)
+    end
+end
+
+def fun_l9_n818(x)
+    if (x < 1)
+        fun_l10_n583(x)
+    else
+        fun_l10_n314(x)
+    end
+end
+
+def fun_l9_n819(x)
+    if (x < 1)
+        fun_l10_n149(x)
+    else
+        fun_l10_n556(x)
+    end
+end
+
+def fun_l9_n820(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n392(x)
+    end
+end
+
+def fun_l9_n821(x)
+    if (x < 1)
+        fun_l10_n401(x)
+    else
+        fun_l10_n217(x)
+    end
+end
+
+def fun_l9_n822(x)
+    if (x < 1)
+        fun_l10_n564(x)
+    else
+        fun_l10_n860(x)
+    end
+end
+
+def fun_l9_n823(x)
+    if (x < 1)
+        fun_l10_n901(x)
+    else
+        fun_l10_n836(x)
+    end
+end
+
+def fun_l9_n824(x)
+    if (x < 1)
+        fun_l10_n526(x)
+    else
+        fun_l10_n660(x)
+    end
+end
+
+def fun_l9_n825(x)
+    if (x < 1)
+        fun_l10_n245(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n826(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n928(x)
+    end
+end
+
+def fun_l9_n827(x)
+    if (x < 1)
+        fun_l10_n596(x)
+    else
+        fun_l10_n803(x)
+    end
+end
+
+def fun_l9_n828(x)
+    if (x < 1)
+        fun_l10_n454(x)
+    else
+        fun_l10_n679(x)
+    end
+end
+
+def fun_l9_n829(x)
+    if (x < 1)
+        fun_l10_n104(x)
+    else
+        fun_l10_n137(x)
+    end
+end
+
+def fun_l9_n830(x)
+    if (x < 1)
+        fun_l10_n516(x)
+    else
+        fun_l10_n687(x)
+    end
+end
+
+def fun_l9_n831(x)
+    if (x < 1)
+        fun_l10_n720(x)
+    else
+        fun_l10_n770(x)
+    end
+end
+
+def fun_l9_n832(x)
+    if (x < 1)
+        fun_l10_n939(x)
+    else
+        fun_l10_n119(x)
+    end
+end
+
+def fun_l9_n833(x)
+    if (x < 1)
+        fun_l10_n515(x)
+    else
+        fun_l10_n71(x)
+    end
+end
+
+def fun_l9_n834(x)
+    if (x < 1)
+        fun_l10_n668(x)
+    else
+        fun_l10_n521(x)
+    end
+end
+
+def fun_l9_n835(x)
+    if (x < 1)
+        fun_l10_n405(x)
+    else
+        fun_l10_n69(x)
+    end
+end
+
+def fun_l9_n836(x)
+    if (x < 1)
+        fun_l10_n201(x)
+    else
+        fun_l10_n681(x)
+    end
+end
+
+def fun_l9_n837(x)
+    if (x < 1)
+        fun_l10_n161(x)
+    else
+        fun_l10_n258(x)
+    end
+end
+
+def fun_l9_n838(x)
+    if (x < 1)
+        fun_l10_n913(x)
+    else
+        fun_l10_n586(x)
+    end
+end
+
+def fun_l9_n839(x)
+    if (x < 1)
+        fun_l10_n566(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n840(x)
+    if (x < 1)
+        fun_l10_n547(x)
+    else
+        fun_l10_n570(x)
+    end
+end
+
+def fun_l9_n841(x)
+    if (x < 1)
+        fun_l10_n888(x)
+    else
+        fun_l10_n843(x)
+    end
+end
+
+def fun_l9_n842(x)
+    if (x < 1)
+        fun_l10_n497(x)
+    else
+        fun_l10_n985(x)
+    end
+end
+
+def fun_l9_n843(x)
+    if (x < 1)
+        fun_l10_n754(x)
+    else
+        fun_l10_n390(x)
+    end
+end
+
+def fun_l9_n844(x)
+    if (x < 1)
+        fun_l10_n625(x)
+    else
+        fun_l10_n562(x)
+    end
+end
+
+def fun_l9_n845(x)
+    if (x < 1)
+        fun_l10_n858(x)
+    else
+        fun_l10_n553(x)
+    end
+end
+
+def fun_l9_n846(x)
+    if (x < 1)
+        fun_l10_n145(x)
+    else
+        fun_l10_n551(x)
+    end
+end
+
+def fun_l9_n847(x)
+    if (x < 1)
+        fun_l10_n916(x)
+    else
+        fun_l10_n851(x)
+    end
+end
+
+def fun_l9_n848(x)
+    if (x < 1)
+        fun_l10_n935(x)
+    else
+        fun_l10_n448(x)
+    end
+end
+
+def fun_l9_n849(x)
+    if (x < 1)
+        fun_l10_n664(x)
+    else
+        fun_l10_n832(x)
+    end
+end
+
+def fun_l9_n850(x)
+    if (x < 1)
+        fun_l10_n904(x)
+    else
+        fun_l10_n203(x)
+    end
+end
+
+def fun_l9_n851(x)
+    if (x < 1)
+        fun_l10_n863(x)
+    else
+        fun_l10_n491(x)
+    end
+end
+
+def fun_l9_n852(x)
+    if (x < 1)
+        fun_l10_n930(x)
+    else
+        fun_l10_n248(x)
+    end
+end
+
+def fun_l9_n853(x)
+    if (x < 1)
+        fun_l10_n637(x)
+    else
+        fun_l10_n716(x)
+    end
+end
+
+def fun_l9_n854(x)
+    if (x < 1)
+        fun_l10_n35(x)
+    else
+        fun_l10_n662(x)
+    end
+end
+
+def fun_l9_n855(x)
+    if (x < 1)
+        fun_l10_n57(x)
+    else
+        fun_l10_n392(x)
+    end
+end
+
+def fun_l9_n856(x)
+    if (x < 1)
+        fun_l10_n480(x)
+    else
+        fun_l10_n447(x)
+    end
+end
+
+def fun_l9_n857(x)
+    if (x < 1)
+        fun_l10_n134(x)
+    else
+        fun_l10_n842(x)
+    end
+end
+
+def fun_l9_n858(x)
+    if (x < 1)
+        fun_l10_n384(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n859(x)
+    if (x < 1)
+        fun_l10_n718(x)
+    else
+        fun_l10_n571(x)
+    end
+end
+
+def fun_l9_n860(x)
+    if (x < 1)
+        fun_l10_n237(x)
+    else
+        fun_l10_n654(x)
+    end
+end
+
+def fun_l9_n861(x)
+    if (x < 1)
+        fun_l10_n807(x)
+    else
+        fun_l10_n409(x)
+    end
+end
+
+def fun_l9_n862(x)
+    if (x < 1)
+        fun_l10_n801(x)
+    else
+        fun_l10_n575(x)
+    end
+end
+
+def fun_l9_n863(x)
+    if (x < 1)
+        fun_l10_n500(x)
+    else
+        fun_l10_n133(x)
+    end
+end
+
+def fun_l9_n864(x)
+    if (x < 1)
+        fun_l10_n403(x)
+    else
+        fun_l10_n720(x)
+    end
+end
+
+def fun_l9_n865(x)
+    if (x < 1)
+        fun_l10_n648(x)
+    else
+        fun_l10_n677(x)
+    end
+end
+
+def fun_l9_n866(x)
+    if (x < 1)
+        fun_l10_n873(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n867(x)
+    if (x < 1)
+        fun_l10_n459(x)
+    else
+        fun_l10_n331(x)
+    end
+end
+
+def fun_l9_n868(x)
+    if (x < 1)
+        fun_l10_n159(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n869(x)
+    if (x < 1)
+        fun_l10_n155(x)
+    else
+        fun_l10_n41(x)
+    end
+end
+
+def fun_l9_n870(x)
+    if (x < 1)
+        fun_l10_n947(x)
+    else
+        fun_l10_n386(x)
+    end
+end
+
+def fun_l9_n871(x)
+    if (x < 1)
+        fun_l10_n868(x)
+    else
+        fun_l10_n794(x)
+    end
+end
+
+def fun_l9_n872(x)
+    if (x < 1)
+        fun_l10_n77(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n873(x)
+    if (x < 1)
+        fun_l10_n119(x)
+    else
+        fun_l10_n819(x)
+    end
+end
+
+def fun_l9_n874(x)
+    if (x < 1)
+        fun_l10_n143(x)
+    else
+        fun_l10_n434(x)
+    end
+end
+
+def fun_l9_n875(x)
+    if (x < 1)
+        fun_l10_n238(x)
+    else
+        fun_l10_n489(x)
+    end
+end
+
+def fun_l9_n876(x)
+    if (x < 1)
+        fun_l10_n687(x)
+    else
+        fun_l10_n384(x)
+    end
+end
+
+def fun_l9_n877(x)
+    if (x < 1)
+        fun_l10_n27(x)
+    else
+        fun_l10_n138(x)
+    end
+end
+
+def fun_l9_n878(x)
+    if (x < 1)
+        fun_l10_n208(x)
+    else
+        fun_l10_n691(x)
+    end
+end
+
+def fun_l9_n879(x)
+    if (x < 1)
+        fun_l10_n793(x)
+    else
+        fun_l10_n165(x)
+    end
+end
+
+def fun_l9_n880(x)
+    if (x < 1)
+        fun_l10_n358(x)
+    else
+        fun_l10_n455(x)
+    end
+end
+
+def fun_l9_n881(x)
+    if (x < 1)
+        fun_l10_n558(x)
+    else
+        fun_l10_n184(x)
+    end
+end
+
+def fun_l9_n882(x)
+    if (x < 1)
+        fun_l10_n461(x)
+    else
+        fun_l10_n155(x)
+    end
+end
+
+def fun_l9_n883(x)
+    if (x < 1)
+        fun_l10_n503(x)
+    else
+        fun_l10_n225(x)
+    end
+end
+
+def fun_l9_n884(x)
+    if (x < 1)
+        fun_l10_n384(x)
+    else
+        fun_l10_n262(x)
+    end
+end
+
+def fun_l9_n885(x)
+    if (x < 1)
+        fun_l10_n565(x)
+    else
+        fun_l10_n633(x)
+    end
+end
+
+def fun_l9_n886(x)
+    if (x < 1)
+        fun_l10_n626(x)
+    else
+        fun_l10_n796(x)
+    end
+end
+
+def fun_l9_n887(x)
+    if (x < 1)
+        fun_l10_n424(x)
+    else
+        fun_l10_n458(x)
+    end
+end
+
+def fun_l9_n888(x)
+    if (x < 1)
+        fun_l10_n687(x)
+    else
+        fun_l10_n145(x)
+    end
+end
+
+def fun_l9_n889(x)
+    if (x < 1)
+        fun_l10_n787(x)
+    else
+        fun_l10_n225(x)
+    end
+end
+
+def fun_l9_n890(x)
+    if (x < 1)
+        fun_l10_n249(x)
+    else
+        fun_l10_n154(x)
+    end
+end
+
+def fun_l9_n891(x)
+    if (x < 1)
+        fun_l10_n38(x)
+    else
+        fun_l10_n635(x)
+    end
+end
+
+def fun_l9_n892(x)
+    if (x < 1)
+        fun_l10_n920(x)
+    else
+        fun_l10_n478(x)
+    end
+end
+
+def fun_l9_n893(x)
+    if (x < 1)
+        fun_l10_n13(x)
+    else
+        fun_l10_n174(x)
+    end
+end
+
+def fun_l9_n894(x)
+    if (x < 1)
+        fun_l10_n304(x)
+    else
+        fun_l10_n495(x)
+    end
+end
+
+def fun_l9_n895(x)
+    if (x < 1)
+        fun_l10_n226(x)
+    else
+        fun_l10_n420(x)
+    end
+end
+
+def fun_l9_n896(x)
+    if (x < 1)
+        fun_l10_n86(x)
+    else
+        fun_l10_n837(x)
+    end
+end
+
+def fun_l9_n897(x)
+    if (x < 1)
+        fun_l10_n927(x)
+    else
+        fun_l10_n344(x)
+    end
+end
+
+def fun_l9_n898(x)
+    if (x < 1)
+        fun_l10_n87(x)
+    else
+        fun_l10_n270(x)
+    end
+end
+
+def fun_l9_n899(x)
+    if (x < 1)
+        fun_l10_n549(x)
+    else
+        fun_l10_n349(x)
+    end
+end
+
+def fun_l9_n900(x)
+    if (x < 1)
+        fun_l10_n456(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n901(x)
+    if (x < 1)
+        fun_l10_n154(x)
+    else
+        fun_l10_n764(x)
+    end
+end
+
+def fun_l9_n902(x)
+    if (x < 1)
+        fun_l10_n614(x)
+    else
+        fun_l10_n536(x)
+    end
+end
+
+def fun_l9_n903(x)
+    if (x < 1)
+        fun_l10_n108(x)
+    else
+        fun_l10_n197(x)
+    end
+end
+
+def fun_l9_n904(x)
+    if (x < 1)
+        fun_l10_n616(x)
+    else
+        fun_l10_n777(x)
+    end
+end
+
+def fun_l9_n905(x)
+    if (x < 1)
+        fun_l10_n515(x)
+    else
+        fun_l10_n830(x)
+    end
+end
+
+def fun_l9_n906(x)
+    if (x < 1)
+        fun_l10_n288(x)
+    else
+        fun_l10_n717(x)
+    end
+end
+
+def fun_l9_n907(x)
+    if (x < 1)
+        fun_l10_n704(x)
+    else
+        fun_l10_n962(x)
+    end
+end
+
+def fun_l9_n908(x)
+    if (x < 1)
+        fun_l10_n85(x)
+    else
+        fun_l10_n70(x)
+    end
+end
+
+def fun_l9_n909(x)
+    if (x < 1)
+        fun_l10_n806(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n910(x)
+    if (x < 1)
+        fun_l10_n567(x)
+    else
+        fun_l10_n47(x)
+    end
+end
+
+def fun_l9_n911(x)
+    if (x < 1)
+        fun_l10_n919(x)
+    else
+        fun_l10_n879(x)
+    end
+end
+
+def fun_l9_n912(x)
+    if (x < 1)
+        fun_l10_n229(x)
+    else
+        fun_l10_n200(x)
+    end
+end
+
+def fun_l9_n913(x)
+    if (x < 1)
+        fun_l10_n502(x)
+    else
+        fun_l10_n820(x)
+    end
+end
+
+def fun_l9_n914(x)
+    if (x < 1)
+        fun_l10_n57(x)
+    else
+        fun_l10_n470(x)
+    end
+end
+
+def fun_l9_n915(x)
+    if (x < 1)
+        fun_l10_n909(x)
+    else
+        fun_l10_n845(x)
+    end
+end
+
+def fun_l9_n916(x)
+    if (x < 1)
+        fun_l10_n658(x)
+    else
+        fun_l10_n925(x)
+    end
+end
+
+def fun_l9_n917(x)
+    if (x < 1)
+        fun_l10_n886(x)
+    else
+        fun_l10_n285(x)
+    end
+end
+
+def fun_l9_n918(x)
+    if (x < 1)
+        fun_l10_n484(x)
+    else
+        fun_l10_n712(x)
+    end
+end
+
+def fun_l9_n919(x)
+    if (x < 1)
+        fun_l10_n299(x)
+    else
+        fun_l10_n144(x)
+    end
+end
+
+def fun_l9_n920(x)
+    if (x < 1)
+        fun_l10_n830(x)
+    else
+        fun_l10_n913(x)
+    end
+end
+
+def fun_l9_n921(x)
+    if (x < 1)
+        fun_l10_n306(x)
+    else
+        fun_l10_n242(x)
+    end
+end
+
+def fun_l9_n922(x)
+    if (x < 1)
+        fun_l10_n442(x)
+    else
+        fun_l10_n497(x)
+    end
+end
+
+def fun_l9_n923(x)
+    if (x < 1)
+        fun_l10_n22(x)
+    else
+        fun_l10_n376(x)
+    end
+end
+
+def fun_l9_n924(x)
+    if (x < 1)
+        fun_l10_n737(x)
+    else
+        fun_l10_n603(x)
+    end
+end
+
+def fun_l9_n925(x)
+    if (x < 1)
+        fun_l10_n300(x)
+    else
+        fun_l10_n974(x)
+    end
+end
+
+def fun_l9_n926(x)
+    if (x < 1)
+        fun_l10_n644(x)
+    else
+        fun_l10_n973(x)
+    end
+end
+
+def fun_l9_n927(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n353(x)
+    end
+end
+
+def fun_l9_n928(x)
+    if (x < 1)
+        fun_l10_n438(x)
+    else
+        fun_l10_n518(x)
+    end
+end
+
+def fun_l9_n929(x)
+    if (x < 1)
+        fun_l10_n30(x)
+    else
+        fun_l10_n207(x)
+    end
+end
+
+def fun_l9_n930(x)
+    if (x < 1)
+        fun_l10_n976(x)
+    else
+        fun_l10_n70(x)
+    end
+end
+
+def fun_l9_n931(x)
+    if (x < 1)
+        fun_l10_n5(x)
+    else
+        fun_l10_n37(x)
+    end
+end
+
+def fun_l9_n932(x)
+    if (x < 1)
+        fun_l10_n612(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n933(x)
+    if (x < 1)
+        fun_l10_n81(x)
+    else
+        fun_l10_n373(x)
+    end
+end
+
+def fun_l9_n934(x)
+    if (x < 1)
+        fun_l10_n30(x)
+    else
+        fun_l10_n504(x)
+    end
+end
+
+def fun_l9_n935(x)
+    if (x < 1)
+        fun_l10_n131(x)
+    else
+        fun_l10_n617(x)
+    end
+end
+
+def fun_l9_n936(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n883(x)
+    end
+end
+
+def fun_l9_n937(x)
+    if (x < 1)
+        fun_l10_n859(x)
+    else
+        fun_l10_n788(x)
+    end
+end
+
+def fun_l9_n938(x)
+    if (x < 1)
+        fun_l10_n993(x)
+    else
+        fun_l10_n349(x)
+    end
+end
+
+def fun_l9_n939(x)
+    if (x < 1)
+        fun_l10_n775(x)
+    else
+        fun_l10_n195(x)
+    end
+end
+
+def fun_l9_n940(x)
+    if (x < 1)
+        fun_l10_n829(x)
+    else
+        fun_l10_n398(x)
+    end
+end
+
+def fun_l9_n941(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n529(x)
+    end
+end
+
+def fun_l9_n942(x)
+    if (x < 1)
+        fun_l10_n965(x)
+    else
+        fun_l10_n372(x)
+    end
+end
+
+def fun_l9_n943(x)
+    if (x < 1)
+        fun_l10_n953(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n944(x)
+    if (x < 1)
+        fun_l10_n984(x)
+    else
+        fun_l10_n909(x)
+    end
+end
+
+def fun_l9_n945(x)
+    if (x < 1)
+        fun_l10_n649(x)
+    else
+        fun_l10_n304(x)
+    end
+end
+
+def fun_l9_n946(x)
+    if (x < 1)
+        fun_l10_n0(x)
+    else
+        fun_l10_n922(x)
+    end
+end
+
+def fun_l9_n947(x)
+    if (x < 1)
+        fun_l10_n460(x)
+    else
+        fun_l10_n215(x)
+    end
+end
+
+def fun_l9_n948(x)
+    if (x < 1)
+        fun_l10_n251(x)
+    else
+        fun_l10_n636(x)
+    end
+end
+
+def fun_l9_n949(x)
+    if (x < 1)
+        fun_l10_n14(x)
+    else
+        fun_l10_n494(x)
+    end
+end
+
+def fun_l9_n950(x)
+    if (x < 1)
+        fun_l10_n6(x)
+    else
+        fun_l10_n523(x)
+    end
+end
+
+def fun_l9_n951(x)
+    if (x < 1)
+        fun_l10_n705(x)
+    else
+        fun_l10_n689(x)
+    end
+end
+
+def fun_l9_n952(x)
+    if (x < 1)
+        fun_l10_n830(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n953(x)
+    if (x < 1)
+        fun_l10_n451(x)
+    else
+        fun_l10_n87(x)
+    end
+end
+
+def fun_l9_n954(x)
+    if (x < 1)
+        fun_l10_n202(x)
+    else
+        fun_l10_n753(x)
+    end
+end
+
+def fun_l9_n955(x)
+    if (x < 1)
+        fun_l10_n384(x)
+    else
+        fun_l10_n216(x)
+    end
+end
+
+def fun_l9_n956(x)
+    if (x < 1)
+        fun_l10_n381(x)
+    else
+        fun_l10_n727(x)
+    end
+end
+
+def fun_l9_n957(x)
+    if (x < 1)
+        fun_l10_n876(x)
+    else
+        fun_l10_n760(x)
+    end
+end
+
+def fun_l9_n958(x)
+    if (x < 1)
+        fun_l10_n975(x)
+    else
+        fun_l10_n372(x)
+    end
+end
+
+def fun_l9_n959(x)
+    if (x < 1)
+        fun_l10_n714(x)
+    else
+        fun_l10_n680(x)
+    end
+end
+
+def fun_l9_n960(x)
+    if (x < 1)
+        fun_l10_n733(x)
+    else
+        fun_l10_n508(x)
+    end
+end
+
+def fun_l9_n961(x)
+    if (x < 1)
+        fun_l10_n319(x)
+    else
+        fun_l10_n90(x)
+    end
+end
+
+def fun_l9_n962(x)
+    if (x < 1)
+        fun_l10_n964(x)
+    else
+        fun_l10_n282(x)
+    end
+end
+
+def fun_l9_n963(x)
+    if (x < 1)
+        fun_l10_n179(x)
+    else
+        fun_l10_n324(x)
+    end
+end
+
+def fun_l9_n964(x)
+    if (x < 1)
+        fun_l10_n627(x)
+    else
+        fun_l10_n627(x)
+    end
+end
+
+def fun_l9_n965(x)
+    if (x < 1)
+        fun_l10_n7(x)
+    else
+        fun_l10_n375(x)
+    end
+end
+
+def fun_l9_n966(x)
+    if (x < 1)
+        fun_l10_n960(x)
+    else
+        fun_l10_n272(x)
+    end
+end
+
+def fun_l9_n967(x)
+    if (x < 1)
+        fun_l10_n869(x)
+    else
+        fun_l10_n737(x)
+    end
+end
+
+def fun_l9_n968(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n969(x)
+    if (x < 1)
+        fun_l10_n258(x)
+    else
+        fun_l10_n105(x)
+    end
+end
+
+def fun_l9_n970(x)
+    if (x < 1)
+        fun_l10_n817(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n971(x)
+    if (x < 1)
+        fun_l10_n462(x)
+    else
+        fun_l10_n335(x)
+    end
+end
+
+def fun_l9_n972(x)
+    if (x < 1)
+        fun_l10_n770(x)
+    else
+        fun_l10_n856(x)
+    end
+end
+
+def fun_l9_n973(x)
+    if (x < 1)
+        fun_l10_n607(x)
+    else
+        fun_l10_n142(x)
+    end
+end
+
+def fun_l9_n974(x)
+    if (x < 1)
+        fun_l10_n498(x)
+    else
+        fun_l10_n373(x)
+    end
+end
+
+def fun_l9_n975(x)
+    if (x < 1)
+        fun_l10_n239(x)
+    else
+        fun_l10_n895(x)
+    end
+end
+
+def fun_l9_n976(x)
+    if (x < 1)
+        fun_l10_n312(x)
+    else
+        fun_l10_n489(x)
+    end
+end
+
+def fun_l9_n977(x)
+    if (x < 1)
+        fun_l10_n595(x)
+    else
+        fun_l10_n674(x)
+    end
+end
+
+def fun_l9_n978(x)
+    if (x < 1)
+        fun_l10_n928(x)
+    else
+        fun_l10_n774(x)
+    end
+end
+
+def fun_l9_n979(x)
+    if (x < 1)
+        fun_l10_n964(x)
+    else
+        fun_l10_n860(x)
+    end
+end
+
+def fun_l9_n980(x)
+    if (x < 1)
+        fun_l10_n63(x)
+    else
+        fun_l10_n115(x)
+    end
+end
+
+def fun_l9_n981(x)
+    if (x < 1)
+        fun_l10_n930(x)
+    else
+        fun_l10_n559(x)
+    end
+end
+
+def fun_l9_n982(x)
+    if (x < 1)
+        fun_l10_n391(x)
+    else
+        fun_l10_n411(x)
+    end
+end
+
+def fun_l9_n983(x)
+    if (x < 1)
+        fun_l10_n71(x)
+    else
+        fun_l10_n632(x)
+    end
+end
+
+def fun_l9_n984(x)
+    if (x < 1)
+        fun_l10_n613(x)
+    else
+        fun_l10_n218(x)
+    end
+end
+
+def fun_l9_n985(x)
+    if (x < 1)
+        fun_l10_n263(x)
+    else
+        fun_l10_n858(x)
+    end
+end
+
+def fun_l9_n986(x)
+    if (x < 1)
+        fun_l10_n974(x)
+    else
+        fun_l10_n824(x)
+    end
+end
+
+def fun_l9_n987(x)
+    if (x < 1)
+        fun_l10_n636(x)
+    else
+        fun_l10_n55(x)
+    end
+end
+
+def fun_l9_n988(x)
+    if (x < 1)
+        fun_l10_n367(x)
+    else
+        fun_l10_n878(x)
+    end
+end
+
+def fun_l9_n989(x)
+    if (x < 1)
+        fun_l10_n316(x)
+    else
+        fun_l10_n800(x)
+    end
+end
+
+def fun_l9_n990(x)
+    if (x < 1)
+        fun_l10_n581(x)
+    else
+        fun_l10_n511(x)
+    end
+end
+
+def fun_l9_n991(x)
+    if (x < 1)
+        fun_l10_n667(x)
+    else
+        fun_l10_n566(x)
+    end
+end
+
+def fun_l9_n992(x)
+    if (x < 1)
+        fun_l10_n144(x)
+    else
+        fun_l10_n51(x)
+    end
+end
+
+def fun_l9_n993(x)
+    if (x < 1)
+        fun_l10_n652(x)
+    else
+        fun_l10_n436(x)
+    end
+end
+
+def fun_l9_n994(x)
+    if (x < 1)
+        fun_l10_n283(x)
+    else
+        fun_l10_n480(x)
+    end
+end
+
+def fun_l9_n995(x)
+    if (x < 1)
+        fun_l10_n908(x)
+    else
+        fun_l10_n86(x)
+    end
+end
+
+def fun_l9_n996(x)
+    if (x < 1)
+        fun_l10_n43(x)
+    else
+        fun_l10_n466(x)
+    end
+end
+
+def fun_l9_n997(x)
+    if (x < 1)
+        fun_l10_n968(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n998(x)
+    if (x < 1)
+        fun_l10_n38(x)
+    else
+        fun_l10_n78(x)
+    end
+end
+
+def fun_l9_n999(x)
+    if (x < 1)
+        fun_l10_n947(x)
+    else
+        fun_l10_n322(x)
+    end
+end
+
+def fun_l10_n0(x)
+    if (x < 1)
+        fun_l11_n424(x)
+    else
+        fun_l11_n206(x)
+    end
+end
+
+def fun_l10_n1(x)
+    if (x < 1)
+        fun_l11_n263(x)
+    else
+        fun_l11_n886(x)
+    end
+end
+
+def fun_l10_n2(x)
+    if (x < 1)
+        fun_l11_n31(x)
+    else
+        fun_l11_n693(x)
+    end
+end
+
+def fun_l10_n3(x)
+    if (x < 1)
+        fun_l11_n924(x)
+    else
+        fun_l11_n585(x)
+    end
+end
+
+def fun_l10_n4(x)
+    if (x < 1)
+        fun_l11_n552(x)
+    else
+        fun_l11_n904(x)
+    end
+end
+
+def fun_l10_n5(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n127(x)
+    end
+end
+
+def fun_l10_n6(x)
+    if (x < 1)
+        fun_l11_n284(x)
+    else
+        fun_l11_n952(x)
+    end
+end
+
+def fun_l10_n7(x)
+    if (x < 1)
+        fun_l11_n294(x)
+    else
+        fun_l11_n527(x)
+    end
+end
+
+def fun_l10_n8(x)
+    if (x < 1)
+        fun_l11_n675(x)
+    else
+        fun_l11_n457(x)
+    end
+end
+
+def fun_l10_n9(x)
+    if (x < 1)
+        fun_l11_n908(x)
+    else
+        fun_l11_n963(x)
+    end
+end
+
+def fun_l10_n10(x)
+    if (x < 1)
+        fun_l11_n361(x)
+    else
+        fun_l11_n839(x)
+    end
+end
+
+def fun_l10_n11(x)
+    if (x < 1)
+        fun_l11_n402(x)
+    else
+        fun_l11_n228(x)
+    end
+end
+
+def fun_l10_n12(x)
+    if (x < 1)
+        fun_l11_n871(x)
+    else
+        fun_l11_n194(x)
+    end
+end
+
+def fun_l10_n13(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n816(x)
+    end
+end
+
+def fun_l10_n14(x)
+    if (x < 1)
+        fun_l11_n987(x)
+    else
+        fun_l11_n870(x)
+    end
+end
+
+def fun_l10_n15(x)
+    if (x < 1)
+        fun_l11_n538(x)
+    else
+        fun_l11_n837(x)
+    end
+end
+
+def fun_l10_n16(x)
+    if (x < 1)
+        fun_l11_n205(x)
+    else
+        fun_l11_n831(x)
+    end
+end
+
+def fun_l10_n17(x)
+    if (x < 1)
+        fun_l11_n737(x)
+    else
+        fun_l11_n242(x)
+    end
+end
+
+def fun_l10_n18(x)
+    if (x < 1)
+        fun_l11_n18(x)
+    else
+        fun_l11_n103(x)
+    end
+end
+
+def fun_l10_n19(x)
+    if (x < 1)
+        fun_l11_n928(x)
+    else
+        fun_l11_n300(x)
+    end
+end
+
+def fun_l10_n20(x)
+    if (x < 1)
+        fun_l11_n816(x)
+    else
+        fun_l11_n225(x)
+    end
+end
+
+def fun_l10_n21(x)
+    if (x < 1)
+        fun_l11_n52(x)
+    else
+        fun_l11_n901(x)
+    end
+end
+
+def fun_l10_n22(x)
+    if (x < 1)
+        fun_l11_n316(x)
+    else
+        fun_l11_n556(x)
+    end
+end
+
+def fun_l10_n23(x)
+    if (x < 1)
+        fun_l11_n103(x)
+    else
+        fun_l11_n223(x)
+    end
+end
+
+def fun_l10_n24(x)
+    if (x < 1)
+        fun_l11_n14(x)
+    else
+        fun_l11_n875(x)
+    end
+end
+
+def fun_l10_n25(x)
+    if (x < 1)
+        fun_l11_n359(x)
+    else
+        fun_l11_n504(x)
+    end
+end
+
+def fun_l10_n26(x)
+    if (x < 1)
+        fun_l11_n416(x)
+    else
+        fun_l11_n172(x)
+    end
+end
+
+def fun_l10_n27(x)
+    if (x < 1)
+        fun_l11_n142(x)
+    else
+        fun_l11_n238(x)
+    end
+end
+
+def fun_l10_n28(x)
+    if (x < 1)
+        fun_l11_n319(x)
+    else
+        fun_l11_n350(x)
+    end
+end
+
+def fun_l10_n29(x)
+    if (x < 1)
+        fun_l11_n53(x)
+    else
+        fun_l11_n162(x)
+    end
+end
+
+def fun_l10_n30(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n31(x)
+    if (x < 1)
+        fun_l11_n447(x)
+    else
+        fun_l11_n259(x)
+    end
+end
+
+def fun_l10_n32(x)
+    if (x < 1)
+        fun_l11_n931(x)
+    else
+        fun_l11_n571(x)
+    end
+end
+
+def fun_l10_n33(x)
+    if (x < 1)
+        fun_l11_n705(x)
+    else
+        fun_l11_n544(x)
+    end
+end
+
+def fun_l10_n34(x)
+    if (x < 1)
+        fun_l11_n990(x)
+    else
+        fun_l11_n695(x)
+    end
+end
+
+def fun_l10_n35(x)
+    if (x < 1)
+        fun_l11_n197(x)
+    else
+        fun_l11_n391(x)
+    end
+end
+
+def fun_l10_n36(x)
+    if (x < 1)
+        fun_l11_n686(x)
+    else
+        fun_l11_n785(x)
+    end
+end
+
+def fun_l10_n37(x)
+    if (x < 1)
+        fun_l11_n466(x)
+    else
+        fun_l11_n783(x)
+    end
+end
+
+def fun_l10_n38(x)
+    if (x < 1)
+        fun_l11_n351(x)
+    else
+        fun_l11_n732(x)
+    end
+end
+
+def fun_l10_n39(x)
+    if (x < 1)
+        fun_l11_n22(x)
+    else
+        fun_l11_n995(x)
+    end
+end
+
+def fun_l10_n40(x)
+    if (x < 1)
+        fun_l11_n264(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n41(x)
+    if (x < 1)
+        fun_l11_n91(x)
+    else
+        fun_l11_n673(x)
+    end
+end
+
+def fun_l10_n42(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n839(x)
+    end
+end
+
+def fun_l10_n43(x)
+    if (x < 1)
+        fun_l11_n158(x)
+    else
+        fun_l11_n774(x)
+    end
+end
+
+def fun_l10_n44(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n321(x)
+    end
+end
+
+def fun_l10_n45(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n184(x)
+    end
+end
+
+def fun_l10_n46(x)
+    if (x < 1)
+        fun_l11_n446(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n47(x)
+    if (x < 1)
+        fun_l11_n524(x)
+    else
+        fun_l11_n123(x)
+    end
+end
+
+def fun_l10_n48(x)
+    if (x < 1)
+        fun_l11_n435(x)
+    else
+        fun_l11_n560(x)
+    end
+end
+
+def fun_l10_n49(x)
+    if (x < 1)
+        fun_l11_n94(x)
+    else
+        fun_l11_n731(x)
+    end
+end
+
+def fun_l10_n50(x)
+    if (x < 1)
+        fun_l11_n177(x)
+    else
+        fun_l11_n902(x)
+    end
+end
+
+def fun_l10_n51(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n807(x)
+    end
+end
+
+def fun_l10_n52(x)
+    if (x < 1)
+        fun_l11_n414(x)
+    else
+        fun_l11_n335(x)
+    end
+end
+
+def fun_l10_n53(x)
+    if (x < 1)
+        fun_l11_n754(x)
+    else
+        fun_l11_n789(x)
+    end
+end
+
+def fun_l10_n54(x)
+    if (x < 1)
+        fun_l11_n843(x)
+    else
+        fun_l11_n980(x)
+    end
+end
+
+def fun_l10_n55(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n160(x)
+    end
+end
+
+def fun_l10_n56(x)
+    if (x < 1)
+        fun_l11_n564(x)
+    else
+        fun_l11_n672(x)
+    end
+end
+
+def fun_l10_n57(x)
+    if (x < 1)
+        fun_l11_n158(x)
+    else
+        fun_l11_n154(x)
+    end
+end
+
+def fun_l10_n58(x)
+    if (x < 1)
+        fun_l11_n120(x)
+    else
+        fun_l11_n970(x)
+    end
+end
+
+def fun_l10_n59(x)
+    if (x < 1)
+        fun_l11_n561(x)
+    else
+        fun_l11_n872(x)
+    end
+end
+
+def fun_l10_n60(x)
+    if (x < 1)
+        fun_l11_n93(x)
+    else
+        fun_l11_n723(x)
+    end
+end
+
+def fun_l10_n61(x)
+    if (x < 1)
+        fun_l11_n921(x)
+    else
+        fun_l11_n578(x)
+    end
+end
+
+def fun_l10_n62(x)
+    if (x < 1)
+        fun_l11_n527(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n63(x)
+    if (x < 1)
+        fun_l11_n225(x)
+    else
+        fun_l11_n937(x)
+    end
+end
+
+def fun_l10_n64(x)
+    if (x < 1)
+        fun_l11_n634(x)
+    else
+        fun_l11_n415(x)
+    end
+end
+
+def fun_l10_n65(x)
+    if (x < 1)
+        fun_l11_n718(x)
+    else
+        fun_l11_n958(x)
+    end
+end
+
+def fun_l10_n66(x)
+    if (x < 1)
+        fun_l11_n972(x)
+    else
+        fun_l11_n453(x)
+    end
+end
+
+def fun_l10_n67(x)
+    if (x < 1)
+        fun_l11_n85(x)
+    else
+        fun_l11_n934(x)
+    end
+end
+
+def fun_l10_n68(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n138(x)
+    end
+end
+
+def fun_l10_n69(x)
+    if (x < 1)
+        fun_l11_n312(x)
+    else
+        fun_l11_n62(x)
+    end
+end
+
+def fun_l10_n70(x)
+    if (x < 1)
+        fun_l11_n591(x)
+    else
+        fun_l11_n906(x)
+    end
+end
+
+def fun_l10_n71(x)
+    if (x < 1)
+        fun_l11_n571(x)
+    else
+        fun_l11_n429(x)
+    end
+end
+
+def fun_l10_n72(x)
+    if (x < 1)
+        fun_l11_n996(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n73(x)
+    if (x < 1)
+        fun_l11_n691(x)
+    else
+        fun_l11_n116(x)
+    end
+end
+
+def fun_l10_n74(x)
+    if (x < 1)
+        fun_l11_n670(x)
+    else
+        fun_l11_n865(x)
+    end
+end
+
+def fun_l10_n75(x)
+    if (x < 1)
+        fun_l11_n568(x)
+    else
+        fun_l11_n164(x)
+    end
+end
+
+def fun_l10_n76(x)
+    if (x < 1)
+        fun_l11_n747(x)
+    else
+        fun_l11_n235(x)
+    end
+end
+
+def fun_l10_n77(x)
+    if (x < 1)
+        fun_l11_n402(x)
+    else
+        fun_l11_n670(x)
+    end
+end
+
+def fun_l10_n78(x)
+    if (x < 1)
+        fun_l11_n525(x)
+    else
+        fun_l11_n675(x)
+    end
+end
+
+def fun_l10_n79(x)
+    if (x < 1)
+        fun_l11_n6(x)
+    else
+        fun_l11_n238(x)
+    end
+end
+
+def fun_l10_n80(x)
+    if (x < 1)
+        fun_l11_n905(x)
+    else
+        fun_l11_n170(x)
+    end
+end
+
+def fun_l10_n81(x)
+    if (x < 1)
+        fun_l11_n610(x)
+    else
+        fun_l11_n527(x)
+    end
+end
+
+def fun_l10_n82(x)
+    if (x < 1)
+        fun_l11_n796(x)
+    else
+        fun_l11_n749(x)
+    end
+end
+
+def fun_l10_n83(x)
+    if (x < 1)
+        fun_l11_n634(x)
+    else
+        fun_l11_n49(x)
+    end
+end
+
+def fun_l10_n84(x)
+    if (x < 1)
+        fun_l11_n376(x)
+    else
+        fun_l11_n852(x)
+    end
+end
+
+def fun_l10_n85(x)
+    if (x < 1)
+        fun_l11_n593(x)
+    else
+        fun_l11_n752(x)
+    end
+end
+
+def fun_l10_n86(x)
+    if (x < 1)
+        fun_l11_n821(x)
+    else
+        fun_l11_n892(x)
+    end
+end
+
+def fun_l10_n87(x)
+    if (x < 1)
+        fun_l11_n950(x)
+    else
+        fun_l11_n309(x)
+    end
+end
+
+def fun_l10_n88(x)
+    if (x < 1)
+        fun_l11_n360(x)
+    else
+        fun_l11_n134(x)
+    end
+end
+
+def fun_l10_n89(x)
+    if (x < 1)
+        fun_l11_n935(x)
+    else
+        fun_l11_n241(x)
+    end
+end
+
+def fun_l10_n90(x)
+    if (x < 1)
+        fun_l11_n524(x)
+    else
+        fun_l11_n120(x)
+    end
+end
+
+def fun_l10_n91(x)
+    if (x < 1)
+        fun_l11_n25(x)
+    else
+        fun_l11_n357(x)
+    end
+end
+
+def fun_l10_n92(x)
+    if (x < 1)
+        fun_l11_n248(x)
+    else
+        fun_l11_n212(x)
+    end
+end
+
+def fun_l10_n93(x)
+    if (x < 1)
+        fun_l11_n860(x)
+    else
+        fun_l11_n733(x)
+    end
+end
+
+def fun_l10_n94(x)
+    if (x < 1)
+        fun_l11_n147(x)
+    else
+        fun_l11_n907(x)
+    end
+end
+
+def fun_l10_n95(x)
+    if (x < 1)
+        fun_l11_n758(x)
+    else
+        fun_l11_n62(x)
+    end
+end
+
+def fun_l10_n96(x)
+    if (x < 1)
+        fun_l11_n205(x)
+    else
+        fun_l11_n54(x)
+    end
+end
+
+def fun_l10_n97(x)
+    if (x < 1)
+        fun_l11_n8(x)
+    else
+        fun_l11_n813(x)
+    end
+end
+
+def fun_l10_n98(x)
+    if (x < 1)
+        fun_l11_n296(x)
+    else
+        fun_l11_n693(x)
+    end
+end
+
+def fun_l10_n99(x)
+    if (x < 1)
+        fun_l11_n181(x)
+    else
+        fun_l11_n709(x)
+    end
+end
+
+def fun_l10_n100(x)
+    if (x < 1)
+        fun_l11_n109(x)
+    else
+        fun_l11_n560(x)
+    end
+end
+
+def fun_l10_n101(x)
+    if (x < 1)
+        fun_l11_n290(x)
+    else
+        fun_l11_n693(x)
+    end
+end
+
+def fun_l10_n102(x)
+    if (x < 1)
+        fun_l11_n826(x)
+    else
+        fun_l11_n813(x)
+    end
+end
+
+def fun_l10_n103(x)
+    if (x < 1)
+        fun_l11_n3(x)
+    else
+        fun_l11_n787(x)
+    end
+end
+
+def fun_l10_n104(x)
+    if (x < 1)
+        fun_l11_n477(x)
+    else
+        fun_l11_n336(x)
+    end
+end
+
+def fun_l10_n105(x)
+    if (x < 1)
+        fun_l11_n131(x)
+    else
+        fun_l11_n500(x)
+    end
+end
+
+def fun_l10_n106(x)
+    if (x < 1)
+        fun_l11_n278(x)
+    else
+        fun_l11_n948(x)
+    end
+end
+
+def fun_l10_n107(x)
+    if (x < 1)
+        fun_l11_n950(x)
+    else
+        fun_l11_n848(x)
+    end
+end
+
+def fun_l10_n108(x)
+    if (x < 1)
+        fun_l11_n490(x)
+    else
+        fun_l11_n1(x)
+    end
+end
+
+def fun_l10_n109(x)
+    if (x < 1)
+        fun_l11_n297(x)
+    else
+        fun_l11_n902(x)
+    end
+end
+
+def fun_l10_n110(x)
+    if (x < 1)
+        fun_l11_n808(x)
+    else
+        fun_l11_n697(x)
+    end
+end
+
+def fun_l10_n111(x)
+    if (x < 1)
+        fun_l11_n330(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n112(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n113(x)
+    if (x < 1)
+        fun_l11_n811(x)
+    else
+        fun_l11_n196(x)
+    end
+end
+
+def fun_l10_n114(x)
+    if (x < 1)
+        fun_l11_n868(x)
+    else
+        fun_l11_n812(x)
+    end
+end
+
+def fun_l10_n115(x)
+    if (x < 1)
+        fun_l11_n308(x)
+    else
+        fun_l11_n184(x)
+    end
+end
+
+def fun_l10_n116(x)
+    if (x < 1)
+        fun_l11_n64(x)
+    else
+        fun_l11_n906(x)
+    end
+end
+
+def fun_l10_n117(x)
+    if (x < 1)
+        fun_l11_n339(x)
+    else
+        fun_l11_n338(x)
+    end
+end
+
+def fun_l10_n118(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n915(x)
+    end
+end
+
+def fun_l10_n119(x)
+    if (x < 1)
+        fun_l11_n729(x)
+    else
+        fun_l11_n472(x)
+    end
+end
+
+def fun_l10_n120(x)
+    if (x < 1)
+        fun_l11_n646(x)
+    else
+        fun_l11_n83(x)
+    end
+end
+
+def fun_l10_n121(x)
+    if (x < 1)
+        fun_l11_n294(x)
+    else
+        fun_l11_n208(x)
+    end
+end
+
+def fun_l10_n122(x)
+    if (x < 1)
+        fun_l11_n309(x)
+    else
+        fun_l11_n52(x)
+    end
+end
+
+def fun_l10_n123(x)
+    if (x < 1)
+        fun_l11_n5(x)
+    else
+        fun_l11_n124(x)
+    end
+end
+
+def fun_l10_n124(x)
+    if (x < 1)
+        fun_l11_n288(x)
+    else
+        fun_l11_n731(x)
+    end
+end
+
+def fun_l10_n125(x)
+    if (x < 1)
+        fun_l11_n835(x)
+    else
+        fun_l11_n381(x)
+    end
+end
+
+def fun_l10_n126(x)
+    if (x < 1)
+        fun_l11_n269(x)
+    else
+        fun_l11_n104(x)
+    end
+end
+
+def fun_l10_n127(x)
+    if (x < 1)
+        fun_l11_n377(x)
+    else
+        fun_l11_n650(x)
+    end
+end
+
+def fun_l10_n128(x)
+    if (x < 1)
+        fun_l11_n749(x)
+    else
+        fun_l11_n223(x)
+    end
+end
+
+def fun_l10_n129(x)
+    if (x < 1)
+        fun_l11_n493(x)
+    else
+        fun_l11_n834(x)
+    end
+end
+
+def fun_l10_n130(x)
+    if (x < 1)
+        fun_l11_n826(x)
+    else
+        fun_l11_n857(x)
+    end
+end
+
+def fun_l10_n131(x)
+    if (x < 1)
+        fun_l11_n19(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n132(x)
+    if (x < 1)
+        fun_l11_n585(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n133(x)
+    if (x < 1)
+        fun_l11_n91(x)
+    else
+        fun_l11_n748(x)
+    end
+end
+
+def fun_l10_n134(x)
+    if (x < 1)
+        fun_l11_n218(x)
+    else
+        fun_l11_n343(x)
+    end
+end
+
+def fun_l10_n135(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n655(x)
+    end
+end
+
+def fun_l10_n136(x)
+    if (x < 1)
+        fun_l11_n43(x)
+    else
+        fun_l11_n964(x)
+    end
+end
+
+def fun_l10_n137(x)
+    if (x < 1)
+        fun_l11_n50(x)
+    else
+        fun_l11_n836(x)
+    end
+end
+
+def fun_l10_n138(x)
+    if (x < 1)
+        fun_l11_n915(x)
+    else
+        fun_l11_n262(x)
+    end
+end
+
+def fun_l10_n139(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n321(x)
+    end
+end
+
+def fun_l10_n140(x)
+    if (x < 1)
+        fun_l11_n473(x)
+    else
+        fun_l11_n771(x)
+    end
+end
+
+def fun_l10_n141(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n142(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n178(x)
+    end
+end
+
+def fun_l10_n143(x)
+    if (x < 1)
+        fun_l11_n223(x)
+    else
+        fun_l11_n509(x)
+    end
+end
+
+def fun_l10_n144(x)
+    if (x < 1)
+        fun_l11_n62(x)
+    else
+        fun_l11_n455(x)
+    end
+end
+
+def fun_l10_n145(x)
+    if (x < 1)
+        fun_l11_n155(x)
+    else
+        fun_l11_n486(x)
+    end
+end
+
+def fun_l10_n146(x)
+    if (x < 1)
+        fun_l11_n414(x)
+    else
+        fun_l11_n384(x)
+    end
+end
+
+def fun_l10_n147(x)
+    if (x < 1)
+        fun_l11_n840(x)
+    else
+        fun_l11_n287(x)
+    end
+end
+
+def fun_l10_n148(x)
+    if (x < 1)
+        fun_l11_n605(x)
+    else
+        fun_l11_n283(x)
+    end
+end
+
+def fun_l10_n149(x)
+    if (x < 1)
+        fun_l11_n101(x)
+    else
+        fun_l11_n710(x)
+    end
+end
+
+def fun_l10_n150(x)
+    if (x < 1)
+        fun_l11_n51(x)
+    else
+        fun_l11_n304(x)
+    end
+end
+
+def fun_l10_n151(x)
+    if (x < 1)
+        fun_l11_n501(x)
+    else
+        fun_l11_n789(x)
+    end
+end
+
+def fun_l10_n152(x)
+    if (x < 1)
+        fun_l11_n265(x)
+    else
+        fun_l11_n304(x)
+    end
+end
+
+def fun_l10_n153(x)
+    if (x < 1)
+        fun_l11_n500(x)
+    else
+        fun_l11_n32(x)
+    end
+end
+
+def fun_l10_n154(x)
+    if (x < 1)
+        fun_l11_n464(x)
+    else
+        fun_l11_n212(x)
+    end
+end
+
+def fun_l10_n155(x)
+    if (x < 1)
+        fun_l11_n729(x)
+    else
+        fun_l11_n805(x)
+    end
+end
+
+def fun_l10_n156(x)
+    if (x < 1)
+        fun_l11_n225(x)
+    else
+        fun_l11_n241(x)
+    end
+end
+
+def fun_l10_n157(x)
+    if (x < 1)
+        fun_l11_n600(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n158(x)
+    if (x < 1)
+        fun_l11_n684(x)
+    else
+        fun_l11_n898(x)
+    end
+end
+
+def fun_l10_n159(x)
+    if (x < 1)
+        fun_l11_n354(x)
+    else
+        fun_l11_n909(x)
+    end
+end
+
+def fun_l10_n160(x)
+    if (x < 1)
+        fun_l11_n879(x)
+    else
+        fun_l11_n917(x)
+    end
+end
+
+def fun_l10_n161(x)
+    if (x < 1)
+        fun_l11_n547(x)
+    else
+        fun_l11_n333(x)
+    end
+end
+
+def fun_l10_n162(x)
+    if (x < 1)
+        fun_l11_n769(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n163(x)
+    if (x < 1)
+        fun_l11_n292(x)
+    else
+        fun_l11_n526(x)
+    end
+end
+
+def fun_l10_n164(x)
+    if (x < 1)
+        fun_l11_n355(x)
+    else
+        fun_l11_n783(x)
+    end
+end
+
+def fun_l10_n165(x)
+    if (x < 1)
+        fun_l11_n413(x)
+    else
+        fun_l11_n570(x)
+    end
+end
+
+def fun_l10_n166(x)
+    if (x < 1)
+        fun_l11_n535(x)
+    else
+        fun_l11_n953(x)
+    end
+end
+
+def fun_l10_n167(x)
+    if (x < 1)
+        fun_l11_n661(x)
+    else
+        fun_l11_n178(x)
+    end
+end
+
+def fun_l10_n168(x)
+    if (x < 1)
+        fun_l11_n749(x)
+    else
+        fun_l11_n853(x)
+    end
+end
+
+def fun_l10_n169(x)
+    if (x < 1)
+        fun_l11_n208(x)
+    else
+        fun_l11_n378(x)
+    end
+end
+
+def fun_l10_n170(x)
+    if (x < 1)
+        fun_l11_n385(x)
+    else
+        fun_l11_n811(x)
+    end
+end
+
+def fun_l10_n171(x)
+    if (x < 1)
+        fun_l11_n960(x)
+    else
+        fun_l11_n631(x)
+    end
+end
+
+def fun_l10_n172(x)
+    if (x < 1)
+        fun_l11_n104(x)
+    else
+        fun_l11_n667(x)
+    end
+end
+
+def fun_l10_n173(x)
+    if (x < 1)
+        fun_l11_n532(x)
+    else
+        fun_l11_n169(x)
+    end
+end
+
+def fun_l10_n174(x)
+    if (x < 1)
+        fun_l11_n794(x)
+    else
+        fun_l11_n761(x)
+    end
+end
+
+def fun_l10_n175(x)
+    if (x < 1)
+        fun_l11_n306(x)
+    else
+        fun_l11_n369(x)
+    end
+end
+
+def fun_l10_n176(x)
+    if (x < 1)
+        fun_l11_n693(x)
+    else
+        fun_l11_n254(x)
+    end
+end
+
+def fun_l10_n177(x)
+    if (x < 1)
+        fun_l11_n927(x)
+    else
+        fun_l11_n194(x)
+    end
+end
+
+def fun_l10_n178(x)
+    if (x < 1)
+        fun_l11_n197(x)
+    else
+        fun_l11_n136(x)
+    end
+end
+
+def fun_l10_n179(x)
+    if (x < 1)
+        fun_l11_n482(x)
+    else
+        fun_l11_n182(x)
+    end
+end
+
+def fun_l10_n180(x)
+    if (x < 1)
+        fun_l11_n20(x)
+    else
+        fun_l11_n978(x)
+    end
+end
+
+def fun_l10_n181(x)
+    if (x < 1)
+        fun_l11_n101(x)
+    else
+        fun_l11_n92(x)
+    end
+end
+
+def fun_l10_n182(x)
+    if (x < 1)
+        fun_l11_n179(x)
+    else
+        fun_l11_n634(x)
+    end
+end
+
+def fun_l10_n183(x)
+    if (x < 1)
+        fun_l11_n221(x)
+    else
+        fun_l11_n275(x)
+    end
+end
+
+def fun_l10_n184(x)
+    if (x < 1)
+        fun_l11_n826(x)
+    else
+        fun_l11_n630(x)
+    end
+end
+
+def fun_l10_n185(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n186(x)
+    if (x < 1)
+        fun_l11_n491(x)
+    else
+        fun_l11_n182(x)
+    end
+end
+
+def fun_l10_n187(x)
+    if (x < 1)
+        fun_l11_n404(x)
+    else
+        fun_l11_n812(x)
+    end
+end
+
+def fun_l10_n188(x)
+    if (x < 1)
+        fun_l11_n41(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n189(x)
+    if (x < 1)
+        fun_l11_n620(x)
+    else
+        fun_l11_n659(x)
+    end
+end
+
+def fun_l10_n190(x)
+    if (x < 1)
+        fun_l11_n717(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n191(x)
+    if (x < 1)
+        fun_l11_n328(x)
+    else
+        fun_l11_n223(x)
+    end
+end
+
+def fun_l10_n192(x)
+    if (x < 1)
+        fun_l11_n280(x)
+    else
+        fun_l11_n360(x)
+    end
+end
+
+def fun_l10_n193(x)
+    if (x < 1)
+        fun_l11_n798(x)
+    else
+        fun_l11_n303(x)
+    end
+end
+
+def fun_l10_n194(x)
+    if (x < 1)
+        fun_l11_n617(x)
+    else
+        fun_l11_n207(x)
+    end
+end
+
+def fun_l10_n195(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n398(x)
+    end
+end
+
+def fun_l10_n196(x)
+    if (x < 1)
+        fun_l11_n998(x)
+    else
+        fun_l11_n31(x)
+    end
+end
+
+def fun_l10_n197(x)
+    if (x < 1)
+        fun_l11_n740(x)
+    else
+        fun_l11_n220(x)
+    end
+end
+
+def fun_l10_n198(x)
+    if (x < 1)
+        fun_l11_n847(x)
+    else
+        fun_l11_n915(x)
+    end
+end
+
+def fun_l10_n199(x)
+    if (x < 1)
+        fun_l11_n946(x)
+    else
+        fun_l11_n300(x)
+    end
+end
+
+def fun_l10_n200(x)
+    if (x < 1)
+        fun_l11_n494(x)
+    else
+        fun_l11_n316(x)
+    end
+end
+
+def fun_l10_n201(x)
+    if (x < 1)
+        fun_l11_n871(x)
+    else
+        fun_l11_n310(x)
+    end
+end
+
+def fun_l10_n202(x)
+    if (x < 1)
+        fun_l11_n660(x)
+    else
+        fun_l11_n538(x)
+    end
+end
+
+def fun_l10_n203(x)
+    if (x < 1)
+        fun_l11_n478(x)
+    else
+        fun_l11_n618(x)
+    end
+end
+
+def fun_l10_n204(x)
+    if (x < 1)
+        fun_l11_n134(x)
+    else
+        fun_l11_n224(x)
+    end
+end
+
+def fun_l10_n205(x)
+    if (x < 1)
+        fun_l11_n128(x)
+    else
+        fun_l11_n279(x)
+    end
+end
+
+def fun_l10_n206(x)
+    if (x < 1)
+        fun_l11_n718(x)
+    else
+        fun_l11_n514(x)
+    end
+end
+
+def fun_l10_n207(x)
+    if (x < 1)
+        fun_l11_n466(x)
+    else
+        fun_l11_n979(x)
+    end
+end
+
+def fun_l10_n208(x)
+    if (x < 1)
+        fun_l11_n990(x)
+    else
+        fun_l11_n881(x)
+    end
+end
+
+def fun_l10_n209(x)
+    if (x < 1)
+        fun_l11_n860(x)
+    else
+        fun_l11_n995(x)
+    end
+end
+
+def fun_l10_n210(x)
+    if (x < 1)
+        fun_l11_n269(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n211(x)
+    if (x < 1)
+        fun_l11_n155(x)
+    else
+        fun_l11_n97(x)
+    end
+end
+
+def fun_l10_n212(x)
+    if (x < 1)
+        fun_l11_n377(x)
+    else
+        fun_l11_n749(x)
+    end
+end
+
+def fun_l10_n213(x)
+    if (x < 1)
+        fun_l11_n647(x)
+    else
+        fun_l11_n276(x)
+    end
+end
+
+def fun_l10_n214(x)
+    if (x < 1)
+        fun_l11_n290(x)
+    else
+        fun_l11_n325(x)
+    end
+end
+
+def fun_l10_n215(x)
+    if (x < 1)
+        fun_l11_n445(x)
+    else
+        fun_l11_n538(x)
+    end
+end
+
+def fun_l10_n216(x)
+    if (x < 1)
+        fun_l11_n433(x)
+    else
+        fun_l11_n937(x)
+    end
+end
+
+def fun_l10_n217(x)
+    if (x < 1)
+        fun_l11_n288(x)
+    else
+        fun_l11_n897(x)
+    end
+end
+
+def fun_l10_n218(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n545(x)
+    end
+end
+
+def fun_l10_n219(x)
+    if (x < 1)
+        fun_l11_n678(x)
+    else
+        fun_l11_n433(x)
+    end
+end
+
+def fun_l10_n220(x)
+    if (x < 1)
+        fun_l11_n203(x)
+    else
+        fun_l11_n163(x)
+    end
+end
+
+def fun_l10_n221(x)
+    if (x < 1)
+        fun_l11_n134(x)
+    else
+        fun_l11_n545(x)
+    end
+end
+
+def fun_l10_n222(x)
+    if (x < 1)
+        fun_l11_n556(x)
+    else
+        fun_l11_n537(x)
+    end
+end
+
+def fun_l10_n223(x)
+    if (x < 1)
+        fun_l11_n743(x)
+    else
+        fun_l11_n88(x)
+    end
+end
+
+def fun_l10_n224(x)
+    if (x < 1)
+        fun_l11_n678(x)
+    else
+        fun_l11_n643(x)
+    end
+end
+
+def fun_l10_n225(x)
+    if (x < 1)
+        fun_l11_n13(x)
+    else
+        fun_l11_n219(x)
+    end
+end
+
+def fun_l10_n226(x)
+    if (x < 1)
+        fun_l11_n454(x)
+    else
+        fun_l11_n691(x)
+    end
+end
+
+def fun_l10_n227(x)
+    if (x < 1)
+        fun_l11_n117(x)
+    else
+        fun_l11_n433(x)
+    end
+end
+
+def fun_l10_n228(x)
+    if (x < 1)
+        fun_l11_n559(x)
+    else
+        fun_l11_n884(x)
+    end
+end
+
+def fun_l10_n229(x)
+    if (x < 1)
+        fun_l11_n58(x)
+    else
+        fun_l11_n620(x)
+    end
+end
+
+def fun_l10_n230(x)
+    if (x < 1)
+        fun_l11_n688(x)
+    else
+        fun_l11_n76(x)
+    end
+end
+
+def fun_l10_n231(x)
+    if (x < 1)
+        fun_l11_n726(x)
+    else
+        fun_l11_n644(x)
+    end
+end
+
+def fun_l10_n232(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n0(x)
+    end
+end
+
+def fun_l10_n233(x)
+    if (x < 1)
+        fun_l11_n761(x)
+    else
+        fun_l11_n487(x)
+    end
+end
+
+def fun_l10_n234(x)
+    if (x < 1)
+        fun_l11_n657(x)
+    else
+        fun_l11_n107(x)
+    end
+end
+
+def fun_l10_n235(x)
+    if (x < 1)
+        fun_l11_n897(x)
+    else
+        fun_l11_n881(x)
+    end
+end
+
+def fun_l10_n236(x)
+    if (x < 1)
+        fun_l11_n851(x)
+    else
+        fun_l11_n593(x)
+    end
+end
+
+def fun_l10_n237(x)
+    if (x < 1)
+        fun_l11_n319(x)
+    else
+        fun_l11_n983(x)
+    end
+end
+
+def fun_l10_n238(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n870(x)
+    end
+end
+
+def fun_l10_n239(x)
+    if (x < 1)
+        fun_l11_n195(x)
+    else
+        fun_l11_n378(x)
+    end
+end
+
+def fun_l10_n240(x)
+    if (x < 1)
+        fun_l11_n398(x)
+    else
+        fun_l11_n284(x)
+    end
+end
+
+def fun_l10_n241(x)
+    if (x < 1)
+        fun_l11_n118(x)
+    else
+        fun_l11_n417(x)
+    end
+end
+
+def fun_l10_n242(x)
+    if (x < 1)
+        fun_l11_n220(x)
+    else
+        fun_l11_n445(x)
+    end
+end
+
+def fun_l10_n243(x)
+    if (x < 1)
+        fun_l11_n783(x)
+    else
+        fun_l11_n989(x)
+    end
+end
+
+def fun_l10_n244(x)
+    if (x < 1)
+        fun_l11_n229(x)
+    else
+        fun_l11_n439(x)
+    end
+end
+
+def fun_l10_n245(x)
+    if (x < 1)
+        fun_l11_n78(x)
+    else
+        fun_l11_n272(x)
+    end
+end
+
+def fun_l10_n246(x)
+    if (x < 1)
+        fun_l11_n481(x)
+    else
+        fun_l11_n499(x)
+    end
+end
+
+def fun_l10_n247(x)
+    if (x < 1)
+        fun_l11_n213(x)
+    else
+        fun_l11_n471(x)
+    end
+end
+
+def fun_l10_n248(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n919(x)
+    end
+end
+
+def fun_l10_n249(x)
+    if (x < 1)
+        fun_l11_n13(x)
+    else
+        fun_l11_n526(x)
+    end
+end
+
+def fun_l10_n250(x)
+    if (x < 1)
+        fun_l11_n997(x)
+    else
+        fun_l11_n112(x)
+    end
+end
+
+def fun_l10_n251(x)
+    if (x < 1)
+        fun_l11_n662(x)
+    else
+        fun_l11_n950(x)
+    end
+end
+
+def fun_l10_n252(x)
+    if (x < 1)
+        fun_l11_n272(x)
+    else
+        fun_l11_n345(x)
+    end
+end
+
+def fun_l10_n253(x)
+    if (x < 1)
+        fun_l11_n28(x)
+    else
+        fun_l11_n24(x)
+    end
+end
+
+def fun_l10_n254(x)
+    if (x < 1)
+        fun_l11_n326(x)
+    else
+        fun_l11_n907(x)
+    end
+end
+
+def fun_l10_n255(x)
+    if (x < 1)
+        fun_l11_n612(x)
+    else
+        fun_l11_n790(x)
+    end
+end
+
+def fun_l10_n256(x)
+    if (x < 1)
+        fun_l11_n50(x)
+    else
+        fun_l11_n16(x)
+    end
+end
+
+def fun_l10_n257(x)
+    if (x < 1)
+        fun_l11_n350(x)
+    else
+        fun_l11_n151(x)
+    end
+end
+
+def fun_l10_n258(x)
+    if (x < 1)
+        fun_l11_n290(x)
+    else
+        fun_l11_n113(x)
+    end
+end
+
+def fun_l10_n259(x)
+    if (x < 1)
+        fun_l11_n751(x)
+    else
+        fun_l11_n16(x)
+    end
+end
+
+def fun_l10_n260(x)
+    if (x < 1)
+        fun_l11_n337(x)
+    else
+        fun_l11_n516(x)
+    end
+end
+
+def fun_l10_n261(x)
+    if (x < 1)
+        fun_l11_n530(x)
+    else
+        fun_l11_n19(x)
+    end
+end
+
+def fun_l10_n262(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n529(x)
+    end
+end
+
+def fun_l10_n263(x)
+    if (x < 1)
+        fun_l11_n769(x)
+    else
+        fun_l11_n723(x)
+    end
+end
+
+def fun_l10_n264(x)
+    if (x < 1)
+        fun_l11_n673(x)
+    else
+        fun_l11_n771(x)
+    end
+end
+
+def fun_l10_n265(x)
+    if (x < 1)
+        fun_l11_n28(x)
+    else
+        fun_l11_n427(x)
+    end
+end
+
+def fun_l10_n266(x)
+    if (x < 1)
+        fun_l11_n92(x)
+    else
+        fun_l11_n590(x)
+    end
+end
+
+def fun_l10_n267(x)
+    if (x < 1)
+        fun_l11_n762(x)
+    else
+        fun_l11_n352(x)
+    end
+end
+
+def fun_l10_n268(x)
+    if (x < 1)
+        fun_l11_n988(x)
+    else
+        fun_l11_n126(x)
+    end
+end
+
+def fun_l10_n269(x)
+    if (x < 1)
+        fun_l11_n92(x)
+    else
+        fun_l11_n455(x)
+    end
+end
+
+def fun_l10_n270(x)
+    if (x < 1)
+        fun_l11_n233(x)
+    else
+        fun_l11_n404(x)
+    end
+end
+
+def fun_l10_n271(x)
+    if (x < 1)
+        fun_l11_n122(x)
+    else
+        fun_l11_n245(x)
+    end
+end
+
+def fun_l10_n272(x)
+    if (x < 1)
+        fun_l11_n277(x)
+    else
+        fun_l11_n969(x)
+    end
+end
+
+def fun_l10_n273(x)
+    if (x < 1)
+        fun_l11_n848(x)
+    else
+        fun_l11_n56(x)
+    end
+end
+
+def fun_l10_n274(x)
+    if (x < 1)
+        fun_l11_n640(x)
+    else
+        fun_l11_n632(x)
+    end
+end
+
+def fun_l10_n275(x)
+    if (x < 1)
+        fun_l11_n38(x)
+    else
+        fun_l11_n816(x)
+    end
+end
+
+def fun_l10_n276(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n126(x)
+    end
+end
+
+def fun_l10_n277(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n128(x)
+    end
+end
+
+def fun_l10_n278(x)
+    if (x < 1)
+        fun_l11_n175(x)
+    else
+        fun_l11_n954(x)
+    end
+end
+
+def fun_l10_n279(x)
+    if (x < 1)
+        fun_l11_n379(x)
+    else
+        fun_l11_n58(x)
+    end
+end
+
+def fun_l10_n280(x)
+    if (x < 1)
+        fun_l11_n926(x)
+    else
+        fun_l11_n287(x)
+    end
+end
+
+def fun_l10_n281(x)
+    if (x < 1)
+        fun_l11_n981(x)
+    else
+        fun_l11_n921(x)
+    end
+end
+
+def fun_l10_n282(x)
+    if (x < 1)
+        fun_l11_n222(x)
+    else
+        fun_l11_n954(x)
+    end
+end
+
+def fun_l10_n283(x)
+    if (x < 1)
+        fun_l11_n295(x)
+    else
+        fun_l11_n575(x)
+    end
+end
+
+def fun_l10_n284(x)
+    if (x < 1)
+        fun_l11_n554(x)
+    else
+        fun_l11_n559(x)
+    end
+end
+
+def fun_l10_n285(x)
+    if (x < 1)
+        fun_l11_n476(x)
+    else
+        fun_l11_n487(x)
+    end
+end
+
+def fun_l10_n286(x)
+    if (x < 1)
+        fun_l11_n102(x)
+    else
+        fun_l11_n928(x)
+    end
+end
+
+def fun_l10_n287(x)
+    if (x < 1)
+        fun_l11_n949(x)
+    else
+        fun_l11_n900(x)
+    end
+end
+
+def fun_l10_n288(x)
+    if (x < 1)
+        fun_l11_n717(x)
+    else
+        fun_l11_n762(x)
+    end
+end
+
+def fun_l10_n289(x)
+    if (x < 1)
+        fun_l11_n304(x)
+    else
+        fun_l11_n572(x)
+    end
+end
+
+def fun_l10_n290(x)
+    if (x < 1)
+        fun_l11_n748(x)
+    else
+        fun_l11_n791(x)
+    end
+end
+
+def fun_l10_n291(x)
+    if (x < 1)
+        fun_l11_n557(x)
+    else
+        fun_l11_n79(x)
+    end
+end
+
+def fun_l10_n292(x)
+    if (x < 1)
+        fun_l11_n74(x)
+    else
+        fun_l11_n931(x)
+    end
+end
+
+def fun_l10_n293(x)
+    if (x < 1)
+        fun_l11_n31(x)
+    else
+        fun_l11_n791(x)
+    end
+end
+
+def fun_l10_n294(x)
+    if (x < 1)
+        fun_l11_n29(x)
+    else
+        fun_l11_n377(x)
+    end
+end
+
+def fun_l10_n295(x)
+    if (x < 1)
+        fun_l11_n509(x)
+    else
+        fun_l11_n900(x)
+    end
+end
+
+def fun_l10_n296(x)
+    if (x < 1)
+        fun_l11_n594(x)
+    else
+        fun_l11_n835(x)
+    end
+end
+
+def fun_l10_n297(x)
+    if (x < 1)
+        fun_l11_n943(x)
+    else
+        fun_l11_n621(x)
+    end
+end
+
+def fun_l10_n298(x)
+    if (x < 1)
+        fun_l11_n860(x)
+    else
+        fun_l11_n403(x)
+    end
+end
+
+def fun_l10_n299(x)
+    if (x < 1)
+        fun_l11_n676(x)
+    else
+        fun_l11_n478(x)
+    end
+end
+
+def fun_l10_n300(x)
+    if (x < 1)
+        fun_l11_n513(x)
+    else
+        fun_l11_n661(x)
+    end
+end
+
+def fun_l10_n301(x)
+    if (x < 1)
+        fun_l11_n513(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n302(x)
+    if (x < 1)
+        fun_l11_n763(x)
+    else
+        fun_l11_n823(x)
+    end
+end
+
+def fun_l10_n303(x)
+    if (x < 1)
+        fun_l11_n469(x)
+    else
+        fun_l11_n250(x)
+    end
+end
+
+def fun_l10_n304(x)
+    if (x < 1)
+        fun_l11_n637(x)
+    else
+        fun_l11_n478(x)
+    end
+end
+
+def fun_l10_n305(x)
+    if (x < 1)
+        fun_l11_n825(x)
+    else
+        fun_l11_n258(x)
+    end
+end
+
+def fun_l10_n306(x)
+    if (x < 1)
+        fun_l11_n264(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n307(x)
+    if (x < 1)
+        fun_l11_n426(x)
+    else
+        fun_l11_n490(x)
+    end
+end
+
+def fun_l10_n308(x)
+    if (x < 1)
+        fun_l11_n157(x)
+    else
+        fun_l11_n407(x)
+    end
+end
+
+def fun_l10_n309(x)
+    if (x < 1)
+        fun_l11_n68(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n310(x)
+    if (x < 1)
+        fun_l11_n844(x)
+    else
+        fun_l11_n955(x)
+    end
+end
+
+def fun_l10_n311(x)
+    if (x < 1)
+        fun_l11_n316(x)
+    else
+        fun_l11_n27(x)
+    end
+end
+
+def fun_l10_n312(x)
+    if (x < 1)
+        fun_l11_n771(x)
+    else
+        fun_l11_n604(x)
+    end
+end
+
+def fun_l10_n313(x)
+    if (x < 1)
+        fun_l11_n436(x)
+    else
+        fun_l11_n714(x)
+    end
+end
+
+def fun_l10_n314(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n889(x)
+    end
+end
+
+def fun_l10_n315(x)
+    if (x < 1)
+        fun_l11_n621(x)
+    else
+        fun_l11_n694(x)
+    end
+end
+
+def fun_l10_n316(x)
+    if (x < 1)
+        fun_l11_n403(x)
+    else
+        fun_l11_n625(x)
+    end
+end
+
+def fun_l10_n317(x)
+    if (x < 1)
+        fun_l11_n532(x)
+    else
+        fun_l11_n920(x)
+    end
+end
+
+def fun_l10_n318(x)
+    if (x < 1)
+        fun_l11_n895(x)
+    else
+        fun_l11_n781(x)
+    end
+end
+
+def fun_l10_n319(x)
+    if (x < 1)
+        fun_l11_n109(x)
+    else
+        fun_l11_n254(x)
+    end
+end
+
+def fun_l10_n320(x)
+    if (x < 1)
+        fun_l11_n842(x)
+    else
+        fun_l11_n879(x)
+    end
+end
+
+def fun_l10_n321(x)
+    if (x < 1)
+        fun_l11_n655(x)
+    else
+        fun_l11_n518(x)
+    end
+end
+
+def fun_l10_n322(x)
+    if (x < 1)
+        fun_l11_n727(x)
+    else
+        fun_l11_n14(x)
+    end
+end
+
+def fun_l10_n323(x)
+    if (x < 1)
+        fun_l11_n808(x)
+    else
+        fun_l11_n128(x)
+    end
+end
+
+def fun_l10_n324(x)
+    if (x < 1)
+        fun_l11_n412(x)
+    else
+        fun_l11_n940(x)
+    end
+end
+
+def fun_l10_n325(x)
+    if (x < 1)
+        fun_l11_n944(x)
+    else
+        fun_l11_n915(x)
+    end
+end
+
+def fun_l10_n326(x)
+    if (x < 1)
+        fun_l11_n120(x)
+    else
+        fun_l11_n572(x)
+    end
+end
+
+def fun_l10_n327(x)
+    if (x < 1)
+        fun_l11_n444(x)
+    else
+        fun_l11_n793(x)
+    end
+end
+
+def fun_l10_n328(x)
+    if (x < 1)
+        fun_l11_n892(x)
+    else
+        fun_l11_n475(x)
+    end
+end
+
+def fun_l10_n329(x)
+    if (x < 1)
+        fun_l11_n919(x)
+    else
+        fun_l11_n183(x)
+    end
+end
+
+def fun_l10_n330(x)
+    if (x < 1)
+        fun_l11_n80(x)
+    else
+        fun_l11_n357(x)
+    end
+end
+
+def fun_l10_n331(x)
+    if (x < 1)
+        fun_l11_n340(x)
+    else
+        fun_l11_n349(x)
+    end
+end
+
+def fun_l10_n332(x)
+    if (x < 1)
+        fun_l11_n579(x)
+    else
+        fun_l11_n845(x)
+    end
+end
+
+def fun_l10_n333(x)
+    if (x < 1)
+        fun_l11_n169(x)
+    else
+        fun_l11_n583(x)
+    end
+end
+
+def fun_l10_n334(x)
+    if (x < 1)
+        fun_l11_n544(x)
+    else
+        fun_l11_n462(x)
+    end
+end
+
+def fun_l10_n335(x)
+    if (x < 1)
+        fun_l11_n51(x)
+    else
+        fun_l11_n635(x)
+    end
+end
+
+def fun_l10_n336(x)
+    if (x < 1)
+        fun_l11_n965(x)
+    else
+        fun_l11_n538(x)
+    end
+end
+
+def fun_l10_n337(x)
+    if (x < 1)
+        fun_l11_n930(x)
+    else
+        fun_l11_n169(x)
+    end
+end
+
+def fun_l10_n338(x)
+    if (x < 1)
+        fun_l11_n732(x)
+    else
+        fun_l11_n574(x)
+    end
+end
+
+def fun_l10_n339(x)
+    if (x < 1)
+        fun_l11_n51(x)
+    else
+        fun_l11_n141(x)
+    end
+end
+
+def fun_l10_n340(x)
+    if (x < 1)
+        fun_l11_n149(x)
+    else
+        fun_l11_n346(x)
+    end
+end
+
+def fun_l10_n341(x)
+    if (x < 1)
+        fun_l11_n163(x)
+    else
+        fun_l11_n224(x)
+    end
+end
+
+def fun_l10_n342(x)
+    if (x < 1)
+        fun_l11_n175(x)
+    else
+        fun_l11_n40(x)
+    end
+end
+
+def fun_l10_n343(x)
+    if (x < 1)
+        fun_l11_n156(x)
+    else
+        fun_l11_n639(x)
+    end
+end
+
+def fun_l10_n344(x)
+    if (x < 1)
+        fun_l11_n934(x)
+    else
+        fun_l11_n85(x)
+    end
+end
+
+def fun_l10_n345(x)
+    if (x < 1)
+        fun_l11_n182(x)
+    else
+        fun_l11_n190(x)
+    end
+end
+
+def fun_l10_n346(x)
+    if (x < 1)
+        fun_l11_n879(x)
+    else
+        fun_l11_n702(x)
+    end
+end
+
+def fun_l10_n347(x)
+    if (x < 1)
+        fun_l11_n540(x)
+    else
+        fun_l11_n689(x)
+    end
+end
+
+def fun_l10_n348(x)
+    if (x < 1)
+        fun_l11_n945(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n349(x)
+    if (x < 1)
+        fun_l11_n683(x)
+    else
+        fun_l11_n688(x)
+    end
+end
+
+def fun_l10_n350(x)
+    if (x < 1)
+        fun_l11_n750(x)
+    else
+        fun_l11_n577(x)
+    end
+end
+
+def fun_l10_n351(x)
+    if (x < 1)
+        fun_l11_n74(x)
+    else
+        fun_l11_n672(x)
+    end
+end
+
+def fun_l10_n352(x)
+    if (x < 1)
+        fun_l11_n252(x)
+    else
+        fun_l11_n766(x)
+    end
+end
+
+def fun_l10_n353(x)
+    if (x < 1)
+        fun_l11_n702(x)
+    else
+        fun_l11_n516(x)
+    end
+end
+
+def fun_l10_n354(x)
+    if (x < 1)
+        fun_l11_n19(x)
+    else
+        fun_l11_n290(x)
+    end
+end
+
+def fun_l10_n355(x)
+    if (x < 1)
+        fun_l11_n70(x)
+    else
+        fun_l11_n553(x)
+    end
+end
+
+def fun_l10_n356(x)
+    if (x < 1)
+        fun_l11_n654(x)
+    else
+        fun_l11_n108(x)
+    end
+end
+
+def fun_l10_n357(x)
+    if (x < 1)
+        fun_l11_n820(x)
+    else
+        fun_l11_n320(x)
+    end
+end
+
+def fun_l10_n358(x)
+    if (x < 1)
+        fun_l11_n417(x)
+    else
+        fun_l11_n290(x)
+    end
+end
+
+def fun_l10_n359(x)
+    if (x < 1)
+        fun_l11_n832(x)
+    else
+        fun_l11_n647(x)
+    end
+end
+
+def fun_l10_n360(x)
+    if (x < 1)
+        fun_l11_n625(x)
+    else
+        fun_l11_n723(x)
+    end
+end
+
+def fun_l10_n361(x)
+    if (x < 1)
+        fun_l11_n257(x)
+    else
+        fun_l11_n991(x)
+    end
+end
+
+def fun_l10_n362(x)
+    if (x < 1)
+        fun_l11_n101(x)
+    else
+        fun_l11_n247(x)
+    end
+end
+
+def fun_l10_n363(x)
+    if (x < 1)
+        fun_l11_n484(x)
+    else
+        fun_l11_n953(x)
+    end
+end
+
+def fun_l10_n364(x)
+    if (x < 1)
+        fun_l11_n281(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n365(x)
+    if (x < 1)
+        fun_l11_n425(x)
+    else
+        fun_l11_n772(x)
+    end
+end
+
+def fun_l10_n366(x)
+    if (x < 1)
+        fun_l11_n724(x)
+    else
+        fun_l11_n725(x)
+    end
+end
+
+def fun_l10_n367(x)
+    if (x < 1)
+        fun_l11_n943(x)
+    else
+        fun_l11_n360(x)
+    end
+end
+
+def fun_l10_n368(x)
+    if (x < 1)
+        fun_l11_n874(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n369(x)
+    if (x < 1)
+        fun_l11_n419(x)
+    else
+        fun_l11_n672(x)
+    end
+end
+
+def fun_l10_n370(x)
+    if (x < 1)
+        fun_l11_n655(x)
+    else
+        fun_l11_n468(x)
+    end
+end
+
+def fun_l10_n371(x)
+    if (x < 1)
+        fun_l11_n577(x)
+    else
+        fun_l11_n402(x)
+    end
+end
+
+def fun_l10_n372(x)
+    if (x < 1)
+        fun_l11_n531(x)
+    else
+        fun_l11_n319(x)
+    end
+end
+
+def fun_l10_n373(x)
+    if (x < 1)
+        fun_l11_n972(x)
+    else
+        fun_l11_n901(x)
+    end
+end
+
+def fun_l10_n374(x)
+    if (x < 1)
+        fun_l11_n59(x)
+    else
+        fun_l11_n12(x)
+    end
+end
+
+def fun_l10_n375(x)
+    if (x < 1)
+        fun_l11_n409(x)
+    else
+        fun_l11_n214(x)
+    end
+end
+
+def fun_l10_n376(x)
+    if (x < 1)
+        fun_l11_n52(x)
+    else
+        fun_l11_n395(x)
+    end
+end
+
+def fun_l10_n377(x)
+    if (x < 1)
+        fun_l11_n594(x)
+    else
+        fun_l11_n434(x)
+    end
+end
+
+def fun_l10_n378(x)
+    if (x < 1)
+        fun_l11_n795(x)
+    else
+        fun_l11_n820(x)
+    end
+end
+
+def fun_l10_n379(x)
+    if (x < 1)
+        fun_l11_n962(x)
+    else
+        fun_l11_n111(x)
+    end
+end
+
+def fun_l10_n380(x)
+    if (x < 1)
+        fun_l11_n762(x)
+    else
+        fun_l11_n678(x)
+    end
+end
+
+def fun_l10_n381(x)
+    if (x < 1)
+        fun_l11_n324(x)
+    else
+        fun_l11_n478(x)
+    end
+end
+
+def fun_l10_n382(x)
+    if (x < 1)
+        fun_l11_n360(x)
+    else
+        fun_l11_n35(x)
+    end
+end
+
+def fun_l10_n383(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n898(x)
+    end
+end
+
+def fun_l10_n384(x)
+    if (x < 1)
+        fun_l11_n584(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n385(x)
+    if (x < 1)
+        fun_l11_n514(x)
+    else
+        fun_l11_n649(x)
+    end
+end
+
+def fun_l10_n386(x)
+    if (x < 1)
+        fun_l11_n426(x)
+    else
+        fun_l11_n391(x)
+    end
+end
+
+def fun_l10_n387(x)
+    if (x < 1)
+        fun_l11_n713(x)
+    else
+        fun_l11_n734(x)
+    end
+end
+
+def fun_l10_n388(x)
+    if (x < 1)
+        fun_l11_n236(x)
+    else
+        fun_l11_n469(x)
+    end
+end
+
+def fun_l10_n389(x)
+    if (x < 1)
+        fun_l11_n267(x)
+    else
+        fun_l11_n965(x)
+    end
+end
+
+def fun_l10_n390(x)
+    if (x < 1)
+        fun_l11_n943(x)
+    else
+        fun_l11_n181(x)
+    end
+end
+
+def fun_l10_n391(x)
+    if (x < 1)
+        fun_l11_n869(x)
+    else
+        fun_l11_n348(x)
+    end
+end
+
+def fun_l10_n392(x)
+    if (x < 1)
+        fun_l11_n144(x)
+    else
+        fun_l11_n801(x)
+    end
+end
+
+def fun_l10_n393(x)
+    if (x < 1)
+        fun_l11_n907(x)
+    else
+        fun_l11_n609(x)
+    end
+end
+
+def fun_l10_n394(x)
+    if (x < 1)
+        fun_l11_n801(x)
+    else
+        fun_l11_n691(x)
+    end
+end
+
+def fun_l10_n395(x)
+    if (x < 1)
+        fun_l11_n629(x)
+    else
+        fun_l11_n924(x)
+    end
+end
+
+def fun_l10_n396(x)
+    if (x < 1)
+        fun_l11_n191(x)
+    else
+        fun_l11_n248(x)
+    end
+end
+
+def fun_l10_n397(x)
+    if (x < 1)
+        fun_l11_n339(x)
+    else
+        fun_l11_n805(x)
+    end
+end
+
+def fun_l10_n398(x)
+    if (x < 1)
+        fun_l11_n798(x)
+    else
+        fun_l11_n154(x)
+    end
+end
+
+def fun_l10_n399(x)
+    if (x < 1)
+        fun_l11_n847(x)
+    else
+        fun_l11_n14(x)
+    end
+end
+
+def fun_l10_n400(x)
+    if (x < 1)
+        fun_l11_n296(x)
+    else
+        fun_l11_n144(x)
+    end
+end
+
+def fun_l10_n401(x)
+    if (x < 1)
+        fun_l11_n853(x)
+    else
+        fun_l11_n156(x)
+    end
+end
+
+def fun_l10_n402(x)
+    if (x < 1)
+        fun_l11_n54(x)
+    else
+        fun_l11_n944(x)
+    end
+end
+
+def fun_l10_n403(x)
+    if (x < 1)
+        fun_l11_n617(x)
+    else
+        fun_l11_n324(x)
+    end
+end
+
+def fun_l10_n404(x)
+    if (x < 1)
+        fun_l11_n962(x)
+    else
+        fun_l11_n139(x)
+    end
+end
+
+def fun_l10_n405(x)
+    if (x < 1)
+        fun_l11_n466(x)
+    else
+        fun_l11_n388(x)
+    end
+end
+
+def fun_l10_n406(x)
+    if (x < 1)
+        fun_l11_n914(x)
+    else
+        fun_l11_n847(x)
+    end
+end
+
+def fun_l10_n407(x)
+    if (x < 1)
+        fun_l11_n741(x)
+    else
+        fun_l11_n757(x)
+    end
+end
+
+def fun_l10_n408(x)
+    if (x < 1)
+        fun_l11_n36(x)
+    else
+        fun_l11_n312(x)
+    end
+end
+
+def fun_l10_n409(x)
+    if (x < 1)
+        fun_l11_n203(x)
+    else
+        fun_l11_n523(x)
+    end
+end
+
+def fun_l10_n410(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n291(x)
+    end
+end
+
+def fun_l10_n411(x)
+    if (x < 1)
+        fun_l11_n13(x)
+    else
+        fun_l11_n107(x)
+    end
+end
+
+def fun_l10_n412(x)
+    if (x < 1)
+        fun_l11_n960(x)
+    else
+        fun_l11_n565(x)
+    end
+end
+
+def fun_l10_n413(x)
+    if (x < 1)
+        fun_l11_n549(x)
+    else
+        fun_l11_n885(x)
+    end
+end
+
+def fun_l10_n414(x)
+    if (x < 1)
+        fun_l11_n559(x)
+    else
+        fun_l11_n612(x)
+    end
+end
+
+def fun_l10_n415(x)
+    if (x < 1)
+        fun_l11_n18(x)
+    else
+        fun_l11_n167(x)
+    end
+end
+
+def fun_l10_n416(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n206(x)
+    end
+end
+
+def fun_l10_n417(x)
+    if (x < 1)
+        fun_l11_n980(x)
+    else
+        fun_l11_n497(x)
+    end
+end
+
+def fun_l10_n418(x)
+    if (x < 1)
+        fun_l11_n703(x)
+    else
+        fun_l11_n49(x)
+    end
+end
+
+def fun_l10_n419(x)
+    if (x < 1)
+        fun_l11_n690(x)
+    else
+        fun_l11_n63(x)
+    end
+end
+
+def fun_l10_n420(x)
+    if (x < 1)
+        fun_l11_n219(x)
+    else
+        fun_l11_n814(x)
+    end
+end
+
+def fun_l10_n421(x)
+    if (x < 1)
+        fun_l11_n864(x)
+    else
+        fun_l11_n963(x)
+    end
+end
+
+def fun_l10_n422(x)
+    if (x < 1)
+        fun_l11_n672(x)
+    else
+        fun_l11_n87(x)
+    end
+end
+
+def fun_l10_n423(x)
+    if (x < 1)
+        fun_l11_n41(x)
+    else
+        fun_l11_n461(x)
+    end
+end
+
+def fun_l10_n424(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n283(x)
+    end
+end
+
+def fun_l10_n425(x)
+    if (x < 1)
+        fun_l11_n369(x)
+    else
+        fun_l11_n269(x)
+    end
+end
+
+def fun_l10_n426(x)
+    if (x < 1)
+        fun_l11_n832(x)
+    else
+        fun_l11_n625(x)
+    end
+end
+
+def fun_l10_n427(x)
+    if (x < 1)
+        fun_l11_n272(x)
+    else
+        fun_l11_n634(x)
+    end
+end
+
+def fun_l10_n428(x)
+    if (x < 1)
+        fun_l11_n122(x)
+    else
+        fun_l11_n53(x)
+    end
+end
+
+def fun_l10_n429(x)
+    if (x < 1)
+        fun_l11_n895(x)
+    else
+        fun_l11_n292(x)
+    end
+end
+
+def fun_l10_n430(x)
+    if (x < 1)
+        fun_l11_n460(x)
+    else
+        fun_l11_n177(x)
+    end
+end
+
+def fun_l10_n431(x)
+    if (x < 1)
+        fun_l11_n238(x)
+    else
+        fun_l11_n938(x)
+    end
+end
+
+def fun_l10_n432(x)
+    if (x < 1)
+        fun_l11_n302(x)
+    else
+        fun_l11_n492(x)
+    end
+end
+
+def fun_l10_n433(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n876(x)
+    end
+end
+
+def fun_l10_n434(x)
+    if (x < 1)
+        fun_l11_n64(x)
+    else
+        fun_l11_n892(x)
+    end
+end
+
+def fun_l10_n435(x)
+    if (x < 1)
+        fun_l11_n940(x)
+    else
+        fun_l11_n718(x)
+    end
+end
+
+def fun_l10_n436(x)
+    if (x < 1)
+        fun_l11_n988(x)
+    else
+        fun_l11_n216(x)
+    end
+end
+
+def fun_l10_n437(x)
+    if (x < 1)
+        fun_l11_n282(x)
+    else
+        fun_l11_n168(x)
+    end
+end
+
+def fun_l10_n438(x)
+    if (x < 1)
+        fun_l11_n529(x)
+    else
+        fun_l11_n66(x)
+    end
+end
+
+def fun_l10_n439(x)
+    if (x < 1)
+        fun_l11_n286(x)
+    else
+        fun_l11_n134(x)
+    end
+end
+
+def fun_l10_n440(x)
+    if (x < 1)
+        fun_l11_n454(x)
+    else
+        fun_l11_n873(x)
+    end
+end
+
+def fun_l10_n441(x)
+    if (x < 1)
+        fun_l11_n871(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n442(x)
+    if (x < 1)
+        fun_l11_n314(x)
+    else
+        fun_l11_n685(x)
+    end
+end
+
+def fun_l10_n443(x)
+    if (x < 1)
+        fun_l11_n752(x)
+    else
+        fun_l11_n162(x)
+    end
+end
+
+def fun_l10_n444(x)
+    if (x < 1)
+        fun_l11_n686(x)
+    else
+        fun_l11_n585(x)
+    end
+end
+
+def fun_l10_n445(x)
+    if (x < 1)
+        fun_l11_n42(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n446(x)
+    if (x < 1)
+        fun_l11_n433(x)
+    else
+        fun_l11_n241(x)
+    end
+end
+
+def fun_l10_n447(x)
+    if (x < 1)
+        fun_l11_n99(x)
+    else
+        fun_l11_n563(x)
+    end
+end
+
+def fun_l10_n448(x)
+    if (x < 1)
+        fun_l11_n463(x)
+    else
+        fun_l11_n395(x)
+    end
+end
+
+def fun_l10_n449(x)
+    if (x < 1)
+        fun_l11_n393(x)
+    else
+        fun_l11_n151(x)
+    end
+end
+
+def fun_l10_n450(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n834(x)
+    end
+end
+
+def fun_l10_n451(x)
+    if (x < 1)
+        fun_l11_n195(x)
+    else
+        fun_l11_n0(x)
+    end
+end
+
+def fun_l10_n452(x)
+    if (x < 1)
+        fun_l11_n372(x)
+    else
+        fun_l11_n228(x)
+    end
+end
+
+def fun_l10_n453(x)
+    if (x < 1)
+        fun_l11_n526(x)
+    else
+        fun_l11_n54(x)
+    end
+end
+
+def fun_l10_n454(x)
+    if (x < 1)
+        fun_l11_n594(x)
+    else
+        fun_l11_n116(x)
+    end
+end
+
+def fun_l10_n455(x)
+    if (x < 1)
+        fun_l11_n25(x)
+    else
+        fun_l11_n930(x)
+    end
+end
+
+def fun_l10_n456(x)
+    if (x < 1)
+        fun_l11_n83(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n457(x)
+    if (x < 1)
+        fun_l11_n644(x)
+    else
+        fun_l11_n837(x)
+    end
+end
+
+def fun_l10_n458(x)
+    if (x < 1)
+        fun_l11_n311(x)
+    else
+        fun_l11_n86(x)
+    end
+end
+
+def fun_l10_n459(x)
+    if (x < 1)
+        fun_l11_n139(x)
+    else
+        fun_l11_n735(x)
+    end
+end
+
+def fun_l10_n460(x)
+    if (x < 1)
+        fun_l11_n431(x)
+    else
+        fun_l11_n808(x)
+    end
+end
+
+def fun_l10_n461(x)
+    if (x < 1)
+        fun_l11_n488(x)
+    else
+        fun_l11_n439(x)
+    end
+end
+
+def fun_l10_n462(x)
+    if (x < 1)
+        fun_l11_n448(x)
+    else
+        fun_l11_n882(x)
+    end
+end
+
+def fun_l10_n463(x)
+    if (x < 1)
+        fun_l11_n362(x)
+    else
+        fun_l11_n875(x)
+    end
+end
+
+def fun_l10_n464(x)
+    if (x < 1)
+        fun_l11_n88(x)
+    else
+        fun_l11_n842(x)
+    end
+end
+
+def fun_l10_n465(x)
+    if (x < 1)
+        fun_l11_n651(x)
+    else
+        fun_l11_n368(x)
+    end
+end
+
+def fun_l10_n466(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n3(x)
+    end
+end
+
+def fun_l10_n467(x)
+    if (x < 1)
+        fun_l11_n654(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n468(x)
+    if (x < 1)
+        fun_l11_n765(x)
+    else
+        fun_l11_n604(x)
+    end
+end
+
+def fun_l10_n469(x)
+    if (x < 1)
+        fun_l11_n881(x)
+    else
+        fun_l11_n567(x)
+    end
+end
+
+def fun_l10_n470(x)
+    if (x < 1)
+        fun_l11_n41(x)
+    else
+        fun_l11_n92(x)
+    end
+end
+
+def fun_l10_n471(x)
+    if (x < 1)
+        fun_l11_n905(x)
+    else
+        fun_l11_n731(x)
+    end
+end
+
+def fun_l10_n472(x)
+    if (x < 1)
+        fun_l11_n797(x)
+    else
+        fun_l11_n878(x)
+    end
+end
+
+def fun_l10_n473(x)
+    if (x < 1)
+        fun_l11_n487(x)
+    else
+        fun_l11_n951(x)
+    end
+end
+
+def fun_l10_n474(x)
+    if (x < 1)
+        fun_l11_n998(x)
+    else
+        fun_l11_n900(x)
+    end
+end
+
+def fun_l10_n475(x)
+    if (x < 1)
+        fun_l11_n451(x)
+    else
+        fun_l11_n780(x)
+    end
+end
+
+def fun_l10_n476(x)
+    if (x < 1)
+        fun_l11_n427(x)
+    else
+        fun_l11_n760(x)
+    end
+end
+
+def fun_l10_n477(x)
+    if (x < 1)
+        fun_l11_n758(x)
+    else
+        fun_l11_n177(x)
+    end
+end
+
+def fun_l10_n478(x)
+    if (x < 1)
+        fun_l11_n359(x)
+    else
+        fun_l11_n236(x)
+    end
+end
+
+def fun_l10_n479(x)
+    if (x < 1)
+        fun_l11_n70(x)
+    else
+        fun_l11_n49(x)
+    end
+end
+
+def fun_l10_n480(x)
+    if (x < 1)
+        fun_l11_n338(x)
+    else
+        fun_l11_n714(x)
+    end
+end
+
+def fun_l10_n481(x)
+    if (x < 1)
+        fun_l11_n6(x)
+    else
+        fun_l11_n194(x)
+    end
+end
+
+def fun_l10_n482(x)
+    if (x < 1)
+        fun_l11_n801(x)
+    else
+        fun_l11_n591(x)
+    end
+end
+
+def fun_l10_n483(x)
+    if (x < 1)
+        fun_l11_n362(x)
+    else
+        fun_l11_n687(x)
+    end
+end
+
+def fun_l10_n484(x)
+    if (x < 1)
+        fun_l11_n659(x)
+    else
+        fun_l11_n661(x)
+    end
+end
+
+def fun_l10_n485(x)
+    if (x < 1)
+        fun_l11_n903(x)
+    else
+        fun_l11_n419(x)
+    end
+end
+
+def fun_l10_n486(x)
+    if (x < 1)
+        fun_l11_n279(x)
+    else
+        fun_l11_n995(x)
+    end
+end
+
+def fun_l10_n487(x)
+    if (x < 1)
+        fun_l11_n529(x)
+    else
+        fun_l11_n373(x)
+    end
+end
+
+def fun_l10_n488(x)
+    if (x < 1)
+        fun_l11_n198(x)
+    else
+        fun_l11_n899(x)
+    end
+end
+
+def fun_l10_n489(x)
+    if (x < 1)
+        fun_l11_n174(x)
+    else
+        fun_l11_n485(x)
+    end
+end
+
+def fun_l10_n490(x)
+    if (x < 1)
+        fun_l11_n19(x)
+    else
+        fun_l11_n322(x)
+    end
+end
+
+def fun_l10_n491(x)
+    if (x < 1)
+        fun_l11_n0(x)
+    else
+        fun_l11_n855(x)
+    end
+end
+
+def fun_l10_n492(x)
+    if (x < 1)
+        fun_l11_n126(x)
+    else
+        fun_l11_n986(x)
+    end
+end
+
+def fun_l10_n493(x)
+    if (x < 1)
+        fun_l11_n263(x)
+    else
+        fun_l11_n374(x)
+    end
+end
+
+def fun_l10_n494(x)
+    if (x < 1)
+        fun_l11_n21(x)
+    else
+        fun_l11_n749(x)
+    end
+end
+
+def fun_l10_n495(x)
+    if (x < 1)
+        fun_l11_n618(x)
+    else
+        fun_l11_n955(x)
+    end
+end
+
+def fun_l10_n496(x)
+    if (x < 1)
+        fun_l11_n157(x)
+    else
+        fun_l11_n230(x)
+    end
+end
+
+def fun_l10_n497(x)
+    if (x < 1)
+        fun_l11_n387(x)
+    else
+        fun_l11_n841(x)
+    end
+end
+
+def fun_l10_n498(x)
+    if (x < 1)
+        fun_l11_n496(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n499(x)
+    if (x < 1)
+        fun_l11_n581(x)
+    else
+        fun_l11_n821(x)
+    end
+end
+
+def fun_l10_n500(x)
+    if (x < 1)
+        fun_l11_n202(x)
+    else
+        fun_l11_n26(x)
+    end
+end
+
+def fun_l10_n501(x)
+    if (x < 1)
+        fun_l11_n273(x)
+    else
+        fun_l11_n294(x)
+    end
+end
+
+def fun_l10_n502(x)
+    if (x < 1)
+        fun_l11_n604(x)
+    else
+        fun_l11_n261(x)
+    end
+end
+
+def fun_l10_n503(x)
+    if (x < 1)
+        fun_l11_n632(x)
+    else
+        fun_l11_n340(x)
+    end
+end
+
+def fun_l10_n504(x)
+    if (x < 1)
+        fun_l11_n162(x)
+    else
+        fun_l11_n483(x)
+    end
+end
+
+def fun_l10_n505(x)
+    if (x < 1)
+        fun_l11_n824(x)
+    else
+        fun_l11_n747(x)
+    end
+end
+
+def fun_l10_n506(x)
+    if (x < 1)
+        fun_l11_n575(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n507(x)
+    if (x < 1)
+        fun_l11_n645(x)
+    else
+        fun_l11_n486(x)
+    end
+end
+
+def fun_l10_n508(x)
+    if (x < 1)
+        fun_l11_n876(x)
+    else
+        fun_l11_n640(x)
+    end
+end
+
+def fun_l10_n509(x)
+    if (x < 1)
+        fun_l11_n280(x)
+    else
+        fun_l11_n116(x)
+    end
+end
+
+def fun_l10_n510(x)
+    if (x < 1)
+        fun_l11_n570(x)
+    else
+        fun_l11_n640(x)
+    end
+end
+
+def fun_l10_n511(x)
+    if (x < 1)
+        fun_l11_n576(x)
+    else
+        fun_l11_n124(x)
+    end
+end
+
+def fun_l10_n512(x)
+    if (x < 1)
+        fun_l11_n328(x)
+    else
+        fun_l11_n880(x)
+    end
+end
+
+def fun_l10_n513(x)
+    if (x < 1)
+        fun_l11_n185(x)
+    else
+        fun_l11_n977(x)
+    end
+end
+
+def fun_l10_n514(x)
+    if (x < 1)
+        fun_l11_n560(x)
+    else
+        fun_l11_n825(x)
+    end
+end
+
+def fun_l10_n515(x)
+    if (x < 1)
+        fun_l11_n28(x)
+    else
+        fun_l11_n908(x)
+    end
+end
+
+def fun_l10_n516(x)
+    if (x < 1)
+        fun_l11_n902(x)
+    else
+        fun_l11_n882(x)
+    end
+end
+
+def fun_l10_n517(x)
+    if (x < 1)
+        fun_l11_n429(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n518(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n149(x)
+    end
+end
+
+def fun_l10_n519(x)
+    if (x < 1)
+        fun_l11_n837(x)
+    else
+        fun_l11_n573(x)
+    end
+end
+
+def fun_l10_n520(x)
+    if (x < 1)
+        fun_l11_n934(x)
+    else
+        fun_l11_n504(x)
+    end
+end
+
+def fun_l10_n521(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n551(x)
+    end
+end
+
+def fun_l10_n522(x)
+    if (x < 1)
+        fun_l11_n53(x)
+    else
+        fun_l11_n297(x)
+    end
+end
+
+def fun_l10_n523(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n695(x)
+    end
+end
+
+def fun_l10_n524(x)
+    if (x < 1)
+        fun_l11_n737(x)
+    else
+        fun_l11_n636(x)
+    end
+end
+
+def fun_l10_n525(x)
+    if (x < 1)
+        fun_l11_n249(x)
+    else
+        fun_l11_n757(x)
+    end
+end
+
+def fun_l10_n526(x)
+    if (x < 1)
+        fun_l11_n42(x)
+    else
+        fun_l11_n199(x)
+    end
+end
+
+def fun_l10_n527(x)
+    if (x < 1)
+        fun_l11_n783(x)
+    else
+        fun_l11_n856(x)
+    end
+end
+
+def fun_l10_n528(x)
+    if (x < 1)
+        fun_l11_n708(x)
+    else
+        fun_l11_n550(x)
+    end
+end
+
+def fun_l10_n529(x)
+    if (x < 1)
+        fun_l11_n749(x)
+    else
+        fun_l11_n56(x)
+    end
+end
+
+def fun_l10_n530(x)
+    if (x < 1)
+        fun_l11_n838(x)
+    else
+        fun_l11_n57(x)
+    end
+end
+
+def fun_l10_n531(x)
+    if (x < 1)
+        fun_l11_n293(x)
+    else
+        fun_l11_n938(x)
+    end
+end
+
+def fun_l10_n532(x)
+    if (x < 1)
+        fun_l11_n245(x)
+    else
+        fun_l11_n367(x)
+    end
+end
+
+def fun_l10_n533(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n234(x)
+    end
+end
+
+def fun_l10_n534(x)
+    if (x < 1)
+        fun_l11_n315(x)
+    else
+        fun_l11_n982(x)
+    end
+end
+
+def fun_l10_n535(x)
+    if (x < 1)
+        fun_l11_n841(x)
+    else
+        fun_l11_n112(x)
+    end
+end
+
+def fun_l10_n536(x)
+    if (x < 1)
+        fun_l11_n481(x)
+    else
+        fun_l11_n622(x)
+    end
+end
+
+def fun_l10_n537(x)
+    if (x < 1)
+        fun_l11_n666(x)
+    else
+        fun_l11_n775(x)
+    end
+end
+
+def fun_l10_n538(x)
+    if (x < 1)
+        fun_l11_n409(x)
+    else
+        fun_l11_n733(x)
+    end
+end
+
+def fun_l10_n539(x)
+    if (x < 1)
+        fun_l11_n633(x)
+    else
+        fun_l11_n122(x)
+    end
+end
+
+def fun_l10_n540(x)
+    if (x < 1)
+        fun_l11_n453(x)
+    else
+        fun_l11_n938(x)
+    end
+end
+
+def fun_l10_n541(x)
+    if (x < 1)
+        fun_l11_n55(x)
+    else
+        fun_l11_n344(x)
+    end
+end
+
+def fun_l10_n542(x)
+    if (x < 1)
+        fun_l11_n167(x)
+    else
+        fun_l11_n908(x)
+    end
+end
+
+def fun_l10_n543(x)
+    if (x < 1)
+        fun_l11_n318(x)
+    else
+        fun_l11_n893(x)
+    end
+end
+
+def fun_l10_n544(x)
+    if (x < 1)
+        fun_l11_n683(x)
+    else
+        fun_l11_n109(x)
+    end
+end
+
+def fun_l10_n545(x)
+    if (x < 1)
+        fun_l11_n728(x)
+    else
+        fun_l11_n432(x)
+    end
+end
+
+def fun_l10_n546(x)
+    if (x < 1)
+        fun_l11_n343(x)
+    else
+        fun_l11_n674(x)
+    end
+end
+
+def fun_l10_n547(x)
+    if (x < 1)
+        fun_l11_n374(x)
+    else
+        fun_l11_n293(x)
+    end
+end
+
+def fun_l10_n548(x)
+    if (x < 1)
+        fun_l11_n661(x)
+    else
+        fun_l11_n619(x)
+    end
+end
+
+def fun_l10_n549(x)
+    if (x < 1)
+        fun_l11_n984(x)
+    else
+        fun_l11_n261(x)
+    end
+end
+
+def fun_l10_n550(x)
+    if (x < 1)
+        fun_l11_n729(x)
+    else
+        fun_l11_n469(x)
+    end
+end
+
+def fun_l10_n551(x)
+    if (x < 1)
+        fun_l11_n829(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n552(x)
+    if (x < 1)
+        fun_l11_n457(x)
+    else
+        fun_l11_n440(x)
+    end
+end
+
+def fun_l10_n553(x)
+    if (x < 1)
+        fun_l11_n128(x)
+    else
+        fun_l11_n790(x)
+    end
+end
+
+def fun_l10_n554(x)
+    if (x < 1)
+        fun_l11_n135(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n555(x)
+    if (x < 1)
+        fun_l11_n558(x)
+    else
+        fun_l11_n415(x)
+    end
+end
+
+def fun_l10_n556(x)
+    if (x < 1)
+        fun_l11_n388(x)
+    else
+        fun_l11_n102(x)
+    end
+end
+
+def fun_l10_n557(x)
+    if (x < 1)
+        fun_l11_n575(x)
+    else
+        fun_l11_n877(x)
+    end
+end
+
+def fun_l10_n558(x)
+    if (x < 1)
+        fun_l11_n266(x)
+    else
+        fun_l11_n216(x)
+    end
+end
+
+def fun_l10_n559(x)
+    if (x < 1)
+        fun_l11_n681(x)
+    else
+        fun_l11_n259(x)
+    end
+end
+
+def fun_l10_n560(x)
+    if (x < 1)
+        fun_l11_n922(x)
+    else
+        fun_l11_n828(x)
+    end
+end
+
+def fun_l10_n561(x)
+    if (x < 1)
+        fun_l11_n135(x)
+    else
+        fun_l11_n971(x)
+    end
+end
+
+def fun_l10_n562(x)
+    if (x < 1)
+        fun_l11_n940(x)
+    else
+        fun_l11_n266(x)
+    end
+end
+
+def fun_l10_n563(x)
+    if (x < 1)
+        fun_l11_n291(x)
+    else
+        fun_l11_n587(x)
+    end
+end
+
+def fun_l10_n564(x)
+    if (x < 1)
+        fun_l11_n143(x)
+    else
+        fun_l11_n289(x)
+    end
+end
+
+def fun_l10_n565(x)
+    if (x < 1)
+        fun_l11_n947(x)
+    else
+        fun_l11_n462(x)
+    end
+end
+
+def fun_l10_n566(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n904(x)
+    end
+end
+
+def fun_l10_n567(x)
+    if (x < 1)
+        fun_l11_n945(x)
+    else
+        fun_l11_n814(x)
+    end
+end
+
+def fun_l10_n568(x)
+    if (x < 1)
+        fun_l11_n689(x)
+    else
+        fun_l11_n61(x)
+    end
+end
+
+def fun_l10_n569(x)
+    if (x < 1)
+        fun_l11_n446(x)
+    else
+        fun_l11_n305(x)
+    end
+end
+
+def fun_l10_n570(x)
+    if (x < 1)
+        fun_l11_n209(x)
+    else
+        fun_l11_n768(x)
+    end
+end
+
+def fun_l10_n571(x)
+    if (x < 1)
+        fun_l11_n904(x)
+    else
+        fun_l11_n736(x)
+    end
+end
+
+def fun_l10_n572(x)
+    if (x < 1)
+        fun_l11_n87(x)
+    else
+        fun_l11_n474(x)
+    end
+end
+
+def fun_l10_n573(x)
+    if (x < 1)
+        fun_l11_n886(x)
+    else
+        fun_l11_n75(x)
+    end
+end
+
+def fun_l10_n574(x)
+    if (x < 1)
+        fun_l11_n761(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n575(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n321(x)
+    end
+end
+
+def fun_l10_n576(x)
+    if (x < 1)
+        fun_l11_n154(x)
+    else
+        fun_l11_n356(x)
+    end
+end
+
+def fun_l10_n577(x)
+    if (x < 1)
+        fun_l11_n802(x)
+    else
+        fun_l11_n912(x)
+    end
+end
+
+def fun_l10_n578(x)
+    if (x < 1)
+        fun_l11_n709(x)
+    else
+        fun_l11_n66(x)
+    end
+end
+
+def fun_l10_n579(x)
+    if (x < 1)
+        fun_l11_n994(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n580(x)
+    if (x < 1)
+        fun_l11_n520(x)
+    else
+        fun_l11_n551(x)
+    end
+end
+
+def fun_l10_n581(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n615(x)
+    end
+end
+
+def fun_l10_n582(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n667(x)
+    end
+end
+
+def fun_l10_n583(x)
+    if (x < 1)
+        fun_l11_n829(x)
+    else
+        fun_l11_n802(x)
+    end
+end
+
+def fun_l10_n584(x)
+    if (x < 1)
+        fun_l11_n649(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n585(x)
+    if (x < 1)
+        fun_l11_n454(x)
+    else
+        fun_l11_n541(x)
+    end
+end
+
+def fun_l10_n586(x)
+    if (x < 1)
+        fun_l11_n281(x)
+    else
+        fun_l11_n4(x)
+    end
+end
+
+def fun_l10_n587(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n656(x)
+    end
+end
+
+def fun_l10_n588(x)
+    if (x < 1)
+        fun_l11_n177(x)
+    else
+        fun_l11_n38(x)
+    end
+end
+
+def fun_l10_n589(x)
+    if (x < 1)
+        fun_l11_n555(x)
+    else
+        fun_l11_n557(x)
+    end
+end
+
+def fun_l10_n590(x)
+    if (x < 1)
+        fun_l11_n999(x)
+    else
+        fun_l11_n645(x)
+    end
+end
+
+def fun_l10_n591(x)
+    if (x < 1)
+        fun_l11_n714(x)
+    else
+        fun_l11_n872(x)
+    end
+end
+
+def fun_l10_n592(x)
+    if (x < 1)
+        fun_l11_n779(x)
+    else
+        fun_l11_n524(x)
+    end
+end
+
+def fun_l10_n593(x)
+    if (x < 1)
+        fun_l11_n557(x)
+    else
+        fun_l11_n906(x)
+    end
+end
+
+def fun_l10_n594(x)
+    if (x < 1)
+        fun_l11_n379(x)
+    else
+        fun_l11_n550(x)
+    end
+end
+
+def fun_l10_n595(x)
+    if (x < 1)
+        fun_l11_n138(x)
+    else
+        fun_l11_n785(x)
+    end
+end
+
+def fun_l10_n596(x)
+    if (x < 1)
+        fun_l11_n486(x)
+    else
+        fun_l11_n381(x)
+    end
+end
+
+def fun_l10_n597(x)
+    if (x < 1)
+        fun_l11_n374(x)
+    else
+        fun_l11_n477(x)
+    end
+end
+
+def fun_l10_n598(x)
+    if (x < 1)
+        fun_l11_n113(x)
+    else
+        fun_l11_n455(x)
+    end
+end
+
+def fun_l10_n599(x)
+    if (x < 1)
+        fun_l11_n31(x)
+    else
+        fun_l11_n983(x)
+    end
+end
+
+def fun_l10_n600(x)
+    if (x < 1)
+        fun_l11_n758(x)
+    else
+        fun_l11_n187(x)
+    end
+end
+
+def fun_l10_n601(x)
+    if (x < 1)
+        fun_l11_n198(x)
+    else
+        fun_l11_n436(x)
+    end
+end
+
+def fun_l10_n602(x)
+    if (x < 1)
+        fun_l11_n207(x)
+    else
+        fun_l11_n86(x)
+    end
+end
+
+def fun_l10_n603(x)
+    if (x < 1)
+        fun_l11_n827(x)
+    else
+        fun_l11_n267(x)
+    end
+end
+
+def fun_l10_n604(x)
+    if (x < 1)
+        fun_l11_n760(x)
+    else
+        fun_l11_n707(x)
+    end
+end
+
+def fun_l10_n605(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n249(x)
+    end
+end
+
+def fun_l10_n606(x)
+    if (x < 1)
+        fun_l11_n634(x)
+    else
+        fun_l11_n607(x)
+    end
+end
+
+def fun_l10_n607(x)
+    if (x < 1)
+        fun_l11_n605(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n608(x)
+    if (x < 1)
+        fun_l11_n401(x)
+    else
+        fun_l11_n316(x)
+    end
+end
+
+def fun_l10_n609(x)
+    if (x < 1)
+        fun_l11_n928(x)
+    else
+        fun_l11_n313(x)
+    end
+end
+
+def fun_l10_n610(x)
+    if (x < 1)
+        fun_l11_n601(x)
+    else
+        fun_l11_n278(x)
+    end
+end
+
+def fun_l10_n611(x)
+    if (x < 1)
+        fun_l11_n554(x)
+    else
+        fun_l11_n584(x)
+    end
+end
+
+def fun_l10_n612(x)
+    if (x < 1)
+        fun_l11_n906(x)
+    else
+        fun_l11_n58(x)
+    end
+end
+
+def fun_l10_n613(x)
+    if (x < 1)
+        fun_l11_n85(x)
+    else
+        fun_l11_n631(x)
+    end
+end
+
+def fun_l10_n614(x)
+    if (x < 1)
+        fun_l11_n221(x)
+    else
+        fun_l11_n85(x)
+    end
+end
+
+def fun_l10_n615(x)
+    if (x < 1)
+        fun_l11_n88(x)
+    else
+        fun_l11_n367(x)
+    end
+end
+
+def fun_l10_n616(x)
+    if (x < 1)
+        fun_l11_n693(x)
+    else
+        fun_l11_n385(x)
+    end
+end
+
+def fun_l10_n617(x)
+    if (x < 1)
+        fun_l11_n18(x)
+    else
+        fun_l11_n526(x)
+    end
+end
+
+def fun_l10_n618(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n303(x)
+    end
+end
+
+def fun_l10_n619(x)
+    if (x < 1)
+        fun_l11_n972(x)
+    else
+        fun_l11_n246(x)
+    end
+end
+
+def fun_l10_n620(x)
+    if (x < 1)
+        fun_l11_n185(x)
+    else
+        fun_l11_n512(x)
+    end
+end
+
+def fun_l10_n621(x)
+    if (x < 1)
+        fun_l11_n87(x)
+    else
+        fun_l11_n131(x)
+    end
+end
+
+def fun_l10_n622(x)
+    if (x < 1)
+        fun_l11_n617(x)
+    else
+        fun_l11_n869(x)
+    end
+end
+
+def fun_l10_n623(x)
+    if (x < 1)
+        fun_l11_n514(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n624(x)
+    if (x < 1)
+        fun_l11_n551(x)
+    else
+        fun_l11_n430(x)
+    end
+end
+
+def fun_l10_n625(x)
+    if (x < 1)
+        fun_l11_n266(x)
+    else
+        fun_l11_n826(x)
+    end
+end
+
+def fun_l10_n626(x)
+    if (x < 1)
+        fun_l11_n90(x)
+    else
+        fun_l11_n866(x)
+    end
+end
+
+def fun_l10_n627(x)
+    if (x < 1)
+        fun_l11_n34(x)
+    else
+        fun_l11_n694(x)
+    end
+end
+
+def fun_l10_n628(x)
+    if (x < 1)
+        fun_l11_n455(x)
+    else
+        fun_l11_n990(x)
+    end
+end
+
+def fun_l10_n629(x)
+    if (x < 1)
+        fun_l11_n573(x)
+    else
+        fun_l11_n874(x)
+    end
+end
+
+def fun_l10_n630(x)
+    if (x < 1)
+        fun_l11_n836(x)
+    else
+        fun_l11_n87(x)
+    end
+end
+
+def fun_l10_n631(x)
+    if (x < 1)
+        fun_l11_n234(x)
+    else
+        fun_l11_n389(x)
+    end
+end
+
+def fun_l10_n632(x)
+    if (x < 1)
+        fun_l11_n647(x)
+    else
+        fun_l11_n655(x)
+    end
+end
+
+def fun_l10_n633(x)
+    if (x < 1)
+        fun_l11_n649(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n634(x)
+    if (x < 1)
+        fun_l11_n613(x)
+    else
+        fun_l11_n10(x)
+    end
+end
+
+def fun_l10_n635(x)
+    if (x < 1)
+        fun_l11_n315(x)
+    else
+        fun_l11_n419(x)
+    end
+end
+
+def fun_l10_n636(x)
+    if (x < 1)
+        fun_l11_n575(x)
+    else
+        fun_l11_n29(x)
+    end
+end
+
+def fun_l10_n637(x)
+    if (x < 1)
+        fun_l11_n75(x)
+    else
+        fun_l11_n710(x)
+    end
+end
+
+def fun_l10_n638(x)
+    if (x < 1)
+        fun_l11_n42(x)
+    else
+        fun_l11_n45(x)
+    end
+end
+
+def fun_l10_n639(x)
+    if (x < 1)
+        fun_l11_n629(x)
+    else
+        fun_l11_n850(x)
+    end
+end
+
+def fun_l10_n640(x)
+    if (x < 1)
+        fun_l11_n491(x)
+    else
+        fun_l11_n708(x)
+    end
+end
+
+def fun_l10_n641(x)
+    if (x < 1)
+        fun_l11_n673(x)
+    else
+        fun_l11_n722(x)
+    end
+end
+
+def fun_l10_n642(x)
+    if (x < 1)
+        fun_l11_n922(x)
+    else
+        fun_l11_n783(x)
+    end
+end
+
+def fun_l10_n643(x)
+    if (x < 1)
+        fun_l11_n855(x)
+    else
+        fun_l11_n145(x)
+    end
+end
+
+def fun_l10_n644(x)
+    if (x < 1)
+        fun_l11_n897(x)
+    else
+        fun_l11_n281(x)
+    end
+end
+
+def fun_l10_n645(x)
+    if (x < 1)
+        fun_l11_n148(x)
+    else
+        fun_l11_n786(x)
+    end
+end
+
+def fun_l10_n646(x)
+    if (x < 1)
+        fun_l11_n743(x)
+    else
+        fun_l11_n627(x)
+    end
+end
+
+def fun_l10_n647(x)
+    if (x < 1)
+        fun_l11_n343(x)
+    else
+        fun_l11_n234(x)
+    end
+end
+
+def fun_l10_n648(x)
+    if (x < 1)
+        fun_l11_n995(x)
+    else
+        fun_l11_n199(x)
+    end
+end
+
+def fun_l10_n649(x)
+    if (x < 1)
+        fun_l11_n155(x)
+    else
+        fun_l11_n384(x)
+    end
+end
+
+def fun_l10_n650(x)
+    if (x < 1)
+        fun_l11_n329(x)
+    else
+        fun_l11_n313(x)
+    end
+end
+
+def fun_l10_n651(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n763(x)
+    end
+end
+
+def fun_l10_n652(x)
+    if (x < 1)
+        fun_l11_n839(x)
+    else
+        fun_l11_n692(x)
+    end
+end
+
+def fun_l10_n653(x)
+    if (x < 1)
+        fun_l11_n388(x)
+    else
+        fun_l11_n187(x)
+    end
+end
+
+def fun_l10_n654(x)
+    if (x < 1)
+        fun_l11_n919(x)
+    else
+        fun_l11_n198(x)
+    end
+end
+
+def fun_l10_n655(x)
+    if (x < 1)
+        fun_l11_n313(x)
+    else
+        fun_l11_n686(x)
+    end
+end
+
+def fun_l10_n656(x)
+    if (x < 1)
+        fun_l11_n91(x)
+    else
+        fun_l11_n95(x)
+    end
+end
+
+def fun_l10_n657(x)
+    if (x < 1)
+        fun_l11_n801(x)
+    else
+        fun_l11_n700(x)
+    end
+end
+
+def fun_l10_n658(x)
+    if (x < 1)
+        fun_l11_n938(x)
+    else
+        fun_l11_n936(x)
+    end
+end
+
+def fun_l10_n659(x)
+    if (x < 1)
+        fun_l11_n78(x)
+    else
+        fun_l11_n611(x)
+    end
+end
+
+def fun_l10_n660(x)
+    if (x < 1)
+        fun_l11_n261(x)
+    else
+        fun_l11_n396(x)
+    end
+end
+
+def fun_l10_n661(x)
+    if (x < 1)
+        fun_l11_n154(x)
+    else
+        fun_l11_n132(x)
+    end
+end
+
+def fun_l10_n662(x)
+    if (x < 1)
+        fun_l11_n603(x)
+    else
+        fun_l11_n718(x)
+    end
+end
+
+def fun_l10_n663(x)
+    if (x < 1)
+        fun_l11_n512(x)
+    else
+        fun_l11_n158(x)
+    end
+end
+
+def fun_l10_n664(x)
+    if (x < 1)
+        fun_l11_n178(x)
+    else
+        fun_l11_n59(x)
+    end
+end
+
+def fun_l10_n665(x)
+    if (x < 1)
+        fun_l11_n703(x)
+    else
+        fun_l11_n54(x)
+    end
+end
+
+def fun_l10_n666(x)
+    if (x < 1)
+        fun_l11_n623(x)
+    else
+        fun_l11_n793(x)
+    end
+end
+
+def fun_l10_n667(x)
+    if (x < 1)
+        fun_l11_n350(x)
+    else
+        fun_l11_n244(x)
+    end
+end
+
+def fun_l10_n668(x)
+    if (x < 1)
+        fun_l11_n253(x)
+    else
+        fun_l11_n297(x)
+    end
+end
+
+def fun_l10_n669(x)
+    if (x < 1)
+        fun_l11_n137(x)
+    else
+        fun_l11_n76(x)
+    end
+end
+
+def fun_l10_n670(x)
+    if (x < 1)
+        fun_l11_n755(x)
+    else
+        fun_l11_n627(x)
+    end
+end
+
+def fun_l10_n671(x)
+    if (x < 1)
+        fun_l11_n393(x)
+    else
+        fun_l11_n394(x)
+    end
+end
+
+def fun_l10_n672(x)
+    if (x < 1)
+        fun_l11_n858(x)
+    else
+        fun_l11_n823(x)
+    end
+end
+
+def fun_l10_n673(x)
+    if (x < 1)
+        fun_l11_n202(x)
+    else
+        fun_l11_n800(x)
+    end
+end
+
+def fun_l10_n674(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n343(x)
+    end
+end
+
+def fun_l10_n675(x)
+    if (x < 1)
+        fun_l11_n352(x)
+    else
+        fun_l11_n690(x)
+    end
+end
+
+def fun_l10_n676(x)
+    if (x < 1)
+        fun_l11_n598(x)
+    else
+        fun_l11_n108(x)
+    end
+end
+
+def fun_l10_n677(x)
+    if (x < 1)
+        fun_l11_n126(x)
+    else
+        fun_l11_n226(x)
+    end
+end
+
+def fun_l10_n678(x)
+    if (x < 1)
+        fun_l11_n937(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n679(x)
+    if (x < 1)
+        fun_l11_n231(x)
+    else
+        fun_l11_n264(x)
+    end
+end
+
+def fun_l10_n680(x)
+    if (x < 1)
+        fun_l11_n657(x)
+    else
+        fun_l11_n766(x)
+    end
+end
+
+def fun_l10_n681(x)
+    if (x < 1)
+        fun_l11_n444(x)
+    else
+        fun_l11_n405(x)
+    end
+end
+
+def fun_l10_n682(x)
+    if (x < 1)
+        fun_l11_n410(x)
+    else
+        fun_l11_n409(x)
+    end
+end
+
+def fun_l10_n683(x)
+    if (x < 1)
+        fun_l11_n690(x)
+    else
+        fun_l11_n673(x)
+    end
+end
+
+def fun_l10_n684(x)
+    if (x < 1)
+        fun_l11_n737(x)
+    else
+        fun_l11_n61(x)
+    end
+end
+
+def fun_l10_n685(x)
+    if (x < 1)
+        fun_l11_n54(x)
+    else
+        fun_l11_n387(x)
+    end
+end
+
+def fun_l10_n686(x)
+    if (x < 1)
+        fun_l11_n271(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n687(x)
+    if (x < 1)
+        fun_l11_n988(x)
+    else
+        fun_l11_n816(x)
+    end
+end
+
+def fun_l10_n688(x)
+    if (x < 1)
+        fun_l11_n309(x)
+    else
+        fun_l11_n576(x)
+    end
+end
+
+def fun_l10_n689(x)
+    if (x < 1)
+        fun_l11_n390(x)
+    else
+        fun_l11_n35(x)
+    end
+end
+
+def fun_l10_n690(x)
+    if (x < 1)
+        fun_l11_n93(x)
+    else
+        fun_l11_n712(x)
+    end
+end
+
+def fun_l10_n691(x)
+    if (x < 1)
+        fun_l11_n285(x)
+    else
+        fun_l11_n467(x)
+    end
+end
+
+def fun_l10_n692(x)
+    if (x < 1)
+        fun_l11_n403(x)
+    else
+        fun_l11_n41(x)
+    end
+end
+
+def fun_l10_n693(x)
+    if (x < 1)
+        fun_l11_n228(x)
+    else
+        fun_l11_n689(x)
+    end
+end
+
+def fun_l10_n694(x)
+    if (x < 1)
+        fun_l11_n581(x)
+    else
+        fun_l11_n989(x)
+    end
+end
+
+def fun_l10_n695(x)
+    if (x < 1)
+        fun_l11_n451(x)
+    else
+        fun_l11_n618(x)
+    end
+end
+
+def fun_l10_n696(x)
+    if (x < 1)
+        fun_l11_n640(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n697(x)
+    if (x < 1)
+        fun_l11_n968(x)
+    else
+        fun_l11_n903(x)
+    end
+end
+
+def fun_l10_n698(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n244(x)
+    end
+end
+
+def fun_l10_n699(x)
+    if (x < 1)
+        fun_l11_n17(x)
+    else
+        fun_l11_n17(x)
+    end
+end
+
+def fun_l10_n700(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n539(x)
+    end
+end
+
+def fun_l10_n701(x)
+    if (x < 1)
+        fun_l11_n924(x)
+    else
+        fun_l11_n103(x)
+    end
+end
+
+def fun_l10_n702(x)
+    if (x < 1)
+        fun_l11_n908(x)
+    else
+        fun_l11_n328(x)
+    end
+end
+
+def fun_l10_n703(x)
+    if (x < 1)
+        fun_l11_n393(x)
+    else
+        fun_l11_n386(x)
+    end
+end
+
+def fun_l10_n704(x)
+    if (x < 1)
+        fun_l11_n194(x)
+    else
+        fun_l11_n812(x)
+    end
+end
+
+def fun_l10_n705(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n276(x)
+    end
+end
+
+def fun_l10_n706(x)
+    if (x < 1)
+        fun_l11_n257(x)
+    else
+        fun_l11_n269(x)
+    end
+end
+
+def fun_l10_n707(x)
+    if (x < 1)
+        fun_l11_n940(x)
+    else
+        fun_l11_n593(x)
+    end
+end
+
+def fun_l10_n708(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n992(x)
+    end
+end
+
+def fun_l10_n709(x)
+    if (x < 1)
+        fun_l11_n244(x)
+    else
+        fun_l11_n500(x)
+    end
+end
+
+def fun_l10_n710(x)
+    if (x < 1)
+        fun_l11_n712(x)
+    else
+        fun_l11_n544(x)
+    end
+end
+
+def fun_l10_n711(x)
+    if (x < 1)
+        fun_l11_n701(x)
+    else
+        fun_l11_n104(x)
+    end
+end
+
+def fun_l10_n712(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n199(x)
+    end
+end
+
+def fun_l10_n713(x)
+    if (x < 1)
+        fun_l11_n189(x)
+    else
+        fun_l11_n840(x)
+    end
+end
+
+def fun_l10_n714(x)
+    if (x < 1)
+        fun_l11_n122(x)
+    else
+        fun_l11_n318(x)
+    end
+end
+
+def fun_l10_n715(x)
+    if (x < 1)
+        fun_l11_n915(x)
+    else
+        fun_l11_n964(x)
+    end
+end
+
+def fun_l10_n716(x)
+    if (x < 1)
+        fun_l11_n341(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n717(x)
+    if (x < 1)
+        fun_l11_n846(x)
+    else
+        fun_l11_n235(x)
+    end
+end
+
+def fun_l10_n718(x)
+    if (x < 1)
+        fun_l11_n679(x)
+    else
+        fun_l11_n959(x)
+    end
+end
+
+def fun_l10_n719(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n708(x)
+    end
+end
+
+def fun_l10_n720(x)
+    if (x < 1)
+        fun_l11_n651(x)
+    else
+        fun_l11_n480(x)
+    end
+end
+
+def fun_l10_n721(x)
+    if (x < 1)
+        fun_l11_n773(x)
+    else
+        fun_l11_n568(x)
+    end
+end
+
+def fun_l10_n722(x)
+    if (x < 1)
+        fun_l11_n809(x)
+    else
+        fun_l11_n111(x)
+    end
+end
+
+def fun_l10_n723(x)
+    if (x < 1)
+        fun_l11_n586(x)
+    else
+        fun_l11_n553(x)
+    end
+end
+
+def fun_l10_n724(x)
+    if (x < 1)
+        fun_l11_n473(x)
+    else
+        fun_l11_n387(x)
+    end
+end
+
+def fun_l10_n725(x)
+    if (x < 1)
+        fun_l11_n584(x)
+    else
+        fun_l11_n224(x)
+    end
+end
+
+def fun_l10_n726(x)
+    if (x < 1)
+        fun_l11_n110(x)
+    else
+        fun_l11_n827(x)
+    end
+end
+
+def fun_l10_n727(x)
+    if (x < 1)
+        fun_l11_n753(x)
+    else
+        fun_l11_n745(x)
+    end
+end
+
+def fun_l10_n728(x)
+    if (x < 1)
+        fun_l11_n550(x)
+    else
+        fun_l11_n380(x)
+    end
+end
+
+def fun_l10_n729(x)
+    if (x < 1)
+        fun_l11_n844(x)
+    else
+        fun_l11_n401(x)
+    end
+end
+
+def fun_l10_n730(x)
+    if (x < 1)
+        fun_l11_n837(x)
+    else
+        fun_l11_n759(x)
+    end
+end
+
+def fun_l10_n731(x)
+    if (x < 1)
+        fun_l11_n850(x)
+    else
+        fun_l11_n953(x)
+    end
+end
+
+def fun_l10_n732(x)
+    if (x < 1)
+        fun_l11_n872(x)
+    else
+        fun_l11_n864(x)
+    end
+end
+
+def fun_l10_n733(x)
+    if (x < 1)
+        fun_l11_n894(x)
+    else
+        fun_l11_n943(x)
+    end
+end
+
+def fun_l10_n734(x)
+    if (x < 1)
+        fun_l11_n830(x)
+    else
+        fun_l11_n858(x)
+    end
+end
+
+def fun_l10_n735(x)
+    if (x < 1)
+        fun_l11_n661(x)
+    else
+        fun_l11_n366(x)
+    end
+end
+
+def fun_l10_n736(x)
+    if (x < 1)
+        fun_l11_n736(x)
+    else
+        fun_l11_n636(x)
+    end
+end
+
+def fun_l10_n737(x)
+    if (x < 1)
+        fun_l11_n316(x)
+    else
+        fun_l11_n977(x)
+    end
+end
+
+def fun_l10_n738(x)
+    if (x < 1)
+        fun_l11_n54(x)
+    else
+        fun_l11_n386(x)
+    end
+end
+
+def fun_l10_n739(x)
+    if (x < 1)
+        fun_l11_n985(x)
+    else
+        fun_l11_n274(x)
+    end
+end
+
+def fun_l10_n740(x)
+    if (x < 1)
+        fun_l11_n756(x)
+    else
+        fun_l11_n171(x)
+    end
+end
+
+def fun_l10_n741(x)
+    if (x < 1)
+        fun_l11_n457(x)
+    else
+        fun_l11_n251(x)
+    end
+end
+
+def fun_l10_n742(x)
+    if (x < 1)
+        fun_l11_n751(x)
+    else
+        fun_l11_n29(x)
+    end
+end
+
+def fun_l10_n743(x)
+    if (x < 1)
+        fun_l11_n6(x)
+    else
+        fun_l11_n892(x)
+    end
+end
+
+def fun_l10_n744(x)
+    if (x < 1)
+        fun_l11_n85(x)
+    else
+        fun_l11_n205(x)
+    end
+end
+
+def fun_l10_n745(x)
+    if (x < 1)
+        fun_l11_n887(x)
+    else
+        fun_l11_n734(x)
+    end
+end
+
+def fun_l10_n746(x)
+    if (x < 1)
+        fun_l11_n478(x)
+    else
+        fun_l11_n505(x)
+    end
+end
+
+def fun_l10_n747(x)
+    if (x < 1)
+        fun_l11_n760(x)
+    else
+        fun_l11_n286(x)
+    end
+end
+
+def fun_l10_n748(x)
+    if (x < 1)
+        fun_l11_n391(x)
+    else
+        fun_l11_n69(x)
+    end
+end
+
+def fun_l10_n749(x)
+    if (x < 1)
+        fun_l11_n780(x)
+    else
+        fun_l11_n28(x)
+    end
+end
+
+def fun_l10_n750(x)
+    if (x < 1)
+        fun_l11_n337(x)
+    else
+        fun_l11_n647(x)
+    end
+end
+
+def fun_l10_n751(x)
+    if (x < 1)
+        fun_l11_n92(x)
+    else
+        fun_l11_n121(x)
+    end
+end
+
+def fun_l10_n752(x)
+    if (x < 1)
+        fun_l11_n358(x)
+    else
+        fun_l11_n177(x)
+    end
+end
+
+def fun_l10_n753(x)
+    if (x < 1)
+        fun_l11_n642(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n754(x)
+    if (x < 1)
+        fun_l11_n66(x)
+    else
+        fun_l11_n948(x)
+    end
+end
+
+def fun_l10_n755(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n795(x)
+    end
+end
+
+def fun_l10_n756(x)
+    if (x < 1)
+        fun_l11_n734(x)
+    else
+        fun_l11_n162(x)
+    end
+end
+
+def fun_l10_n757(x)
+    if (x < 1)
+        fun_l11_n689(x)
+    else
+        fun_l11_n31(x)
+    end
+end
+
+def fun_l10_n758(x)
+    if (x < 1)
+        fun_l11_n33(x)
+    else
+        fun_l11_n992(x)
+    end
+end
+
+def fun_l10_n759(x)
+    if (x < 1)
+        fun_l11_n210(x)
+    else
+        fun_l11_n330(x)
+    end
+end
+
+def fun_l10_n760(x)
+    if (x < 1)
+        fun_l11_n727(x)
+    else
+        fun_l11_n265(x)
+    end
+end
+
+def fun_l10_n761(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n706(x)
+    end
+end
+
+def fun_l10_n762(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n325(x)
+    end
+end
+
+def fun_l10_n763(x)
+    if (x < 1)
+        fun_l11_n350(x)
+    else
+        fun_l11_n443(x)
+    end
+end
+
+def fun_l10_n764(x)
+    if (x < 1)
+        fun_l11_n522(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n765(x)
+    if (x < 1)
+        fun_l11_n786(x)
+    else
+        fun_l11_n969(x)
+    end
+end
+
+def fun_l10_n766(x)
+    if (x < 1)
+        fun_l11_n486(x)
+    else
+        fun_l11_n834(x)
+    end
+end
+
+def fun_l10_n767(x)
+    if (x < 1)
+        fun_l11_n84(x)
+    else
+        fun_l11_n989(x)
+    end
+end
+
+def fun_l10_n768(x)
+    if (x < 1)
+        fun_l11_n511(x)
+    else
+        fun_l11_n0(x)
+    end
+end
+
+def fun_l10_n769(x)
+    if (x < 1)
+        fun_l11_n459(x)
+    else
+        fun_l11_n243(x)
+    end
+end
+
+def fun_l10_n770(x)
+    if (x < 1)
+        fun_l11_n59(x)
+    else
+        fun_l11_n267(x)
+    end
+end
+
+def fun_l10_n771(x)
+    if (x < 1)
+        fun_l11_n435(x)
+    else
+        fun_l11_n132(x)
+    end
+end
+
+def fun_l10_n772(x)
+    if (x < 1)
+        fun_l11_n986(x)
+    else
+        fun_l11_n227(x)
+    end
+end
+
+def fun_l10_n773(x)
+    if (x < 1)
+        fun_l11_n931(x)
+    else
+        fun_l11_n215(x)
+    end
+end
+
+def fun_l10_n774(x)
+    if (x < 1)
+        fun_l11_n586(x)
+    else
+        fun_l11_n170(x)
+    end
+end
+
+def fun_l10_n775(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n780(x)
+    end
+end
+
+def fun_l10_n776(x)
+    if (x < 1)
+        fun_l11_n81(x)
+    else
+        fun_l11_n583(x)
+    end
+end
+
+def fun_l10_n777(x)
+    if (x < 1)
+        fun_l11_n118(x)
+    else
+        fun_l11_n451(x)
+    end
+end
+
+def fun_l10_n778(x)
+    if (x < 1)
+        fun_l11_n767(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n779(x)
+    if (x < 1)
+        fun_l11_n270(x)
+    else
+        fun_l11_n725(x)
+    end
+end
+
+def fun_l10_n780(x)
+    if (x < 1)
+        fun_l11_n146(x)
+    else
+        fun_l11_n407(x)
+    end
+end
+
+def fun_l10_n781(x)
+    if (x < 1)
+        fun_l11_n103(x)
+    else
+        fun_l11_n523(x)
+    end
+end
+
+def fun_l10_n782(x)
+    if (x < 1)
+        fun_l11_n499(x)
+    else
+        fun_l11_n710(x)
+    end
+end
+
+def fun_l10_n783(x)
+    if (x < 1)
+        fun_l11_n971(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n784(x)
+    if (x < 1)
+        fun_l11_n457(x)
+    else
+        fun_l11_n207(x)
+    end
+end
+
+def fun_l10_n785(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n19(x)
+    end
+end
+
+def fun_l10_n786(x)
+    if (x < 1)
+        fun_l11_n458(x)
+    else
+        fun_l11_n243(x)
+    end
+end
+
+def fun_l10_n787(x)
+    if (x < 1)
+        fun_l11_n488(x)
+    else
+        fun_l11_n694(x)
+    end
+end
+
+def fun_l10_n788(x)
+    if (x < 1)
+        fun_l11_n422(x)
+    else
+        fun_l11_n201(x)
+    end
+end
+
+def fun_l10_n789(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n993(x)
+    end
+end
+
+def fun_l10_n790(x)
+    if (x < 1)
+        fun_l11_n443(x)
+    else
+        fun_l11_n124(x)
+    end
+end
+
+def fun_l10_n791(x)
+    if (x < 1)
+        fun_l11_n875(x)
+    else
+        fun_l11_n605(x)
+    end
+end
+
+def fun_l10_n792(x)
+    if (x < 1)
+        fun_l11_n836(x)
+    else
+        fun_l11_n776(x)
+    end
+end
+
+def fun_l10_n793(x)
+    if (x < 1)
+        fun_l11_n58(x)
+    else
+        fun_l11_n847(x)
+    end
+end
+
+def fun_l10_n794(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n981(x)
+    end
+end
+
+def fun_l10_n795(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n599(x)
+    end
+end
+
+def fun_l10_n796(x)
+    if (x < 1)
+        fun_l11_n37(x)
+    else
+        fun_l11_n211(x)
+    end
+end
+
+def fun_l10_n797(x)
+    if (x < 1)
+        fun_l11_n770(x)
+    else
+        fun_l11_n688(x)
+    end
+end
+
+def fun_l10_n798(x)
+    if (x < 1)
+        fun_l11_n728(x)
+    else
+        fun_l11_n150(x)
+    end
+end
+
+def fun_l10_n799(x)
+    if (x < 1)
+        fun_l11_n175(x)
+    else
+        fun_l11_n762(x)
+    end
+end
+
+def fun_l10_n800(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n86(x)
+    end
+end
+
+def fun_l10_n801(x)
+    if (x < 1)
+        fun_l11_n669(x)
+    else
+        fun_l11_n120(x)
+    end
+end
+
+def fun_l10_n802(x)
+    if (x < 1)
+        fun_l11_n630(x)
+    else
+        fun_l11_n839(x)
+    end
+end
+
+def fun_l10_n803(x)
+    if (x < 1)
+        fun_l11_n505(x)
+    else
+        fun_l11_n461(x)
+    end
+end
+
+def fun_l10_n804(x)
+    if (x < 1)
+        fun_l11_n757(x)
+    else
+        fun_l11_n620(x)
+    end
+end
+
+def fun_l10_n805(x)
+    if (x < 1)
+        fun_l11_n379(x)
+    else
+        fun_l11_n468(x)
+    end
+end
+
+def fun_l10_n806(x)
+    if (x < 1)
+        fun_l11_n708(x)
+    else
+        fun_l11_n73(x)
+    end
+end
+
+def fun_l10_n807(x)
+    if (x < 1)
+        fun_l11_n340(x)
+    else
+        fun_l11_n671(x)
+    end
+end
+
+def fun_l10_n808(x)
+    if (x < 1)
+        fun_l11_n628(x)
+    else
+        fun_l11_n912(x)
+    end
+end
+
+def fun_l10_n809(x)
+    if (x < 1)
+        fun_l11_n455(x)
+    else
+        fun_l11_n20(x)
+    end
+end
+
+def fun_l10_n810(x)
+    if (x < 1)
+        fun_l11_n211(x)
+    else
+        fun_l11_n724(x)
+    end
+end
+
+def fun_l10_n811(x)
+    if (x < 1)
+        fun_l11_n982(x)
+    else
+        fun_l11_n876(x)
+    end
+end
+
+def fun_l10_n812(x)
+    if (x < 1)
+        fun_l11_n455(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n813(x)
+    if (x < 1)
+        fun_l11_n317(x)
+    else
+        fun_l11_n909(x)
+    end
+end
+
+def fun_l10_n814(x)
+    if (x < 1)
+        fun_l11_n622(x)
+    else
+        fun_l11_n147(x)
+    end
+end
+
+def fun_l10_n815(x)
+    if (x < 1)
+        fun_l11_n174(x)
+    else
+        fun_l11_n660(x)
+    end
+end
+
+def fun_l10_n816(x)
+    if (x < 1)
+        fun_l11_n63(x)
+    else
+        fun_l11_n427(x)
+    end
+end
+
+def fun_l10_n817(x)
+    if (x < 1)
+        fun_l11_n944(x)
+    else
+        fun_l11_n40(x)
+    end
+end
+
+def fun_l10_n818(x)
+    if (x < 1)
+        fun_l11_n887(x)
+    else
+        fun_l11_n641(x)
+    end
+end
+
+def fun_l10_n819(x)
+    if (x < 1)
+        fun_l11_n237(x)
+    else
+        fun_l11_n568(x)
+    end
+end
+
+def fun_l10_n820(x)
+    if (x < 1)
+        fun_l11_n415(x)
+    else
+        fun_l11_n374(x)
+    end
+end
+
+def fun_l10_n821(x)
+    if (x < 1)
+        fun_l11_n183(x)
+    else
+        fun_l11_n38(x)
+    end
+end
+
+def fun_l10_n822(x)
+    if (x < 1)
+        fun_l11_n835(x)
+    else
+        fun_l11_n406(x)
+    end
+end
+
+def fun_l10_n823(x)
+    if (x < 1)
+        fun_l11_n233(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n824(x)
+    if (x < 1)
+        fun_l11_n898(x)
+    else
+        fun_l11_n543(x)
+    end
+end
+
+def fun_l10_n825(x)
+    if (x < 1)
+        fun_l11_n971(x)
+    else
+        fun_l11_n750(x)
+    end
+end
+
+def fun_l10_n826(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n759(x)
+    end
+end
+
+def fun_l10_n827(x)
+    if (x < 1)
+        fun_l11_n953(x)
+    else
+        fun_l11_n187(x)
+    end
+end
+
+def fun_l10_n828(x)
+    if (x < 1)
+        fun_l11_n403(x)
+    else
+        fun_l11_n170(x)
+    end
+end
+
+def fun_l10_n829(x)
+    if (x < 1)
+        fun_l11_n251(x)
+    else
+        fun_l11_n506(x)
+    end
+end
+
+def fun_l10_n830(x)
+    if (x < 1)
+        fun_l11_n426(x)
+    else
+        fun_l11_n325(x)
+    end
+end
+
+def fun_l10_n831(x)
+    if (x < 1)
+        fun_l11_n958(x)
+    else
+        fun_l11_n4(x)
+    end
+end
+
+def fun_l10_n832(x)
+    if (x < 1)
+        fun_l11_n628(x)
+    else
+        fun_l11_n920(x)
+    end
+end
+
+def fun_l10_n833(x)
+    if (x < 1)
+        fun_l11_n241(x)
+    else
+        fun_l11_n459(x)
+    end
+end
+
+def fun_l10_n834(x)
+    if (x < 1)
+        fun_l11_n559(x)
+    else
+        fun_l11_n671(x)
+    end
+end
+
+def fun_l10_n835(x)
+    if (x < 1)
+        fun_l11_n980(x)
+    else
+        fun_l11_n295(x)
+    end
+end
+
+def fun_l10_n836(x)
+    if (x < 1)
+        fun_l11_n306(x)
+    else
+        fun_l11_n143(x)
+    end
+end
+
+def fun_l10_n837(x)
+    if (x < 1)
+        fun_l11_n176(x)
+    else
+        fun_l11_n341(x)
+    end
+end
+
+def fun_l10_n838(x)
+    if (x < 1)
+        fun_l11_n130(x)
+    else
+        fun_l11_n380(x)
+    end
+end
+
+def fun_l10_n839(x)
+    if (x < 1)
+        fun_l11_n630(x)
+    else
+        fun_l11_n216(x)
+    end
+end
+
+def fun_l10_n840(x)
+    if (x < 1)
+        fun_l11_n500(x)
+    else
+        fun_l11_n579(x)
+    end
+end
+
+def fun_l10_n841(x)
+    if (x < 1)
+        fun_l11_n312(x)
+    else
+        fun_l11_n656(x)
+    end
+end
+
+def fun_l10_n842(x)
+    if (x < 1)
+        fun_l11_n209(x)
+    else
+        fun_l11_n332(x)
+    end
+end
+
+def fun_l10_n843(x)
+    if (x < 1)
+        fun_l11_n555(x)
+    else
+        fun_l11_n179(x)
+    end
+end
+
+def fun_l10_n844(x)
+    if (x < 1)
+        fun_l11_n154(x)
+    else
+        fun_l11_n284(x)
+    end
+end
+
+def fun_l10_n845(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n543(x)
+    end
+end
+
+def fun_l10_n846(x)
+    if (x < 1)
+        fun_l11_n346(x)
+    else
+        fun_l11_n553(x)
+    end
+end
+
+def fun_l10_n847(x)
+    if (x < 1)
+        fun_l11_n117(x)
+    else
+        fun_l11_n738(x)
+    end
+end
+
+def fun_l10_n848(x)
+    if (x < 1)
+        fun_l11_n664(x)
+    else
+        fun_l11_n988(x)
+    end
+end
+
+def fun_l10_n849(x)
+    if (x < 1)
+        fun_l11_n298(x)
+    else
+        fun_l11_n753(x)
+    end
+end
+
+def fun_l10_n850(x)
+    if (x < 1)
+        fun_l11_n177(x)
+    else
+        fun_l11_n690(x)
+    end
+end
+
+def fun_l10_n851(x)
+    if (x < 1)
+        fun_l11_n259(x)
+    else
+        fun_l11_n713(x)
+    end
+end
+
+def fun_l10_n852(x)
+    if (x < 1)
+        fun_l11_n151(x)
+    else
+        fun_l11_n580(x)
+    end
+end
+
+def fun_l10_n853(x)
+    if (x < 1)
+        fun_l11_n274(x)
+    else
+        fun_l11_n703(x)
+    end
+end
+
+def fun_l10_n854(x)
+    if (x < 1)
+        fun_l11_n295(x)
+    else
+        fun_l11_n885(x)
+    end
+end
+
+def fun_l10_n855(x)
+    if (x < 1)
+        fun_l11_n513(x)
+    else
+        fun_l11_n963(x)
+    end
+end
+
+def fun_l10_n856(x)
+    if (x < 1)
+        fun_l11_n855(x)
+    else
+        fun_l11_n435(x)
+    end
+end
+
+def fun_l10_n857(x)
+    if (x < 1)
+        fun_l11_n573(x)
+    else
+        fun_l11_n489(x)
+    end
+end
+
+def fun_l10_n858(x)
+    if (x < 1)
+        fun_l11_n880(x)
+    else
+        fun_l11_n91(x)
+    end
+end
+
+def fun_l10_n859(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n358(x)
+    end
+end
+
+def fun_l10_n860(x)
+    if (x < 1)
+        fun_l11_n836(x)
+    else
+        fun_l11_n192(x)
+    end
+end
+
+def fun_l10_n861(x)
+    if (x < 1)
+        fun_l11_n493(x)
+    else
+        fun_l11_n564(x)
+    end
+end
+
+def fun_l10_n862(x)
+    if (x < 1)
+        fun_l11_n111(x)
+    else
+        fun_l11_n8(x)
+    end
+end
+
+def fun_l10_n863(x)
+    if (x < 1)
+        fun_l11_n596(x)
+    else
+        fun_l11_n129(x)
+    end
+end
+
+def fun_l10_n864(x)
+    if (x < 1)
+        fun_l11_n0(x)
+    else
+        fun_l11_n687(x)
+    end
+end
+
+def fun_l10_n865(x)
+    if (x < 1)
+        fun_l11_n543(x)
+    else
+        fun_l11_n866(x)
+    end
+end
+
+def fun_l10_n866(x)
+    if (x < 1)
+        fun_l11_n398(x)
+    else
+        fun_l11_n532(x)
+    end
+end
+
+def fun_l10_n867(x)
+    if (x < 1)
+        fun_l11_n15(x)
+    else
+        fun_l11_n991(x)
+    end
+end
+
+def fun_l10_n868(x)
+    if (x < 1)
+        fun_l11_n890(x)
+    else
+        fun_l11_n222(x)
+    end
+end
+
+def fun_l10_n869(x)
+    if (x < 1)
+        fun_l11_n206(x)
+    else
+        fun_l11_n983(x)
+    end
+end
+
+def fun_l10_n870(x)
+    if (x < 1)
+        fun_l11_n869(x)
+    else
+        fun_l11_n619(x)
+    end
+end
+
+def fun_l10_n871(x)
+    if (x < 1)
+        fun_l11_n417(x)
+    else
+        fun_l11_n18(x)
+    end
+end
+
+def fun_l10_n872(x)
+    if (x < 1)
+        fun_l11_n738(x)
+    else
+        fun_l11_n473(x)
+    end
+end
+
+def fun_l10_n873(x)
+    if (x < 1)
+        fun_l11_n773(x)
+    else
+        fun_l11_n128(x)
+    end
+end
+
+def fun_l10_n874(x)
+    if (x < 1)
+        fun_l11_n930(x)
+    else
+        fun_l11_n563(x)
+    end
+end
+
+def fun_l10_n875(x)
+    if (x < 1)
+        fun_l11_n868(x)
+    else
+        fun_l11_n356(x)
+    end
+end
+
+def fun_l10_n876(x)
+    if (x < 1)
+        fun_l11_n533(x)
+    else
+        fun_l11_n402(x)
+    end
+end
+
+def fun_l10_n877(x)
+    if (x < 1)
+        fun_l11_n959(x)
+    else
+        fun_l11_n921(x)
+    end
+end
+
+def fun_l10_n878(x)
+    if (x < 1)
+        fun_l11_n717(x)
+    else
+        fun_l11_n484(x)
+    end
+end
+
+def fun_l10_n879(x)
+    if (x < 1)
+        fun_l11_n583(x)
+    else
+        fun_l11_n801(x)
+    end
+end
+
+def fun_l10_n880(x)
+    if (x < 1)
+        fun_l11_n576(x)
+    else
+        fun_l11_n811(x)
+    end
+end
+
+def fun_l10_n881(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n585(x)
+    end
+end
+
+def fun_l10_n882(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n930(x)
+    end
+end
+
+def fun_l10_n883(x)
+    if (x < 1)
+        fun_l11_n246(x)
+    else
+        fun_l11_n636(x)
+    end
+end
+
+def fun_l10_n884(x)
+    if (x < 1)
+        fun_l11_n112(x)
+    else
+        fun_l11_n798(x)
+    end
+end
+
+def fun_l10_n885(x)
+    if (x < 1)
+        fun_l11_n517(x)
+    else
+        fun_l11_n633(x)
+    end
+end
+
+def fun_l10_n886(x)
+    if (x < 1)
+        fun_l11_n651(x)
+    else
+        fun_l11_n377(x)
+    end
+end
+
+def fun_l10_n887(x)
+    if (x < 1)
+        fun_l11_n652(x)
+    else
+        fun_l11_n419(x)
+    end
+end
+
+def fun_l10_n888(x)
+    if (x < 1)
+        fun_l11_n346(x)
+    else
+        fun_l11_n294(x)
+    end
+end
+
+def fun_l10_n889(x)
+    if (x < 1)
+        fun_l11_n809(x)
+    else
+        fun_l11_n844(x)
+    end
+end
+
+def fun_l10_n890(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n930(x)
+    end
+end
+
+def fun_l10_n891(x)
+    if (x < 1)
+        fun_l11_n900(x)
+    else
+        fun_l11_n293(x)
+    end
+end
+
+def fun_l10_n892(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n46(x)
+    end
+end
+
+def fun_l10_n893(x)
+    if (x < 1)
+        fun_l11_n429(x)
+    else
+        fun_l11_n174(x)
+    end
+end
+
+def fun_l10_n894(x)
+    if (x < 1)
+        fun_l11_n142(x)
+    else
+        fun_l11_n739(x)
+    end
+end
+
+def fun_l10_n895(x)
+    if (x < 1)
+        fun_l11_n300(x)
+    else
+        fun_l11_n546(x)
+    end
+end
+
+def fun_l10_n896(x)
+    if (x < 1)
+        fun_l11_n253(x)
+    else
+        fun_l11_n555(x)
+    end
+end
+
+def fun_l10_n897(x)
+    if (x < 1)
+        fun_l11_n29(x)
+    else
+        fun_l11_n913(x)
+    end
+end
+
+def fun_l10_n898(x)
+    if (x < 1)
+        fun_l11_n879(x)
+    else
+        fun_l11_n2(x)
+    end
+end
+
+def fun_l10_n899(x)
+    if (x < 1)
+        fun_l11_n191(x)
+    else
+        fun_l11_n418(x)
+    end
+end
+
+def fun_l10_n900(x)
+    if (x < 1)
+        fun_l11_n239(x)
+    else
+        fun_l11_n904(x)
+    end
+end
+
+def fun_l10_n901(x)
+    if (x < 1)
+        fun_l11_n962(x)
+    else
+        fun_l11_n978(x)
+    end
+end
+
+def fun_l10_n902(x)
+    if (x < 1)
+        fun_l11_n343(x)
+    else
+        fun_l11_n358(x)
+    end
+end
+
+def fun_l10_n903(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n806(x)
+    end
+end
+
+def fun_l10_n904(x)
+    if (x < 1)
+        fun_l11_n973(x)
+    else
+        fun_l11_n708(x)
+    end
+end
+
+def fun_l10_n905(x)
+    if (x < 1)
+        fun_l11_n990(x)
+    else
+        fun_l11_n211(x)
+    end
+end
+
+def fun_l10_n906(x)
+    if (x < 1)
+        fun_l11_n499(x)
+    else
+        fun_l11_n605(x)
+    end
+end
+
+def fun_l10_n907(x)
+    if (x < 1)
+        fun_l11_n335(x)
+    else
+        fun_l11_n855(x)
+    end
+end
+
+def fun_l10_n908(x)
+    if (x < 1)
+        fun_l11_n197(x)
+    else
+        fun_l11_n130(x)
+    end
+end
+
+def fun_l10_n909(x)
+    if (x < 1)
+        fun_l11_n462(x)
+    else
+        fun_l11_n838(x)
+    end
+end
+
+def fun_l10_n910(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n16(x)
+    end
+end
+
+def fun_l10_n911(x)
+    if (x < 1)
+        fun_l11_n321(x)
+    else
+        fun_l11_n158(x)
+    end
+end
+
+def fun_l10_n912(x)
+    if (x < 1)
+        fun_l11_n113(x)
+    else
+        fun_l11_n50(x)
+    end
+end
+
+def fun_l10_n913(x)
+    if (x < 1)
+        fun_l11_n492(x)
+    else
+        fun_l11_n502(x)
+    end
+end
+
+def fun_l10_n914(x)
+    if (x < 1)
+        fun_l11_n221(x)
+    else
+        fun_l11_n732(x)
+    end
+end
+
+def fun_l10_n915(x)
+    if (x < 1)
+        fun_l11_n853(x)
+    else
+        fun_l11_n625(x)
+    end
+end
+
+def fun_l10_n916(x)
+    if (x < 1)
+        fun_l11_n172(x)
+    else
+        fun_l11_n17(x)
+    end
+end
+
+def fun_l10_n917(x)
+    if (x < 1)
+        fun_l11_n438(x)
+    else
+        fun_l11_n480(x)
+    end
+end
+
+def fun_l10_n918(x)
+    if (x < 1)
+        fun_l11_n646(x)
+    else
+        fun_l11_n833(x)
+    end
+end
+
+def fun_l10_n919(x)
+    if (x < 1)
+        fun_l11_n628(x)
+    else
+        fun_l11_n40(x)
+    end
+end
+
+def fun_l10_n920(x)
+    if (x < 1)
+        fun_l11_n387(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n921(x)
+    if (x < 1)
+        fun_l11_n641(x)
+    else
+        fun_l11_n669(x)
+    end
+end
+
+def fun_l10_n922(x)
+    if (x < 1)
+        fun_l11_n484(x)
+    else
+        fun_l11_n591(x)
+    end
+end
+
+def fun_l10_n923(x)
+    if (x < 1)
+        fun_l11_n610(x)
+    else
+        fun_l11_n132(x)
+    end
+end
+
+def fun_l10_n924(x)
+    if (x < 1)
+        fun_l11_n90(x)
+    else
+        fun_l11_n727(x)
+    end
+end
+
+def fun_l10_n925(x)
+    if (x < 1)
+        fun_l11_n44(x)
+    else
+        fun_l11_n412(x)
+    end
+end
+
+def fun_l10_n926(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n229(x)
+    end
+end
+
+def fun_l10_n927(x)
+    if (x < 1)
+        fun_l11_n647(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n928(x)
+    if (x < 1)
+        fun_l11_n820(x)
+    else
+        fun_l11_n316(x)
+    end
+end
+
+def fun_l10_n929(x)
+    if (x < 1)
+        fun_l11_n850(x)
+    else
+        fun_l11_n868(x)
+    end
+end
+
+def fun_l10_n930(x)
+    if (x < 1)
+        fun_l11_n373(x)
+    else
+        fun_l11_n183(x)
+    end
+end
+
+def fun_l10_n931(x)
+    if (x < 1)
+        fun_l11_n217(x)
+    else
+        fun_l11_n230(x)
+    end
+end
+
+def fun_l10_n932(x)
+    if (x < 1)
+        fun_l11_n77(x)
+    else
+        fun_l11_n917(x)
+    end
+end
+
+def fun_l10_n933(x)
+    if (x < 1)
+        fun_l11_n264(x)
+    else
+        fun_l11_n992(x)
+    end
+end
+
+def fun_l10_n934(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n441(x)
+    end
+end
+
+def fun_l10_n935(x)
+    if (x < 1)
+        fun_l11_n586(x)
+    else
+        fun_l11_n946(x)
+    end
+end
+
+def fun_l10_n936(x)
+    if (x < 1)
+        fun_l11_n186(x)
+    else
+        fun_l11_n595(x)
+    end
+end
+
+def fun_l10_n937(x)
+    if (x < 1)
+        fun_l11_n210(x)
+    else
+        fun_l11_n186(x)
+    end
+end
+
+def fun_l10_n938(x)
+    if (x < 1)
+        fun_l11_n131(x)
+    else
+        fun_l11_n519(x)
+    end
+end
+
+def fun_l10_n939(x)
+    if (x < 1)
+        fun_l11_n863(x)
+    else
+        fun_l11_n486(x)
+    end
+end
+
+def fun_l10_n940(x)
+    if (x < 1)
+        fun_l11_n753(x)
+    else
+        fun_l11_n916(x)
+    end
+end
+
+def fun_l10_n941(x)
+    if (x < 1)
+        fun_l11_n8(x)
+    else
+        fun_l11_n153(x)
+    end
+end
+
+def fun_l10_n942(x)
+    if (x < 1)
+        fun_l11_n798(x)
+    else
+        fun_l11_n873(x)
+    end
+end
+
+def fun_l10_n943(x)
+    if (x < 1)
+        fun_l11_n862(x)
+    else
+        fun_l11_n293(x)
+    end
+end
+
+def fun_l10_n944(x)
+    if (x < 1)
+        fun_l11_n554(x)
+    else
+        fun_l11_n599(x)
+    end
+end
+
+def fun_l10_n945(x)
+    if (x < 1)
+        fun_l11_n134(x)
+    else
+        fun_l11_n535(x)
+    end
+end
+
+def fun_l10_n946(x)
+    if (x < 1)
+        fun_l11_n992(x)
+    else
+        fun_l11_n624(x)
+    end
+end
+
+def fun_l10_n947(x)
+    if (x < 1)
+        fun_l11_n436(x)
+    else
+        fun_l11_n153(x)
+    end
+end
+
+def fun_l10_n948(x)
+    if (x < 1)
+        fun_l11_n72(x)
+    else
+        fun_l11_n154(x)
+    end
+end
+
+def fun_l10_n949(x)
+    if (x < 1)
+        fun_l11_n61(x)
+    else
+        fun_l11_n612(x)
+    end
+end
+
+def fun_l10_n950(x)
+    if (x < 1)
+        fun_l11_n964(x)
+    else
+        fun_l11_n999(x)
+    end
+end
+
+def fun_l10_n951(x)
+    if (x < 1)
+        fun_l11_n689(x)
+    else
+        fun_l11_n165(x)
+    end
+end
+
+def fun_l10_n952(x)
+    if (x < 1)
+        fun_l11_n856(x)
+    else
+        fun_l11_n7(x)
+    end
+end
+
+def fun_l10_n953(x)
+    if (x < 1)
+        fun_l11_n421(x)
+    else
+        fun_l11_n416(x)
+    end
+end
+
+def fun_l10_n954(x)
+    if (x < 1)
+        fun_l11_n969(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n955(x)
+    if (x < 1)
+        fun_l11_n716(x)
+    else
+        fun_l11_n364(x)
+    end
+end
+
+def fun_l10_n956(x)
+    if (x < 1)
+        fun_l11_n491(x)
+    else
+        fun_l11_n575(x)
+    end
+end
+
+def fun_l10_n957(x)
+    if (x < 1)
+        fun_l11_n522(x)
+    else
+        fun_l11_n430(x)
+    end
+end
+
+def fun_l10_n958(x)
+    if (x < 1)
+        fun_l11_n712(x)
+    else
+        fun_l11_n939(x)
+    end
+end
+
+def fun_l10_n959(x)
+    if (x < 1)
+        fun_l11_n230(x)
+    else
+        fun_l11_n819(x)
+    end
+end
+
+def fun_l10_n960(x)
+    if (x < 1)
+        fun_l11_n790(x)
+    else
+        fun_l11_n939(x)
+    end
+end
+
+def fun_l10_n961(x)
+    if (x < 1)
+        fun_l11_n844(x)
+    else
+        fun_l11_n847(x)
+    end
+end
+
+def fun_l10_n962(x)
+    if (x < 1)
+        fun_l11_n105(x)
+    else
+        fun_l11_n722(x)
+    end
+end
+
+def fun_l10_n963(x)
+    if (x < 1)
+        fun_l11_n166(x)
+    else
+        fun_l11_n990(x)
+    end
+end
+
+def fun_l10_n964(x)
+    if (x < 1)
+        fun_l11_n224(x)
+    else
+        fun_l11_n751(x)
+    end
+end
+
+def fun_l10_n965(x)
+    if (x < 1)
+        fun_l11_n809(x)
+    else
+        fun_l11_n739(x)
+    end
+end
+
+def fun_l10_n966(x)
+    if (x < 1)
+        fun_l11_n840(x)
+    else
+        fun_l11_n795(x)
+    end
+end
+
+def fun_l10_n967(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n926(x)
+    end
+end
+
+def fun_l10_n968(x)
+    if (x < 1)
+        fun_l11_n484(x)
+    else
+        fun_l11_n409(x)
+    end
+end
+
+def fun_l10_n969(x)
+    if (x < 1)
+        fun_l11_n22(x)
+    else
+        fun_l11_n284(x)
+    end
+end
+
+def fun_l10_n970(x)
+    if (x < 1)
+        fun_l11_n539(x)
+    else
+        fun_l11_n661(x)
+    end
+end
+
+def fun_l10_n971(x)
+    if (x < 1)
+        fun_l11_n453(x)
+    else
+        fun_l11_n619(x)
+    end
+end
+
+def fun_l10_n972(x)
+    if (x < 1)
+        fun_l11_n80(x)
+    else
+        fun_l11_n848(x)
+    end
+end
+
+def fun_l10_n973(x)
+    if (x < 1)
+        fun_l11_n599(x)
+    else
+        fun_l11_n147(x)
+    end
+end
+
+def fun_l10_n974(x)
+    if (x < 1)
+        fun_l11_n784(x)
+    else
+        fun_l11_n603(x)
+    end
+end
+
+def fun_l10_n975(x)
+    if (x < 1)
+        fun_l11_n166(x)
+    else
+        fun_l11_n12(x)
+    end
+end
+
+def fun_l10_n976(x)
+    if (x < 1)
+        fun_l11_n739(x)
+    else
+        fun_l11_n381(x)
+    end
+end
+
+def fun_l10_n977(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n67(x)
+    end
+end
+
+def fun_l10_n978(x)
+    if (x < 1)
+        fun_l11_n243(x)
+    else
+        fun_l11_n51(x)
+    end
+end
+
+def fun_l10_n979(x)
+    if (x < 1)
+        fun_l11_n964(x)
+    else
+        fun_l11_n949(x)
+    end
+end
+
+def fun_l10_n980(x)
+    if (x < 1)
+        fun_l11_n881(x)
+    else
+        fun_l11_n893(x)
+    end
+end
+
+def fun_l10_n981(x)
+    if (x < 1)
+        fun_l11_n808(x)
+    else
+        fun_l11_n205(x)
+    end
+end
+
+def fun_l10_n982(x)
+    if (x < 1)
+        fun_l11_n897(x)
+    else
+        fun_l11_n259(x)
+    end
+end
+
+def fun_l10_n983(x)
+    if (x < 1)
+        fun_l11_n671(x)
+    else
+        fun_l11_n115(x)
+    end
+end
+
+def fun_l10_n984(x)
+    if (x < 1)
+        fun_l11_n9(x)
+    else
+        fun_l11_n994(x)
+    end
+end
+
+def fun_l10_n985(x)
+    if (x < 1)
+        fun_l11_n663(x)
+    else
+        fun_l11_n979(x)
+    end
+end
+
+def fun_l10_n986(x)
+    if (x < 1)
+        fun_l11_n8(x)
+    else
+        fun_l11_n949(x)
+    end
+end
+
+def fun_l10_n987(x)
+    if (x < 1)
+        fun_l11_n230(x)
+    else
+        fun_l11_n822(x)
+    end
+end
+
+def fun_l10_n988(x)
+    if (x < 1)
+        fun_l11_n767(x)
+    else
+        fun_l11_n691(x)
+    end
+end
+
+def fun_l10_n989(x)
+    if (x < 1)
+        fun_l11_n524(x)
+    else
+        fun_l11_n514(x)
+    end
+end
+
+def fun_l10_n990(x)
+    if (x < 1)
+        fun_l11_n556(x)
+    else
+        fun_l11_n34(x)
+    end
+end
+
+def fun_l10_n991(x)
+    if (x < 1)
+        fun_l11_n516(x)
+    else
+        fun_l11_n817(x)
+    end
+end
+
+def fun_l10_n992(x)
+    if (x < 1)
+        fun_l11_n273(x)
+    else
+        fun_l11_n189(x)
+    end
+end
+
+def fun_l10_n993(x)
+    if (x < 1)
+        fun_l11_n726(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n994(x)
+    if (x < 1)
+        fun_l11_n789(x)
+    else
+        fun_l11_n993(x)
+    end
+end
+
+def fun_l10_n995(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n291(x)
+    end
+end
+
+def fun_l10_n996(x)
+    if (x < 1)
+        fun_l11_n145(x)
+    else
+        fun_l11_n500(x)
+    end
+end
+
+def fun_l10_n997(x)
+    if (x < 1)
+        fun_l11_n437(x)
+    else
+        fun_l11_n925(x)
+    end
+end
+
+def fun_l10_n998(x)
+    if (x < 1)
+        fun_l11_n945(x)
+    else
+        fun_l11_n300(x)
+    end
+end
+
+def fun_l10_n999(x)
+    if (x < 1)
+        fun_l11_n703(x)
+    else
+        fun_l11_n542(x)
+    end
+end
+
+def fun_l11_n0(x)
+    if (x < 1)
+        fun_l12_n539(x)
+    else
+        fun_l12_n60(x)
+    end
+end
+
+def fun_l11_n1(x)
+    if (x < 1)
+        fun_l12_n659(x)
+    else
+        fun_l12_n739(x)
+    end
+end
+
+def fun_l11_n2(x)
+    if (x < 1)
+        fun_l12_n273(x)
+    else
+        fun_l12_n392(x)
+    end
+end
+
+def fun_l11_n3(x)
+    if (x < 1)
+        fun_l12_n394(x)
+    else
+        fun_l12_n989(x)
+    end
+end
+
+def fun_l11_n4(x)
+    if (x < 1)
+        fun_l12_n254(x)
+    else
+        fun_l12_n906(x)
+    end
+end
+
+def fun_l11_n5(x)
+    if (x < 1)
+        fun_l12_n229(x)
+    else
+        fun_l12_n345(x)
+    end
+end
+
+def fun_l11_n6(x)
+    if (x < 1)
+        fun_l12_n15(x)
+    else
+        fun_l12_n893(x)
+    end
+end
+
+def fun_l11_n7(x)
+    if (x < 1)
+        fun_l12_n185(x)
+    else
+        fun_l12_n187(x)
+    end
+end
+
+def fun_l11_n8(x)
+    if (x < 1)
+        fun_l12_n761(x)
+    else
+        fun_l12_n850(x)
+    end
+end
+
+def fun_l11_n9(x)
+    if (x < 1)
+        fun_l12_n644(x)
+    else
+        fun_l12_n274(x)
+    end
+end
+
+def fun_l11_n10(x)
+    if (x < 1)
+        fun_l12_n652(x)
+    else
+        fun_l12_n223(x)
+    end
+end
+
+def fun_l11_n11(x)
+    if (x < 1)
+        fun_l12_n905(x)
+    else
+        fun_l12_n215(x)
+    end
+end
+
+def fun_l11_n12(x)
+    if (x < 1)
+        fun_l12_n58(x)
+    else
+        fun_l12_n495(x)
+    end
+end
+
+def fun_l11_n13(x)
+    if (x < 1)
+        fun_l12_n529(x)
+    else
+        fun_l12_n477(x)
+    end
+end
+
+def fun_l11_n14(x)
+    if (x < 1)
+        fun_l12_n743(x)
+    else
+        fun_l12_n847(x)
+    end
+end
+
+def fun_l11_n15(x)
+    if (x < 1)
+        fun_l12_n558(x)
+    else
+        fun_l12_n252(x)
+    end
+end
+
+def fun_l11_n16(x)
+    if (x < 1)
+        fun_l12_n115(x)
+    else
+        fun_l12_n972(x)
+    end
+end
+
+def fun_l11_n17(x)
+    if (x < 1)
+        fun_l12_n374(x)
+    else
+        fun_l12_n637(x)
+    end
+end
+
+def fun_l11_n18(x)
+    if (x < 1)
+        fun_l12_n978(x)
+    else
+        fun_l12_n570(x)
+    end
+end
+
+def fun_l11_n19(x)
+    if (x < 1)
+        fun_l12_n264(x)
+    else
+        fun_l12_n743(x)
+    end
+end
+
+def fun_l11_n20(x)
+    if (x < 1)
+        fun_l12_n936(x)
+    else
+        fun_l12_n986(x)
+    end
+end
+
+def fun_l11_n21(x)
+    if (x < 1)
+        fun_l12_n107(x)
+    else
+        fun_l12_n167(x)
+    end
+end
+
+def fun_l11_n22(x)
+    if (x < 1)
+        fun_l12_n777(x)
+    else
+        fun_l12_n143(x)
+    end
+end
+
+def fun_l11_n23(x)
+    if (x < 1)
+        fun_l12_n510(x)
+    else
+        fun_l12_n236(x)
+    end
+end
+
+def fun_l11_n24(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n309(x)
+    end
+end
+
+def fun_l11_n25(x)
+    if (x < 1)
+        fun_l12_n850(x)
+    else
+        fun_l12_n374(x)
+    end
+end
+
+def fun_l11_n26(x)
+    if (x < 1)
+        fun_l12_n573(x)
+    else
+        fun_l12_n722(x)
+    end
+end
+
+def fun_l11_n27(x)
+    if (x < 1)
+        fun_l12_n800(x)
+    else
+        fun_l12_n981(x)
+    end
+end
+
+def fun_l11_n28(x)
+    if (x < 1)
+        fun_l12_n705(x)
+    else
+        fun_l12_n636(x)
+    end
+end
+
+def fun_l11_n29(x)
+    if (x < 1)
+        fun_l12_n618(x)
+    else
+        fun_l12_n429(x)
+    end
+end
+
+def fun_l11_n30(x)
+    if (x < 1)
+        fun_l12_n139(x)
+    else
+        fun_l12_n95(x)
+    end
+end
+
+def fun_l11_n31(x)
+    if (x < 1)
+        fun_l12_n861(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n32(x)
+    if (x < 1)
+        fun_l12_n576(x)
+    else
+        fun_l12_n719(x)
+    end
+end
+
+def fun_l11_n33(x)
+    if (x < 1)
+        fun_l12_n236(x)
+    else
+        fun_l12_n429(x)
+    end
+end
+
+def fun_l11_n34(x)
+    if (x < 1)
+        fun_l12_n375(x)
+    else
+        fun_l12_n696(x)
+    end
+end
+
+def fun_l11_n35(x)
+    if (x < 1)
+        fun_l12_n291(x)
+    else
+        fun_l12_n799(x)
+    end
+end
+
+def fun_l11_n36(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n228(x)
+    end
+end
+
+def fun_l11_n37(x)
+    if (x < 1)
+        fun_l12_n455(x)
+    else
+        fun_l12_n983(x)
+    end
+end
+
+def fun_l11_n38(x)
+    if (x < 1)
+        fun_l12_n486(x)
+    else
+        fun_l12_n871(x)
+    end
+end
+
+def fun_l11_n39(x)
+    if (x < 1)
+        fun_l12_n945(x)
+    else
+        fun_l12_n47(x)
+    end
+end
+
+def fun_l11_n40(x)
+    if (x < 1)
+        fun_l12_n531(x)
+    else
+        fun_l12_n506(x)
+    end
+end
+
+def fun_l11_n41(x)
+    if (x < 1)
+        fun_l12_n248(x)
+    else
+        fun_l12_n142(x)
+    end
+end
+
+def fun_l11_n42(x)
+    if (x < 1)
+        fun_l12_n415(x)
+    else
+        fun_l12_n177(x)
+    end
+end
+
+def fun_l11_n43(x)
+    if (x < 1)
+        fun_l12_n560(x)
+    else
+        fun_l12_n63(x)
+    end
+end
+
+def fun_l11_n44(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n268(x)
+    end
+end
+
+def fun_l11_n45(x)
+    if (x < 1)
+        fun_l12_n814(x)
+    else
+        fun_l12_n967(x)
+    end
+end
+
+def fun_l11_n46(x)
+    if (x < 1)
+        fun_l12_n273(x)
+    else
+        fun_l12_n702(x)
+    end
+end
+
+def fun_l11_n47(x)
+    if (x < 1)
+        fun_l12_n626(x)
+    else
+        fun_l12_n615(x)
+    end
+end
+
+def fun_l11_n48(x)
+    if (x < 1)
+        fun_l12_n374(x)
+    else
+        fun_l12_n669(x)
+    end
+end
+
+def fun_l11_n49(x)
+    if (x < 1)
+        fun_l12_n681(x)
+    else
+        fun_l12_n48(x)
+    end
+end
+
+def fun_l11_n50(x)
+    if (x < 1)
+        fun_l12_n3(x)
+    else
+        fun_l12_n455(x)
+    end
+end
+
+def fun_l11_n51(x)
+    if (x < 1)
+        fun_l12_n461(x)
+    else
+        fun_l12_n350(x)
+    end
+end
+
+def fun_l11_n52(x)
+    if (x < 1)
+        fun_l12_n129(x)
+    else
+        fun_l12_n266(x)
+    end
+end
+
+def fun_l11_n53(x)
+    if (x < 1)
+        fun_l12_n802(x)
+    else
+        fun_l12_n863(x)
+    end
+end
+
+def fun_l11_n54(x)
+    if (x < 1)
+        fun_l12_n216(x)
+    else
+        fun_l12_n820(x)
+    end
+end
+
+def fun_l11_n55(x)
+    if (x < 1)
+        fun_l12_n626(x)
+    else
+        fun_l12_n476(x)
+    end
+end
+
+def fun_l11_n56(x)
+    if (x < 1)
+        fun_l12_n162(x)
+    else
+        fun_l12_n796(x)
+    end
+end
+
+def fun_l11_n57(x)
+    if (x < 1)
+        fun_l12_n45(x)
+    else
+        fun_l12_n893(x)
+    end
+end
+
+def fun_l11_n58(x)
+    if (x < 1)
+        fun_l12_n227(x)
+    else
+        fun_l12_n919(x)
+    end
+end
+
+def fun_l11_n59(x)
+    if (x < 1)
+        fun_l12_n300(x)
+    else
+        fun_l12_n360(x)
+    end
+end
+
+def fun_l11_n60(x)
+    if (x < 1)
+        fun_l12_n265(x)
+    else
+        fun_l12_n552(x)
+    end
+end
+
+def fun_l11_n61(x)
+    if (x < 1)
+        fun_l12_n927(x)
+    else
+        fun_l12_n486(x)
+    end
+end
+
+def fun_l11_n62(x)
+    if (x < 1)
+        fun_l12_n94(x)
+    else
+        fun_l12_n28(x)
+    end
+end
+
+def fun_l11_n63(x)
+    if (x < 1)
+        fun_l12_n295(x)
+    else
+        fun_l12_n967(x)
+    end
+end
+
+def fun_l11_n64(x)
+    if (x < 1)
+        fun_l12_n713(x)
+    else
+        fun_l12_n463(x)
+    end
+end
+
+def fun_l11_n65(x)
+    if (x < 1)
+        fun_l12_n454(x)
+    else
+        fun_l12_n616(x)
+    end
+end
+
+def fun_l11_n66(x)
+    if (x < 1)
+        fun_l12_n121(x)
+    else
+        fun_l12_n277(x)
+    end
+end
+
+def fun_l11_n67(x)
+    if (x < 1)
+        fun_l12_n524(x)
+    else
+        fun_l12_n242(x)
+    end
+end
+
+def fun_l11_n68(x)
+    if (x < 1)
+        fun_l12_n570(x)
+    else
+        fun_l12_n658(x)
+    end
+end
+
+def fun_l11_n69(x)
+    if (x < 1)
+        fun_l12_n343(x)
+    else
+        fun_l12_n826(x)
+    end
+end
+
+def fun_l11_n70(x)
+    if (x < 1)
+        fun_l12_n732(x)
+    else
+        fun_l12_n993(x)
+    end
+end
+
+def fun_l11_n71(x)
+    if (x < 1)
+        fun_l12_n380(x)
+    else
+        fun_l12_n486(x)
+    end
+end
+
+def fun_l11_n72(x)
+    if (x < 1)
+        fun_l12_n55(x)
+    else
+        fun_l12_n342(x)
+    end
+end
+
+def fun_l11_n73(x)
+    if (x < 1)
+        fun_l12_n789(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n74(x)
+    if (x < 1)
+        fun_l12_n106(x)
+    else
+        fun_l12_n557(x)
+    end
+end
+
+def fun_l11_n75(x)
+    if (x < 1)
+        fun_l12_n368(x)
+    else
+        fun_l12_n5(x)
+    end
+end
+
+def fun_l11_n76(x)
+    if (x < 1)
+        fun_l12_n992(x)
+    else
+        fun_l12_n521(x)
+    end
+end
+
+def fun_l11_n77(x)
+    if (x < 1)
+        fun_l12_n754(x)
+    else
+        fun_l12_n259(x)
+    end
+end
+
+def fun_l11_n78(x)
+    if (x < 1)
+        fun_l12_n855(x)
+    else
+        fun_l12_n946(x)
+    end
+end
+
+def fun_l11_n79(x)
+    if (x < 1)
+        fun_l12_n727(x)
+    else
+        fun_l12_n422(x)
+    end
+end
+
+def fun_l11_n80(x)
+    if (x < 1)
+        fun_l12_n649(x)
+    else
+        fun_l12_n593(x)
+    end
+end
+
+def fun_l11_n81(x)
+    if (x < 1)
+        fun_l12_n206(x)
+    else
+        fun_l12_n222(x)
+    end
+end
+
+def fun_l11_n82(x)
+    if (x < 1)
+        fun_l12_n995(x)
+    else
+        fun_l12_n471(x)
+    end
+end
+
+def fun_l11_n83(x)
+    if (x < 1)
+        fun_l12_n926(x)
+    else
+        fun_l12_n165(x)
+    end
+end
+
+def fun_l11_n84(x)
+    if (x < 1)
+        fun_l12_n988(x)
+    else
+        fun_l12_n495(x)
+    end
+end
+
+def fun_l11_n85(x)
+    if (x < 1)
+        fun_l12_n839(x)
+    else
+        fun_l12_n565(x)
+    end
+end
+
+def fun_l11_n86(x)
+    if (x < 1)
+        fun_l12_n381(x)
+    else
+        fun_l12_n981(x)
+    end
+end
+
+def fun_l11_n87(x)
+    if (x < 1)
+        fun_l12_n64(x)
+    else
+        fun_l12_n616(x)
+    end
+end
+
+def fun_l11_n88(x)
+    if (x < 1)
+        fun_l12_n714(x)
+    else
+        fun_l12_n995(x)
+    end
+end
+
+def fun_l11_n89(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n534(x)
+    end
+end
+
+def fun_l11_n90(x)
+    if (x < 1)
+        fun_l12_n31(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n91(x)
+    if (x < 1)
+        fun_l12_n741(x)
+    else
+        fun_l12_n356(x)
+    end
+end
+
+def fun_l11_n92(x)
+    if (x < 1)
+        fun_l12_n418(x)
+    else
+        fun_l12_n184(x)
+    end
+end
+
+def fun_l11_n93(x)
+    if (x < 1)
+        fun_l12_n427(x)
+    else
+        fun_l12_n136(x)
+    end
+end
+
+def fun_l11_n94(x)
+    if (x < 1)
+        fun_l12_n968(x)
+    else
+        fun_l12_n647(x)
+    end
+end
+
+def fun_l11_n95(x)
+    if (x < 1)
+        fun_l12_n641(x)
+    else
+        fun_l12_n675(x)
+    end
+end
+
+def fun_l11_n96(x)
+    if (x < 1)
+        fun_l12_n465(x)
+    else
+        fun_l12_n507(x)
+    end
+end
+
+def fun_l11_n97(x)
+    if (x < 1)
+        fun_l12_n910(x)
+    else
+        fun_l12_n718(x)
+    end
+end
+
+def fun_l11_n98(x)
+    if (x < 1)
+        fun_l12_n686(x)
+    else
+        fun_l12_n94(x)
+    end
+end
+
+def fun_l11_n99(x)
+    if (x < 1)
+        fun_l12_n94(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n100(x)
+    if (x < 1)
+        fun_l12_n270(x)
+    else
+        fun_l12_n228(x)
+    end
+end
+
+def fun_l11_n101(x)
+    if (x < 1)
+        fun_l12_n569(x)
+    else
+        fun_l12_n492(x)
+    end
+end
+
+def fun_l11_n102(x)
+    if (x < 1)
+        fun_l12_n187(x)
+    else
+        fun_l12_n183(x)
+    end
+end
+
+def fun_l11_n103(x)
+    if (x < 1)
+        fun_l12_n894(x)
+    else
+        fun_l12_n655(x)
+    end
+end
+
+def fun_l11_n104(x)
+    if (x < 1)
+        fun_l12_n347(x)
+    else
+        fun_l12_n467(x)
+    end
+end
+
+def fun_l11_n105(x)
+    if (x < 1)
+        fun_l12_n198(x)
+    else
+        fun_l12_n838(x)
+    end
+end
+
+def fun_l11_n106(x)
+    if (x < 1)
+        fun_l12_n941(x)
+    else
+        fun_l12_n98(x)
+    end
+end
+
+def fun_l11_n107(x)
+    if (x < 1)
+        fun_l12_n406(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n108(x)
+    if (x < 1)
+        fun_l12_n980(x)
+    else
+        fun_l12_n508(x)
+    end
+end
+
+def fun_l11_n109(x)
+    if (x < 1)
+        fun_l12_n286(x)
+    else
+        fun_l12_n928(x)
+    end
+end
+
+def fun_l11_n110(x)
+    if (x < 1)
+        fun_l12_n710(x)
+    else
+        fun_l12_n20(x)
+    end
+end
+
+def fun_l11_n111(x)
+    if (x < 1)
+        fun_l12_n358(x)
+    else
+        fun_l12_n549(x)
+    end
+end
+
+def fun_l11_n112(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n548(x)
+    end
+end
+
+def fun_l11_n113(x)
+    if (x < 1)
+        fun_l12_n665(x)
+    else
+        fun_l12_n802(x)
+    end
+end
+
+def fun_l11_n114(x)
+    if (x < 1)
+        fun_l12_n199(x)
+    else
+        fun_l12_n904(x)
+    end
+end
+
+def fun_l11_n115(x)
+    if (x < 1)
+        fun_l12_n995(x)
+    else
+        fun_l12_n319(x)
+    end
+end
+
+def fun_l11_n116(x)
+    if (x < 1)
+        fun_l12_n873(x)
+    else
+        fun_l12_n786(x)
+    end
+end
+
+def fun_l11_n117(x)
+    if (x < 1)
+        fun_l12_n147(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n118(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n871(x)
+    end
+end
+
+def fun_l11_n119(x)
+    if (x < 1)
+        fun_l12_n552(x)
+    else
+        fun_l12_n998(x)
+    end
+end
+
+def fun_l11_n120(x)
+    if (x < 1)
+        fun_l12_n300(x)
+    else
+        fun_l12_n333(x)
+    end
+end
+
+def fun_l11_n121(x)
+    if (x < 1)
+        fun_l12_n846(x)
+    else
+        fun_l12_n133(x)
+    end
+end
+
+def fun_l11_n122(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n540(x)
+    end
+end
+
+def fun_l11_n123(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n264(x)
+    end
+end
+
+def fun_l11_n124(x)
+    if (x < 1)
+        fun_l12_n410(x)
+    else
+        fun_l12_n60(x)
+    end
+end
+
+def fun_l11_n125(x)
+    if (x < 1)
+        fun_l12_n62(x)
+    else
+        fun_l12_n211(x)
+    end
+end
+
+def fun_l11_n126(x)
+    if (x < 1)
+        fun_l12_n252(x)
+    else
+        fun_l12_n635(x)
+    end
+end
+
+def fun_l11_n127(x)
+    if (x < 1)
+        fun_l12_n444(x)
+    else
+        fun_l12_n735(x)
+    end
+end
+
+def fun_l11_n128(x)
+    if (x < 1)
+        fun_l12_n3(x)
+    else
+        fun_l12_n403(x)
+    end
+end
+
+def fun_l11_n129(x)
+    if (x < 1)
+        fun_l12_n121(x)
+    else
+        fun_l12_n882(x)
+    end
+end
+
+def fun_l11_n130(x)
+    if (x < 1)
+        fun_l12_n985(x)
+    else
+        fun_l12_n983(x)
+    end
+end
+
+def fun_l11_n131(x)
+    if (x < 1)
+        fun_l12_n413(x)
+    else
+        fun_l12_n117(x)
+    end
+end
+
+def fun_l11_n132(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n312(x)
+    end
+end
+
+def fun_l11_n133(x)
+    if (x < 1)
+        fun_l12_n249(x)
+    else
+        fun_l12_n870(x)
+    end
+end
+
+def fun_l11_n134(x)
+    if (x < 1)
+        fun_l12_n367(x)
+    else
+        fun_l12_n748(x)
+    end
+end
+
+def fun_l11_n135(x)
+    if (x < 1)
+        fun_l12_n670(x)
+    else
+        fun_l12_n464(x)
+    end
+end
+
+def fun_l11_n136(x)
+    if (x < 1)
+        fun_l12_n698(x)
+    else
+        fun_l12_n238(x)
+    end
+end
+
+def fun_l11_n137(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n660(x)
+    end
+end
+
+def fun_l11_n138(x)
+    if (x < 1)
+        fun_l12_n693(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n139(x)
+    if (x < 1)
+        fun_l12_n959(x)
+    else
+        fun_l12_n377(x)
+    end
+end
+
+def fun_l11_n140(x)
+    if (x < 1)
+        fun_l12_n24(x)
+    else
+        fun_l12_n250(x)
+    end
+end
+
+def fun_l11_n141(x)
+    if (x < 1)
+        fun_l12_n270(x)
+    else
+        fun_l12_n720(x)
+    end
+end
+
+def fun_l11_n142(x)
+    if (x < 1)
+        fun_l12_n775(x)
+    else
+        fun_l12_n781(x)
+    end
+end
+
+def fun_l11_n143(x)
+    if (x < 1)
+        fun_l12_n266(x)
+    else
+        fun_l12_n608(x)
+    end
+end
+
+def fun_l11_n144(x)
+    if (x < 1)
+        fun_l12_n196(x)
+    else
+        fun_l12_n70(x)
+    end
+end
+
+def fun_l11_n145(x)
+    if (x < 1)
+        fun_l12_n100(x)
+    else
+        fun_l12_n846(x)
+    end
+end
+
+def fun_l11_n146(x)
+    if (x < 1)
+        fun_l12_n406(x)
+    else
+        fun_l12_n966(x)
+    end
+end
+
+def fun_l11_n147(x)
+    if (x < 1)
+        fun_l12_n816(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n148(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n710(x)
+    end
+end
+
+def fun_l11_n149(x)
+    if (x < 1)
+        fun_l12_n597(x)
+    else
+        fun_l12_n596(x)
+    end
+end
+
+def fun_l11_n150(x)
+    if (x < 1)
+        fun_l12_n938(x)
+    else
+        fun_l12_n349(x)
+    end
+end
+
+def fun_l11_n151(x)
+    if (x < 1)
+        fun_l12_n987(x)
+    else
+        fun_l12_n231(x)
+    end
+end
+
+def fun_l11_n152(x)
+    if (x < 1)
+        fun_l12_n67(x)
+    else
+        fun_l12_n685(x)
+    end
+end
+
+def fun_l11_n153(x)
+    if (x < 1)
+        fun_l12_n786(x)
+    else
+        fun_l12_n71(x)
+    end
+end
+
+def fun_l11_n154(x)
+    if (x < 1)
+        fun_l12_n245(x)
+    else
+        fun_l12_n109(x)
+    end
+end
+
+def fun_l11_n155(x)
+    if (x < 1)
+        fun_l12_n665(x)
+    else
+        fun_l12_n565(x)
+    end
+end
+
+def fun_l11_n156(x)
+    if (x < 1)
+        fun_l12_n885(x)
+    else
+        fun_l12_n27(x)
+    end
+end
+
+def fun_l11_n157(x)
+    if (x < 1)
+        fun_l12_n704(x)
+    else
+        fun_l12_n140(x)
+    end
+end
+
+def fun_l11_n158(x)
+    if (x < 1)
+        fun_l12_n505(x)
+    else
+        fun_l12_n428(x)
+    end
+end
+
+def fun_l11_n159(x)
+    if (x < 1)
+        fun_l12_n646(x)
+    else
+        fun_l12_n250(x)
+    end
+end
+
+def fun_l11_n160(x)
+    if (x < 1)
+        fun_l12_n125(x)
+    else
+        fun_l12_n22(x)
+    end
+end
+
+def fun_l11_n161(x)
+    if (x < 1)
+        fun_l12_n49(x)
+    else
+        fun_l12_n852(x)
+    end
+end
+
+def fun_l11_n162(x)
+    if (x < 1)
+        fun_l12_n992(x)
+    else
+        fun_l12_n321(x)
+    end
+end
+
+def fun_l11_n163(x)
+    if (x < 1)
+        fun_l12_n457(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n164(x)
+    if (x < 1)
+        fun_l12_n612(x)
+    else
+        fun_l12_n107(x)
+    end
+end
+
+def fun_l11_n165(x)
+    if (x < 1)
+        fun_l12_n786(x)
+    else
+        fun_l12_n338(x)
+    end
+end
+
+def fun_l11_n166(x)
+    if (x < 1)
+        fun_l12_n623(x)
+    else
+        fun_l12_n18(x)
+    end
+end
+
+def fun_l11_n167(x)
+    if (x < 1)
+        fun_l12_n605(x)
+    else
+        fun_l12_n963(x)
+    end
+end
+
+def fun_l11_n168(x)
+    if (x < 1)
+        fun_l12_n111(x)
+    else
+        fun_l12_n822(x)
+    end
+end
+
+def fun_l11_n169(x)
+    if (x < 1)
+        fun_l12_n502(x)
+    else
+        fun_l12_n291(x)
+    end
+end
+
+def fun_l11_n170(x)
+    if (x < 1)
+        fun_l12_n984(x)
+    else
+        fun_l12_n950(x)
+    end
+end
+
+def fun_l11_n171(x)
+    if (x < 1)
+        fun_l12_n915(x)
+    else
+        fun_l12_n81(x)
+    end
+end
+
+def fun_l11_n172(x)
+    if (x < 1)
+        fun_l12_n839(x)
+    else
+        fun_l12_n405(x)
+    end
+end
+
+def fun_l11_n173(x)
+    if (x < 1)
+        fun_l12_n331(x)
+    else
+        fun_l12_n906(x)
+    end
+end
+
+def fun_l11_n174(x)
+    if (x < 1)
+        fun_l12_n698(x)
+    else
+        fun_l12_n378(x)
+    end
+end
+
+def fun_l11_n175(x)
+    if (x < 1)
+        fun_l12_n648(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n176(x)
+    if (x < 1)
+        fun_l12_n876(x)
+    else
+        fun_l12_n873(x)
+    end
+end
+
+def fun_l11_n177(x)
+    if (x < 1)
+        fun_l12_n932(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n178(x)
+    if (x < 1)
+        fun_l12_n975(x)
+    else
+        fun_l12_n166(x)
+    end
+end
+
+def fun_l11_n179(x)
+    if (x < 1)
+        fun_l12_n66(x)
+    else
+        fun_l12_n624(x)
+    end
+end
+
+def fun_l11_n180(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n181(x)
+    if (x < 1)
+        fun_l12_n80(x)
+    else
+        fun_l12_n504(x)
+    end
+end
+
+def fun_l11_n182(x)
+    if (x < 1)
+        fun_l12_n465(x)
+    else
+        fun_l12_n319(x)
+    end
+end
+
+def fun_l11_n183(x)
+    if (x < 1)
+        fun_l12_n493(x)
+    else
+        fun_l12_n412(x)
+    end
+end
+
+def fun_l11_n184(x)
+    if (x < 1)
+        fun_l12_n278(x)
+    else
+        fun_l12_n145(x)
+    end
+end
+
+def fun_l11_n185(x)
+    if (x < 1)
+        fun_l12_n328(x)
+    else
+        fun_l12_n777(x)
+    end
+end
+
+def fun_l11_n186(x)
+    if (x < 1)
+        fun_l12_n120(x)
+    else
+        fun_l12_n462(x)
+    end
+end
+
+def fun_l11_n187(x)
+    if (x < 1)
+        fun_l12_n755(x)
+    else
+        fun_l12_n260(x)
+    end
+end
+
+def fun_l11_n188(x)
+    if (x < 1)
+        fun_l12_n378(x)
+    else
+        fun_l12_n174(x)
+    end
+end
+
+def fun_l11_n189(x)
+    if (x < 1)
+        fun_l12_n100(x)
+    else
+        fun_l12_n234(x)
+    end
+end
+
+def fun_l11_n190(x)
+    if (x < 1)
+        fun_l12_n132(x)
+    else
+        fun_l12_n437(x)
+    end
+end
+
+def fun_l11_n191(x)
+    if (x < 1)
+        fun_l12_n399(x)
+    else
+        fun_l12_n989(x)
+    end
+end
+
+def fun_l11_n192(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n953(x)
+    end
+end
+
+def fun_l11_n193(x)
+    if (x < 1)
+        fun_l12_n139(x)
+    else
+        fun_l12_n138(x)
+    end
+end
+
+def fun_l11_n194(x)
+    if (x < 1)
+        fun_l12_n294(x)
+    else
+        fun_l12_n676(x)
+    end
+end
+
+def fun_l11_n195(x)
+    if (x < 1)
+        fun_l12_n581(x)
+    else
+        fun_l12_n549(x)
+    end
+end
+
+def fun_l11_n196(x)
+    if (x < 1)
+        fun_l12_n555(x)
+    else
+        fun_l12_n738(x)
+    end
+end
+
+def fun_l11_n197(x)
+    if (x < 1)
+        fun_l12_n170(x)
+    else
+        fun_l12_n476(x)
+    end
+end
+
+def fun_l11_n198(x)
+    if (x < 1)
+        fun_l12_n350(x)
+    else
+        fun_l12_n576(x)
+    end
+end
+
+def fun_l11_n199(x)
+    if (x < 1)
+        fun_l12_n647(x)
+    else
+        fun_l12_n94(x)
+    end
+end
+
+def fun_l11_n200(x)
+    if (x < 1)
+        fun_l12_n28(x)
+    else
+        fun_l12_n706(x)
+    end
+end
+
+def fun_l11_n201(x)
+    if (x < 1)
+        fun_l12_n189(x)
+    else
+        fun_l12_n366(x)
+    end
+end
+
+def fun_l11_n202(x)
+    if (x < 1)
+        fun_l12_n690(x)
+    else
+        fun_l12_n807(x)
+    end
+end
+
+def fun_l11_n203(x)
+    if (x < 1)
+        fun_l12_n402(x)
+    else
+        fun_l12_n685(x)
+    end
+end
+
+def fun_l11_n204(x)
+    if (x < 1)
+        fun_l12_n232(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n205(x)
+    if (x < 1)
+        fun_l12_n108(x)
+    else
+        fun_l12_n888(x)
+    end
+end
+
+def fun_l11_n206(x)
+    if (x < 1)
+        fun_l12_n494(x)
+    else
+        fun_l12_n372(x)
+    end
+end
+
+def fun_l11_n207(x)
+    if (x < 1)
+        fun_l12_n607(x)
+    else
+        fun_l12_n336(x)
+    end
+end
+
+def fun_l11_n208(x)
+    if (x < 1)
+        fun_l12_n913(x)
+    else
+        fun_l12_n134(x)
+    end
+end
+
+def fun_l11_n209(x)
+    if (x < 1)
+        fun_l12_n996(x)
+    else
+        fun_l12_n918(x)
+    end
+end
+
+def fun_l11_n210(x)
+    if (x < 1)
+        fun_l12_n674(x)
+    else
+        fun_l12_n260(x)
+    end
+end
+
+def fun_l11_n211(x)
+    if (x < 1)
+        fun_l12_n344(x)
+    else
+        fun_l12_n219(x)
+    end
+end
+
+def fun_l11_n212(x)
+    if (x < 1)
+        fun_l12_n161(x)
+    else
+        fun_l12_n415(x)
+    end
+end
+
+def fun_l11_n213(x)
+    if (x < 1)
+        fun_l12_n65(x)
+    else
+        fun_l12_n777(x)
+    end
+end
+
+def fun_l11_n214(x)
+    if (x < 1)
+        fun_l12_n369(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n215(x)
+    if (x < 1)
+        fun_l12_n310(x)
+    else
+        fun_l12_n118(x)
+    end
+end
+
+def fun_l11_n216(x)
+    if (x < 1)
+        fun_l12_n326(x)
+    else
+        fun_l12_n823(x)
+    end
+end
+
+def fun_l11_n217(x)
+    if (x < 1)
+        fun_l12_n981(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n218(x)
+    if (x < 1)
+        fun_l12_n425(x)
+    else
+        fun_l12_n483(x)
+    end
+end
+
+def fun_l11_n219(x)
+    if (x < 1)
+        fun_l12_n931(x)
+    else
+        fun_l12_n366(x)
+    end
+end
+
+def fun_l11_n220(x)
+    if (x < 1)
+        fun_l12_n325(x)
+    else
+        fun_l12_n926(x)
+    end
+end
+
+def fun_l11_n221(x)
+    if (x < 1)
+        fun_l12_n924(x)
+    else
+        fun_l12_n764(x)
+    end
+end
+
+def fun_l11_n222(x)
+    if (x < 1)
+        fun_l12_n407(x)
+    else
+        fun_l12_n137(x)
+    end
+end
+
+def fun_l11_n223(x)
+    if (x < 1)
+        fun_l12_n584(x)
+    else
+        fun_l12_n294(x)
+    end
+end
+
+def fun_l11_n224(x)
+    if (x < 1)
+        fun_l12_n39(x)
+    else
+        fun_l12_n795(x)
+    end
+end
+
+def fun_l11_n225(x)
+    if (x < 1)
+        fun_l12_n37(x)
+    else
+        fun_l12_n738(x)
+    end
+end
+
+def fun_l11_n226(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n152(x)
+    end
+end
+
+def fun_l11_n227(x)
+    if (x < 1)
+        fun_l12_n116(x)
+    else
+        fun_l12_n589(x)
+    end
+end
+
+def fun_l11_n228(x)
+    if (x < 1)
+        fun_l12_n500(x)
+    else
+        fun_l12_n916(x)
+    end
+end
+
+def fun_l11_n229(x)
+    if (x < 1)
+        fun_l12_n443(x)
+    else
+        fun_l12_n126(x)
+    end
+end
+
+def fun_l11_n230(x)
+    if (x < 1)
+        fun_l12_n311(x)
+    else
+        fun_l12_n184(x)
+    end
+end
+
+def fun_l11_n231(x)
+    if (x < 1)
+        fun_l12_n604(x)
+    else
+        fun_l12_n171(x)
+    end
+end
+
+def fun_l11_n232(x)
+    if (x < 1)
+        fun_l12_n287(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n233(x)
+    if (x < 1)
+        fun_l12_n834(x)
+    else
+        fun_l12_n435(x)
+    end
+end
+
+def fun_l11_n234(x)
+    if (x < 1)
+        fun_l12_n187(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n235(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n236(x)
+    if (x < 1)
+        fun_l12_n797(x)
+    else
+        fun_l12_n702(x)
+    end
+end
+
+def fun_l11_n237(x)
+    if (x < 1)
+        fun_l12_n645(x)
+    else
+        fun_l12_n691(x)
+    end
+end
+
+def fun_l11_n238(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n97(x)
+    end
+end
+
+def fun_l11_n239(x)
+    if (x < 1)
+        fun_l12_n491(x)
+    else
+        fun_l12_n172(x)
+    end
+end
+
+def fun_l11_n240(x)
+    if (x < 1)
+        fun_l12_n882(x)
+    else
+        fun_l12_n596(x)
+    end
+end
+
+def fun_l11_n241(x)
+    if (x < 1)
+        fun_l12_n178(x)
+    else
+        fun_l12_n671(x)
+    end
+end
+
+def fun_l11_n242(x)
+    if (x < 1)
+        fun_l12_n483(x)
+    else
+        fun_l12_n143(x)
+    end
+end
+
+def fun_l11_n243(x)
+    if (x < 1)
+        fun_l12_n677(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n244(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n873(x)
+    end
+end
+
+def fun_l11_n245(x)
+    if (x < 1)
+        fun_l12_n393(x)
+    else
+        fun_l12_n532(x)
+    end
+end
+
+def fun_l11_n246(x)
+    if (x < 1)
+        fun_l12_n704(x)
+    else
+        fun_l12_n885(x)
+    end
+end
+
+def fun_l11_n247(x)
+    if (x < 1)
+        fun_l12_n668(x)
+    else
+        fun_l12_n305(x)
+    end
+end
+
+def fun_l11_n248(x)
+    if (x < 1)
+        fun_l12_n925(x)
+    else
+        fun_l12_n342(x)
+    end
+end
+
+def fun_l11_n249(x)
+    if (x < 1)
+        fun_l12_n487(x)
+    else
+        fun_l12_n517(x)
+    end
+end
+
+def fun_l11_n250(x)
+    if (x < 1)
+        fun_l12_n889(x)
+    else
+        fun_l12_n91(x)
+    end
+end
+
+def fun_l11_n251(x)
+    if (x < 1)
+        fun_l12_n908(x)
+    else
+        fun_l12_n645(x)
+    end
+end
+
+def fun_l11_n252(x)
+    if (x < 1)
+        fun_l12_n747(x)
+    else
+        fun_l12_n736(x)
+    end
+end
+
+def fun_l11_n253(x)
+    if (x < 1)
+        fun_l12_n749(x)
+    else
+        fun_l12_n264(x)
+    end
+end
+
+def fun_l11_n254(x)
+    if (x < 1)
+        fun_l12_n353(x)
+    else
+        fun_l12_n120(x)
+    end
+end
+
+def fun_l11_n255(x)
+    if (x < 1)
+        fun_l12_n231(x)
+    else
+        fun_l12_n211(x)
+    end
+end
+
+def fun_l11_n256(x)
+    if (x < 1)
+        fun_l12_n66(x)
+    else
+        fun_l12_n998(x)
+    end
+end
+
+def fun_l11_n257(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n37(x)
+    end
+end
+
+def fun_l11_n258(x)
+    if (x < 1)
+        fun_l12_n96(x)
+    else
+        fun_l12_n489(x)
+    end
+end
+
+def fun_l11_n259(x)
+    if (x < 1)
+        fun_l12_n86(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n260(x)
+    if (x < 1)
+        fun_l12_n774(x)
+    else
+        fun_l12_n203(x)
+    end
+end
+
+def fun_l11_n261(x)
+    if (x < 1)
+        fun_l12_n935(x)
+    else
+        fun_l12_n29(x)
+    end
+end
+
+def fun_l11_n262(x)
+    if (x < 1)
+        fun_l12_n599(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n263(x)
+    if (x < 1)
+        fun_l12_n63(x)
+    else
+        fun_l12_n866(x)
+    end
+end
+
+def fun_l11_n264(x)
+    if (x < 1)
+        fun_l12_n892(x)
+    else
+        fun_l12_n847(x)
+    end
+end
+
+def fun_l11_n265(x)
+    if (x < 1)
+        fun_l12_n695(x)
+    else
+        fun_l12_n881(x)
+    end
+end
+
+def fun_l11_n266(x)
+    if (x < 1)
+        fun_l12_n176(x)
+    else
+        fun_l12_n39(x)
+    end
+end
+
+def fun_l11_n267(x)
+    if (x < 1)
+        fun_l12_n448(x)
+    else
+        fun_l12_n744(x)
+    end
+end
+
+def fun_l11_n268(x)
+    if (x < 1)
+        fun_l12_n587(x)
+    else
+        fun_l12_n462(x)
+    end
+end
+
+def fun_l11_n269(x)
+    if (x < 1)
+        fun_l12_n670(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n270(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n903(x)
+    end
+end
+
+def fun_l11_n271(x)
+    if (x < 1)
+        fun_l12_n914(x)
+    else
+        fun_l12_n459(x)
+    end
+end
+
+def fun_l11_n272(x)
+    if (x < 1)
+        fun_l12_n932(x)
+    else
+        fun_l12_n10(x)
+    end
+end
+
+def fun_l11_n273(x)
+    if (x < 1)
+        fun_l12_n554(x)
+    else
+        fun_l12_n528(x)
+    end
+end
+
+def fun_l11_n274(x)
+    if (x < 1)
+        fun_l12_n698(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n275(x)
+    if (x < 1)
+        fun_l12_n907(x)
+    else
+        fun_l12_n945(x)
+    end
+end
+
+def fun_l11_n276(x)
+    if (x < 1)
+        fun_l12_n421(x)
+    else
+        fun_l12_n575(x)
+    end
+end
+
+def fun_l11_n277(x)
+    if (x < 1)
+        fun_l12_n757(x)
+    else
+        fun_l12_n808(x)
+    end
+end
+
+def fun_l11_n278(x)
+    if (x < 1)
+        fun_l12_n527(x)
+    else
+        fun_l12_n438(x)
+    end
+end
+
+def fun_l11_n279(x)
+    if (x < 1)
+        fun_l12_n263(x)
+    else
+        fun_l12_n842(x)
+    end
+end
+
+def fun_l11_n280(x)
+    if (x < 1)
+        fun_l12_n603(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n281(x)
+    if (x < 1)
+        fun_l12_n486(x)
+    else
+        fun_l12_n380(x)
+    end
+end
+
+def fun_l11_n282(x)
+    if (x < 1)
+        fun_l12_n699(x)
+    else
+        fun_l12_n199(x)
+    end
+end
+
+def fun_l11_n283(x)
+    if (x < 1)
+        fun_l12_n422(x)
+    else
+        fun_l12_n258(x)
+    end
+end
+
+def fun_l11_n284(x)
+    if (x < 1)
+        fun_l12_n255(x)
+    else
+        fun_l12_n752(x)
+    end
+end
+
+def fun_l11_n285(x)
+    if (x < 1)
+        fun_l12_n506(x)
+    else
+        fun_l12_n801(x)
+    end
+end
+
+def fun_l11_n286(x)
+    if (x < 1)
+        fun_l12_n535(x)
+    else
+        fun_l12_n892(x)
+    end
+end
+
+def fun_l11_n287(x)
+    if (x < 1)
+        fun_l12_n547(x)
+    else
+        fun_l12_n74(x)
+    end
+end
+
+def fun_l11_n288(x)
+    if (x < 1)
+        fun_l12_n923(x)
+    else
+        fun_l12_n135(x)
+    end
+end
+
+def fun_l11_n289(x)
+    if (x < 1)
+        fun_l12_n78(x)
+    else
+        fun_l12_n704(x)
+    end
+end
+
+def fun_l11_n290(x)
+    if (x < 1)
+        fun_l12_n771(x)
+    else
+        fun_l12_n915(x)
+    end
+end
+
+def fun_l11_n291(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n188(x)
+    end
+end
+
+def fun_l11_n292(x)
+    if (x < 1)
+        fun_l12_n736(x)
+    else
+        fun_l12_n190(x)
+    end
+end
+
+def fun_l11_n293(x)
+    if (x < 1)
+        fun_l12_n301(x)
+    else
+        fun_l12_n745(x)
+    end
+end
+
+def fun_l11_n294(x)
+    if (x < 1)
+        fun_l12_n525(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n295(x)
+    if (x < 1)
+        fun_l12_n339(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n296(x)
+    if (x < 1)
+        fun_l12_n491(x)
+    else
+        fun_l12_n601(x)
+    end
+end
+
+def fun_l11_n297(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n361(x)
+    end
+end
+
+def fun_l11_n298(x)
+    if (x < 1)
+        fun_l12_n617(x)
+    else
+        fun_l12_n346(x)
+    end
+end
+
+def fun_l11_n299(x)
+    if (x < 1)
+        fun_l12_n578(x)
+    else
+        fun_l12_n147(x)
+    end
+end
+
+def fun_l11_n300(x)
+    if (x < 1)
+        fun_l12_n73(x)
+    else
+        fun_l12_n360(x)
+    end
+end
+
+def fun_l11_n301(x)
+    if (x < 1)
+        fun_l12_n398(x)
+    else
+        fun_l12_n749(x)
+    end
+end
+
+def fun_l11_n302(x)
+    if (x < 1)
+        fun_l12_n871(x)
+    else
+        fun_l12_n745(x)
+    end
+end
+
+def fun_l11_n303(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n196(x)
+    end
+end
+
+def fun_l11_n304(x)
+    if (x < 1)
+        fun_l12_n202(x)
+    else
+        fun_l12_n173(x)
+    end
+end
+
+def fun_l11_n305(x)
+    if (x < 1)
+        fun_l12_n975(x)
+    else
+        fun_l12_n859(x)
+    end
+end
+
+def fun_l11_n306(x)
+    if (x < 1)
+        fun_l12_n776(x)
+    else
+        fun_l12_n433(x)
+    end
+end
+
+def fun_l11_n307(x)
+    if (x < 1)
+        fun_l12_n760(x)
+    else
+        fun_l12_n4(x)
+    end
+end
+
+def fun_l11_n308(x)
+    if (x < 1)
+        fun_l12_n834(x)
+    else
+        fun_l12_n276(x)
+    end
+end
+
+def fun_l11_n309(x)
+    if (x < 1)
+        fun_l12_n162(x)
+    else
+        fun_l12_n741(x)
+    end
+end
+
+def fun_l11_n310(x)
+    if (x < 1)
+        fun_l12_n231(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n311(x)
+    if (x < 1)
+        fun_l12_n90(x)
+    else
+        fun_l12_n46(x)
+    end
+end
+
+def fun_l11_n312(x)
+    if (x < 1)
+        fun_l12_n101(x)
+    else
+        fun_l12_n75(x)
+    end
+end
+
+def fun_l11_n313(x)
+    if (x < 1)
+        fun_l12_n415(x)
+    else
+        fun_l12_n535(x)
+    end
+end
+
+def fun_l11_n314(x)
+    if (x < 1)
+        fun_l12_n550(x)
+    else
+        fun_l12_n305(x)
+    end
+end
+
+def fun_l11_n315(x)
+    if (x < 1)
+        fun_l12_n971(x)
+    else
+        fun_l12_n700(x)
+    end
+end
+
+def fun_l11_n316(x)
+    if (x < 1)
+        fun_l12_n942(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n317(x)
+    if (x < 1)
+        fun_l12_n771(x)
+    else
+        fun_l12_n383(x)
+    end
+end
+
+def fun_l11_n318(x)
+    if (x < 1)
+        fun_l12_n846(x)
+    else
+        fun_l12_n504(x)
+    end
+end
+
+def fun_l11_n319(x)
+    if (x < 1)
+        fun_l12_n28(x)
+    else
+        fun_l12_n174(x)
+    end
+end
+
+def fun_l11_n320(x)
+    if (x < 1)
+        fun_l12_n437(x)
+    else
+        fun_l12_n355(x)
+    end
+end
+
+def fun_l11_n321(x)
+    if (x < 1)
+        fun_l12_n954(x)
+    else
+        fun_l12_n78(x)
+    end
+end
+
+def fun_l11_n322(x)
+    if (x < 1)
+        fun_l12_n256(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n323(x)
+    if (x < 1)
+        fun_l12_n41(x)
+    else
+        fun_l12_n88(x)
+    end
+end
+
+def fun_l11_n324(x)
+    if (x < 1)
+        fun_l12_n256(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n325(x)
+    if (x < 1)
+        fun_l12_n143(x)
+    else
+        fun_l12_n506(x)
+    end
+end
+
+def fun_l11_n326(x)
+    if (x < 1)
+        fun_l12_n686(x)
+    else
+        fun_l12_n968(x)
+    end
+end
+
+def fun_l11_n327(x)
+    if (x < 1)
+        fun_l12_n235(x)
+    else
+        fun_l12_n246(x)
+    end
+end
+
+def fun_l11_n328(x)
+    if (x < 1)
+        fun_l12_n85(x)
+    else
+        fun_l12_n125(x)
+    end
+end
+
+def fun_l11_n329(x)
+    if (x < 1)
+        fun_l12_n877(x)
+    else
+        fun_l12_n193(x)
+    end
+end
+
+def fun_l11_n330(x)
+    if (x < 1)
+        fun_l12_n678(x)
+    else
+        fun_l12_n147(x)
+    end
+end
+
+def fun_l11_n331(x)
+    if (x < 1)
+        fun_l12_n402(x)
+    else
+        fun_l12_n747(x)
+    end
+end
+
+def fun_l11_n332(x)
+    if (x < 1)
+        fun_l12_n390(x)
+    else
+        fun_l12_n852(x)
+    end
+end
+
+def fun_l11_n333(x)
+    if (x < 1)
+        fun_l12_n299(x)
+    else
+        fun_l12_n122(x)
+    end
+end
+
+def fun_l11_n334(x)
+    if (x < 1)
+        fun_l12_n398(x)
+    else
+        fun_l12_n886(x)
+    end
+end
+
+def fun_l11_n335(x)
+    if (x < 1)
+        fun_l12_n128(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n336(x)
+    if (x < 1)
+        fun_l12_n611(x)
+    else
+        fun_l12_n75(x)
+    end
+end
+
+def fun_l11_n337(x)
+    if (x < 1)
+        fun_l12_n327(x)
+    else
+        fun_l12_n442(x)
+    end
+end
+
+def fun_l11_n338(x)
+    if (x < 1)
+        fun_l12_n353(x)
+    else
+        fun_l12_n259(x)
+    end
+end
+
+def fun_l11_n339(x)
+    if (x < 1)
+        fun_l12_n173(x)
+    else
+        fun_l12_n846(x)
+    end
+end
+
+def fun_l11_n340(x)
+    if (x < 1)
+        fun_l12_n579(x)
+    else
+        fun_l12_n869(x)
+    end
+end
+
+def fun_l11_n341(x)
+    if (x < 1)
+        fun_l12_n336(x)
+    else
+        fun_l12_n364(x)
+    end
+end
+
+def fun_l11_n342(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n317(x)
+    end
+end
+
+def fun_l11_n343(x)
+    if (x < 1)
+        fun_l12_n560(x)
+    else
+        fun_l12_n202(x)
+    end
+end
+
+def fun_l11_n344(x)
+    if (x < 1)
+        fun_l12_n232(x)
+    else
+        fun_l12_n447(x)
+    end
+end
+
+def fun_l11_n345(x)
+    if (x < 1)
+        fun_l12_n712(x)
+    else
+        fun_l12_n205(x)
+    end
+end
+
+def fun_l11_n346(x)
+    if (x < 1)
+        fun_l12_n102(x)
+    else
+        fun_l12_n785(x)
+    end
+end
+
+def fun_l11_n347(x)
+    if (x < 1)
+        fun_l12_n545(x)
+    else
+        fun_l12_n186(x)
+    end
+end
+
+def fun_l11_n348(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n705(x)
+    end
+end
+
+def fun_l11_n349(x)
+    if (x < 1)
+        fun_l12_n428(x)
+    else
+        fun_l12_n295(x)
+    end
+end
+
+def fun_l11_n350(x)
+    if (x < 1)
+        fun_l12_n855(x)
+    else
+        fun_l12_n232(x)
+    end
+end
+
+def fun_l11_n351(x)
+    if (x < 1)
+        fun_l12_n759(x)
+    else
+        fun_l12_n13(x)
+    end
+end
+
+def fun_l11_n352(x)
+    if (x < 1)
+        fun_l12_n366(x)
+    else
+        fun_l12_n700(x)
+    end
+end
+
+def fun_l11_n353(x)
+    if (x < 1)
+        fun_l12_n814(x)
+    else
+        fun_l12_n101(x)
+    end
+end
+
+def fun_l11_n354(x)
+    if (x < 1)
+        fun_l12_n788(x)
+    else
+        fun_l12_n509(x)
+    end
+end
+
+def fun_l11_n355(x)
+    if (x < 1)
+        fun_l12_n619(x)
+    else
+        fun_l12_n531(x)
+    end
+end
+
+def fun_l11_n356(x)
+    if (x < 1)
+        fun_l12_n142(x)
+    else
+        fun_l12_n586(x)
+    end
+end
+
+def fun_l11_n357(x)
+    if (x < 1)
+        fun_l12_n772(x)
+    else
+        fun_l12_n714(x)
+    end
+end
+
+def fun_l11_n358(x)
+    if (x < 1)
+        fun_l12_n506(x)
+    else
+        fun_l12_n405(x)
+    end
+end
+
+def fun_l11_n359(x)
+    if (x < 1)
+        fun_l12_n991(x)
+    else
+        fun_l12_n141(x)
+    end
+end
+
+def fun_l11_n360(x)
+    if (x < 1)
+        fun_l12_n156(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n361(x)
+    if (x < 1)
+        fun_l12_n525(x)
+    else
+        fun_l12_n293(x)
+    end
+end
+
+def fun_l11_n362(x)
+    if (x < 1)
+        fun_l12_n396(x)
+    else
+        fun_l12_n931(x)
+    end
+end
+
+def fun_l11_n363(x)
+    if (x < 1)
+        fun_l12_n153(x)
+    else
+        fun_l12_n831(x)
+    end
+end
+
+def fun_l11_n364(x)
+    if (x < 1)
+        fun_l12_n240(x)
+    else
+        fun_l12_n450(x)
+    end
+end
+
+def fun_l11_n365(x)
+    if (x < 1)
+        fun_l12_n514(x)
+    else
+        fun_l12_n312(x)
+    end
+end
+
+def fun_l11_n366(x)
+    if (x < 1)
+        fun_l12_n456(x)
+    else
+        fun_l12_n221(x)
+    end
+end
+
+def fun_l11_n367(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n699(x)
+    end
+end
+
+def fun_l11_n368(x)
+    if (x < 1)
+        fun_l12_n738(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n369(x)
+    if (x < 1)
+        fun_l12_n13(x)
+    else
+        fun_l12_n812(x)
+    end
+end
+
+def fun_l11_n370(x)
+    if (x < 1)
+        fun_l12_n392(x)
+    else
+        fun_l12_n342(x)
+    end
+end
+
+def fun_l11_n371(x)
+    if (x < 1)
+        fun_l12_n470(x)
+    else
+        fun_l12_n623(x)
+    end
+end
+
+def fun_l11_n372(x)
+    if (x < 1)
+        fun_l12_n26(x)
+    else
+        fun_l12_n138(x)
+    end
+end
+
+def fun_l11_n373(x)
+    if (x < 1)
+        fun_l12_n70(x)
+    else
+        fun_l12_n682(x)
+    end
+end
+
+def fun_l11_n374(x)
+    if (x < 1)
+        fun_l12_n413(x)
+    else
+        fun_l12_n900(x)
+    end
+end
+
+def fun_l11_n375(x)
+    if (x < 1)
+        fun_l12_n328(x)
+    else
+        fun_l12_n848(x)
+    end
+end
+
+def fun_l11_n376(x)
+    if (x < 1)
+        fun_l12_n604(x)
+    else
+        fun_l12_n823(x)
+    end
+end
+
+def fun_l11_n377(x)
+    if (x < 1)
+        fun_l12_n469(x)
+    else
+        fun_l12_n868(x)
+    end
+end
+
+def fun_l11_n378(x)
+    if (x < 1)
+        fun_l12_n241(x)
+    else
+        fun_l12_n571(x)
+    end
+end
+
+def fun_l11_n379(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n75(x)
+    end
+end
+
+def fun_l11_n380(x)
+    if (x < 1)
+        fun_l12_n587(x)
+    else
+        fun_l12_n454(x)
+    end
+end
+
+def fun_l11_n381(x)
+    if (x < 1)
+        fun_l12_n210(x)
+    else
+        fun_l12_n512(x)
+    end
+end
+
+def fun_l11_n382(x)
+    if (x < 1)
+        fun_l12_n73(x)
+    else
+        fun_l12_n981(x)
+    end
+end
+
+def fun_l11_n383(x)
+    if (x < 1)
+        fun_l12_n59(x)
+    else
+        fun_l12_n274(x)
+    end
+end
+
+def fun_l11_n384(x)
+    if (x < 1)
+        fun_l12_n242(x)
+    else
+        fun_l12_n631(x)
+    end
+end
+
+def fun_l11_n385(x)
+    if (x < 1)
+        fun_l12_n933(x)
+    else
+        fun_l12_n678(x)
+    end
+end
+
+def fun_l11_n386(x)
+    if (x < 1)
+        fun_l12_n695(x)
+    else
+        fun_l12_n766(x)
+    end
+end
+
+def fun_l11_n387(x)
+    if (x < 1)
+        fun_l12_n49(x)
+    else
+        fun_l12_n459(x)
+    end
+end
+
+def fun_l11_n388(x)
+    if (x < 1)
+        fun_l12_n751(x)
+    else
+        fun_l12_n594(x)
+    end
+end
+
+def fun_l11_n389(x)
+    if (x < 1)
+        fun_l12_n149(x)
+    else
+        fun_l12_n290(x)
+    end
+end
+
+def fun_l11_n390(x)
+    if (x < 1)
+        fun_l12_n307(x)
+    else
+        fun_l12_n723(x)
+    end
+end
+
+def fun_l11_n391(x)
+    if (x < 1)
+        fun_l12_n606(x)
+    else
+        fun_l12_n97(x)
+    end
+end
+
+def fun_l11_n392(x)
+    if (x < 1)
+        fun_l12_n31(x)
+    else
+        fun_l12_n610(x)
+    end
+end
+
+def fun_l11_n393(x)
+    if (x < 1)
+        fun_l12_n798(x)
+    else
+        fun_l12_n940(x)
+    end
+end
+
+def fun_l11_n394(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n79(x)
+    end
+end
+
+def fun_l11_n395(x)
+    if (x < 1)
+        fun_l12_n230(x)
+    else
+        fun_l12_n72(x)
+    end
+end
+
+def fun_l11_n396(x)
+    if (x < 1)
+        fun_l12_n506(x)
+    else
+        fun_l12_n433(x)
+    end
+end
+
+def fun_l11_n397(x)
+    if (x < 1)
+        fun_l12_n410(x)
+    else
+        fun_l12_n648(x)
+    end
+end
+
+def fun_l11_n398(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n630(x)
+    end
+end
+
+def fun_l11_n399(x)
+    if (x < 1)
+        fun_l12_n394(x)
+    else
+        fun_l12_n220(x)
+    end
+end
+
+def fun_l11_n400(x)
+    if (x < 1)
+        fun_l12_n761(x)
+    else
+        fun_l12_n407(x)
+    end
+end
+
+def fun_l11_n401(x)
+    if (x < 1)
+        fun_l12_n386(x)
+    else
+        fun_l12_n411(x)
+    end
+end
+
+def fun_l11_n402(x)
+    if (x < 1)
+        fun_l12_n290(x)
+    else
+        fun_l12_n334(x)
+    end
+end
+
+def fun_l11_n403(x)
+    if (x < 1)
+        fun_l12_n600(x)
+    else
+        fun_l12_n282(x)
+    end
+end
+
+def fun_l11_n404(x)
+    if (x < 1)
+        fun_l12_n334(x)
+    else
+        fun_l12_n214(x)
+    end
+end
+
+def fun_l11_n405(x)
+    if (x < 1)
+        fun_l12_n103(x)
+    else
+        fun_l12_n188(x)
+    end
+end
+
+def fun_l11_n406(x)
+    if (x < 1)
+        fun_l12_n755(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n407(x)
+    if (x < 1)
+        fun_l12_n269(x)
+    else
+        fun_l12_n579(x)
+    end
+end
+
+def fun_l11_n408(x)
+    if (x < 1)
+        fun_l12_n54(x)
+    else
+        fun_l12_n961(x)
+    end
+end
+
+def fun_l11_n409(x)
+    if (x < 1)
+        fun_l12_n699(x)
+    else
+        fun_l12_n117(x)
+    end
+end
+
+def fun_l11_n410(x)
+    if (x < 1)
+        fun_l12_n802(x)
+    else
+        fun_l12_n65(x)
+    end
+end
+
+def fun_l11_n411(x)
+    if (x < 1)
+        fun_l12_n776(x)
+    else
+        fun_l12_n676(x)
+    end
+end
+
+def fun_l11_n412(x)
+    if (x < 1)
+        fun_l12_n520(x)
+    else
+        fun_l12_n447(x)
+    end
+end
+
+def fun_l11_n413(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n285(x)
+    end
+end
+
+def fun_l11_n414(x)
+    if (x < 1)
+        fun_l12_n797(x)
+    else
+        fun_l12_n590(x)
+    end
+end
+
+def fun_l11_n415(x)
+    if (x < 1)
+        fun_l12_n128(x)
+    else
+        fun_l12_n677(x)
+    end
+end
+
+def fun_l11_n416(x)
+    if (x < 1)
+        fun_l12_n422(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n417(x)
+    if (x < 1)
+        fun_l12_n159(x)
+    else
+        fun_l12_n722(x)
+    end
+end
+
+def fun_l11_n418(x)
+    if (x < 1)
+        fun_l12_n989(x)
+    else
+        fun_l12_n670(x)
+    end
+end
+
+def fun_l11_n419(x)
+    if (x < 1)
+        fun_l12_n952(x)
+    else
+        fun_l12_n65(x)
+    end
+end
+
+def fun_l11_n420(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n493(x)
+    end
+end
+
+def fun_l11_n421(x)
+    if (x < 1)
+        fun_l12_n897(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n422(x)
+    if (x < 1)
+        fun_l12_n557(x)
+    else
+        fun_l12_n545(x)
+    end
+end
+
+def fun_l11_n423(x)
+    if (x < 1)
+        fun_l12_n716(x)
+    else
+        fun_l12_n746(x)
+    end
+end
+
+def fun_l11_n424(x)
+    if (x < 1)
+        fun_l12_n335(x)
+    else
+        fun_l12_n968(x)
+    end
+end
+
+def fun_l11_n425(x)
+    if (x < 1)
+        fun_l12_n891(x)
+    else
+        fun_l12_n115(x)
+    end
+end
+
+def fun_l11_n426(x)
+    if (x < 1)
+        fun_l12_n757(x)
+    else
+        fun_l12_n750(x)
+    end
+end
+
+def fun_l11_n427(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n428(x)
+    if (x < 1)
+        fun_l12_n249(x)
+    else
+        fun_l12_n347(x)
+    end
+end
+
+def fun_l11_n429(x)
+    if (x < 1)
+        fun_l12_n234(x)
+    else
+        fun_l12_n154(x)
+    end
+end
+
+def fun_l11_n430(x)
+    if (x < 1)
+        fun_l12_n890(x)
+    else
+        fun_l12_n40(x)
+    end
+end
+
+def fun_l11_n431(x)
+    if (x < 1)
+        fun_l12_n804(x)
+    else
+        fun_l12_n90(x)
+    end
+end
+
+def fun_l11_n432(x)
+    if (x < 1)
+        fun_l12_n936(x)
+    else
+        fun_l12_n127(x)
+    end
+end
+
+def fun_l11_n433(x)
+    if (x < 1)
+        fun_l12_n551(x)
+    else
+        fun_l12_n404(x)
+    end
+end
+
+def fun_l11_n434(x)
+    if (x < 1)
+        fun_l12_n246(x)
+    else
+        fun_l12_n759(x)
+    end
+end
+
+def fun_l11_n435(x)
+    if (x < 1)
+        fun_l12_n708(x)
+    else
+        fun_l12_n735(x)
+    end
+end
+
+def fun_l11_n436(x)
+    if (x < 1)
+        fun_l12_n535(x)
+    else
+        fun_l12_n785(x)
+    end
+end
+
+def fun_l11_n437(x)
+    if (x < 1)
+        fun_l12_n322(x)
+    else
+        fun_l12_n629(x)
+    end
+end
+
+def fun_l11_n438(x)
+    if (x < 1)
+        fun_l12_n986(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n439(x)
+    if (x < 1)
+        fun_l12_n147(x)
+    else
+        fun_l12_n582(x)
+    end
+end
+
+def fun_l11_n440(x)
+    if (x < 1)
+        fun_l12_n375(x)
+    else
+        fun_l12_n667(x)
+    end
+end
+
+def fun_l11_n441(x)
+    if (x < 1)
+        fun_l12_n467(x)
+    else
+        fun_l12_n994(x)
+    end
+end
+
+def fun_l11_n442(x)
+    if (x < 1)
+        fun_l12_n176(x)
+    else
+        fun_l12_n558(x)
+    end
+end
+
+def fun_l11_n443(x)
+    if (x < 1)
+        fun_l12_n452(x)
+    else
+        fun_l12_n37(x)
+    end
+end
+
+def fun_l11_n444(x)
+    if (x < 1)
+        fun_l12_n701(x)
+    else
+        fun_l12_n382(x)
+    end
+end
+
+def fun_l11_n445(x)
+    if (x < 1)
+        fun_l12_n881(x)
+    else
+        fun_l12_n896(x)
+    end
+end
+
+def fun_l11_n446(x)
+    if (x < 1)
+        fun_l12_n901(x)
+    else
+        fun_l12_n822(x)
+    end
+end
+
+def fun_l11_n447(x)
+    if (x < 1)
+        fun_l12_n6(x)
+    else
+        fun_l12_n648(x)
+    end
+end
+
+def fun_l11_n448(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n682(x)
+    end
+end
+
+def fun_l11_n449(x)
+    if (x < 1)
+        fun_l12_n675(x)
+    else
+        fun_l12_n379(x)
+    end
+end
+
+def fun_l11_n450(x)
+    if (x < 1)
+        fun_l12_n254(x)
+    else
+        fun_l12_n475(x)
+    end
+end
+
+def fun_l11_n451(x)
+    if (x < 1)
+        fun_l12_n951(x)
+    else
+        fun_l12_n947(x)
+    end
+end
+
+def fun_l11_n452(x)
+    if (x < 1)
+        fun_l12_n909(x)
+    else
+        fun_l12_n703(x)
+    end
+end
+
+def fun_l11_n453(x)
+    if (x < 1)
+        fun_l12_n555(x)
+    else
+        fun_l12_n862(x)
+    end
+end
+
+def fun_l11_n454(x)
+    if (x < 1)
+        fun_l12_n379(x)
+    else
+        fun_l12_n852(x)
+    end
+end
+
+def fun_l11_n455(x)
+    if (x < 1)
+        fun_l12_n85(x)
+    else
+        fun_l12_n219(x)
+    end
+end
+
+def fun_l11_n456(x)
+    if (x < 1)
+        fun_l12_n84(x)
+    else
+        fun_l12_n678(x)
+    end
+end
+
+def fun_l11_n457(x)
+    if (x < 1)
+        fun_l12_n663(x)
+    else
+        fun_l12_n637(x)
+    end
+end
+
+def fun_l11_n458(x)
+    if (x < 1)
+        fun_l12_n627(x)
+    else
+        fun_l12_n764(x)
+    end
+end
+
+def fun_l11_n459(x)
+    if (x < 1)
+        fun_l12_n3(x)
+    else
+        fun_l12_n419(x)
+    end
+end
+
+def fun_l11_n460(x)
+    if (x < 1)
+        fun_l12_n69(x)
+    else
+        fun_l12_n802(x)
+    end
+end
+
+def fun_l11_n461(x)
+    if (x < 1)
+        fun_l12_n708(x)
+    else
+        fun_l12_n304(x)
+    end
+end
+
+def fun_l11_n462(x)
+    if (x < 1)
+        fun_l12_n323(x)
+    else
+        fun_l12_n92(x)
+    end
+end
+
+def fun_l11_n463(x)
+    if (x < 1)
+        fun_l12_n987(x)
+    else
+        fun_l12_n434(x)
+    end
+end
+
+def fun_l11_n464(x)
+    if (x < 1)
+        fun_l12_n532(x)
+    else
+        fun_l12_n82(x)
+    end
+end
+
+def fun_l11_n465(x)
+    if (x < 1)
+        fun_l12_n664(x)
+    else
+        fun_l12_n982(x)
+    end
+end
+
+def fun_l11_n466(x)
+    if (x < 1)
+        fun_l12_n488(x)
+    else
+        fun_l12_n799(x)
+    end
+end
+
+def fun_l11_n467(x)
+    if (x < 1)
+        fun_l12_n882(x)
+    else
+        fun_l12_n948(x)
+    end
+end
+
+def fun_l11_n468(x)
+    if (x < 1)
+        fun_l12_n585(x)
+    else
+        fun_l12_n528(x)
+    end
+end
+
+def fun_l11_n469(x)
+    if (x < 1)
+        fun_l12_n318(x)
+    else
+        fun_l12_n233(x)
+    end
+end
+
+def fun_l11_n470(x)
+    if (x < 1)
+        fun_l12_n537(x)
+    else
+        fun_l12_n803(x)
+    end
+end
+
+def fun_l11_n471(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n298(x)
+    end
+end
+
+def fun_l11_n472(x)
+    if (x < 1)
+        fun_l12_n266(x)
+    else
+        fun_l12_n345(x)
+    end
+end
+
+def fun_l11_n473(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n713(x)
+    end
+end
+
+def fun_l11_n474(x)
+    if (x < 1)
+        fun_l12_n352(x)
+    else
+        fun_l12_n12(x)
+    end
+end
+
+def fun_l11_n475(x)
+    if (x < 1)
+        fun_l12_n23(x)
+    else
+        fun_l12_n715(x)
+    end
+end
+
+def fun_l11_n476(x)
+    if (x < 1)
+        fun_l12_n342(x)
+    else
+        fun_l12_n323(x)
+    end
+end
+
+def fun_l11_n477(x)
+    if (x < 1)
+        fun_l12_n563(x)
+    else
+        fun_l12_n905(x)
+    end
+end
+
+def fun_l11_n478(x)
+    if (x < 1)
+        fun_l12_n313(x)
+    else
+        fun_l12_n489(x)
+    end
+end
+
+def fun_l11_n479(x)
+    if (x < 1)
+        fun_l12_n75(x)
+    else
+        fun_l12_n291(x)
+    end
+end
+
+def fun_l11_n480(x)
+    if (x < 1)
+        fun_l12_n693(x)
+    else
+        fun_l12_n991(x)
+    end
+end
+
+def fun_l11_n481(x)
+    if (x < 1)
+        fun_l12_n246(x)
+    else
+        fun_l12_n664(x)
+    end
+end
+
+def fun_l11_n482(x)
+    if (x < 1)
+        fun_l12_n524(x)
+    else
+        fun_l12_n1(x)
+    end
+end
+
+def fun_l11_n483(x)
+    if (x < 1)
+        fun_l12_n712(x)
+    else
+        fun_l12_n289(x)
+    end
+end
+
+def fun_l11_n484(x)
+    if (x < 1)
+        fun_l12_n435(x)
+    else
+        fun_l12_n163(x)
+    end
+end
+
+def fun_l11_n485(x)
+    if (x < 1)
+        fun_l12_n338(x)
+    else
+        fun_l12_n883(x)
+    end
+end
+
+def fun_l11_n486(x)
+    if (x < 1)
+        fun_l12_n958(x)
+    else
+        fun_l12_n143(x)
+    end
+end
+
+def fun_l11_n487(x)
+    if (x < 1)
+        fun_l12_n22(x)
+    else
+        fun_l12_n674(x)
+    end
+end
+
+def fun_l11_n488(x)
+    if (x < 1)
+        fun_l12_n905(x)
+    else
+        fun_l12_n955(x)
+    end
+end
+
+def fun_l11_n489(x)
+    if (x < 1)
+        fun_l12_n590(x)
+    else
+        fun_l12_n623(x)
+    end
+end
+
+def fun_l11_n490(x)
+    if (x < 1)
+        fun_l12_n434(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n491(x)
+    if (x < 1)
+        fun_l12_n274(x)
+    else
+        fun_l12_n879(x)
+    end
+end
+
+def fun_l11_n492(x)
+    if (x < 1)
+        fun_l12_n639(x)
+    else
+        fun_l12_n915(x)
+    end
+end
+
+def fun_l11_n493(x)
+    if (x < 1)
+        fun_l12_n547(x)
+    else
+        fun_l12_n87(x)
+    end
+end
+
+def fun_l11_n494(x)
+    if (x < 1)
+        fun_l12_n364(x)
+    else
+        fun_l12_n133(x)
+    end
+end
+
+def fun_l11_n495(x)
+    if (x < 1)
+        fun_l12_n568(x)
+    else
+        fun_l12_n449(x)
+    end
+end
+
+def fun_l11_n496(x)
+    if (x < 1)
+        fun_l12_n751(x)
+    else
+        fun_l12_n580(x)
+    end
+end
+
+def fun_l11_n497(x)
+    if (x < 1)
+        fun_l12_n864(x)
+    else
+        fun_l12_n505(x)
+    end
+end
+
+def fun_l11_n498(x)
+    if (x < 1)
+        fun_l12_n68(x)
+    else
+        fun_l12_n280(x)
+    end
+end
+
+def fun_l11_n499(x)
+    if (x < 1)
+        fun_l12_n821(x)
+    else
+        fun_l12_n816(x)
+    end
+end
+
+def fun_l11_n500(x)
+    if (x < 1)
+        fun_l12_n793(x)
+    else
+        fun_l12_n558(x)
+    end
+end
+
+def fun_l11_n501(x)
+    if (x < 1)
+        fun_l12_n460(x)
+    else
+        fun_l12_n358(x)
+    end
+end
+
+def fun_l11_n502(x)
+    if (x < 1)
+        fun_l12_n99(x)
+    else
+        fun_l12_n149(x)
+    end
+end
+
+def fun_l11_n503(x)
+    if (x < 1)
+        fun_l12_n599(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n504(x)
+    if (x < 1)
+        fun_l12_n853(x)
+    else
+        fun_l12_n477(x)
+    end
+end
+
+def fun_l11_n505(x)
+    if (x < 1)
+        fun_l12_n845(x)
+    else
+        fun_l12_n776(x)
+    end
+end
+
+def fun_l11_n506(x)
+    if (x < 1)
+        fun_l12_n533(x)
+    else
+        fun_l12_n6(x)
+    end
+end
+
+def fun_l11_n507(x)
+    if (x < 1)
+        fun_l12_n700(x)
+    else
+        fun_l12_n47(x)
+    end
+end
+
+def fun_l11_n508(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n261(x)
+    end
+end
+
+def fun_l11_n509(x)
+    if (x < 1)
+        fun_l12_n773(x)
+    else
+        fun_l12_n583(x)
+    end
+end
+
+def fun_l11_n510(x)
+    if (x < 1)
+        fun_l12_n252(x)
+    else
+        fun_l12_n215(x)
+    end
+end
+
+def fun_l11_n511(x)
+    if (x < 1)
+        fun_l12_n280(x)
+    else
+        fun_l12_n589(x)
+    end
+end
+
+def fun_l11_n512(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n803(x)
+    end
+end
+
+def fun_l11_n513(x)
+    if (x < 1)
+        fun_l12_n450(x)
+    else
+        fun_l12_n606(x)
+    end
+end
+
+def fun_l11_n514(x)
+    if (x < 1)
+        fun_l12_n509(x)
+    else
+        fun_l12_n521(x)
+    end
+end
+
+def fun_l11_n515(x)
+    if (x < 1)
+        fun_l12_n658(x)
+    else
+        fun_l12_n912(x)
+    end
+end
+
+def fun_l11_n516(x)
+    if (x < 1)
+        fun_l12_n181(x)
+    else
+        fun_l12_n724(x)
+    end
+end
+
+def fun_l11_n517(x)
+    if (x < 1)
+        fun_l12_n167(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n518(x)
+    if (x < 1)
+        fun_l12_n654(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n519(x)
+    if (x < 1)
+        fun_l12_n192(x)
+    else
+        fun_l12_n110(x)
+    end
+end
+
+def fun_l11_n520(x)
+    if (x < 1)
+        fun_l12_n271(x)
+    else
+        fun_l12_n74(x)
+    end
+end
+
+def fun_l11_n521(x)
+    if (x < 1)
+        fun_l12_n324(x)
+    else
+        fun_l12_n224(x)
+    end
+end
+
+def fun_l11_n522(x)
+    if (x < 1)
+        fun_l12_n535(x)
+    else
+        fun_l12_n537(x)
+    end
+end
+
+def fun_l11_n523(x)
+    if (x < 1)
+        fun_l12_n103(x)
+    else
+        fun_l12_n942(x)
+    end
+end
+
+def fun_l11_n524(x)
+    if (x < 1)
+        fun_l12_n755(x)
+    else
+        fun_l12_n431(x)
+    end
+end
+
+def fun_l11_n525(x)
+    if (x < 1)
+        fun_l12_n243(x)
+    else
+        fun_l12_n131(x)
+    end
+end
+
+def fun_l11_n526(x)
+    if (x < 1)
+        fun_l12_n270(x)
+    else
+        fun_l12_n747(x)
+    end
+end
+
+def fun_l11_n527(x)
+    if (x < 1)
+        fun_l12_n566(x)
+    else
+        fun_l12_n284(x)
+    end
+end
+
+def fun_l11_n528(x)
+    if (x < 1)
+        fun_l12_n510(x)
+    else
+        fun_l12_n928(x)
+    end
+end
+
+def fun_l11_n529(x)
+    if (x < 1)
+        fun_l12_n354(x)
+    else
+        fun_l12_n1(x)
+    end
+end
+
+def fun_l11_n530(x)
+    if (x < 1)
+        fun_l12_n271(x)
+    else
+        fun_l12_n875(x)
+    end
+end
+
+def fun_l11_n531(x)
+    if (x < 1)
+        fun_l12_n871(x)
+    else
+        fun_l12_n441(x)
+    end
+end
+
+def fun_l11_n532(x)
+    if (x < 1)
+        fun_l12_n727(x)
+    else
+        fun_l12_n903(x)
+    end
+end
+
+def fun_l11_n533(x)
+    if (x < 1)
+        fun_l12_n843(x)
+    else
+        fun_l12_n202(x)
+    end
+end
+
+def fun_l11_n534(x)
+    if (x < 1)
+        fun_l12_n798(x)
+    else
+        fun_l12_n309(x)
+    end
+end
+
+def fun_l11_n535(x)
+    if (x < 1)
+        fun_l12_n397(x)
+    else
+        fun_l12_n377(x)
+    end
+end
+
+def fun_l11_n536(x)
+    if (x < 1)
+        fun_l12_n441(x)
+    else
+        fun_l12_n253(x)
+    end
+end
+
+def fun_l11_n537(x)
+    if (x < 1)
+        fun_l12_n861(x)
+    else
+        fun_l12_n84(x)
+    end
+end
+
+def fun_l11_n538(x)
+    if (x < 1)
+        fun_l12_n268(x)
+    else
+        fun_l12_n627(x)
+    end
+end
+
+def fun_l11_n539(x)
+    if (x < 1)
+        fun_l12_n923(x)
+    else
+        fun_l12_n650(x)
+    end
+end
+
+def fun_l11_n540(x)
+    if (x < 1)
+        fun_l12_n503(x)
+    else
+        fun_l12_n598(x)
+    end
+end
+
+def fun_l11_n541(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n201(x)
+    end
+end
+
+def fun_l11_n542(x)
+    if (x < 1)
+        fun_l12_n956(x)
+    else
+        fun_l12_n789(x)
+    end
+end
+
+def fun_l11_n543(x)
+    if (x < 1)
+        fun_l12_n438(x)
+    else
+        fun_l12_n47(x)
+    end
+end
+
+def fun_l11_n544(x)
+    if (x < 1)
+        fun_l12_n425(x)
+    else
+        fun_l12_n109(x)
+    end
+end
+
+def fun_l11_n545(x)
+    if (x < 1)
+        fun_l12_n540(x)
+    else
+        fun_l12_n360(x)
+    end
+end
+
+def fun_l11_n546(x)
+    if (x < 1)
+        fun_l12_n228(x)
+    else
+        fun_l12_n270(x)
+    end
+end
+
+def fun_l11_n547(x)
+    if (x < 1)
+        fun_l12_n528(x)
+    else
+        fun_l12_n423(x)
+    end
+end
+
+def fun_l11_n548(x)
+    if (x < 1)
+        fun_l12_n656(x)
+    else
+        fun_l12_n269(x)
+    end
+end
+
+def fun_l11_n549(x)
+    if (x < 1)
+        fun_l12_n541(x)
+    else
+        fun_l12_n488(x)
+    end
+end
+
+def fun_l11_n550(x)
+    if (x < 1)
+        fun_l12_n240(x)
+    else
+        fun_l12_n990(x)
+    end
+end
+
+def fun_l11_n551(x)
+    if (x < 1)
+        fun_l12_n279(x)
+    else
+        fun_l12_n61(x)
+    end
+end
+
+def fun_l11_n552(x)
+    if (x < 1)
+        fun_l12_n996(x)
+    else
+        fun_l12_n738(x)
+    end
+end
+
+def fun_l11_n553(x)
+    if (x < 1)
+        fun_l12_n334(x)
+    else
+        fun_l12_n117(x)
+    end
+end
+
+def fun_l11_n554(x)
+    if (x < 1)
+        fun_l12_n943(x)
+    else
+        fun_l12_n754(x)
+    end
+end
+
+def fun_l11_n555(x)
+    if (x < 1)
+        fun_l12_n256(x)
+    else
+        fun_l12_n961(x)
+    end
+end
+
+def fun_l11_n556(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n378(x)
+    end
+end
+
+def fun_l11_n557(x)
+    if (x < 1)
+        fun_l12_n681(x)
+    else
+        fun_l12_n153(x)
+    end
+end
+
+def fun_l11_n558(x)
+    if (x < 1)
+        fun_l12_n145(x)
+    else
+        fun_l12_n951(x)
+    end
+end
+
+def fun_l11_n559(x)
+    if (x < 1)
+        fun_l12_n107(x)
+    else
+        fun_l12_n341(x)
+    end
+end
+
+def fun_l11_n560(x)
+    if (x < 1)
+        fun_l12_n570(x)
+    else
+        fun_l12_n152(x)
+    end
+end
+
+def fun_l11_n561(x)
+    if (x < 1)
+        fun_l12_n351(x)
+    else
+        fun_l12_n664(x)
+    end
+end
+
+def fun_l11_n562(x)
+    if (x < 1)
+        fun_l12_n825(x)
+    else
+        fun_l12_n226(x)
+    end
+end
+
+def fun_l11_n563(x)
+    if (x < 1)
+        fun_l12_n898(x)
+    else
+        fun_l12_n553(x)
+    end
+end
+
+def fun_l11_n564(x)
+    if (x < 1)
+        fun_l12_n122(x)
+    else
+        fun_l12_n618(x)
+    end
+end
+
+def fun_l11_n565(x)
+    if (x < 1)
+        fun_l12_n185(x)
+    else
+        fun_l12_n51(x)
+    end
+end
+
+def fun_l11_n566(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n567(x)
+    if (x < 1)
+        fun_l12_n471(x)
+    else
+        fun_l12_n28(x)
+    end
+end
+
+def fun_l11_n568(x)
+    if (x < 1)
+        fun_l12_n195(x)
+    else
+        fun_l12_n104(x)
+    end
+end
+
+def fun_l11_n569(x)
+    if (x < 1)
+        fun_l12_n556(x)
+    else
+        fun_l12_n242(x)
+    end
+end
+
+def fun_l11_n570(x)
+    if (x < 1)
+        fun_l12_n203(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n571(x)
+    if (x < 1)
+        fun_l12_n217(x)
+    else
+        fun_l12_n392(x)
+    end
+end
+
+def fun_l11_n572(x)
+    if (x < 1)
+        fun_l12_n223(x)
+    else
+        fun_l12_n176(x)
+    end
+end
+
+def fun_l11_n573(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n19(x)
+    end
+end
+
+def fun_l11_n574(x)
+    if (x < 1)
+        fun_l12_n799(x)
+    else
+        fun_l12_n652(x)
+    end
+end
+
+def fun_l11_n575(x)
+    if (x < 1)
+        fun_l12_n311(x)
+    else
+        fun_l12_n332(x)
+    end
+end
+
+def fun_l11_n576(x)
+    if (x < 1)
+        fun_l12_n928(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n577(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n931(x)
+    end
+end
+
+def fun_l11_n578(x)
+    if (x < 1)
+        fun_l12_n991(x)
+    else
+        fun_l12_n985(x)
+    end
+end
+
+def fun_l11_n579(x)
+    if (x < 1)
+        fun_l12_n246(x)
+    else
+        fun_l12_n253(x)
+    end
+end
+
+def fun_l11_n580(x)
+    if (x < 1)
+        fun_l12_n492(x)
+    else
+        fun_l12_n239(x)
+    end
+end
+
+def fun_l11_n581(x)
+    if (x < 1)
+        fun_l12_n428(x)
+    else
+        fun_l12_n351(x)
+    end
+end
+
+def fun_l11_n582(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n37(x)
+    end
+end
+
+def fun_l11_n583(x)
+    if (x < 1)
+        fun_l12_n809(x)
+    else
+        fun_l12_n527(x)
+    end
+end
+
+def fun_l11_n584(x)
+    if (x < 1)
+        fun_l12_n661(x)
+    else
+        fun_l12_n539(x)
+    end
+end
+
+def fun_l11_n585(x)
+    if (x < 1)
+        fun_l12_n696(x)
+    else
+        fun_l12_n190(x)
+    end
+end
+
+def fun_l11_n586(x)
+    if (x < 1)
+        fun_l12_n178(x)
+    else
+        fun_l12_n301(x)
+    end
+end
+
+def fun_l11_n587(x)
+    if (x < 1)
+        fun_l12_n316(x)
+    else
+        fun_l12_n731(x)
+    end
+end
+
+def fun_l11_n588(x)
+    if (x < 1)
+        fun_l12_n502(x)
+    else
+        fun_l12_n776(x)
+    end
+end
+
+def fun_l11_n589(x)
+    if (x < 1)
+        fun_l12_n273(x)
+    else
+        fun_l12_n268(x)
+    end
+end
+
+def fun_l11_n590(x)
+    if (x < 1)
+        fun_l12_n623(x)
+    else
+        fun_l12_n622(x)
+    end
+end
+
+def fun_l11_n591(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n694(x)
+    end
+end
+
+def fun_l11_n592(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n984(x)
+    end
+end
+
+def fun_l11_n593(x)
+    if (x < 1)
+        fun_l12_n790(x)
+    else
+        fun_l12_n547(x)
+    end
+end
+
+def fun_l11_n594(x)
+    if (x < 1)
+        fun_l12_n313(x)
+    else
+        fun_l12_n526(x)
+    end
+end
+
+def fun_l11_n595(x)
+    if (x < 1)
+        fun_l12_n239(x)
+    else
+        fun_l12_n821(x)
+    end
+end
+
+def fun_l11_n596(x)
+    if (x < 1)
+        fun_l12_n36(x)
+    else
+        fun_l12_n141(x)
+    end
+end
+
+def fun_l11_n597(x)
+    if (x < 1)
+        fun_l12_n450(x)
+    else
+        fun_l12_n65(x)
+    end
+end
+
+def fun_l11_n598(x)
+    if (x < 1)
+        fun_l12_n226(x)
+    else
+        fun_l12_n490(x)
+    end
+end
+
+def fun_l11_n599(x)
+    if (x < 1)
+        fun_l12_n716(x)
+    else
+        fun_l12_n7(x)
+    end
+end
+
+def fun_l11_n600(x)
+    if (x < 1)
+        fun_l12_n694(x)
+    else
+        fun_l12_n663(x)
+    end
+end
+
+def fun_l11_n601(x)
+    if (x < 1)
+        fun_l12_n690(x)
+    else
+        fun_l12_n256(x)
+    end
+end
+
+def fun_l11_n602(x)
+    if (x < 1)
+        fun_l12_n251(x)
+    else
+        fun_l12_n177(x)
+    end
+end
+
+def fun_l11_n603(x)
+    if (x < 1)
+        fun_l12_n659(x)
+    else
+        fun_l12_n732(x)
+    end
+end
+
+def fun_l11_n604(x)
+    if (x < 1)
+        fun_l12_n440(x)
+    else
+        fun_l12_n334(x)
+    end
+end
+
+def fun_l11_n605(x)
+    if (x < 1)
+        fun_l12_n396(x)
+    else
+        fun_l12_n931(x)
+    end
+end
+
+def fun_l11_n606(x)
+    if (x < 1)
+        fun_l12_n687(x)
+    else
+        fun_l12_n88(x)
+    end
+end
+
+def fun_l11_n607(x)
+    if (x < 1)
+        fun_l12_n647(x)
+    else
+        fun_l12_n799(x)
+    end
+end
+
+def fun_l11_n608(x)
+    if (x < 1)
+        fun_l12_n383(x)
+    else
+        fun_l12_n889(x)
+    end
+end
+
+def fun_l11_n609(x)
+    if (x < 1)
+        fun_l12_n174(x)
+    else
+        fun_l12_n121(x)
+    end
+end
+
+def fun_l11_n610(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n835(x)
+    end
+end
+
+def fun_l11_n611(x)
+    if (x < 1)
+        fun_l12_n684(x)
+    else
+        fun_l12_n625(x)
+    end
+end
+
+def fun_l11_n612(x)
+    if (x < 1)
+        fun_l12_n961(x)
+    else
+        fun_l12_n711(x)
+    end
+end
+
+def fun_l11_n613(x)
+    if (x < 1)
+        fun_l12_n15(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n614(x)
+    if (x < 1)
+        fun_l12_n378(x)
+    else
+        fun_l12_n809(x)
+    end
+end
+
+def fun_l11_n615(x)
+    if (x < 1)
+        fun_l12_n970(x)
+    else
+        fun_l12_n283(x)
+    end
+end
+
+def fun_l11_n616(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n949(x)
+    end
+end
+
+def fun_l11_n617(x)
+    if (x < 1)
+        fun_l12_n135(x)
+    else
+        fun_l12_n29(x)
+    end
+end
+
+def fun_l11_n618(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n834(x)
+    end
+end
+
+def fun_l11_n619(x)
+    if (x < 1)
+        fun_l12_n555(x)
+    else
+        fun_l12_n464(x)
+    end
+end
+
+def fun_l11_n620(x)
+    if (x < 1)
+        fun_l12_n414(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n621(x)
+    if (x < 1)
+        fun_l12_n964(x)
+    else
+        fun_l12_n311(x)
+    end
+end
+
+def fun_l11_n622(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n499(x)
+    end
+end
+
+def fun_l11_n623(x)
+    if (x < 1)
+        fun_l12_n441(x)
+    else
+        fun_l12_n124(x)
+    end
+end
+
+def fun_l11_n624(x)
+    if (x < 1)
+        fun_l12_n884(x)
+    else
+        fun_l12_n484(x)
+    end
+end
+
+def fun_l11_n625(x)
+    if (x < 1)
+        fun_l12_n878(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n626(x)
+    if (x < 1)
+        fun_l12_n918(x)
+    else
+        fun_l12_n481(x)
+    end
+end
+
+def fun_l11_n627(x)
+    if (x < 1)
+        fun_l12_n162(x)
+    else
+        fun_l12_n197(x)
+    end
+end
+
+def fun_l11_n628(x)
+    if (x < 1)
+        fun_l12_n852(x)
+    else
+        fun_l12_n874(x)
+    end
+end
+
+def fun_l11_n629(x)
+    if (x < 1)
+        fun_l12_n654(x)
+    else
+        fun_l12_n709(x)
+    end
+end
+
+def fun_l11_n630(x)
+    if (x < 1)
+        fun_l12_n819(x)
+    else
+        fun_l12_n325(x)
+    end
+end
+
+def fun_l11_n631(x)
+    if (x < 1)
+        fun_l12_n776(x)
+    else
+        fun_l12_n621(x)
+    end
+end
+
+def fun_l11_n632(x)
+    if (x < 1)
+        fun_l12_n648(x)
+    else
+        fun_l12_n53(x)
+    end
+end
+
+def fun_l11_n633(x)
+    if (x < 1)
+        fun_l12_n182(x)
+    else
+        fun_l12_n267(x)
+    end
+end
+
+def fun_l11_n634(x)
+    if (x < 1)
+        fun_l12_n17(x)
+    else
+        fun_l12_n415(x)
+    end
+end
+
+def fun_l11_n635(x)
+    if (x < 1)
+        fun_l12_n123(x)
+    else
+        fun_l12_n862(x)
+    end
+end
+
+def fun_l11_n636(x)
+    if (x < 1)
+        fun_l12_n594(x)
+    else
+        fun_l12_n878(x)
+    end
+end
+
+def fun_l11_n637(x)
+    if (x < 1)
+        fun_l12_n913(x)
+    else
+        fun_l12_n245(x)
+    end
+end
+
+def fun_l11_n638(x)
+    if (x < 1)
+        fun_l12_n976(x)
+    else
+        fun_l12_n19(x)
+    end
+end
+
+def fun_l11_n639(x)
+    if (x < 1)
+        fun_l12_n490(x)
+    else
+        fun_l12_n999(x)
+    end
+end
+
+def fun_l11_n640(x)
+    if (x < 1)
+        fun_l12_n345(x)
+    else
+        fun_l12_n585(x)
+    end
+end
+
+def fun_l11_n641(x)
+    if (x < 1)
+        fun_l12_n245(x)
+    else
+        fun_l12_n566(x)
+    end
+end
+
+def fun_l11_n642(x)
+    if (x < 1)
+        fun_l12_n680(x)
+    else
+        fun_l12_n77(x)
+    end
+end
+
+def fun_l11_n643(x)
+    if (x < 1)
+        fun_l12_n330(x)
+    else
+        fun_l12_n268(x)
+    end
+end
+
+def fun_l11_n644(x)
+    if (x < 1)
+        fun_l12_n651(x)
+    else
+        fun_l12_n386(x)
+    end
+end
+
+def fun_l11_n645(x)
+    if (x < 1)
+        fun_l12_n276(x)
+    else
+        fun_l12_n471(x)
+    end
+end
+
+def fun_l11_n646(x)
+    if (x < 1)
+        fun_l12_n784(x)
+    else
+        fun_l12_n892(x)
+    end
+end
+
+def fun_l11_n647(x)
+    if (x < 1)
+        fun_l12_n963(x)
+    else
+        fun_l12_n864(x)
+    end
+end
+
+def fun_l11_n648(x)
+    if (x < 1)
+        fun_l12_n58(x)
+    else
+        fun_l12_n252(x)
+    end
+end
+
+def fun_l11_n649(x)
+    if (x < 1)
+        fun_l12_n321(x)
+    else
+        fun_l12_n593(x)
+    end
+end
+
+def fun_l11_n650(x)
+    if (x < 1)
+        fun_l12_n598(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n651(x)
+    if (x < 1)
+        fun_l12_n201(x)
+    else
+        fun_l12_n760(x)
+    end
+end
+
+def fun_l11_n652(x)
+    if (x < 1)
+        fun_l12_n880(x)
+    else
+        fun_l12_n841(x)
+    end
+end
+
+def fun_l11_n653(x)
+    if (x < 1)
+        fun_l12_n61(x)
+    else
+        fun_l12_n403(x)
+    end
+end
+
+def fun_l11_n654(x)
+    if (x < 1)
+        fun_l12_n114(x)
+    else
+        fun_l12_n768(x)
+    end
+end
+
+def fun_l11_n655(x)
+    if (x < 1)
+        fun_l12_n511(x)
+    else
+        fun_l12_n521(x)
+    end
+end
+
+def fun_l11_n656(x)
+    if (x < 1)
+        fun_l12_n27(x)
+    else
+        fun_l12_n490(x)
+    end
+end
+
+def fun_l11_n657(x)
+    if (x < 1)
+        fun_l12_n217(x)
+    else
+        fun_l12_n547(x)
+    end
+end
+
+def fun_l11_n658(x)
+    if (x < 1)
+        fun_l12_n549(x)
+    else
+        fun_l12_n823(x)
+    end
+end
+
+def fun_l11_n659(x)
+    if (x < 1)
+        fun_l12_n327(x)
+    else
+        fun_l12_n529(x)
+    end
+end
+
+def fun_l11_n660(x)
+    if (x < 1)
+        fun_l12_n395(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n661(x)
+    if (x < 1)
+        fun_l12_n867(x)
+    else
+        fun_l12_n142(x)
+    end
+end
+
+def fun_l11_n662(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n311(x)
+    end
+end
+
+def fun_l11_n663(x)
+    if (x < 1)
+        fun_l12_n628(x)
+    else
+        fun_l12_n798(x)
+    end
+end
+
+def fun_l11_n664(x)
+    if (x < 1)
+        fun_l12_n260(x)
+    else
+        fun_l12_n607(x)
+    end
+end
+
+def fun_l11_n665(x)
+    if (x < 1)
+        fun_l12_n911(x)
+    else
+        fun_l12_n487(x)
+    end
+end
+
+def fun_l11_n666(x)
+    if (x < 1)
+        fun_l12_n340(x)
+    else
+        fun_l12_n23(x)
+    end
+end
+
+def fun_l11_n667(x)
+    if (x < 1)
+        fun_l12_n744(x)
+    else
+        fun_l12_n874(x)
+    end
+end
+
+def fun_l11_n668(x)
+    if (x < 1)
+        fun_l12_n53(x)
+    else
+        fun_l12_n203(x)
+    end
+end
+
+def fun_l11_n669(x)
+    if (x < 1)
+        fun_l12_n775(x)
+    else
+        fun_l12_n963(x)
+    end
+end
+
+def fun_l11_n670(x)
+    if (x < 1)
+        fun_l12_n922(x)
+    else
+        fun_l12_n0(x)
+    end
+end
+
+def fun_l11_n671(x)
+    if (x < 1)
+        fun_l12_n23(x)
+    else
+        fun_l12_n798(x)
+    end
+end
+
+def fun_l11_n672(x)
+    if (x < 1)
+        fun_l12_n453(x)
+    else
+        fun_l12_n667(x)
+    end
+end
+
+def fun_l11_n673(x)
+    if (x < 1)
+        fun_l12_n991(x)
+    else
+        fun_l12_n350(x)
+    end
+end
+
+def fun_l11_n674(x)
+    if (x < 1)
+        fun_l12_n865(x)
+    else
+        fun_l12_n95(x)
+    end
+end
+
+def fun_l11_n675(x)
+    if (x < 1)
+        fun_l12_n404(x)
+    else
+        fun_l12_n714(x)
+    end
+end
+
+def fun_l11_n676(x)
+    if (x < 1)
+        fun_l12_n576(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n677(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n453(x)
+    end
+end
+
+def fun_l11_n678(x)
+    if (x < 1)
+        fun_l12_n127(x)
+    else
+        fun_l12_n224(x)
+    end
+end
+
+def fun_l11_n679(x)
+    if (x < 1)
+        fun_l12_n658(x)
+    else
+        fun_l12_n11(x)
+    end
+end
+
+def fun_l11_n680(x)
+    if (x < 1)
+        fun_l12_n778(x)
+    else
+        fun_l12_n202(x)
+    end
+end
+
+def fun_l11_n681(x)
+    if (x < 1)
+        fun_l12_n745(x)
+    else
+        fun_l12_n690(x)
+    end
+end
+
+def fun_l11_n682(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n683(x)
+    if (x < 1)
+        fun_l12_n726(x)
+    else
+        fun_l12_n466(x)
+    end
+end
+
+def fun_l11_n684(x)
+    if (x < 1)
+        fun_l12_n709(x)
+    else
+        fun_l12_n287(x)
+    end
+end
+
+def fun_l11_n685(x)
+    if (x < 1)
+        fun_l12_n304(x)
+    else
+        fun_l12_n617(x)
+    end
+end
+
+def fun_l11_n686(x)
+    if (x < 1)
+        fun_l12_n834(x)
+    else
+        fun_l12_n240(x)
+    end
+end
+
+def fun_l11_n687(x)
+    if (x < 1)
+        fun_l12_n406(x)
+    else
+        fun_l12_n588(x)
+    end
+end
+
+def fun_l11_n688(x)
+    if (x < 1)
+        fun_l12_n308(x)
+    else
+        fun_l12_n790(x)
+    end
+end
+
+def fun_l11_n689(x)
+    if (x < 1)
+        fun_l12_n969(x)
+    else
+        fun_l12_n249(x)
+    end
+end
+
+def fun_l11_n690(x)
+    if (x < 1)
+        fun_l12_n760(x)
+    else
+        fun_l12_n807(x)
+    end
+end
+
+def fun_l11_n691(x)
+    if (x < 1)
+        fun_l12_n417(x)
+    else
+        fun_l12_n645(x)
+    end
+end
+
+def fun_l11_n692(x)
+    if (x < 1)
+        fun_l12_n722(x)
+    else
+        fun_l12_n614(x)
+    end
+end
+
+def fun_l11_n693(x)
+    if (x < 1)
+        fun_l12_n19(x)
+    else
+        fun_l12_n497(x)
+    end
+end
+
+def fun_l11_n694(x)
+    if (x < 1)
+        fun_l12_n580(x)
+    else
+        fun_l12_n76(x)
+    end
+end
+
+def fun_l11_n695(x)
+    if (x < 1)
+        fun_l12_n527(x)
+    else
+        fun_l12_n819(x)
+    end
+end
+
+def fun_l11_n696(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n906(x)
+    end
+end
+
+def fun_l11_n697(x)
+    if (x < 1)
+        fun_l12_n95(x)
+    else
+        fun_l12_n743(x)
+    end
+end
+
+def fun_l11_n698(x)
+    if (x < 1)
+        fun_l12_n544(x)
+    else
+        fun_l12_n265(x)
+    end
+end
+
+def fun_l11_n699(x)
+    if (x < 1)
+        fun_l12_n833(x)
+    else
+        fun_l12_n210(x)
+    end
+end
+
+def fun_l11_n700(x)
+    if (x < 1)
+        fun_l12_n865(x)
+    else
+        fun_l12_n318(x)
+    end
+end
+
+def fun_l11_n701(x)
+    if (x < 1)
+        fun_l12_n88(x)
+    else
+        fun_l12_n120(x)
+    end
+end
+
+def fun_l11_n702(x)
+    if (x < 1)
+        fun_l12_n165(x)
+    else
+        fun_l12_n671(x)
+    end
+end
+
+def fun_l11_n703(x)
+    if (x < 1)
+        fun_l12_n607(x)
+    else
+        fun_l12_n730(x)
+    end
+end
+
+def fun_l11_n704(x)
+    if (x < 1)
+        fun_l12_n690(x)
+    else
+        fun_l12_n553(x)
+    end
+end
+
+def fun_l11_n705(x)
+    if (x < 1)
+        fun_l12_n826(x)
+    else
+        fun_l12_n665(x)
+    end
+end
+
+def fun_l11_n706(x)
+    if (x < 1)
+        fun_l12_n125(x)
+    else
+        fun_l12_n167(x)
+    end
+end
+
+def fun_l11_n707(x)
+    if (x < 1)
+        fun_l12_n961(x)
+    else
+        fun_l12_n73(x)
+    end
+end
+
+def fun_l11_n708(x)
+    if (x < 1)
+        fun_l12_n446(x)
+    else
+        fun_l12_n373(x)
+    end
+end
+
+def fun_l11_n709(x)
+    if (x < 1)
+        fun_l12_n199(x)
+    else
+        fun_l12_n803(x)
+    end
+end
+
+def fun_l11_n710(x)
+    if (x < 1)
+        fun_l12_n960(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n711(x)
+    if (x < 1)
+        fun_l12_n602(x)
+    else
+        fun_l12_n896(x)
+    end
+end
+
+def fun_l11_n712(x)
+    if (x < 1)
+        fun_l12_n198(x)
+    else
+        fun_l12_n857(x)
+    end
+end
+
+def fun_l11_n713(x)
+    if (x < 1)
+        fun_l12_n19(x)
+    else
+        fun_l12_n938(x)
+    end
+end
+
+def fun_l11_n714(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n715(x)
+    if (x < 1)
+        fun_l12_n99(x)
+    else
+        fun_l12_n382(x)
+    end
+end
+
+def fun_l11_n716(x)
+    if (x < 1)
+        fun_l12_n623(x)
+    else
+        fun_l12_n461(x)
+    end
+end
+
+def fun_l11_n717(x)
+    if (x < 1)
+        fun_l12_n658(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n718(x)
+    if (x < 1)
+        fun_l12_n17(x)
+    else
+        fun_l12_n83(x)
+    end
+end
+
+def fun_l11_n719(x)
+    if (x < 1)
+        fun_l12_n439(x)
+    else
+        fun_l12_n747(x)
+    end
+end
+
+def fun_l11_n720(x)
+    if (x < 1)
+        fun_l12_n259(x)
+    else
+        fun_l12_n80(x)
+    end
+end
+
+def fun_l11_n721(x)
+    if (x < 1)
+        fun_l12_n749(x)
+    else
+        fun_l12_n108(x)
+    end
+end
+
+def fun_l11_n722(x)
+    if (x < 1)
+        fun_l12_n20(x)
+    else
+        fun_l12_n391(x)
+    end
+end
+
+def fun_l11_n723(x)
+    if (x < 1)
+        fun_l12_n181(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n724(x)
+    if (x < 1)
+        fun_l12_n426(x)
+    else
+        fun_l12_n109(x)
+    end
+end
+
+def fun_l11_n725(x)
+    if (x < 1)
+        fun_l12_n436(x)
+    else
+        fun_l12_n754(x)
+    end
+end
+
+def fun_l11_n726(x)
+    if (x < 1)
+        fun_l12_n496(x)
+    else
+        fun_l12_n265(x)
+    end
+end
+
+def fun_l11_n727(x)
+    if (x < 1)
+        fun_l12_n58(x)
+    else
+        fun_l12_n982(x)
+    end
+end
+
+def fun_l11_n728(x)
+    if (x < 1)
+        fun_l12_n236(x)
+    else
+        fun_l12_n152(x)
+    end
+end
+
+def fun_l11_n729(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n95(x)
+    end
+end
+
+def fun_l11_n730(x)
+    if (x < 1)
+        fun_l12_n696(x)
+    else
+        fun_l12_n263(x)
+    end
+end
+
+def fun_l11_n731(x)
+    if (x < 1)
+        fun_l12_n539(x)
+    else
+        fun_l12_n774(x)
+    end
+end
+
+def fun_l11_n732(x)
+    if (x < 1)
+        fun_l12_n788(x)
+    else
+        fun_l12_n454(x)
+    end
+end
+
+def fun_l11_n733(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n877(x)
+    end
+end
+
+def fun_l11_n734(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n222(x)
+    end
+end
+
+def fun_l11_n735(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n467(x)
+    end
+end
+
+def fun_l11_n736(x)
+    if (x < 1)
+        fun_l12_n220(x)
+    else
+        fun_l12_n214(x)
+    end
+end
+
+def fun_l11_n737(x)
+    if (x < 1)
+        fun_l12_n537(x)
+    else
+        fun_l12_n173(x)
+    end
+end
+
+def fun_l11_n738(x)
+    if (x < 1)
+        fun_l12_n897(x)
+    else
+        fun_l12_n515(x)
+    end
+end
+
+def fun_l11_n739(x)
+    if (x < 1)
+        fun_l12_n724(x)
+    else
+        fun_l12_n48(x)
+    end
+end
+
+def fun_l11_n740(x)
+    if (x < 1)
+        fun_l12_n61(x)
+    else
+        fun_l12_n963(x)
+    end
+end
+
+def fun_l11_n741(x)
+    if (x < 1)
+        fun_l12_n40(x)
+    else
+        fun_l12_n553(x)
+    end
+end
+
+def fun_l11_n742(x)
+    if (x < 1)
+        fun_l12_n361(x)
+    else
+        fun_l12_n975(x)
+    end
+end
+
+def fun_l11_n743(x)
+    if (x < 1)
+        fun_l12_n306(x)
+    else
+        fun_l12_n982(x)
+    end
+end
+
+def fun_l11_n744(x)
+    if (x < 1)
+        fun_l12_n951(x)
+    else
+        fun_l12_n590(x)
+    end
+end
+
+def fun_l11_n745(x)
+    if (x < 1)
+        fun_l12_n224(x)
+    else
+        fun_l12_n409(x)
+    end
+end
+
+def fun_l11_n746(x)
+    if (x < 1)
+        fun_l12_n24(x)
+    else
+        fun_l12_n249(x)
+    end
+end
+
+def fun_l11_n747(x)
+    if (x < 1)
+        fun_l12_n533(x)
+    else
+        fun_l12_n543(x)
+    end
+end
+
+def fun_l11_n748(x)
+    if (x < 1)
+        fun_l12_n616(x)
+    else
+        fun_l12_n63(x)
+    end
+end
+
+def fun_l11_n749(x)
+    if (x < 1)
+        fun_l12_n365(x)
+    else
+        fun_l12_n335(x)
+    end
+end
+
+def fun_l11_n750(x)
+    if (x < 1)
+        fun_l12_n134(x)
+    else
+        fun_l12_n363(x)
+    end
+end
+
+def fun_l11_n751(x)
+    if (x < 1)
+        fun_l12_n413(x)
+    else
+        fun_l12_n582(x)
+    end
+end
+
+def fun_l11_n752(x)
+    if (x < 1)
+        fun_l12_n987(x)
+    else
+        fun_l12_n948(x)
+    end
+end
+
+def fun_l11_n753(x)
+    if (x < 1)
+        fun_l12_n696(x)
+    else
+        fun_l12_n374(x)
+    end
+end
+
+def fun_l11_n754(x)
+    if (x < 1)
+        fun_l12_n730(x)
+    else
+        fun_l12_n345(x)
+    end
+end
+
+def fun_l11_n755(x)
+    if (x < 1)
+        fun_l12_n857(x)
+    else
+        fun_l12_n441(x)
+    end
+end
+
+def fun_l11_n756(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n39(x)
+    end
+end
+
+def fun_l11_n757(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n657(x)
+    end
+end
+
+def fun_l11_n758(x)
+    if (x < 1)
+        fun_l12_n470(x)
+    else
+        fun_l12_n650(x)
+    end
+end
+
+def fun_l11_n759(x)
+    if (x < 1)
+        fun_l12_n119(x)
+    else
+        fun_l12_n479(x)
+    end
+end
+
+def fun_l11_n760(x)
+    if (x < 1)
+        fun_l12_n429(x)
+    else
+        fun_l12_n922(x)
+    end
+end
+
+def fun_l11_n761(x)
+    if (x < 1)
+        fun_l12_n13(x)
+    else
+        fun_l12_n134(x)
+    end
+end
+
+def fun_l11_n762(x)
+    if (x < 1)
+        fun_l12_n797(x)
+    else
+        fun_l12_n223(x)
+    end
+end
+
+def fun_l11_n763(x)
+    if (x < 1)
+        fun_l12_n945(x)
+    else
+        fun_l12_n197(x)
+    end
+end
+
+def fun_l11_n764(x)
+    if (x < 1)
+        fun_l12_n612(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n765(x)
+    if (x < 1)
+        fun_l12_n478(x)
+    else
+        fun_l12_n972(x)
+    end
+end
+
+def fun_l11_n766(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n9(x)
+    end
+end
+
+def fun_l11_n767(x)
+    if (x < 1)
+        fun_l12_n247(x)
+    else
+        fun_l12_n730(x)
+    end
+end
+
+def fun_l11_n768(x)
+    if (x < 1)
+        fun_l12_n223(x)
+    else
+        fun_l12_n986(x)
+    end
+end
+
+def fun_l11_n769(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n527(x)
+    end
+end
+
+def fun_l11_n770(x)
+    if (x < 1)
+        fun_l12_n112(x)
+    else
+        fun_l12_n660(x)
+    end
+end
+
+def fun_l11_n771(x)
+    if (x < 1)
+        fun_l12_n457(x)
+    else
+        fun_l12_n733(x)
+    end
+end
+
+def fun_l11_n772(x)
+    if (x < 1)
+        fun_l12_n633(x)
+    else
+        fun_l12_n449(x)
+    end
+end
+
+def fun_l11_n773(x)
+    if (x < 1)
+        fun_l12_n910(x)
+    else
+        fun_l12_n329(x)
+    end
+end
+
+def fun_l11_n774(x)
+    if (x < 1)
+        fun_l12_n354(x)
+    else
+        fun_l12_n233(x)
+    end
+end
+
+def fun_l11_n775(x)
+    if (x < 1)
+        fun_l12_n887(x)
+    else
+        fun_l12_n100(x)
+    end
+end
+
+def fun_l11_n776(x)
+    if (x < 1)
+        fun_l12_n65(x)
+    else
+        fun_l12_n199(x)
+    end
+end
+
+def fun_l11_n777(x)
+    if (x < 1)
+        fun_l12_n978(x)
+    else
+        fun_l12_n364(x)
+    end
+end
+
+def fun_l11_n778(x)
+    if (x < 1)
+        fun_l12_n502(x)
+    else
+        fun_l12_n90(x)
+    end
+end
+
+def fun_l11_n779(x)
+    if (x < 1)
+        fun_l12_n37(x)
+    else
+        fun_l12_n668(x)
+    end
+end
+
+def fun_l11_n780(x)
+    if (x < 1)
+        fun_l12_n80(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n781(x)
+    if (x < 1)
+        fun_l12_n435(x)
+    else
+        fun_l12_n583(x)
+    end
+end
+
+def fun_l11_n782(x)
+    if (x < 1)
+        fun_l12_n899(x)
+    else
+        fun_l12_n863(x)
+    end
+end
+
+def fun_l11_n783(x)
+    if (x < 1)
+        fun_l12_n414(x)
+    else
+        fun_l12_n96(x)
+    end
+end
+
+def fun_l11_n784(x)
+    if (x < 1)
+        fun_l12_n286(x)
+    else
+        fun_l12_n126(x)
+    end
+end
+
+def fun_l11_n785(x)
+    if (x < 1)
+        fun_l12_n444(x)
+    else
+        fun_l12_n344(x)
+    end
+end
+
+def fun_l11_n786(x)
+    if (x < 1)
+        fun_l12_n484(x)
+    else
+        fun_l12_n469(x)
+    end
+end
+
+def fun_l11_n787(x)
+    if (x < 1)
+        fun_l12_n686(x)
+    else
+        fun_l12_n728(x)
+    end
+end
+
+def fun_l11_n788(x)
+    if (x < 1)
+        fun_l12_n938(x)
+    else
+        fun_l12_n70(x)
+    end
+end
+
+def fun_l11_n789(x)
+    if (x < 1)
+        fun_l12_n958(x)
+    else
+        fun_l12_n633(x)
+    end
+end
+
+def fun_l11_n790(x)
+    if (x < 1)
+        fun_l12_n984(x)
+    else
+        fun_l12_n39(x)
+    end
+end
+
+def fun_l11_n791(x)
+    if (x < 1)
+        fun_l12_n877(x)
+    else
+        fun_l12_n721(x)
+    end
+end
+
+def fun_l11_n792(x)
+    if (x < 1)
+        fun_l12_n710(x)
+    else
+        fun_l12_n840(x)
+    end
+end
+
+def fun_l11_n793(x)
+    if (x < 1)
+        fun_l12_n955(x)
+    else
+        fun_l12_n774(x)
+    end
+end
+
+def fun_l11_n794(x)
+    if (x < 1)
+        fun_l12_n816(x)
+    else
+        fun_l12_n859(x)
+    end
+end
+
+def fun_l11_n795(x)
+    if (x < 1)
+        fun_l12_n722(x)
+    else
+        fun_l12_n700(x)
+    end
+end
+
+def fun_l11_n796(x)
+    if (x < 1)
+        fun_l12_n508(x)
+    else
+        fun_l12_n617(x)
+    end
+end
+
+def fun_l11_n797(x)
+    if (x < 1)
+        fun_l12_n382(x)
+    else
+        fun_l12_n1(x)
+    end
+end
+
+def fun_l11_n798(x)
+    if (x < 1)
+        fun_l12_n857(x)
+    else
+        fun_l12_n141(x)
+    end
+end
+
+def fun_l11_n799(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n842(x)
+    end
+end
+
+def fun_l11_n800(x)
+    if (x < 1)
+        fun_l12_n588(x)
+    else
+        fun_l12_n511(x)
+    end
+end
+
+def fun_l11_n801(x)
+    if (x < 1)
+        fun_l12_n114(x)
+    else
+        fun_l12_n516(x)
+    end
+end
+
+def fun_l11_n802(x)
+    if (x < 1)
+        fun_l12_n792(x)
+    else
+        fun_l12_n128(x)
+    end
+end
+
+def fun_l11_n803(x)
+    if (x < 1)
+        fun_l12_n833(x)
+    else
+        fun_l12_n444(x)
+    end
+end
+
+def fun_l11_n804(x)
+    if (x < 1)
+        fun_l12_n564(x)
+    else
+        fun_l12_n129(x)
+    end
+end
+
+def fun_l11_n805(x)
+    if (x < 1)
+        fun_l12_n234(x)
+    else
+        fun_l12_n429(x)
+    end
+end
+
+def fun_l11_n806(x)
+    if (x < 1)
+        fun_l12_n841(x)
+    else
+        fun_l12_n705(x)
+    end
+end
+
+def fun_l11_n807(x)
+    if (x < 1)
+        fun_l12_n72(x)
+    else
+        fun_l12_n87(x)
+    end
+end
+
+def fun_l11_n808(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n27(x)
+    end
+end
+
+def fun_l11_n809(x)
+    if (x < 1)
+        fun_l12_n136(x)
+    else
+        fun_l12_n84(x)
+    end
+end
+
+def fun_l11_n810(x)
+    if (x < 1)
+        fun_l12_n464(x)
+    else
+        fun_l12_n411(x)
+    end
+end
+
+def fun_l11_n811(x)
+    if (x < 1)
+        fun_l12_n939(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n812(x)
+    if (x < 1)
+        fun_l12_n24(x)
+    else
+        fun_l12_n593(x)
+    end
+end
+
+def fun_l11_n813(x)
+    if (x < 1)
+        fun_l12_n980(x)
+    else
+        fun_l12_n318(x)
+    end
+end
+
+def fun_l11_n814(x)
+    if (x < 1)
+        fun_l12_n73(x)
+    else
+        fun_l12_n431(x)
+    end
+end
+
+def fun_l11_n815(x)
+    if (x < 1)
+        fun_l12_n938(x)
+    else
+        fun_l12_n794(x)
+    end
+end
+
+def fun_l11_n816(x)
+    if (x < 1)
+        fun_l12_n305(x)
+    else
+        fun_l12_n620(x)
+    end
+end
+
+def fun_l11_n817(x)
+    if (x < 1)
+        fun_l12_n881(x)
+    else
+        fun_l12_n636(x)
+    end
+end
+
+def fun_l11_n818(x)
+    if (x < 1)
+        fun_l12_n493(x)
+    else
+        fun_l12_n536(x)
+    end
+end
+
+def fun_l11_n819(x)
+    if (x < 1)
+        fun_l12_n32(x)
+    else
+        fun_l12_n69(x)
+    end
+end
+
+def fun_l11_n820(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n206(x)
+    end
+end
+
+def fun_l11_n821(x)
+    if (x < 1)
+        fun_l12_n130(x)
+    else
+        fun_l12_n63(x)
+    end
+end
+
+def fun_l11_n822(x)
+    if (x < 1)
+        fun_l12_n228(x)
+    else
+        fun_l12_n753(x)
+    end
+end
+
+def fun_l11_n823(x)
+    if (x < 1)
+        fun_l12_n171(x)
+    else
+        fun_l12_n605(x)
+    end
+end
+
+def fun_l11_n824(x)
+    if (x < 1)
+        fun_l12_n69(x)
+    else
+        fun_l12_n900(x)
+    end
+end
+
+def fun_l11_n825(x)
+    if (x < 1)
+        fun_l12_n802(x)
+    else
+        fun_l12_n682(x)
+    end
+end
+
+def fun_l11_n826(x)
+    if (x < 1)
+        fun_l12_n311(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n827(x)
+    if (x < 1)
+        fun_l12_n994(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n828(x)
+    if (x < 1)
+        fun_l12_n780(x)
+    else
+        fun_l12_n805(x)
+    end
+end
+
+def fun_l11_n829(x)
+    if (x < 1)
+        fun_l12_n744(x)
+    else
+        fun_l12_n55(x)
+    end
+end
+
+def fun_l11_n830(x)
+    if (x < 1)
+        fun_l12_n655(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n831(x)
+    if (x < 1)
+        fun_l12_n245(x)
+    else
+        fun_l12_n196(x)
+    end
+end
+
+def fun_l11_n832(x)
+    if (x < 1)
+        fun_l12_n381(x)
+    else
+        fun_l12_n582(x)
+    end
+end
+
+def fun_l11_n833(x)
+    if (x < 1)
+        fun_l12_n185(x)
+    else
+        fun_l12_n339(x)
+    end
+end
+
+def fun_l11_n834(x)
+    if (x < 1)
+        fun_l12_n601(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n835(x)
+    if (x < 1)
+        fun_l12_n934(x)
+    else
+        fun_l12_n460(x)
+    end
+end
+
+def fun_l11_n836(x)
+    if (x < 1)
+        fun_l12_n550(x)
+    else
+        fun_l12_n55(x)
+    end
+end
+
+def fun_l11_n837(x)
+    if (x < 1)
+        fun_l12_n183(x)
+    else
+        fun_l12_n880(x)
+    end
+end
+
+def fun_l11_n838(x)
+    if (x < 1)
+        fun_l12_n742(x)
+    else
+        fun_l12_n249(x)
+    end
+end
+
+def fun_l11_n839(x)
+    if (x < 1)
+        fun_l12_n979(x)
+    else
+        fun_l12_n100(x)
+    end
+end
+
+def fun_l11_n840(x)
+    if (x < 1)
+        fun_l12_n889(x)
+    else
+        fun_l12_n683(x)
+    end
+end
+
+def fun_l11_n841(x)
+    if (x < 1)
+        fun_l12_n964(x)
+    else
+        fun_l12_n0(x)
+    end
+end
+
+def fun_l11_n842(x)
+    if (x < 1)
+        fun_l12_n461(x)
+    else
+        fun_l12_n126(x)
+    end
+end
+
+def fun_l11_n843(x)
+    if (x < 1)
+        fun_l12_n839(x)
+    else
+        fun_l12_n554(x)
+    end
+end
+
+def fun_l11_n844(x)
+    if (x < 1)
+        fun_l12_n150(x)
+    else
+        fun_l12_n857(x)
+    end
+end
+
+def fun_l11_n845(x)
+    if (x < 1)
+        fun_l12_n114(x)
+    else
+        fun_l12_n72(x)
+    end
+end
+
+def fun_l11_n846(x)
+    if (x < 1)
+        fun_l12_n953(x)
+    else
+        fun_l12_n695(x)
+    end
+end
+
+def fun_l11_n847(x)
+    if (x < 1)
+        fun_l12_n16(x)
+    else
+        fun_l12_n216(x)
+    end
+end
+
+def fun_l11_n848(x)
+    if (x < 1)
+        fun_l12_n440(x)
+    else
+        fun_l12_n893(x)
+    end
+end
+
+def fun_l11_n849(x)
+    if (x < 1)
+        fun_l12_n176(x)
+    else
+        fun_l12_n932(x)
+    end
+end
+
+def fun_l11_n850(x)
+    if (x < 1)
+        fun_l12_n723(x)
+    else
+        fun_l12_n363(x)
+    end
+end
+
+def fun_l11_n851(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n774(x)
+    end
+end
+
+def fun_l11_n852(x)
+    if (x < 1)
+        fun_l12_n618(x)
+    else
+        fun_l12_n252(x)
+    end
+end
+
+def fun_l11_n853(x)
+    if (x < 1)
+        fun_l12_n298(x)
+    else
+        fun_l12_n563(x)
+    end
+end
+
+def fun_l11_n854(x)
+    if (x < 1)
+        fun_l12_n972(x)
+    else
+        fun_l12_n681(x)
+    end
+end
+
+def fun_l11_n855(x)
+    if (x < 1)
+        fun_l12_n412(x)
+    else
+        fun_l12_n932(x)
+    end
+end
+
+def fun_l11_n856(x)
+    if (x < 1)
+        fun_l12_n132(x)
+    else
+        fun_l12_n699(x)
+    end
+end
+
+def fun_l11_n857(x)
+    if (x < 1)
+        fun_l12_n208(x)
+    else
+        fun_l12_n602(x)
+    end
+end
+
+def fun_l11_n858(x)
+    if (x < 1)
+        fun_l12_n705(x)
+    else
+        fun_l12_n833(x)
+    end
+end
+
+def fun_l11_n859(x)
+    if (x < 1)
+        fun_l12_n408(x)
+    else
+        fun_l12_n570(x)
+    end
+end
+
+def fun_l11_n860(x)
+    if (x < 1)
+        fun_l12_n720(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n861(x)
+    if (x < 1)
+        fun_l12_n926(x)
+    else
+        fun_l12_n490(x)
+    end
+end
+
+def fun_l11_n862(x)
+    if (x < 1)
+        fun_l12_n985(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n863(x)
+    if (x < 1)
+        fun_l12_n214(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n864(x)
+    if (x < 1)
+        fun_l12_n351(x)
+    else
+        fun_l12_n951(x)
+    end
+end
+
+def fun_l11_n865(x)
+    if (x < 1)
+        fun_l12_n514(x)
+    else
+        fun_l12_n468(x)
+    end
+end
+
+def fun_l11_n866(x)
+    if (x < 1)
+        fun_l12_n793(x)
+    else
+        fun_l12_n712(x)
+    end
+end
+
+def fun_l11_n867(x)
+    if (x < 1)
+        fun_l12_n697(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n868(x)
+    if (x < 1)
+        fun_l12_n144(x)
+    else
+        fun_l12_n703(x)
+    end
+end
+
+def fun_l11_n869(x)
+    if (x < 1)
+        fun_l12_n552(x)
+    else
+        fun_l12_n612(x)
+    end
+end
+
+def fun_l11_n870(x)
+    if (x < 1)
+        fun_l12_n2(x)
+    else
+        fun_l12_n287(x)
+    end
+end
+
+def fun_l11_n871(x)
+    if (x < 1)
+        fun_l12_n604(x)
+    else
+        fun_l12_n260(x)
+    end
+end
+
+def fun_l11_n872(x)
+    if (x < 1)
+        fun_l12_n517(x)
+    else
+        fun_l12_n173(x)
+    end
+end
+
+def fun_l11_n873(x)
+    if (x < 1)
+        fun_l12_n640(x)
+    else
+        fun_l12_n196(x)
+    end
+end
+
+def fun_l11_n874(x)
+    if (x < 1)
+        fun_l12_n874(x)
+    else
+        fun_l12_n697(x)
+    end
+end
+
+def fun_l11_n875(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n652(x)
+    end
+end
+
+def fun_l11_n876(x)
+    if (x < 1)
+        fun_l12_n432(x)
+    else
+        fun_l12_n971(x)
+    end
+end
+
+def fun_l11_n877(x)
+    if (x < 1)
+        fun_l12_n111(x)
+    else
+        fun_l12_n919(x)
+    end
+end
+
+def fun_l11_n878(x)
+    if (x < 1)
+        fun_l12_n631(x)
+    else
+        fun_l12_n439(x)
+    end
+end
+
+def fun_l11_n879(x)
+    if (x < 1)
+        fun_l12_n39(x)
+    else
+        fun_l12_n372(x)
+    end
+end
+
+def fun_l11_n880(x)
+    if (x < 1)
+        fun_l12_n675(x)
+    else
+        fun_l12_n64(x)
+    end
+end
+
+def fun_l11_n881(x)
+    if (x < 1)
+        fun_l12_n831(x)
+    else
+        fun_l12_n705(x)
+    end
+end
+
+def fun_l11_n882(x)
+    if (x < 1)
+        fun_l12_n126(x)
+    else
+        fun_l12_n648(x)
+    end
+end
+
+def fun_l11_n883(x)
+    if (x < 1)
+        fun_l12_n768(x)
+    else
+        fun_l12_n483(x)
+    end
+end
+
+def fun_l11_n884(x)
+    if (x < 1)
+        fun_l12_n328(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n885(x)
+    if (x < 1)
+        fun_l12_n890(x)
+    else
+        fun_l12_n544(x)
+    end
+end
+
+def fun_l11_n886(x)
+    if (x < 1)
+        fun_l12_n651(x)
+    else
+        fun_l12_n557(x)
+    end
+end
+
+def fun_l11_n887(x)
+    if (x < 1)
+        fun_l12_n479(x)
+    else
+        fun_l12_n594(x)
+    end
+end
+
+def fun_l11_n888(x)
+    if (x < 1)
+        fun_l12_n649(x)
+    else
+        fun_l12_n488(x)
+    end
+end
+
+def fun_l11_n889(x)
+    if (x < 1)
+        fun_l12_n347(x)
+    else
+        fun_l12_n42(x)
+    end
+end
+
+def fun_l11_n890(x)
+    if (x < 1)
+        fun_l12_n111(x)
+    else
+        fun_l12_n683(x)
+    end
+end
+
+def fun_l11_n891(x)
+    if (x < 1)
+        fun_l12_n965(x)
+    else
+        fun_l12_n275(x)
+    end
+end
+
+def fun_l11_n892(x)
+    if (x < 1)
+        fun_l12_n148(x)
+    else
+        fun_l12_n541(x)
+    end
+end
+
+def fun_l11_n893(x)
+    if (x < 1)
+        fun_l12_n633(x)
+    else
+        fun_l12_n358(x)
+    end
+end
+
+def fun_l11_n894(x)
+    if (x < 1)
+        fun_l12_n681(x)
+    else
+        fun_l12_n236(x)
+    end
+end
+
+def fun_l11_n895(x)
+    if (x < 1)
+        fun_l12_n292(x)
+    else
+        fun_l12_n417(x)
+    end
+end
+
+def fun_l11_n896(x)
+    if (x < 1)
+        fun_l12_n165(x)
+    else
+        fun_l12_n80(x)
+    end
+end
+
+def fun_l11_n897(x)
+    if (x < 1)
+        fun_l12_n132(x)
+    else
+        fun_l12_n659(x)
+    end
+end
+
+def fun_l11_n898(x)
+    if (x < 1)
+        fun_l12_n329(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n899(x)
+    if (x < 1)
+        fun_l12_n339(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n900(x)
+    if (x < 1)
+        fun_l12_n957(x)
+    else
+        fun_l12_n282(x)
+    end
+end
+
+def fun_l11_n901(x)
+    if (x < 1)
+        fun_l12_n709(x)
+    else
+        fun_l12_n155(x)
+    end
+end
+
+def fun_l11_n902(x)
+    if (x < 1)
+        fun_l12_n227(x)
+    else
+        fun_l12_n659(x)
+    end
+end
+
+def fun_l11_n903(x)
+    if (x < 1)
+        fun_l12_n224(x)
+    else
+        fun_l12_n23(x)
+    end
+end
+
+def fun_l11_n904(x)
+    if (x < 1)
+        fun_l12_n494(x)
+    else
+        fun_l12_n292(x)
+    end
+end
+
+def fun_l11_n905(x)
+    if (x < 1)
+        fun_l12_n309(x)
+    else
+        fun_l12_n949(x)
+    end
+end
+
+def fun_l11_n906(x)
+    if (x < 1)
+        fun_l12_n960(x)
+    else
+        fun_l12_n24(x)
+    end
+end
+
+def fun_l11_n907(x)
+    if (x < 1)
+        fun_l12_n98(x)
+    else
+        fun_l12_n674(x)
+    end
+end
+
+def fun_l11_n908(x)
+    if (x < 1)
+        fun_l12_n84(x)
+    else
+        fun_l12_n307(x)
+    end
+end
+
+def fun_l11_n909(x)
+    if (x < 1)
+        fun_l12_n786(x)
+    else
+        fun_l12_n311(x)
+    end
+end
+
+def fun_l11_n910(x)
+    if (x < 1)
+        fun_l12_n631(x)
+    else
+        fun_l12_n605(x)
+    end
+end
+
+def fun_l11_n911(x)
+    if (x < 1)
+        fun_l12_n352(x)
+    else
+        fun_l12_n750(x)
+    end
+end
+
+def fun_l11_n912(x)
+    if (x < 1)
+        fun_l12_n75(x)
+    else
+        fun_l12_n112(x)
+    end
+end
+
+def fun_l11_n913(x)
+    if (x < 1)
+        fun_l12_n404(x)
+    else
+        fun_l12_n995(x)
+    end
+end
+
+def fun_l11_n914(x)
+    if (x < 1)
+        fun_l12_n656(x)
+    else
+        fun_l12_n203(x)
+    end
+end
+
+def fun_l11_n915(x)
+    if (x < 1)
+        fun_l12_n625(x)
+    else
+        fun_l12_n32(x)
+    end
+end
+
+def fun_l11_n916(x)
+    if (x < 1)
+        fun_l12_n785(x)
+    else
+        fun_l12_n237(x)
+    end
+end
+
+def fun_l11_n917(x)
+    if (x < 1)
+        fun_l12_n643(x)
+    else
+        fun_l12_n364(x)
+    end
+end
+
+def fun_l11_n918(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n957(x)
+    end
+end
+
+def fun_l11_n919(x)
+    if (x < 1)
+        fun_l12_n336(x)
+    else
+        fun_l12_n726(x)
+    end
+end
+
+def fun_l11_n920(x)
+    if (x < 1)
+        fun_l12_n329(x)
+    else
+        fun_l12_n15(x)
+    end
+end
+
+def fun_l11_n921(x)
+    if (x < 1)
+        fun_l12_n911(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n922(x)
+    if (x < 1)
+        fun_l12_n907(x)
+    else
+        fun_l12_n854(x)
+    end
+end
+
+def fun_l11_n923(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n549(x)
+    end
+end
+
+def fun_l11_n924(x)
+    if (x < 1)
+        fun_l12_n833(x)
+    else
+        fun_l12_n986(x)
+    end
+end
+
+def fun_l11_n925(x)
+    if (x < 1)
+        fun_l12_n450(x)
+    else
+        fun_l12_n783(x)
+    end
+end
+
+def fun_l11_n926(x)
+    if (x < 1)
+        fun_l12_n405(x)
+    else
+        fun_l12_n960(x)
+    end
+end
+
+def fun_l11_n927(x)
+    if (x < 1)
+        fun_l12_n603(x)
+    else
+        fun_l12_n892(x)
+    end
+end
+
+def fun_l11_n928(x)
+    if (x < 1)
+        fun_l12_n137(x)
+    else
+        fun_l12_n200(x)
+    end
+end
+
+def fun_l11_n929(x)
+    if (x < 1)
+        fun_l12_n161(x)
+    else
+        fun_l12_n754(x)
+    end
+end
+
+def fun_l11_n930(x)
+    if (x < 1)
+        fun_l12_n107(x)
+    else
+        fun_l12_n258(x)
+    end
+end
+
+def fun_l11_n931(x)
+    if (x < 1)
+        fun_l12_n794(x)
+    else
+        fun_l12_n812(x)
+    end
+end
+
+def fun_l11_n932(x)
+    if (x < 1)
+        fun_l12_n956(x)
+    else
+        fun_l12_n156(x)
+    end
+end
+
+def fun_l11_n933(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n496(x)
+    end
+end
+
+def fun_l11_n934(x)
+    if (x < 1)
+        fun_l12_n229(x)
+    else
+        fun_l12_n339(x)
+    end
+end
+
+def fun_l11_n935(x)
+    if (x < 1)
+        fun_l12_n353(x)
+    else
+        fun_l12_n430(x)
+    end
+end
+
+def fun_l11_n936(x)
+    if (x < 1)
+        fun_l12_n721(x)
+    else
+        fun_l12_n409(x)
+    end
+end
+
+def fun_l11_n937(x)
+    if (x < 1)
+        fun_l12_n151(x)
+    else
+        fun_l12_n60(x)
+    end
+end
+
+def fun_l11_n938(x)
+    if (x < 1)
+        fun_l12_n362(x)
+    else
+        fun_l12_n92(x)
+    end
+end
+
+def fun_l11_n939(x)
+    if (x < 1)
+        fun_l12_n315(x)
+    else
+        fun_l12_n905(x)
+    end
+end
+
+def fun_l11_n940(x)
+    if (x < 1)
+        fun_l12_n788(x)
+    else
+        fun_l12_n105(x)
+    end
+end
+
+def fun_l11_n941(x)
+    if (x < 1)
+        fun_l12_n124(x)
+    else
+        fun_l12_n496(x)
+    end
+end
+
+def fun_l11_n942(x)
+    if (x < 1)
+        fun_l12_n546(x)
+    else
+        fun_l12_n17(x)
+    end
+end
+
+def fun_l11_n943(x)
+    if (x < 1)
+        fun_l12_n594(x)
+    else
+        fun_l12_n55(x)
+    end
+end
+
+def fun_l11_n944(x)
+    if (x < 1)
+        fun_l12_n187(x)
+    else
+        fun_l12_n139(x)
+    end
+end
+
+def fun_l11_n945(x)
+    if (x < 1)
+        fun_l12_n117(x)
+    else
+        fun_l12_n382(x)
+    end
+end
+
+def fun_l11_n946(x)
+    if (x < 1)
+        fun_l12_n579(x)
+    else
+        fun_l12_n895(x)
+    end
+end
+
+def fun_l11_n947(x)
+    if (x < 1)
+        fun_l12_n541(x)
+    else
+        fun_l12_n497(x)
+    end
+end
+
+def fun_l11_n948(x)
+    if (x < 1)
+        fun_l12_n250(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n949(x)
+    if (x < 1)
+        fun_l12_n553(x)
+    else
+        fun_l12_n663(x)
+    end
+end
+
+def fun_l11_n950(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n414(x)
+    end
+end
+
+def fun_l11_n951(x)
+    if (x < 1)
+        fun_l12_n748(x)
+    else
+        fun_l12_n525(x)
+    end
+end
+
+def fun_l11_n952(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n339(x)
+    end
+end
+
+def fun_l11_n953(x)
+    if (x < 1)
+        fun_l12_n665(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n954(x)
+    if (x < 1)
+        fun_l12_n366(x)
+    else
+        fun_l12_n149(x)
+    end
+end
+
+def fun_l11_n955(x)
+    if (x < 1)
+        fun_l12_n549(x)
+    else
+        fun_l12_n414(x)
+    end
+end
+
+def fun_l11_n956(x)
+    if (x < 1)
+        fun_l12_n258(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n957(x)
+    if (x < 1)
+        fun_l12_n439(x)
+    else
+        fun_l12_n83(x)
+    end
+end
+
+def fun_l11_n958(x)
+    if (x < 1)
+        fun_l12_n601(x)
+    else
+        fun_l12_n938(x)
+    end
+end
+
+def fun_l11_n959(x)
+    if (x < 1)
+        fun_l12_n953(x)
+    else
+        fun_l12_n973(x)
+    end
+end
+
+def fun_l11_n960(x)
+    if (x < 1)
+        fun_l12_n426(x)
+    else
+        fun_l12_n8(x)
+    end
+end
+
+def fun_l11_n961(x)
+    if (x < 1)
+        fun_l12_n719(x)
+    else
+        fun_l12_n657(x)
+    end
+end
+
+def fun_l11_n962(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n992(x)
+    end
+end
+
+def fun_l11_n963(x)
+    if (x < 1)
+        fun_l12_n141(x)
+    else
+        fun_l12_n468(x)
+    end
+end
+
+def fun_l11_n964(x)
+    if (x < 1)
+        fun_l12_n463(x)
+    else
+        fun_l12_n94(x)
+    end
+end
+
+def fun_l11_n965(x)
+    if (x < 1)
+        fun_l12_n765(x)
+    else
+        fun_l12_n168(x)
+    end
+end
+
+def fun_l11_n966(x)
+    if (x < 1)
+        fun_l12_n237(x)
+    else
+        fun_l12_n437(x)
+    end
+end
+
+def fun_l11_n967(x)
+    if (x < 1)
+        fun_l12_n741(x)
+    else
+        fun_l12_n331(x)
+    end
+end
+
+def fun_l11_n968(x)
+    if (x < 1)
+        fun_l12_n617(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n969(x)
+    if (x < 1)
+        fun_l12_n880(x)
+    else
+        fun_l12_n727(x)
+    end
+end
+
+def fun_l11_n970(x)
+    if (x < 1)
+        fun_l12_n781(x)
+    else
+        fun_l12_n270(x)
+    end
+end
+
+def fun_l11_n971(x)
+    if (x < 1)
+        fun_l12_n511(x)
+    else
+        fun_l12_n183(x)
+    end
+end
+
+def fun_l11_n972(x)
+    if (x < 1)
+        fun_l12_n448(x)
+    else
+        fun_l12_n965(x)
+    end
+end
+
+def fun_l11_n973(x)
+    if (x < 1)
+        fun_l12_n816(x)
+    else
+        fun_l12_n974(x)
+    end
+end
+
+def fun_l11_n974(x)
+    if (x < 1)
+        fun_l12_n583(x)
+    else
+        fun_l12_n731(x)
+    end
+end
+
+def fun_l11_n975(x)
+    if (x < 1)
+        fun_l12_n42(x)
+    else
+        fun_l12_n463(x)
+    end
+end
+
+def fun_l11_n976(x)
+    if (x < 1)
+        fun_l12_n267(x)
+    else
+        fun_l12_n769(x)
+    end
+end
+
+def fun_l11_n977(x)
+    if (x < 1)
+        fun_l12_n993(x)
+    else
+        fun_l12_n391(x)
+    end
+end
+
+def fun_l11_n978(x)
+    if (x < 1)
+        fun_l12_n507(x)
+    else
+        fun_l12_n905(x)
+    end
+end
+
+def fun_l11_n979(x)
+    if (x < 1)
+        fun_l12_n486(x)
+    else
+        fun_l12_n562(x)
+    end
+end
+
+def fun_l11_n980(x)
+    if (x < 1)
+        fun_l12_n252(x)
+    else
+        fun_l12_n475(x)
+    end
+end
+
+def fun_l11_n981(x)
+    if (x < 1)
+        fun_l12_n979(x)
+    else
+        fun_l12_n70(x)
+    end
+end
+
+def fun_l11_n982(x)
+    if (x < 1)
+        fun_l12_n11(x)
+    else
+        fun_l12_n483(x)
+    end
+end
+
+def fun_l11_n983(x)
+    if (x < 1)
+        fun_l12_n208(x)
+    else
+        fun_l12_n315(x)
+    end
+end
+
+def fun_l11_n984(x)
+    if (x < 1)
+        fun_l12_n452(x)
+    else
+        fun_l12_n367(x)
+    end
+end
+
+def fun_l11_n985(x)
+    if (x < 1)
+        fun_l12_n937(x)
+    else
+        fun_l12_n33(x)
+    end
+end
+
+def fun_l11_n986(x)
+    if (x < 1)
+        fun_l12_n227(x)
+    else
+        fun_l12_n448(x)
+    end
+end
+
+def fun_l11_n987(x)
+    if (x < 1)
+        fun_l12_n928(x)
+    else
+        fun_l12_n693(x)
+    end
+end
+
+def fun_l11_n988(x)
+    if (x < 1)
+        fun_l12_n731(x)
+    else
+        fun_l12_n872(x)
+    end
+end
+
+def fun_l11_n989(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n0(x)
+    end
+end
+
+def fun_l11_n990(x)
+    if (x < 1)
+        fun_l12_n203(x)
+    else
+        fun_l12_n545(x)
+    end
+end
+
+def fun_l11_n991(x)
+    if (x < 1)
+        fun_l12_n237(x)
+    else
+        fun_l12_n186(x)
+    end
+end
+
+def fun_l11_n992(x)
+    if (x < 1)
+        fun_l12_n22(x)
+    else
+        fun_l12_n597(x)
+    end
+end
+
+def fun_l11_n993(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n677(x)
+    end
+end
+
+def fun_l11_n994(x)
+    if (x < 1)
+        fun_l12_n892(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n995(x)
+    if (x < 1)
+        fun_l12_n51(x)
+    else
+        fun_l12_n279(x)
+    end
+end
+
+def fun_l11_n996(x)
+    if (x < 1)
+        fun_l12_n430(x)
+    else
+        fun_l12_n527(x)
+    end
+end
+
+def fun_l11_n997(x)
+    if (x < 1)
+        fun_l12_n153(x)
+    else
+        fun_l12_n366(x)
+    end
+end
+
+def fun_l11_n998(x)
+    if (x < 1)
+        fun_l12_n574(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n999(x)
+    if (x < 1)
+        fun_l12_n100(x)
+    else
+        fun_l12_n943(x)
+    end
+end
+
+def fun_l12_n0(x)
+    if (x < 1)
+        fun_l13_n874(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n1(x)
+    if (x < 1)
+        fun_l13_n354(x)
+    else
+        fun_l13_n103(x)
+    end
+end
+
+def fun_l12_n2(x)
+    if (x < 1)
+        fun_l13_n265(x)
+    else
+        fun_l13_n936(x)
+    end
+end
+
+def fun_l12_n3(x)
+    if (x < 1)
+        fun_l13_n683(x)
+    else
+        fun_l13_n607(x)
+    end
+end
+
+def fun_l12_n4(x)
+    if (x < 1)
+        fun_l13_n398(x)
+    else
+        fun_l13_n902(x)
+    end
+end
+
+def fun_l12_n5(x)
+    if (x < 1)
+        fun_l13_n694(x)
+    else
+        fun_l13_n392(x)
+    end
+end
+
+def fun_l12_n6(x)
+    if (x < 1)
+        fun_l13_n170(x)
+    else
+        fun_l13_n207(x)
+    end
+end
+
+def fun_l12_n7(x)
+    if (x < 1)
+        fun_l13_n978(x)
+    else
+        fun_l13_n368(x)
+    end
+end
+
+def fun_l12_n8(x)
+    if (x < 1)
+        fun_l13_n970(x)
+    else
+        fun_l13_n560(x)
+    end
+end
+
+def fun_l12_n9(x)
+    if (x < 1)
+        fun_l13_n56(x)
+    else
+        fun_l13_n697(x)
+    end
+end
+
+def fun_l12_n10(x)
+    if (x < 1)
+        fun_l13_n860(x)
+    else
+        fun_l13_n407(x)
+    end
+end
+
+def fun_l12_n11(x)
+    if (x < 1)
+        fun_l13_n581(x)
+    else
+        fun_l13_n582(x)
+    end
+end
+
+def fun_l12_n12(x)
+    if (x < 1)
+        fun_l13_n835(x)
+    else
+        fun_l13_n706(x)
+    end
+end
+
+def fun_l12_n13(x)
+    if (x < 1)
+        fun_l13_n862(x)
+    else
+        fun_l13_n89(x)
+    end
+end
+
+def fun_l12_n14(x)
+    if (x < 1)
+        fun_l13_n379(x)
+    else
+        fun_l13_n896(x)
+    end
+end
+
+def fun_l12_n15(x)
+    if (x < 1)
+        fun_l13_n175(x)
+    else
+        fun_l13_n113(x)
+    end
+end
+
+def fun_l12_n16(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n935(x)
+    end
+end
+
+def fun_l12_n17(x)
+    if (x < 1)
+        fun_l13_n171(x)
+    else
+        fun_l13_n264(x)
+    end
+end
+
+def fun_l12_n18(x)
+    if (x < 1)
+        fun_l13_n61(x)
+    else
+        fun_l13_n412(x)
+    end
+end
+
+def fun_l12_n19(x)
+    if (x < 1)
+        fun_l13_n213(x)
+    else
+        fun_l13_n422(x)
+    end
+end
+
+def fun_l12_n20(x)
+    if (x < 1)
+        fun_l13_n401(x)
+    else
+        fun_l13_n537(x)
+    end
+end
+
+def fun_l12_n21(x)
+    if (x < 1)
+        fun_l13_n207(x)
+    else
+        fun_l13_n495(x)
+    end
+end
+
+def fun_l12_n22(x)
+    if (x < 1)
+        fun_l13_n941(x)
+    else
+        fun_l13_n466(x)
+    end
+end
+
+def fun_l12_n23(x)
+    if (x < 1)
+        fun_l13_n195(x)
+    else
+        fun_l13_n984(x)
+    end
+end
+
+def fun_l12_n24(x)
+    if (x < 1)
+        fun_l13_n106(x)
+    else
+        fun_l13_n812(x)
+    end
+end
+
+def fun_l12_n25(x)
+    if (x < 1)
+        fun_l13_n979(x)
+    else
+        fun_l13_n902(x)
+    end
+end
+
+def fun_l12_n26(x)
+    if (x < 1)
+        fun_l13_n726(x)
+    else
+        fun_l13_n440(x)
+    end
+end
+
+def fun_l12_n27(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n995(x)
+    end
+end
+
+def fun_l12_n28(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n333(x)
+    end
+end
+
+def fun_l12_n29(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n59(x)
+    end
+end
+
+def fun_l12_n30(x)
+    if (x < 1)
+        fun_l13_n731(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n31(x)
+    if (x < 1)
+        fun_l13_n591(x)
+    else
+        fun_l13_n473(x)
+    end
+end
+
+def fun_l12_n32(x)
+    if (x < 1)
+        fun_l13_n50(x)
+    else
+        fun_l13_n175(x)
+    end
+end
+
+def fun_l12_n33(x)
+    if (x < 1)
+        fun_l13_n26(x)
+    else
+        fun_l13_n867(x)
+    end
+end
+
+def fun_l12_n34(x)
+    if (x < 1)
+        fun_l13_n349(x)
+    else
+        fun_l13_n332(x)
+    end
+end
+
+def fun_l12_n35(x)
+    if (x < 1)
+        fun_l13_n180(x)
+    else
+        fun_l13_n591(x)
+    end
+end
+
+def fun_l12_n36(x)
+    if (x < 1)
+        fun_l13_n339(x)
+    else
+        fun_l13_n354(x)
+    end
+end
+
+def fun_l12_n37(x)
+    if (x < 1)
+        fun_l13_n289(x)
+    else
+        fun_l13_n101(x)
+    end
+end
+
+def fun_l12_n38(x)
+    if (x < 1)
+        fun_l13_n410(x)
+    else
+        fun_l13_n91(x)
+    end
+end
+
+def fun_l12_n39(x)
+    if (x < 1)
+        fun_l13_n617(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n40(x)
+    if (x < 1)
+        fun_l13_n116(x)
+    else
+        fun_l13_n875(x)
+    end
+end
+
+def fun_l12_n41(x)
+    if (x < 1)
+        fun_l13_n162(x)
+    else
+        fun_l13_n844(x)
+    end
+end
+
+def fun_l12_n42(x)
+    if (x < 1)
+        fun_l13_n79(x)
+    else
+        fun_l13_n589(x)
+    end
+end
+
+def fun_l12_n43(x)
+    if (x < 1)
+        fun_l13_n835(x)
+    else
+        fun_l13_n21(x)
+    end
+end
+
+def fun_l12_n44(x)
+    if (x < 1)
+        fun_l13_n420(x)
+    else
+        fun_l13_n403(x)
+    end
+end
+
+def fun_l12_n45(x)
+    if (x < 1)
+        fun_l13_n203(x)
+    else
+        fun_l13_n890(x)
+    end
+end
+
+def fun_l12_n46(x)
+    if (x < 1)
+        fun_l13_n529(x)
+    else
+        fun_l13_n717(x)
+    end
+end
+
+def fun_l12_n47(x)
+    if (x < 1)
+        fun_l13_n766(x)
+    else
+        fun_l13_n635(x)
+    end
+end
+
+def fun_l12_n48(x)
+    if (x < 1)
+        fun_l13_n223(x)
+    else
+        fun_l13_n460(x)
+    end
+end
+
+def fun_l12_n49(x)
+    if (x < 1)
+        fun_l13_n799(x)
+    else
+        fun_l13_n397(x)
+    end
+end
+
+def fun_l12_n50(x)
+    if (x < 1)
+        fun_l13_n200(x)
+    else
+        fun_l13_n608(x)
+    end
+end
+
+def fun_l12_n51(x)
+    if (x < 1)
+        fun_l13_n212(x)
+    else
+        fun_l13_n612(x)
+    end
+end
+
+def fun_l12_n52(x)
+    if (x < 1)
+        fun_l13_n271(x)
+    else
+        fun_l13_n324(x)
+    end
+end
+
+def fun_l12_n53(x)
+    if (x < 1)
+        fun_l13_n639(x)
+    else
+        fun_l13_n603(x)
+    end
+end
+
+def fun_l12_n54(x)
+    if (x < 1)
+        fun_l13_n125(x)
+    else
+        fun_l13_n726(x)
+    end
+end
+
+def fun_l12_n55(x)
+    if (x < 1)
+        fun_l13_n266(x)
+    else
+        fun_l13_n552(x)
+    end
+end
+
+def fun_l12_n56(x)
+    if (x < 1)
+        fun_l13_n412(x)
+    else
+        fun_l13_n132(x)
+    end
+end
+
+def fun_l12_n57(x)
+    if (x < 1)
+        fun_l13_n235(x)
+    else
+        fun_l13_n892(x)
+    end
+end
+
+def fun_l12_n58(x)
+    if (x < 1)
+        fun_l13_n515(x)
+    else
+        fun_l13_n465(x)
+    end
+end
+
+def fun_l12_n59(x)
+    if (x < 1)
+        fun_l13_n38(x)
+    else
+        fun_l13_n757(x)
+    end
+end
+
+def fun_l12_n60(x)
+    if (x < 1)
+        fun_l13_n544(x)
+    else
+        fun_l13_n794(x)
+    end
+end
+
+def fun_l12_n61(x)
+    if (x < 1)
+        fun_l13_n622(x)
+    else
+        fun_l13_n340(x)
+    end
+end
+
+def fun_l12_n62(x)
+    if (x < 1)
+        fun_l13_n563(x)
+    else
+        fun_l13_n313(x)
+    end
+end
+
+def fun_l12_n63(x)
+    if (x < 1)
+        fun_l13_n936(x)
+    else
+        fun_l13_n38(x)
+    end
+end
+
+def fun_l12_n64(x)
+    if (x < 1)
+        fun_l13_n951(x)
+    else
+        fun_l13_n543(x)
+    end
+end
+
+def fun_l12_n65(x)
+    if (x < 1)
+        fun_l13_n577(x)
+    else
+        fun_l13_n190(x)
+    end
+end
+
+def fun_l12_n66(x)
+    if (x < 1)
+        fun_l13_n649(x)
+    else
+        fun_l13_n887(x)
+    end
+end
+
+def fun_l12_n67(x)
+    if (x < 1)
+        fun_l13_n218(x)
+    else
+        fun_l13_n200(x)
+    end
+end
+
+def fun_l12_n68(x)
+    if (x < 1)
+        fun_l13_n111(x)
+    else
+        fun_l13_n849(x)
+    end
+end
+
+def fun_l12_n69(x)
+    if (x < 1)
+        fun_l13_n431(x)
+    else
+        fun_l13_n816(x)
+    end
+end
+
+def fun_l12_n70(x)
+    if (x < 1)
+        fun_l13_n970(x)
+    else
+        fun_l13_n545(x)
+    end
+end
+
+def fun_l12_n71(x)
+    if (x < 1)
+        fun_l13_n3(x)
+    else
+        fun_l13_n751(x)
+    end
+end
+
+def fun_l12_n72(x)
+    if (x < 1)
+        fun_l13_n58(x)
+    else
+        fun_l13_n994(x)
+    end
+end
+
+def fun_l12_n73(x)
+    if (x < 1)
+        fun_l13_n397(x)
+    else
+        fun_l13_n783(x)
+    end
+end
+
+def fun_l12_n74(x)
+    if (x < 1)
+        fun_l13_n705(x)
+    else
+        fun_l13_n318(x)
+    end
+end
+
+def fun_l12_n75(x)
+    if (x < 1)
+        fun_l13_n406(x)
+    else
+        fun_l13_n880(x)
+    end
+end
+
+def fun_l12_n76(x)
+    if (x < 1)
+        fun_l13_n867(x)
+    else
+        fun_l13_n234(x)
+    end
+end
+
+def fun_l12_n77(x)
+    if (x < 1)
+        fun_l13_n447(x)
+    else
+        fun_l13_n617(x)
+    end
+end
+
+def fun_l12_n78(x)
+    if (x < 1)
+        fun_l13_n631(x)
+    else
+        fun_l13_n687(x)
+    end
+end
+
+def fun_l12_n79(x)
+    if (x < 1)
+        fun_l13_n735(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n80(x)
+    if (x < 1)
+        fun_l13_n826(x)
+    else
+        fun_l13_n626(x)
+    end
+end
+
+def fun_l12_n81(x)
+    if (x < 1)
+        fun_l13_n959(x)
+    else
+        fun_l13_n357(x)
+    end
+end
+
+def fun_l12_n82(x)
+    if (x < 1)
+        fun_l13_n17(x)
+    else
+        fun_l13_n722(x)
+    end
+end
+
+def fun_l12_n83(x)
+    if (x < 1)
+        fun_l13_n702(x)
+    else
+        fun_l13_n441(x)
+    end
+end
+
+def fun_l12_n84(x)
+    if (x < 1)
+        fun_l13_n939(x)
+    else
+        fun_l13_n972(x)
+    end
+end
+
+def fun_l12_n85(x)
+    if (x < 1)
+        fun_l13_n747(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n86(x)
+    if (x < 1)
+        fun_l13_n813(x)
+    else
+        fun_l13_n780(x)
+    end
+end
+
+def fun_l12_n87(x)
+    if (x < 1)
+        fun_l13_n87(x)
+    else
+        fun_l13_n19(x)
+    end
+end
+
+def fun_l12_n88(x)
+    if (x < 1)
+        fun_l13_n422(x)
+    else
+        fun_l13_n938(x)
+    end
+end
+
+def fun_l12_n89(x)
+    if (x < 1)
+        fun_l13_n575(x)
+    else
+        fun_l13_n150(x)
+    end
+end
+
+def fun_l12_n90(x)
+    if (x < 1)
+        fun_l13_n294(x)
+    else
+        fun_l13_n666(x)
+    end
+end
+
+def fun_l12_n91(x)
+    if (x < 1)
+        fun_l13_n216(x)
+    else
+        fun_l13_n315(x)
+    end
+end
+
+def fun_l12_n92(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n487(x)
+    end
+end
+
+def fun_l12_n93(x)
+    if (x < 1)
+        fun_l13_n500(x)
+    else
+        fun_l13_n2(x)
+    end
+end
+
+def fun_l12_n94(x)
+    if (x < 1)
+        fun_l13_n362(x)
+    else
+        fun_l13_n69(x)
+    end
+end
+
+def fun_l12_n95(x)
+    if (x < 1)
+        fun_l13_n50(x)
+    else
+        fun_l13_n549(x)
+    end
+end
+
+def fun_l12_n96(x)
+    if (x < 1)
+        fun_l13_n407(x)
+    else
+        fun_l13_n935(x)
+    end
+end
+
+def fun_l12_n97(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n70(x)
+    end
+end
+
+def fun_l12_n98(x)
+    if (x < 1)
+        fun_l13_n184(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n99(x)
+    if (x < 1)
+        fun_l13_n612(x)
+    else
+        fun_l13_n972(x)
+    end
+end
+
+def fun_l12_n100(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n458(x)
+    end
+end
+
+def fun_l12_n101(x)
+    if (x < 1)
+        fun_l13_n387(x)
+    else
+        fun_l13_n783(x)
+    end
+end
+
+def fun_l12_n102(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n647(x)
+    end
+end
+
+def fun_l12_n103(x)
+    if (x < 1)
+        fun_l13_n310(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n104(x)
+    if (x < 1)
+        fun_l13_n643(x)
+    else
+        fun_l13_n479(x)
+    end
+end
+
+def fun_l12_n105(x)
+    if (x < 1)
+        fun_l13_n909(x)
+    else
+        fun_l13_n10(x)
+    end
+end
+
+def fun_l12_n106(x)
+    if (x < 1)
+        fun_l13_n181(x)
+    else
+        fun_l13_n671(x)
+    end
+end
+
+def fun_l12_n107(x)
+    if (x < 1)
+        fun_l13_n592(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n108(x)
+    if (x < 1)
+        fun_l13_n438(x)
+    else
+        fun_l13_n196(x)
+    end
+end
+
+def fun_l12_n109(x)
+    if (x < 1)
+        fun_l13_n605(x)
+    else
+        fun_l13_n529(x)
+    end
+end
+
+def fun_l12_n110(x)
+    if (x < 1)
+        fun_l13_n31(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n111(x)
+    if (x < 1)
+        fun_l13_n790(x)
+    else
+        fun_l13_n773(x)
+    end
+end
+
+def fun_l12_n112(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n621(x)
+    end
+end
+
+def fun_l12_n113(x)
+    if (x < 1)
+        fun_l13_n892(x)
+    else
+        fun_l13_n413(x)
+    end
+end
+
+def fun_l12_n114(x)
+    if (x < 1)
+        fun_l13_n675(x)
+    else
+        fun_l13_n124(x)
+    end
+end
+
+def fun_l12_n115(x)
+    if (x < 1)
+        fun_l13_n366(x)
+    else
+        fun_l13_n884(x)
+    end
+end
+
+def fun_l12_n116(x)
+    if (x < 1)
+        fun_l13_n552(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n117(x)
+    if (x < 1)
+        fun_l13_n11(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n118(x)
+    if (x < 1)
+        fun_l13_n766(x)
+    else
+        fun_l13_n914(x)
+    end
+end
+
+def fun_l12_n119(x)
+    if (x < 1)
+        fun_l13_n980(x)
+    else
+        fun_l13_n956(x)
+    end
+end
+
+def fun_l12_n120(x)
+    if (x < 1)
+        fun_l13_n668(x)
+    else
+        fun_l13_n532(x)
+    end
+end
+
+def fun_l12_n121(x)
+    if (x < 1)
+        fun_l13_n864(x)
+    else
+        fun_l13_n489(x)
+    end
+end
+
+def fun_l12_n122(x)
+    if (x < 1)
+        fun_l13_n581(x)
+    else
+        fun_l13_n33(x)
+    end
+end
+
+def fun_l12_n123(x)
+    if (x < 1)
+        fun_l13_n188(x)
+    else
+        fun_l13_n652(x)
+    end
+end
+
+def fun_l12_n124(x)
+    if (x < 1)
+        fun_l13_n631(x)
+    else
+        fun_l13_n932(x)
+    end
+end
+
+def fun_l12_n125(x)
+    if (x < 1)
+        fun_l13_n646(x)
+    else
+        fun_l13_n525(x)
+    end
+end
+
+def fun_l12_n126(x)
+    if (x < 1)
+        fun_l13_n878(x)
+    else
+        fun_l13_n98(x)
+    end
+end
+
+def fun_l12_n127(x)
+    if (x < 1)
+        fun_l13_n120(x)
+    else
+        fun_l13_n950(x)
+    end
+end
+
+def fun_l12_n128(x)
+    if (x < 1)
+        fun_l13_n405(x)
+    else
+        fun_l13_n60(x)
+    end
+end
+
+def fun_l12_n129(x)
+    if (x < 1)
+        fun_l13_n635(x)
+    else
+        fun_l13_n992(x)
+    end
+end
+
+def fun_l12_n130(x)
+    if (x < 1)
+        fun_l13_n711(x)
+    else
+        fun_l13_n172(x)
+    end
+end
+
+def fun_l12_n131(x)
+    if (x < 1)
+        fun_l13_n2(x)
+    else
+        fun_l13_n328(x)
+    end
+end
+
+def fun_l12_n132(x)
+    if (x < 1)
+        fun_l13_n506(x)
+    else
+        fun_l13_n258(x)
+    end
+end
+
+def fun_l12_n133(x)
+    if (x < 1)
+        fun_l13_n737(x)
+    else
+        fun_l13_n552(x)
+    end
+end
+
+def fun_l12_n134(x)
+    if (x < 1)
+        fun_l13_n596(x)
+    else
+        fun_l13_n475(x)
+    end
+end
+
+def fun_l12_n135(x)
+    if (x < 1)
+        fun_l13_n751(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n136(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n719(x)
+    end
+end
+
+def fun_l12_n137(x)
+    if (x < 1)
+        fun_l13_n779(x)
+    else
+        fun_l13_n204(x)
+    end
+end
+
+def fun_l12_n138(x)
+    if (x < 1)
+        fun_l13_n765(x)
+    else
+        fun_l13_n280(x)
+    end
+end
+
+def fun_l12_n139(x)
+    if (x < 1)
+        fun_l13_n896(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n140(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n809(x)
+    end
+end
+
+def fun_l12_n141(x)
+    if (x < 1)
+        fun_l13_n182(x)
+    else
+        fun_l13_n960(x)
+    end
+end
+
+def fun_l12_n142(x)
+    if (x < 1)
+        fun_l13_n196(x)
+    else
+        fun_l13_n794(x)
+    end
+end
+
+def fun_l12_n143(x)
+    if (x < 1)
+        fun_l13_n993(x)
+    else
+        fun_l13_n426(x)
+    end
+end
+
+def fun_l12_n144(x)
+    if (x < 1)
+        fun_l13_n926(x)
+    else
+        fun_l13_n554(x)
+    end
+end
+
+def fun_l12_n145(x)
+    if (x < 1)
+        fun_l13_n839(x)
+    else
+        fun_l13_n987(x)
+    end
+end
+
+def fun_l12_n146(x)
+    if (x < 1)
+        fun_l13_n412(x)
+    else
+        fun_l13_n359(x)
+    end
+end
+
+def fun_l12_n147(x)
+    if (x < 1)
+        fun_l13_n147(x)
+    else
+        fun_l13_n640(x)
+    end
+end
+
+def fun_l12_n148(x)
+    if (x < 1)
+        fun_l13_n831(x)
+    else
+        fun_l13_n862(x)
+    end
+end
+
+def fun_l12_n149(x)
+    if (x < 1)
+        fun_l13_n161(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n150(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n151(x)
+    if (x < 1)
+        fun_l13_n390(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n152(x)
+    if (x < 1)
+        fun_l13_n722(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n153(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n461(x)
+    end
+end
+
+def fun_l12_n154(x)
+    if (x < 1)
+        fun_l13_n223(x)
+    else
+        fun_l13_n502(x)
+    end
+end
+
+def fun_l12_n155(x)
+    if (x < 1)
+        fun_l13_n526(x)
+    else
+        fun_l13_n949(x)
+    end
+end
+
+def fun_l12_n156(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n290(x)
+    end
+end
+
+def fun_l12_n157(x)
+    if (x < 1)
+        fun_l13_n904(x)
+    else
+        fun_l13_n562(x)
+    end
+end
+
+def fun_l12_n158(x)
+    if (x < 1)
+        fun_l13_n308(x)
+    else
+        fun_l13_n646(x)
+    end
+end
+
+def fun_l12_n159(x)
+    if (x < 1)
+        fun_l13_n417(x)
+    else
+        fun_l13_n576(x)
+    end
+end
+
+def fun_l12_n160(x)
+    if (x < 1)
+        fun_l13_n846(x)
+    else
+        fun_l13_n989(x)
+    end
+end
+
+def fun_l12_n161(x)
+    if (x < 1)
+        fun_l13_n59(x)
+    else
+        fun_l13_n877(x)
+    end
+end
+
+def fun_l12_n162(x)
+    if (x < 1)
+        fun_l13_n194(x)
+    else
+        fun_l13_n654(x)
+    end
+end
+
+def fun_l12_n163(x)
+    if (x < 1)
+        fun_l13_n350(x)
+    else
+        fun_l13_n412(x)
+    end
+end
+
+def fun_l12_n164(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n820(x)
+    end
+end
+
+def fun_l12_n165(x)
+    if (x < 1)
+        fun_l13_n251(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n166(x)
+    if (x < 1)
+        fun_l13_n832(x)
+    else
+        fun_l13_n505(x)
+    end
+end
+
+def fun_l12_n167(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n168(x)
+    if (x < 1)
+        fun_l13_n325(x)
+    else
+        fun_l13_n755(x)
+    end
+end
+
+def fun_l12_n169(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n753(x)
+    end
+end
+
+def fun_l12_n170(x)
+    if (x < 1)
+        fun_l13_n819(x)
+    else
+        fun_l13_n532(x)
+    end
+end
+
+def fun_l12_n171(x)
+    if (x < 1)
+        fun_l13_n633(x)
+    else
+        fun_l13_n96(x)
+    end
+end
+
+def fun_l12_n172(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n105(x)
+    end
+end
+
+def fun_l12_n173(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n466(x)
+    end
+end
+
+def fun_l12_n174(x)
+    if (x < 1)
+        fun_l13_n520(x)
+    else
+        fun_l13_n329(x)
+    end
+end
+
+def fun_l12_n175(x)
+    if (x < 1)
+        fun_l13_n358(x)
+    else
+        fun_l13_n201(x)
+    end
+end
+
+def fun_l12_n176(x)
+    if (x < 1)
+        fun_l13_n42(x)
+    else
+        fun_l13_n649(x)
+    end
+end
+
+def fun_l12_n177(x)
+    if (x < 1)
+        fun_l13_n933(x)
+    else
+        fun_l13_n719(x)
+    end
+end
+
+def fun_l12_n178(x)
+    if (x < 1)
+        fun_l13_n236(x)
+    else
+        fun_l13_n723(x)
+    end
+end
+
+def fun_l12_n179(x)
+    if (x < 1)
+        fun_l13_n992(x)
+    else
+        fun_l13_n436(x)
+    end
+end
+
+def fun_l12_n180(x)
+    if (x < 1)
+        fun_l13_n221(x)
+    else
+        fun_l13_n294(x)
+    end
+end
+
+def fun_l12_n181(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n182(x)
+    if (x < 1)
+        fun_l13_n608(x)
+    else
+        fun_l13_n709(x)
+    end
+end
+
+def fun_l12_n183(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n717(x)
+    end
+end
+
+def fun_l12_n184(x)
+    if (x < 1)
+        fun_l13_n605(x)
+    else
+        fun_l13_n665(x)
+    end
+end
+
+def fun_l12_n185(x)
+    if (x < 1)
+        fun_l13_n729(x)
+    else
+        fun_l13_n876(x)
+    end
+end
+
+def fun_l12_n186(x)
+    if (x < 1)
+        fun_l13_n43(x)
+    else
+        fun_l13_n366(x)
+    end
+end
+
+def fun_l12_n187(x)
+    if (x < 1)
+        fun_l13_n401(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n188(x)
+    if (x < 1)
+        fun_l13_n489(x)
+    else
+        fun_l13_n107(x)
+    end
+end
+
+def fun_l12_n189(x)
+    if (x < 1)
+        fun_l13_n859(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n190(x)
+    if (x < 1)
+        fun_l13_n631(x)
+    else
+        fun_l13_n399(x)
+    end
+end
+
+def fun_l12_n191(x)
+    if (x < 1)
+        fun_l13_n332(x)
+    else
+        fun_l13_n333(x)
+    end
+end
+
+def fun_l12_n192(x)
+    if (x < 1)
+        fun_l13_n535(x)
+    else
+        fun_l13_n191(x)
+    end
+end
+
+def fun_l12_n193(x)
+    if (x < 1)
+        fun_l13_n157(x)
+    else
+        fun_l13_n927(x)
+    end
+end
+
+def fun_l12_n194(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n798(x)
+    end
+end
+
+def fun_l12_n195(x)
+    if (x < 1)
+        fun_l13_n31(x)
+    else
+        fun_l13_n703(x)
+    end
+end
+
+def fun_l12_n196(x)
+    if (x < 1)
+        fun_l13_n976(x)
+    else
+        fun_l13_n862(x)
+    end
+end
+
+def fun_l12_n197(x)
+    if (x < 1)
+        fun_l13_n267(x)
+    else
+        fun_l13_n803(x)
+    end
+end
+
+def fun_l12_n198(x)
+    if (x < 1)
+        fun_l13_n598(x)
+    else
+        fun_l13_n255(x)
+    end
+end
+
+def fun_l12_n199(x)
+    if (x < 1)
+        fun_l13_n566(x)
+    else
+        fun_l13_n668(x)
+    end
+end
+
+def fun_l12_n200(x)
+    if (x < 1)
+        fun_l13_n48(x)
+    else
+        fun_l13_n406(x)
+    end
+end
+
+def fun_l12_n201(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n225(x)
+    end
+end
+
+def fun_l12_n202(x)
+    if (x < 1)
+        fun_l13_n120(x)
+    else
+        fun_l13_n72(x)
+    end
+end
+
+def fun_l12_n203(x)
+    if (x < 1)
+        fun_l13_n333(x)
+    else
+        fun_l13_n381(x)
+    end
+end
+
+def fun_l12_n204(x)
+    if (x < 1)
+        fun_l13_n558(x)
+    else
+        fun_l13_n474(x)
+    end
+end
+
+def fun_l12_n205(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n420(x)
+    end
+end
+
+def fun_l12_n206(x)
+    if (x < 1)
+        fun_l13_n287(x)
+    else
+        fun_l13_n43(x)
+    end
+end
+
+def fun_l12_n207(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n560(x)
+    end
+end
+
+def fun_l12_n208(x)
+    if (x < 1)
+        fun_l13_n707(x)
+    else
+        fun_l13_n824(x)
+    end
+end
+
+def fun_l12_n209(x)
+    if (x < 1)
+        fun_l13_n788(x)
+    else
+        fun_l13_n625(x)
+    end
+end
+
+def fun_l12_n210(x)
+    if (x < 1)
+        fun_l13_n818(x)
+    else
+        fun_l13_n667(x)
+    end
+end
+
+def fun_l12_n211(x)
+    if (x < 1)
+        fun_l13_n710(x)
+    else
+        fun_l13_n508(x)
+    end
+end
+
+def fun_l12_n212(x)
+    if (x < 1)
+        fun_l13_n497(x)
+    else
+        fun_l13_n20(x)
+    end
+end
+
+def fun_l12_n213(x)
+    if (x < 1)
+        fun_l13_n648(x)
+    else
+        fun_l13_n33(x)
+    end
+end
+
+def fun_l12_n214(x)
+    if (x < 1)
+        fun_l13_n404(x)
+    else
+        fun_l13_n918(x)
+    end
+end
+
+def fun_l12_n215(x)
+    if (x < 1)
+        fun_l13_n595(x)
+    else
+        fun_l13_n440(x)
+    end
+end
+
+def fun_l12_n216(x)
+    if (x < 1)
+        fun_l13_n302(x)
+    else
+        fun_l13_n388(x)
+    end
+end
+
+def fun_l12_n217(x)
+    if (x < 1)
+        fun_l13_n301(x)
+    else
+        fun_l13_n416(x)
+    end
+end
+
+def fun_l12_n218(x)
+    if (x < 1)
+        fun_l13_n114(x)
+    else
+        fun_l13_n650(x)
+    end
+end
+
+def fun_l12_n219(x)
+    if (x < 1)
+        fun_l13_n221(x)
+    else
+        fun_l13_n539(x)
+    end
+end
+
+def fun_l12_n220(x)
+    if (x < 1)
+        fun_l13_n529(x)
+    else
+        fun_l13_n438(x)
+    end
+end
+
+def fun_l12_n221(x)
+    if (x < 1)
+        fun_l13_n528(x)
+    else
+        fun_l13_n284(x)
+    end
+end
+
+def fun_l12_n222(x)
+    if (x < 1)
+        fun_l13_n746(x)
+    else
+        fun_l13_n634(x)
+    end
+end
+
+def fun_l12_n223(x)
+    if (x < 1)
+        fun_l13_n726(x)
+    else
+        fun_l13_n142(x)
+    end
+end
+
+def fun_l12_n224(x)
+    if (x < 1)
+        fun_l13_n57(x)
+    else
+        fun_l13_n625(x)
+    end
+end
+
+def fun_l12_n225(x)
+    if (x < 1)
+        fun_l13_n739(x)
+    else
+        fun_l13_n667(x)
+    end
+end
+
+def fun_l12_n226(x)
+    if (x < 1)
+        fun_l13_n693(x)
+    else
+        fun_l13_n819(x)
+    end
+end
+
+def fun_l12_n227(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n866(x)
+    end
+end
+
+def fun_l12_n228(x)
+    if (x < 1)
+        fun_l13_n88(x)
+    else
+        fun_l13_n336(x)
+    end
+end
+
+def fun_l12_n229(x)
+    if (x < 1)
+        fun_l13_n387(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n230(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n231(x)
+    if (x < 1)
+        fun_l13_n952(x)
+    else
+        fun_l13_n747(x)
+    end
+end
+
+def fun_l12_n232(x)
+    if (x < 1)
+        fun_l13_n107(x)
+    else
+        fun_l13_n0(x)
+    end
+end
+
+def fun_l12_n233(x)
+    if (x < 1)
+        fun_l13_n589(x)
+    else
+        fun_l13_n712(x)
+    end
+end
+
+def fun_l12_n234(x)
+    if (x < 1)
+        fun_l13_n429(x)
+    else
+        fun_l13_n845(x)
+    end
+end
+
+def fun_l12_n235(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n203(x)
+    end
+end
+
+def fun_l12_n236(x)
+    if (x < 1)
+        fun_l13_n842(x)
+    else
+        fun_l13_n134(x)
+    end
+end
+
+def fun_l12_n237(x)
+    if (x < 1)
+        fun_l13_n114(x)
+    else
+        fun_l13_n794(x)
+    end
+end
+
+def fun_l12_n238(x)
+    if (x < 1)
+        fun_l13_n463(x)
+    else
+        fun_l13_n127(x)
+    end
+end
+
+def fun_l12_n239(x)
+    if (x < 1)
+        fun_l13_n443(x)
+    else
+        fun_l13_n13(x)
+    end
+end
+
+def fun_l12_n240(x)
+    if (x < 1)
+        fun_l13_n713(x)
+    else
+        fun_l13_n447(x)
+    end
+end
+
+def fun_l12_n241(x)
+    if (x < 1)
+        fun_l13_n404(x)
+    else
+        fun_l13_n796(x)
+    end
+end
+
+def fun_l12_n242(x)
+    if (x < 1)
+        fun_l13_n277(x)
+    else
+        fun_l13_n106(x)
+    end
+end
+
+def fun_l12_n243(x)
+    if (x < 1)
+        fun_l13_n584(x)
+    else
+        fun_l13_n262(x)
+    end
+end
+
+def fun_l12_n244(x)
+    if (x < 1)
+        fun_l13_n670(x)
+    else
+        fun_l13_n989(x)
+    end
+end
+
+def fun_l12_n245(x)
+    if (x < 1)
+        fun_l13_n588(x)
+    else
+        fun_l13_n513(x)
+    end
+end
+
+def fun_l12_n246(x)
+    if (x < 1)
+        fun_l13_n98(x)
+    else
+        fun_l13_n400(x)
+    end
+end
+
+def fun_l12_n247(x)
+    if (x < 1)
+        fun_l13_n119(x)
+    else
+        fun_l13_n321(x)
+    end
+end
+
+def fun_l12_n248(x)
+    if (x < 1)
+        fun_l13_n157(x)
+    else
+        fun_l13_n557(x)
+    end
+end
+
+def fun_l12_n249(x)
+    if (x < 1)
+        fun_l13_n243(x)
+    else
+        fun_l13_n596(x)
+    end
+end
+
+def fun_l12_n250(x)
+    if (x < 1)
+        fun_l13_n280(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n251(x)
+    if (x < 1)
+        fun_l13_n437(x)
+    else
+        fun_l13_n829(x)
+    end
+end
+
+def fun_l12_n252(x)
+    if (x < 1)
+        fun_l13_n472(x)
+    else
+        fun_l13_n224(x)
+    end
+end
+
+def fun_l12_n253(x)
+    if (x < 1)
+        fun_l13_n151(x)
+    else
+        fun_l13_n168(x)
+    end
+end
+
+def fun_l12_n254(x)
+    if (x < 1)
+        fun_l13_n724(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n255(x)
+    if (x < 1)
+        fun_l13_n27(x)
+    else
+        fun_l13_n776(x)
+    end
+end
+
+def fun_l12_n256(x)
+    if (x < 1)
+        fun_l13_n116(x)
+    else
+        fun_l13_n52(x)
+    end
+end
+
+def fun_l12_n257(x)
+    if (x < 1)
+        fun_l13_n201(x)
+    else
+        fun_l13_n982(x)
+    end
+end
+
+def fun_l12_n258(x)
+    if (x < 1)
+        fun_l13_n152(x)
+    else
+        fun_l13_n818(x)
+    end
+end
+
+def fun_l12_n259(x)
+    if (x < 1)
+        fun_l13_n859(x)
+    else
+        fun_l13_n555(x)
+    end
+end
+
+def fun_l12_n260(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n416(x)
+    end
+end
+
+def fun_l12_n261(x)
+    if (x < 1)
+        fun_l13_n811(x)
+    else
+        fun_l13_n827(x)
+    end
+end
+
+def fun_l12_n262(x)
+    if (x < 1)
+        fun_l13_n867(x)
+    else
+        fun_l13_n298(x)
+    end
+end
+
+def fun_l12_n263(x)
+    if (x < 1)
+        fun_l13_n464(x)
+    else
+        fun_l13_n420(x)
+    end
+end
+
+def fun_l12_n264(x)
+    if (x < 1)
+        fun_l13_n494(x)
+    else
+        fun_l13_n368(x)
+    end
+end
+
+def fun_l12_n265(x)
+    if (x < 1)
+        fun_l13_n959(x)
+    else
+        fun_l13_n425(x)
+    end
+end
+
+def fun_l12_n266(x)
+    if (x < 1)
+        fun_l13_n841(x)
+    else
+        fun_l13_n874(x)
+    end
+end
+
+def fun_l12_n267(x)
+    if (x < 1)
+        fun_l13_n885(x)
+    else
+        fun_l13_n631(x)
+    end
+end
+
+def fun_l12_n268(x)
+    if (x < 1)
+        fun_l13_n645(x)
+    else
+        fun_l13_n342(x)
+    end
+end
+
+def fun_l12_n269(x)
+    if (x < 1)
+        fun_l13_n4(x)
+    else
+        fun_l13_n81(x)
+    end
+end
+
+def fun_l12_n270(x)
+    if (x < 1)
+        fun_l13_n44(x)
+    else
+        fun_l13_n924(x)
+    end
+end
+
+def fun_l12_n271(x)
+    if (x < 1)
+        fun_l13_n955(x)
+    else
+        fun_l13_n834(x)
+    end
+end
+
+def fun_l12_n272(x)
+    if (x < 1)
+        fun_l13_n969(x)
+    else
+        fun_l13_n699(x)
+    end
+end
+
+def fun_l12_n273(x)
+    if (x < 1)
+        fun_l13_n590(x)
+    else
+        fun_l13_n608(x)
+    end
+end
+
+def fun_l12_n274(x)
+    if (x < 1)
+        fun_l13_n170(x)
+    else
+        fun_l13_n343(x)
+    end
+end
+
+def fun_l12_n275(x)
+    if (x < 1)
+        fun_l13_n317(x)
+    else
+        fun_l13_n998(x)
+    end
+end
+
+def fun_l12_n276(x)
+    if (x < 1)
+        fun_l13_n864(x)
+    else
+        fun_l13_n644(x)
+    end
+end
+
+def fun_l12_n277(x)
+    if (x < 1)
+        fun_l13_n42(x)
+    else
+        fun_l13_n663(x)
+    end
+end
+
+def fun_l12_n278(x)
+    if (x < 1)
+        fun_l13_n39(x)
+    else
+        fun_l13_n624(x)
+    end
+end
+
+def fun_l12_n279(x)
+    if (x < 1)
+        fun_l13_n578(x)
+    else
+        fun_l13_n592(x)
+    end
+end
+
+def fun_l12_n280(x)
+    if (x < 1)
+        fun_l13_n345(x)
+    else
+        fun_l13_n462(x)
+    end
+end
+
+def fun_l12_n281(x)
+    if (x < 1)
+        fun_l13_n741(x)
+    else
+        fun_l13_n93(x)
+    end
+end
+
+def fun_l12_n282(x)
+    if (x < 1)
+        fun_l13_n845(x)
+    else
+        fun_l13_n981(x)
+    end
+end
+
+def fun_l12_n283(x)
+    if (x < 1)
+        fun_l13_n479(x)
+    else
+        fun_l13_n823(x)
+    end
+end
+
+def fun_l12_n284(x)
+    if (x < 1)
+        fun_l13_n201(x)
+    else
+        fun_l13_n526(x)
+    end
+end
+
+def fun_l12_n285(x)
+    if (x < 1)
+        fun_l13_n890(x)
+    else
+        fun_l13_n237(x)
+    end
+end
+
+def fun_l12_n286(x)
+    if (x < 1)
+        fun_l13_n377(x)
+    else
+        fun_l13_n249(x)
+    end
+end
+
+def fun_l12_n287(x)
+    if (x < 1)
+        fun_l13_n147(x)
+    else
+        fun_l13_n306(x)
+    end
+end
+
+def fun_l12_n288(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n220(x)
+    end
+end
+
+def fun_l12_n289(x)
+    if (x < 1)
+        fun_l13_n106(x)
+    else
+        fun_l13_n648(x)
+    end
+end
+
+def fun_l12_n290(x)
+    if (x < 1)
+        fun_l13_n278(x)
+    else
+        fun_l13_n255(x)
+    end
+end
+
+def fun_l12_n291(x)
+    if (x < 1)
+        fun_l13_n994(x)
+    else
+        fun_l13_n36(x)
+    end
+end
+
+def fun_l12_n292(x)
+    if (x < 1)
+        fun_l13_n731(x)
+    else
+        fun_l13_n473(x)
+    end
+end
+
+def fun_l12_n293(x)
+    if (x < 1)
+        fun_l13_n321(x)
+    else
+        fun_l13_n518(x)
+    end
+end
+
+def fun_l12_n294(x)
+    if (x < 1)
+        fun_l13_n91(x)
+    else
+        fun_l13_n765(x)
+    end
+end
+
+def fun_l12_n295(x)
+    if (x < 1)
+        fun_l13_n39(x)
+    else
+        fun_l13_n639(x)
+    end
+end
+
+def fun_l12_n296(x)
+    if (x < 1)
+        fun_l13_n800(x)
+    else
+        fun_l13_n821(x)
+    end
+end
+
+def fun_l12_n297(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n898(x)
+    end
+end
+
+def fun_l12_n298(x)
+    if (x < 1)
+        fun_l13_n487(x)
+    else
+        fun_l13_n470(x)
+    end
+end
+
+def fun_l12_n299(x)
+    if (x < 1)
+        fun_l13_n743(x)
+    else
+        fun_l13_n684(x)
+    end
+end
+
+def fun_l12_n300(x)
+    if (x < 1)
+        fun_l13_n177(x)
+    else
+        fun_l13_n375(x)
+    end
+end
+
+def fun_l12_n301(x)
+    if (x < 1)
+        fun_l13_n714(x)
+    else
+        fun_l13_n922(x)
+    end
+end
+
+def fun_l12_n302(x)
+    if (x < 1)
+        fun_l13_n845(x)
+    else
+        fun_l13_n93(x)
+    end
+end
+
+def fun_l12_n303(x)
+    if (x < 1)
+        fun_l13_n806(x)
+    else
+        fun_l13_n706(x)
+    end
+end
+
+def fun_l12_n304(x)
+    if (x < 1)
+        fun_l13_n428(x)
+    else
+        fun_l13_n942(x)
+    end
+end
+
+def fun_l12_n305(x)
+    if (x < 1)
+        fun_l13_n170(x)
+    else
+        fun_l13_n634(x)
+    end
+end
+
+def fun_l12_n306(x)
+    if (x < 1)
+        fun_l13_n998(x)
+    else
+        fun_l13_n224(x)
+    end
+end
+
+def fun_l12_n307(x)
+    if (x < 1)
+        fun_l13_n15(x)
+    else
+        fun_l13_n753(x)
+    end
+end
+
+def fun_l12_n308(x)
+    if (x < 1)
+        fun_l13_n323(x)
+    else
+        fun_l13_n846(x)
+    end
+end
+
+def fun_l12_n309(x)
+    if (x < 1)
+        fun_l13_n779(x)
+    else
+        fun_l13_n330(x)
+    end
+end
+
+def fun_l12_n310(x)
+    if (x < 1)
+        fun_l13_n652(x)
+    else
+        fun_l13_n560(x)
+    end
+end
+
+def fun_l12_n311(x)
+    if (x < 1)
+        fun_l13_n54(x)
+    else
+        fun_l13_n144(x)
+    end
+end
+
+def fun_l12_n312(x)
+    if (x < 1)
+        fun_l13_n674(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n313(x)
+    if (x < 1)
+        fun_l13_n975(x)
+    else
+        fun_l13_n109(x)
+    end
+end
+
+def fun_l12_n314(x)
+    if (x < 1)
+        fun_l13_n997(x)
+    else
+        fun_l13_n827(x)
+    end
+end
+
+def fun_l12_n315(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n349(x)
+    end
+end
+
+def fun_l12_n316(x)
+    if (x < 1)
+        fun_l13_n516(x)
+    else
+        fun_l13_n974(x)
+    end
+end
+
+def fun_l12_n317(x)
+    if (x < 1)
+        fun_l13_n538(x)
+    else
+        fun_l13_n786(x)
+    end
+end
+
+def fun_l12_n318(x)
+    if (x < 1)
+        fun_l13_n125(x)
+    else
+        fun_l13_n809(x)
+    end
+end
+
+def fun_l12_n319(x)
+    if (x < 1)
+        fun_l13_n642(x)
+    else
+        fun_l13_n188(x)
+    end
+end
+
+def fun_l12_n320(x)
+    if (x < 1)
+        fun_l13_n904(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n321(x)
+    if (x < 1)
+        fun_l13_n278(x)
+    else
+        fun_l13_n752(x)
+    end
+end
+
+def fun_l12_n322(x)
+    if (x < 1)
+        fun_l13_n566(x)
+    else
+        fun_l13_n894(x)
+    end
+end
+
+def fun_l12_n323(x)
+    if (x < 1)
+        fun_l13_n357(x)
+    else
+        fun_l13_n742(x)
+    end
+end
+
+def fun_l12_n324(x)
+    if (x < 1)
+        fun_l13_n667(x)
+    else
+        fun_l13_n764(x)
+    end
+end
+
+def fun_l12_n325(x)
+    if (x < 1)
+        fun_l13_n333(x)
+    else
+        fun_l13_n445(x)
+    end
+end
+
+def fun_l12_n326(x)
+    if (x < 1)
+        fun_l13_n669(x)
+    else
+        fun_l13_n484(x)
+    end
+end
+
+def fun_l12_n327(x)
+    if (x < 1)
+        fun_l13_n662(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n328(x)
+    if (x < 1)
+        fun_l13_n869(x)
+    else
+        fun_l13_n993(x)
+    end
+end
+
+def fun_l12_n329(x)
+    if (x < 1)
+        fun_l13_n305(x)
+    else
+        fun_l13_n45(x)
+    end
+end
+
+def fun_l12_n330(x)
+    if (x < 1)
+        fun_l13_n32(x)
+    else
+        fun_l13_n253(x)
+    end
+end
+
+def fun_l12_n331(x)
+    if (x < 1)
+        fun_l13_n45(x)
+    else
+        fun_l13_n327(x)
+    end
+end
+
+def fun_l12_n332(x)
+    if (x < 1)
+        fun_l13_n685(x)
+    else
+        fun_l13_n562(x)
+    end
+end
+
+def fun_l12_n333(x)
+    if (x < 1)
+        fun_l13_n274(x)
+    else
+        fun_l13_n461(x)
+    end
+end
+
+def fun_l12_n334(x)
+    if (x < 1)
+        fun_l13_n93(x)
+    else
+        fun_l13_n7(x)
+    end
+end
+
+def fun_l12_n335(x)
+    if (x < 1)
+        fun_l13_n742(x)
+    else
+        fun_l13_n259(x)
+    end
+end
+
+def fun_l12_n336(x)
+    if (x < 1)
+        fun_l13_n518(x)
+    else
+        fun_l13_n108(x)
+    end
+end
+
+def fun_l12_n337(x)
+    if (x < 1)
+        fun_l13_n439(x)
+    else
+        fun_l13_n21(x)
+    end
+end
+
+def fun_l12_n338(x)
+    if (x < 1)
+        fun_l13_n34(x)
+    else
+        fun_l13_n869(x)
+    end
+end
+
+def fun_l12_n339(x)
+    if (x < 1)
+        fun_l13_n995(x)
+    else
+        fun_l13_n810(x)
+    end
+end
+
+def fun_l12_n340(x)
+    if (x < 1)
+        fun_l13_n640(x)
+    else
+        fun_l13_n108(x)
+    end
+end
+
+def fun_l12_n341(x)
+    if (x < 1)
+        fun_l13_n332(x)
+    else
+        fun_l13_n174(x)
+    end
+end
+
+def fun_l12_n342(x)
+    if (x < 1)
+        fun_l13_n425(x)
+    else
+        fun_l13_n523(x)
+    end
+end
+
+def fun_l12_n343(x)
+    if (x < 1)
+        fun_l13_n886(x)
+    else
+        fun_l13_n9(x)
+    end
+end
+
+def fun_l12_n344(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n345(x)
+    if (x < 1)
+        fun_l13_n40(x)
+    else
+        fun_l13_n569(x)
+    end
+end
+
+def fun_l12_n346(x)
+    if (x < 1)
+        fun_l13_n530(x)
+    else
+        fun_l13_n52(x)
+    end
+end
+
+def fun_l12_n347(x)
+    if (x < 1)
+        fun_l13_n624(x)
+    else
+        fun_l13_n525(x)
+    end
+end
+
+def fun_l12_n348(x)
+    if (x < 1)
+        fun_l13_n106(x)
+    else
+        fun_l13_n101(x)
+    end
+end
+
+def fun_l12_n349(x)
+    if (x < 1)
+        fun_l13_n164(x)
+    else
+        fun_l13_n675(x)
+    end
+end
+
+def fun_l12_n350(x)
+    if (x < 1)
+        fun_l13_n349(x)
+    else
+        fun_l13_n125(x)
+    end
+end
+
+def fun_l12_n351(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n949(x)
+    end
+end
+
+def fun_l12_n352(x)
+    if (x < 1)
+        fun_l13_n872(x)
+    else
+        fun_l13_n678(x)
+    end
+end
+
+def fun_l12_n353(x)
+    if (x < 1)
+        fun_l13_n566(x)
+    else
+        fun_l13_n576(x)
+    end
+end
+
+def fun_l12_n354(x)
+    if (x < 1)
+        fun_l13_n978(x)
+    else
+        fun_l13_n539(x)
+    end
+end
+
+def fun_l12_n355(x)
+    if (x < 1)
+        fun_l13_n929(x)
+    else
+        fun_l13_n301(x)
+    end
+end
+
+def fun_l12_n356(x)
+    if (x < 1)
+        fun_l13_n768(x)
+    else
+        fun_l13_n292(x)
+    end
+end
+
+def fun_l12_n357(x)
+    if (x < 1)
+        fun_l13_n873(x)
+    else
+        fun_l13_n201(x)
+    end
+end
+
+def fun_l12_n358(x)
+    if (x < 1)
+        fun_l13_n852(x)
+    else
+        fun_l13_n144(x)
+    end
+end
+
+def fun_l12_n359(x)
+    if (x < 1)
+        fun_l13_n220(x)
+    else
+        fun_l13_n318(x)
+    end
+end
+
+def fun_l12_n360(x)
+    if (x < 1)
+        fun_l13_n339(x)
+    else
+        fun_l13_n896(x)
+    end
+end
+
+def fun_l12_n361(x)
+    if (x < 1)
+        fun_l13_n896(x)
+    else
+        fun_l13_n611(x)
+    end
+end
+
+def fun_l12_n362(x)
+    if (x < 1)
+        fun_l13_n237(x)
+    else
+        fun_l13_n781(x)
+    end
+end
+
+def fun_l12_n363(x)
+    if (x < 1)
+        fun_l13_n994(x)
+    else
+        fun_l13_n306(x)
+    end
+end
+
+def fun_l12_n364(x)
+    if (x < 1)
+        fun_l13_n437(x)
+    else
+        fun_l13_n634(x)
+    end
+end
+
+def fun_l12_n365(x)
+    if (x < 1)
+        fun_l13_n367(x)
+    else
+        fun_l13_n798(x)
+    end
+end
+
+def fun_l12_n366(x)
+    if (x < 1)
+        fun_l13_n831(x)
+    else
+        fun_l13_n352(x)
+    end
+end
+
+def fun_l12_n367(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n999(x)
+    end
+end
+
+def fun_l12_n368(x)
+    if (x < 1)
+        fun_l13_n214(x)
+    else
+        fun_l13_n67(x)
+    end
+end
+
+def fun_l12_n369(x)
+    if (x < 1)
+        fun_l13_n628(x)
+    else
+        fun_l13_n637(x)
+    end
+end
+
+def fun_l12_n370(x)
+    if (x < 1)
+        fun_l13_n42(x)
+    else
+        fun_l13_n631(x)
+    end
+end
+
+def fun_l12_n371(x)
+    if (x < 1)
+        fun_l13_n53(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n372(x)
+    if (x < 1)
+        fun_l13_n810(x)
+    else
+        fun_l13_n853(x)
+    end
+end
+
+def fun_l12_n373(x)
+    if (x < 1)
+        fun_l13_n257(x)
+    else
+        fun_l13_n480(x)
+    end
+end
+
+def fun_l12_n374(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n375(x)
+    if (x < 1)
+        fun_l13_n499(x)
+    else
+        fun_l13_n694(x)
+    end
+end
+
+def fun_l12_n376(x)
+    if (x < 1)
+        fun_l13_n376(x)
+    else
+        fun_l13_n99(x)
+    end
+end
+
+def fun_l12_n377(x)
+    if (x < 1)
+        fun_l13_n672(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n378(x)
+    if (x < 1)
+        fun_l13_n320(x)
+    else
+        fun_l13_n590(x)
+    end
+end
+
+def fun_l12_n379(x)
+    if (x < 1)
+        fun_l13_n678(x)
+    else
+        fun_l13_n727(x)
+    end
+end
+
+def fun_l12_n380(x)
+    if (x < 1)
+        fun_l13_n269(x)
+    else
+        fun_l13_n74(x)
+    end
+end
+
+def fun_l12_n381(x)
+    if (x < 1)
+        fun_l13_n838(x)
+    else
+        fun_l13_n105(x)
+    end
+end
+
+def fun_l12_n382(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n400(x)
+    end
+end
+
+def fun_l12_n383(x)
+    if (x < 1)
+        fun_l13_n376(x)
+    else
+        fun_l13_n829(x)
+    end
+end
+
+def fun_l12_n384(x)
+    if (x < 1)
+        fun_l13_n81(x)
+    else
+        fun_l13_n895(x)
+    end
+end
+
+def fun_l12_n385(x)
+    if (x < 1)
+        fun_l13_n718(x)
+    else
+        fun_l13_n641(x)
+    end
+end
+
+def fun_l12_n386(x)
+    if (x < 1)
+        fun_l13_n825(x)
+    else
+        fun_l13_n761(x)
+    end
+end
+
+def fun_l12_n387(x)
+    if (x < 1)
+        fun_l13_n930(x)
+    else
+        fun_l13_n204(x)
+    end
+end
+
+def fun_l12_n388(x)
+    if (x < 1)
+        fun_l13_n81(x)
+    else
+        fun_l13_n319(x)
+    end
+end
+
+def fun_l12_n389(x)
+    if (x < 1)
+        fun_l13_n40(x)
+    else
+        fun_l13_n57(x)
+    end
+end
+
+def fun_l12_n390(x)
+    if (x < 1)
+        fun_l13_n206(x)
+    else
+        fun_l13_n219(x)
+    end
+end
+
+def fun_l12_n391(x)
+    if (x < 1)
+        fun_l13_n538(x)
+    else
+        fun_l13_n239(x)
+    end
+end
+
+def fun_l12_n392(x)
+    if (x < 1)
+        fun_l13_n326(x)
+    else
+        fun_l13_n613(x)
+    end
+end
+
+def fun_l12_n393(x)
+    if (x < 1)
+        fun_l13_n860(x)
+    else
+        fun_l13_n712(x)
+    end
+end
+
+def fun_l12_n394(x)
+    if (x < 1)
+        fun_l13_n829(x)
+    else
+        fun_l13_n153(x)
+    end
+end
+
+def fun_l12_n395(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n926(x)
+    end
+end
+
+def fun_l12_n396(x)
+    if (x < 1)
+        fun_l13_n188(x)
+    else
+        fun_l13_n821(x)
+    end
+end
+
+def fun_l12_n397(x)
+    if (x < 1)
+        fun_l13_n161(x)
+    else
+        fun_l13_n284(x)
+    end
+end
+
+def fun_l12_n398(x)
+    if (x < 1)
+        fun_l13_n402(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n399(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n348(x)
+    end
+end
+
+def fun_l12_n400(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n401(x)
+    if (x < 1)
+        fun_l13_n787(x)
+    else
+        fun_l13_n5(x)
+    end
+end
+
+def fun_l12_n402(x)
+    if (x < 1)
+        fun_l13_n525(x)
+    else
+        fun_l13_n983(x)
+    end
+end
+
+def fun_l12_n403(x)
+    if (x < 1)
+        fun_l13_n185(x)
+    else
+        fun_l13_n315(x)
+    end
+end
+
+def fun_l12_n404(x)
+    if (x < 1)
+        fun_l13_n746(x)
+    else
+        fun_l13_n892(x)
+    end
+end
+
+def fun_l12_n405(x)
+    if (x < 1)
+        fun_l13_n990(x)
+    else
+        fun_l13_n868(x)
+    end
+end
+
+def fun_l12_n406(x)
+    if (x < 1)
+        fun_l13_n399(x)
+    else
+        fun_l13_n298(x)
+    end
+end
+
+def fun_l12_n407(x)
+    if (x < 1)
+        fun_l13_n283(x)
+    else
+        fun_l13_n87(x)
+    end
+end
+
+def fun_l12_n408(x)
+    if (x < 1)
+        fun_l13_n597(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n409(x)
+    if (x < 1)
+        fun_l13_n517(x)
+    else
+        fun_l13_n700(x)
+    end
+end
+
+def fun_l12_n410(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n282(x)
+    end
+end
+
+def fun_l12_n411(x)
+    if (x < 1)
+        fun_l13_n876(x)
+    else
+        fun_l13_n562(x)
+    end
+end
+
+def fun_l12_n412(x)
+    if (x < 1)
+        fun_l13_n344(x)
+    else
+        fun_l13_n182(x)
+    end
+end
+
+def fun_l12_n413(x)
+    if (x < 1)
+        fun_l13_n879(x)
+    else
+        fun_l13_n443(x)
+    end
+end
+
+def fun_l12_n414(x)
+    if (x < 1)
+        fun_l13_n335(x)
+    else
+        fun_l13_n451(x)
+    end
+end
+
+def fun_l12_n415(x)
+    if (x < 1)
+        fun_l13_n112(x)
+    else
+        fun_l13_n391(x)
+    end
+end
+
+def fun_l12_n416(x)
+    if (x < 1)
+        fun_l13_n217(x)
+    else
+        fun_l13_n221(x)
+    end
+end
+
+def fun_l12_n417(x)
+    if (x < 1)
+        fun_l13_n113(x)
+    else
+        fun_l13_n563(x)
+    end
+end
+
+def fun_l12_n418(x)
+    if (x < 1)
+        fun_l13_n486(x)
+    else
+        fun_l13_n374(x)
+    end
+end
+
+def fun_l12_n419(x)
+    if (x < 1)
+        fun_l13_n970(x)
+    else
+        fun_l13_n393(x)
+    end
+end
+
+def fun_l12_n420(x)
+    if (x < 1)
+        fun_l13_n273(x)
+    else
+        fun_l13_n64(x)
+    end
+end
+
+def fun_l12_n421(x)
+    if (x < 1)
+        fun_l13_n69(x)
+    else
+        fun_l13_n158(x)
+    end
+end
+
+def fun_l12_n422(x)
+    if (x < 1)
+        fun_l13_n308(x)
+    else
+        fun_l13_n609(x)
+    end
+end
+
+def fun_l12_n423(x)
+    if (x < 1)
+        fun_l13_n964(x)
+    else
+        fun_l13_n36(x)
+    end
+end
+
+def fun_l12_n424(x)
+    if (x < 1)
+        fun_l13_n783(x)
+    else
+        fun_l13_n513(x)
+    end
+end
+
+def fun_l12_n425(x)
+    if (x < 1)
+        fun_l13_n792(x)
+    else
+        fun_l13_n960(x)
+    end
+end
+
+def fun_l12_n426(x)
+    if (x < 1)
+        fun_l13_n160(x)
+    else
+        fun_l13_n911(x)
+    end
+end
+
+def fun_l12_n427(x)
+    if (x < 1)
+        fun_l13_n374(x)
+    else
+        fun_l13_n672(x)
+    end
+end
+
+def fun_l12_n428(x)
+    if (x < 1)
+        fun_l13_n694(x)
+    else
+        fun_l13_n166(x)
+    end
+end
+
+def fun_l12_n429(x)
+    if (x < 1)
+        fun_l13_n807(x)
+    else
+        fun_l13_n929(x)
+    end
+end
+
+def fun_l12_n430(x)
+    if (x < 1)
+        fun_l13_n997(x)
+    else
+        fun_l13_n938(x)
+    end
+end
+
+def fun_l12_n431(x)
+    if (x < 1)
+        fun_l13_n934(x)
+    else
+        fun_l13_n365(x)
+    end
+end
+
+def fun_l12_n432(x)
+    if (x < 1)
+        fun_l13_n546(x)
+    else
+        fun_l13_n272(x)
+    end
+end
+
+def fun_l12_n433(x)
+    if (x < 1)
+        fun_l13_n176(x)
+    else
+        fun_l13_n629(x)
+    end
+end
+
+def fun_l12_n434(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n165(x)
+    end
+end
+
+def fun_l12_n435(x)
+    if (x < 1)
+        fun_l13_n915(x)
+    else
+        fun_l13_n823(x)
+    end
+end
+
+def fun_l12_n436(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n437(x)
+    if (x < 1)
+        fun_l13_n353(x)
+    else
+        fun_l13_n626(x)
+    end
+end
+
+def fun_l12_n438(x)
+    if (x < 1)
+        fun_l13_n888(x)
+    else
+        fun_l13_n874(x)
+    end
+end
+
+def fun_l12_n439(x)
+    if (x < 1)
+        fun_l13_n670(x)
+    else
+        fun_l13_n279(x)
+    end
+end
+
+def fun_l12_n440(x)
+    if (x < 1)
+        fun_l13_n818(x)
+    else
+        fun_l13_n927(x)
+    end
+end
+
+def fun_l12_n441(x)
+    if (x < 1)
+        fun_l13_n686(x)
+    else
+        fun_l13_n32(x)
+    end
+end
+
+def fun_l12_n442(x)
+    if (x < 1)
+        fun_l13_n882(x)
+    else
+        fun_l13_n932(x)
+    end
+end
+
+def fun_l12_n443(x)
+    if (x < 1)
+        fun_l13_n677(x)
+    else
+        fun_l13_n267(x)
+    end
+end
+
+def fun_l12_n444(x)
+    if (x < 1)
+        fun_l13_n632(x)
+    else
+        fun_l13_n808(x)
+    end
+end
+
+def fun_l12_n445(x)
+    if (x < 1)
+        fun_l13_n159(x)
+    else
+        fun_l13_n251(x)
+    end
+end
+
+def fun_l12_n446(x)
+    if (x < 1)
+        fun_l13_n939(x)
+    else
+        fun_l13_n231(x)
+    end
+end
+
+def fun_l12_n447(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n103(x)
+    end
+end
+
+def fun_l12_n448(x)
+    if (x < 1)
+        fun_l13_n556(x)
+    else
+        fun_l13_n356(x)
+    end
+end
+
+def fun_l12_n449(x)
+    if (x < 1)
+        fun_l13_n999(x)
+    else
+        fun_l13_n722(x)
+    end
+end
+
+def fun_l12_n450(x)
+    if (x < 1)
+        fun_l13_n387(x)
+    else
+        fun_l13_n15(x)
+    end
+end
+
+def fun_l12_n451(x)
+    if (x < 1)
+        fun_l13_n736(x)
+    else
+        fun_l13_n869(x)
+    end
+end
+
+def fun_l12_n452(x)
+    if (x < 1)
+        fun_l13_n984(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n453(x)
+    if (x < 1)
+        fun_l13_n375(x)
+    else
+        fun_l13_n275(x)
+    end
+end
+
+def fun_l12_n454(x)
+    if (x < 1)
+        fun_l13_n100(x)
+    else
+        fun_l13_n956(x)
+    end
+end
+
+def fun_l12_n455(x)
+    if (x < 1)
+        fun_l13_n575(x)
+    else
+        fun_l13_n22(x)
+    end
+end
+
+def fun_l12_n456(x)
+    if (x < 1)
+        fun_l13_n515(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n457(x)
+    if (x < 1)
+        fun_l13_n953(x)
+    else
+        fun_l13_n823(x)
+    end
+end
+
+def fun_l12_n458(x)
+    if (x < 1)
+        fun_l13_n343(x)
+    else
+        fun_l13_n843(x)
+    end
+end
+
+def fun_l12_n459(x)
+    if (x < 1)
+        fun_l13_n209(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n460(x)
+    if (x < 1)
+        fun_l13_n281(x)
+    else
+        fun_l13_n165(x)
+    end
+end
+
+def fun_l12_n461(x)
+    if (x < 1)
+        fun_l13_n416(x)
+    else
+        fun_l13_n896(x)
+    end
+end
+
+def fun_l12_n462(x)
+    if (x < 1)
+        fun_l13_n677(x)
+    else
+        fun_l13_n767(x)
+    end
+end
+
+def fun_l12_n463(x)
+    if (x < 1)
+        fun_l13_n271(x)
+    else
+        fun_l13_n515(x)
+    end
+end
+
+def fun_l12_n464(x)
+    if (x < 1)
+        fun_l13_n589(x)
+    else
+        fun_l13_n447(x)
+    end
+end
+
+def fun_l12_n465(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n309(x)
+    end
+end
+
+def fun_l12_n466(x)
+    if (x < 1)
+        fun_l13_n48(x)
+    else
+        fun_l13_n999(x)
+    end
+end
+
+def fun_l12_n467(x)
+    if (x < 1)
+        fun_l13_n334(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n468(x)
+    if (x < 1)
+        fun_l13_n483(x)
+    else
+        fun_l13_n353(x)
+    end
+end
+
+def fun_l12_n469(x)
+    if (x < 1)
+        fun_l13_n893(x)
+    else
+        fun_l13_n114(x)
+    end
+end
+
+def fun_l12_n470(x)
+    if (x < 1)
+        fun_l13_n945(x)
+    else
+        fun_l13_n438(x)
+    end
+end
+
+def fun_l12_n471(x)
+    if (x < 1)
+        fun_l13_n546(x)
+    else
+        fun_l13_n181(x)
+    end
+end
+
+def fun_l12_n472(x)
+    if (x < 1)
+        fun_l13_n443(x)
+    else
+        fun_l13_n35(x)
+    end
+end
+
+def fun_l12_n473(x)
+    if (x < 1)
+        fun_l13_n611(x)
+    else
+        fun_l13_n106(x)
+    end
+end
+
+def fun_l12_n474(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n162(x)
+    end
+end
+
+def fun_l12_n475(x)
+    if (x < 1)
+        fun_l13_n104(x)
+    else
+        fun_l13_n173(x)
+    end
+end
+
+def fun_l12_n476(x)
+    if (x < 1)
+        fun_l13_n922(x)
+    else
+        fun_l13_n593(x)
+    end
+end
+
+def fun_l12_n477(x)
+    if (x < 1)
+        fun_l13_n650(x)
+    else
+        fun_l13_n659(x)
+    end
+end
+
+def fun_l12_n478(x)
+    if (x < 1)
+        fun_l13_n746(x)
+    else
+        fun_l13_n484(x)
+    end
+end
+
+def fun_l12_n479(x)
+    if (x < 1)
+        fun_l13_n366(x)
+    else
+        fun_l13_n318(x)
+    end
+end
+
+def fun_l12_n480(x)
+    if (x < 1)
+        fun_l13_n995(x)
+    else
+        fun_l13_n108(x)
+    end
+end
+
+def fun_l12_n481(x)
+    if (x < 1)
+        fun_l13_n61(x)
+    else
+        fun_l13_n426(x)
+    end
+end
+
+def fun_l12_n482(x)
+    if (x < 1)
+        fun_l13_n578(x)
+    else
+        fun_l13_n955(x)
+    end
+end
+
+def fun_l12_n483(x)
+    if (x < 1)
+        fun_l13_n650(x)
+    else
+        fun_l13_n588(x)
+    end
+end
+
+def fun_l12_n484(x)
+    if (x < 1)
+        fun_l13_n842(x)
+    else
+        fun_l13_n198(x)
+    end
+end
+
+def fun_l12_n485(x)
+    if (x < 1)
+        fun_l13_n439(x)
+    else
+        fun_l13_n372(x)
+    end
+end
+
+def fun_l12_n486(x)
+    if (x < 1)
+        fun_l13_n94(x)
+    else
+        fun_l13_n531(x)
+    end
+end
+
+def fun_l12_n487(x)
+    if (x < 1)
+        fun_l13_n743(x)
+    else
+        fun_l13_n955(x)
+    end
+end
+
+def fun_l12_n488(x)
+    if (x < 1)
+        fun_l13_n648(x)
+    else
+        fun_l13_n849(x)
+    end
+end
+
+def fun_l12_n489(x)
+    if (x < 1)
+        fun_l13_n371(x)
+    else
+        fun_l13_n972(x)
+    end
+end
+
+def fun_l12_n490(x)
+    if (x < 1)
+        fun_l13_n128(x)
+    else
+        fun_l13_n617(x)
+    end
+end
+
+def fun_l12_n491(x)
+    if (x < 1)
+        fun_l13_n22(x)
+    else
+        fun_l13_n201(x)
+    end
+end
+
+def fun_l12_n492(x)
+    if (x < 1)
+        fun_l13_n209(x)
+    else
+        fun_l13_n679(x)
+    end
+end
+
+def fun_l12_n493(x)
+    if (x < 1)
+        fun_l13_n415(x)
+    else
+        fun_l13_n765(x)
+    end
+end
+
+def fun_l12_n494(x)
+    if (x < 1)
+        fun_l13_n498(x)
+    else
+        fun_l13_n719(x)
+    end
+end
+
+def fun_l12_n495(x)
+    if (x < 1)
+        fun_l13_n492(x)
+    else
+        fun_l13_n161(x)
+    end
+end
+
+def fun_l12_n496(x)
+    if (x < 1)
+        fun_l13_n162(x)
+    else
+        fun_l13_n54(x)
+    end
+end
+
+def fun_l12_n497(x)
+    if (x < 1)
+        fun_l13_n743(x)
+    else
+        fun_l13_n834(x)
+    end
+end
+
+def fun_l12_n498(x)
+    if (x < 1)
+        fun_l13_n376(x)
+    else
+        fun_l13_n676(x)
+    end
+end
+
+def fun_l12_n499(x)
+    if (x < 1)
+        fun_l13_n626(x)
+    else
+        fun_l13_n357(x)
+    end
+end
+
+def fun_l12_n500(x)
+    if (x < 1)
+        fun_l13_n874(x)
+    else
+        fun_l13_n53(x)
+    end
+end
+
+def fun_l12_n501(x)
+    if (x < 1)
+        fun_l13_n146(x)
+    else
+        fun_l13_n732(x)
+    end
+end
+
+def fun_l12_n502(x)
+    if (x < 1)
+        fun_l13_n908(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n503(x)
+    if (x < 1)
+        fun_l13_n758(x)
+    else
+        fun_l13_n289(x)
+    end
+end
+
+def fun_l12_n504(x)
+    if (x < 1)
+        fun_l13_n913(x)
+    else
+        fun_l13_n770(x)
+    end
+end
+
+def fun_l12_n505(x)
+    if (x < 1)
+        fun_l13_n305(x)
+    else
+        fun_l13_n990(x)
+    end
+end
+
+def fun_l12_n506(x)
+    if (x < 1)
+        fun_l13_n79(x)
+    else
+        fun_l13_n199(x)
+    end
+end
+
+def fun_l12_n507(x)
+    if (x < 1)
+        fun_l13_n430(x)
+    else
+        fun_l13_n394(x)
+    end
+end
+
+def fun_l12_n508(x)
+    if (x < 1)
+        fun_l13_n835(x)
+    else
+        fun_l13_n64(x)
+    end
+end
+
+def fun_l12_n509(x)
+    if (x < 1)
+        fun_l13_n661(x)
+    else
+        fun_l13_n301(x)
+    end
+end
+
+def fun_l12_n510(x)
+    if (x < 1)
+        fun_l13_n672(x)
+    else
+        fun_l13_n498(x)
+    end
+end
+
+def fun_l12_n511(x)
+    if (x < 1)
+        fun_l13_n540(x)
+    else
+        fun_l13_n57(x)
+    end
+end
+
+def fun_l12_n512(x)
+    if (x < 1)
+        fun_l13_n634(x)
+    else
+        fun_l13_n790(x)
+    end
+end
+
+def fun_l12_n513(x)
+    if (x < 1)
+        fun_l13_n998(x)
+    else
+        fun_l13_n3(x)
+    end
+end
+
+def fun_l12_n514(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n116(x)
+    end
+end
+
+def fun_l12_n515(x)
+    if (x < 1)
+        fun_l13_n967(x)
+    else
+        fun_l13_n17(x)
+    end
+end
+
+def fun_l12_n516(x)
+    if (x < 1)
+        fun_l13_n614(x)
+    else
+        fun_l13_n260(x)
+    end
+end
+
+def fun_l12_n517(x)
+    if (x < 1)
+        fun_l13_n273(x)
+    else
+        fun_l13_n982(x)
+    end
+end
+
+def fun_l12_n518(x)
+    if (x < 1)
+        fun_l13_n786(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n519(x)
+    if (x < 1)
+        fun_l13_n990(x)
+    else
+        fun_l13_n223(x)
+    end
+end
+
+def fun_l12_n520(x)
+    if (x < 1)
+        fun_l13_n406(x)
+    else
+        fun_l13_n374(x)
+    end
+end
+
+def fun_l12_n521(x)
+    if (x < 1)
+        fun_l13_n548(x)
+    else
+        fun_l13_n160(x)
+    end
+end
+
+def fun_l12_n522(x)
+    if (x < 1)
+        fun_l13_n249(x)
+    else
+        fun_l13_n295(x)
+    end
+end
+
+def fun_l12_n523(x)
+    if (x < 1)
+        fun_l13_n434(x)
+    else
+        fun_l13_n73(x)
+    end
+end
+
+def fun_l12_n524(x)
+    if (x < 1)
+        fun_l13_n550(x)
+    else
+        fun_l13_n472(x)
+    end
+end
+
+def fun_l12_n525(x)
+    if (x < 1)
+        fun_l13_n720(x)
+    else
+        fun_l13_n979(x)
+    end
+end
+
+def fun_l12_n526(x)
+    if (x < 1)
+        fun_l13_n806(x)
+    else
+        fun_l13_n156(x)
+    end
+end
+
+def fun_l12_n527(x)
+    if (x < 1)
+        fun_l13_n689(x)
+    else
+        fun_l13_n781(x)
+    end
+end
+
+def fun_l12_n528(x)
+    if (x < 1)
+        fun_l13_n130(x)
+    else
+        fun_l13_n909(x)
+    end
+end
+
+def fun_l12_n529(x)
+    if (x < 1)
+        fun_l13_n762(x)
+    else
+        fun_l13_n301(x)
+    end
+end
+
+def fun_l12_n530(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n269(x)
+    end
+end
+
+def fun_l12_n531(x)
+    if (x < 1)
+        fun_l13_n427(x)
+    else
+        fun_l13_n279(x)
+    end
+end
+
+def fun_l12_n532(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n523(x)
+    end
+end
+
+def fun_l12_n533(x)
+    if (x < 1)
+        fun_l13_n358(x)
+    else
+        fun_l13_n386(x)
+    end
+end
+
+def fun_l12_n534(x)
+    if (x < 1)
+        fun_l13_n401(x)
+    else
+        fun_l13_n148(x)
+    end
+end
+
+def fun_l12_n535(x)
+    if (x < 1)
+        fun_l13_n588(x)
+    else
+        fun_l13_n607(x)
+    end
+end
+
+def fun_l12_n536(x)
+    if (x < 1)
+        fun_l13_n445(x)
+    else
+        fun_l13_n681(x)
+    end
+end
+
+def fun_l12_n537(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n931(x)
+    end
+end
+
+def fun_l12_n538(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n9(x)
+    end
+end
+
+def fun_l12_n539(x)
+    if (x < 1)
+        fun_l13_n584(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n540(x)
+    if (x < 1)
+        fun_l13_n147(x)
+    else
+        fun_l13_n498(x)
+    end
+end
+
+def fun_l12_n541(x)
+    if (x < 1)
+        fun_l13_n727(x)
+    else
+        fun_l13_n152(x)
+    end
+end
+
+def fun_l12_n542(x)
+    if (x < 1)
+        fun_l13_n797(x)
+    else
+        fun_l13_n789(x)
+    end
+end
+
+def fun_l12_n543(x)
+    if (x < 1)
+        fun_l13_n711(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n544(x)
+    if (x < 1)
+        fun_l13_n276(x)
+    else
+        fun_l13_n325(x)
+    end
+end
+
+def fun_l12_n545(x)
+    if (x < 1)
+        fun_l13_n800(x)
+    else
+        fun_l13_n974(x)
+    end
+end
+
+def fun_l12_n546(x)
+    if (x < 1)
+        fun_l13_n654(x)
+    else
+        fun_l13_n331(x)
+    end
+end
+
+def fun_l12_n547(x)
+    if (x < 1)
+        fun_l13_n179(x)
+    else
+        fun_l13_n395(x)
+    end
+end
+
+def fun_l12_n548(x)
+    if (x < 1)
+        fun_l13_n348(x)
+    else
+        fun_l13_n210(x)
+    end
+end
+
+def fun_l12_n549(x)
+    if (x < 1)
+        fun_l13_n669(x)
+    else
+        fun_l13_n459(x)
+    end
+end
+
+def fun_l12_n550(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n846(x)
+    end
+end
+
+def fun_l12_n551(x)
+    if (x < 1)
+        fun_l13_n262(x)
+    else
+        fun_l13_n430(x)
+    end
+end
+
+def fun_l12_n552(x)
+    if (x < 1)
+        fun_l13_n224(x)
+    else
+        fun_l13_n866(x)
+    end
+end
+
+def fun_l12_n553(x)
+    if (x < 1)
+        fun_l13_n551(x)
+    else
+        fun_l13_n30(x)
+    end
+end
+
+def fun_l12_n554(x)
+    if (x < 1)
+        fun_l13_n864(x)
+    else
+        fun_l13_n931(x)
+    end
+end
+
+def fun_l12_n555(x)
+    if (x < 1)
+        fun_l13_n427(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n556(x)
+    if (x < 1)
+        fun_l13_n603(x)
+    else
+        fun_l13_n167(x)
+    end
+end
+
+def fun_l12_n557(x)
+    if (x < 1)
+        fun_l13_n858(x)
+    else
+        fun_l13_n123(x)
+    end
+end
+
+def fun_l12_n558(x)
+    if (x < 1)
+        fun_l13_n729(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n559(x)
+    if (x < 1)
+        fun_l13_n529(x)
+    else
+        fun_l13_n114(x)
+    end
+end
+
+def fun_l12_n560(x)
+    if (x < 1)
+        fun_l13_n727(x)
+    else
+        fun_l13_n673(x)
+    end
+end
+
+def fun_l12_n561(x)
+    if (x < 1)
+        fun_l13_n742(x)
+    else
+        fun_l13_n981(x)
+    end
+end
+
+def fun_l12_n562(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n493(x)
+    end
+end
+
+def fun_l12_n563(x)
+    if (x < 1)
+        fun_l13_n207(x)
+    else
+        fun_l13_n361(x)
+    end
+end
+
+def fun_l12_n564(x)
+    if (x < 1)
+        fun_l13_n370(x)
+    else
+        fun_l13_n185(x)
+    end
+end
+
+def fun_l12_n565(x)
+    if (x < 1)
+        fun_l13_n755(x)
+    else
+        fun_l13_n28(x)
+    end
+end
+
+def fun_l12_n566(x)
+    if (x < 1)
+        fun_l13_n332(x)
+    else
+        fun_l13_n718(x)
+    end
+end
+
+def fun_l12_n567(x)
+    if (x < 1)
+        fun_l13_n329(x)
+    else
+        fun_l13_n623(x)
+    end
+end
+
+def fun_l12_n568(x)
+    if (x < 1)
+        fun_l13_n592(x)
+    else
+        fun_l13_n870(x)
+    end
+end
+
+def fun_l12_n569(x)
+    if (x < 1)
+        fun_l13_n539(x)
+    else
+        fun_l13_n68(x)
+    end
+end
+
+def fun_l12_n570(x)
+    if (x < 1)
+        fun_l13_n794(x)
+    else
+        fun_l13_n617(x)
+    end
+end
+
+def fun_l12_n571(x)
+    if (x < 1)
+        fun_l13_n801(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n572(x)
+    if (x < 1)
+        fun_l13_n781(x)
+    else
+        fun_l13_n879(x)
+    end
+end
+
+def fun_l12_n573(x)
+    if (x < 1)
+        fun_l13_n519(x)
+    else
+        fun_l13_n748(x)
+    end
+end
+
+def fun_l12_n574(x)
+    if (x < 1)
+        fun_l13_n416(x)
+    else
+        fun_l13_n908(x)
+    end
+end
+
+def fun_l12_n575(x)
+    if (x < 1)
+        fun_l13_n288(x)
+    else
+        fun_l13_n925(x)
+    end
+end
+
+def fun_l12_n576(x)
+    if (x < 1)
+        fun_l13_n398(x)
+    else
+        fun_l13_n185(x)
+    end
+end
+
+def fun_l12_n577(x)
+    if (x < 1)
+        fun_l13_n742(x)
+    else
+        fun_l13_n768(x)
+    end
+end
+
+def fun_l12_n578(x)
+    if (x < 1)
+        fun_l13_n472(x)
+    else
+        fun_l13_n474(x)
+    end
+end
+
+def fun_l12_n579(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n479(x)
+    end
+end
+
+def fun_l12_n580(x)
+    if (x < 1)
+        fun_l13_n483(x)
+    else
+        fun_l13_n60(x)
+    end
+end
+
+def fun_l12_n581(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n582(x)
+    if (x < 1)
+        fun_l13_n612(x)
+    else
+        fun_l13_n491(x)
+    end
+end
+
+def fun_l12_n583(x)
+    if (x < 1)
+        fun_l13_n320(x)
+    else
+        fun_l13_n356(x)
+    end
+end
+
+def fun_l12_n584(x)
+    if (x < 1)
+        fun_l13_n521(x)
+    else
+        fun_l13_n126(x)
+    end
+end
+
+def fun_l12_n585(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n503(x)
+    end
+end
+
+def fun_l12_n586(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n849(x)
+    end
+end
+
+def fun_l12_n587(x)
+    if (x < 1)
+        fun_l13_n192(x)
+    else
+        fun_l13_n278(x)
+    end
+end
+
+def fun_l12_n588(x)
+    if (x < 1)
+        fun_l13_n882(x)
+    else
+        fun_l13_n992(x)
+    end
+end
+
+def fun_l12_n589(x)
+    if (x < 1)
+        fun_l13_n693(x)
+    else
+        fun_l13_n734(x)
+    end
+end
+
+def fun_l12_n590(x)
+    if (x < 1)
+        fun_l13_n207(x)
+    else
+        fun_l13_n674(x)
+    end
+end
+
+def fun_l12_n591(x)
+    if (x < 1)
+        fun_l13_n409(x)
+    else
+        fun_l13_n937(x)
+    end
+end
+
+def fun_l12_n592(x)
+    if (x < 1)
+        fun_l13_n424(x)
+    else
+        fun_l13_n709(x)
+    end
+end
+
+def fun_l12_n593(x)
+    if (x < 1)
+        fun_l13_n530(x)
+    else
+        fun_l13_n50(x)
+    end
+end
+
+def fun_l12_n594(x)
+    if (x < 1)
+        fun_l13_n451(x)
+    else
+        fun_l13_n513(x)
+    end
+end
+
+def fun_l12_n595(x)
+    if (x < 1)
+        fun_l13_n522(x)
+    else
+        fun_l13_n414(x)
+    end
+end
+
+def fun_l12_n596(x)
+    if (x < 1)
+        fun_l13_n352(x)
+    else
+        fun_l13_n323(x)
+    end
+end
+
+def fun_l12_n597(x)
+    if (x < 1)
+        fun_l13_n342(x)
+    else
+        fun_l13_n362(x)
+    end
+end
+
+def fun_l12_n598(x)
+    if (x < 1)
+        fun_l13_n870(x)
+    else
+        fun_l13_n366(x)
+    end
+end
+
+def fun_l12_n599(x)
+    if (x < 1)
+        fun_l13_n562(x)
+    else
+        fun_l13_n455(x)
+    end
+end
+
+def fun_l12_n600(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n929(x)
+    end
+end
+
+def fun_l12_n601(x)
+    if (x < 1)
+        fun_l13_n498(x)
+    else
+        fun_l13_n287(x)
+    end
+end
+
+def fun_l12_n602(x)
+    if (x < 1)
+        fun_l13_n9(x)
+    else
+        fun_l13_n258(x)
+    end
+end
+
+def fun_l12_n603(x)
+    if (x < 1)
+        fun_l13_n976(x)
+    else
+        fun_l13_n604(x)
+    end
+end
+
+def fun_l12_n604(x)
+    if (x < 1)
+        fun_l13_n411(x)
+    else
+        fun_l13_n238(x)
+    end
+end
+
+def fun_l12_n605(x)
+    if (x < 1)
+        fun_l13_n80(x)
+    else
+        fun_l13_n665(x)
+    end
+end
+
+def fun_l12_n606(x)
+    if (x < 1)
+        fun_l13_n453(x)
+    else
+        fun_l13_n642(x)
+    end
+end
+
+def fun_l12_n607(x)
+    if (x < 1)
+        fun_l13_n247(x)
+    else
+        fun_l13_n651(x)
+    end
+end
+
+def fun_l12_n608(x)
+    if (x < 1)
+        fun_l13_n586(x)
+    else
+        fun_l13_n372(x)
+    end
+end
+
+def fun_l12_n609(x)
+    if (x < 1)
+        fun_l13_n623(x)
+    else
+        fun_l13_n380(x)
+    end
+end
+
+def fun_l12_n610(x)
+    if (x < 1)
+        fun_l13_n399(x)
+    else
+        fun_l13_n43(x)
+    end
+end
+
+def fun_l12_n611(x)
+    if (x < 1)
+        fun_l13_n191(x)
+    else
+        fun_l13_n211(x)
+    end
+end
+
+def fun_l12_n612(x)
+    if (x < 1)
+        fun_l13_n719(x)
+    else
+        fun_l13_n663(x)
+    end
+end
+
+def fun_l12_n613(x)
+    if (x < 1)
+        fun_l13_n849(x)
+    else
+        fun_l13_n39(x)
+    end
+end
+
+def fun_l12_n614(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n927(x)
+    end
+end
+
+def fun_l12_n615(x)
+    if (x < 1)
+        fun_l13_n358(x)
+    else
+        fun_l13_n364(x)
+    end
+end
+
+def fun_l12_n616(x)
+    if (x < 1)
+        fun_l13_n685(x)
+    else
+        fun_l13_n897(x)
+    end
+end
+
+def fun_l12_n617(x)
+    if (x < 1)
+        fun_l13_n243(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n618(x)
+    if (x < 1)
+        fun_l13_n737(x)
+    else
+        fun_l13_n187(x)
+    end
+end
+
+def fun_l12_n619(x)
+    if (x < 1)
+        fun_l13_n56(x)
+    else
+        fun_l13_n684(x)
+    end
+end
+
+def fun_l12_n620(x)
+    if (x < 1)
+        fun_l13_n865(x)
+    else
+        fun_l13_n886(x)
+    end
+end
+
+def fun_l12_n621(x)
+    if (x < 1)
+        fun_l13_n749(x)
+    else
+        fun_l13_n554(x)
+    end
+end
+
+def fun_l12_n622(x)
+    if (x < 1)
+        fun_l13_n162(x)
+    else
+        fun_l13_n600(x)
+    end
+end
+
+def fun_l12_n623(x)
+    if (x < 1)
+        fun_l13_n763(x)
+    else
+        fun_l13_n227(x)
+    end
+end
+
+def fun_l12_n624(x)
+    if (x < 1)
+        fun_l13_n767(x)
+    else
+        fun_l13_n431(x)
+    end
+end
+
+def fun_l12_n625(x)
+    if (x < 1)
+        fun_l13_n347(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n626(x)
+    if (x < 1)
+        fun_l13_n365(x)
+    else
+        fun_l13_n747(x)
+    end
+end
+
+def fun_l12_n627(x)
+    if (x < 1)
+        fun_l13_n783(x)
+    else
+        fun_l13_n597(x)
+    end
+end
+
+def fun_l12_n628(x)
+    if (x < 1)
+        fun_l13_n249(x)
+    else
+        fun_l13_n906(x)
+    end
+end
+
+def fun_l12_n629(x)
+    if (x < 1)
+        fun_l13_n803(x)
+    else
+        fun_l13_n855(x)
+    end
+end
+
+def fun_l12_n630(x)
+    if (x < 1)
+        fun_l13_n981(x)
+    else
+        fun_l13_n38(x)
+    end
+end
+
+def fun_l12_n631(x)
+    if (x < 1)
+        fun_l13_n437(x)
+    else
+        fun_l13_n158(x)
+    end
+end
+
+def fun_l12_n632(x)
+    if (x < 1)
+        fun_l13_n611(x)
+    else
+        fun_l13_n142(x)
+    end
+end
+
+def fun_l12_n633(x)
+    if (x < 1)
+        fun_l13_n880(x)
+    else
+        fun_l13_n172(x)
+    end
+end
+
+def fun_l12_n634(x)
+    if (x < 1)
+        fun_l13_n135(x)
+    else
+        fun_l13_n529(x)
+    end
+end
+
+def fun_l12_n635(x)
+    if (x < 1)
+        fun_l13_n694(x)
+    else
+        fun_l13_n949(x)
+    end
+end
+
+def fun_l12_n636(x)
+    if (x < 1)
+        fun_l13_n153(x)
+    else
+        fun_l13_n326(x)
+    end
+end
+
+def fun_l12_n637(x)
+    if (x < 1)
+        fun_l13_n318(x)
+    else
+        fun_l13_n372(x)
+    end
+end
+
+def fun_l12_n638(x)
+    if (x < 1)
+        fun_l13_n467(x)
+    else
+        fun_l13_n450(x)
+    end
+end
+
+def fun_l12_n639(x)
+    if (x < 1)
+        fun_l13_n397(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n640(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n335(x)
+    end
+end
+
+def fun_l12_n641(x)
+    if (x < 1)
+        fun_l13_n342(x)
+    else
+        fun_l13_n856(x)
+    end
+end
+
+def fun_l12_n642(x)
+    if (x < 1)
+        fun_l13_n163(x)
+    else
+        fun_l13_n979(x)
+    end
+end
+
+def fun_l12_n643(x)
+    if (x < 1)
+        fun_l13_n509(x)
+    else
+        fun_l13_n153(x)
+    end
+end
+
+def fun_l12_n644(x)
+    if (x < 1)
+        fun_l13_n3(x)
+    else
+        fun_l13_n55(x)
+    end
+end
+
+def fun_l12_n645(x)
+    if (x < 1)
+        fun_l13_n730(x)
+    else
+        fun_l13_n52(x)
+    end
+end
+
+def fun_l12_n646(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n885(x)
+    end
+end
+
+def fun_l12_n647(x)
+    if (x < 1)
+        fun_l13_n866(x)
+    else
+        fun_l13_n684(x)
+    end
+end
+
+def fun_l12_n648(x)
+    if (x < 1)
+        fun_l13_n989(x)
+    else
+        fun_l13_n511(x)
+    end
+end
+
+def fun_l12_n649(x)
+    if (x < 1)
+        fun_l13_n527(x)
+    else
+        fun_l13_n166(x)
+    end
+end
+
+def fun_l12_n650(x)
+    if (x < 1)
+        fun_l13_n507(x)
+    else
+        fun_l13_n527(x)
+    end
+end
+
+def fun_l12_n651(x)
+    if (x < 1)
+        fun_l13_n174(x)
+    else
+        fun_l13_n881(x)
+    end
+end
+
+def fun_l12_n652(x)
+    if (x < 1)
+        fun_l13_n302(x)
+    else
+        fun_l13_n3(x)
+    end
+end
+
+def fun_l12_n653(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n601(x)
+    end
+end
+
+def fun_l12_n654(x)
+    if (x < 1)
+        fun_l13_n440(x)
+    else
+        fun_l13_n286(x)
+    end
+end
+
+def fun_l12_n655(x)
+    if (x < 1)
+        fun_l13_n208(x)
+    else
+        fun_l13_n275(x)
+    end
+end
+
+def fun_l12_n656(x)
+    if (x < 1)
+        fun_l13_n954(x)
+    else
+        fun_l13_n991(x)
+    end
+end
+
+def fun_l12_n657(x)
+    if (x < 1)
+        fun_l13_n212(x)
+    else
+        fun_l13_n640(x)
+    end
+end
+
+def fun_l12_n658(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n459(x)
+    end
+end
+
+def fun_l12_n659(x)
+    if (x < 1)
+        fun_l13_n767(x)
+    else
+        fun_l13_n581(x)
+    end
+end
+
+def fun_l12_n660(x)
+    if (x < 1)
+        fun_l13_n421(x)
+    else
+        fun_l13_n19(x)
+    end
+end
+
+def fun_l12_n661(x)
+    if (x < 1)
+        fun_l13_n500(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n662(x)
+    if (x < 1)
+        fun_l13_n26(x)
+    else
+        fun_l13_n300(x)
+    end
+end
+
+def fun_l12_n663(x)
+    if (x < 1)
+        fun_l13_n160(x)
+    else
+        fun_l13_n112(x)
+    end
+end
+
+def fun_l12_n664(x)
+    if (x < 1)
+        fun_l13_n181(x)
+    else
+        fun_l13_n511(x)
+    end
+end
+
+def fun_l12_n665(x)
+    if (x < 1)
+        fun_l13_n573(x)
+    else
+        fun_l13_n283(x)
+    end
+end
+
+def fun_l12_n666(x)
+    if (x < 1)
+        fun_l13_n562(x)
+    else
+        fun_l13_n992(x)
+    end
+end
+
+def fun_l12_n667(x)
+    if (x < 1)
+        fun_l13_n426(x)
+    else
+        fun_l13_n921(x)
+    end
+end
+
+def fun_l12_n668(x)
+    if (x < 1)
+        fun_l13_n319(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n669(x)
+    if (x < 1)
+        fun_l13_n832(x)
+    else
+        fun_l13_n690(x)
+    end
+end
+
+def fun_l12_n670(x)
+    if (x < 1)
+        fun_l13_n921(x)
+    else
+        fun_l13_n964(x)
+    end
+end
+
+def fun_l12_n671(x)
+    if (x < 1)
+        fun_l13_n823(x)
+    else
+        fun_l13_n903(x)
+    end
+end
+
+def fun_l12_n672(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n914(x)
+    end
+end
+
+def fun_l12_n673(x)
+    if (x < 1)
+        fun_l13_n478(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n674(x)
+    if (x < 1)
+        fun_l13_n762(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n675(x)
+    if (x < 1)
+        fun_l13_n930(x)
+    else
+        fun_l13_n587(x)
+    end
+end
+
+def fun_l12_n676(x)
+    if (x < 1)
+        fun_l13_n351(x)
+    else
+        fun_l13_n239(x)
+    end
+end
+
+def fun_l12_n677(x)
+    if (x < 1)
+        fun_l13_n989(x)
+    else
+        fun_l13_n424(x)
+    end
+end
+
+def fun_l12_n678(x)
+    if (x < 1)
+        fun_l13_n505(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n679(x)
+    if (x < 1)
+        fun_l13_n665(x)
+    else
+        fun_l13_n536(x)
+    end
+end
+
+def fun_l12_n680(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n36(x)
+    end
+end
+
+def fun_l12_n681(x)
+    if (x < 1)
+        fun_l13_n380(x)
+    else
+        fun_l13_n340(x)
+    end
+end
+
+def fun_l12_n682(x)
+    if (x < 1)
+        fun_l13_n293(x)
+    else
+        fun_l13_n205(x)
+    end
+end
+
+def fun_l12_n683(x)
+    if (x < 1)
+        fun_l13_n412(x)
+    else
+        fun_l13_n13(x)
+    end
+end
+
+def fun_l12_n684(x)
+    if (x < 1)
+        fun_l13_n187(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n685(x)
+    if (x < 1)
+        fun_l13_n299(x)
+    else
+        fun_l13_n875(x)
+    end
+end
+
+def fun_l12_n686(x)
+    if (x < 1)
+        fun_l13_n943(x)
+    else
+        fun_l13_n96(x)
+    end
+end
+
+def fun_l12_n687(x)
+    if (x < 1)
+        fun_l13_n736(x)
+    else
+        fun_l13_n377(x)
+    end
+end
+
+def fun_l12_n688(x)
+    if (x < 1)
+        fun_l13_n559(x)
+    else
+        fun_l13_n410(x)
+    end
+end
+
+def fun_l12_n689(x)
+    if (x < 1)
+        fun_l13_n538(x)
+    else
+        fun_l13_n521(x)
+    end
+end
+
+def fun_l12_n690(x)
+    if (x < 1)
+        fun_l13_n568(x)
+    else
+        fun_l13_n838(x)
+    end
+end
+
+def fun_l12_n691(x)
+    if (x < 1)
+        fun_l13_n556(x)
+    else
+        fun_l13_n42(x)
+    end
+end
+
+def fun_l12_n692(x)
+    if (x < 1)
+        fun_l13_n137(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n693(x)
+    if (x < 1)
+        fun_l13_n974(x)
+    else
+        fun_l13_n308(x)
+    end
+end
+
+def fun_l12_n694(x)
+    if (x < 1)
+        fun_l13_n459(x)
+    else
+        fun_l13_n323(x)
+    end
+end
+
+def fun_l12_n695(x)
+    if (x < 1)
+        fun_l13_n829(x)
+    else
+        fun_l13_n909(x)
+    end
+end
+
+def fun_l12_n696(x)
+    if (x < 1)
+        fun_l13_n710(x)
+    else
+        fun_l13_n648(x)
+    end
+end
+
+def fun_l12_n697(x)
+    if (x < 1)
+        fun_l13_n27(x)
+    else
+        fun_l13_n500(x)
+    end
+end
+
+def fun_l12_n698(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n865(x)
+    end
+end
+
+def fun_l12_n699(x)
+    if (x < 1)
+        fun_l13_n126(x)
+    else
+        fun_l13_n789(x)
+    end
+end
+
+def fun_l12_n700(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n391(x)
+    end
+end
+
+def fun_l12_n701(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n48(x)
+    end
+end
+
+def fun_l12_n702(x)
+    if (x < 1)
+        fun_l13_n646(x)
+    else
+        fun_l13_n117(x)
+    end
+end
+
+def fun_l12_n703(x)
+    if (x < 1)
+        fun_l13_n461(x)
+    else
+        fun_l13_n114(x)
+    end
+end
+
+def fun_l12_n704(x)
+    if (x < 1)
+        fun_l13_n603(x)
+    else
+        fun_l13_n27(x)
+    end
+end
+
+def fun_l12_n705(x)
+    if (x < 1)
+        fun_l13_n842(x)
+    else
+        fun_l13_n792(x)
+    end
+end
+
+def fun_l12_n706(x)
+    if (x < 1)
+        fun_l13_n194(x)
+    else
+        fun_l13_n405(x)
+    end
+end
+
+def fun_l12_n707(x)
+    if (x < 1)
+        fun_l13_n975(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n708(x)
+    if (x < 1)
+        fun_l13_n919(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n709(x)
+    if (x < 1)
+        fun_l13_n293(x)
+    else
+        fun_l13_n868(x)
+    end
+end
+
+def fun_l12_n710(x)
+    if (x < 1)
+        fun_l13_n577(x)
+    else
+        fun_l13_n816(x)
+    end
+end
+
+def fun_l12_n711(x)
+    if (x < 1)
+        fun_l13_n625(x)
+    else
+        fun_l13_n319(x)
+    end
+end
+
+def fun_l12_n712(x)
+    if (x < 1)
+        fun_l13_n100(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n713(x)
+    if (x < 1)
+        fun_l13_n120(x)
+    else
+        fun_l13_n727(x)
+    end
+end
+
+def fun_l12_n714(x)
+    if (x < 1)
+        fun_l13_n346(x)
+    else
+        fun_l13_n399(x)
+    end
+end
+
+def fun_l12_n715(x)
+    if (x < 1)
+        fun_l13_n64(x)
+    else
+        fun_l13_n895(x)
+    end
+end
+
+def fun_l12_n716(x)
+    if (x < 1)
+        fun_l13_n810(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n717(x)
+    if (x < 1)
+        fun_l13_n24(x)
+    else
+        fun_l13_n851(x)
+    end
+end
+
+def fun_l12_n718(x)
+    if (x < 1)
+        fun_l13_n716(x)
+    else
+        fun_l13_n859(x)
+    end
+end
+
+def fun_l12_n719(x)
+    if (x < 1)
+        fun_l13_n556(x)
+    else
+        fun_l13_n999(x)
+    end
+end
+
+def fun_l12_n720(x)
+    if (x < 1)
+        fun_l13_n388(x)
+    else
+        fun_l13_n127(x)
+    end
+end
+
+def fun_l12_n721(x)
+    if (x < 1)
+        fun_l13_n447(x)
+    else
+        fun_l13_n880(x)
+    end
+end
+
+def fun_l12_n722(x)
+    if (x < 1)
+        fun_l13_n415(x)
+    else
+        fun_l13_n636(x)
+    end
+end
+
+def fun_l12_n723(x)
+    if (x < 1)
+        fun_l13_n315(x)
+    else
+        fun_l13_n766(x)
+    end
+end
+
+def fun_l12_n724(x)
+    if (x < 1)
+        fun_l13_n600(x)
+    else
+        fun_l13_n223(x)
+    end
+end
+
+def fun_l12_n725(x)
+    if (x < 1)
+        fun_l13_n773(x)
+    else
+        fun_l13_n523(x)
+    end
+end
+
+def fun_l12_n726(x)
+    if (x < 1)
+        fun_l13_n662(x)
+    else
+        fun_l13_n775(x)
+    end
+end
+
+def fun_l12_n727(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n247(x)
+    end
+end
+
+def fun_l12_n728(x)
+    if (x < 1)
+        fun_l13_n180(x)
+    else
+        fun_l13_n815(x)
+    end
+end
+
+def fun_l12_n729(x)
+    if (x < 1)
+        fun_l13_n786(x)
+    else
+        fun_l13_n729(x)
+    end
+end
+
+def fun_l12_n730(x)
+    if (x < 1)
+        fun_l13_n1(x)
+    else
+        fun_l13_n791(x)
+    end
+end
+
+def fun_l12_n731(x)
+    if (x < 1)
+        fun_l13_n216(x)
+    else
+        fun_l13_n682(x)
+    end
+end
+
+def fun_l12_n732(x)
+    if (x < 1)
+        fun_l13_n953(x)
+    else
+        fun_l13_n364(x)
+    end
+end
+
+def fun_l12_n733(x)
+    if (x < 1)
+        fun_l13_n164(x)
+    else
+        fun_l13_n277(x)
+    end
+end
+
+def fun_l12_n734(x)
+    if (x < 1)
+        fun_l13_n486(x)
+    else
+        fun_l13_n741(x)
+    end
+end
+
+def fun_l12_n735(x)
+    if (x < 1)
+        fun_l13_n310(x)
+    else
+        fun_l13_n940(x)
+    end
+end
+
+def fun_l12_n736(x)
+    if (x < 1)
+        fun_l13_n312(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n737(x)
+    if (x < 1)
+        fun_l13_n473(x)
+    else
+        fun_l13_n728(x)
+    end
+end
+
+def fun_l12_n738(x)
+    if (x < 1)
+        fun_l13_n602(x)
+    else
+        fun_l13_n652(x)
+    end
+end
+
+def fun_l12_n739(x)
+    if (x < 1)
+        fun_l13_n397(x)
+    else
+        fun_l13_n855(x)
+    end
+end
+
+def fun_l12_n740(x)
+    if (x < 1)
+        fun_l13_n81(x)
+    else
+        fun_l13_n32(x)
+    end
+end
+
+def fun_l12_n741(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n231(x)
+    end
+end
+
+def fun_l12_n742(x)
+    if (x < 1)
+        fun_l13_n200(x)
+    else
+        fun_l13_n440(x)
+    end
+end
+
+def fun_l12_n743(x)
+    if (x < 1)
+        fun_l13_n415(x)
+    else
+        fun_l13_n631(x)
+    end
+end
+
+def fun_l12_n744(x)
+    if (x < 1)
+        fun_l13_n353(x)
+    else
+        fun_l13_n536(x)
+    end
+end
+
+def fun_l12_n745(x)
+    if (x < 1)
+        fun_l13_n986(x)
+    else
+        fun_l13_n384(x)
+    end
+end
+
+def fun_l12_n746(x)
+    if (x < 1)
+        fun_l13_n237(x)
+    else
+        fun_l13_n583(x)
+    end
+end
+
+def fun_l12_n747(x)
+    if (x < 1)
+        fun_l13_n518(x)
+    else
+        fun_l13_n717(x)
+    end
+end
+
+def fun_l12_n748(x)
+    if (x < 1)
+        fun_l13_n242(x)
+    else
+        fun_l13_n180(x)
+    end
+end
+
+def fun_l12_n749(x)
+    if (x < 1)
+        fun_l13_n369(x)
+    else
+        fun_l13_n249(x)
+    end
+end
+
+def fun_l12_n750(x)
+    if (x < 1)
+        fun_l13_n335(x)
+    else
+        fun_l13_n180(x)
+    end
+end
+
+def fun_l12_n751(x)
+    if (x < 1)
+        fun_l13_n952(x)
+    else
+        fun_l13_n506(x)
+    end
+end
+
+def fun_l12_n752(x)
+    if (x < 1)
+        fun_l13_n941(x)
+    else
+        fun_l13_n251(x)
+    end
+end
+
+def fun_l12_n753(x)
+    if (x < 1)
+        fun_l13_n21(x)
+    else
+        fun_l13_n536(x)
+    end
+end
+
+def fun_l12_n754(x)
+    if (x < 1)
+        fun_l13_n123(x)
+    else
+        fun_l13_n976(x)
+    end
+end
+
+def fun_l12_n755(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n535(x)
+    end
+end
+
+def fun_l12_n756(x)
+    if (x < 1)
+        fun_l13_n23(x)
+    else
+        fun_l13_n976(x)
+    end
+end
+
+def fun_l12_n757(x)
+    if (x < 1)
+        fun_l13_n755(x)
+    else
+        fun_l13_n677(x)
+    end
+end
+
+def fun_l12_n758(x)
+    if (x < 1)
+        fun_l13_n692(x)
+    else
+        fun_l13_n334(x)
+    end
+end
+
+def fun_l12_n759(x)
+    if (x < 1)
+        fun_l13_n380(x)
+    else
+        fun_l13_n903(x)
+    end
+end
+
+def fun_l12_n760(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n750(x)
+    end
+end
+
+def fun_l12_n761(x)
+    if (x < 1)
+        fun_l13_n186(x)
+    else
+        fun_l13_n639(x)
+    end
+end
+
+def fun_l12_n762(x)
+    if (x < 1)
+        fun_l13_n163(x)
+    else
+        fun_l13_n273(x)
+    end
+end
+
+def fun_l12_n763(x)
+    if (x < 1)
+        fun_l13_n791(x)
+    else
+        fun_l13_n55(x)
+    end
+end
+
+def fun_l12_n764(x)
+    if (x < 1)
+        fun_l13_n10(x)
+    else
+        fun_l13_n672(x)
+    end
+end
+
+def fun_l12_n765(x)
+    if (x < 1)
+        fun_l13_n382(x)
+    else
+        fun_l13_n284(x)
+    end
+end
+
+def fun_l12_n766(x)
+    if (x < 1)
+        fun_l13_n940(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n767(x)
+    if (x < 1)
+        fun_l13_n414(x)
+    else
+        fun_l13_n997(x)
+    end
+end
+
+def fun_l12_n768(x)
+    if (x < 1)
+        fun_l13_n345(x)
+    else
+        fun_l13_n511(x)
+    end
+end
+
+def fun_l12_n769(x)
+    if (x < 1)
+        fun_l13_n915(x)
+    else
+        fun_l13_n907(x)
+    end
+end
+
+def fun_l12_n770(x)
+    if (x < 1)
+        fun_l13_n508(x)
+    else
+        fun_l13_n144(x)
+    end
+end
+
+def fun_l12_n771(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n211(x)
+    end
+end
+
+def fun_l12_n772(x)
+    if (x < 1)
+        fun_l13_n571(x)
+    else
+        fun_l13_n486(x)
+    end
+end
+
+def fun_l12_n773(x)
+    if (x < 1)
+        fun_l13_n503(x)
+    else
+        fun_l13_n561(x)
+    end
+end
+
+def fun_l12_n774(x)
+    if (x < 1)
+        fun_l13_n831(x)
+    else
+        fun_l13_n608(x)
+    end
+end
+
+def fun_l12_n775(x)
+    if (x < 1)
+        fun_l13_n254(x)
+    else
+        fun_l13_n626(x)
+    end
+end
+
+def fun_l12_n776(x)
+    if (x < 1)
+        fun_l13_n155(x)
+    else
+        fun_l13_n602(x)
+    end
+end
+
+def fun_l12_n777(x)
+    if (x < 1)
+        fun_l13_n331(x)
+    else
+        fun_l13_n837(x)
+    end
+end
+
+def fun_l12_n778(x)
+    if (x < 1)
+        fun_l13_n109(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n779(x)
+    if (x < 1)
+        fun_l13_n557(x)
+    else
+        fun_l13_n784(x)
+    end
+end
+
+def fun_l12_n780(x)
+    if (x < 1)
+        fun_l13_n719(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n781(x)
+    if (x < 1)
+        fun_l13_n63(x)
+    else
+        fun_l13_n776(x)
+    end
+end
+
+def fun_l12_n782(x)
+    if (x < 1)
+        fun_l13_n146(x)
+    else
+        fun_l13_n32(x)
+    end
+end
+
+def fun_l12_n783(x)
+    if (x < 1)
+        fun_l13_n452(x)
+    else
+        fun_l13_n621(x)
+    end
+end
+
+def fun_l12_n784(x)
+    if (x < 1)
+        fun_l13_n821(x)
+    else
+        fun_l13_n454(x)
+    end
+end
+
+def fun_l12_n785(x)
+    if (x < 1)
+        fun_l13_n943(x)
+    else
+        fun_l13_n835(x)
+    end
+end
+
+def fun_l12_n786(x)
+    if (x < 1)
+        fun_l13_n47(x)
+    else
+        fun_l13_n252(x)
+    end
+end
+
+def fun_l12_n787(x)
+    if (x < 1)
+        fun_l13_n759(x)
+    else
+        fun_l13_n820(x)
+    end
+end
+
+def fun_l12_n788(x)
+    if (x < 1)
+        fun_l13_n883(x)
+    else
+        fun_l13_n218(x)
+    end
+end
+
+def fun_l12_n789(x)
+    if (x < 1)
+        fun_l13_n10(x)
+    else
+        fun_l13_n765(x)
+    end
+end
+
+def fun_l12_n790(x)
+    if (x < 1)
+        fun_l13_n6(x)
+    else
+        fun_l13_n424(x)
+    end
+end
+
+def fun_l12_n791(x)
+    if (x < 1)
+        fun_l13_n645(x)
+    else
+        fun_l13_n598(x)
+    end
+end
+
+def fun_l12_n792(x)
+    if (x < 1)
+        fun_l13_n237(x)
+    else
+        fun_l13_n141(x)
+    end
+end
+
+def fun_l12_n793(x)
+    if (x < 1)
+        fun_l13_n793(x)
+    else
+        fun_l13_n109(x)
+    end
+end
+
+def fun_l12_n794(x)
+    if (x < 1)
+        fun_l13_n404(x)
+    else
+        fun_l13_n864(x)
+    end
+end
+
+def fun_l12_n795(x)
+    if (x < 1)
+        fun_l13_n511(x)
+    else
+        fun_l13_n620(x)
+    end
+end
+
+def fun_l12_n796(x)
+    if (x < 1)
+        fun_l13_n880(x)
+    else
+        fun_l13_n330(x)
+    end
+end
+
+def fun_l12_n797(x)
+    if (x < 1)
+        fun_l13_n637(x)
+    else
+        fun_l13_n13(x)
+    end
+end
+
+def fun_l12_n798(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n799(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n983(x)
+    end
+end
+
+def fun_l12_n800(x)
+    if (x < 1)
+        fun_l13_n502(x)
+    else
+        fun_l13_n600(x)
+    end
+end
+
+def fun_l12_n801(x)
+    if (x < 1)
+        fun_l13_n645(x)
+    else
+        fun_l13_n713(x)
+    end
+end
+
+def fun_l12_n802(x)
+    if (x < 1)
+        fun_l13_n804(x)
+    else
+        fun_l13_n475(x)
+    end
+end
+
+def fun_l12_n803(x)
+    if (x < 1)
+        fun_l13_n286(x)
+    else
+        fun_l13_n135(x)
+    end
+end
+
+def fun_l12_n804(x)
+    if (x < 1)
+        fun_l13_n420(x)
+    else
+        fun_l13_n534(x)
+    end
+end
+
+def fun_l12_n805(x)
+    if (x < 1)
+        fun_l13_n345(x)
+    else
+        fun_l13_n833(x)
+    end
+end
+
+def fun_l12_n806(x)
+    if (x < 1)
+        fun_l13_n558(x)
+    else
+        fun_l13_n831(x)
+    end
+end
+
+def fun_l12_n807(x)
+    if (x < 1)
+        fun_l13_n82(x)
+    else
+        fun_l13_n56(x)
+    end
+end
+
+def fun_l12_n808(x)
+    if (x < 1)
+        fun_l13_n809(x)
+    else
+        fun_l13_n12(x)
+    end
+end
+
+def fun_l12_n809(x)
+    if (x < 1)
+        fun_l13_n450(x)
+    else
+        fun_l13_n326(x)
+    end
+end
+
+def fun_l12_n810(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n437(x)
+    end
+end
+
+def fun_l12_n811(x)
+    if (x < 1)
+        fun_l13_n880(x)
+    else
+        fun_l13_n785(x)
+    end
+end
+
+def fun_l12_n812(x)
+    if (x < 1)
+        fun_l13_n585(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n813(x)
+    if (x < 1)
+        fun_l13_n41(x)
+    else
+        fun_l13_n911(x)
+    end
+end
+
+def fun_l12_n814(x)
+    if (x < 1)
+        fun_l13_n438(x)
+    else
+        fun_l13_n300(x)
+    end
+end
+
+def fun_l12_n815(x)
+    if (x < 1)
+        fun_l13_n363(x)
+    else
+        fun_l13_n357(x)
+    end
+end
+
+def fun_l12_n816(x)
+    if (x < 1)
+        fun_l13_n172(x)
+    else
+        fun_l13_n25(x)
+    end
+end
+
+def fun_l12_n817(x)
+    if (x < 1)
+        fun_l13_n593(x)
+    else
+        fun_l13_n853(x)
+    end
+end
+
+def fun_l12_n818(x)
+    if (x < 1)
+        fun_l13_n790(x)
+    else
+        fun_l13_n575(x)
+    end
+end
+
+def fun_l12_n819(x)
+    if (x < 1)
+        fun_l13_n795(x)
+    else
+        fun_l13_n877(x)
+    end
+end
+
+def fun_l12_n820(x)
+    if (x < 1)
+        fun_l13_n563(x)
+    else
+        fun_l13_n170(x)
+    end
+end
+
+def fun_l12_n821(x)
+    if (x < 1)
+        fun_l13_n405(x)
+    else
+        fun_l13_n985(x)
+    end
+end
+
+def fun_l12_n822(x)
+    if (x < 1)
+        fun_l13_n668(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n823(x)
+    if (x < 1)
+        fun_l13_n210(x)
+    else
+        fun_l13_n450(x)
+    end
+end
+
+def fun_l12_n824(x)
+    if (x < 1)
+        fun_l13_n817(x)
+    else
+        fun_l13_n693(x)
+    end
+end
+
+def fun_l12_n825(x)
+    if (x < 1)
+        fun_l13_n909(x)
+    else
+        fun_l13_n857(x)
+    end
+end
+
+def fun_l12_n826(x)
+    if (x < 1)
+        fun_l13_n944(x)
+    else
+        fun_l13_n601(x)
+    end
+end
+
+def fun_l12_n827(x)
+    if (x < 1)
+        fun_l13_n152(x)
+    else
+        fun_l13_n187(x)
+    end
+end
+
+def fun_l12_n828(x)
+    if (x < 1)
+        fun_l13_n735(x)
+    else
+        fun_l13_n198(x)
+    end
+end
+
+def fun_l12_n829(x)
+    if (x < 1)
+        fun_l13_n892(x)
+    else
+        fun_l13_n362(x)
+    end
+end
+
+def fun_l12_n830(x)
+    if (x < 1)
+        fun_l13_n636(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n831(x)
+    if (x < 1)
+        fun_l13_n597(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n832(x)
+    if (x < 1)
+        fun_l13_n680(x)
+    else
+        fun_l13_n477(x)
+    end
+end
+
+def fun_l12_n833(x)
+    if (x < 1)
+        fun_l13_n334(x)
+    else
+        fun_l13_n508(x)
+    end
+end
+
+def fun_l12_n834(x)
+    if (x < 1)
+        fun_l13_n927(x)
+    else
+        fun_l13_n111(x)
+    end
+end
+
+def fun_l12_n835(x)
+    if (x < 1)
+        fun_l13_n424(x)
+    else
+        fun_l13_n326(x)
+    end
+end
+
+def fun_l12_n836(x)
+    if (x < 1)
+        fun_l13_n624(x)
+    else
+        fun_l13_n270(x)
+    end
+end
+
+def fun_l12_n837(x)
+    if (x < 1)
+        fun_l13_n458(x)
+    else
+        fun_l13_n736(x)
+    end
+end
+
+def fun_l12_n838(x)
+    if (x < 1)
+        fun_l13_n881(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n839(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n374(x)
+    end
+end
+
+def fun_l12_n840(x)
+    if (x < 1)
+        fun_l13_n118(x)
+    else
+        fun_l13_n543(x)
+    end
+end
+
+def fun_l12_n841(x)
+    if (x < 1)
+        fun_l13_n270(x)
+    else
+        fun_l13_n810(x)
+    end
+end
+
+def fun_l12_n842(x)
+    if (x < 1)
+        fun_l13_n122(x)
+    else
+        fun_l13_n905(x)
+    end
+end
+
+def fun_l12_n843(x)
+    if (x < 1)
+        fun_l13_n154(x)
+    else
+        fun_l13_n636(x)
+    end
+end
+
+def fun_l12_n844(x)
+    if (x < 1)
+        fun_l13_n603(x)
+    else
+        fun_l13_n586(x)
+    end
+end
+
+def fun_l12_n845(x)
+    if (x < 1)
+        fun_l13_n264(x)
+    else
+        fun_l13_n492(x)
+    end
+end
+
+def fun_l12_n846(x)
+    if (x < 1)
+        fun_l13_n264(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n847(x)
+    if (x < 1)
+        fun_l13_n337(x)
+    else
+        fun_l13_n339(x)
+    end
+end
+
+def fun_l12_n848(x)
+    if (x < 1)
+        fun_l13_n83(x)
+    else
+        fun_l13_n454(x)
+    end
+end
+
+def fun_l12_n849(x)
+    if (x < 1)
+        fun_l13_n129(x)
+    else
+        fun_l13_n30(x)
+    end
+end
+
+def fun_l12_n850(x)
+    if (x < 1)
+        fun_l13_n602(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n851(x)
+    if (x < 1)
+        fun_l13_n650(x)
+    else
+        fun_l13_n715(x)
+    end
+end
+
+def fun_l12_n852(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n852(x)
+    end
+end
+
+def fun_l12_n853(x)
+    if (x < 1)
+        fun_l13_n946(x)
+    else
+        fun_l13_n393(x)
+    end
+end
+
+def fun_l12_n854(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n855(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n567(x)
+    end
+end
+
+def fun_l12_n856(x)
+    if (x < 1)
+        fun_l13_n531(x)
+    else
+        fun_l13_n39(x)
+    end
+end
+
+def fun_l12_n857(x)
+    if (x < 1)
+        fun_l13_n673(x)
+    else
+        fun_l13_n670(x)
+    end
+end
+
+def fun_l12_n858(x)
+    if (x < 1)
+        fun_l13_n83(x)
+    else
+        fun_l13_n588(x)
+    end
+end
+
+def fun_l12_n859(x)
+    if (x < 1)
+        fun_l13_n247(x)
+    else
+        fun_l13_n460(x)
+    end
+end
+
+def fun_l12_n860(x)
+    if (x < 1)
+        fun_l13_n621(x)
+    else
+        fun_l13_n229(x)
+    end
+end
+
+def fun_l12_n861(x)
+    if (x < 1)
+        fun_l13_n121(x)
+    else
+        fun_l13_n147(x)
+    end
+end
+
+def fun_l12_n862(x)
+    if (x < 1)
+        fun_l13_n293(x)
+    else
+        fun_l13_n976(x)
+    end
+end
+
+def fun_l12_n863(x)
+    if (x < 1)
+        fun_l13_n64(x)
+    else
+        fun_l13_n569(x)
+    end
+end
+
+def fun_l12_n864(x)
+    if (x < 1)
+        fun_l13_n802(x)
+    else
+        fun_l13_n962(x)
+    end
+end
+
+def fun_l12_n865(x)
+    if (x < 1)
+        fun_l13_n406(x)
+    else
+        fun_l13_n571(x)
+    end
+end
+
+def fun_l12_n866(x)
+    if (x < 1)
+        fun_l13_n798(x)
+    else
+        fun_l13_n418(x)
+    end
+end
+
+def fun_l12_n867(x)
+    if (x < 1)
+        fun_l13_n725(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n868(x)
+    if (x < 1)
+        fun_l13_n245(x)
+    else
+        fun_l13_n154(x)
+    end
+end
+
+def fun_l12_n869(x)
+    if (x < 1)
+        fun_l13_n954(x)
+    else
+        fun_l13_n242(x)
+    end
+end
+
+def fun_l12_n870(x)
+    if (x < 1)
+        fun_l13_n649(x)
+    else
+        fun_l13_n160(x)
+    end
+end
+
+def fun_l12_n871(x)
+    if (x < 1)
+        fun_l13_n700(x)
+    else
+        fun_l13_n863(x)
+    end
+end
+
+def fun_l12_n872(x)
+    if (x < 1)
+        fun_l13_n60(x)
+    else
+        fun_l13_n359(x)
+    end
+end
+
+def fun_l12_n873(x)
+    if (x < 1)
+        fun_l13_n820(x)
+    else
+        fun_l13_n247(x)
+    end
+end
+
+def fun_l12_n874(x)
+    if (x < 1)
+        fun_l13_n294(x)
+    else
+        fun_l13_n179(x)
+    end
+end
+
+def fun_l12_n875(x)
+    if (x < 1)
+        fun_l13_n599(x)
+    else
+        fun_l13_n309(x)
+    end
+end
+
+def fun_l12_n876(x)
+    if (x < 1)
+        fun_l13_n922(x)
+    else
+        fun_l13_n632(x)
+    end
+end
+
+def fun_l12_n877(x)
+    if (x < 1)
+        fun_l13_n921(x)
+    else
+        fun_l13_n200(x)
+    end
+end
+
+def fun_l12_n878(x)
+    if (x < 1)
+        fun_l13_n375(x)
+    else
+        fun_l13_n109(x)
+    end
+end
+
+def fun_l12_n879(x)
+    if (x < 1)
+        fun_l13_n771(x)
+    else
+        fun_l13_n758(x)
+    end
+end
+
+def fun_l12_n880(x)
+    if (x < 1)
+        fun_l13_n887(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n881(x)
+    if (x < 1)
+        fun_l13_n668(x)
+    else
+        fun_l13_n508(x)
+    end
+end
+
+def fun_l12_n882(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n883(x)
+    if (x < 1)
+        fun_l13_n328(x)
+    else
+        fun_l13_n152(x)
+    end
+end
+
+def fun_l12_n884(x)
+    if (x < 1)
+        fun_l13_n978(x)
+    else
+        fun_l13_n282(x)
+    end
+end
+
+def fun_l12_n885(x)
+    if (x < 1)
+        fun_l13_n91(x)
+    else
+        fun_l13_n592(x)
+    end
+end
+
+def fun_l12_n886(x)
+    if (x < 1)
+        fun_l13_n844(x)
+    else
+        fun_l13_n254(x)
+    end
+end
+
+def fun_l12_n887(x)
+    if (x < 1)
+        fun_l13_n49(x)
+    else
+        fun_l13_n430(x)
+    end
+end
+
+def fun_l12_n888(x)
+    if (x < 1)
+        fun_l13_n653(x)
+    else
+        fun_l13_n612(x)
+    end
+end
+
+def fun_l12_n889(x)
+    if (x < 1)
+        fun_l13_n352(x)
+    else
+        fun_l13_n228(x)
+    end
+end
+
+def fun_l12_n890(x)
+    if (x < 1)
+        fun_l13_n952(x)
+    else
+        fun_l13_n505(x)
+    end
+end
+
+def fun_l12_n891(x)
+    if (x < 1)
+        fun_l13_n381(x)
+    else
+        fun_l13_n799(x)
+    end
+end
+
+def fun_l12_n892(x)
+    if (x < 1)
+        fun_l13_n160(x)
+    else
+        fun_l13_n78(x)
+    end
+end
+
+def fun_l12_n893(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n383(x)
+    end
+end
+
+def fun_l12_n894(x)
+    if (x < 1)
+        fun_l13_n475(x)
+    else
+        fun_l13_n853(x)
+    end
+end
+
+def fun_l12_n895(x)
+    if (x < 1)
+        fun_l13_n588(x)
+    else
+        fun_l13_n452(x)
+    end
+end
+
+def fun_l12_n896(x)
+    if (x < 1)
+        fun_l13_n991(x)
+    else
+        fun_l13_n758(x)
+    end
+end
+
+def fun_l12_n897(x)
+    if (x < 1)
+        fun_l13_n808(x)
+    else
+        fun_l13_n742(x)
+    end
+end
+
+def fun_l12_n898(x)
+    if (x < 1)
+        fun_l13_n654(x)
+    else
+        fun_l13_n772(x)
+    end
+end
+
+def fun_l12_n899(x)
+    if (x < 1)
+        fun_l13_n365(x)
+    else
+        fun_l13_n3(x)
+    end
+end
+
+def fun_l12_n900(x)
+    if (x < 1)
+        fun_l13_n322(x)
+    else
+        fun_l13_n143(x)
+    end
+end
+
+def fun_l12_n901(x)
+    if (x < 1)
+        fun_l13_n833(x)
+    else
+        fun_l13_n19(x)
+    end
+end
+
+def fun_l12_n902(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n140(x)
+    end
+end
+
+def fun_l12_n903(x)
+    if (x < 1)
+        fun_l13_n866(x)
+    else
+        fun_l13_n227(x)
+    end
+end
+
+def fun_l12_n904(x)
+    if (x < 1)
+        fun_l13_n814(x)
+    else
+        fun_l13_n714(x)
+    end
+end
+
+def fun_l12_n905(x)
+    if (x < 1)
+        fun_l13_n841(x)
+    else
+        fun_l13_n802(x)
+    end
+end
+
+def fun_l12_n906(x)
+    if (x < 1)
+        fun_l13_n212(x)
+    else
+        fun_l13_n14(x)
+    end
+end
+
+def fun_l12_n907(x)
+    if (x < 1)
+        fun_l13_n35(x)
+    else
+        fun_l13_n952(x)
+    end
+end
+
+def fun_l12_n908(x)
+    if (x < 1)
+        fun_l13_n181(x)
+    else
+        fun_l13_n539(x)
+    end
+end
+
+def fun_l12_n909(x)
+    if (x < 1)
+        fun_l13_n770(x)
+    else
+        fun_l13_n80(x)
+    end
+end
+
+def fun_l12_n910(x)
+    if (x < 1)
+        fun_l13_n421(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n911(x)
+    if (x < 1)
+        fun_l13_n710(x)
+    else
+        fun_l13_n666(x)
+    end
+end
+
+def fun_l12_n912(x)
+    if (x < 1)
+        fun_l13_n319(x)
+    else
+        fun_l13_n491(x)
+    end
+end
+
+def fun_l12_n913(x)
+    if (x < 1)
+        fun_l13_n924(x)
+    else
+        fun_l13_n198(x)
+    end
+end
+
+def fun_l12_n914(x)
+    if (x < 1)
+        fun_l13_n707(x)
+    else
+        fun_l13_n91(x)
+    end
+end
+
+def fun_l12_n915(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n134(x)
+    end
+end
+
+def fun_l12_n916(x)
+    if (x < 1)
+        fun_l13_n314(x)
+    else
+        fun_l13_n831(x)
+    end
+end
+
+def fun_l12_n917(x)
+    if (x < 1)
+        fun_l13_n986(x)
+    else
+        fun_l13_n732(x)
+    end
+end
+
+def fun_l12_n918(x)
+    if (x < 1)
+        fun_l13_n787(x)
+    else
+        fun_l13_n232(x)
+    end
+end
+
+def fun_l12_n919(x)
+    if (x < 1)
+        fun_l13_n452(x)
+    else
+        fun_l13_n386(x)
+    end
+end
+
+def fun_l12_n920(x)
+    if (x < 1)
+        fun_l13_n12(x)
+    else
+        fun_l13_n264(x)
+    end
+end
+
+def fun_l12_n921(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n885(x)
+    end
+end
+
+def fun_l12_n922(x)
+    if (x < 1)
+        fun_l13_n180(x)
+    else
+        fun_l13_n509(x)
+    end
+end
+
+def fun_l12_n923(x)
+    if (x < 1)
+        fun_l13_n783(x)
+    else
+        fun_l13_n212(x)
+    end
+end
+
+def fun_l12_n924(x)
+    if (x < 1)
+        fun_l13_n623(x)
+    else
+        fun_l13_n159(x)
+    end
+end
+
+def fun_l12_n925(x)
+    if (x < 1)
+        fun_l13_n361(x)
+    else
+        fun_l13_n47(x)
+    end
+end
+
+def fun_l12_n926(x)
+    if (x < 1)
+        fun_l13_n355(x)
+    else
+        fun_l13_n337(x)
+    end
+end
+
+def fun_l12_n927(x)
+    if (x < 1)
+        fun_l13_n892(x)
+    else
+        fun_l13_n814(x)
+    end
+end
+
+def fun_l12_n928(x)
+    if (x < 1)
+        fun_l13_n173(x)
+    else
+        fun_l13_n613(x)
+    end
+end
+
+def fun_l12_n929(x)
+    if (x < 1)
+        fun_l13_n140(x)
+    else
+        fun_l13_n782(x)
+    end
+end
+
+def fun_l12_n930(x)
+    if (x < 1)
+        fun_l13_n964(x)
+    else
+        fun_l13_n830(x)
+    end
+end
+
+def fun_l12_n931(x)
+    if (x < 1)
+        fun_l13_n110(x)
+    else
+        fun_l13_n767(x)
+    end
+end
+
+def fun_l12_n932(x)
+    if (x < 1)
+        fun_l13_n738(x)
+    else
+        fun_l13_n73(x)
+    end
+end
+
+def fun_l12_n933(x)
+    if (x < 1)
+        fun_l13_n92(x)
+    else
+        fun_l13_n113(x)
+    end
+end
+
+def fun_l12_n934(x)
+    if (x < 1)
+        fun_l13_n377(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n935(x)
+    if (x < 1)
+        fun_l13_n544(x)
+    else
+        fun_l13_n808(x)
+    end
+end
+
+def fun_l12_n936(x)
+    if (x < 1)
+        fun_l13_n36(x)
+    else
+        fun_l13_n343(x)
+    end
+end
+
+def fun_l12_n937(x)
+    if (x < 1)
+        fun_l13_n745(x)
+    else
+        fun_l13_n342(x)
+    end
+end
+
+def fun_l12_n938(x)
+    if (x < 1)
+        fun_l13_n238(x)
+    else
+        fun_l13_n703(x)
+    end
+end
+
+def fun_l12_n939(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n118(x)
+    end
+end
+
+def fun_l12_n940(x)
+    if (x < 1)
+        fun_l13_n90(x)
+    else
+        fun_l13_n0(x)
+    end
+end
+
+def fun_l12_n941(x)
+    if (x < 1)
+        fun_l13_n586(x)
+    else
+        fun_l13_n99(x)
+    end
+end
+
+def fun_l12_n942(x)
+    if (x < 1)
+        fun_l13_n755(x)
+    else
+        fun_l13_n573(x)
+    end
+end
+
+def fun_l12_n943(x)
+    if (x < 1)
+        fun_l13_n74(x)
+    else
+        fun_l13_n805(x)
+    end
+end
+
+def fun_l12_n944(x)
+    if (x < 1)
+        fun_l13_n574(x)
+    else
+        fun_l13_n876(x)
+    end
+end
+
+def fun_l12_n945(x)
+    if (x < 1)
+        fun_l13_n0(x)
+    else
+        fun_l13_n478(x)
+    end
+end
+
+def fun_l12_n946(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n957(x)
+    end
+end
+
+def fun_l12_n947(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n285(x)
+    end
+end
+
+def fun_l12_n948(x)
+    if (x < 1)
+        fun_l13_n215(x)
+    else
+        fun_l13_n914(x)
+    end
+end
+
+def fun_l12_n949(x)
+    if (x < 1)
+        fun_l13_n265(x)
+    else
+        fun_l13_n262(x)
+    end
+end
+
+def fun_l12_n950(x)
+    if (x < 1)
+        fun_l13_n44(x)
+    else
+        fun_l13_n917(x)
+    end
+end
+
+def fun_l12_n951(x)
+    if (x < 1)
+        fun_l13_n222(x)
+    else
+        fun_l13_n53(x)
+    end
+end
+
+def fun_l12_n952(x)
+    if (x < 1)
+        fun_l13_n149(x)
+    else
+        fun_l13_n11(x)
+    end
+end
+
+def fun_l12_n953(x)
+    if (x < 1)
+        fun_l13_n827(x)
+    else
+        fun_l13_n737(x)
+    end
+end
+
+def fun_l12_n954(x)
+    if (x < 1)
+        fun_l13_n655(x)
+    else
+        fun_l13_n308(x)
+    end
+end
+
+def fun_l12_n955(x)
+    if (x < 1)
+        fun_l13_n108(x)
+    else
+        fun_l13_n940(x)
+    end
+end
+
+def fun_l12_n956(x)
+    if (x < 1)
+        fun_l13_n236(x)
+    else
+        fun_l13_n259(x)
+    end
+end
+
+def fun_l12_n957(x)
+    if (x < 1)
+        fun_l13_n886(x)
+    else
+        fun_l13_n955(x)
+    end
+end
+
+def fun_l12_n958(x)
+    if (x < 1)
+        fun_l13_n688(x)
+    else
+        fun_l13_n391(x)
+    end
+end
+
+def fun_l12_n959(x)
+    if (x < 1)
+        fun_l13_n521(x)
+    else
+        fun_l13_n395(x)
+    end
+end
+
+def fun_l12_n960(x)
+    if (x < 1)
+        fun_l13_n877(x)
+    else
+        fun_l13_n808(x)
+    end
+end
+
+def fun_l12_n961(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n422(x)
+    end
+end
+
+def fun_l12_n962(x)
+    if (x < 1)
+        fun_l13_n417(x)
+    else
+        fun_l13_n310(x)
+    end
+end
+
+def fun_l12_n963(x)
+    if (x < 1)
+        fun_l13_n987(x)
+    else
+        fun_l13_n462(x)
+    end
+end
+
+def fun_l12_n964(x)
+    if (x < 1)
+        fun_l13_n914(x)
+    else
+        fun_l13_n115(x)
+    end
+end
+
+def fun_l12_n965(x)
+    if (x < 1)
+        fun_l13_n895(x)
+    else
+        fun_l13_n504(x)
+    end
+end
+
+def fun_l12_n966(x)
+    if (x < 1)
+        fun_l13_n304(x)
+    else
+        fun_l13_n788(x)
+    end
+end
+
+def fun_l12_n967(x)
+    if (x < 1)
+        fun_l13_n354(x)
+    else
+        fun_l13_n592(x)
+    end
+end
+
+def fun_l12_n968(x)
+    if (x < 1)
+        fun_l13_n231(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n969(x)
+    if (x < 1)
+        fun_l13_n435(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n970(x)
+    if (x < 1)
+        fun_l13_n261(x)
+    else
+        fun_l13_n139(x)
+    end
+end
+
+def fun_l12_n971(x)
+    if (x < 1)
+        fun_l13_n320(x)
+    else
+        fun_l13_n749(x)
+    end
+end
+
+def fun_l12_n972(x)
+    if (x < 1)
+        fun_l13_n56(x)
+    else
+        fun_l13_n207(x)
+    end
+end
+
+def fun_l12_n973(x)
+    if (x < 1)
+        fun_l13_n238(x)
+    else
+        fun_l13_n637(x)
+    end
+end
+
+def fun_l12_n974(x)
+    if (x < 1)
+        fun_l13_n474(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n975(x)
+    if (x < 1)
+        fun_l13_n552(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n976(x)
+    if (x < 1)
+        fun_l13_n127(x)
+    else
+        fun_l13_n571(x)
+    end
+end
+
+def fun_l12_n977(x)
+    if (x < 1)
+        fun_l13_n261(x)
+    else
+        fun_l13_n845(x)
+    end
+end
+
+def fun_l12_n978(x)
+    if (x < 1)
+        fun_l13_n280(x)
+    else
+        fun_l13_n465(x)
+    end
+end
+
+def fun_l12_n979(x)
+    if (x < 1)
+        fun_l13_n249(x)
+    else
+        fun_l13_n66(x)
+    end
+end
+
+def fun_l12_n980(x)
+    if (x < 1)
+        fun_l13_n306(x)
+    else
+        fun_l13_n53(x)
+    end
+end
+
+def fun_l12_n981(x)
+    if (x < 1)
+        fun_l13_n827(x)
+    else
+        fun_l13_n395(x)
+    end
+end
+
+def fun_l12_n982(x)
+    if (x < 1)
+        fun_l13_n858(x)
+    else
+        fun_l13_n644(x)
+    end
+end
+
+def fun_l12_n983(x)
+    if (x < 1)
+        fun_l13_n50(x)
+    else
+        fun_l13_n671(x)
+    end
+end
+
+def fun_l12_n984(x)
+    if (x < 1)
+        fun_l13_n629(x)
+    else
+        fun_l13_n55(x)
+    end
+end
+
+def fun_l12_n985(x)
+    if (x < 1)
+        fun_l13_n73(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n986(x)
+    if (x < 1)
+        fun_l13_n197(x)
+    else
+        fun_l13_n444(x)
+    end
+end
+
+def fun_l12_n987(x)
+    if (x < 1)
+        fun_l13_n108(x)
+    else
+        fun_l13_n898(x)
+    end
+end
+
+def fun_l12_n988(x)
+    if (x < 1)
+        fun_l13_n153(x)
+    else
+        fun_l13_n278(x)
+    end
+end
+
+def fun_l12_n989(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n712(x)
+    end
+end
+
+def fun_l12_n990(x)
+    if (x < 1)
+        fun_l13_n711(x)
+    else
+        fun_l13_n825(x)
+    end
+end
+
+def fun_l12_n991(x)
+    if (x < 1)
+        fun_l13_n767(x)
+    else
+        fun_l13_n169(x)
+    end
+end
+
+def fun_l12_n992(x)
+    if (x < 1)
+        fun_l13_n917(x)
+    else
+        fun_l13_n524(x)
+    end
+end
+
+def fun_l12_n993(x)
+    if (x < 1)
+        fun_l13_n589(x)
+    else
+        fun_l13_n695(x)
+    end
+end
+
+def fun_l12_n994(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n764(x)
+    end
+end
+
+def fun_l12_n995(x)
+    if (x < 1)
+        fun_l13_n86(x)
+    else
+        fun_l13_n547(x)
+    end
+end
+
+def fun_l12_n996(x)
+    if (x < 1)
+        fun_l13_n236(x)
+    else
+        fun_l13_n197(x)
+    end
+end
+
+def fun_l12_n997(x)
+    if (x < 1)
+        fun_l13_n592(x)
+    else
+        fun_l13_n313(x)
+    end
+end
+
+def fun_l12_n998(x)
+    if (x < 1)
+        fun_l13_n878(x)
+    else
+        fun_l13_n439(x)
+    end
+end
+
+def fun_l12_n999(x)
+    if (x < 1)
+        fun_l13_n904(x)
+    else
+        fun_l13_n651(x)
+    end
+end
+
+def fun_l13_n0(x)
+    if (x < 1)
+        fun_l14_n72(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n1(x)
+    if (x < 1)
+        fun_l14_n950(x)
+    else
+        fun_l14_n170(x)
+    end
+end
+
+def fun_l13_n2(x)
+    if (x < 1)
+        fun_l14_n773(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n3(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n304(x)
+    end
+end
+
+def fun_l13_n4(x)
+    if (x < 1)
+        fun_l14_n395(x)
+    else
+        fun_l14_n187(x)
+    end
+end
+
+def fun_l13_n5(x)
+    if (x < 1)
+        fun_l14_n60(x)
+    else
+        fun_l14_n165(x)
+    end
+end
+
+def fun_l13_n6(x)
+    if (x < 1)
+        fun_l14_n711(x)
+    else
+        fun_l14_n815(x)
+    end
+end
+
+def fun_l13_n7(x)
+    if (x < 1)
+        fun_l14_n396(x)
+    else
+        fun_l14_n614(x)
+    end
+end
+
+def fun_l13_n8(x)
+    if (x < 1)
+        fun_l14_n477(x)
+    else
+        fun_l14_n427(x)
+    end
+end
+
+def fun_l13_n9(x)
+    if (x < 1)
+        fun_l14_n803(x)
+    else
+        fun_l14_n655(x)
+    end
+end
+
+def fun_l13_n10(x)
+    if (x < 1)
+        fun_l14_n261(x)
+    else
+        fun_l14_n324(x)
+    end
+end
+
+def fun_l13_n11(x)
+    if (x < 1)
+        fun_l14_n485(x)
+    else
+        fun_l14_n302(x)
+    end
+end
+
+def fun_l13_n12(x)
+    if (x < 1)
+        fun_l14_n324(x)
+    else
+        fun_l14_n840(x)
+    end
+end
+
+def fun_l13_n13(x)
+    if (x < 1)
+        fun_l14_n811(x)
+    else
+        fun_l14_n357(x)
+    end
+end
+
+def fun_l13_n14(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n763(x)
+    end
+end
+
+def fun_l13_n15(x)
+    if (x < 1)
+        fun_l14_n572(x)
+    else
+        fun_l14_n557(x)
+    end
+end
+
+def fun_l13_n16(x)
+    if (x < 1)
+        fun_l14_n406(x)
+    else
+        fun_l14_n200(x)
+    end
+end
+
+def fun_l13_n17(x)
+    if (x < 1)
+        fun_l14_n500(x)
+    else
+        fun_l14_n480(x)
+    end
+end
+
+def fun_l13_n18(x)
+    if (x < 1)
+        fun_l14_n215(x)
+    else
+        fun_l14_n241(x)
+    end
+end
+
+def fun_l13_n19(x)
+    if (x < 1)
+        fun_l14_n341(x)
+    else
+        fun_l14_n142(x)
+    end
+end
+
+def fun_l13_n20(x)
+    if (x < 1)
+        fun_l14_n649(x)
+    else
+        fun_l14_n853(x)
+    end
+end
+
+def fun_l13_n21(x)
+    if (x < 1)
+        fun_l14_n153(x)
+    else
+        fun_l14_n295(x)
+    end
+end
+
+def fun_l13_n22(x)
+    if (x < 1)
+        fun_l14_n210(x)
+    else
+        fun_l14_n947(x)
+    end
+end
+
+def fun_l13_n23(x)
+    if (x < 1)
+        fun_l14_n764(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n24(x)
+    if (x < 1)
+        fun_l14_n96(x)
+    else
+        fun_l14_n359(x)
+    end
+end
+
+def fun_l13_n25(x)
+    if (x < 1)
+        fun_l14_n542(x)
+    else
+        fun_l14_n506(x)
+    end
+end
+
+def fun_l13_n26(x)
+    if (x < 1)
+        fun_l14_n583(x)
+    else
+        fun_l14_n754(x)
+    end
+end
+
+def fun_l13_n27(x)
+    if (x < 1)
+        fun_l14_n881(x)
+    else
+        fun_l14_n693(x)
+    end
+end
+
+def fun_l13_n28(x)
+    if (x < 1)
+        fun_l14_n385(x)
+    else
+        fun_l14_n628(x)
+    end
+end
+
+def fun_l13_n29(x)
+    if (x < 1)
+        fun_l14_n429(x)
+    else
+        fun_l14_n370(x)
+    end
+end
+
+def fun_l13_n30(x)
+    if (x < 1)
+        fun_l14_n484(x)
+    else
+        fun_l14_n724(x)
+    end
+end
+
+def fun_l13_n31(x)
+    if (x < 1)
+        fun_l14_n328(x)
+    else
+        fun_l14_n857(x)
+    end
+end
+
+def fun_l13_n32(x)
+    if (x < 1)
+        fun_l14_n367(x)
+    else
+        fun_l14_n441(x)
+    end
+end
+
+def fun_l13_n33(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n390(x)
+    end
+end
+
+def fun_l13_n34(x)
+    if (x < 1)
+        fun_l14_n935(x)
+    else
+        fun_l14_n46(x)
+    end
+end
+
+def fun_l13_n35(x)
+    if (x < 1)
+        fun_l14_n274(x)
+    else
+        fun_l14_n536(x)
+    end
+end
+
+def fun_l13_n36(x)
+    if (x < 1)
+        fun_l14_n645(x)
+    else
+        fun_l14_n396(x)
+    end
+end
+
+def fun_l13_n37(x)
+    if (x < 1)
+        fun_l14_n905(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n38(x)
+    if (x < 1)
+        fun_l14_n562(x)
+    else
+        fun_l14_n983(x)
+    end
+end
+
+def fun_l13_n39(x)
+    if (x < 1)
+        fun_l14_n846(x)
+    else
+        fun_l14_n140(x)
+    end
+end
+
+def fun_l13_n40(x)
+    if (x < 1)
+        fun_l14_n308(x)
+    else
+        fun_l14_n968(x)
+    end
+end
+
+def fun_l13_n41(x)
+    if (x < 1)
+        fun_l14_n299(x)
+    else
+        fun_l14_n364(x)
+    end
+end
+
+def fun_l13_n42(x)
+    if (x < 1)
+        fun_l14_n266(x)
+    else
+        fun_l14_n368(x)
+    end
+end
+
+def fun_l13_n43(x)
+    if (x < 1)
+        fun_l14_n216(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n44(x)
+    if (x < 1)
+        fun_l14_n30(x)
+    else
+        fun_l14_n118(x)
+    end
+end
+
+def fun_l13_n45(x)
+    if (x < 1)
+        fun_l14_n66(x)
+    else
+        fun_l14_n677(x)
+    end
+end
+
+def fun_l13_n46(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n311(x)
+    end
+end
+
+def fun_l13_n47(x)
+    if (x < 1)
+        fun_l14_n63(x)
+    else
+        fun_l14_n410(x)
+    end
+end
+
+def fun_l13_n48(x)
+    if (x < 1)
+        fun_l14_n640(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n49(x)
+    if (x < 1)
+        fun_l14_n546(x)
+    else
+        fun_l14_n655(x)
+    end
+end
+
+def fun_l13_n50(x)
+    if (x < 1)
+        fun_l14_n102(x)
+    else
+        fun_l14_n791(x)
+    end
+end
+
+def fun_l13_n51(x)
+    if (x < 1)
+        fun_l14_n333(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n52(x)
+    if (x < 1)
+        fun_l14_n16(x)
+    else
+        fun_l14_n653(x)
+    end
+end
+
+def fun_l13_n53(x)
+    if (x < 1)
+        fun_l14_n842(x)
+    else
+        fun_l14_n780(x)
+    end
+end
+
+def fun_l13_n54(x)
+    if (x < 1)
+        fun_l14_n663(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n55(x)
+    if (x < 1)
+        fun_l14_n745(x)
+    else
+        fun_l14_n925(x)
+    end
+end
+
+def fun_l13_n56(x)
+    if (x < 1)
+        fun_l14_n688(x)
+    else
+        fun_l14_n930(x)
+    end
+end
+
+def fun_l13_n57(x)
+    if (x < 1)
+        fun_l14_n58(x)
+    else
+        fun_l14_n864(x)
+    end
+end
+
+def fun_l13_n58(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n59(x)
+    if (x < 1)
+        fun_l14_n334(x)
+    else
+        fun_l14_n147(x)
+    end
+end
+
+def fun_l13_n60(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n417(x)
+    end
+end
+
+def fun_l13_n61(x)
+    if (x < 1)
+        fun_l14_n696(x)
+    else
+        fun_l14_n973(x)
+    end
+end
+
+def fun_l13_n62(x)
+    if (x < 1)
+        fun_l14_n378(x)
+    else
+        fun_l14_n968(x)
+    end
+end
+
+def fun_l13_n63(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n100(x)
+    end
+end
+
+def fun_l13_n64(x)
+    if (x < 1)
+        fun_l14_n105(x)
+    else
+        fun_l14_n393(x)
+    end
+end
+
+def fun_l13_n65(x)
+    if (x < 1)
+        fun_l14_n833(x)
+    else
+        fun_l14_n424(x)
+    end
+end
+
+def fun_l13_n66(x)
+    if (x < 1)
+        fun_l14_n125(x)
+    else
+        fun_l14_n697(x)
+    end
+end
+
+def fun_l13_n67(x)
+    if (x < 1)
+        fun_l14_n684(x)
+    else
+        fun_l14_n458(x)
+    end
+end
+
+def fun_l13_n68(x)
+    if (x < 1)
+        fun_l14_n301(x)
+    else
+        fun_l14_n711(x)
+    end
+end
+
+def fun_l13_n69(x)
+    if (x < 1)
+        fun_l14_n131(x)
+    else
+        fun_l14_n552(x)
+    end
+end
+
+def fun_l13_n70(x)
+    if (x < 1)
+        fun_l14_n425(x)
+    else
+        fun_l14_n241(x)
+    end
+end
+
+def fun_l13_n71(x)
+    if (x < 1)
+        fun_l14_n531(x)
+    else
+        fun_l14_n364(x)
+    end
+end
+
+def fun_l13_n72(x)
+    if (x < 1)
+        fun_l14_n801(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n73(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n294(x)
+    end
+end
+
+def fun_l13_n74(x)
+    if (x < 1)
+        fun_l14_n715(x)
+    else
+        fun_l14_n606(x)
+    end
+end
+
+def fun_l13_n75(x)
+    if (x < 1)
+        fun_l14_n932(x)
+    else
+        fun_l14_n928(x)
+    end
+end
+
+def fun_l13_n76(x)
+    if (x < 1)
+        fun_l14_n930(x)
+    else
+        fun_l14_n102(x)
+    end
+end
+
+def fun_l13_n77(x)
+    if (x < 1)
+        fun_l14_n293(x)
+    else
+        fun_l14_n301(x)
+    end
+end
+
+def fun_l13_n78(x)
+    if (x < 1)
+        fun_l14_n270(x)
+    else
+        fun_l14_n715(x)
+    end
+end
+
+def fun_l13_n79(x)
+    if (x < 1)
+        fun_l14_n862(x)
+    else
+        fun_l14_n589(x)
+    end
+end
+
+def fun_l13_n80(x)
+    if (x < 1)
+        fun_l14_n337(x)
+    else
+        fun_l14_n940(x)
+    end
+end
+
+def fun_l13_n81(x)
+    if (x < 1)
+        fun_l14_n394(x)
+    else
+        fun_l14_n902(x)
+    end
+end
+
+def fun_l13_n82(x)
+    if (x < 1)
+        fun_l14_n468(x)
+    else
+        fun_l14_n816(x)
+    end
+end
+
+def fun_l13_n83(x)
+    if (x < 1)
+        fun_l14_n517(x)
+    else
+        fun_l14_n633(x)
+    end
+end
+
+def fun_l13_n84(x)
+    if (x < 1)
+        fun_l14_n312(x)
+    else
+        fun_l14_n473(x)
+    end
+end
+
+def fun_l13_n85(x)
+    if (x < 1)
+        fun_l14_n377(x)
+    else
+        fun_l14_n616(x)
+    end
+end
+
+def fun_l13_n86(x)
+    if (x < 1)
+        fun_l14_n541(x)
+    else
+        fun_l14_n77(x)
+    end
+end
+
+def fun_l13_n87(x)
+    if (x < 1)
+        fun_l14_n66(x)
+    else
+        fun_l14_n162(x)
+    end
+end
+
+def fun_l13_n88(x)
+    if (x < 1)
+        fun_l14_n202(x)
+    else
+        fun_l14_n158(x)
+    end
+end
+
+def fun_l13_n89(x)
+    if (x < 1)
+        fun_l14_n549(x)
+    else
+        fun_l14_n947(x)
+    end
+end
+
+def fun_l13_n90(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n747(x)
+    end
+end
+
+def fun_l13_n91(x)
+    if (x < 1)
+        fun_l14_n374(x)
+    else
+        fun_l14_n738(x)
+    end
+end
+
+def fun_l13_n92(x)
+    if (x < 1)
+        fun_l14_n124(x)
+    else
+        fun_l14_n673(x)
+    end
+end
+
+def fun_l13_n93(x)
+    if (x < 1)
+        fun_l14_n405(x)
+    else
+        fun_l14_n562(x)
+    end
+end
+
+def fun_l13_n94(x)
+    if (x < 1)
+        fun_l14_n766(x)
+    else
+        fun_l14_n466(x)
+    end
+end
+
+def fun_l13_n95(x)
+    if (x < 1)
+        fun_l14_n908(x)
+    else
+        fun_l14_n208(x)
+    end
+end
+
+def fun_l13_n96(x)
+    if (x < 1)
+        fun_l14_n439(x)
+    else
+        fun_l14_n964(x)
+    end
+end
+
+def fun_l13_n97(x)
+    if (x < 1)
+        fun_l14_n529(x)
+    else
+        fun_l14_n374(x)
+    end
+end
+
+def fun_l13_n98(x)
+    if (x < 1)
+        fun_l14_n723(x)
+    else
+        fun_l14_n464(x)
+    end
+end
+
+def fun_l13_n99(x)
+    if (x < 1)
+        fun_l14_n849(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n100(x)
+    if (x < 1)
+        fun_l14_n797(x)
+    else
+        fun_l14_n421(x)
+    end
+end
+
+def fun_l13_n101(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n392(x)
+    end
+end
+
+def fun_l13_n102(x)
+    if (x < 1)
+        fun_l14_n8(x)
+    else
+        fun_l14_n913(x)
+    end
+end
+
+def fun_l13_n103(x)
+    if (x < 1)
+        fun_l14_n498(x)
+    else
+        fun_l14_n248(x)
+    end
+end
+
+def fun_l13_n104(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n83(x)
+    end
+end
+
+def fun_l13_n105(x)
+    if (x < 1)
+        fun_l14_n943(x)
+    else
+        fun_l14_n358(x)
+    end
+end
+
+def fun_l13_n106(x)
+    if (x < 1)
+        fun_l14_n252(x)
+    else
+        fun_l14_n626(x)
+    end
+end
+
+def fun_l13_n107(x)
+    if (x < 1)
+        fun_l14_n495(x)
+    else
+        fun_l14_n627(x)
+    end
+end
+
+def fun_l13_n108(x)
+    if (x < 1)
+        fun_l14_n286(x)
+    else
+        fun_l14_n500(x)
+    end
+end
+
+def fun_l13_n109(x)
+    if (x < 1)
+        fun_l14_n927(x)
+    else
+        fun_l14_n627(x)
+    end
+end
+
+def fun_l13_n110(x)
+    if (x < 1)
+        fun_l14_n103(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l13_n111(x)
+    if (x < 1)
+        fun_l14_n730(x)
+    else
+        fun_l14_n960(x)
+    end
+end
+
+def fun_l13_n112(x)
+    if (x < 1)
+        fun_l14_n188(x)
+    else
+        fun_l14_n145(x)
+    end
+end
+
+def fun_l13_n113(x)
+    if (x < 1)
+        fun_l14_n361(x)
+    else
+        fun_l14_n707(x)
+    end
+end
+
+def fun_l13_n114(x)
+    if (x < 1)
+        fun_l14_n629(x)
+    else
+        fun_l14_n536(x)
+    end
+end
+
+def fun_l13_n115(x)
+    if (x < 1)
+        fun_l14_n276(x)
+    else
+        fun_l14_n244(x)
+    end
+end
+
+def fun_l13_n116(x)
+    if (x < 1)
+        fun_l14_n512(x)
+    else
+        fun_l14_n578(x)
+    end
+end
+
+def fun_l13_n117(x)
+    if (x < 1)
+        fun_l14_n448(x)
+    else
+        fun_l14_n437(x)
+    end
+end
+
+def fun_l13_n118(x)
+    if (x < 1)
+        fun_l14_n855(x)
+    else
+        fun_l14_n617(x)
+    end
+end
+
+def fun_l13_n119(x)
+    if (x < 1)
+        fun_l14_n467(x)
+    else
+        fun_l14_n594(x)
+    end
+end
+
+def fun_l13_n120(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n765(x)
+    end
+end
+
+def fun_l13_n121(x)
+    if (x < 1)
+        fun_l14_n700(x)
+    else
+        fun_l14_n189(x)
+    end
+end
+
+def fun_l13_n122(x)
+    if (x < 1)
+        fun_l14_n731(x)
+    else
+        fun_l14_n469(x)
+    end
+end
+
+def fun_l13_n123(x)
+    if (x < 1)
+        fun_l14_n6(x)
+    else
+        fun_l14_n451(x)
+    end
+end
+
+def fun_l13_n124(x)
+    if (x < 1)
+        fun_l14_n402(x)
+    else
+        fun_l14_n445(x)
+    end
+end
+
+def fun_l13_n125(x)
+    if (x < 1)
+        fun_l14_n412(x)
+    else
+        fun_l14_n551(x)
+    end
+end
+
+def fun_l13_n126(x)
+    if (x < 1)
+        fun_l14_n295(x)
+    else
+        fun_l14_n180(x)
+    end
+end
+
+def fun_l13_n127(x)
+    if (x < 1)
+        fun_l14_n873(x)
+    else
+        fun_l14_n209(x)
+    end
+end
+
+def fun_l13_n128(x)
+    if (x < 1)
+        fun_l14_n181(x)
+    else
+        fun_l14_n198(x)
+    end
+end
+
+def fun_l13_n129(x)
+    if (x < 1)
+        fun_l14_n817(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n130(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n429(x)
+    end
+end
+
+def fun_l13_n131(x)
+    if (x < 1)
+        fun_l14_n573(x)
+    else
+        fun_l14_n120(x)
+    end
+end
+
+def fun_l13_n132(x)
+    if (x < 1)
+        fun_l14_n433(x)
+    else
+        fun_l14_n668(x)
+    end
+end
+
+def fun_l13_n133(x)
+    if (x < 1)
+        fun_l14_n653(x)
+    else
+        fun_l14_n934(x)
+    end
+end
+
+def fun_l13_n134(x)
+    if (x < 1)
+        fun_l14_n280(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n135(x)
+    if (x < 1)
+        fun_l14_n471(x)
+    else
+        fun_l14_n612(x)
+    end
+end
+
+def fun_l13_n136(x)
+    if (x < 1)
+        fun_l14_n55(x)
+    else
+        fun_l14_n684(x)
+    end
+end
+
+def fun_l13_n137(x)
+    if (x < 1)
+        fun_l14_n458(x)
+    else
+        fun_l14_n107(x)
+    end
+end
+
+def fun_l13_n138(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n189(x)
+    end
+end
+
+def fun_l13_n139(x)
+    if (x < 1)
+        fun_l14_n877(x)
+    else
+        fun_l14_n862(x)
+    end
+end
+
+def fun_l13_n140(x)
+    if (x < 1)
+        fun_l14_n471(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n141(x)
+    if (x < 1)
+        fun_l14_n817(x)
+    else
+        fun_l14_n121(x)
+    end
+end
+
+def fun_l13_n142(x)
+    if (x < 1)
+        fun_l14_n523(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n143(x)
+    if (x < 1)
+        fun_l14_n893(x)
+    else
+        fun_l14_n187(x)
+    end
+end
+
+def fun_l13_n144(x)
+    if (x < 1)
+        fun_l14_n921(x)
+    else
+        fun_l14_n253(x)
+    end
+end
+
+def fun_l13_n145(x)
+    if (x < 1)
+        fun_l14_n0(x)
+    else
+        fun_l14_n608(x)
+    end
+end
+
+def fun_l13_n146(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n450(x)
+    end
+end
+
+def fun_l13_n147(x)
+    if (x < 1)
+        fun_l14_n689(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n148(x)
+    if (x < 1)
+        fun_l14_n922(x)
+    else
+        fun_l14_n417(x)
+    end
+end
+
+def fun_l13_n149(x)
+    if (x < 1)
+        fun_l14_n449(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n150(x)
+    if (x < 1)
+        fun_l14_n601(x)
+    else
+        fun_l14_n442(x)
+    end
+end
+
+def fun_l13_n151(x)
+    if (x < 1)
+        fun_l14_n96(x)
+    else
+        fun_l14_n552(x)
+    end
+end
+
+def fun_l13_n152(x)
+    if (x < 1)
+        fun_l14_n667(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n153(x)
+    if (x < 1)
+        fun_l14_n445(x)
+    else
+        fun_l14_n81(x)
+    end
+end
+
+def fun_l13_n154(x)
+    if (x < 1)
+        fun_l14_n906(x)
+    else
+        fun_l14_n960(x)
+    end
+end
+
+def fun_l13_n155(x)
+    if (x < 1)
+        fun_l14_n781(x)
+    else
+        fun_l14_n763(x)
+    end
+end
+
+def fun_l13_n156(x)
+    if (x < 1)
+        fun_l14_n201(x)
+    else
+        fun_l14_n886(x)
+    end
+end
+
+def fun_l13_n157(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n852(x)
+    end
+end
+
+def fun_l13_n158(x)
+    if (x < 1)
+        fun_l14_n114(x)
+    else
+        fun_l14_n23(x)
+    end
+end
+
+def fun_l13_n159(x)
+    if (x < 1)
+        fun_l14_n967(x)
+    else
+        fun_l14_n885(x)
+    end
+end
+
+def fun_l13_n160(x)
+    if (x < 1)
+        fun_l14_n563(x)
+    else
+        fun_l14_n309(x)
+    end
+end
+
+def fun_l13_n161(x)
+    if (x < 1)
+        fun_l14_n26(x)
+    else
+        fun_l14_n232(x)
+    end
+end
+
+def fun_l13_n162(x)
+    if (x < 1)
+        fun_l14_n212(x)
+    else
+        fun_l14_n147(x)
+    end
+end
+
+def fun_l13_n163(x)
+    if (x < 1)
+        fun_l14_n841(x)
+    else
+        fun_l14_n636(x)
+    end
+end
+
+def fun_l13_n164(x)
+    if (x < 1)
+        fun_l14_n405(x)
+    else
+        fun_l14_n709(x)
+    end
+end
+
+def fun_l13_n165(x)
+    if (x < 1)
+        fun_l14_n803(x)
+    else
+        fun_l14_n398(x)
+    end
+end
+
+def fun_l13_n166(x)
+    if (x < 1)
+        fun_l14_n112(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n167(x)
+    if (x < 1)
+        fun_l14_n414(x)
+    else
+        fun_l14_n509(x)
+    end
+end
+
+def fun_l13_n168(x)
+    if (x < 1)
+        fun_l14_n585(x)
+    else
+        fun_l14_n166(x)
+    end
+end
+
+def fun_l13_n169(x)
+    if (x < 1)
+        fun_l14_n653(x)
+    else
+        fun_l14_n581(x)
+    end
+end
+
+def fun_l13_n170(x)
+    if (x < 1)
+        fun_l14_n291(x)
+    else
+        fun_l14_n520(x)
+    end
+end
+
+def fun_l13_n171(x)
+    if (x < 1)
+        fun_l14_n920(x)
+    else
+        fun_l14_n599(x)
+    end
+end
+
+def fun_l13_n172(x)
+    if (x < 1)
+        fun_l14_n125(x)
+    else
+        fun_l14_n84(x)
+    end
+end
+
+def fun_l13_n173(x)
+    if (x < 1)
+        fun_l14_n635(x)
+    else
+        fun_l14_n224(x)
+    end
+end
+
+def fun_l13_n174(x)
+    if (x < 1)
+        fun_l14_n23(x)
+    else
+        fun_l14_n922(x)
+    end
+end
+
+def fun_l13_n175(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n685(x)
+    end
+end
+
+def fun_l13_n176(x)
+    if (x < 1)
+        fun_l14_n235(x)
+    else
+        fun_l14_n157(x)
+    end
+end
+
+def fun_l13_n177(x)
+    if (x < 1)
+        fun_l14_n284(x)
+    else
+        fun_l14_n601(x)
+    end
+end
+
+def fun_l13_n178(x)
+    if (x < 1)
+        fun_l14_n785(x)
+    else
+        fun_l14_n498(x)
+    end
+end
+
+def fun_l13_n179(x)
+    if (x < 1)
+        fun_l14_n416(x)
+    else
+        fun_l14_n624(x)
+    end
+end
+
+def fun_l13_n180(x)
+    if (x < 1)
+        fun_l14_n747(x)
+    else
+        fun_l14_n824(x)
+    end
+end
+
+def fun_l13_n181(x)
+    if (x < 1)
+        fun_l14_n658(x)
+    else
+        fun_l14_n814(x)
+    end
+end
+
+def fun_l13_n182(x)
+    if (x < 1)
+        fun_l14_n723(x)
+    else
+        fun_l14_n365(x)
+    end
+end
+
+def fun_l13_n183(x)
+    if (x < 1)
+        fun_l14_n772(x)
+    else
+        fun_l14_n831(x)
+    end
+end
+
+def fun_l13_n184(x)
+    if (x < 1)
+        fun_l14_n560(x)
+    else
+        fun_l14_n933(x)
+    end
+end
+
+def fun_l13_n185(x)
+    if (x < 1)
+        fun_l14_n550(x)
+    else
+        fun_l14_n716(x)
+    end
+end
+
+def fun_l13_n186(x)
+    if (x < 1)
+        fun_l14_n72(x)
+    else
+        fun_l14_n224(x)
+    end
+end
+
+def fun_l13_n187(x)
+    if (x < 1)
+        fun_l14_n910(x)
+    else
+        fun_l14_n31(x)
+    end
+end
+
+def fun_l13_n188(x)
+    if (x < 1)
+        fun_l14_n792(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n189(x)
+    if (x < 1)
+        fun_l14_n42(x)
+    else
+        fun_l14_n942(x)
+    end
+end
+
+def fun_l13_n190(x)
+    if (x < 1)
+        fun_l14_n520(x)
+    else
+        fun_l14_n826(x)
+    end
+end
+
+def fun_l13_n191(x)
+    if (x < 1)
+        fun_l14_n723(x)
+    else
+        fun_l14_n5(x)
+    end
+end
+
+def fun_l13_n192(x)
+    if (x < 1)
+        fun_l14_n448(x)
+    else
+        fun_l14_n243(x)
+    end
+end
+
+def fun_l13_n193(x)
+    if (x < 1)
+        fun_l14_n722(x)
+    else
+        fun_l14_n450(x)
+    end
+end
+
+def fun_l13_n194(x)
+    if (x < 1)
+        fun_l14_n31(x)
+    else
+        fun_l14_n968(x)
+    end
+end
+
+def fun_l13_n195(x)
+    if (x < 1)
+        fun_l14_n381(x)
+    else
+        fun_l14_n964(x)
+    end
+end
+
+def fun_l13_n196(x)
+    if (x < 1)
+        fun_l14_n797(x)
+    else
+        fun_l14_n216(x)
+    end
+end
+
+def fun_l13_n197(x)
+    if (x < 1)
+        fun_l14_n351(x)
+    else
+        fun_l14_n439(x)
+    end
+end
+
+def fun_l13_n198(x)
+    if (x < 1)
+        fun_l14_n983(x)
+    else
+        fun_l14_n363(x)
+    end
+end
+
+def fun_l13_n199(x)
+    if (x < 1)
+        fun_l14_n939(x)
+    else
+        fun_l14_n806(x)
+    end
+end
+
+def fun_l13_n200(x)
+    if (x < 1)
+        fun_l14_n710(x)
+    else
+        fun_l14_n513(x)
+    end
+end
+
+def fun_l13_n201(x)
+    if (x < 1)
+        fun_l14_n431(x)
+    else
+        fun_l14_n81(x)
+    end
+end
+
+def fun_l13_n202(x)
+    if (x < 1)
+        fun_l14_n41(x)
+    else
+        fun_l14_n916(x)
+    end
+end
+
+def fun_l13_n203(x)
+    if (x < 1)
+        fun_l14_n368(x)
+    else
+        fun_l14_n626(x)
+    end
+end
+
+def fun_l13_n204(x)
+    if (x < 1)
+        fun_l14_n505(x)
+    else
+        fun_l14_n750(x)
+    end
+end
+
+def fun_l13_n205(x)
+    if (x < 1)
+        fun_l14_n263(x)
+    else
+        fun_l14_n636(x)
+    end
+end
+
+def fun_l13_n206(x)
+    if (x < 1)
+        fun_l14_n589(x)
+    else
+        fun_l14_n215(x)
+    end
+end
+
+def fun_l13_n207(x)
+    if (x < 1)
+        fun_l14_n435(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n208(x)
+    if (x < 1)
+        fun_l14_n114(x)
+    else
+        fun_l14_n222(x)
+    end
+end
+
+def fun_l13_n209(x)
+    if (x < 1)
+        fun_l14_n784(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n210(x)
+    if (x < 1)
+        fun_l14_n434(x)
+    else
+        fun_l14_n79(x)
+    end
+end
+
+def fun_l13_n211(x)
+    if (x < 1)
+        fun_l14_n152(x)
+    else
+        fun_l14_n428(x)
+    end
+end
+
+def fun_l13_n212(x)
+    if (x < 1)
+        fun_l14_n24(x)
+    else
+        fun_l14_n101(x)
+    end
+end
+
+def fun_l13_n213(x)
+    if (x < 1)
+        fun_l14_n880(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n214(x)
+    if (x < 1)
+        fun_l14_n824(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n215(x)
+    if (x < 1)
+        fun_l14_n657(x)
+    else
+        fun_l14_n822(x)
+    end
+end
+
+def fun_l13_n216(x)
+    if (x < 1)
+        fun_l14_n603(x)
+    else
+        fun_l14_n993(x)
+    end
+end
+
+def fun_l13_n217(x)
+    if (x < 1)
+        fun_l14_n593(x)
+    else
+        fun_l14_n808(x)
+    end
+end
+
+def fun_l13_n218(x)
+    if (x < 1)
+        fun_l14_n30(x)
+    else
+        fun_l14_n632(x)
+    end
+end
+
+def fun_l13_n219(x)
+    if (x < 1)
+        fun_l14_n175(x)
+    else
+        fun_l14_n124(x)
+    end
+end
+
+def fun_l13_n220(x)
+    if (x < 1)
+        fun_l14_n878(x)
+    else
+        fun_l14_n342(x)
+    end
+end
+
+def fun_l13_n221(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n204(x)
+    end
+end
+
+def fun_l13_n222(x)
+    if (x < 1)
+        fun_l14_n29(x)
+    else
+        fun_l14_n573(x)
+    end
+end
+
+def fun_l13_n223(x)
+    if (x < 1)
+        fun_l14_n329(x)
+    else
+        fun_l14_n35(x)
+    end
+end
+
+def fun_l13_n224(x)
+    if (x < 1)
+        fun_l14_n31(x)
+    else
+        fun_l14_n323(x)
+    end
+end
+
+def fun_l13_n225(x)
+    if (x < 1)
+        fun_l14_n921(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n226(x)
+    if (x < 1)
+        fun_l14_n599(x)
+    else
+        fun_l14_n566(x)
+    end
+end
+
+def fun_l13_n227(x)
+    if (x < 1)
+        fun_l14_n994(x)
+    else
+        fun_l14_n549(x)
+    end
+end
+
+def fun_l13_n228(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n212(x)
+    end
+end
+
+def fun_l13_n229(x)
+    if (x < 1)
+        fun_l14_n22(x)
+    else
+        fun_l14_n656(x)
+    end
+end
+
+def fun_l13_n230(x)
+    if (x < 1)
+        fun_l14_n232(x)
+    else
+        fun_l14_n658(x)
+    end
+end
+
+def fun_l13_n231(x)
+    if (x < 1)
+        fun_l14_n522(x)
+    else
+        fun_l14_n596(x)
+    end
+end
+
+def fun_l13_n232(x)
+    if (x < 1)
+        fun_l14_n296(x)
+    else
+        fun_l14_n53(x)
+    end
+end
+
+def fun_l13_n233(x)
+    if (x < 1)
+        fun_l14_n958(x)
+    else
+        fun_l14_n818(x)
+    end
+end
+
+def fun_l13_n234(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n299(x)
+    end
+end
+
+def fun_l13_n235(x)
+    if (x < 1)
+        fun_l14_n776(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n236(x)
+    if (x < 1)
+        fun_l14_n204(x)
+    else
+        fun_l14_n34(x)
+    end
+end
+
+def fun_l13_n237(x)
+    if (x < 1)
+        fun_l14_n704(x)
+    else
+        fun_l14_n808(x)
+    end
+end
+
+def fun_l13_n238(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n352(x)
+    end
+end
+
+def fun_l13_n239(x)
+    if (x < 1)
+        fun_l14_n382(x)
+    else
+        fun_l14_n447(x)
+    end
+end
+
+def fun_l13_n240(x)
+    if (x < 1)
+        fun_l14_n200(x)
+    else
+        fun_l14_n623(x)
+    end
+end
+
+def fun_l13_n241(x)
+    if (x < 1)
+        fun_l14_n563(x)
+    else
+        fun_l14_n259(x)
+    end
+end
+
+def fun_l13_n242(x)
+    if (x < 1)
+        fun_l14_n126(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n243(x)
+    if (x < 1)
+        fun_l14_n287(x)
+    else
+        fun_l14_n441(x)
+    end
+end
+
+def fun_l13_n244(x)
+    if (x < 1)
+        fun_l14_n271(x)
+    else
+        fun_l14_n961(x)
+    end
+end
+
+def fun_l13_n245(x)
+    if (x < 1)
+        fun_l14_n677(x)
+    else
+        fun_l14_n310(x)
+    end
+end
+
+def fun_l13_n246(x)
+    if (x < 1)
+        fun_l14_n504(x)
+    else
+        fun_l14_n504(x)
+    end
+end
+
+def fun_l13_n247(x)
+    if (x < 1)
+        fun_l14_n61(x)
+    else
+        fun_l14_n560(x)
+    end
+end
+
+def fun_l13_n248(x)
+    if (x < 1)
+        fun_l14_n813(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n249(x)
+    if (x < 1)
+        fun_l14_n89(x)
+    else
+        fun_l14_n733(x)
+    end
+end
+
+def fun_l13_n250(x)
+    if (x < 1)
+        fun_l14_n203(x)
+    else
+        fun_l14_n342(x)
+    end
+end
+
+def fun_l13_n251(x)
+    if (x < 1)
+        fun_l14_n605(x)
+    else
+        fun_l14_n767(x)
+    end
+end
+
+def fun_l13_n252(x)
+    if (x < 1)
+        fun_l14_n35(x)
+    else
+        fun_l14_n338(x)
+    end
+end
+
+def fun_l13_n253(x)
+    if (x < 1)
+        fun_l14_n894(x)
+    else
+        fun_l14_n905(x)
+    end
+end
+
+def fun_l13_n254(x)
+    if (x < 1)
+        fun_l14_n516(x)
+    else
+        fun_l14_n832(x)
+    end
+end
+
+def fun_l13_n255(x)
+    if (x < 1)
+        fun_l14_n106(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n256(x)
+    if (x < 1)
+        fun_l14_n978(x)
+    else
+        fun_l14_n940(x)
+    end
+end
+
+def fun_l13_n257(x)
+    if (x < 1)
+        fun_l14_n808(x)
+    else
+        fun_l14_n906(x)
+    end
+end
+
+def fun_l13_n258(x)
+    if (x < 1)
+        fun_l14_n435(x)
+    else
+        fun_l14_n55(x)
+    end
+end
+
+def fun_l13_n259(x)
+    if (x < 1)
+        fun_l14_n981(x)
+    else
+        fun_l14_n550(x)
+    end
+end
+
+def fun_l13_n260(x)
+    if (x < 1)
+        fun_l14_n689(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n261(x)
+    if (x < 1)
+        fun_l14_n995(x)
+    else
+        fun_l14_n174(x)
+    end
+end
+
+def fun_l13_n262(x)
+    if (x < 1)
+        fun_l14_n161(x)
+    else
+        fun_l14_n357(x)
+    end
+end
+
+def fun_l13_n263(x)
+    if (x < 1)
+        fun_l14_n248(x)
+    else
+        fun_l14_n509(x)
+    end
+end
+
+def fun_l13_n264(x)
+    if (x < 1)
+        fun_l14_n521(x)
+    else
+        fun_l14_n41(x)
+    end
+end
+
+def fun_l13_n265(x)
+    if (x < 1)
+        fun_l14_n771(x)
+    else
+        fun_l14_n387(x)
+    end
+end
+
+def fun_l13_n266(x)
+    if (x < 1)
+        fun_l14_n149(x)
+    else
+        fun_l14_n814(x)
+    end
+end
+
+def fun_l13_n267(x)
+    if (x < 1)
+        fun_l14_n958(x)
+    else
+        fun_l14_n172(x)
+    end
+end
+
+def fun_l13_n268(x)
+    if (x < 1)
+        fun_l14_n167(x)
+    else
+        fun_l14_n889(x)
+    end
+end
+
+def fun_l13_n269(x)
+    if (x < 1)
+        fun_l14_n321(x)
+    else
+        fun_l14_n152(x)
+    end
+end
+
+def fun_l13_n270(x)
+    if (x < 1)
+        fun_l14_n851(x)
+    else
+        fun_l14_n793(x)
+    end
+end
+
+def fun_l13_n271(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n843(x)
+    end
+end
+
+def fun_l13_n272(x)
+    if (x < 1)
+        fun_l14_n499(x)
+    else
+        fun_l14_n118(x)
+    end
+end
+
+def fun_l13_n273(x)
+    if (x < 1)
+        fun_l14_n958(x)
+    else
+        fun_l14_n597(x)
+    end
+end
+
+def fun_l13_n274(x)
+    if (x < 1)
+        fun_l14_n884(x)
+    else
+        fun_l14_n23(x)
+    end
+end
+
+def fun_l13_n275(x)
+    if (x < 1)
+        fun_l14_n203(x)
+    else
+        fun_l14_n796(x)
+    end
+end
+
+def fun_l13_n276(x)
+    if (x < 1)
+        fun_l14_n944(x)
+    else
+        fun_l14_n239(x)
+    end
+end
+
+def fun_l13_n277(x)
+    if (x < 1)
+        fun_l14_n511(x)
+    else
+        fun_l14_n464(x)
+    end
+end
+
+def fun_l13_n278(x)
+    if (x < 1)
+        fun_l14_n906(x)
+    else
+        fun_l14_n713(x)
+    end
+end
+
+def fun_l13_n279(x)
+    if (x < 1)
+        fun_l14_n872(x)
+    else
+        fun_l14_n77(x)
+    end
+end
+
+def fun_l13_n280(x)
+    if (x < 1)
+        fun_l14_n888(x)
+    else
+        fun_l14_n117(x)
+    end
+end
+
+def fun_l13_n281(x)
+    if (x < 1)
+        fun_l14_n298(x)
+    else
+        fun_l14_n695(x)
+    end
+end
+
+def fun_l13_n282(x)
+    if (x < 1)
+        fun_l14_n740(x)
+    else
+        fun_l14_n668(x)
+    end
+end
+
+def fun_l13_n283(x)
+    if (x < 1)
+        fun_l14_n438(x)
+    else
+        fun_l14_n322(x)
+    end
+end
+
+def fun_l13_n284(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n39(x)
+    end
+end
+
+def fun_l13_n285(x)
+    if (x < 1)
+        fun_l14_n271(x)
+    else
+        fun_l14_n984(x)
+    end
+end
+
+def fun_l13_n286(x)
+    if (x < 1)
+        fun_l14_n278(x)
+    else
+        fun_l14_n453(x)
+    end
+end
+
+def fun_l13_n287(x)
+    if (x < 1)
+        fun_l14_n303(x)
+    else
+        fun_l14_n812(x)
+    end
+end
+
+def fun_l13_n288(x)
+    if (x < 1)
+        fun_l14_n891(x)
+    else
+        fun_l14_n843(x)
+    end
+end
+
+def fun_l13_n289(x)
+    if (x < 1)
+        fun_l14_n672(x)
+    else
+        fun_l14_n543(x)
+    end
+end
+
+def fun_l13_n290(x)
+    if (x < 1)
+        fun_l14_n115(x)
+    else
+        fun_l14_n33(x)
+    end
+end
+
+def fun_l13_n291(x)
+    if (x < 1)
+        fun_l14_n467(x)
+    else
+        fun_l14_n427(x)
+    end
+end
+
+def fun_l13_n292(x)
+    if (x < 1)
+        fun_l14_n528(x)
+    else
+        fun_l14_n51(x)
+    end
+end
+
+def fun_l13_n293(x)
+    if (x < 1)
+        fun_l14_n50(x)
+    else
+        fun_l14_n917(x)
+    end
+end
+
+def fun_l13_n294(x)
+    if (x < 1)
+        fun_l14_n245(x)
+    else
+        fun_l14_n289(x)
+    end
+end
+
+def fun_l13_n295(x)
+    if (x < 1)
+        fun_l14_n108(x)
+    else
+        fun_l14_n772(x)
+    end
+end
+
+def fun_l13_n296(x)
+    if (x < 1)
+        fun_l14_n451(x)
+    else
+        fun_l14_n127(x)
+    end
+end
+
+def fun_l13_n297(x)
+    if (x < 1)
+        fun_l14_n374(x)
+    else
+        fun_l14_n20(x)
+    end
+end
+
+def fun_l13_n298(x)
+    if (x < 1)
+        fun_l14_n588(x)
+    else
+        fun_l14_n95(x)
+    end
+end
+
+def fun_l13_n299(x)
+    if (x < 1)
+        fun_l14_n33(x)
+    else
+        fun_l14_n146(x)
+    end
+end
+
+def fun_l13_n300(x)
+    if (x < 1)
+        fun_l14_n812(x)
+    else
+        fun_l14_n373(x)
+    end
+end
+
+def fun_l13_n301(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n228(x)
+    end
+end
+
+def fun_l13_n302(x)
+    if (x < 1)
+        fun_l14_n992(x)
+    else
+        fun_l14_n578(x)
+    end
+end
+
+def fun_l13_n303(x)
+    if (x < 1)
+        fun_l14_n106(x)
+    else
+        fun_l14_n413(x)
+    end
+end
+
+def fun_l13_n304(x)
+    if (x < 1)
+        fun_l14_n463(x)
+    else
+        fun_l14_n884(x)
+    end
+end
+
+def fun_l13_n305(x)
+    if (x < 1)
+        fun_l14_n754(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n306(x)
+    if (x < 1)
+        fun_l14_n960(x)
+    else
+        fun_l14_n596(x)
+    end
+end
+
+def fun_l13_n307(x)
+    if (x < 1)
+        fun_l14_n858(x)
+    else
+        fun_l14_n488(x)
+    end
+end
+
+def fun_l13_n308(x)
+    if (x < 1)
+        fun_l14_n968(x)
+    else
+        fun_l14_n507(x)
+    end
+end
+
+def fun_l13_n309(x)
+    if (x < 1)
+        fun_l14_n956(x)
+    else
+        fun_l14_n125(x)
+    end
+end
+
+def fun_l13_n310(x)
+    if (x < 1)
+        fun_l14_n190(x)
+    else
+        fun_l14_n817(x)
+    end
+end
+
+def fun_l13_n311(x)
+    if (x < 1)
+        fun_l14_n574(x)
+    else
+        fun_l14_n447(x)
+    end
+end
+
+def fun_l13_n312(x)
+    if (x < 1)
+        fun_l14_n403(x)
+    else
+        fun_l14_n591(x)
+    end
+end
+
+def fun_l13_n313(x)
+    if (x < 1)
+        fun_l14_n499(x)
+    else
+        fun_l14_n458(x)
+    end
+end
+
+def fun_l13_n314(x)
+    if (x < 1)
+        fun_l14_n994(x)
+    else
+        fun_l14_n77(x)
+    end
+end
+
+def fun_l13_n315(x)
+    if (x < 1)
+        fun_l14_n421(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n316(x)
+    if (x < 1)
+        fun_l14_n304(x)
+    else
+        fun_l14_n785(x)
+    end
+end
+
+def fun_l13_n317(x)
+    if (x < 1)
+        fun_l14_n624(x)
+    else
+        fun_l14_n399(x)
+    end
+end
+
+def fun_l13_n318(x)
+    if (x < 1)
+        fun_l14_n882(x)
+    else
+        fun_l14_n3(x)
+    end
+end
+
+def fun_l13_n319(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n955(x)
+    end
+end
+
+def fun_l13_n320(x)
+    if (x < 1)
+        fun_l14_n690(x)
+    else
+        fun_l14_n281(x)
+    end
+end
+
+def fun_l13_n321(x)
+    if (x < 1)
+        fun_l14_n453(x)
+    else
+        fun_l14_n969(x)
+    end
+end
+
+def fun_l13_n322(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n50(x)
+    end
+end
+
+def fun_l13_n323(x)
+    if (x < 1)
+        fun_l14_n342(x)
+    else
+        fun_l14_n618(x)
+    end
+end
+
+def fun_l13_n324(x)
+    if (x < 1)
+        fun_l14_n74(x)
+    else
+        fun_l14_n638(x)
+    end
+end
+
+def fun_l13_n325(x)
+    if (x < 1)
+        fun_l14_n218(x)
+    else
+        fun_l14_n169(x)
+    end
+end
+
+def fun_l13_n326(x)
+    if (x < 1)
+        fun_l14_n128(x)
+    else
+        fun_l14_n504(x)
+    end
+end
+
+def fun_l13_n327(x)
+    if (x < 1)
+        fun_l14_n612(x)
+    else
+        fun_l14_n62(x)
+    end
+end
+
+def fun_l13_n328(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n67(x)
+    end
+end
+
+def fun_l13_n329(x)
+    if (x < 1)
+        fun_l14_n515(x)
+    else
+        fun_l14_n15(x)
+    end
+end
+
+def fun_l13_n330(x)
+    if (x < 1)
+        fun_l14_n448(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n331(x)
+    if (x < 1)
+        fun_l14_n804(x)
+    else
+        fun_l14_n315(x)
+    end
+end
+
+def fun_l13_n332(x)
+    if (x < 1)
+        fun_l14_n522(x)
+    else
+        fun_l14_n761(x)
+    end
+end
+
+def fun_l13_n333(x)
+    if (x < 1)
+        fun_l14_n421(x)
+    else
+        fun_l14_n542(x)
+    end
+end
+
+def fun_l13_n334(x)
+    if (x < 1)
+        fun_l14_n952(x)
+    else
+        fun_l14_n390(x)
+    end
+end
+
+def fun_l13_n335(x)
+    if (x < 1)
+        fun_l14_n324(x)
+    else
+        fun_l14_n60(x)
+    end
+end
+
+def fun_l13_n336(x)
+    if (x < 1)
+        fun_l14_n887(x)
+    else
+        fun_l14_n474(x)
+    end
+end
+
+def fun_l13_n337(x)
+    if (x < 1)
+        fun_l14_n355(x)
+    else
+        fun_l14_n840(x)
+    end
+end
+
+def fun_l13_n338(x)
+    if (x < 1)
+        fun_l14_n21(x)
+    else
+        fun_l14_n133(x)
+    end
+end
+
+def fun_l13_n339(x)
+    if (x < 1)
+        fun_l14_n12(x)
+    else
+        fun_l14_n30(x)
+    end
+end
+
+def fun_l13_n340(x)
+    if (x < 1)
+        fun_l14_n678(x)
+    else
+        fun_l14_n583(x)
+    end
+end
+
+def fun_l13_n341(x)
+    if (x < 1)
+        fun_l14_n289(x)
+    else
+        fun_l14_n490(x)
+    end
+end
+
+def fun_l13_n342(x)
+    if (x < 1)
+        fun_l14_n232(x)
+    else
+        fun_l14_n288(x)
+    end
+end
+
+def fun_l13_n343(x)
+    if (x < 1)
+        fun_l14_n744(x)
+    else
+        fun_l14_n963(x)
+    end
+end
+
+def fun_l13_n344(x)
+    if (x < 1)
+        fun_l14_n651(x)
+    else
+        fun_l14_n377(x)
+    end
+end
+
+def fun_l13_n345(x)
+    if (x < 1)
+        fun_l14_n13(x)
+    else
+        fun_l14_n749(x)
+    end
+end
+
+def fun_l13_n346(x)
+    if (x < 1)
+        fun_l14_n789(x)
+    else
+        fun_l14_n621(x)
+    end
+end
+
+def fun_l13_n347(x)
+    if (x < 1)
+        fun_l14_n346(x)
+    else
+        fun_l14_n663(x)
+    end
+end
+
+def fun_l13_n348(x)
+    if (x < 1)
+        fun_l14_n252(x)
+    else
+        fun_l14_n202(x)
+    end
+end
+
+def fun_l13_n349(x)
+    if (x < 1)
+        fun_l14_n919(x)
+    else
+        fun_l14_n997(x)
+    end
+end
+
+def fun_l13_n350(x)
+    if (x < 1)
+        fun_l14_n472(x)
+    else
+        fun_l14_n900(x)
+    end
+end
+
+def fun_l13_n351(x)
+    if (x < 1)
+        fun_l14_n954(x)
+    else
+        fun_l14_n606(x)
+    end
+end
+
+def fun_l13_n352(x)
+    if (x < 1)
+        fun_l14_n227(x)
+    else
+        fun_l14_n344(x)
+    end
+end
+
+def fun_l13_n353(x)
+    if (x < 1)
+        fun_l14_n110(x)
+    else
+        fun_l14_n266(x)
+    end
+end
+
+def fun_l13_n354(x)
+    if (x < 1)
+        fun_l14_n840(x)
+    else
+        fun_l14_n905(x)
+    end
+end
+
+def fun_l13_n355(x)
+    if (x < 1)
+        fun_l14_n950(x)
+    else
+        fun_l14_n307(x)
+    end
+end
+
+def fun_l13_n356(x)
+    if (x < 1)
+        fun_l14_n572(x)
+    else
+        fun_l14_n480(x)
+    end
+end
+
+def fun_l13_n357(x)
+    if (x < 1)
+        fun_l14_n122(x)
+    else
+        fun_l14_n408(x)
+    end
+end
+
+def fun_l13_n358(x)
+    if (x < 1)
+        fun_l14_n105(x)
+    else
+        fun_l14_n173(x)
+    end
+end
+
+def fun_l13_n359(x)
+    if (x < 1)
+        fun_l14_n358(x)
+    else
+        fun_l14_n336(x)
+    end
+end
+
+def fun_l13_n360(x)
+    if (x < 1)
+        fun_l14_n457(x)
+    else
+        fun_l14_n434(x)
+    end
+end
+
+def fun_l13_n361(x)
+    if (x < 1)
+        fun_l14_n679(x)
+    else
+        fun_l14_n771(x)
+    end
+end
+
+def fun_l13_n362(x)
+    if (x < 1)
+        fun_l14_n419(x)
+    else
+        fun_l14_n909(x)
+    end
+end
+
+def fun_l13_n363(x)
+    if (x < 1)
+        fun_l14_n672(x)
+    else
+        fun_l14_n132(x)
+    end
+end
+
+def fun_l13_n364(x)
+    if (x < 1)
+        fun_l14_n947(x)
+    else
+        fun_l14_n328(x)
+    end
+end
+
+def fun_l13_n365(x)
+    if (x < 1)
+        fun_l14_n959(x)
+    else
+        fun_l14_n122(x)
+    end
+end
+
+def fun_l13_n366(x)
+    if (x < 1)
+        fun_l14_n534(x)
+    else
+        fun_l14_n611(x)
+    end
+end
+
+def fun_l13_n367(x)
+    if (x < 1)
+        fun_l14_n349(x)
+    else
+        fun_l14_n149(x)
+    end
+end
+
+def fun_l13_n368(x)
+    if (x < 1)
+        fun_l14_n94(x)
+    else
+        fun_l14_n870(x)
+    end
+end
+
+def fun_l13_n369(x)
+    if (x < 1)
+        fun_l14_n774(x)
+    else
+        fun_l14_n696(x)
+    end
+end
+
+def fun_l13_n370(x)
+    if (x < 1)
+        fun_l14_n311(x)
+    else
+        fun_l14_n479(x)
+    end
+end
+
+def fun_l13_n371(x)
+    if (x < 1)
+        fun_l14_n650(x)
+    else
+        fun_l14_n66(x)
+    end
+end
+
+def fun_l13_n372(x)
+    if (x < 1)
+        fun_l14_n825(x)
+    else
+        fun_l14_n910(x)
+    end
+end
+
+def fun_l13_n373(x)
+    if (x < 1)
+        fun_l14_n454(x)
+    else
+        fun_l14_n492(x)
+    end
+end
+
+def fun_l13_n374(x)
+    if (x < 1)
+        fun_l14_n785(x)
+    else
+        fun_l14_n352(x)
+    end
+end
+
+def fun_l13_n375(x)
+    if (x < 1)
+        fun_l14_n124(x)
+    else
+        fun_l14_n664(x)
+    end
+end
+
+def fun_l13_n376(x)
+    if (x < 1)
+        fun_l14_n427(x)
+    else
+        fun_l14_n615(x)
+    end
+end
+
+def fun_l13_n377(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n307(x)
+    end
+end
+
+def fun_l13_n378(x)
+    if (x < 1)
+        fun_l14_n575(x)
+    else
+        fun_l14_n561(x)
+    end
+end
+
+def fun_l13_n379(x)
+    if (x < 1)
+        fun_l14_n497(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n380(x)
+    if (x < 1)
+        fun_l14_n350(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n381(x)
+    if (x < 1)
+        fun_l14_n292(x)
+    else
+        fun_l14_n739(x)
+    end
+end
+
+def fun_l13_n382(x)
+    if (x < 1)
+        fun_l14_n302(x)
+    else
+        fun_l14_n583(x)
+    end
+end
+
+def fun_l13_n383(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n603(x)
+    end
+end
+
+def fun_l13_n384(x)
+    if (x < 1)
+        fun_l14_n953(x)
+    else
+        fun_l14_n394(x)
+    end
+end
+
+def fun_l13_n385(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n149(x)
+    end
+end
+
+def fun_l13_n386(x)
+    if (x < 1)
+        fun_l14_n77(x)
+    else
+        fun_l14_n880(x)
+    end
+end
+
+def fun_l13_n387(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n649(x)
+    end
+end
+
+def fun_l13_n388(x)
+    if (x < 1)
+        fun_l14_n277(x)
+    else
+        fun_l14_n922(x)
+    end
+end
+
+def fun_l13_n389(x)
+    if (x < 1)
+        fun_l14_n981(x)
+    else
+        fun_l14_n427(x)
+    end
+end
+
+def fun_l13_n390(x)
+    if (x < 1)
+        fun_l14_n411(x)
+    else
+        fun_l14_n804(x)
+    end
+end
+
+def fun_l13_n391(x)
+    if (x < 1)
+        fun_l14_n52(x)
+    else
+        fun_l14_n770(x)
+    end
+end
+
+def fun_l13_n392(x)
+    if (x < 1)
+        fun_l14_n592(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n393(x)
+    if (x < 1)
+        fun_l14_n274(x)
+    else
+        fun_l14_n778(x)
+    end
+end
+
+def fun_l13_n394(x)
+    if (x < 1)
+        fun_l14_n708(x)
+    else
+        fun_l14_n262(x)
+    end
+end
+
+def fun_l13_n395(x)
+    if (x < 1)
+        fun_l14_n449(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n396(x)
+    if (x < 1)
+        fun_l14_n567(x)
+    else
+        fun_l14_n148(x)
+    end
+end
+
+def fun_l13_n397(x)
+    if (x < 1)
+        fun_l14_n127(x)
+    else
+        fun_l14_n309(x)
+    end
+end
+
+def fun_l13_n398(x)
+    if (x < 1)
+        fun_l14_n150(x)
+    else
+        fun_l14_n540(x)
+    end
+end
+
+def fun_l13_n399(x)
+    if (x < 1)
+        fun_l14_n791(x)
+    else
+        fun_l14_n517(x)
+    end
+end
+
+def fun_l13_n400(x)
+    if (x < 1)
+        fun_l14_n152(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l13_n401(x)
+    if (x < 1)
+        fun_l14_n911(x)
+    else
+        fun_l14_n544(x)
+    end
+end
+
+def fun_l13_n402(x)
+    if (x < 1)
+        fun_l14_n915(x)
+    else
+        fun_l14_n208(x)
+    end
+end
+
+def fun_l13_n403(x)
+    if (x < 1)
+        fun_l14_n452(x)
+    else
+        fun_l14_n62(x)
+    end
+end
+
+def fun_l13_n404(x)
+    if (x < 1)
+        fun_l14_n823(x)
+    else
+        fun_l14_n913(x)
+    end
+end
+
+def fun_l13_n405(x)
+    if (x < 1)
+        fun_l14_n808(x)
+    else
+        fun_l14_n49(x)
+    end
+end
+
+def fun_l13_n406(x)
+    if (x < 1)
+        fun_l14_n498(x)
+    else
+        fun_l14_n470(x)
+    end
+end
+
+def fun_l13_n407(x)
+    if (x < 1)
+        fun_l14_n314(x)
+    else
+        fun_l14_n248(x)
+    end
+end
+
+def fun_l13_n408(x)
+    if (x < 1)
+        fun_l14_n61(x)
+    else
+        fun_l14_n190(x)
+    end
+end
+
+def fun_l13_n409(x)
+    if (x < 1)
+        fun_l14_n126(x)
+    else
+        fun_l14_n505(x)
+    end
+end
+
+def fun_l13_n410(x)
+    if (x < 1)
+        fun_l14_n646(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l13_n411(x)
+    if (x < 1)
+        fun_l14_n741(x)
+    else
+        fun_l14_n979(x)
+    end
+end
+
+def fun_l13_n412(x)
+    if (x < 1)
+        fun_l14_n840(x)
+    else
+        fun_l14_n211(x)
+    end
+end
+
+def fun_l13_n413(x)
+    if (x < 1)
+        fun_l14_n217(x)
+    else
+        fun_l14_n98(x)
+    end
+end
+
+def fun_l13_n414(x)
+    if (x < 1)
+        fun_l14_n398(x)
+    else
+        fun_l14_n701(x)
+    end
+end
+
+def fun_l13_n415(x)
+    if (x < 1)
+        fun_l14_n470(x)
+    else
+        fun_l14_n394(x)
+    end
+end
+
+def fun_l13_n416(x)
+    if (x < 1)
+        fun_l14_n113(x)
+    else
+        fun_l14_n792(x)
+    end
+end
+
+def fun_l13_n417(x)
+    if (x < 1)
+        fun_l14_n969(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n418(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n800(x)
+    end
+end
+
+def fun_l13_n419(x)
+    if (x < 1)
+        fun_l14_n763(x)
+    else
+        fun_l14_n510(x)
+    end
+end
+
+def fun_l13_n420(x)
+    if (x < 1)
+        fun_l14_n660(x)
+    else
+        fun_l14_n904(x)
+    end
+end
+
+def fun_l13_n421(x)
+    if (x < 1)
+        fun_l14_n345(x)
+    else
+        fun_l14_n200(x)
+    end
+end
+
+def fun_l13_n422(x)
+    if (x < 1)
+        fun_l14_n831(x)
+    else
+        fun_l14_n35(x)
+    end
+end
+
+def fun_l13_n423(x)
+    if (x < 1)
+        fun_l14_n644(x)
+    else
+        fun_l14_n963(x)
+    end
+end
+
+def fun_l13_n424(x)
+    if (x < 1)
+        fun_l14_n0(x)
+    else
+        fun_l14_n625(x)
+    end
+end
+
+def fun_l13_n425(x)
+    if (x < 1)
+        fun_l14_n186(x)
+    else
+        fun_l14_n409(x)
+    end
+end
+
+def fun_l13_n426(x)
+    if (x < 1)
+        fun_l14_n869(x)
+    else
+        fun_l14_n852(x)
+    end
+end
+
+def fun_l13_n427(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n160(x)
+    end
+end
+
+def fun_l13_n428(x)
+    if (x < 1)
+        fun_l14_n974(x)
+    else
+        fun_l14_n139(x)
+    end
+end
+
+def fun_l13_n429(x)
+    if (x < 1)
+        fun_l14_n570(x)
+    else
+        fun_l14_n10(x)
+    end
+end
+
+def fun_l13_n430(x)
+    if (x < 1)
+        fun_l14_n199(x)
+    else
+        fun_l14_n829(x)
+    end
+end
+
+def fun_l13_n431(x)
+    if (x < 1)
+        fun_l14_n700(x)
+    else
+        fun_l14_n362(x)
+    end
+end
+
+def fun_l13_n432(x)
+    if (x < 1)
+        fun_l14_n925(x)
+    else
+        fun_l14_n365(x)
+    end
+end
+
+def fun_l13_n433(x)
+    if (x < 1)
+        fun_l14_n837(x)
+    else
+        fun_l14_n119(x)
+    end
+end
+
+def fun_l13_n434(x)
+    if (x < 1)
+        fun_l14_n355(x)
+    else
+        fun_l14_n374(x)
+    end
+end
+
+def fun_l13_n435(x)
+    if (x < 1)
+        fun_l14_n126(x)
+    else
+        fun_l14_n568(x)
+    end
+end
+
+def fun_l13_n436(x)
+    if (x < 1)
+        fun_l14_n468(x)
+    else
+        fun_l14_n299(x)
+    end
+end
+
+def fun_l13_n437(x)
+    if (x < 1)
+        fun_l14_n667(x)
+    else
+        fun_l14_n795(x)
+    end
+end
+
+def fun_l13_n438(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n484(x)
+    end
+end
+
+def fun_l13_n439(x)
+    if (x < 1)
+        fun_l14_n109(x)
+    else
+        fun_l14_n534(x)
+    end
+end
+
+def fun_l13_n440(x)
+    if (x < 1)
+        fun_l14_n999(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n441(x)
+    if (x < 1)
+        fun_l14_n616(x)
+    else
+        fun_l14_n794(x)
+    end
+end
+
+def fun_l13_n442(x)
+    if (x < 1)
+        fun_l14_n719(x)
+    else
+        fun_l14_n967(x)
+    end
+end
+
+def fun_l13_n443(x)
+    if (x < 1)
+        fun_l14_n279(x)
+    else
+        fun_l14_n240(x)
+    end
+end
+
+def fun_l13_n444(x)
+    if (x < 1)
+        fun_l14_n660(x)
+    else
+        fun_l14_n146(x)
+    end
+end
+
+def fun_l13_n445(x)
+    if (x < 1)
+        fun_l14_n164(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n446(x)
+    if (x < 1)
+        fun_l14_n474(x)
+    else
+        fun_l14_n137(x)
+    end
+end
+
+def fun_l13_n447(x)
+    if (x < 1)
+        fun_l14_n198(x)
+    else
+        fun_l14_n66(x)
+    end
+end
+
+def fun_l13_n448(x)
+    if (x < 1)
+        fun_l14_n948(x)
+    else
+        fun_l14_n682(x)
+    end
+end
+
+def fun_l13_n449(x)
+    if (x < 1)
+        fun_l14_n545(x)
+    else
+        fun_l14_n928(x)
+    end
+end
+
+def fun_l13_n450(x)
+    if (x < 1)
+        fun_l14_n822(x)
+    else
+        fun_l14_n846(x)
+    end
+end
+
+def fun_l13_n451(x)
+    if (x < 1)
+        fun_l14_n514(x)
+    else
+        fun_l14_n54(x)
+    end
+end
+
+def fun_l13_n452(x)
+    if (x < 1)
+        fun_l14_n539(x)
+    else
+        fun_l14_n199(x)
+    end
+end
+
+def fun_l13_n453(x)
+    if (x < 1)
+        fun_l14_n917(x)
+    else
+        fun_l14_n173(x)
+    end
+end
+
+def fun_l13_n454(x)
+    if (x < 1)
+        fun_l14_n924(x)
+    else
+        fun_l14_n51(x)
+    end
+end
+
+def fun_l13_n455(x)
+    if (x < 1)
+        fun_l14_n675(x)
+    else
+        fun_l14_n139(x)
+    end
+end
+
+def fun_l13_n456(x)
+    if (x < 1)
+        fun_l14_n335(x)
+    else
+        fun_l14_n138(x)
+    end
+end
+
+def fun_l13_n457(x)
+    if (x < 1)
+        fun_l14_n112(x)
+    else
+        fun_l14_n707(x)
+    end
+end
+
+def fun_l13_n458(x)
+    if (x < 1)
+        fun_l14_n784(x)
+    else
+        fun_l14_n278(x)
+    end
+end
+
+def fun_l13_n459(x)
+    if (x < 1)
+        fun_l14_n165(x)
+    else
+        fun_l14_n985(x)
+    end
+end
+
+def fun_l13_n460(x)
+    if (x < 1)
+        fun_l14_n843(x)
+    else
+        fun_l14_n262(x)
+    end
+end
+
+def fun_l13_n461(x)
+    if (x < 1)
+        fun_l14_n492(x)
+    else
+        fun_l14_n21(x)
+    end
+end
+
+def fun_l13_n462(x)
+    if (x < 1)
+        fun_l14_n864(x)
+    else
+        fun_l14_n248(x)
+    end
+end
+
+def fun_l13_n463(x)
+    if (x < 1)
+        fun_l14_n940(x)
+    else
+        fun_l14_n713(x)
+    end
+end
+
+def fun_l13_n464(x)
+    if (x < 1)
+        fun_l14_n8(x)
+    else
+        fun_l14_n771(x)
+    end
+end
+
+def fun_l13_n465(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n663(x)
+    end
+end
+
+def fun_l13_n466(x)
+    if (x < 1)
+        fun_l14_n411(x)
+    else
+        fun_l14_n570(x)
+    end
+end
+
+def fun_l13_n467(x)
+    if (x < 1)
+        fun_l14_n464(x)
+    else
+        fun_l14_n497(x)
+    end
+end
+
+def fun_l13_n468(x)
+    if (x < 1)
+        fun_l14_n49(x)
+    else
+        fun_l14_n153(x)
+    end
+end
+
+def fun_l13_n469(x)
+    if (x < 1)
+        fun_l14_n33(x)
+    else
+        fun_l14_n562(x)
+    end
+end
+
+def fun_l13_n470(x)
+    if (x < 1)
+        fun_l14_n207(x)
+    else
+        fun_l14_n328(x)
+    end
+end
+
+def fun_l13_n471(x)
+    if (x < 1)
+        fun_l14_n356(x)
+    else
+        fun_l14_n834(x)
+    end
+end
+
+def fun_l13_n472(x)
+    if (x < 1)
+        fun_l14_n46(x)
+    else
+        fun_l14_n842(x)
+    end
+end
+
+def fun_l13_n473(x)
+    if (x < 1)
+        fun_l14_n14(x)
+    else
+        fun_l14_n488(x)
+    end
+end
+
+def fun_l13_n474(x)
+    if (x < 1)
+        fun_l14_n307(x)
+    else
+        fun_l14_n647(x)
+    end
+end
+
+def fun_l13_n475(x)
+    if (x < 1)
+        fun_l14_n474(x)
+    else
+        fun_l14_n369(x)
+    end
+end
+
+def fun_l13_n476(x)
+    if (x < 1)
+        fun_l14_n471(x)
+    else
+        fun_l14_n956(x)
+    end
+end
+
+def fun_l13_n477(x)
+    if (x < 1)
+        fun_l14_n368(x)
+    else
+        fun_l14_n478(x)
+    end
+end
+
+def fun_l13_n478(x)
+    if (x < 1)
+        fun_l14_n377(x)
+    else
+        fun_l14_n675(x)
+    end
+end
+
+def fun_l13_n479(x)
+    if (x < 1)
+        fun_l14_n370(x)
+    else
+        fun_l14_n819(x)
+    end
+end
+
+def fun_l13_n480(x)
+    if (x < 1)
+        fun_l14_n459(x)
+    else
+        fun_l14_n59(x)
+    end
+end
+
+def fun_l13_n481(x)
+    if (x < 1)
+        fun_l14_n200(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n482(x)
+    if (x < 1)
+        fun_l14_n893(x)
+    else
+        fun_l14_n518(x)
+    end
+end
+
+def fun_l13_n483(x)
+    if (x < 1)
+        fun_l14_n130(x)
+    else
+        fun_l14_n902(x)
+    end
+end
+
+def fun_l13_n484(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n485(x)
+    if (x < 1)
+        fun_l14_n254(x)
+    else
+        fun_l14_n294(x)
+    end
+end
+
+def fun_l13_n486(x)
+    if (x < 1)
+        fun_l14_n608(x)
+    else
+        fun_l14_n858(x)
+    end
+end
+
+def fun_l13_n487(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n379(x)
+    end
+end
+
+def fun_l13_n488(x)
+    if (x < 1)
+        fun_l14_n605(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n489(x)
+    if (x < 1)
+        fun_l14_n572(x)
+    else
+        fun_l14_n199(x)
+    end
+end
+
+def fun_l13_n490(x)
+    if (x < 1)
+        fun_l14_n3(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n491(x)
+    if (x < 1)
+        fun_l14_n922(x)
+    else
+        fun_l14_n372(x)
+    end
+end
+
+def fun_l13_n492(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n378(x)
+    end
+end
+
+def fun_l13_n493(x)
+    if (x < 1)
+        fun_l14_n980(x)
+    else
+        fun_l14_n617(x)
+    end
+end
+
+def fun_l13_n494(x)
+    if (x < 1)
+        fun_l14_n127(x)
+    else
+        fun_l14_n348(x)
+    end
+end
+
+def fun_l13_n495(x)
+    if (x < 1)
+        fun_l14_n631(x)
+    else
+        fun_l14_n281(x)
+    end
+end
+
+def fun_l13_n496(x)
+    if (x < 1)
+        fun_l14_n552(x)
+    else
+        fun_l14_n493(x)
+    end
+end
+
+def fun_l13_n497(x)
+    if (x < 1)
+        fun_l14_n342(x)
+    else
+        fun_l14_n931(x)
+    end
+end
+
+def fun_l13_n498(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n512(x)
+    end
+end
+
+def fun_l13_n499(x)
+    if (x < 1)
+        fun_l14_n950(x)
+    else
+        fun_l14_n952(x)
+    end
+end
+
+def fun_l13_n500(x)
+    if (x < 1)
+        fun_l14_n355(x)
+    else
+        fun_l14_n383(x)
+    end
+end
+
+def fun_l13_n501(x)
+    if (x < 1)
+        fun_l14_n278(x)
+    else
+        fun_l14_n442(x)
+    end
+end
+
+def fun_l13_n502(x)
+    if (x < 1)
+        fun_l14_n16(x)
+    else
+        fun_l14_n150(x)
+    end
+end
+
+def fun_l13_n503(x)
+    if (x < 1)
+        fun_l14_n399(x)
+    else
+        fun_l14_n989(x)
+    end
+end
+
+def fun_l13_n504(x)
+    if (x < 1)
+        fun_l14_n289(x)
+    else
+        fun_l14_n925(x)
+    end
+end
+
+def fun_l13_n505(x)
+    if (x < 1)
+        fun_l14_n743(x)
+    else
+        fun_l14_n784(x)
+    end
+end
+
+def fun_l13_n506(x)
+    if (x < 1)
+        fun_l14_n916(x)
+    else
+        fun_l14_n111(x)
+    end
+end
+
+def fun_l13_n507(x)
+    if (x < 1)
+        fun_l14_n912(x)
+    else
+        fun_l14_n448(x)
+    end
+end
+
+def fun_l13_n508(x)
+    if (x < 1)
+        fun_l14_n10(x)
+    else
+        fun_l14_n451(x)
+    end
+end
+
+def fun_l13_n509(x)
+    if (x < 1)
+        fun_l14_n15(x)
+    else
+        fun_l14_n697(x)
+    end
+end
+
+def fun_l13_n510(x)
+    if (x < 1)
+        fun_l14_n565(x)
+    else
+        fun_l14_n511(x)
+    end
+end
+
+def fun_l13_n511(x)
+    if (x < 1)
+        fun_l14_n843(x)
+    else
+        fun_l14_n272(x)
+    end
+end
+
+def fun_l13_n512(x)
+    if (x < 1)
+        fun_l14_n70(x)
+    else
+        fun_l14_n333(x)
+    end
+end
+
+def fun_l13_n513(x)
+    if (x < 1)
+        fun_l14_n100(x)
+    else
+        fun_l14_n399(x)
+    end
+end
+
+def fun_l13_n514(x)
+    if (x < 1)
+        fun_l14_n678(x)
+    else
+        fun_l14_n247(x)
+    end
+end
+
+def fun_l13_n515(x)
+    if (x < 1)
+        fun_l14_n823(x)
+    else
+        fun_l14_n371(x)
+    end
+end
+
+def fun_l13_n516(x)
+    if (x < 1)
+        fun_l14_n994(x)
+    else
+        fun_l14_n322(x)
+    end
+end
+
+def fun_l13_n517(x)
+    if (x < 1)
+        fun_l14_n399(x)
+    else
+        fun_l14_n567(x)
+    end
+end
+
+def fun_l13_n518(x)
+    if (x < 1)
+        fun_l14_n898(x)
+    else
+        fun_l14_n59(x)
+    end
+end
+
+def fun_l13_n519(x)
+    if (x < 1)
+        fun_l14_n33(x)
+    else
+        fun_l14_n640(x)
+    end
+end
+
+def fun_l13_n520(x)
+    if (x < 1)
+        fun_l14_n475(x)
+    else
+        fun_l14_n67(x)
+    end
+end
+
+def fun_l13_n521(x)
+    if (x < 1)
+        fun_l14_n896(x)
+    else
+        fun_l14_n312(x)
+    end
+end
+
+def fun_l13_n522(x)
+    if (x < 1)
+        fun_l14_n454(x)
+    else
+        fun_l14_n520(x)
+    end
+end
+
+def fun_l13_n523(x)
+    if (x < 1)
+        fun_l14_n334(x)
+    else
+        fun_l14_n879(x)
+    end
+end
+
+def fun_l13_n524(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n526(x)
+    end
+end
+
+def fun_l13_n525(x)
+    if (x < 1)
+        fun_l14_n552(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n526(x)
+    if (x < 1)
+        fun_l14_n224(x)
+    else
+        fun_l14_n211(x)
+    end
+end
+
+def fun_l13_n527(x)
+    if (x < 1)
+        fun_l14_n113(x)
+    else
+        fun_l14_n193(x)
+    end
+end
+
+def fun_l13_n528(x)
+    if (x < 1)
+        fun_l14_n389(x)
+    else
+        fun_l14_n332(x)
+    end
+end
+
+def fun_l13_n529(x)
+    if (x < 1)
+        fun_l14_n881(x)
+    else
+        fun_l14_n655(x)
+    end
+end
+
+def fun_l13_n530(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n588(x)
+    end
+end
+
+def fun_l13_n531(x)
+    if (x < 1)
+        fun_l14_n70(x)
+    else
+        fun_l14_n232(x)
+    end
+end
+
+def fun_l13_n532(x)
+    if (x < 1)
+        fun_l14_n617(x)
+    else
+        fun_l14_n477(x)
+    end
+end
+
+def fun_l13_n533(x)
+    if (x < 1)
+        fun_l14_n655(x)
+    else
+        fun_l14_n801(x)
+    end
+end
+
+def fun_l13_n534(x)
+    if (x < 1)
+        fun_l14_n665(x)
+    else
+        fun_l14_n22(x)
+    end
+end
+
+def fun_l13_n535(x)
+    if (x < 1)
+        fun_l14_n314(x)
+    else
+        fun_l14_n924(x)
+    end
+end
+
+def fun_l13_n536(x)
+    if (x < 1)
+        fun_l14_n619(x)
+    else
+        fun_l14_n455(x)
+    end
+end
+
+def fun_l13_n537(x)
+    if (x < 1)
+        fun_l14_n183(x)
+    else
+        fun_l14_n767(x)
+    end
+end
+
+def fun_l13_n538(x)
+    if (x < 1)
+        fun_l14_n862(x)
+    else
+        fun_l14_n352(x)
+    end
+end
+
+def fun_l13_n539(x)
+    if (x < 1)
+        fun_l14_n540(x)
+    else
+        fun_l14_n813(x)
+    end
+end
+
+def fun_l13_n540(x)
+    if (x < 1)
+        fun_l14_n429(x)
+    else
+        fun_l14_n515(x)
+    end
+end
+
+def fun_l13_n541(x)
+    if (x < 1)
+        fun_l14_n294(x)
+    else
+        fun_l14_n341(x)
+    end
+end
+
+def fun_l13_n542(x)
+    if (x < 1)
+        fun_l14_n910(x)
+    else
+        fun_l14_n882(x)
+    end
+end
+
+def fun_l13_n543(x)
+    if (x < 1)
+        fun_l14_n971(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n544(x)
+    if (x < 1)
+        fun_l14_n344(x)
+    else
+        fun_l14_n419(x)
+    end
+end
+
+def fun_l13_n545(x)
+    if (x < 1)
+        fun_l14_n410(x)
+    else
+        fun_l14_n996(x)
+    end
+end
+
+def fun_l13_n546(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n431(x)
+    end
+end
+
+def fun_l13_n547(x)
+    if (x < 1)
+        fun_l14_n548(x)
+    else
+        fun_l14_n934(x)
+    end
+end
+
+def fun_l13_n548(x)
+    if (x < 1)
+        fun_l14_n420(x)
+    else
+        fun_l14_n506(x)
+    end
+end
+
+def fun_l13_n549(x)
+    if (x < 1)
+        fun_l14_n992(x)
+    else
+        fun_l14_n213(x)
+    end
+end
+
+def fun_l13_n550(x)
+    if (x < 1)
+        fun_l14_n754(x)
+    else
+        fun_l14_n666(x)
+    end
+end
+
+def fun_l13_n551(x)
+    if (x < 1)
+        fun_l14_n412(x)
+    else
+        fun_l14_n908(x)
+    end
+end
+
+def fun_l13_n552(x)
+    if (x < 1)
+        fun_l14_n708(x)
+    else
+        fun_l14_n308(x)
+    end
+end
+
+def fun_l13_n553(x)
+    if (x < 1)
+        fun_l14_n797(x)
+    else
+        fun_l14_n622(x)
+    end
+end
+
+def fun_l13_n554(x)
+    if (x < 1)
+        fun_l14_n26(x)
+    else
+        fun_l14_n102(x)
+    end
+end
+
+def fun_l13_n555(x)
+    if (x < 1)
+        fun_l14_n614(x)
+    else
+        fun_l14_n110(x)
+    end
+end
+
+def fun_l13_n556(x)
+    if (x < 1)
+        fun_l14_n368(x)
+    else
+        fun_l14_n718(x)
+    end
+end
+
+def fun_l13_n557(x)
+    if (x < 1)
+        fun_l14_n782(x)
+    else
+        fun_l14_n659(x)
+    end
+end
+
+def fun_l13_n558(x)
+    if (x < 1)
+        fun_l14_n544(x)
+    else
+        fun_l14_n507(x)
+    end
+end
+
+def fun_l13_n559(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n97(x)
+    end
+end
+
+def fun_l13_n560(x)
+    if (x < 1)
+        fun_l14_n390(x)
+    else
+        fun_l14_n93(x)
+    end
+end
+
+def fun_l13_n561(x)
+    if (x < 1)
+        fun_l14_n28(x)
+    else
+        fun_l14_n267(x)
+    end
+end
+
+def fun_l13_n562(x)
+    if (x < 1)
+        fun_l14_n10(x)
+    else
+        fun_l14_n990(x)
+    end
+end
+
+def fun_l13_n563(x)
+    if (x < 1)
+        fun_l14_n428(x)
+    else
+        fun_l14_n878(x)
+    end
+end
+
+def fun_l13_n564(x)
+    if (x < 1)
+        fun_l14_n587(x)
+    else
+        fun_l14_n724(x)
+    end
+end
+
+def fun_l13_n565(x)
+    if (x < 1)
+        fun_l14_n524(x)
+    else
+        fun_l14_n87(x)
+    end
+end
+
+def fun_l13_n566(x)
+    if (x < 1)
+        fun_l14_n213(x)
+    else
+        fun_l14_n718(x)
+    end
+end
+
+def fun_l13_n567(x)
+    if (x < 1)
+        fun_l14_n821(x)
+    else
+        fun_l14_n478(x)
+    end
+end
+
+def fun_l13_n568(x)
+    if (x < 1)
+        fun_l14_n580(x)
+    else
+        fun_l14_n731(x)
+    end
+end
+
+def fun_l13_n569(x)
+    if (x < 1)
+        fun_l14_n673(x)
+    else
+        fun_l14_n780(x)
+    end
+end
+
+def fun_l13_n570(x)
+    if (x < 1)
+        fun_l14_n791(x)
+    else
+        fun_l14_n691(x)
+    end
+end
+
+def fun_l13_n571(x)
+    if (x < 1)
+        fun_l14_n192(x)
+    else
+        fun_l14_n712(x)
+    end
+end
+
+def fun_l13_n572(x)
+    if (x < 1)
+        fun_l14_n201(x)
+    else
+        fun_l14_n732(x)
+    end
+end
+
+def fun_l13_n573(x)
+    if (x < 1)
+        fun_l14_n180(x)
+    else
+        fun_l14_n260(x)
+    end
+end
+
+def fun_l13_n574(x)
+    if (x < 1)
+        fun_l14_n609(x)
+    else
+        fun_l14_n110(x)
+    end
+end
+
+def fun_l13_n575(x)
+    if (x < 1)
+        fun_l14_n993(x)
+    else
+        fun_l14_n510(x)
+    end
+end
+
+def fun_l13_n576(x)
+    if (x < 1)
+        fun_l14_n318(x)
+    else
+        fun_l14_n915(x)
+    end
+end
+
+def fun_l13_n577(x)
+    if (x < 1)
+        fun_l14_n635(x)
+    else
+        fun_l14_n21(x)
+    end
+end
+
+def fun_l13_n578(x)
+    if (x < 1)
+        fun_l14_n330(x)
+    else
+        fun_l14_n860(x)
+    end
+end
+
+def fun_l13_n579(x)
+    if (x < 1)
+        fun_l14_n24(x)
+    else
+        fun_l14_n87(x)
+    end
+end
+
+def fun_l13_n580(x)
+    if (x < 1)
+        fun_l14_n404(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n581(x)
+    if (x < 1)
+        fun_l14_n831(x)
+    else
+        fun_l14_n384(x)
+    end
+end
+
+def fun_l13_n582(x)
+    if (x < 1)
+        fun_l14_n272(x)
+    else
+        fun_l14_n438(x)
+    end
+end
+
+def fun_l13_n583(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n414(x)
+    end
+end
+
+def fun_l13_n584(x)
+    if (x < 1)
+        fun_l14_n38(x)
+    else
+        fun_l14_n676(x)
+    end
+end
+
+def fun_l13_n585(x)
+    if (x < 1)
+        fun_l14_n104(x)
+    else
+        fun_l14_n566(x)
+    end
+end
+
+def fun_l13_n586(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n601(x)
+    end
+end
+
+def fun_l13_n587(x)
+    if (x < 1)
+        fun_l14_n20(x)
+    else
+        fun_l14_n242(x)
+    end
+end
+
+def fun_l13_n588(x)
+    if (x < 1)
+        fun_l14_n291(x)
+    else
+        fun_l14_n744(x)
+    end
+end
+
+def fun_l13_n589(x)
+    if (x < 1)
+        fun_l14_n702(x)
+    else
+        fun_l14_n456(x)
+    end
+end
+
+def fun_l13_n590(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n493(x)
+    end
+end
+
+def fun_l13_n591(x)
+    if (x < 1)
+        fun_l14_n51(x)
+    else
+        fun_l14_n193(x)
+    end
+end
+
+def fun_l13_n592(x)
+    if (x < 1)
+        fun_l14_n512(x)
+    else
+        fun_l14_n382(x)
+    end
+end
+
+def fun_l13_n593(x)
+    if (x < 1)
+        fun_l14_n550(x)
+    else
+        fun_l14_n711(x)
+    end
+end
+
+def fun_l13_n594(x)
+    if (x < 1)
+        fun_l14_n586(x)
+    else
+        fun_l14_n130(x)
+    end
+end
+
+def fun_l13_n595(x)
+    if (x < 1)
+        fun_l14_n348(x)
+    else
+        fun_l14_n214(x)
+    end
+end
+
+def fun_l13_n596(x)
+    if (x < 1)
+        fun_l14_n193(x)
+    else
+        fun_l14_n490(x)
+    end
+end
+
+def fun_l13_n597(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n824(x)
+    end
+end
+
+def fun_l13_n598(x)
+    if (x < 1)
+        fun_l14_n555(x)
+    else
+        fun_l14_n546(x)
+    end
+end
+
+def fun_l13_n599(x)
+    if (x < 1)
+        fun_l14_n244(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n600(x)
+    if (x < 1)
+        fun_l14_n786(x)
+    else
+        fun_l14_n817(x)
+    end
+end
+
+def fun_l13_n601(x)
+    if (x < 1)
+        fun_l14_n991(x)
+    else
+        fun_l14_n691(x)
+    end
+end
+
+def fun_l13_n602(x)
+    if (x < 1)
+        fun_l14_n369(x)
+    else
+        fun_l14_n85(x)
+    end
+end
+
+def fun_l13_n603(x)
+    if (x < 1)
+        fun_l14_n232(x)
+    else
+        fun_l14_n287(x)
+    end
+end
+
+def fun_l13_n604(x)
+    if (x < 1)
+        fun_l14_n397(x)
+    else
+        fun_l14_n59(x)
+    end
+end
+
+def fun_l13_n605(x)
+    if (x < 1)
+        fun_l14_n394(x)
+    else
+        fun_l14_n297(x)
+    end
+end
+
+def fun_l13_n606(x)
+    if (x < 1)
+        fun_l14_n676(x)
+    else
+        fun_l14_n444(x)
+    end
+end
+
+def fun_l13_n607(x)
+    if (x < 1)
+        fun_l14_n894(x)
+    else
+        fun_l14_n147(x)
+    end
+end
+
+def fun_l13_n608(x)
+    if (x < 1)
+        fun_l14_n593(x)
+    else
+        fun_l14_n880(x)
+    end
+end
+
+def fun_l13_n609(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n610(x)
+    end
+end
+
+def fun_l13_n610(x)
+    if (x < 1)
+        fun_l14_n884(x)
+    else
+        fun_l14_n202(x)
+    end
+end
+
+def fun_l13_n611(x)
+    if (x < 1)
+        fun_l14_n763(x)
+    else
+        fun_l14_n592(x)
+    end
+end
+
+def fun_l13_n612(x)
+    if (x < 1)
+        fun_l14_n477(x)
+    else
+        fun_l14_n614(x)
+    end
+end
+
+def fun_l13_n613(x)
+    if (x < 1)
+        fun_l14_n372(x)
+    else
+        fun_l14_n330(x)
+    end
+end
+
+def fun_l13_n614(x)
+    if (x < 1)
+        fun_l14_n767(x)
+    else
+        fun_l14_n277(x)
+    end
+end
+
+def fun_l13_n615(x)
+    if (x < 1)
+        fun_l14_n530(x)
+    else
+        fun_l14_n24(x)
+    end
+end
+
+def fun_l13_n616(x)
+    if (x < 1)
+        fun_l14_n657(x)
+    else
+        fun_l14_n709(x)
+    end
+end
+
+def fun_l13_n617(x)
+    if (x < 1)
+        fun_l14_n559(x)
+    else
+        fun_l14_n125(x)
+    end
+end
+
+def fun_l13_n618(x)
+    if (x < 1)
+        fun_l14_n855(x)
+    else
+        fun_l14_n353(x)
+    end
+end
+
+def fun_l13_n619(x)
+    if (x < 1)
+        fun_l14_n635(x)
+    else
+        fun_l14_n907(x)
+    end
+end
+
+def fun_l13_n620(x)
+    if (x < 1)
+        fun_l14_n229(x)
+    else
+        fun_l14_n7(x)
+    end
+end
+
+def fun_l13_n621(x)
+    if (x < 1)
+        fun_l14_n568(x)
+    else
+        fun_l14_n393(x)
+    end
+end
+
+def fun_l13_n622(x)
+    if (x < 1)
+        fun_l14_n153(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n623(x)
+    if (x < 1)
+        fun_l14_n249(x)
+    else
+        fun_l14_n139(x)
+    end
+end
+
+def fun_l13_n624(x)
+    if (x < 1)
+        fun_l14_n961(x)
+    else
+        fun_l14_n897(x)
+    end
+end
+
+def fun_l13_n625(x)
+    if (x < 1)
+        fun_l14_n535(x)
+    else
+        fun_l14_n252(x)
+    end
+end
+
+def fun_l13_n626(x)
+    if (x < 1)
+        fun_l14_n832(x)
+    else
+        fun_l14_n995(x)
+    end
+end
+
+def fun_l13_n627(x)
+    if (x < 1)
+        fun_l14_n896(x)
+    else
+        fun_l14_n173(x)
+    end
+end
+
+def fun_l13_n628(x)
+    if (x < 1)
+        fun_l14_n939(x)
+    else
+        fun_l14_n852(x)
+    end
+end
+
+def fun_l13_n629(x)
+    if (x < 1)
+        fun_l14_n424(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n630(x)
+    if (x < 1)
+        fun_l14_n822(x)
+    else
+        fun_l14_n523(x)
+    end
+end
+
+def fun_l13_n631(x)
+    if (x < 1)
+        fun_l14_n697(x)
+    else
+        fun_l14_n939(x)
+    end
+end
+
+def fun_l13_n632(x)
+    if (x < 1)
+        fun_l14_n831(x)
+    else
+        fun_l14_n722(x)
+    end
+end
+
+def fun_l13_n633(x)
+    if (x < 1)
+        fun_l14_n837(x)
+    else
+        fun_l14_n994(x)
+    end
+end
+
+def fun_l13_n634(x)
+    if (x < 1)
+        fun_l14_n568(x)
+    else
+        fun_l14_n636(x)
+    end
+end
+
+def fun_l13_n635(x)
+    if (x < 1)
+        fun_l14_n573(x)
+    else
+        fun_l14_n156(x)
+    end
+end
+
+def fun_l13_n636(x)
+    if (x < 1)
+        fun_l14_n682(x)
+    else
+        fun_l14_n999(x)
+    end
+end
+
+def fun_l13_n637(x)
+    if (x < 1)
+        fun_l14_n648(x)
+    else
+        fun_l14_n567(x)
+    end
+end
+
+def fun_l13_n638(x)
+    if (x < 1)
+        fun_l14_n395(x)
+    else
+        fun_l14_n837(x)
+    end
+end
+
+def fun_l13_n639(x)
+    if (x < 1)
+        fun_l14_n294(x)
+    else
+        fun_l14_n508(x)
+    end
+end
+
+def fun_l13_n640(x)
+    if (x < 1)
+        fun_l14_n530(x)
+    else
+        fun_l14_n542(x)
+    end
+end
+
+def fun_l13_n641(x)
+    if (x < 1)
+        fun_l14_n227(x)
+    else
+        fun_l14_n939(x)
+    end
+end
+
+def fun_l13_n642(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n79(x)
+    end
+end
+
+def fun_l13_n643(x)
+    if (x < 1)
+        fun_l14_n354(x)
+    else
+        fun_l14_n606(x)
+    end
+end
+
+def fun_l13_n644(x)
+    if (x < 1)
+        fun_l14_n270(x)
+    else
+        fun_l14_n644(x)
+    end
+end
+
+def fun_l13_n645(x)
+    if (x < 1)
+        fun_l14_n345(x)
+    else
+        fun_l14_n299(x)
+    end
+end
+
+def fun_l13_n646(x)
+    if (x < 1)
+        fun_l14_n384(x)
+    else
+        fun_l14_n97(x)
+    end
+end
+
+def fun_l13_n647(x)
+    if (x < 1)
+        fun_l14_n86(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n648(x)
+    if (x < 1)
+        fun_l14_n765(x)
+    else
+        fun_l14_n498(x)
+    end
+end
+
+def fun_l13_n649(x)
+    if (x < 1)
+        fun_l14_n135(x)
+    else
+        fun_l14_n993(x)
+    end
+end
+
+def fun_l13_n650(x)
+    if (x < 1)
+        fun_l14_n837(x)
+    else
+        fun_l14_n576(x)
+    end
+end
+
+def fun_l13_n651(x)
+    if (x < 1)
+        fun_l14_n75(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n652(x)
+    if (x < 1)
+        fun_l14_n932(x)
+    else
+        fun_l14_n646(x)
+    end
+end
+
+def fun_l13_n653(x)
+    if (x < 1)
+        fun_l14_n908(x)
+    else
+        fun_l14_n384(x)
+    end
+end
+
+def fun_l13_n654(x)
+    if (x < 1)
+        fun_l14_n540(x)
+    else
+        fun_l14_n946(x)
+    end
+end
+
+def fun_l13_n655(x)
+    if (x < 1)
+        fun_l14_n686(x)
+    else
+        fun_l14_n926(x)
+    end
+end
+
+def fun_l13_n656(x)
+    if (x < 1)
+        fun_l14_n567(x)
+    else
+        fun_l14_n815(x)
+    end
+end
+
+def fun_l13_n657(x)
+    if (x < 1)
+        fun_l14_n101(x)
+    else
+        fun_l14_n960(x)
+    end
+end
+
+def fun_l13_n658(x)
+    if (x < 1)
+        fun_l14_n956(x)
+    else
+        fun_l14_n980(x)
+    end
+end
+
+def fun_l13_n659(x)
+    if (x < 1)
+        fun_l14_n196(x)
+    else
+        fun_l14_n632(x)
+    end
+end
+
+def fun_l13_n660(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n288(x)
+    end
+end
+
+def fun_l13_n661(x)
+    if (x < 1)
+        fun_l14_n907(x)
+    else
+        fun_l14_n719(x)
+    end
+end
+
+def fun_l13_n662(x)
+    if (x < 1)
+        fun_l14_n922(x)
+    else
+        fun_l14_n186(x)
+    end
+end
+
+def fun_l13_n663(x)
+    if (x < 1)
+        fun_l14_n439(x)
+    else
+        fun_l14_n890(x)
+    end
+end
+
+def fun_l13_n664(x)
+    if (x < 1)
+        fun_l14_n310(x)
+    else
+        fun_l14_n534(x)
+    end
+end
+
+def fun_l13_n665(x)
+    if (x < 1)
+        fun_l14_n584(x)
+    else
+        fun_l14_n322(x)
+    end
+end
+
+def fun_l13_n666(x)
+    if (x < 1)
+        fun_l14_n385(x)
+    else
+        fun_l14_n466(x)
+    end
+end
+
+def fun_l13_n667(x)
+    if (x < 1)
+        fun_l14_n387(x)
+    else
+        fun_l14_n284(x)
+    end
+end
+
+def fun_l13_n668(x)
+    if (x < 1)
+        fun_l14_n834(x)
+    else
+        fun_l14_n446(x)
+    end
+end
+
+def fun_l13_n669(x)
+    if (x < 1)
+        fun_l14_n839(x)
+    else
+        fun_l14_n820(x)
+    end
+end
+
+def fun_l13_n670(x)
+    if (x < 1)
+        fun_l14_n666(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n671(x)
+    if (x < 1)
+        fun_l14_n640(x)
+    else
+        fun_l14_n83(x)
+    end
+end
+
+def fun_l13_n672(x)
+    if (x < 1)
+        fun_l14_n663(x)
+    else
+        fun_l14_n332(x)
+    end
+end
+
+def fun_l13_n673(x)
+    if (x < 1)
+        fun_l14_n776(x)
+    else
+        fun_l14_n818(x)
+    end
+end
+
+def fun_l13_n674(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n594(x)
+    end
+end
+
+def fun_l13_n675(x)
+    if (x < 1)
+        fun_l14_n491(x)
+    else
+        fun_l14_n0(x)
+    end
+end
+
+def fun_l13_n676(x)
+    if (x < 1)
+        fun_l14_n963(x)
+    else
+        fun_l14_n634(x)
+    end
+end
+
+def fun_l13_n677(x)
+    if (x < 1)
+        fun_l14_n716(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n678(x)
+    if (x < 1)
+        fun_l14_n997(x)
+    else
+        fun_l14_n933(x)
+    end
+end
+
+def fun_l13_n679(x)
+    if (x < 1)
+        fun_l14_n171(x)
+    else
+        fun_l14_n356(x)
+    end
+end
+
+def fun_l13_n680(x)
+    if (x < 1)
+        fun_l14_n214(x)
+    else
+        fun_l14_n360(x)
+    end
+end
+
+def fun_l13_n681(x)
+    if (x < 1)
+        fun_l14_n758(x)
+    else
+        fun_l14_n185(x)
+    end
+end
+
+def fun_l13_n682(x)
+    if (x < 1)
+        fun_l14_n480(x)
+    else
+        fun_l14_n572(x)
+    end
+end
+
+def fun_l13_n683(x)
+    if (x < 1)
+        fun_l14_n595(x)
+    else
+        fun_l14_n534(x)
+    end
+end
+
+def fun_l13_n684(x)
+    if (x < 1)
+        fun_l14_n462(x)
+    else
+        fun_l14_n481(x)
+    end
+end
+
+def fun_l13_n685(x)
+    if (x < 1)
+        fun_l14_n946(x)
+    else
+        fun_l14_n726(x)
+    end
+end
+
+def fun_l13_n686(x)
+    if (x < 1)
+        fun_l14_n428(x)
+    else
+        fun_l14_n256(x)
+    end
+end
+
+def fun_l13_n687(x)
+    if (x < 1)
+        fun_l14_n562(x)
+    else
+        fun_l14_n290(x)
+    end
+end
+
+def fun_l13_n688(x)
+    if (x < 1)
+        fun_l14_n679(x)
+    else
+        fun_l14_n787(x)
+    end
+end
+
+def fun_l13_n689(x)
+    if (x < 1)
+        fun_l14_n972(x)
+    else
+        fun_l14_n809(x)
+    end
+end
+
+def fun_l13_n690(x)
+    if (x < 1)
+        fun_l14_n700(x)
+    else
+        fun_l14_n239(x)
+    end
+end
+
+def fun_l13_n691(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n251(x)
+    end
+end
+
+def fun_l13_n692(x)
+    if (x < 1)
+        fun_l14_n4(x)
+    else
+        fun_l14_n889(x)
+    end
+end
+
+def fun_l13_n693(x)
+    if (x < 1)
+        fun_l14_n362(x)
+    else
+        fun_l14_n495(x)
+    end
+end
+
+def fun_l13_n694(x)
+    if (x < 1)
+        fun_l14_n466(x)
+    else
+        fun_l14_n820(x)
+    end
+end
+
+def fun_l13_n695(x)
+    if (x < 1)
+        fun_l14_n244(x)
+    else
+        fun_l14_n233(x)
+    end
+end
+
+def fun_l13_n696(x)
+    if (x < 1)
+        fun_l14_n920(x)
+    else
+        fun_l14_n124(x)
+    end
+end
+
+def fun_l13_n697(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n417(x)
+    end
+end
+
+def fun_l13_n698(x)
+    if (x < 1)
+        fun_l14_n756(x)
+    else
+        fun_l14_n683(x)
+    end
+end
+
+def fun_l13_n699(x)
+    if (x < 1)
+        fun_l14_n487(x)
+    else
+        fun_l14_n191(x)
+    end
+end
+
+def fun_l13_n700(x)
+    if (x < 1)
+        fun_l14_n316(x)
+    else
+        fun_l14_n123(x)
+    end
+end
+
+def fun_l13_n701(x)
+    if (x < 1)
+        fun_l14_n851(x)
+    else
+        fun_l14_n695(x)
+    end
+end
+
+def fun_l13_n702(x)
+    if (x < 1)
+        fun_l14_n766(x)
+    else
+        fun_l14_n603(x)
+    end
+end
+
+def fun_l13_n703(x)
+    if (x < 1)
+        fun_l14_n689(x)
+    else
+        fun_l14_n524(x)
+    end
+end
+
+def fun_l13_n704(x)
+    if (x < 1)
+        fun_l14_n23(x)
+    else
+        fun_l14_n866(x)
+    end
+end
+
+def fun_l13_n705(x)
+    if (x < 1)
+        fun_l14_n62(x)
+    else
+        fun_l14_n926(x)
+    end
+end
+
+def fun_l13_n706(x)
+    if (x < 1)
+        fun_l14_n53(x)
+    else
+        fun_l14_n567(x)
+    end
+end
+
+def fun_l13_n707(x)
+    if (x < 1)
+        fun_l14_n756(x)
+    else
+        fun_l14_n595(x)
+    end
+end
+
+def fun_l13_n708(x)
+    if (x < 1)
+        fun_l14_n495(x)
+    else
+        fun_l14_n698(x)
+    end
+end
+
+def fun_l13_n709(x)
+    if (x < 1)
+        fun_l14_n511(x)
+    else
+        fun_l14_n131(x)
+    end
+end
+
+def fun_l13_n710(x)
+    if (x < 1)
+        fun_l14_n593(x)
+    else
+        fun_l14_n233(x)
+    end
+end
+
+def fun_l13_n711(x)
+    if (x < 1)
+        fun_l14_n846(x)
+    else
+        fun_l14_n166(x)
+    end
+end
+
+def fun_l13_n712(x)
+    if (x < 1)
+        fun_l14_n759(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n713(x)
+    if (x < 1)
+        fun_l14_n364(x)
+    else
+        fun_l14_n805(x)
+    end
+end
+
+def fun_l13_n714(x)
+    if (x < 1)
+        fun_l14_n957(x)
+    else
+        fun_l14_n85(x)
+    end
+end
+
+def fun_l13_n715(x)
+    if (x < 1)
+        fun_l14_n877(x)
+    else
+        fun_l14_n111(x)
+    end
+end
+
+def fun_l13_n716(x)
+    if (x < 1)
+        fun_l14_n290(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n717(x)
+    if (x < 1)
+        fun_l14_n354(x)
+    else
+        fun_l14_n646(x)
+    end
+end
+
+def fun_l13_n718(x)
+    if (x < 1)
+        fun_l14_n364(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n719(x)
+    if (x < 1)
+        fun_l14_n392(x)
+    else
+        fun_l14_n537(x)
+    end
+end
+
+def fun_l13_n720(x)
+    if (x < 1)
+        fun_l14_n546(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n721(x)
+    if (x < 1)
+        fun_l14_n153(x)
+    else
+        fun_l14_n925(x)
+    end
+end
+
+def fun_l13_n722(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n482(x)
+    end
+end
+
+def fun_l13_n723(x)
+    if (x < 1)
+        fun_l14_n981(x)
+    else
+        fun_l14_n364(x)
+    end
+end
+
+def fun_l13_n724(x)
+    if (x < 1)
+        fun_l14_n869(x)
+    else
+        fun_l14_n871(x)
+    end
+end
+
+def fun_l13_n725(x)
+    if (x < 1)
+        fun_l14_n693(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n726(x)
+    if (x < 1)
+        fun_l14_n587(x)
+    else
+        fun_l14_n654(x)
+    end
+end
+
+def fun_l13_n727(x)
+    if (x < 1)
+        fun_l14_n150(x)
+    else
+        fun_l14_n904(x)
+    end
+end
+
+def fun_l13_n728(x)
+    if (x < 1)
+        fun_l14_n843(x)
+    else
+        fun_l14_n556(x)
+    end
+end
+
+def fun_l13_n729(x)
+    if (x < 1)
+        fun_l14_n726(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n730(x)
+    if (x < 1)
+        fun_l14_n976(x)
+    else
+        fun_l14_n740(x)
+    end
+end
+
+def fun_l13_n731(x)
+    if (x < 1)
+        fun_l14_n709(x)
+    else
+        fun_l14_n293(x)
+    end
+end
+
+def fun_l13_n732(x)
+    if (x < 1)
+        fun_l14_n858(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n733(x)
+    if (x < 1)
+        fun_l14_n789(x)
+    else
+        fun_l14_n475(x)
+    end
+end
+
+def fun_l13_n734(x)
+    if (x < 1)
+        fun_l14_n813(x)
+    else
+        fun_l14_n359(x)
+    end
+end
+
+def fun_l13_n735(x)
+    if (x < 1)
+        fun_l14_n209(x)
+    else
+        fun_l14_n29(x)
+    end
+end
+
+def fun_l13_n736(x)
+    if (x < 1)
+        fun_l14_n710(x)
+    else
+        fun_l14_n823(x)
+    end
+end
+
+def fun_l13_n737(x)
+    if (x < 1)
+        fun_l14_n434(x)
+    else
+        fun_l14_n864(x)
+    end
+end
+
+def fun_l13_n738(x)
+    if (x < 1)
+        fun_l14_n184(x)
+    else
+        fun_l14_n902(x)
+    end
+end
+
+def fun_l13_n739(x)
+    if (x < 1)
+        fun_l14_n206(x)
+    else
+        fun_l14_n65(x)
+    end
+end
+
+def fun_l13_n740(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n956(x)
+    end
+end
+
+def fun_l13_n741(x)
+    if (x < 1)
+        fun_l14_n91(x)
+    else
+        fun_l14_n341(x)
+    end
+end
+
+def fun_l13_n742(x)
+    if (x < 1)
+        fun_l14_n864(x)
+    else
+        fun_l14_n864(x)
+    end
+end
+
+def fun_l13_n743(x)
+    if (x < 1)
+        fun_l14_n426(x)
+    else
+        fun_l14_n302(x)
+    end
+end
+
+def fun_l13_n744(x)
+    if (x < 1)
+        fun_l14_n241(x)
+    else
+        fun_l14_n151(x)
+    end
+end
+
+def fun_l13_n745(x)
+    if (x < 1)
+        fun_l14_n161(x)
+    else
+        fun_l14_n715(x)
+    end
+end
+
+def fun_l13_n746(x)
+    if (x < 1)
+        fun_l14_n925(x)
+    else
+        fun_l14_n840(x)
+    end
+end
+
+def fun_l13_n747(x)
+    if (x < 1)
+        fun_l14_n864(x)
+    else
+        fun_l14_n610(x)
+    end
+end
+
+def fun_l13_n748(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n749(x)
+    if (x < 1)
+        fun_l14_n847(x)
+    else
+        fun_l14_n3(x)
+    end
+end
+
+def fun_l13_n750(x)
+    if (x < 1)
+        fun_l14_n124(x)
+    else
+        fun_l14_n915(x)
+    end
+end
+
+def fun_l13_n751(x)
+    if (x < 1)
+        fun_l14_n163(x)
+    else
+        fun_l14_n136(x)
+    end
+end
+
+def fun_l13_n752(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n753(x)
+    if (x < 1)
+        fun_l14_n109(x)
+    else
+        fun_l14_n208(x)
+    end
+end
+
+def fun_l13_n754(x)
+    if (x < 1)
+        fun_l14_n597(x)
+    else
+        fun_l14_n307(x)
+    end
+end
+
+def fun_l13_n755(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n948(x)
+    end
+end
+
+def fun_l13_n756(x)
+    if (x < 1)
+        fun_l14_n236(x)
+    else
+        fun_l14_n716(x)
+    end
+end
+
+def fun_l13_n757(x)
+    if (x < 1)
+        fun_l14_n326(x)
+    else
+        fun_l14_n870(x)
+    end
+end
+
+def fun_l13_n758(x)
+    if (x < 1)
+        fun_l14_n333(x)
+    else
+        fun_l14_n224(x)
+    end
+end
+
+def fun_l13_n759(x)
+    if (x < 1)
+        fun_l14_n141(x)
+    else
+        fun_l14_n232(x)
+    end
+end
+
+def fun_l13_n760(x)
+    if (x < 1)
+        fun_l14_n653(x)
+    else
+        fun_l14_n559(x)
+    end
+end
+
+def fun_l13_n761(x)
+    if (x < 1)
+        fun_l14_n305(x)
+    else
+        fun_l14_n296(x)
+    end
+end
+
+def fun_l13_n762(x)
+    if (x < 1)
+        fun_l14_n318(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n763(x)
+    if (x < 1)
+        fun_l14_n685(x)
+    else
+        fun_l14_n643(x)
+    end
+end
+
+def fun_l13_n764(x)
+    if (x < 1)
+        fun_l14_n180(x)
+    else
+        fun_l14_n348(x)
+    end
+end
+
+def fun_l13_n765(x)
+    if (x < 1)
+        fun_l14_n72(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n766(x)
+    if (x < 1)
+        fun_l14_n463(x)
+    else
+        fun_l14_n135(x)
+    end
+end
+
+def fun_l13_n767(x)
+    if (x < 1)
+        fun_l14_n461(x)
+    else
+        fun_l14_n989(x)
+    end
+end
+
+def fun_l13_n768(x)
+    if (x < 1)
+        fun_l14_n759(x)
+    else
+        fun_l14_n907(x)
+    end
+end
+
+def fun_l13_n769(x)
+    if (x < 1)
+        fun_l14_n330(x)
+    else
+        fun_l14_n268(x)
+    end
+end
+
+def fun_l13_n770(x)
+    if (x < 1)
+        fun_l14_n809(x)
+    else
+        fun_l14_n46(x)
+    end
+end
+
+def fun_l13_n771(x)
+    if (x < 1)
+        fun_l14_n396(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n772(x)
+    if (x < 1)
+        fun_l14_n300(x)
+    else
+        fun_l14_n60(x)
+    end
+end
+
+def fun_l13_n773(x)
+    if (x < 1)
+        fun_l14_n938(x)
+    else
+        fun_l14_n112(x)
+    end
+end
+
+def fun_l13_n774(x)
+    if (x < 1)
+        fun_l14_n862(x)
+    else
+        fun_l14_n503(x)
+    end
+end
+
+def fun_l13_n775(x)
+    if (x < 1)
+        fun_l14_n305(x)
+    else
+        fun_l14_n11(x)
+    end
+end
+
+def fun_l13_n776(x)
+    if (x < 1)
+        fun_l14_n638(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n777(x)
+    if (x < 1)
+        fun_l14_n2(x)
+    else
+        fun_l14_n176(x)
+    end
+end
+
+def fun_l13_n778(x)
+    if (x < 1)
+        fun_l14_n967(x)
+    else
+        fun_l14_n739(x)
+    end
+end
+
+def fun_l13_n779(x)
+    if (x < 1)
+        fun_l14_n961(x)
+    else
+        fun_l14_n609(x)
+    end
+end
+
+def fun_l13_n780(x)
+    if (x < 1)
+        fun_l14_n207(x)
+    else
+        fun_l14_n910(x)
+    end
+end
+
+def fun_l13_n781(x)
+    if (x < 1)
+        fun_l14_n370(x)
+    else
+        fun_l14_n163(x)
+    end
+end
+
+def fun_l13_n782(x)
+    if (x < 1)
+        fun_l14_n140(x)
+    else
+        fun_l14_n816(x)
+    end
+end
+
+def fun_l13_n783(x)
+    if (x < 1)
+        fun_l14_n351(x)
+    else
+        fun_l14_n406(x)
+    end
+end
+
+def fun_l13_n784(x)
+    if (x < 1)
+        fun_l14_n790(x)
+    else
+        fun_l14_n175(x)
+    end
+end
+
+def fun_l13_n785(x)
+    if (x < 1)
+        fun_l14_n644(x)
+    else
+        fun_l14_n713(x)
+    end
+end
+
+def fun_l13_n786(x)
+    if (x < 1)
+        fun_l14_n800(x)
+    else
+        fun_l14_n257(x)
+    end
+end
+
+def fun_l13_n787(x)
+    if (x < 1)
+        fun_l14_n248(x)
+    else
+        fun_l14_n709(x)
+    end
+end
+
+def fun_l13_n788(x)
+    if (x < 1)
+        fun_l14_n280(x)
+    else
+        fun_l14_n485(x)
+    end
+end
+
+def fun_l13_n789(x)
+    if (x < 1)
+        fun_l14_n900(x)
+    else
+        fun_l14_n675(x)
+    end
+end
+
+def fun_l13_n790(x)
+    if (x < 1)
+        fun_l14_n65(x)
+    else
+        fun_l14_n426(x)
+    end
+end
+
+def fun_l13_n791(x)
+    if (x < 1)
+        fun_l14_n410(x)
+    else
+        fun_l14_n484(x)
+    end
+end
+
+def fun_l13_n792(x)
+    if (x < 1)
+        fun_l14_n741(x)
+    else
+        fun_l14_n13(x)
+    end
+end
+
+def fun_l13_n793(x)
+    if (x < 1)
+        fun_l14_n550(x)
+    else
+        fun_l14_n884(x)
+    end
+end
+
+def fun_l13_n794(x)
+    if (x < 1)
+        fun_l14_n120(x)
+    else
+        fun_l14_n262(x)
+    end
+end
+
+def fun_l13_n795(x)
+    if (x < 1)
+        fun_l14_n537(x)
+    else
+        fun_l14_n980(x)
+    end
+end
+
+def fun_l13_n796(x)
+    if (x < 1)
+        fun_l14_n742(x)
+    else
+        fun_l14_n6(x)
+    end
+end
+
+def fun_l13_n797(x)
+    if (x < 1)
+        fun_l14_n986(x)
+    else
+        fun_l14_n434(x)
+    end
+end
+
+def fun_l13_n798(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n658(x)
+    end
+end
+
+def fun_l13_n799(x)
+    if (x < 1)
+        fun_l14_n838(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n800(x)
+    if (x < 1)
+        fun_l14_n79(x)
+    else
+        fun_l14_n695(x)
+    end
+end
+
+def fun_l13_n801(x)
+    if (x < 1)
+        fun_l14_n99(x)
+    else
+        fun_l14_n26(x)
+    end
+end
+
+def fun_l13_n802(x)
+    if (x < 1)
+        fun_l14_n839(x)
+    else
+        fun_l14_n430(x)
+    end
+end
+
+def fun_l13_n803(x)
+    if (x < 1)
+        fun_l14_n410(x)
+    else
+        fun_l14_n403(x)
+    end
+end
+
+def fun_l13_n804(x)
+    if (x < 1)
+        fun_l14_n143(x)
+    else
+        fun_l14_n689(x)
+    end
+end
+
+def fun_l13_n805(x)
+    if (x < 1)
+        fun_l14_n695(x)
+    else
+        fun_l14_n721(x)
+    end
+end
+
+def fun_l13_n806(x)
+    if (x < 1)
+        fun_l14_n418(x)
+    else
+        fun_l14_n508(x)
+    end
+end
+
+def fun_l13_n807(x)
+    if (x < 1)
+        fun_l14_n569(x)
+    else
+        fun_l14_n86(x)
+    end
+end
+
+def fun_l13_n808(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n809(x)
+    if (x < 1)
+        fun_l14_n283(x)
+    else
+        fun_l14_n630(x)
+    end
+end
+
+def fun_l13_n810(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n180(x)
+    end
+end
+
+def fun_l13_n811(x)
+    if (x < 1)
+        fun_l14_n669(x)
+    else
+        fun_l14_n131(x)
+    end
+end
+
+def fun_l13_n812(x)
+    if (x < 1)
+        fun_l14_n972(x)
+    else
+        fun_l14_n948(x)
+    end
+end
+
+def fun_l13_n813(x)
+    if (x < 1)
+        fun_l14_n585(x)
+    else
+        fun_l14_n244(x)
+    end
+end
+
+def fun_l13_n814(x)
+    if (x < 1)
+        fun_l14_n277(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n815(x)
+    if (x < 1)
+        fun_l14_n908(x)
+    else
+        fun_l14_n380(x)
+    end
+end
+
+def fun_l13_n816(x)
+    if (x < 1)
+        fun_l14_n520(x)
+    else
+        fun_l14_n382(x)
+    end
+end
+
+def fun_l13_n817(x)
+    if (x < 1)
+        fun_l14_n40(x)
+    else
+        fun_l14_n757(x)
+    end
+end
+
+def fun_l13_n818(x)
+    if (x < 1)
+        fun_l14_n220(x)
+    else
+        fun_l14_n781(x)
+    end
+end
+
+def fun_l13_n819(x)
+    if (x < 1)
+        fun_l14_n507(x)
+    else
+        fun_l14_n602(x)
+    end
+end
+
+def fun_l13_n820(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n798(x)
+    end
+end
+
+def fun_l13_n821(x)
+    if (x < 1)
+        fun_l14_n412(x)
+    else
+        fun_l14_n58(x)
+    end
+end
+
+def fun_l13_n822(x)
+    if (x < 1)
+        fun_l14_n599(x)
+    else
+        fun_l14_n206(x)
+    end
+end
+
+def fun_l13_n823(x)
+    if (x < 1)
+        fun_l14_n294(x)
+    else
+        fun_l14_n711(x)
+    end
+end
+
+def fun_l13_n824(x)
+    if (x < 1)
+        fun_l14_n421(x)
+    else
+        fun_l14_n191(x)
+    end
+end
+
+def fun_l13_n825(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n547(x)
+    end
+end
+
+def fun_l13_n826(x)
+    if (x < 1)
+        fun_l14_n131(x)
+    else
+        fun_l14_n29(x)
+    end
+end
+
+def fun_l13_n827(x)
+    if (x < 1)
+        fun_l14_n19(x)
+    else
+        fun_l14_n213(x)
+    end
+end
+
+def fun_l13_n828(x)
+    if (x < 1)
+        fun_l14_n202(x)
+    else
+        fun_l14_n195(x)
+    end
+end
+
+def fun_l13_n829(x)
+    if (x < 1)
+        fun_l14_n133(x)
+    else
+        fun_l14_n949(x)
+    end
+end
+
+def fun_l13_n830(x)
+    if (x < 1)
+        fun_l14_n402(x)
+    else
+        fun_l14_n762(x)
+    end
+end
+
+def fun_l13_n831(x)
+    if (x < 1)
+        fun_l14_n233(x)
+    else
+        fun_l14_n984(x)
+    end
+end
+
+def fun_l13_n832(x)
+    if (x < 1)
+        fun_l14_n309(x)
+    else
+        fun_l14_n545(x)
+    end
+end
+
+def fun_l13_n833(x)
+    if (x < 1)
+        fun_l14_n160(x)
+    else
+        fun_l14_n434(x)
+    end
+end
+
+def fun_l13_n834(x)
+    if (x < 1)
+        fun_l14_n909(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n835(x)
+    if (x < 1)
+        fun_l14_n747(x)
+    else
+        fun_l14_n813(x)
+    end
+end
+
+def fun_l13_n836(x)
+    if (x < 1)
+        fun_l14_n338(x)
+    else
+        fun_l14_n592(x)
+    end
+end
+
+def fun_l13_n837(x)
+    if (x < 1)
+        fun_l14_n707(x)
+    else
+        fun_l14_n587(x)
+    end
+end
+
+def fun_l13_n838(x)
+    if (x < 1)
+        fun_l14_n655(x)
+    else
+        fun_l14_n207(x)
+    end
+end
+
+def fun_l13_n839(x)
+    if (x < 1)
+        fun_l14_n231(x)
+    else
+        fun_l14_n459(x)
+    end
+end
+
+def fun_l13_n840(x)
+    if (x < 1)
+        fun_l14_n351(x)
+    else
+        fun_l14_n228(x)
+    end
+end
+
+def fun_l13_n841(x)
+    if (x < 1)
+        fun_l14_n205(x)
+    else
+        fun_l14_n628(x)
+    end
+end
+
+def fun_l13_n842(x)
+    if (x < 1)
+        fun_l14_n725(x)
+    else
+        fun_l14_n246(x)
+    end
+end
+
+def fun_l13_n843(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n891(x)
+    end
+end
+
+def fun_l13_n844(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n168(x)
+    end
+end
+
+def fun_l13_n845(x)
+    if (x < 1)
+        fun_l14_n101(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n846(x)
+    if (x < 1)
+        fun_l14_n162(x)
+    else
+        fun_l14_n270(x)
+    end
+end
+
+def fun_l13_n847(x)
+    if (x < 1)
+        fun_l14_n84(x)
+    else
+        fun_l14_n957(x)
+    end
+end
+
+def fun_l13_n848(x)
+    if (x < 1)
+        fun_l14_n16(x)
+    else
+        fun_l14_n708(x)
+    end
+end
+
+def fun_l13_n849(x)
+    if (x < 1)
+        fun_l14_n636(x)
+    else
+        fun_l14_n518(x)
+    end
+end
+
+def fun_l13_n850(x)
+    if (x < 1)
+        fun_l14_n379(x)
+    else
+        fun_l14_n595(x)
+    end
+end
+
+def fun_l13_n851(x)
+    if (x < 1)
+        fun_l14_n258(x)
+    else
+        fun_l14_n757(x)
+    end
+end
+
+def fun_l13_n852(x)
+    if (x < 1)
+        fun_l14_n995(x)
+    else
+        fun_l14_n380(x)
+    end
+end
+
+def fun_l13_n853(x)
+    if (x < 1)
+        fun_l14_n505(x)
+    else
+        fun_l14_n934(x)
+    end
+end
+
+def fun_l13_n854(x)
+    if (x < 1)
+        fun_l14_n268(x)
+    else
+        fun_l14_n36(x)
+    end
+end
+
+def fun_l13_n855(x)
+    if (x < 1)
+        fun_l14_n795(x)
+    else
+        fun_l14_n905(x)
+    end
+end
+
+def fun_l13_n856(x)
+    if (x < 1)
+        fun_l14_n136(x)
+    else
+        fun_l14_n750(x)
+    end
+end
+
+def fun_l13_n857(x)
+    if (x < 1)
+        fun_l14_n120(x)
+    else
+        fun_l14_n156(x)
+    end
+end
+
+def fun_l13_n858(x)
+    if (x < 1)
+        fun_l14_n157(x)
+    else
+        fun_l14_n414(x)
+    end
+end
+
+def fun_l13_n859(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n718(x)
+    end
+end
+
+def fun_l13_n860(x)
+    if (x < 1)
+        fun_l14_n904(x)
+    else
+        fun_l14_n821(x)
+    end
+end
+
+def fun_l13_n861(x)
+    if (x < 1)
+        fun_l14_n887(x)
+    else
+        fun_l14_n407(x)
+    end
+end
+
+def fun_l13_n862(x)
+    if (x < 1)
+        fun_l14_n870(x)
+    else
+        fun_l14_n950(x)
+    end
+end
+
+def fun_l13_n863(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n712(x)
+    end
+end
+
+def fun_l13_n864(x)
+    if (x < 1)
+        fun_l14_n409(x)
+    else
+        fun_l14_n309(x)
+    end
+end
+
+def fun_l13_n865(x)
+    if (x < 1)
+        fun_l14_n345(x)
+    else
+        fun_l14_n110(x)
+    end
+end
+
+def fun_l13_n866(x)
+    if (x < 1)
+        fun_l14_n401(x)
+    else
+        fun_l14_n970(x)
+    end
+end
+
+def fun_l13_n867(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n260(x)
+    end
+end
+
+def fun_l13_n868(x)
+    if (x < 1)
+        fun_l14_n490(x)
+    else
+        fun_l14_n31(x)
+    end
+end
+
+def fun_l13_n869(x)
+    if (x < 1)
+        fun_l14_n214(x)
+    else
+        fun_l14_n425(x)
+    end
+end
+
+def fun_l13_n870(x)
+    if (x < 1)
+        fun_l14_n660(x)
+    else
+        fun_l14_n703(x)
+    end
+end
+
+def fun_l13_n871(x)
+    if (x < 1)
+        fun_l14_n650(x)
+    else
+        fun_l14_n257(x)
+    end
+end
+
+def fun_l13_n872(x)
+    if (x < 1)
+        fun_l14_n701(x)
+    else
+        fun_l14_n55(x)
+    end
+end
+
+def fun_l13_n873(x)
+    if (x < 1)
+        fun_l14_n225(x)
+    else
+        fun_l14_n701(x)
+    end
+end
+
+def fun_l13_n874(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n793(x)
+    end
+end
+
+def fun_l13_n875(x)
+    if (x < 1)
+        fun_l14_n87(x)
+    else
+        fun_l14_n807(x)
+    end
+end
+
+def fun_l13_n876(x)
+    if (x < 1)
+        fun_l14_n24(x)
+    else
+        fun_l14_n15(x)
+    end
+end
+
+def fun_l13_n877(x)
+    if (x < 1)
+        fun_l14_n120(x)
+    else
+        fun_l14_n551(x)
+    end
+end
+
+def fun_l13_n878(x)
+    if (x < 1)
+        fun_l14_n703(x)
+    else
+        fun_l14_n67(x)
+    end
+end
+
+def fun_l13_n879(x)
+    if (x < 1)
+        fun_l14_n496(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n880(x)
+    if (x < 1)
+        fun_l14_n369(x)
+    else
+        fun_l14_n834(x)
+    end
+end
+
+def fun_l13_n881(x)
+    if (x < 1)
+        fun_l14_n892(x)
+    else
+        fun_l14_n210(x)
+    end
+end
+
+def fun_l13_n882(x)
+    if (x < 1)
+        fun_l14_n587(x)
+    else
+        fun_l14_n472(x)
+    end
+end
+
+def fun_l13_n883(x)
+    if (x < 1)
+        fun_l14_n1(x)
+    else
+        fun_l14_n778(x)
+    end
+end
+
+def fun_l13_n884(x)
+    if (x < 1)
+        fun_l14_n762(x)
+    else
+        fun_l14_n286(x)
+    end
+end
+
+def fun_l13_n885(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n326(x)
+    end
+end
+
+def fun_l13_n886(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n564(x)
+    end
+end
+
+def fun_l13_n887(x)
+    if (x < 1)
+        fun_l14_n461(x)
+    else
+        fun_l14_n415(x)
+    end
+end
+
+def fun_l13_n888(x)
+    if (x < 1)
+        fun_l14_n225(x)
+    else
+        fun_l14_n783(x)
+    end
+end
+
+def fun_l13_n889(x)
+    if (x < 1)
+        fun_l14_n10(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n890(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n473(x)
+    end
+end
+
+def fun_l13_n891(x)
+    if (x < 1)
+        fun_l14_n777(x)
+    else
+        fun_l14_n98(x)
+    end
+end
+
+def fun_l13_n892(x)
+    if (x < 1)
+        fun_l14_n600(x)
+    else
+        fun_l14_n808(x)
+    end
+end
+
+def fun_l13_n893(x)
+    if (x < 1)
+        fun_l14_n605(x)
+    else
+        fun_l14_n687(x)
+    end
+end
+
+def fun_l13_n894(x)
+    if (x < 1)
+        fun_l14_n29(x)
+    else
+        fun_l14_n190(x)
+    end
+end
+
+def fun_l13_n895(x)
+    if (x < 1)
+        fun_l14_n26(x)
+    else
+        fun_l14_n887(x)
+    end
+end
+
+def fun_l13_n896(x)
+    if (x < 1)
+        fun_l14_n680(x)
+    else
+        fun_l14_n413(x)
+    end
+end
+
+def fun_l13_n897(x)
+    if (x < 1)
+        fun_l14_n634(x)
+    else
+        fun_l14_n184(x)
+    end
+end
+
+def fun_l13_n898(x)
+    if (x < 1)
+        fun_l14_n420(x)
+    else
+        fun_l14_n603(x)
+    end
+end
+
+def fun_l13_n899(x)
+    if (x < 1)
+        fun_l14_n702(x)
+    else
+        fun_l14_n54(x)
+    end
+end
+
+def fun_l13_n900(x)
+    if (x < 1)
+        fun_l14_n620(x)
+    else
+        fun_l14_n849(x)
+    end
+end
+
+def fun_l13_n901(x)
+    if (x < 1)
+        fun_l14_n848(x)
+    else
+        fun_l14_n384(x)
+    end
+end
+
+def fun_l13_n902(x)
+    if (x < 1)
+        fun_l14_n726(x)
+    else
+        fun_l14_n624(x)
+    end
+end
+
+def fun_l13_n903(x)
+    if (x < 1)
+        fun_l14_n663(x)
+    else
+        fun_l14_n395(x)
+    end
+end
+
+def fun_l13_n904(x)
+    if (x < 1)
+        fun_l14_n803(x)
+    else
+        fun_l14_n979(x)
+    end
+end
+
+def fun_l13_n905(x)
+    if (x < 1)
+        fun_l14_n487(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n906(x)
+    if (x < 1)
+        fun_l14_n737(x)
+    else
+        fun_l14_n679(x)
+    end
+end
+
+def fun_l13_n907(x)
+    if (x < 1)
+        fun_l14_n815(x)
+    else
+        fun_l14_n84(x)
+    end
+end
+
+def fun_l13_n908(x)
+    if (x < 1)
+        fun_l14_n116(x)
+    else
+        fun_l14_n820(x)
+    end
+end
+
+def fun_l13_n909(x)
+    if (x < 1)
+        fun_l14_n353(x)
+    else
+        fun_l14_n949(x)
+    end
+end
+
+def fun_l13_n910(x)
+    if (x < 1)
+        fun_l14_n271(x)
+    else
+        fun_l14_n168(x)
+    end
+end
+
+def fun_l13_n911(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n236(x)
+    end
+end
+
+def fun_l13_n912(x)
+    if (x < 1)
+        fun_l14_n391(x)
+    else
+        fun_l14_n152(x)
+    end
+end
+
+def fun_l13_n913(x)
+    if (x < 1)
+        fun_l14_n450(x)
+    else
+        fun_l14_n521(x)
+    end
+end
+
+def fun_l13_n914(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n995(x)
+    end
+end
+
+def fun_l13_n915(x)
+    if (x < 1)
+        fun_l14_n177(x)
+    else
+        fun_l14_n358(x)
+    end
+end
+
+def fun_l13_n916(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n32(x)
+    end
+end
+
+def fun_l13_n917(x)
+    if (x < 1)
+        fun_l14_n970(x)
+    else
+        fun_l14_n957(x)
+    end
+end
+
+def fun_l13_n918(x)
+    if (x < 1)
+        fun_l14_n229(x)
+    else
+        fun_l14_n138(x)
+    end
+end
+
+def fun_l13_n919(x)
+    if (x < 1)
+        fun_l14_n439(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n920(x)
+    if (x < 1)
+        fun_l14_n318(x)
+    else
+        fun_l14_n649(x)
+    end
+end
+
+def fun_l13_n921(x)
+    if (x < 1)
+        fun_l14_n455(x)
+    else
+        fun_l14_n312(x)
+    end
+end
+
+def fun_l13_n922(x)
+    if (x < 1)
+        fun_l14_n15(x)
+    else
+        fun_l14_n825(x)
+    end
+end
+
+def fun_l13_n923(x)
+    if (x < 1)
+        fun_l14_n546(x)
+    else
+        fun_l14_n629(x)
+    end
+end
+
+def fun_l13_n924(x)
+    if (x < 1)
+        fun_l14_n298(x)
+    else
+        fun_l14_n563(x)
+    end
+end
+
+def fun_l13_n925(x)
+    if (x < 1)
+        fun_l14_n312(x)
+    else
+        fun_l14_n736(x)
+    end
+end
+
+def fun_l13_n926(x)
+    if (x < 1)
+        fun_l14_n767(x)
+    else
+        fun_l14_n107(x)
+    end
+end
+
+def fun_l13_n927(x)
+    if (x < 1)
+        fun_l14_n966(x)
+    else
+        fun_l14_n765(x)
+    end
+end
+
+def fun_l13_n928(x)
+    if (x < 1)
+        fun_l14_n545(x)
+    else
+        fun_l14_n383(x)
+    end
+end
+
+def fun_l13_n929(x)
+    if (x < 1)
+        fun_l14_n389(x)
+    else
+        fun_l14_n48(x)
+    end
+end
+
+def fun_l13_n930(x)
+    if (x < 1)
+        fun_l14_n142(x)
+    else
+        fun_l14_n632(x)
+    end
+end
+
+def fun_l13_n931(x)
+    if (x < 1)
+        fun_l14_n146(x)
+    else
+        fun_l14_n275(x)
+    end
+end
+
+def fun_l13_n932(x)
+    if (x < 1)
+        fun_l14_n754(x)
+    else
+        fun_l14_n380(x)
+    end
+end
+
+def fun_l13_n933(x)
+    if (x < 1)
+        fun_l14_n561(x)
+    else
+        fun_l14_n677(x)
+    end
+end
+
+def fun_l13_n934(x)
+    if (x < 1)
+        fun_l14_n253(x)
+    else
+        fun_l14_n86(x)
+    end
+end
+
+def fun_l13_n935(x)
+    if (x < 1)
+        fun_l14_n528(x)
+    else
+        fun_l14_n177(x)
+    end
+end
+
+def fun_l13_n936(x)
+    if (x < 1)
+        fun_l14_n938(x)
+    else
+        fun_l14_n265(x)
+    end
+end
+
+def fun_l13_n937(x)
+    if (x < 1)
+        fun_l14_n763(x)
+    else
+        fun_l14_n662(x)
+    end
+end
+
+def fun_l13_n938(x)
+    if (x < 1)
+        fun_l14_n836(x)
+    else
+        fun_l14_n734(x)
+    end
+end
+
+def fun_l13_n939(x)
+    if (x < 1)
+        fun_l14_n127(x)
+    else
+        fun_l14_n111(x)
+    end
+end
+
+def fun_l13_n940(x)
+    if (x < 1)
+        fun_l14_n356(x)
+    else
+        fun_l14_n544(x)
+    end
+end
+
+def fun_l13_n941(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n762(x)
+    end
+end
+
+def fun_l13_n942(x)
+    if (x < 1)
+        fun_l14_n333(x)
+    else
+        fun_l14_n639(x)
+    end
+end
+
+def fun_l13_n943(x)
+    if (x < 1)
+        fun_l14_n452(x)
+    else
+        fun_l14_n944(x)
+    end
+end
+
+def fun_l13_n944(x)
+    if (x < 1)
+        fun_l14_n827(x)
+    else
+        fun_l14_n961(x)
+    end
+end
+
+def fun_l13_n945(x)
+    if (x < 1)
+        fun_l14_n991(x)
+    else
+        fun_l14_n431(x)
+    end
+end
+
+def fun_l13_n946(x)
+    if (x < 1)
+        fun_l14_n646(x)
+    else
+        fun_l14_n183(x)
+    end
+end
+
+def fun_l13_n947(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n948(x)
+    if (x < 1)
+        fun_l14_n210(x)
+    else
+        fun_l14_n664(x)
+    end
+end
+
+def fun_l13_n949(x)
+    if (x < 1)
+        fun_l14_n542(x)
+    else
+        fun_l14_n462(x)
+    end
+end
+
+def fun_l13_n950(x)
+    if (x < 1)
+        fun_l14_n891(x)
+    else
+        fun_l14_n486(x)
+    end
+end
+
+def fun_l13_n951(x)
+    if (x < 1)
+        fun_l14_n527(x)
+    else
+        fun_l14_n721(x)
+    end
+end
+
+def fun_l13_n952(x)
+    if (x < 1)
+        fun_l14_n745(x)
+    else
+        fun_l14_n11(x)
+    end
+end
+
+def fun_l13_n953(x)
+    if (x < 1)
+        fun_l14_n427(x)
+    else
+        fun_l14_n521(x)
+    end
+end
+
+def fun_l13_n954(x)
+    if (x < 1)
+        fun_l14_n907(x)
+    else
+        fun_l14_n878(x)
+    end
+end
+
+def fun_l13_n955(x)
+    if (x < 1)
+        fun_l14_n818(x)
+    else
+        fun_l14_n722(x)
+    end
+end
+
+def fun_l13_n956(x)
+    if (x < 1)
+        fun_l14_n567(x)
+    else
+        fun_l14_n71(x)
+    end
+end
+
+def fun_l13_n957(x)
+    if (x < 1)
+        fun_l14_n203(x)
+    else
+        fun_l14_n221(x)
+    end
+end
+
+def fun_l13_n958(x)
+    if (x < 1)
+        fun_l14_n173(x)
+    else
+        fun_l14_n854(x)
+    end
+end
+
+def fun_l13_n959(x)
+    if (x < 1)
+        fun_l14_n201(x)
+    else
+        fun_l14_n930(x)
+    end
+end
+
+def fun_l13_n960(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n539(x)
+    end
+end
+
+def fun_l13_n961(x)
+    if (x < 1)
+        fun_l14_n459(x)
+    else
+        fun_l14_n771(x)
+    end
+end
+
+def fun_l13_n962(x)
+    if (x < 1)
+        fun_l14_n682(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n963(x)
+    if (x < 1)
+        fun_l14_n897(x)
+    else
+        fun_l14_n650(x)
+    end
+end
+
+def fun_l13_n964(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n726(x)
+    end
+end
+
+def fun_l13_n965(x)
+    if (x < 1)
+        fun_l14_n31(x)
+    else
+        fun_l14_n211(x)
+    end
+end
+
+def fun_l13_n966(x)
+    if (x < 1)
+        fun_l14_n89(x)
+    else
+        fun_l14_n407(x)
+    end
+end
+
+def fun_l13_n967(x)
+    if (x < 1)
+        fun_l14_n772(x)
+    else
+        fun_l14_n7(x)
+    end
+end
+
+def fun_l13_n968(x)
+    if (x < 1)
+        fun_l14_n764(x)
+    else
+        fun_l14_n523(x)
+    end
+end
+
+def fun_l13_n969(x)
+    if (x < 1)
+        fun_l14_n680(x)
+    else
+        fun_l14_n674(x)
+    end
+end
+
+def fun_l13_n970(x)
+    if (x < 1)
+        fun_l14_n517(x)
+    else
+        fun_l14_n346(x)
+    end
+end
+
+def fun_l13_n971(x)
+    if (x < 1)
+        fun_l14_n136(x)
+    else
+        fun_l14_n921(x)
+    end
+end
+
+def fun_l13_n972(x)
+    if (x < 1)
+        fun_l14_n400(x)
+    else
+        fun_l14_n901(x)
+    end
+end
+
+def fun_l13_n973(x)
+    if (x < 1)
+        fun_l14_n62(x)
+    else
+        fun_l14_n784(x)
+    end
+end
+
+def fun_l13_n974(x)
+    if (x < 1)
+        fun_l14_n411(x)
+    else
+        fun_l14_n889(x)
+    end
+end
+
+def fun_l13_n975(x)
+    if (x < 1)
+        fun_l14_n291(x)
+    else
+        fun_l14_n198(x)
+    end
+end
+
+def fun_l13_n976(x)
+    if (x < 1)
+        fun_l14_n229(x)
+    else
+        fun_l14_n346(x)
+    end
+end
+
+def fun_l13_n977(x)
+    if (x < 1)
+        fun_l14_n769(x)
+    else
+        fun_l14_n381(x)
+    end
+end
+
+def fun_l13_n978(x)
+    if (x < 1)
+        fun_l14_n430(x)
+    else
+        fun_l14_n205(x)
+    end
+end
+
+def fun_l13_n979(x)
+    if (x < 1)
+        fun_l14_n170(x)
+    else
+        fun_l14_n927(x)
+    end
+end
+
+def fun_l13_n980(x)
+    if (x < 1)
+        fun_l14_n12(x)
+    else
+        fun_l14_n605(x)
+    end
+end
+
+def fun_l13_n981(x)
+    if (x < 1)
+        fun_l14_n613(x)
+    else
+        fun_l14_n912(x)
+    end
+end
+
+def fun_l13_n982(x)
+    if (x < 1)
+        fun_l14_n982(x)
+    else
+        fun_l14_n707(x)
+    end
+end
+
+def fun_l13_n983(x)
+    if (x < 1)
+        fun_l14_n230(x)
+    else
+        fun_l14_n239(x)
+    end
+end
+
+def fun_l13_n984(x)
+    if (x < 1)
+        fun_l14_n55(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n985(x)
+    if (x < 1)
+        fun_l14_n853(x)
+    else
+        fun_l14_n425(x)
+    end
+end
+
+def fun_l13_n986(x)
+    if (x < 1)
+        fun_l14_n14(x)
+    else
+        fun_l14_n921(x)
+    end
+end
+
+def fun_l13_n987(x)
+    if (x < 1)
+        fun_l14_n166(x)
+    else
+        fun_l14_n948(x)
+    end
+end
+
+def fun_l13_n988(x)
+    if (x < 1)
+        fun_l14_n752(x)
+    else
+        fun_l14_n226(x)
+    end
+end
+
+def fun_l13_n989(x)
+    if (x < 1)
+        fun_l14_n730(x)
+    else
+        fun_l14_n671(x)
+    end
+end
+
+def fun_l13_n990(x)
+    if (x < 1)
+        fun_l14_n603(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n991(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n842(x)
+    end
+end
+
+def fun_l13_n992(x)
+    if (x < 1)
+        fun_l14_n230(x)
+    else
+        fun_l14_n704(x)
+    end
+end
+
+def fun_l13_n993(x)
+    if (x < 1)
+        fun_l14_n897(x)
+    else
+        fun_l14_n190(x)
+    end
+end
+
+def fun_l13_n994(x)
+    if (x < 1)
+        fun_l14_n640(x)
+    else
+        fun_l14_n622(x)
+    end
+end
+
+def fun_l13_n995(x)
+    if (x < 1)
+        fun_l14_n988(x)
+    else
+        fun_l14_n471(x)
+    end
+end
+
+def fun_l13_n996(x)
+    if (x < 1)
+        fun_l14_n721(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n997(x)
+    if (x < 1)
+        fun_l14_n425(x)
+    else
+        fun_l14_n885(x)
+    end
+end
+
+def fun_l13_n998(x)
+    if (x < 1)
+        fun_l14_n279(x)
+    else
+        fun_l14_n966(x)
+    end
+end
+
+def fun_l13_n999(x)
+    if (x < 1)
+        fun_l14_n610(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l14_n0(x)
+    if (x < 1)
+        fun_l15_n46(x)
+    else
+        fun_l15_n966(x)
+    end
+end
+
+def fun_l14_n1(x)
+    if (x < 1)
+        fun_l15_n360(x)
+    else
+        fun_l15_n637(x)
+    end
+end
+
+def fun_l14_n2(x)
+    if (x < 1)
+        fun_l15_n381(x)
+    else
+        fun_l15_n728(x)
+    end
+end
+
+def fun_l14_n3(x)
+    if (x < 1)
+        fun_l15_n189(x)
+    else
+        fun_l15_n826(x)
+    end
+end
+
+def fun_l14_n4(x)
+    if (x < 1)
+        fun_l15_n789(x)
+    else
+        fun_l15_n157(x)
+    end
+end
+
+def fun_l14_n5(x)
+    if (x < 1)
+        fun_l15_n132(x)
+    else
+        fun_l15_n703(x)
+    end
+end
+
+def fun_l14_n6(x)
+    if (x < 1)
+        fun_l15_n64(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n7(x)
+    if (x < 1)
+        fun_l15_n423(x)
+    else
+        fun_l15_n162(x)
+    end
+end
+
+def fun_l14_n8(x)
+    if (x < 1)
+        fun_l15_n177(x)
+    else
+        fun_l15_n923(x)
+    end
+end
+
+def fun_l14_n9(x)
+    if (x < 1)
+        fun_l15_n508(x)
+    else
+        fun_l15_n135(x)
+    end
+end
+
+def fun_l14_n10(x)
+    if (x < 1)
+        fun_l15_n640(x)
+    else
+        fun_l15_n869(x)
+    end
+end
+
+def fun_l14_n11(x)
+    if (x < 1)
+        fun_l15_n592(x)
+    else
+        fun_l15_n519(x)
+    end
+end
+
+def fun_l14_n12(x)
+    if (x < 1)
+        fun_l15_n332(x)
+    else
+        fun_l15_n263(x)
+    end
+end
+
+def fun_l14_n13(x)
+    if (x < 1)
+        fun_l15_n644(x)
+    else
+        fun_l15_n21(x)
+    end
+end
+
+def fun_l14_n14(x)
+    if (x < 1)
+        fun_l15_n436(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n15(x)
+    if (x < 1)
+        fun_l15_n160(x)
+    else
+        fun_l15_n291(x)
+    end
+end
+
+def fun_l14_n16(x)
+    if (x < 1)
+        fun_l15_n726(x)
+    else
+        fun_l15_n704(x)
+    end
+end
+
+def fun_l14_n17(x)
+    if (x < 1)
+        fun_l15_n237(x)
+    else
+        fun_l15_n962(x)
+    end
+end
+
+def fun_l14_n18(x)
+    if (x < 1)
+        fun_l15_n941(x)
+    else
+        fun_l15_n217(x)
+    end
+end
+
+def fun_l14_n19(x)
+    if (x < 1)
+        fun_l15_n904(x)
+    else
+        fun_l15_n36(x)
+    end
+end
+
+def fun_l14_n20(x)
+    if (x < 1)
+        fun_l15_n74(x)
+    else
+        fun_l15_n790(x)
+    end
+end
+
+def fun_l14_n21(x)
+    if (x < 1)
+        fun_l15_n694(x)
+    else
+        fun_l15_n298(x)
+    end
+end
+
+def fun_l14_n22(x)
+    if (x < 1)
+        fun_l15_n757(x)
+    else
+        fun_l15_n636(x)
+    end
+end
+
+def fun_l14_n23(x)
+    if (x < 1)
+        fun_l15_n989(x)
+    else
+        fun_l15_n508(x)
+    end
+end
+
+def fun_l14_n24(x)
+    if (x < 1)
+        fun_l15_n80(x)
+    else
+        fun_l15_n686(x)
+    end
+end
+
+def fun_l14_n25(x)
+    if (x < 1)
+        fun_l15_n365(x)
+    else
+        fun_l15_n922(x)
+    end
+end
+
+def fun_l14_n26(x)
+    if (x < 1)
+        fun_l15_n922(x)
+    else
+        fun_l15_n207(x)
+    end
+end
+
+def fun_l14_n27(x)
+    if (x < 1)
+        fun_l15_n406(x)
+    else
+        fun_l15_n481(x)
+    end
+end
+
+def fun_l14_n28(x)
+    if (x < 1)
+        fun_l15_n986(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n29(x)
+    if (x < 1)
+        fun_l15_n958(x)
+    else
+        fun_l15_n804(x)
+    end
+end
+
+def fun_l14_n30(x)
+    if (x < 1)
+        fun_l15_n233(x)
+    else
+        fun_l15_n877(x)
+    end
+end
+
+def fun_l14_n31(x)
+    if (x < 1)
+        fun_l15_n648(x)
+    else
+        fun_l15_n547(x)
+    end
+end
+
+def fun_l14_n32(x)
+    if (x < 1)
+        fun_l15_n641(x)
+    else
+        fun_l15_n628(x)
+    end
+end
+
+def fun_l14_n33(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n280(x)
+    end
+end
+
+def fun_l14_n34(x)
+    if (x < 1)
+        fun_l15_n373(x)
+    else
+        fun_l15_n948(x)
+    end
+end
+
+def fun_l14_n35(x)
+    if (x < 1)
+        fun_l15_n761(x)
+    else
+        fun_l15_n384(x)
+    end
+end
+
+def fun_l14_n36(x)
+    if (x < 1)
+        fun_l15_n75(x)
+    else
+        fun_l15_n581(x)
+    end
+end
+
+def fun_l14_n37(x)
+    if (x < 1)
+        fun_l15_n962(x)
+    else
+        fun_l15_n723(x)
+    end
+end
+
+def fun_l14_n38(x)
+    if (x < 1)
+        fun_l15_n422(x)
+    else
+        fun_l15_n953(x)
+    end
+end
+
+def fun_l14_n39(x)
+    if (x < 1)
+        fun_l15_n123(x)
+    else
+        fun_l15_n989(x)
+    end
+end
+
+def fun_l14_n40(x)
+    if (x < 1)
+        fun_l15_n789(x)
+    else
+        fun_l15_n472(x)
+    end
+end
+
+def fun_l14_n41(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n997(x)
+    end
+end
+
+def fun_l14_n42(x)
+    if (x < 1)
+        fun_l15_n231(x)
+    else
+        fun_l15_n703(x)
+    end
+end
+
+def fun_l14_n43(x)
+    if (x < 1)
+        fun_l15_n520(x)
+    else
+        fun_l15_n252(x)
+    end
+end
+
+def fun_l14_n44(x)
+    if (x < 1)
+        fun_l15_n966(x)
+    else
+        fun_l15_n244(x)
+    end
+end
+
+def fun_l14_n45(x)
+    if (x < 1)
+        fun_l15_n192(x)
+    else
+        fun_l15_n280(x)
+    end
+end
+
+def fun_l14_n46(x)
+    if (x < 1)
+        fun_l15_n422(x)
+    else
+        fun_l15_n847(x)
+    end
+end
+
+def fun_l14_n47(x)
+    if (x < 1)
+        fun_l15_n228(x)
+    else
+        fun_l15_n564(x)
+    end
+end
+
+def fun_l14_n48(x)
+    if (x < 1)
+        fun_l15_n263(x)
+    else
+        fun_l15_n226(x)
+    end
+end
+
+def fun_l14_n49(x)
+    if (x < 1)
+        fun_l15_n440(x)
+    else
+        fun_l15_n592(x)
+    end
+end
+
+def fun_l14_n50(x)
+    if (x < 1)
+        fun_l15_n464(x)
+    else
+        fun_l15_n135(x)
+    end
+end
+
+def fun_l14_n51(x)
+    if (x < 1)
+        fun_l15_n903(x)
+    else
+        fun_l15_n821(x)
+    end
+end
+
+def fun_l14_n52(x)
+    if (x < 1)
+        fun_l15_n472(x)
+    else
+        fun_l15_n322(x)
+    end
+end
+
+def fun_l14_n53(x)
+    if (x < 1)
+        fun_l15_n107(x)
+    else
+        fun_l15_n497(x)
+    end
+end
+
+def fun_l14_n54(x)
+    if (x < 1)
+        fun_l15_n692(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n55(x)
+    if (x < 1)
+        fun_l15_n694(x)
+    else
+        fun_l15_n995(x)
+    end
+end
+
+def fun_l14_n56(x)
+    if (x < 1)
+        fun_l15_n181(x)
+    else
+        fun_l15_n200(x)
+    end
+end
+
+def fun_l14_n57(x)
+    if (x < 1)
+        fun_l15_n721(x)
+    else
+        fun_l15_n849(x)
+    end
+end
+
+def fun_l14_n58(x)
+    if (x < 1)
+        fun_l15_n626(x)
+    else
+        fun_l15_n866(x)
+    end
+end
+
+def fun_l14_n59(x)
+    if (x < 1)
+        fun_l15_n689(x)
+    else
+        fun_l15_n387(x)
+    end
+end
+
+def fun_l14_n60(x)
+    if (x < 1)
+        fun_l15_n805(x)
+    else
+        fun_l15_n842(x)
+    end
+end
+
+def fun_l14_n61(x)
+    if (x < 1)
+        fun_l15_n457(x)
+    else
+        fun_l15_n472(x)
+    end
+end
+
+def fun_l14_n62(x)
+    if (x < 1)
+        fun_l15_n884(x)
+    else
+        fun_l15_n786(x)
+    end
+end
+
+def fun_l14_n63(x)
+    if (x < 1)
+        fun_l15_n509(x)
+    else
+        fun_l15_n106(x)
+    end
+end
+
+def fun_l14_n64(x)
+    if (x < 1)
+        fun_l15_n600(x)
+    else
+        fun_l15_n314(x)
+    end
+end
+
+def fun_l14_n65(x)
+    if (x < 1)
+        fun_l15_n761(x)
+    else
+        fun_l15_n362(x)
+    end
+end
+
+def fun_l14_n66(x)
+    if (x < 1)
+        fun_l15_n812(x)
+    else
+        fun_l15_n640(x)
+    end
+end
+
+def fun_l14_n67(x)
+    if (x < 1)
+        fun_l15_n862(x)
+    else
+        fun_l15_n627(x)
+    end
+end
+
+def fun_l14_n68(x)
+    if (x < 1)
+        fun_l15_n503(x)
+    else
+        fun_l15_n381(x)
+    end
+end
+
+def fun_l14_n69(x)
+    if (x < 1)
+        fun_l15_n482(x)
+    else
+        fun_l15_n851(x)
+    end
+end
+
+def fun_l14_n70(x)
+    if (x < 1)
+        fun_l15_n253(x)
+    else
+        fun_l15_n728(x)
+    end
+end
+
+def fun_l14_n71(x)
+    if (x < 1)
+        fun_l15_n195(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n72(x)
+    if (x < 1)
+        fun_l15_n482(x)
+    else
+        fun_l15_n604(x)
+    end
+end
+
+def fun_l14_n73(x)
+    if (x < 1)
+        fun_l15_n373(x)
+    else
+        fun_l15_n502(x)
+    end
+end
+
+def fun_l14_n74(x)
+    if (x < 1)
+        fun_l15_n183(x)
+    else
+        fun_l15_n50(x)
+    end
+end
+
+def fun_l14_n75(x)
+    if (x < 1)
+        fun_l15_n397(x)
+    else
+        fun_l15_n467(x)
+    end
+end
+
+def fun_l14_n76(x)
+    if (x < 1)
+        fun_l15_n207(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n77(x)
+    if (x < 1)
+        fun_l15_n416(x)
+    else
+        fun_l15_n846(x)
+    end
+end
+
+def fun_l14_n78(x)
+    if (x < 1)
+        fun_l15_n426(x)
+    else
+        fun_l15_n142(x)
+    end
+end
+
+def fun_l14_n79(x)
+    if (x < 1)
+        fun_l15_n234(x)
+    else
+        fun_l15_n5(x)
+    end
+end
+
+def fun_l14_n80(x)
+    if (x < 1)
+        fun_l15_n133(x)
+    else
+        fun_l15_n216(x)
+    end
+end
+
+def fun_l14_n81(x)
+    if (x < 1)
+        fun_l15_n23(x)
+    else
+        fun_l15_n126(x)
+    end
+end
+
+def fun_l14_n82(x)
+    if (x < 1)
+        fun_l15_n129(x)
+    else
+        fun_l15_n614(x)
+    end
+end
+
+def fun_l14_n83(x)
+    if (x < 1)
+        fun_l15_n560(x)
+    else
+        fun_l15_n559(x)
+    end
+end
+
+def fun_l14_n84(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n300(x)
+    end
+end
+
+def fun_l14_n85(x)
+    if (x < 1)
+        fun_l15_n584(x)
+    else
+        fun_l15_n249(x)
+    end
+end
+
+def fun_l14_n86(x)
+    if (x < 1)
+        fun_l15_n933(x)
+    else
+        fun_l15_n280(x)
+    end
+end
+
+def fun_l14_n87(x)
+    if (x < 1)
+        fun_l15_n528(x)
+    else
+        fun_l15_n350(x)
+    end
+end
+
+def fun_l14_n88(x)
+    if (x < 1)
+        fun_l15_n568(x)
+    else
+        fun_l15_n762(x)
+    end
+end
+
+def fun_l14_n89(x)
+    if (x < 1)
+        fun_l15_n190(x)
+    else
+        fun_l15_n858(x)
+    end
+end
+
+def fun_l14_n90(x)
+    if (x < 1)
+        fun_l15_n896(x)
+    else
+        fun_l15_n543(x)
+    end
+end
+
+def fun_l14_n91(x)
+    if (x < 1)
+        fun_l15_n937(x)
+    else
+        fun_l15_n593(x)
+    end
+end
+
+def fun_l14_n92(x)
+    if (x < 1)
+        fun_l15_n135(x)
+    else
+        fun_l15_n5(x)
+    end
+end
+
+def fun_l14_n93(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n779(x)
+    end
+end
+
+def fun_l14_n94(x)
+    if (x < 1)
+        fun_l15_n617(x)
+    else
+        fun_l15_n375(x)
+    end
+end
+
+def fun_l14_n95(x)
+    if (x < 1)
+        fun_l15_n111(x)
+    else
+        fun_l15_n870(x)
+    end
+end
+
+def fun_l14_n96(x)
+    if (x < 1)
+        fun_l15_n187(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n97(x)
+    if (x < 1)
+        fun_l15_n150(x)
+    else
+        fun_l15_n98(x)
+    end
+end
+
+def fun_l14_n98(x)
+    if (x < 1)
+        fun_l15_n629(x)
+    else
+        fun_l15_n548(x)
+    end
+end
+
+def fun_l14_n99(x)
+    if (x < 1)
+        fun_l15_n37(x)
+    else
+        fun_l15_n383(x)
+    end
+end
+
+def fun_l14_n100(x)
+    if (x < 1)
+        fun_l15_n719(x)
+    else
+        fun_l15_n503(x)
+    end
+end
+
+def fun_l14_n101(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n650(x)
+    end
+end
+
+def fun_l14_n102(x)
+    if (x < 1)
+        fun_l15_n924(x)
+    else
+        fun_l15_n520(x)
+    end
+end
+
+def fun_l14_n103(x)
+    if (x < 1)
+        fun_l15_n194(x)
+    else
+        fun_l15_n613(x)
+    end
+end
+
+def fun_l14_n104(x)
+    if (x < 1)
+        fun_l15_n909(x)
+    else
+        fun_l15_n333(x)
+    end
+end
+
+def fun_l14_n105(x)
+    if (x < 1)
+        fun_l15_n586(x)
+    else
+        fun_l15_n2(x)
+    end
+end
+
+def fun_l14_n106(x)
+    if (x < 1)
+        fun_l15_n373(x)
+    else
+        fun_l15_n316(x)
+    end
+end
+
+def fun_l14_n107(x)
+    if (x < 1)
+        fun_l15_n737(x)
+    else
+        fun_l15_n469(x)
+    end
+end
+
+def fun_l14_n108(x)
+    if (x < 1)
+        fun_l15_n841(x)
+    else
+        fun_l15_n888(x)
+    end
+end
+
+def fun_l14_n109(x)
+    if (x < 1)
+        fun_l15_n165(x)
+    else
+        fun_l15_n108(x)
+    end
+end
+
+def fun_l14_n110(x)
+    if (x < 1)
+        fun_l15_n344(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n111(x)
+    if (x < 1)
+        fun_l15_n424(x)
+    else
+        fun_l15_n702(x)
+    end
+end
+
+def fun_l14_n112(x)
+    if (x < 1)
+        fun_l15_n161(x)
+    else
+        fun_l15_n827(x)
+    end
+end
+
+def fun_l14_n113(x)
+    if (x < 1)
+        fun_l15_n982(x)
+    else
+        fun_l15_n172(x)
+    end
+end
+
+def fun_l14_n114(x)
+    if (x < 1)
+        fun_l15_n233(x)
+    else
+        fun_l15_n178(x)
+    end
+end
+
+def fun_l14_n115(x)
+    if (x < 1)
+        fun_l15_n130(x)
+    else
+        fun_l15_n266(x)
+    end
+end
+
+def fun_l14_n116(x)
+    if (x < 1)
+        fun_l15_n32(x)
+    else
+        fun_l15_n63(x)
+    end
+end
+
+def fun_l14_n117(x)
+    if (x < 1)
+        fun_l15_n117(x)
+    else
+        fun_l15_n659(x)
+    end
+end
+
+def fun_l14_n118(x)
+    if (x < 1)
+        fun_l15_n607(x)
+    else
+        fun_l15_n516(x)
+    end
+end
+
+def fun_l14_n119(x)
+    if (x < 1)
+        fun_l15_n30(x)
+    else
+        fun_l15_n130(x)
+    end
+end
+
+def fun_l14_n120(x)
+    if (x < 1)
+        fun_l15_n510(x)
+    else
+        fun_l15_n789(x)
+    end
+end
+
+def fun_l14_n121(x)
+    if (x < 1)
+        fun_l15_n906(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n122(x)
+    if (x < 1)
+        fun_l15_n51(x)
+    else
+        fun_l15_n378(x)
+    end
+end
+
+def fun_l14_n123(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n896(x)
+    end
+end
+
+def fun_l14_n124(x)
+    if (x < 1)
+        fun_l15_n23(x)
+    else
+        fun_l15_n648(x)
+    end
+end
+
+def fun_l14_n125(x)
+    if (x < 1)
+        fun_l15_n290(x)
+    else
+        fun_l15_n604(x)
+    end
+end
+
+def fun_l14_n126(x)
+    if (x < 1)
+        fun_l15_n410(x)
+    else
+        fun_l15_n646(x)
+    end
+end
+
+def fun_l14_n127(x)
+    if (x < 1)
+        fun_l15_n162(x)
+    else
+        fun_l15_n43(x)
+    end
+end
+
+def fun_l14_n128(x)
+    if (x < 1)
+        fun_l15_n775(x)
+    else
+        fun_l15_n176(x)
+    end
+end
+
+def fun_l14_n129(x)
+    if (x < 1)
+        fun_l15_n642(x)
+    else
+        fun_l15_n709(x)
+    end
+end
+
+def fun_l14_n130(x)
+    if (x < 1)
+        fun_l15_n669(x)
+    else
+        fun_l15_n936(x)
+    end
+end
+
+def fun_l14_n131(x)
+    if (x < 1)
+        fun_l15_n301(x)
+    else
+        fun_l15_n578(x)
+    end
+end
+
+def fun_l14_n132(x)
+    if (x < 1)
+        fun_l15_n112(x)
+    else
+        fun_l15_n72(x)
+    end
+end
+
+def fun_l14_n133(x)
+    if (x < 1)
+        fun_l15_n293(x)
+    else
+        fun_l15_n516(x)
+    end
+end
+
+def fun_l14_n134(x)
+    if (x < 1)
+        fun_l15_n525(x)
+    else
+        fun_l15_n199(x)
+    end
+end
+
+def fun_l14_n135(x)
+    if (x < 1)
+        fun_l15_n168(x)
+    else
+        fun_l15_n430(x)
+    end
+end
+
+def fun_l14_n136(x)
+    if (x < 1)
+        fun_l15_n889(x)
+    else
+        fun_l15_n635(x)
+    end
+end
+
+def fun_l14_n137(x)
+    if (x < 1)
+        fun_l15_n348(x)
+    else
+        fun_l15_n445(x)
+    end
+end
+
+def fun_l14_n138(x)
+    if (x < 1)
+        fun_l15_n828(x)
+    else
+        fun_l15_n23(x)
+    end
+end
+
+def fun_l14_n139(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n25(x)
+    end
+end
+
+def fun_l14_n140(x)
+    if (x < 1)
+        fun_l15_n268(x)
+    else
+        fun_l15_n105(x)
+    end
+end
+
+def fun_l14_n141(x)
+    if (x < 1)
+        fun_l15_n296(x)
+    else
+        fun_l15_n856(x)
+    end
+end
+
+def fun_l14_n142(x)
+    if (x < 1)
+        fun_l15_n206(x)
+    else
+        fun_l15_n417(x)
+    end
+end
+
+def fun_l14_n143(x)
+    if (x < 1)
+        fun_l15_n203(x)
+    else
+        fun_l15_n240(x)
+    end
+end
+
+def fun_l14_n144(x)
+    if (x < 1)
+        fun_l15_n556(x)
+    else
+        fun_l15_n47(x)
+    end
+end
+
+def fun_l14_n145(x)
+    if (x < 1)
+        fun_l15_n340(x)
+    else
+        fun_l15_n511(x)
+    end
+end
+
+def fun_l14_n146(x)
+    if (x < 1)
+        fun_l15_n250(x)
+    else
+        fun_l15_n402(x)
+    end
+end
+
+def fun_l14_n147(x)
+    if (x < 1)
+        fun_l15_n4(x)
+    else
+        fun_l15_n26(x)
+    end
+end
+
+def fun_l14_n148(x)
+    if (x < 1)
+        fun_l15_n52(x)
+    else
+        fun_l15_n366(x)
+    end
+end
+
+def fun_l14_n149(x)
+    if (x < 1)
+        fun_l15_n163(x)
+    else
+        fun_l15_n884(x)
+    end
+end
+
+def fun_l14_n150(x)
+    if (x < 1)
+        fun_l15_n677(x)
+    else
+        fun_l15_n509(x)
+    end
+end
+
+def fun_l14_n151(x)
+    if (x < 1)
+        fun_l15_n949(x)
+    else
+        fun_l15_n393(x)
+    end
+end
+
+def fun_l14_n152(x)
+    if (x < 1)
+        fun_l15_n719(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n153(x)
+    if (x < 1)
+        fun_l15_n12(x)
+    else
+        fun_l15_n985(x)
+    end
+end
+
+def fun_l14_n154(x)
+    if (x < 1)
+        fun_l15_n639(x)
+    else
+        fun_l15_n367(x)
+    end
+end
+
+def fun_l14_n155(x)
+    if (x < 1)
+        fun_l15_n401(x)
+    else
+        fun_l15_n431(x)
+    end
+end
+
+def fun_l14_n156(x)
+    if (x < 1)
+        fun_l15_n897(x)
+    else
+        fun_l15_n136(x)
+    end
+end
+
+def fun_l14_n157(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n158(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n167(x)
+    end
+end
+
+def fun_l14_n159(x)
+    if (x < 1)
+        fun_l15_n643(x)
+    else
+        fun_l15_n458(x)
+    end
+end
+
+def fun_l14_n160(x)
+    if (x < 1)
+        fun_l15_n539(x)
+    else
+        fun_l15_n36(x)
+    end
+end
+
+def fun_l14_n161(x)
+    if (x < 1)
+        fun_l15_n91(x)
+    else
+        fun_l15_n130(x)
+    end
+end
+
+def fun_l14_n162(x)
+    if (x < 1)
+        fun_l15_n214(x)
+    else
+        fun_l15_n712(x)
+    end
+end
+
+def fun_l14_n163(x)
+    if (x < 1)
+        fun_l15_n47(x)
+    else
+        fun_l15_n799(x)
+    end
+end
+
+def fun_l14_n164(x)
+    if (x < 1)
+        fun_l15_n715(x)
+    else
+        fun_l15_n888(x)
+    end
+end
+
+def fun_l14_n165(x)
+    if (x < 1)
+        fun_l15_n904(x)
+    else
+        fun_l15_n484(x)
+    end
+end
+
+def fun_l14_n166(x)
+    if (x < 1)
+        fun_l15_n870(x)
+    else
+        fun_l15_n121(x)
+    end
+end
+
+def fun_l14_n167(x)
+    if (x < 1)
+        fun_l15_n960(x)
+    else
+        fun_l15_n33(x)
+    end
+end
+
+def fun_l14_n168(x)
+    if (x < 1)
+        fun_l15_n16(x)
+    else
+        fun_l15_n24(x)
+    end
+end
+
+def fun_l14_n169(x)
+    if (x < 1)
+        fun_l15_n913(x)
+    else
+        fun_l15_n793(x)
+    end
+end
+
+def fun_l14_n170(x)
+    if (x < 1)
+        fun_l15_n35(x)
+    else
+        fun_l15_n204(x)
+    end
+end
+
+def fun_l14_n171(x)
+    if (x < 1)
+        fun_l15_n526(x)
+    else
+        fun_l15_n92(x)
+    end
+end
+
+def fun_l14_n172(x)
+    if (x < 1)
+        fun_l15_n648(x)
+    else
+        fun_l15_n535(x)
+    end
+end
+
+def fun_l14_n173(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n174(x)
+    if (x < 1)
+        fun_l15_n352(x)
+    else
+        fun_l15_n256(x)
+    end
+end
+
+def fun_l14_n175(x)
+    if (x < 1)
+        fun_l15_n692(x)
+    else
+        fun_l15_n686(x)
+    end
+end
+
+def fun_l14_n176(x)
+    if (x < 1)
+        fun_l15_n189(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n177(x)
+    if (x < 1)
+        fun_l15_n725(x)
+    else
+        fun_l15_n714(x)
+    end
+end
+
+def fun_l14_n178(x)
+    if (x < 1)
+        fun_l15_n43(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n179(x)
+    if (x < 1)
+        fun_l15_n890(x)
+    else
+        fun_l15_n887(x)
+    end
+end
+
+def fun_l14_n180(x)
+    if (x < 1)
+        fun_l15_n499(x)
+    else
+        fun_l15_n729(x)
+    end
+end
+
+def fun_l14_n181(x)
+    if (x < 1)
+        fun_l15_n714(x)
+    else
+        fun_l15_n417(x)
+    end
+end
+
+def fun_l14_n182(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n671(x)
+    end
+end
+
+def fun_l14_n183(x)
+    if (x < 1)
+        fun_l15_n123(x)
+    else
+        fun_l15_n349(x)
+    end
+end
+
+def fun_l14_n184(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n160(x)
+    end
+end
+
+def fun_l14_n185(x)
+    if (x < 1)
+        fun_l15_n43(x)
+    else
+        fun_l15_n965(x)
+    end
+end
+
+def fun_l14_n186(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n411(x)
+    end
+end
+
+def fun_l14_n187(x)
+    if (x < 1)
+        fun_l15_n788(x)
+    else
+        fun_l15_n297(x)
+    end
+end
+
+def fun_l14_n188(x)
+    if (x < 1)
+        fun_l15_n83(x)
+    else
+        fun_l15_n784(x)
+    end
+end
+
+def fun_l14_n189(x)
+    if (x < 1)
+        fun_l15_n403(x)
+    else
+        fun_l15_n469(x)
+    end
+end
+
+def fun_l14_n190(x)
+    if (x < 1)
+        fun_l15_n77(x)
+    else
+        fun_l15_n55(x)
+    end
+end
+
+def fun_l14_n191(x)
+    if (x < 1)
+        fun_l15_n835(x)
+    else
+        fun_l15_n462(x)
+    end
+end
+
+def fun_l14_n192(x)
+    if (x < 1)
+        fun_l15_n830(x)
+    else
+        fun_l15_n680(x)
+    end
+end
+
+def fun_l14_n193(x)
+    if (x < 1)
+        fun_l15_n750(x)
+    else
+        fun_l15_n580(x)
+    end
+end
+
+def fun_l14_n194(x)
+    if (x < 1)
+        fun_l15_n668(x)
+    else
+        fun_l15_n911(x)
+    end
+end
+
+def fun_l14_n195(x)
+    if (x < 1)
+        fun_l15_n90(x)
+    else
+        fun_l15_n232(x)
+    end
+end
+
+def fun_l14_n196(x)
+    if (x < 1)
+        fun_l15_n936(x)
+    else
+        fun_l15_n127(x)
+    end
+end
+
+def fun_l14_n197(x)
+    if (x < 1)
+        fun_l15_n566(x)
+    else
+        fun_l15_n687(x)
+    end
+end
+
+def fun_l14_n198(x)
+    if (x < 1)
+        fun_l15_n797(x)
+    else
+        fun_l15_n835(x)
+    end
+end
+
+def fun_l14_n199(x)
+    if (x < 1)
+        fun_l15_n96(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n200(x)
+    if (x < 1)
+        fun_l15_n891(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n201(x)
+    if (x < 1)
+        fun_l15_n697(x)
+    else
+        fun_l15_n218(x)
+    end
+end
+
+def fun_l14_n202(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n977(x)
+    end
+end
+
+def fun_l14_n203(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n992(x)
+    end
+end
+
+def fun_l14_n204(x)
+    if (x < 1)
+        fun_l15_n591(x)
+    else
+        fun_l15_n394(x)
+    end
+end
+
+def fun_l14_n205(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n522(x)
+    end
+end
+
+def fun_l14_n206(x)
+    if (x < 1)
+        fun_l15_n90(x)
+    else
+        fun_l15_n470(x)
+    end
+end
+
+def fun_l14_n207(x)
+    if (x < 1)
+        fun_l15_n92(x)
+    else
+        fun_l15_n148(x)
+    end
+end
+
+def fun_l14_n208(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n769(x)
+    end
+end
+
+def fun_l14_n209(x)
+    if (x < 1)
+        fun_l15_n32(x)
+    else
+        fun_l15_n211(x)
+    end
+end
+
+def fun_l14_n210(x)
+    if (x < 1)
+        fun_l15_n338(x)
+    else
+        fun_l15_n678(x)
+    end
+end
+
+def fun_l14_n211(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n605(x)
+    end
+end
+
+def fun_l14_n212(x)
+    if (x < 1)
+        fun_l15_n359(x)
+    else
+        fun_l15_n970(x)
+    end
+end
+
+def fun_l14_n213(x)
+    if (x < 1)
+        fun_l15_n437(x)
+    else
+        fun_l15_n279(x)
+    end
+end
+
+def fun_l14_n214(x)
+    if (x < 1)
+        fun_l15_n782(x)
+    else
+        fun_l15_n344(x)
+    end
+end
+
+def fun_l14_n215(x)
+    if (x < 1)
+        fun_l15_n501(x)
+    else
+        fun_l15_n19(x)
+    end
+end
+
+def fun_l14_n216(x)
+    if (x < 1)
+        fun_l15_n525(x)
+    else
+        fun_l15_n269(x)
+    end
+end
+
+def fun_l14_n217(x)
+    if (x < 1)
+        fun_l15_n35(x)
+    else
+        fun_l15_n786(x)
+    end
+end
+
+def fun_l14_n218(x)
+    if (x < 1)
+        fun_l15_n759(x)
+    else
+        fun_l15_n547(x)
+    end
+end
+
+def fun_l14_n219(x)
+    if (x < 1)
+        fun_l15_n260(x)
+    else
+        fun_l15_n155(x)
+    end
+end
+
+def fun_l14_n220(x)
+    if (x < 1)
+        fun_l15_n691(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n221(x)
+    if (x < 1)
+        fun_l15_n632(x)
+    else
+        fun_l15_n803(x)
+    end
+end
+
+def fun_l14_n222(x)
+    if (x < 1)
+        fun_l15_n652(x)
+    else
+        fun_l15_n70(x)
+    end
+end
+
+def fun_l14_n223(x)
+    if (x < 1)
+        fun_l15_n710(x)
+    else
+        fun_l15_n873(x)
+    end
+end
+
+def fun_l14_n224(x)
+    if (x < 1)
+        fun_l15_n3(x)
+    else
+        fun_l15_n509(x)
+    end
+end
+
+def fun_l14_n225(x)
+    if (x < 1)
+        fun_l15_n37(x)
+    else
+        fun_l15_n814(x)
+    end
+end
+
+def fun_l14_n226(x)
+    if (x < 1)
+        fun_l15_n88(x)
+    else
+        fun_l15_n683(x)
+    end
+end
+
+def fun_l14_n227(x)
+    if (x < 1)
+        fun_l15_n898(x)
+    else
+        fun_l15_n996(x)
+    end
+end
+
+def fun_l14_n228(x)
+    if (x < 1)
+        fun_l15_n510(x)
+    else
+        fun_l15_n315(x)
+    end
+end
+
+def fun_l14_n229(x)
+    if (x < 1)
+        fun_l15_n509(x)
+    else
+        fun_l15_n75(x)
+    end
+end
+
+def fun_l14_n230(x)
+    if (x < 1)
+        fun_l15_n184(x)
+    else
+        fun_l15_n650(x)
+    end
+end
+
+def fun_l14_n231(x)
+    if (x < 1)
+        fun_l15_n227(x)
+    else
+        fun_l15_n607(x)
+    end
+end
+
+def fun_l14_n232(x)
+    if (x < 1)
+        fun_l15_n245(x)
+    else
+        fun_l15_n347(x)
+    end
+end
+
+def fun_l14_n233(x)
+    if (x < 1)
+        fun_l15_n728(x)
+    else
+        fun_l15_n457(x)
+    end
+end
+
+def fun_l14_n234(x)
+    if (x < 1)
+        fun_l15_n619(x)
+    else
+        fun_l15_n936(x)
+    end
+end
+
+def fun_l14_n235(x)
+    if (x < 1)
+        fun_l15_n855(x)
+    else
+        fun_l15_n774(x)
+    end
+end
+
+def fun_l14_n236(x)
+    if (x < 1)
+        fun_l15_n217(x)
+    else
+        fun_l15_n908(x)
+    end
+end
+
+def fun_l14_n237(x)
+    if (x < 1)
+        fun_l15_n537(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n238(x)
+    if (x < 1)
+        fun_l15_n930(x)
+    else
+        fun_l15_n601(x)
+    end
+end
+
+def fun_l14_n239(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n903(x)
+    end
+end
+
+def fun_l14_n240(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n882(x)
+    end
+end
+
+def fun_l14_n241(x)
+    if (x < 1)
+        fun_l15_n662(x)
+    else
+        fun_l15_n197(x)
+    end
+end
+
+def fun_l14_n242(x)
+    if (x < 1)
+        fun_l15_n839(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n243(x)
+    if (x < 1)
+        fun_l15_n122(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n244(x)
+    if (x < 1)
+        fun_l15_n209(x)
+    else
+        fun_l15_n977(x)
+    end
+end
+
+def fun_l14_n245(x)
+    if (x < 1)
+        fun_l15_n231(x)
+    else
+        fun_l15_n318(x)
+    end
+end
+
+def fun_l14_n246(x)
+    if (x < 1)
+        fun_l15_n53(x)
+    else
+        fun_l15_n995(x)
+    end
+end
+
+def fun_l14_n247(x)
+    if (x < 1)
+        fun_l15_n276(x)
+    else
+        fun_l15_n458(x)
+    end
+end
+
+def fun_l14_n248(x)
+    if (x < 1)
+        fun_l15_n964(x)
+    else
+        fun_l15_n753(x)
+    end
+end
+
+def fun_l14_n249(x)
+    if (x < 1)
+        fun_l15_n964(x)
+    else
+        fun_l15_n783(x)
+    end
+end
+
+def fun_l14_n250(x)
+    if (x < 1)
+        fun_l15_n865(x)
+    else
+        fun_l15_n736(x)
+    end
+end
+
+def fun_l14_n251(x)
+    if (x < 1)
+        fun_l15_n861(x)
+    else
+        fun_l15_n414(x)
+    end
+end
+
+def fun_l14_n252(x)
+    if (x < 1)
+        fun_l15_n327(x)
+    else
+        fun_l15_n440(x)
+    end
+end
+
+def fun_l14_n253(x)
+    if (x < 1)
+        fun_l15_n800(x)
+    else
+        fun_l15_n186(x)
+    end
+end
+
+def fun_l14_n254(x)
+    if (x < 1)
+        fun_l15_n687(x)
+    else
+        fun_l15_n245(x)
+    end
+end
+
+def fun_l14_n255(x)
+    if (x < 1)
+        fun_l15_n421(x)
+    else
+        fun_l15_n421(x)
+    end
+end
+
+def fun_l14_n256(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n975(x)
+    end
+end
+
+def fun_l14_n257(x)
+    if (x < 1)
+        fun_l15_n835(x)
+    else
+        fun_l15_n697(x)
+    end
+end
+
+def fun_l14_n258(x)
+    if (x < 1)
+        fun_l15_n433(x)
+    else
+        fun_l15_n811(x)
+    end
+end
+
+def fun_l14_n259(x)
+    if (x < 1)
+        fun_l15_n473(x)
+    else
+        fun_l15_n747(x)
+    end
+end
+
+def fun_l14_n260(x)
+    if (x < 1)
+        fun_l15_n636(x)
+    else
+        fun_l15_n718(x)
+    end
+end
+
+def fun_l14_n261(x)
+    if (x < 1)
+        fun_l15_n472(x)
+    else
+        fun_l15_n971(x)
+    end
+end
+
+def fun_l14_n262(x)
+    if (x < 1)
+        fun_l15_n91(x)
+    else
+        fun_l15_n18(x)
+    end
+end
+
+def fun_l14_n263(x)
+    if (x < 1)
+        fun_l15_n582(x)
+    else
+        fun_l15_n629(x)
+    end
+end
+
+def fun_l14_n264(x)
+    if (x < 1)
+        fun_l15_n493(x)
+    else
+        fun_l15_n718(x)
+    end
+end
+
+def fun_l14_n265(x)
+    if (x < 1)
+        fun_l15_n857(x)
+    else
+        fun_l15_n134(x)
+    end
+end
+
+def fun_l14_n266(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n454(x)
+    end
+end
+
+def fun_l14_n267(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n453(x)
+    end
+end
+
+def fun_l14_n268(x)
+    if (x < 1)
+        fun_l15_n679(x)
+    else
+        fun_l15_n886(x)
+    end
+end
+
+def fun_l14_n269(x)
+    if (x < 1)
+        fun_l15_n446(x)
+    else
+        fun_l15_n7(x)
+    end
+end
+
+def fun_l14_n270(x)
+    if (x < 1)
+        fun_l15_n375(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n271(x)
+    if (x < 1)
+        fun_l15_n688(x)
+    else
+        fun_l15_n863(x)
+    end
+end
+
+def fun_l14_n272(x)
+    if (x < 1)
+        fun_l15_n382(x)
+    else
+        fun_l15_n997(x)
+    end
+end
+
+def fun_l14_n273(x)
+    if (x < 1)
+        fun_l15_n281(x)
+    else
+        fun_l15_n909(x)
+    end
+end
+
+def fun_l14_n274(x)
+    if (x < 1)
+        fun_l15_n618(x)
+    else
+        fun_l15_n967(x)
+    end
+end
+
+def fun_l14_n275(x)
+    if (x < 1)
+        fun_l15_n651(x)
+    else
+        fun_l15_n826(x)
+    end
+end
+
+def fun_l14_n276(x)
+    if (x < 1)
+        fun_l15_n326(x)
+    else
+        fun_l15_n11(x)
+    end
+end
+
+def fun_l14_n277(x)
+    if (x < 1)
+        fun_l15_n193(x)
+    else
+        fun_l15_n719(x)
+    end
+end
+
+def fun_l14_n278(x)
+    if (x < 1)
+        fun_l15_n973(x)
+    else
+        fun_l15_n313(x)
+    end
+end
+
+def fun_l14_n279(x)
+    if (x < 1)
+        fun_l15_n33(x)
+    else
+        fun_l15_n526(x)
+    end
+end
+
+def fun_l14_n280(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n158(x)
+    end
+end
+
+def fun_l14_n281(x)
+    if (x < 1)
+        fun_l15_n627(x)
+    else
+        fun_l15_n346(x)
+    end
+end
+
+def fun_l14_n282(x)
+    if (x < 1)
+        fun_l15_n537(x)
+    else
+        fun_l15_n198(x)
+    end
+end
+
+def fun_l14_n283(x)
+    if (x < 1)
+        fun_l15_n779(x)
+    else
+        fun_l15_n0(x)
+    end
+end
+
+def fun_l14_n284(x)
+    if (x < 1)
+        fun_l15_n487(x)
+    else
+        fun_l15_n489(x)
+    end
+end
+
+def fun_l14_n285(x)
+    if (x < 1)
+        fun_l15_n793(x)
+    else
+        fun_l15_n803(x)
+    end
+end
+
+def fun_l14_n286(x)
+    if (x < 1)
+        fun_l15_n206(x)
+    else
+        fun_l15_n936(x)
+    end
+end
+
+def fun_l14_n287(x)
+    if (x < 1)
+        fun_l15_n223(x)
+    else
+        fun_l15_n278(x)
+    end
+end
+
+def fun_l14_n288(x)
+    if (x < 1)
+        fun_l15_n601(x)
+    else
+        fun_l15_n251(x)
+    end
+end
+
+def fun_l14_n289(x)
+    if (x < 1)
+        fun_l15_n144(x)
+    else
+        fun_l15_n420(x)
+    end
+end
+
+def fun_l14_n290(x)
+    if (x < 1)
+        fun_l15_n964(x)
+    else
+        fun_l15_n319(x)
+    end
+end
+
+def fun_l14_n291(x)
+    if (x < 1)
+        fun_l15_n385(x)
+    else
+        fun_l15_n498(x)
+    end
+end
+
+def fun_l14_n292(x)
+    if (x < 1)
+        fun_l15_n19(x)
+    else
+        fun_l15_n959(x)
+    end
+end
+
+def fun_l14_n293(x)
+    if (x < 1)
+        fun_l15_n77(x)
+    else
+        fun_l15_n849(x)
+    end
+end
+
+def fun_l14_n294(x)
+    if (x < 1)
+        fun_l15_n96(x)
+    else
+        fun_l15_n964(x)
+    end
+end
+
+def fun_l14_n295(x)
+    if (x < 1)
+        fun_l15_n374(x)
+    else
+        fun_l15_n337(x)
+    end
+end
+
+def fun_l14_n296(x)
+    if (x < 1)
+        fun_l15_n210(x)
+    else
+        fun_l15_n621(x)
+    end
+end
+
+def fun_l14_n297(x)
+    if (x < 1)
+        fun_l15_n992(x)
+    else
+        fun_l15_n90(x)
+    end
+end
+
+def fun_l14_n298(x)
+    if (x < 1)
+        fun_l15_n442(x)
+    else
+        fun_l15_n799(x)
+    end
+end
+
+def fun_l14_n299(x)
+    if (x < 1)
+        fun_l15_n133(x)
+    else
+        fun_l15_n21(x)
+    end
+end
+
+def fun_l14_n300(x)
+    if (x < 1)
+        fun_l15_n619(x)
+    else
+        fun_l15_n46(x)
+    end
+end
+
+def fun_l14_n301(x)
+    if (x < 1)
+        fun_l15_n359(x)
+    else
+        fun_l15_n386(x)
+    end
+end
+
+def fun_l14_n302(x)
+    if (x < 1)
+        fun_l15_n163(x)
+    else
+        fun_l15_n197(x)
+    end
+end
+
+def fun_l14_n303(x)
+    if (x < 1)
+        fun_l15_n382(x)
+    else
+        fun_l15_n693(x)
+    end
+end
+
+def fun_l14_n304(x)
+    if (x < 1)
+        fun_l15_n700(x)
+    else
+        fun_l15_n167(x)
+    end
+end
+
+def fun_l14_n305(x)
+    if (x < 1)
+        fun_l15_n124(x)
+    else
+        fun_l15_n448(x)
+    end
+end
+
+def fun_l14_n306(x)
+    if (x < 1)
+        fun_l15_n829(x)
+    else
+        fun_l15_n986(x)
+    end
+end
+
+def fun_l14_n307(x)
+    if (x < 1)
+        fun_l15_n39(x)
+    else
+        fun_l15_n557(x)
+    end
+end
+
+def fun_l14_n308(x)
+    if (x < 1)
+        fun_l15_n495(x)
+    else
+        fun_l15_n259(x)
+    end
+end
+
+def fun_l14_n309(x)
+    if (x < 1)
+        fun_l15_n462(x)
+    else
+        fun_l15_n121(x)
+    end
+end
+
+def fun_l14_n310(x)
+    if (x < 1)
+        fun_l15_n110(x)
+    else
+        fun_l15_n159(x)
+    end
+end
+
+def fun_l14_n311(x)
+    if (x < 1)
+        fun_l15_n144(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n312(x)
+    if (x < 1)
+        fun_l15_n679(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n313(x)
+    if (x < 1)
+        fun_l15_n332(x)
+    else
+        fun_l15_n759(x)
+    end
+end
+
+def fun_l14_n314(x)
+    if (x < 1)
+        fun_l15_n819(x)
+    else
+        fun_l15_n595(x)
+    end
+end
+
+def fun_l14_n315(x)
+    if (x < 1)
+        fun_l15_n180(x)
+    else
+        fun_l15_n555(x)
+    end
+end
+
+def fun_l14_n316(x)
+    if (x < 1)
+        fun_l15_n218(x)
+    else
+        fun_l15_n844(x)
+    end
+end
+
+def fun_l14_n317(x)
+    if (x < 1)
+        fun_l15_n486(x)
+    else
+        fun_l15_n666(x)
+    end
+end
+
+def fun_l14_n318(x)
+    if (x < 1)
+        fun_l15_n277(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n319(x)
+    if (x < 1)
+        fun_l15_n874(x)
+    else
+        fun_l15_n802(x)
+    end
+end
+
+def fun_l14_n320(x)
+    if (x < 1)
+        fun_l15_n717(x)
+    else
+        fun_l15_n348(x)
+    end
+end
+
+def fun_l14_n321(x)
+    if (x < 1)
+        fun_l15_n701(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n322(x)
+    if (x < 1)
+        fun_l15_n229(x)
+    else
+        fun_l15_n976(x)
+    end
+end
+
+def fun_l14_n323(x)
+    if (x < 1)
+        fun_l15_n288(x)
+    else
+        fun_l15_n801(x)
+    end
+end
+
+def fun_l14_n324(x)
+    if (x < 1)
+        fun_l15_n25(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n325(x)
+    if (x < 1)
+        fun_l15_n489(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n326(x)
+    if (x < 1)
+        fun_l15_n646(x)
+    else
+        fun_l15_n529(x)
+    end
+end
+
+def fun_l14_n327(x)
+    if (x < 1)
+        fun_l15_n126(x)
+    else
+        fun_l15_n247(x)
+    end
+end
+
+def fun_l14_n328(x)
+    if (x < 1)
+        fun_l15_n180(x)
+    else
+        fun_l15_n838(x)
+    end
+end
+
+def fun_l14_n329(x)
+    if (x < 1)
+        fun_l15_n827(x)
+    else
+        fun_l15_n251(x)
+    end
+end
+
+def fun_l14_n330(x)
+    if (x < 1)
+        fun_l15_n232(x)
+    else
+        fun_l15_n371(x)
+    end
+end
+
+def fun_l14_n331(x)
+    if (x < 1)
+        fun_l15_n742(x)
+    else
+        fun_l15_n365(x)
+    end
+end
+
+def fun_l14_n332(x)
+    if (x < 1)
+        fun_l15_n254(x)
+    else
+        fun_l15_n895(x)
+    end
+end
+
+def fun_l14_n333(x)
+    if (x < 1)
+        fun_l15_n267(x)
+    else
+        fun_l15_n716(x)
+    end
+end
+
+def fun_l14_n334(x)
+    if (x < 1)
+        fun_l15_n907(x)
+    else
+        fun_l15_n846(x)
+    end
+end
+
+def fun_l14_n335(x)
+    if (x < 1)
+        fun_l15_n432(x)
+    else
+        fun_l15_n207(x)
+    end
+end
+
+def fun_l14_n336(x)
+    if (x < 1)
+        fun_l15_n342(x)
+    else
+        fun_l15_n533(x)
+    end
+end
+
+def fun_l14_n337(x)
+    if (x < 1)
+        fun_l15_n155(x)
+    else
+        fun_l15_n626(x)
+    end
+end
+
+def fun_l14_n338(x)
+    if (x < 1)
+        fun_l15_n457(x)
+    else
+        fun_l15_n226(x)
+    end
+end
+
+def fun_l14_n339(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n685(x)
+    end
+end
+
+def fun_l14_n340(x)
+    if (x < 1)
+        fun_l15_n502(x)
+    else
+        fun_l15_n604(x)
+    end
+end
+
+def fun_l14_n341(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n250(x)
+    end
+end
+
+def fun_l14_n342(x)
+    if (x < 1)
+        fun_l15_n16(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n343(x)
+    if (x < 1)
+        fun_l15_n173(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n344(x)
+    if (x < 1)
+        fun_l15_n882(x)
+    else
+        fun_l15_n287(x)
+    end
+end
+
+def fun_l14_n345(x)
+    if (x < 1)
+        fun_l15_n549(x)
+    else
+        fun_l15_n559(x)
+    end
+end
+
+def fun_l14_n346(x)
+    if (x < 1)
+        fun_l15_n587(x)
+    else
+        fun_l15_n712(x)
+    end
+end
+
+def fun_l14_n347(x)
+    if (x < 1)
+        fun_l15_n2(x)
+    else
+        fun_l15_n279(x)
+    end
+end
+
+def fun_l14_n348(x)
+    if (x < 1)
+        fun_l15_n602(x)
+    else
+        fun_l15_n801(x)
+    end
+end
+
+def fun_l14_n349(x)
+    if (x < 1)
+        fun_l15_n114(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n350(x)
+    if (x < 1)
+        fun_l15_n751(x)
+    else
+        fun_l15_n760(x)
+    end
+end
+
+def fun_l14_n351(x)
+    if (x < 1)
+        fun_l15_n570(x)
+    else
+        fun_l15_n168(x)
+    end
+end
+
+def fun_l14_n352(x)
+    if (x < 1)
+        fun_l15_n342(x)
+    else
+        fun_l15_n401(x)
+    end
+end
+
+def fun_l14_n353(x)
+    if (x < 1)
+        fun_l15_n775(x)
+    else
+        fun_l15_n175(x)
+    end
+end
+
+def fun_l14_n354(x)
+    if (x < 1)
+        fun_l15_n0(x)
+    else
+        fun_l15_n831(x)
+    end
+end
+
+def fun_l14_n355(x)
+    if (x < 1)
+        fun_l15_n127(x)
+    else
+        fun_l15_n751(x)
+    end
+end
+
+def fun_l14_n356(x)
+    if (x < 1)
+        fun_l15_n57(x)
+    else
+        fun_l15_n58(x)
+    end
+end
+
+def fun_l14_n357(x)
+    if (x < 1)
+        fun_l15_n696(x)
+    else
+        fun_l15_n694(x)
+    end
+end
+
+def fun_l14_n358(x)
+    if (x < 1)
+        fun_l15_n240(x)
+    else
+        fun_l15_n525(x)
+    end
+end
+
+def fun_l14_n359(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n126(x)
+    end
+end
+
+def fun_l14_n360(x)
+    if (x < 1)
+        fun_l15_n435(x)
+    else
+        fun_l15_n24(x)
+    end
+end
+
+def fun_l14_n361(x)
+    if (x < 1)
+        fun_l15_n366(x)
+    else
+        fun_l15_n397(x)
+    end
+end
+
+def fun_l14_n362(x)
+    if (x < 1)
+        fun_l15_n626(x)
+    else
+        fun_l15_n288(x)
+    end
+end
+
+def fun_l14_n363(x)
+    if (x < 1)
+        fun_l15_n474(x)
+    else
+        fun_l15_n205(x)
+    end
+end
+
+def fun_l14_n364(x)
+    if (x < 1)
+        fun_l15_n299(x)
+    else
+        fun_l15_n9(x)
+    end
+end
+
+def fun_l14_n365(x)
+    if (x < 1)
+        fun_l15_n115(x)
+    else
+        fun_l15_n126(x)
+    end
+end
+
+def fun_l14_n366(x)
+    if (x < 1)
+        fun_l15_n777(x)
+    else
+        fun_l15_n714(x)
+    end
+end
+
+def fun_l14_n367(x)
+    if (x < 1)
+        fun_l15_n697(x)
+    else
+        fun_l15_n663(x)
+    end
+end
+
+def fun_l14_n368(x)
+    if (x < 1)
+        fun_l15_n72(x)
+    else
+        fun_l15_n339(x)
+    end
+end
+
+def fun_l14_n369(x)
+    if (x < 1)
+        fun_l15_n703(x)
+    else
+        fun_l15_n901(x)
+    end
+end
+
+def fun_l14_n370(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n920(x)
+    end
+end
+
+def fun_l14_n371(x)
+    if (x < 1)
+        fun_l15_n97(x)
+    else
+        fun_l15_n418(x)
+    end
+end
+
+def fun_l14_n372(x)
+    if (x < 1)
+        fun_l15_n831(x)
+    else
+        fun_l15_n295(x)
+    end
+end
+
+def fun_l14_n373(x)
+    if (x < 1)
+        fun_l15_n849(x)
+    else
+        fun_l15_n818(x)
+    end
+end
+
+def fun_l14_n374(x)
+    if (x < 1)
+        fun_l15_n308(x)
+    else
+        fun_l15_n379(x)
+    end
+end
+
+def fun_l14_n375(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n109(x)
+    end
+end
+
+def fun_l14_n376(x)
+    if (x < 1)
+        fun_l15_n444(x)
+    else
+        fun_l15_n509(x)
+    end
+end
+
+def fun_l14_n377(x)
+    if (x < 1)
+        fun_l15_n498(x)
+    else
+        fun_l15_n363(x)
+    end
+end
+
+def fun_l14_n378(x)
+    if (x < 1)
+        fun_l15_n475(x)
+    else
+        fun_l15_n250(x)
+    end
+end
+
+def fun_l14_n379(x)
+    if (x < 1)
+        fun_l15_n635(x)
+    else
+        fun_l15_n550(x)
+    end
+end
+
+def fun_l14_n380(x)
+    if (x < 1)
+        fun_l15_n835(x)
+    else
+        fun_l15_n261(x)
+    end
+end
+
+def fun_l14_n381(x)
+    if (x < 1)
+        fun_l15_n903(x)
+    else
+        fun_l15_n492(x)
+    end
+end
+
+def fun_l14_n382(x)
+    if (x < 1)
+        fun_l15_n447(x)
+    else
+        fun_l15_n570(x)
+    end
+end
+
+def fun_l14_n383(x)
+    if (x < 1)
+        fun_l15_n785(x)
+    else
+        fun_l15_n711(x)
+    end
+end
+
+def fun_l14_n384(x)
+    if (x < 1)
+        fun_l15_n321(x)
+    else
+        fun_l15_n966(x)
+    end
+end
+
+def fun_l14_n385(x)
+    if (x < 1)
+        fun_l15_n786(x)
+    else
+        fun_l15_n667(x)
+    end
+end
+
+def fun_l14_n386(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n101(x)
+    end
+end
+
+def fun_l14_n387(x)
+    if (x < 1)
+        fun_l15_n868(x)
+    else
+        fun_l15_n1(x)
+    end
+end
+
+def fun_l14_n388(x)
+    if (x < 1)
+        fun_l15_n380(x)
+    else
+        fun_l15_n949(x)
+    end
+end
+
+def fun_l14_n389(x)
+    if (x < 1)
+        fun_l15_n456(x)
+    else
+        fun_l15_n122(x)
+    end
+end
+
+def fun_l14_n390(x)
+    if (x < 1)
+        fun_l15_n644(x)
+    else
+        fun_l15_n601(x)
+    end
+end
+
+def fun_l14_n391(x)
+    if (x < 1)
+        fun_l15_n523(x)
+    else
+        fun_l15_n754(x)
+    end
+end
+
+def fun_l14_n392(x)
+    if (x < 1)
+        fun_l15_n882(x)
+    else
+        fun_l15_n453(x)
+    end
+end
+
+def fun_l14_n393(x)
+    if (x < 1)
+        fun_l15_n249(x)
+    else
+        fun_l15_n773(x)
+    end
+end
+
+def fun_l14_n394(x)
+    if (x < 1)
+        fun_l15_n453(x)
+    else
+        fun_l15_n490(x)
+    end
+end
+
+def fun_l14_n395(x)
+    if (x < 1)
+        fun_l15_n699(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n396(x)
+    if (x < 1)
+        fun_l15_n726(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n397(x)
+    if (x < 1)
+        fun_l15_n139(x)
+    else
+        fun_l15_n682(x)
+    end
+end
+
+def fun_l14_n398(x)
+    if (x < 1)
+        fun_l15_n246(x)
+    else
+        fun_l15_n74(x)
+    end
+end
+
+def fun_l14_n399(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n504(x)
+    end
+end
+
+def fun_l14_n400(x)
+    if (x < 1)
+        fun_l15_n450(x)
+    else
+        fun_l15_n778(x)
+    end
+end
+
+def fun_l14_n401(x)
+    if (x < 1)
+        fun_l15_n428(x)
+    else
+        fun_l15_n101(x)
+    end
+end
+
+def fun_l14_n402(x)
+    if (x < 1)
+        fun_l15_n779(x)
+    else
+        fun_l15_n924(x)
+    end
+end
+
+def fun_l14_n403(x)
+    if (x < 1)
+        fun_l15_n957(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n404(x)
+    if (x < 1)
+        fun_l15_n0(x)
+    else
+        fun_l15_n781(x)
+    end
+end
+
+def fun_l14_n405(x)
+    if (x < 1)
+        fun_l15_n100(x)
+    else
+        fun_l15_n21(x)
+    end
+end
+
+def fun_l14_n406(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n925(x)
+    end
+end
+
+def fun_l14_n407(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n193(x)
+    end
+end
+
+def fun_l14_n408(x)
+    if (x < 1)
+        fun_l15_n140(x)
+    else
+        fun_l15_n459(x)
+    end
+end
+
+def fun_l14_n409(x)
+    if (x < 1)
+        fun_l15_n484(x)
+    else
+        fun_l15_n584(x)
+    end
+end
+
+def fun_l14_n410(x)
+    if (x < 1)
+        fun_l15_n762(x)
+    else
+        fun_l15_n640(x)
+    end
+end
+
+def fun_l14_n411(x)
+    if (x < 1)
+        fun_l15_n347(x)
+    else
+        fun_l15_n395(x)
+    end
+end
+
+def fun_l14_n412(x)
+    if (x < 1)
+        fun_l15_n809(x)
+    else
+        fun_l15_n105(x)
+    end
+end
+
+def fun_l14_n413(x)
+    if (x < 1)
+        fun_l15_n929(x)
+    else
+        fun_l15_n265(x)
+    end
+end
+
+def fun_l14_n414(x)
+    if (x < 1)
+        fun_l15_n228(x)
+    else
+        fun_l15_n88(x)
+    end
+end
+
+def fun_l14_n415(x)
+    if (x < 1)
+        fun_l15_n650(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n416(x)
+    if (x < 1)
+        fun_l15_n806(x)
+    else
+        fun_l15_n743(x)
+    end
+end
+
+def fun_l14_n417(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n454(x)
+    end
+end
+
+def fun_l14_n418(x)
+    if (x < 1)
+        fun_l15_n571(x)
+    else
+        fun_l15_n651(x)
+    end
+end
+
+def fun_l14_n419(x)
+    if (x < 1)
+        fun_l15_n341(x)
+    else
+        fun_l15_n242(x)
+    end
+end
+
+def fun_l14_n420(x)
+    if (x < 1)
+        fun_l15_n613(x)
+    else
+        fun_l15_n339(x)
+    end
+end
+
+def fun_l14_n421(x)
+    if (x < 1)
+        fun_l15_n657(x)
+    else
+        fun_l15_n759(x)
+    end
+end
+
+def fun_l14_n422(x)
+    if (x < 1)
+        fun_l15_n33(x)
+    else
+        fun_l15_n669(x)
+    end
+end
+
+def fun_l14_n423(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n963(x)
+    end
+end
+
+def fun_l14_n424(x)
+    if (x < 1)
+        fun_l15_n940(x)
+    else
+        fun_l15_n773(x)
+    end
+end
+
+def fun_l14_n425(x)
+    if (x < 1)
+        fun_l15_n489(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n426(x)
+    if (x < 1)
+        fun_l15_n501(x)
+    else
+        fun_l15_n278(x)
+    end
+end
+
+def fun_l14_n427(x)
+    if (x < 1)
+        fun_l15_n620(x)
+    else
+        fun_l15_n426(x)
+    end
+end
+
+def fun_l14_n428(x)
+    if (x < 1)
+        fun_l15_n606(x)
+    else
+        fun_l15_n123(x)
+    end
+end
+
+def fun_l14_n429(x)
+    if (x < 1)
+        fun_l15_n622(x)
+    else
+        fun_l15_n873(x)
+    end
+end
+
+def fun_l14_n430(x)
+    if (x < 1)
+        fun_l15_n660(x)
+    else
+        fun_l15_n736(x)
+    end
+end
+
+def fun_l14_n431(x)
+    if (x < 1)
+        fun_l15_n927(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n432(x)
+    if (x < 1)
+        fun_l15_n492(x)
+    else
+        fun_l15_n947(x)
+    end
+end
+
+def fun_l14_n433(x)
+    if (x < 1)
+        fun_l15_n164(x)
+    else
+        fun_l15_n853(x)
+    end
+end
+
+def fun_l14_n434(x)
+    if (x < 1)
+        fun_l15_n730(x)
+    else
+        fun_l15_n265(x)
+    end
+end
+
+def fun_l14_n435(x)
+    if (x < 1)
+        fun_l15_n548(x)
+    else
+        fun_l15_n272(x)
+    end
+end
+
+def fun_l14_n436(x)
+    if (x < 1)
+        fun_l15_n944(x)
+    else
+        fun_l15_n344(x)
+    end
+end
+
+def fun_l14_n437(x)
+    if (x < 1)
+        fun_l15_n931(x)
+    else
+        fun_l15_n376(x)
+    end
+end
+
+def fun_l14_n438(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n270(x)
+    end
+end
+
+def fun_l14_n439(x)
+    if (x < 1)
+        fun_l15_n705(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n440(x)
+    if (x < 1)
+        fun_l15_n115(x)
+    else
+        fun_l15_n964(x)
+    end
+end
+
+def fun_l14_n441(x)
+    if (x < 1)
+        fun_l15_n396(x)
+    else
+        fun_l15_n780(x)
+    end
+end
+
+def fun_l14_n442(x)
+    if (x < 1)
+        fun_l15_n813(x)
+    else
+        fun_l15_n25(x)
+    end
+end
+
+def fun_l14_n443(x)
+    if (x < 1)
+        fun_l15_n405(x)
+    else
+        fun_l15_n264(x)
+    end
+end
+
+def fun_l14_n444(x)
+    if (x < 1)
+        fun_l15_n816(x)
+    else
+        fun_l15_n857(x)
+    end
+end
+
+def fun_l14_n445(x)
+    if (x < 1)
+        fun_l15_n191(x)
+    else
+        fun_l15_n886(x)
+    end
+end
+
+def fun_l14_n446(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n611(x)
+    end
+end
+
+def fun_l14_n447(x)
+    if (x < 1)
+        fun_l15_n473(x)
+    else
+        fun_l15_n701(x)
+    end
+end
+
+def fun_l14_n448(x)
+    if (x < 1)
+        fun_l15_n532(x)
+    else
+        fun_l15_n501(x)
+    end
+end
+
+def fun_l14_n449(x)
+    if (x < 1)
+        fun_l15_n731(x)
+    else
+        fun_l15_n631(x)
+    end
+end
+
+def fun_l14_n450(x)
+    if (x < 1)
+        fun_l15_n75(x)
+    else
+        fun_l15_n356(x)
+    end
+end
+
+def fun_l14_n451(x)
+    if (x < 1)
+        fun_l15_n614(x)
+    else
+        fun_l15_n600(x)
+    end
+end
+
+def fun_l14_n452(x)
+    if (x < 1)
+        fun_l15_n592(x)
+    else
+        fun_l15_n995(x)
+    end
+end
+
+def fun_l14_n453(x)
+    if (x < 1)
+        fun_l15_n712(x)
+    else
+        fun_l15_n815(x)
+    end
+end
+
+def fun_l14_n454(x)
+    if (x < 1)
+        fun_l15_n859(x)
+    else
+        fun_l15_n560(x)
+    end
+end
+
+def fun_l14_n455(x)
+    if (x < 1)
+        fun_l15_n665(x)
+    else
+        fun_l15_n408(x)
+    end
+end
+
+def fun_l14_n456(x)
+    if (x < 1)
+        fun_l15_n693(x)
+    else
+        fun_l15_n491(x)
+    end
+end
+
+def fun_l14_n457(x)
+    if (x < 1)
+        fun_l15_n29(x)
+    else
+        fun_l15_n515(x)
+    end
+end
+
+def fun_l14_n458(x)
+    if (x < 1)
+        fun_l15_n598(x)
+    else
+        fun_l15_n448(x)
+    end
+end
+
+def fun_l14_n459(x)
+    if (x < 1)
+        fun_l15_n937(x)
+    else
+        fun_l15_n199(x)
+    end
+end
+
+def fun_l14_n460(x)
+    if (x < 1)
+        fun_l15_n950(x)
+    else
+        fun_l15_n874(x)
+    end
+end
+
+def fun_l14_n461(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n650(x)
+    end
+end
+
+def fun_l14_n462(x)
+    if (x < 1)
+        fun_l15_n366(x)
+    else
+        fun_l15_n271(x)
+    end
+end
+
+def fun_l14_n463(x)
+    if (x < 1)
+        fun_l15_n21(x)
+    else
+        fun_l15_n690(x)
+    end
+end
+
+def fun_l14_n464(x)
+    if (x < 1)
+        fun_l15_n660(x)
+    else
+        fun_l15_n71(x)
+    end
+end
+
+def fun_l14_n465(x)
+    if (x < 1)
+        fun_l15_n889(x)
+    else
+        fun_l15_n324(x)
+    end
+end
+
+def fun_l14_n466(x)
+    if (x < 1)
+        fun_l15_n808(x)
+    else
+        fun_l15_n532(x)
+    end
+end
+
+def fun_l14_n467(x)
+    if (x < 1)
+        fun_l15_n72(x)
+    else
+        fun_l15_n52(x)
+    end
+end
+
+def fun_l14_n468(x)
+    if (x < 1)
+        fun_l15_n563(x)
+    else
+        fun_l15_n327(x)
+    end
+end
+
+def fun_l14_n469(x)
+    if (x < 1)
+        fun_l15_n570(x)
+    else
+        fun_l15_n794(x)
+    end
+end
+
+def fun_l14_n470(x)
+    if (x < 1)
+        fun_l15_n8(x)
+    else
+        fun_l15_n594(x)
+    end
+end
+
+def fun_l14_n471(x)
+    if (x < 1)
+        fun_l15_n859(x)
+    else
+        fun_l15_n519(x)
+    end
+end
+
+def fun_l14_n472(x)
+    if (x < 1)
+        fun_l15_n539(x)
+    else
+        fun_l15_n432(x)
+    end
+end
+
+def fun_l14_n473(x)
+    if (x < 1)
+        fun_l15_n795(x)
+    else
+        fun_l15_n916(x)
+    end
+end
+
+def fun_l14_n474(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n157(x)
+    end
+end
+
+def fun_l14_n475(x)
+    if (x < 1)
+        fun_l15_n274(x)
+    else
+        fun_l15_n678(x)
+    end
+end
+
+def fun_l14_n476(x)
+    if (x < 1)
+        fun_l15_n221(x)
+    else
+        fun_l15_n906(x)
+    end
+end
+
+def fun_l14_n477(x)
+    if (x < 1)
+        fun_l15_n116(x)
+    else
+        fun_l15_n778(x)
+    end
+end
+
+def fun_l14_n478(x)
+    if (x < 1)
+        fun_l15_n715(x)
+    else
+        fun_l15_n855(x)
+    end
+end
+
+def fun_l14_n479(x)
+    if (x < 1)
+        fun_l15_n705(x)
+    else
+        fun_l15_n935(x)
+    end
+end
+
+def fun_l14_n480(x)
+    if (x < 1)
+        fun_l15_n119(x)
+    else
+        fun_l15_n559(x)
+    end
+end
+
+def fun_l14_n481(x)
+    if (x < 1)
+        fun_l15_n996(x)
+    else
+        fun_l15_n768(x)
+    end
+end
+
+def fun_l14_n482(x)
+    if (x < 1)
+        fun_l15_n619(x)
+    else
+        fun_l15_n475(x)
+    end
+end
+
+def fun_l14_n483(x)
+    if (x < 1)
+        fun_l15_n189(x)
+    else
+        fun_l15_n398(x)
+    end
+end
+
+def fun_l14_n484(x)
+    if (x < 1)
+        fun_l15_n758(x)
+    else
+        fun_l15_n864(x)
+    end
+end
+
+def fun_l14_n485(x)
+    if (x < 1)
+        fun_l15_n508(x)
+    else
+        fun_l15_n393(x)
+    end
+end
+
+def fun_l14_n486(x)
+    if (x < 1)
+        fun_l15_n825(x)
+    else
+        fun_l15_n337(x)
+    end
+end
+
+def fun_l14_n487(x)
+    if (x < 1)
+        fun_l15_n449(x)
+    else
+        fun_l15_n389(x)
+    end
+end
+
+def fun_l14_n488(x)
+    if (x < 1)
+        fun_l15_n328(x)
+    else
+        fun_l15_n658(x)
+    end
+end
+
+def fun_l14_n489(x)
+    if (x < 1)
+        fun_l15_n138(x)
+    else
+        fun_l15_n938(x)
+    end
+end
+
+def fun_l14_n490(x)
+    if (x < 1)
+        fun_l15_n387(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n491(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n516(x)
+    end
+end
+
+def fun_l14_n492(x)
+    if (x < 1)
+        fun_l15_n962(x)
+    else
+        fun_l15_n821(x)
+    end
+end
+
+def fun_l14_n493(x)
+    if (x < 1)
+        fun_l15_n544(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n494(x)
+    if (x < 1)
+        fun_l15_n610(x)
+    else
+        fun_l15_n404(x)
+    end
+end
+
+def fun_l14_n495(x)
+    if (x < 1)
+        fun_l15_n329(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n496(x)
+    if (x < 1)
+        fun_l15_n659(x)
+    else
+        fun_l15_n837(x)
+    end
+end
+
+def fun_l14_n497(x)
+    if (x < 1)
+        fun_l15_n974(x)
+    else
+        fun_l15_n55(x)
+    end
+end
+
+def fun_l14_n498(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n810(x)
+    end
+end
+
+def fun_l14_n499(x)
+    if (x < 1)
+        fun_l15_n260(x)
+    else
+        fun_l15_n412(x)
+    end
+end
+
+def fun_l14_n500(x)
+    if (x < 1)
+        fun_l15_n940(x)
+    else
+        fun_l15_n920(x)
+    end
+end
+
+def fun_l14_n501(x)
+    if (x < 1)
+        fun_l15_n829(x)
+    else
+        fun_l15_n877(x)
+    end
+end
+
+def fun_l14_n502(x)
+    if (x < 1)
+        fun_l15_n457(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n503(x)
+    if (x < 1)
+        fun_l15_n301(x)
+    else
+        fun_l15_n812(x)
+    end
+end
+
+def fun_l14_n504(x)
+    if (x < 1)
+        fun_l15_n175(x)
+    else
+        fun_l15_n715(x)
+    end
+end
+
+def fun_l14_n505(x)
+    if (x < 1)
+        fun_l15_n897(x)
+    else
+        fun_l15_n103(x)
+    end
+end
+
+def fun_l14_n506(x)
+    if (x < 1)
+        fun_l15_n357(x)
+    else
+        fun_l15_n606(x)
+    end
+end
+
+def fun_l14_n507(x)
+    if (x < 1)
+        fun_l15_n974(x)
+    else
+        fun_l15_n389(x)
+    end
+end
+
+def fun_l14_n508(x)
+    if (x < 1)
+        fun_l15_n641(x)
+    else
+        fun_l15_n450(x)
+    end
+end
+
+def fun_l14_n509(x)
+    if (x < 1)
+        fun_l15_n4(x)
+    else
+        fun_l15_n533(x)
+    end
+end
+
+def fun_l14_n510(x)
+    if (x < 1)
+        fun_l15_n258(x)
+    else
+        fun_l15_n716(x)
+    end
+end
+
+def fun_l14_n511(x)
+    if (x < 1)
+        fun_l15_n919(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n512(x)
+    if (x < 1)
+        fun_l15_n313(x)
+    else
+        fun_l15_n282(x)
+    end
+end
+
+def fun_l14_n513(x)
+    if (x < 1)
+        fun_l15_n116(x)
+    else
+        fun_l15_n861(x)
+    end
+end
+
+def fun_l14_n514(x)
+    if (x < 1)
+        fun_l15_n178(x)
+    else
+        fun_l15_n717(x)
+    end
+end
+
+def fun_l14_n515(x)
+    if (x < 1)
+        fun_l15_n896(x)
+    else
+        fun_l15_n583(x)
+    end
+end
+
+def fun_l14_n516(x)
+    if (x < 1)
+        fun_l15_n203(x)
+    else
+        fun_l15_n802(x)
+    end
+end
+
+def fun_l14_n517(x)
+    if (x < 1)
+        fun_l15_n810(x)
+    else
+        fun_l15_n34(x)
+    end
+end
+
+def fun_l14_n518(x)
+    if (x < 1)
+        fun_l15_n908(x)
+    else
+        fun_l15_n623(x)
+    end
+end
+
+def fun_l14_n519(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n411(x)
+    end
+end
+
+def fun_l14_n520(x)
+    if (x < 1)
+        fun_l15_n880(x)
+    else
+        fun_l15_n38(x)
+    end
+end
+
+def fun_l14_n521(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n522(x)
+    if (x < 1)
+        fun_l15_n693(x)
+    else
+        fun_l15_n950(x)
+    end
+end
+
+def fun_l14_n523(x)
+    if (x < 1)
+        fun_l15_n654(x)
+    else
+        fun_l15_n27(x)
+    end
+end
+
+def fun_l14_n524(x)
+    if (x < 1)
+        fun_l15_n316(x)
+    else
+        fun_l15_n873(x)
+    end
+end
+
+def fun_l14_n525(x)
+    if (x < 1)
+        fun_l15_n554(x)
+    else
+        fun_l15_n656(x)
+    end
+end
+
+def fun_l14_n526(x)
+    if (x < 1)
+        fun_l15_n739(x)
+    else
+        fun_l15_n69(x)
+    end
+end
+
+def fun_l14_n527(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n366(x)
+    end
+end
+
+def fun_l14_n528(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n271(x)
+    end
+end
+
+def fun_l14_n529(x)
+    if (x < 1)
+        fun_l15_n652(x)
+    else
+        fun_l15_n831(x)
+    end
+end
+
+def fun_l14_n530(x)
+    if (x < 1)
+        fun_l15_n746(x)
+    else
+        fun_l15_n841(x)
+    end
+end
+
+def fun_l14_n531(x)
+    if (x < 1)
+        fun_l15_n758(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n532(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n514(x)
+    end
+end
+
+def fun_l14_n533(x)
+    if (x < 1)
+        fun_l15_n375(x)
+    else
+        fun_l15_n84(x)
+    end
+end
+
+def fun_l14_n534(x)
+    if (x < 1)
+        fun_l15_n226(x)
+    else
+        fun_l15_n770(x)
+    end
+end
+
+def fun_l14_n535(x)
+    if (x < 1)
+        fun_l15_n106(x)
+    else
+        fun_l15_n230(x)
+    end
+end
+
+def fun_l14_n536(x)
+    if (x < 1)
+        fun_l15_n18(x)
+    else
+        fun_l15_n335(x)
+    end
+end
+
+def fun_l14_n537(x)
+    if (x < 1)
+        fun_l15_n755(x)
+    else
+        fun_l15_n16(x)
+    end
+end
+
+def fun_l14_n538(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n539(x)
+    if (x < 1)
+        fun_l15_n665(x)
+    else
+        fun_l15_n768(x)
+    end
+end
+
+def fun_l14_n540(x)
+    if (x < 1)
+        fun_l15_n282(x)
+    else
+        fun_l15_n780(x)
+    end
+end
+
+def fun_l14_n541(x)
+    if (x < 1)
+        fun_l15_n633(x)
+    else
+        fun_l15_n240(x)
+    end
+end
+
+def fun_l14_n542(x)
+    if (x < 1)
+        fun_l15_n141(x)
+    else
+        fun_l15_n474(x)
+    end
+end
+
+def fun_l14_n543(x)
+    if (x < 1)
+        fun_l15_n80(x)
+    else
+        fun_l15_n708(x)
+    end
+end
+
+def fun_l14_n544(x)
+    if (x < 1)
+        fun_l15_n309(x)
+    else
+        fun_l15_n808(x)
+    end
+end
+
+def fun_l14_n545(x)
+    if (x < 1)
+        fun_l15_n744(x)
+    else
+        fun_l15_n51(x)
+    end
+end
+
+def fun_l14_n546(x)
+    if (x < 1)
+        fun_l15_n571(x)
+    else
+        fun_l15_n581(x)
+    end
+end
+
+def fun_l14_n547(x)
+    if (x < 1)
+        fun_l15_n272(x)
+    else
+        fun_l15_n867(x)
+    end
+end
+
+def fun_l14_n548(x)
+    if (x < 1)
+        fun_l15_n96(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n549(x)
+    if (x < 1)
+        fun_l15_n828(x)
+    else
+        fun_l15_n109(x)
+    end
+end
+
+def fun_l14_n550(x)
+    if (x < 1)
+        fun_l15_n94(x)
+    else
+        fun_l15_n839(x)
+    end
+end
+
+def fun_l14_n551(x)
+    if (x < 1)
+        fun_l15_n704(x)
+    else
+        fun_l15_n88(x)
+    end
+end
+
+def fun_l14_n552(x)
+    if (x < 1)
+        fun_l15_n531(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n553(x)
+    if (x < 1)
+        fun_l15_n506(x)
+    else
+        fun_l15_n16(x)
+    end
+end
+
+def fun_l14_n554(x)
+    if (x < 1)
+        fun_l15_n583(x)
+    else
+        fun_l15_n186(x)
+    end
+end
+
+def fun_l14_n555(x)
+    if (x < 1)
+        fun_l15_n673(x)
+    else
+        fun_l15_n560(x)
+    end
+end
+
+def fun_l14_n556(x)
+    if (x < 1)
+        fun_l15_n947(x)
+    else
+        fun_l15_n268(x)
+    end
+end
+
+def fun_l14_n557(x)
+    if (x < 1)
+        fun_l15_n88(x)
+    else
+        fun_l15_n43(x)
+    end
+end
+
+def fun_l14_n558(x)
+    if (x < 1)
+        fun_l15_n690(x)
+    else
+        fun_l15_n145(x)
+    end
+end
+
+def fun_l14_n559(x)
+    if (x < 1)
+        fun_l15_n24(x)
+    else
+        fun_l15_n631(x)
+    end
+end
+
+def fun_l14_n560(x)
+    if (x < 1)
+        fun_l15_n381(x)
+    else
+        fun_l15_n3(x)
+    end
+end
+
+def fun_l14_n561(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n816(x)
+    end
+end
+
+def fun_l14_n562(x)
+    if (x < 1)
+        fun_l15_n948(x)
+    else
+        fun_l15_n886(x)
+    end
+end
+
+def fun_l14_n563(x)
+    if (x < 1)
+        fun_l15_n749(x)
+    else
+        fun_l15_n558(x)
+    end
+end
+
+def fun_l14_n564(x)
+    if (x < 1)
+        fun_l15_n715(x)
+    else
+        fun_l15_n157(x)
+    end
+end
+
+def fun_l14_n565(x)
+    if (x < 1)
+        fun_l15_n674(x)
+    else
+        fun_l15_n643(x)
+    end
+end
+
+def fun_l14_n566(x)
+    if (x < 1)
+        fun_l15_n151(x)
+    else
+        fun_l15_n686(x)
+    end
+end
+
+def fun_l14_n567(x)
+    if (x < 1)
+        fun_l15_n362(x)
+    else
+        fun_l15_n37(x)
+    end
+end
+
+def fun_l14_n568(x)
+    if (x < 1)
+        fun_l15_n132(x)
+    else
+        fun_l15_n146(x)
+    end
+end
+
+def fun_l14_n569(x)
+    if (x < 1)
+        fun_l15_n32(x)
+    else
+        fun_l15_n203(x)
+    end
+end
+
+def fun_l14_n570(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n571(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n572(x)
+    if (x < 1)
+        fun_l15_n735(x)
+    else
+        fun_l15_n100(x)
+    end
+end
+
+def fun_l14_n573(x)
+    if (x < 1)
+        fun_l15_n186(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n574(x)
+    if (x < 1)
+        fun_l15_n246(x)
+    else
+        fun_l15_n573(x)
+    end
+end
+
+def fun_l14_n575(x)
+    if (x < 1)
+        fun_l15_n316(x)
+    else
+        fun_l15_n618(x)
+    end
+end
+
+def fun_l14_n576(x)
+    if (x < 1)
+        fun_l15_n426(x)
+    else
+        fun_l15_n616(x)
+    end
+end
+
+def fun_l14_n577(x)
+    if (x < 1)
+        fun_l15_n810(x)
+    else
+        fun_l15_n817(x)
+    end
+end
+
+def fun_l14_n578(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n815(x)
+    end
+end
+
+def fun_l14_n579(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n524(x)
+    end
+end
+
+def fun_l14_n580(x)
+    if (x < 1)
+        fun_l15_n748(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n581(x)
+    if (x < 1)
+        fun_l15_n284(x)
+    else
+        fun_l15_n108(x)
+    end
+end
+
+def fun_l14_n582(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n294(x)
+    end
+end
+
+def fun_l14_n583(x)
+    if (x < 1)
+        fun_l15_n609(x)
+    else
+        fun_l15_n866(x)
+    end
+end
+
+def fun_l14_n584(x)
+    if (x < 1)
+        fun_l15_n293(x)
+    else
+        fun_l15_n980(x)
+    end
+end
+
+def fun_l14_n585(x)
+    if (x < 1)
+        fun_l15_n548(x)
+    else
+        fun_l15_n319(x)
+    end
+end
+
+def fun_l14_n586(x)
+    if (x < 1)
+        fun_l15_n566(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n587(x)
+    if (x < 1)
+        fun_l15_n963(x)
+    else
+        fun_l15_n120(x)
+    end
+end
+
+def fun_l14_n588(x)
+    if (x < 1)
+        fun_l15_n149(x)
+    else
+        fun_l15_n17(x)
+    end
+end
+
+def fun_l14_n589(x)
+    if (x < 1)
+        fun_l15_n11(x)
+    else
+        fun_l15_n396(x)
+    end
+end
+
+def fun_l14_n590(x)
+    if (x < 1)
+        fun_l15_n40(x)
+    else
+        fun_l15_n687(x)
+    end
+end
+
+def fun_l14_n591(x)
+    if (x < 1)
+        fun_l15_n617(x)
+    else
+        fun_l15_n564(x)
+    end
+end
+
+def fun_l14_n592(x)
+    if (x < 1)
+        fun_l15_n26(x)
+    else
+        fun_l15_n812(x)
+    end
+end
+
+def fun_l14_n593(x)
+    if (x < 1)
+        fun_l15_n890(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n594(x)
+    if (x < 1)
+        fun_l15_n455(x)
+    else
+        fun_l15_n248(x)
+    end
+end
+
+def fun_l14_n595(x)
+    if (x < 1)
+        fun_l15_n880(x)
+    else
+        fun_l15_n488(x)
+    end
+end
+
+def fun_l14_n596(x)
+    if (x < 1)
+        fun_l15_n412(x)
+    else
+        fun_l15_n986(x)
+    end
+end
+
+def fun_l14_n597(x)
+    if (x < 1)
+        fun_l15_n487(x)
+    else
+        fun_l15_n75(x)
+    end
+end
+
+def fun_l14_n598(x)
+    if (x < 1)
+        fun_l15_n911(x)
+    else
+        fun_l15_n789(x)
+    end
+end
+
+def fun_l14_n599(x)
+    if (x < 1)
+        fun_l15_n856(x)
+    else
+        fun_l15_n773(x)
+    end
+end
+
+def fun_l14_n600(x)
+    if (x < 1)
+        fun_l15_n57(x)
+    else
+        fun_l15_n538(x)
+    end
+end
+
+def fun_l14_n601(x)
+    if (x < 1)
+        fun_l15_n828(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n602(x)
+    if (x < 1)
+        fun_l15_n230(x)
+    else
+        fun_l15_n326(x)
+    end
+end
+
+def fun_l14_n603(x)
+    if (x < 1)
+        fun_l15_n463(x)
+    else
+        fun_l15_n906(x)
+    end
+end
+
+def fun_l14_n604(x)
+    if (x < 1)
+        fun_l15_n584(x)
+    else
+        fun_l15_n205(x)
+    end
+end
+
+def fun_l14_n605(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n0(x)
+    end
+end
+
+def fun_l14_n606(x)
+    if (x < 1)
+        fun_l15_n258(x)
+    else
+        fun_l15_n574(x)
+    end
+end
+
+def fun_l14_n607(x)
+    if (x < 1)
+        fun_l15_n821(x)
+    else
+        fun_l15_n786(x)
+    end
+end
+
+def fun_l14_n608(x)
+    if (x < 1)
+        fun_l15_n553(x)
+    else
+        fun_l15_n183(x)
+    end
+end
+
+def fun_l14_n609(x)
+    if (x < 1)
+        fun_l15_n853(x)
+    else
+        fun_l15_n600(x)
+    end
+end
+
+def fun_l14_n610(x)
+    if (x < 1)
+        fun_l15_n606(x)
+    else
+        fun_l15_n76(x)
+    end
+end
+
+def fun_l14_n611(x)
+    if (x < 1)
+        fun_l15_n488(x)
+    else
+        fun_l15_n313(x)
+    end
+end
+
+def fun_l14_n612(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n320(x)
+    end
+end
+
+def fun_l14_n613(x)
+    if (x < 1)
+        fun_l15_n410(x)
+    else
+        fun_l15_n225(x)
+    end
+end
+
+def fun_l14_n614(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n699(x)
+    end
+end
+
+def fun_l14_n615(x)
+    if (x < 1)
+        fun_l15_n917(x)
+    else
+        fun_l15_n199(x)
+    end
+end
+
+def fun_l14_n616(x)
+    if (x < 1)
+        fun_l15_n583(x)
+    else
+        fun_l15_n676(x)
+    end
+end
+
+def fun_l14_n617(x)
+    if (x < 1)
+        fun_l15_n708(x)
+    else
+        fun_l15_n323(x)
+    end
+end
+
+def fun_l14_n618(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n570(x)
+    end
+end
+
+def fun_l14_n619(x)
+    if (x < 1)
+        fun_l15_n440(x)
+    else
+        fun_l15_n765(x)
+    end
+end
+
+def fun_l14_n620(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n239(x)
+    end
+end
+
+def fun_l14_n621(x)
+    if (x < 1)
+        fun_l15_n498(x)
+    else
+        fun_l15_n586(x)
+    end
+end
+
+def fun_l14_n622(x)
+    if (x < 1)
+        fun_l15_n786(x)
+    else
+        fun_l15_n894(x)
+    end
+end
+
+def fun_l14_n623(x)
+    if (x < 1)
+        fun_l15_n637(x)
+    else
+        fun_l15_n502(x)
+    end
+end
+
+def fun_l14_n624(x)
+    if (x < 1)
+        fun_l15_n982(x)
+    else
+        fun_l15_n690(x)
+    end
+end
+
+def fun_l14_n625(x)
+    if (x < 1)
+        fun_l15_n696(x)
+    else
+        fun_l15_n407(x)
+    end
+end
+
+def fun_l14_n626(x)
+    if (x < 1)
+        fun_l15_n324(x)
+    else
+        fun_l15_n937(x)
+    end
+end
+
+def fun_l14_n627(x)
+    if (x < 1)
+        fun_l15_n223(x)
+    else
+        fun_l15_n538(x)
+    end
+end
+
+def fun_l14_n628(x)
+    if (x < 1)
+        fun_l15_n865(x)
+    else
+        fun_l15_n459(x)
+    end
+end
+
+def fun_l14_n629(x)
+    if (x < 1)
+        fun_l15_n990(x)
+    else
+        fun_l15_n602(x)
+    end
+end
+
+def fun_l14_n630(x)
+    if (x < 1)
+        fun_l15_n289(x)
+    else
+        fun_l15_n608(x)
+    end
+end
+
+def fun_l14_n631(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n254(x)
+    end
+end
+
+def fun_l14_n632(x)
+    if (x < 1)
+        fun_l15_n8(x)
+    else
+        fun_l15_n114(x)
+    end
+end
+
+def fun_l14_n633(x)
+    if (x < 1)
+        fun_l15_n91(x)
+    else
+        fun_l15_n130(x)
+    end
+end
+
+def fun_l14_n634(x)
+    if (x < 1)
+        fun_l15_n691(x)
+    else
+        fun_l15_n961(x)
+    end
+end
+
+def fun_l14_n635(x)
+    if (x < 1)
+        fun_l15_n590(x)
+    else
+        fun_l15_n739(x)
+    end
+end
+
+def fun_l14_n636(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n526(x)
+    end
+end
+
+def fun_l14_n637(x)
+    if (x < 1)
+        fun_l15_n741(x)
+    else
+        fun_l15_n506(x)
+    end
+end
+
+def fun_l14_n638(x)
+    if (x < 1)
+        fun_l15_n458(x)
+    else
+        fun_l15_n1(x)
+    end
+end
+
+def fun_l14_n639(x)
+    if (x < 1)
+        fun_l15_n933(x)
+    else
+        fun_l15_n500(x)
+    end
+end
+
+def fun_l14_n640(x)
+    if (x < 1)
+        fun_l15_n267(x)
+    else
+        fun_l15_n450(x)
+    end
+end
+
+def fun_l14_n641(x)
+    if (x < 1)
+        fun_l15_n51(x)
+    else
+        fun_l15_n591(x)
+    end
+end
+
+def fun_l14_n642(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n254(x)
+    end
+end
+
+def fun_l14_n643(x)
+    if (x < 1)
+        fun_l15_n320(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n644(x)
+    if (x < 1)
+        fun_l15_n137(x)
+    else
+        fun_l15_n802(x)
+    end
+end
+
+def fun_l14_n645(x)
+    if (x < 1)
+        fun_l15_n365(x)
+    else
+        fun_l15_n779(x)
+    end
+end
+
+def fun_l14_n646(x)
+    if (x < 1)
+        fun_l15_n863(x)
+    else
+        fun_l15_n273(x)
+    end
+end
+
+def fun_l14_n647(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n519(x)
+    end
+end
+
+def fun_l14_n648(x)
+    if (x < 1)
+        fun_l15_n232(x)
+    else
+        fun_l15_n876(x)
+    end
+end
+
+def fun_l14_n649(x)
+    if (x < 1)
+        fun_l15_n850(x)
+    else
+        fun_l15_n51(x)
+    end
+end
+
+def fun_l14_n650(x)
+    if (x < 1)
+        fun_l15_n610(x)
+    else
+        fun_l15_n52(x)
+    end
+end
+
+def fun_l14_n651(x)
+    if (x < 1)
+        fun_l15_n701(x)
+    else
+        fun_l15_n143(x)
+    end
+end
+
+def fun_l14_n652(x)
+    if (x < 1)
+        fun_l15_n933(x)
+    else
+        fun_l15_n748(x)
+    end
+end
+
+def fun_l14_n653(x)
+    if (x < 1)
+        fun_l15_n280(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n654(x)
+    if (x < 1)
+        fun_l15_n361(x)
+    else
+        fun_l15_n107(x)
+    end
+end
+
+def fun_l14_n655(x)
+    if (x < 1)
+        fun_l15_n743(x)
+    else
+        fun_l15_n899(x)
+    end
+end
+
+def fun_l14_n656(x)
+    if (x < 1)
+        fun_l15_n383(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n657(x)
+    if (x < 1)
+        fun_l15_n244(x)
+    else
+        fun_l15_n349(x)
+    end
+end
+
+def fun_l14_n658(x)
+    if (x < 1)
+        fun_l15_n69(x)
+    else
+        fun_l15_n758(x)
+    end
+end
+
+def fun_l14_n659(x)
+    if (x < 1)
+        fun_l15_n570(x)
+    else
+        fun_l15_n760(x)
+    end
+end
+
+def fun_l14_n660(x)
+    if (x < 1)
+        fun_l15_n554(x)
+    else
+        fun_l15_n258(x)
+    end
+end
+
+def fun_l14_n661(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n934(x)
+    end
+end
+
+def fun_l14_n662(x)
+    if (x < 1)
+        fun_l15_n717(x)
+    else
+        fun_l15_n99(x)
+    end
+end
+
+def fun_l14_n663(x)
+    if (x < 1)
+        fun_l15_n882(x)
+    else
+        fun_l15_n515(x)
+    end
+end
+
+def fun_l14_n664(x)
+    if (x < 1)
+        fun_l15_n623(x)
+    else
+        fun_l15_n679(x)
+    end
+end
+
+def fun_l14_n665(x)
+    if (x < 1)
+        fun_l15_n974(x)
+    else
+        fun_l15_n127(x)
+    end
+end
+
+def fun_l14_n666(x)
+    if (x < 1)
+        fun_l15_n592(x)
+    else
+        fun_l15_n322(x)
+    end
+end
+
+def fun_l14_n667(x)
+    if (x < 1)
+        fun_l15_n698(x)
+    else
+        fun_l15_n670(x)
+    end
+end
+
+def fun_l14_n668(x)
+    if (x < 1)
+        fun_l15_n164(x)
+    else
+        fun_l15_n670(x)
+    end
+end
+
+def fun_l14_n669(x)
+    if (x < 1)
+        fun_l15_n837(x)
+    else
+        fun_l15_n113(x)
+    end
+end
+
+def fun_l14_n670(x)
+    if (x < 1)
+        fun_l15_n200(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n671(x)
+    if (x < 1)
+        fun_l15_n593(x)
+    else
+        fun_l15_n822(x)
+    end
+end
+
+def fun_l14_n672(x)
+    if (x < 1)
+        fun_l15_n191(x)
+    else
+        fun_l15_n842(x)
+    end
+end
+
+def fun_l14_n673(x)
+    if (x < 1)
+        fun_l15_n391(x)
+    else
+        fun_l15_n119(x)
+    end
+end
+
+def fun_l14_n674(x)
+    if (x < 1)
+        fun_l15_n914(x)
+    else
+        fun_l15_n453(x)
+    end
+end
+
+def fun_l14_n675(x)
+    if (x < 1)
+        fun_l15_n73(x)
+    else
+        fun_l15_n366(x)
+    end
+end
+
+def fun_l14_n676(x)
+    if (x < 1)
+        fun_l15_n58(x)
+    else
+        fun_l15_n804(x)
+    end
+end
+
+def fun_l14_n677(x)
+    if (x < 1)
+        fun_l15_n905(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n678(x)
+    if (x < 1)
+        fun_l15_n301(x)
+    else
+        fun_l15_n838(x)
+    end
+end
+
+def fun_l14_n679(x)
+    if (x < 1)
+        fun_l15_n14(x)
+    else
+        fun_l15_n567(x)
+    end
+end
+
+def fun_l14_n680(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n325(x)
+    end
+end
+
+def fun_l14_n681(x)
+    if (x < 1)
+        fun_l15_n985(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n682(x)
+    if (x < 1)
+        fun_l15_n197(x)
+    else
+        fun_l15_n175(x)
+    end
+end
+
+def fun_l14_n683(x)
+    if (x < 1)
+        fun_l15_n714(x)
+    else
+        fun_l15_n276(x)
+    end
+end
+
+def fun_l14_n684(x)
+    if (x < 1)
+        fun_l15_n720(x)
+    else
+        fun_l15_n517(x)
+    end
+end
+
+def fun_l14_n685(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n686(x)
+    if (x < 1)
+        fun_l15_n199(x)
+    else
+        fun_l15_n163(x)
+    end
+end
+
+def fun_l14_n687(x)
+    if (x < 1)
+        fun_l15_n769(x)
+    else
+        fun_l15_n205(x)
+    end
+end
+
+def fun_l14_n688(x)
+    if (x < 1)
+        fun_l15_n840(x)
+    else
+        fun_l15_n756(x)
+    end
+end
+
+def fun_l14_n689(x)
+    if (x < 1)
+        fun_l15_n306(x)
+    else
+        fun_l15_n273(x)
+    end
+end
+
+def fun_l14_n690(x)
+    if (x < 1)
+        fun_l15_n549(x)
+    else
+        fun_l15_n192(x)
+    end
+end
+
+def fun_l14_n691(x)
+    if (x < 1)
+        fun_l15_n167(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n692(x)
+    if (x < 1)
+        fun_l15_n175(x)
+    else
+        fun_l15_n361(x)
+    end
+end
+
+def fun_l14_n693(x)
+    if (x < 1)
+        fun_l15_n208(x)
+    else
+        fun_l15_n582(x)
+    end
+end
+
+def fun_l14_n694(x)
+    if (x < 1)
+        fun_l15_n347(x)
+    else
+        fun_l15_n962(x)
+    end
+end
+
+def fun_l14_n695(x)
+    if (x < 1)
+        fun_l15_n381(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n696(x)
+    if (x < 1)
+        fun_l15_n76(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n697(x)
+    if (x < 1)
+        fun_l15_n801(x)
+    else
+        fun_l15_n267(x)
+    end
+end
+
+def fun_l14_n698(x)
+    if (x < 1)
+        fun_l15_n137(x)
+    else
+        fun_l15_n518(x)
+    end
+end
+
+def fun_l14_n699(x)
+    if (x < 1)
+        fun_l15_n56(x)
+    else
+        fun_l15_n758(x)
+    end
+end
+
+def fun_l14_n700(x)
+    if (x < 1)
+        fun_l15_n178(x)
+    else
+        fun_l15_n641(x)
+    end
+end
+
+def fun_l14_n701(x)
+    if (x < 1)
+        fun_l15_n815(x)
+    else
+        fun_l15_n692(x)
+    end
+end
+
+def fun_l14_n702(x)
+    if (x < 1)
+        fun_l15_n355(x)
+    else
+        fun_l15_n338(x)
+    end
+end
+
+def fun_l14_n703(x)
+    if (x < 1)
+        fun_l15_n894(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n704(x)
+    if (x < 1)
+        fun_l15_n728(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n705(x)
+    if (x < 1)
+        fun_l15_n304(x)
+    else
+        fun_l15_n237(x)
+    end
+end
+
+def fun_l14_n706(x)
+    if (x < 1)
+        fun_l15_n57(x)
+    else
+        fun_l15_n947(x)
+    end
+end
+
+def fun_l14_n707(x)
+    if (x < 1)
+        fun_l15_n90(x)
+    else
+        fun_l15_n831(x)
+    end
+end
+
+def fun_l14_n708(x)
+    if (x < 1)
+        fun_l15_n487(x)
+    else
+        fun_l15_n937(x)
+    end
+end
+
+def fun_l14_n709(x)
+    if (x < 1)
+        fun_l15_n898(x)
+    else
+        fun_l15_n151(x)
+    end
+end
+
+def fun_l14_n710(x)
+    if (x < 1)
+        fun_l15_n306(x)
+    else
+        fun_l15_n687(x)
+    end
+end
+
+def fun_l14_n711(x)
+    if (x < 1)
+        fun_l15_n151(x)
+    else
+        fun_l15_n239(x)
+    end
+end
+
+def fun_l14_n712(x)
+    if (x < 1)
+        fun_l15_n512(x)
+    else
+        fun_l15_n203(x)
+    end
+end
+
+def fun_l14_n713(x)
+    if (x < 1)
+        fun_l15_n611(x)
+    else
+        fun_l15_n474(x)
+    end
+end
+
+def fun_l14_n714(x)
+    if (x < 1)
+        fun_l15_n109(x)
+    else
+        fun_l15_n149(x)
+    end
+end
+
+def fun_l14_n715(x)
+    if (x < 1)
+        fun_l15_n187(x)
+    else
+        fun_l15_n563(x)
+    end
+end
+
+def fun_l14_n716(x)
+    if (x < 1)
+        fun_l15_n877(x)
+    else
+        fun_l15_n644(x)
+    end
+end
+
+def fun_l14_n717(x)
+    if (x < 1)
+        fun_l15_n960(x)
+    else
+        fun_l15_n471(x)
+    end
+end
+
+def fun_l14_n718(x)
+    if (x < 1)
+        fun_l15_n250(x)
+    else
+        fun_l15_n93(x)
+    end
+end
+
+def fun_l14_n719(x)
+    if (x < 1)
+        fun_l15_n177(x)
+    else
+        fun_l15_n14(x)
+    end
+end
+
+def fun_l14_n720(x)
+    if (x < 1)
+        fun_l15_n912(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n721(x)
+    if (x < 1)
+        fun_l15_n776(x)
+    else
+        fun_l15_n256(x)
+    end
+end
+
+def fun_l14_n722(x)
+    if (x < 1)
+        fun_l15_n968(x)
+    else
+        fun_l15_n857(x)
+    end
+end
+
+def fun_l14_n723(x)
+    if (x < 1)
+        fun_l15_n402(x)
+    else
+        fun_l15_n60(x)
+    end
+end
+
+def fun_l14_n724(x)
+    if (x < 1)
+        fun_l15_n345(x)
+    else
+        fun_l15_n688(x)
+    end
+end
+
+def fun_l14_n725(x)
+    if (x < 1)
+        fun_l15_n72(x)
+    else
+        fun_l15_n943(x)
+    end
+end
+
+def fun_l14_n726(x)
+    if (x < 1)
+        fun_l15_n535(x)
+    else
+        fun_l15_n916(x)
+    end
+end
+
+def fun_l14_n727(x)
+    if (x < 1)
+        fun_l15_n717(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n728(x)
+    if (x < 1)
+        fun_l15_n679(x)
+    else
+        fun_l15_n348(x)
+    end
+end
+
+def fun_l14_n729(x)
+    if (x < 1)
+        fun_l15_n187(x)
+    else
+        fun_l15_n910(x)
+    end
+end
+
+def fun_l14_n730(x)
+    if (x < 1)
+        fun_l15_n151(x)
+    else
+        fun_l15_n689(x)
+    end
+end
+
+def fun_l14_n731(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n380(x)
+    end
+end
+
+def fun_l14_n732(x)
+    if (x < 1)
+        fun_l15_n627(x)
+    else
+        fun_l15_n214(x)
+    end
+end
+
+def fun_l14_n733(x)
+    if (x < 1)
+        fun_l15_n53(x)
+    else
+        fun_l15_n882(x)
+    end
+end
+
+def fun_l14_n734(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n735(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n719(x)
+    end
+end
+
+def fun_l14_n736(x)
+    if (x < 1)
+        fun_l15_n474(x)
+    else
+        fun_l15_n966(x)
+    end
+end
+
+def fun_l14_n737(x)
+    if (x < 1)
+        fun_l15_n140(x)
+    else
+        fun_l15_n79(x)
+    end
+end
+
+def fun_l14_n738(x)
+    if (x < 1)
+        fun_l15_n682(x)
+    else
+        fun_l15_n788(x)
+    end
+end
+
+def fun_l14_n739(x)
+    if (x < 1)
+        fun_l15_n62(x)
+    else
+        fun_l15_n289(x)
+    end
+end
+
+def fun_l14_n740(x)
+    if (x < 1)
+        fun_l15_n256(x)
+    else
+        fun_l15_n53(x)
+    end
+end
+
+def fun_l14_n741(x)
+    if (x < 1)
+        fun_l15_n571(x)
+    else
+        fun_l15_n912(x)
+    end
+end
+
+def fun_l14_n742(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n757(x)
+    end
+end
+
+def fun_l14_n743(x)
+    if (x < 1)
+        fun_l15_n914(x)
+    else
+        fun_l15_n216(x)
+    end
+end
+
+def fun_l14_n744(x)
+    if (x < 1)
+        fun_l15_n474(x)
+    else
+        fun_l15_n860(x)
+    end
+end
+
+def fun_l14_n745(x)
+    if (x < 1)
+        fun_l15_n303(x)
+    else
+        fun_l15_n417(x)
+    end
+end
+
+def fun_l14_n746(x)
+    if (x < 1)
+        fun_l15_n601(x)
+    else
+        fun_l15_n872(x)
+    end
+end
+
+def fun_l14_n747(x)
+    if (x < 1)
+        fun_l15_n70(x)
+    else
+        fun_l15_n245(x)
+    end
+end
+
+def fun_l14_n748(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n503(x)
+    end
+end
+
+def fun_l14_n749(x)
+    if (x < 1)
+        fun_l15_n965(x)
+    else
+        fun_l15_n89(x)
+    end
+end
+
+def fun_l14_n750(x)
+    if (x < 1)
+        fun_l15_n910(x)
+    else
+        fun_l15_n386(x)
+    end
+end
+
+def fun_l14_n751(x)
+    if (x < 1)
+        fun_l15_n444(x)
+    else
+        fun_l15_n765(x)
+    end
+end
+
+def fun_l14_n752(x)
+    if (x < 1)
+        fun_l15_n481(x)
+    else
+        fun_l15_n356(x)
+    end
+end
+
+def fun_l14_n753(x)
+    if (x < 1)
+        fun_l15_n45(x)
+    else
+        fun_l15_n644(x)
+    end
+end
+
+def fun_l14_n754(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n681(x)
+    end
+end
+
+def fun_l14_n755(x)
+    if (x < 1)
+        fun_l15_n984(x)
+    else
+        fun_l15_n488(x)
+    end
+end
+
+def fun_l14_n756(x)
+    if (x < 1)
+        fun_l15_n751(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n757(x)
+    if (x < 1)
+        fun_l15_n716(x)
+    else
+        fun_l15_n483(x)
+    end
+end
+
+def fun_l14_n758(x)
+    if (x < 1)
+        fun_l15_n863(x)
+    else
+        fun_l15_n841(x)
+    end
+end
+
+def fun_l14_n759(x)
+    if (x < 1)
+        fun_l15_n654(x)
+    else
+        fun_l15_n782(x)
+    end
+end
+
+def fun_l14_n760(x)
+    if (x < 1)
+        fun_l15_n390(x)
+    else
+        fun_l15_n254(x)
+    end
+end
+
+def fun_l14_n761(x)
+    if (x < 1)
+        fun_l15_n888(x)
+    else
+        fun_l15_n739(x)
+    end
+end
+
+def fun_l14_n762(x)
+    if (x < 1)
+        fun_l15_n775(x)
+    else
+        fun_l15_n310(x)
+    end
+end
+
+def fun_l14_n763(x)
+    if (x < 1)
+        fun_l15_n713(x)
+    else
+        fun_l15_n246(x)
+    end
+end
+
+def fun_l14_n764(x)
+    if (x < 1)
+        fun_l15_n318(x)
+    else
+        fun_l15_n121(x)
+    end
+end
+
+def fun_l14_n765(x)
+    if (x < 1)
+        fun_l15_n424(x)
+    else
+        fun_l15_n538(x)
+    end
+end
+
+def fun_l14_n766(x)
+    if (x < 1)
+        fun_l15_n58(x)
+    else
+        fun_l15_n487(x)
+    end
+end
+
+def fun_l14_n767(x)
+    if (x < 1)
+        fun_l15_n48(x)
+    else
+        fun_l15_n776(x)
+    end
+end
+
+def fun_l14_n768(x)
+    if (x < 1)
+        fun_l15_n156(x)
+    else
+        fun_l15_n340(x)
+    end
+end
+
+def fun_l14_n769(x)
+    if (x < 1)
+        fun_l15_n66(x)
+    else
+        fun_l15_n655(x)
+    end
+end
+
+def fun_l14_n770(x)
+    if (x < 1)
+        fun_l15_n15(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n771(x)
+    if (x < 1)
+        fun_l15_n331(x)
+    else
+        fun_l15_n114(x)
+    end
+end
+
+def fun_l14_n772(x)
+    if (x < 1)
+        fun_l15_n267(x)
+    else
+        fun_l15_n711(x)
+    end
+end
+
+def fun_l14_n773(x)
+    if (x < 1)
+        fun_l15_n567(x)
+    else
+        fun_l15_n869(x)
+    end
+end
+
+def fun_l14_n774(x)
+    if (x < 1)
+        fun_l15_n915(x)
+    else
+        fun_l15_n594(x)
+    end
+end
+
+def fun_l14_n775(x)
+    if (x < 1)
+        fun_l15_n139(x)
+    else
+        fun_l15_n285(x)
+    end
+end
+
+def fun_l14_n776(x)
+    if (x < 1)
+        fun_l15_n994(x)
+    else
+        fun_l15_n116(x)
+    end
+end
+
+def fun_l14_n777(x)
+    if (x < 1)
+        fun_l15_n999(x)
+    else
+        fun_l15_n356(x)
+    end
+end
+
+def fun_l14_n778(x)
+    if (x < 1)
+        fun_l15_n46(x)
+    else
+        fun_l15_n845(x)
+    end
+end
+
+def fun_l14_n779(x)
+    if (x < 1)
+        fun_l15_n313(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n780(x)
+    if (x < 1)
+        fun_l15_n282(x)
+    else
+        fun_l15_n489(x)
+    end
+end
+
+def fun_l14_n781(x)
+    if (x < 1)
+        fun_l15_n101(x)
+    else
+        fun_l15_n928(x)
+    end
+end
+
+def fun_l14_n782(x)
+    if (x < 1)
+        fun_l15_n307(x)
+    else
+        fun_l15_n808(x)
+    end
+end
+
+def fun_l14_n783(x)
+    if (x < 1)
+        fun_l15_n475(x)
+    else
+        fun_l15_n347(x)
+    end
+end
+
+def fun_l14_n784(x)
+    if (x < 1)
+        fun_l15_n404(x)
+    else
+        fun_l15_n65(x)
+    end
+end
+
+def fun_l14_n785(x)
+    if (x < 1)
+        fun_l15_n61(x)
+    else
+        fun_l15_n145(x)
+    end
+end
+
+def fun_l14_n786(x)
+    if (x < 1)
+        fun_l15_n919(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n787(x)
+    if (x < 1)
+        fun_l15_n333(x)
+    else
+        fun_l15_n702(x)
+    end
+end
+
+def fun_l14_n788(x)
+    if (x < 1)
+        fun_l15_n924(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n789(x)
+    if (x < 1)
+        fun_l15_n171(x)
+    else
+        fun_l15_n643(x)
+    end
+end
+
+def fun_l14_n790(x)
+    if (x < 1)
+        fun_l15_n852(x)
+    else
+        fun_l15_n421(x)
+    end
+end
+
+def fun_l14_n791(x)
+    if (x < 1)
+        fun_l15_n706(x)
+    else
+        fun_l15_n260(x)
+    end
+end
+
+def fun_l14_n792(x)
+    if (x < 1)
+        fun_l15_n908(x)
+    else
+        fun_l15_n145(x)
+    end
+end
+
+def fun_l14_n793(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n365(x)
+    end
+end
+
+def fun_l14_n794(x)
+    if (x < 1)
+        fun_l15_n727(x)
+    else
+        fun_l15_n758(x)
+    end
+end
+
+def fun_l14_n795(x)
+    if (x < 1)
+        fun_l15_n463(x)
+    else
+        fun_l15_n58(x)
+    end
+end
+
+def fun_l14_n796(x)
+    if (x < 1)
+        fun_l15_n413(x)
+    else
+        fun_l15_n525(x)
+    end
+end
+
+def fun_l14_n797(x)
+    if (x < 1)
+        fun_l15_n970(x)
+    else
+        fun_l15_n480(x)
+    end
+end
+
+def fun_l14_n798(x)
+    if (x < 1)
+        fun_l15_n476(x)
+    else
+        fun_l15_n316(x)
+    end
+end
+
+def fun_l14_n799(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n586(x)
+    end
+end
+
+def fun_l14_n800(x)
+    if (x < 1)
+        fun_l15_n848(x)
+    else
+        fun_l15_n286(x)
+    end
+end
+
+def fun_l14_n801(x)
+    if (x < 1)
+        fun_l15_n745(x)
+    else
+        fun_l15_n144(x)
+    end
+end
+
+def fun_l14_n802(x)
+    if (x < 1)
+        fun_l15_n369(x)
+    else
+        fun_l15_n819(x)
+    end
+end
+
+def fun_l14_n803(x)
+    if (x < 1)
+        fun_l15_n498(x)
+    else
+        fun_l15_n206(x)
+    end
+end
+
+def fun_l14_n804(x)
+    if (x < 1)
+        fun_l15_n817(x)
+    else
+        fun_l15_n707(x)
+    end
+end
+
+def fun_l14_n805(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n43(x)
+    end
+end
+
+def fun_l14_n806(x)
+    if (x < 1)
+        fun_l15_n285(x)
+    else
+        fun_l15_n605(x)
+    end
+end
+
+def fun_l14_n807(x)
+    if (x < 1)
+        fun_l15_n392(x)
+    else
+        fun_l15_n672(x)
+    end
+end
+
+def fun_l14_n808(x)
+    if (x < 1)
+        fun_l15_n965(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n809(x)
+    if (x < 1)
+        fun_l15_n266(x)
+    else
+        fun_l15_n233(x)
+    end
+end
+
+def fun_l14_n810(x)
+    if (x < 1)
+        fun_l15_n514(x)
+    else
+        fun_l15_n204(x)
+    end
+end
+
+def fun_l14_n811(x)
+    if (x < 1)
+        fun_l15_n973(x)
+    else
+        fun_l15_n768(x)
+    end
+end
+
+def fun_l14_n812(x)
+    if (x < 1)
+        fun_l15_n241(x)
+    else
+        fun_l15_n329(x)
+    end
+end
+
+def fun_l14_n813(x)
+    if (x < 1)
+        fun_l15_n150(x)
+    else
+        fun_l15_n264(x)
+    end
+end
+
+def fun_l14_n814(x)
+    if (x < 1)
+        fun_l15_n205(x)
+    else
+        fun_l15_n595(x)
+    end
+end
+
+def fun_l14_n815(x)
+    if (x < 1)
+        fun_l15_n452(x)
+    else
+        fun_l15_n288(x)
+    end
+end
+
+def fun_l14_n816(x)
+    if (x < 1)
+        fun_l15_n385(x)
+    else
+        fun_l15_n633(x)
+    end
+end
+
+def fun_l14_n817(x)
+    if (x < 1)
+        fun_l15_n290(x)
+    else
+        fun_l15_n656(x)
+    end
+end
+
+def fun_l14_n818(x)
+    if (x < 1)
+        fun_l15_n463(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n819(x)
+    if (x < 1)
+        fun_l15_n183(x)
+    else
+        fun_l15_n787(x)
+    end
+end
+
+def fun_l14_n820(x)
+    if (x < 1)
+        fun_l15_n515(x)
+    else
+        fun_l15_n104(x)
+    end
+end
+
+def fun_l14_n821(x)
+    if (x < 1)
+        fun_l15_n848(x)
+    else
+        fun_l15_n745(x)
+    end
+end
+
+def fun_l14_n822(x)
+    if (x < 1)
+        fun_l15_n268(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n823(x)
+    if (x < 1)
+        fun_l15_n607(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n824(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n659(x)
+    end
+end
+
+def fun_l14_n825(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n427(x)
+    end
+end
+
+def fun_l14_n826(x)
+    if (x < 1)
+        fun_l15_n293(x)
+    else
+        fun_l15_n141(x)
+    end
+end
+
+def fun_l14_n827(x)
+    if (x < 1)
+        fun_l15_n112(x)
+    else
+        fun_l15_n135(x)
+    end
+end
+
+def fun_l14_n828(x)
+    if (x < 1)
+        fun_l15_n779(x)
+    else
+        fun_l15_n323(x)
+    end
+end
+
+def fun_l14_n829(x)
+    if (x < 1)
+        fun_l15_n295(x)
+    else
+        fun_l15_n753(x)
+    end
+end
+
+def fun_l14_n830(x)
+    if (x < 1)
+        fun_l15_n683(x)
+    else
+        fun_l15_n303(x)
+    end
+end
+
+def fun_l14_n831(x)
+    if (x < 1)
+        fun_l15_n522(x)
+    else
+        fun_l15_n983(x)
+    end
+end
+
+def fun_l14_n832(x)
+    if (x < 1)
+        fun_l15_n338(x)
+    else
+        fun_l15_n835(x)
+    end
+end
+
+def fun_l14_n833(x)
+    if (x < 1)
+        fun_l15_n888(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n834(x)
+    if (x < 1)
+        fun_l15_n510(x)
+    else
+        fun_l15_n342(x)
+    end
+end
+
+def fun_l14_n835(x)
+    if (x < 1)
+        fun_l15_n168(x)
+    else
+        fun_l15_n864(x)
+    end
+end
+
+def fun_l14_n836(x)
+    if (x < 1)
+        fun_l15_n392(x)
+    else
+        fun_l15_n779(x)
+    end
+end
+
+def fun_l14_n837(x)
+    if (x < 1)
+        fun_l15_n176(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n838(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n839(x)
+    if (x < 1)
+        fun_l15_n223(x)
+    else
+        fun_l15_n213(x)
+    end
+end
+
+def fun_l14_n840(x)
+    if (x < 1)
+        fun_l15_n228(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n841(x)
+    if (x < 1)
+        fun_l15_n551(x)
+    else
+        fun_l15_n649(x)
+    end
+end
+
+def fun_l14_n842(x)
+    if (x < 1)
+        fun_l15_n541(x)
+    else
+        fun_l15_n741(x)
+    end
+end
+
+def fun_l14_n843(x)
+    if (x < 1)
+        fun_l15_n464(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n844(x)
+    if (x < 1)
+        fun_l15_n853(x)
+    else
+        fun_l15_n223(x)
+    end
+end
+
+def fun_l14_n845(x)
+    if (x < 1)
+        fun_l15_n443(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n846(x)
+    if (x < 1)
+        fun_l15_n864(x)
+    else
+        fun_l15_n912(x)
+    end
+end
+
+def fun_l14_n847(x)
+    if (x < 1)
+        fun_l15_n631(x)
+    else
+        fun_l15_n764(x)
+    end
+end
+
+def fun_l14_n848(x)
+    if (x < 1)
+        fun_l15_n198(x)
+    else
+        fun_l15_n825(x)
+    end
+end
+
+def fun_l14_n849(x)
+    if (x < 1)
+        fun_l15_n525(x)
+    else
+        fun_l15_n31(x)
+    end
+end
+
+def fun_l14_n850(x)
+    if (x < 1)
+        fun_l15_n928(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n851(x)
+    if (x < 1)
+        fun_l15_n499(x)
+    else
+        fun_l15_n297(x)
+    end
+end
+
+def fun_l14_n852(x)
+    if (x < 1)
+        fun_l15_n777(x)
+    else
+        fun_l15_n239(x)
+    end
+end
+
+def fun_l14_n853(x)
+    if (x < 1)
+        fun_l15_n120(x)
+    else
+        fun_l15_n134(x)
+    end
+end
+
+def fun_l14_n854(x)
+    if (x < 1)
+        fun_l15_n613(x)
+    else
+        fun_l15_n324(x)
+    end
+end
+
+def fun_l14_n855(x)
+    if (x < 1)
+        fun_l15_n22(x)
+    else
+        fun_l15_n192(x)
+    end
+end
+
+def fun_l14_n856(x)
+    if (x < 1)
+        fun_l15_n609(x)
+    else
+        fun_l15_n284(x)
+    end
+end
+
+def fun_l14_n857(x)
+    if (x < 1)
+        fun_l15_n130(x)
+    else
+        fun_l15_n256(x)
+    end
+end
+
+def fun_l14_n858(x)
+    if (x < 1)
+        fun_l15_n40(x)
+    else
+        fun_l15_n340(x)
+    end
+end
+
+def fun_l14_n859(x)
+    if (x < 1)
+        fun_l15_n644(x)
+    else
+        fun_l15_n522(x)
+    end
+end
+
+def fun_l14_n860(x)
+    if (x < 1)
+        fun_l15_n363(x)
+    else
+        fun_l15_n52(x)
+    end
+end
+
+def fun_l14_n861(x)
+    if (x < 1)
+        fun_l15_n166(x)
+    else
+        fun_l15_n452(x)
+    end
+end
+
+def fun_l14_n862(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n534(x)
+    end
+end
+
+def fun_l14_n863(x)
+    if (x < 1)
+        fun_l15_n489(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n864(x)
+    if (x < 1)
+        fun_l15_n584(x)
+    else
+        fun_l15_n871(x)
+    end
+end
+
+def fun_l14_n865(x)
+    if (x < 1)
+        fun_l15_n868(x)
+    else
+        fun_l15_n807(x)
+    end
+end
+
+def fun_l14_n866(x)
+    if (x < 1)
+        fun_l15_n159(x)
+    else
+        fun_l15_n226(x)
+    end
+end
+
+def fun_l14_n867(x)
+    if (x < 1)
+        fun_l15_n440(x)
+    else
+        fun_l15_n318(x)
+    end
+end
+
+def fun_l14_n868(x)
+    if (x < 1)
+        fun_l15_n603(x)
+    else
+        fun_l15_n440(x)
+    end
+end
+
+def fun_l14_n869(x)
+    if (x < 1)
+        fun_l15_n478(x)
+    else
+        fun_l15_n896(x)
+    end
+end
+
+def fun_l14_n870(x)
+    if (x < 1)
+        fun_l15_n593(x)
+    else
+        fun_l15_n973(x)
+    end
+end
+
+def fun_l14_n871(x)
+    if (x < 1)
+        fun_l15_n767(x)
+    else
+        fun_l15_n828(x)
+    end
+end
+
+def fun_l14_n872(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n309(x)
+    end
+end
+
+def fun_l14_n873(x)
+    if (x < 1)
+        fun_l15_n959(x)
+    else
+        fun_l15_n263(x)
+    end
+end
+
+def fun_l14_n874(x)
+    if (x < 1)
+        fun_l15_n170(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n875(x)
+    if (x < 1)
+        fun_l15_n800(x)
+    else
+        fun_l15_n703(x)
+    end
+end
+
+def fun_l14_n876(x)
+    if (x < 1)
+        fun_l15_n556(x)
+    else
+        fun_l15_n854(x)
+    end
+end
+
+def fun_l14_n877(x)
+    if (x < 1)
+        fun_l15_n472(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n878(x)
+    if (x < 1)
+        fun_l15_n847(x)
+    else
+        fun_l15_n438(x)
+    end
+end
+
+def fun_l14_n879(x)
+    if (x < 1)
+        fun_l15_n401(x)
+    else
+        fun_l15_n59(x)
+    end
+end
+
+def fun_l14_n880(x)
+    if (x < 1)
+        fun_l15_n321(x)
+    else
+        fun_l15_n57(x)
+    end
+end
+
+def fun_l14_n881(x)
+    if (x < 1)
+        fun_l15_n664(x)
+    else
+        fun_l15_n448(x)
+    end
+end
+
+def fun_l14_n882(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n270(x)
+    end
+end
+
+def fun_l14_n883(x)
+    if (x < 1)
+        fun_l15_n596(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n884(x)
+    if (x < 1)
+        fun_l15_n681(x)
+    else
+        fun_l15_n801(x)
+    end
+end
+
+def fun_l14_n885(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n327(x)
+    end
+end
+
+def fun_l14_n886(x)
+    if (x < 1)
+        fun_l15_n657(x)
+    else
+        fun_l15_n325(x)
+    end
+end
+
+def fun_l14_n887(x)
+    if (x < 1)
+        fun_l15_n108(x)
+    else
+        fun_l15_n11(x)
+    end
+end
+
+def fun_l14_n888(x)
+    if (x < 1)
+        fun_l15_n696(x)
+    else
+        fun_l15_n88(x)
+    end
+end
+
+def fun_l14_n889(x)
+    if (x < 1)
+        fun_l15_n220(x)
+    else
+        fun_l15_n282(x)
+    end
+end
+
+def fun_l14_n890(x)
+    if (x < 1)
+        fun_l15_n702(x)
+    else
+        fun_l15_n550(x)
+    end
+end
+
+def fun_l14_n891(x)
+    if (x < 1)
+        fun_l15_n67(x)
+    else
+        fun_l15_n763(x)
+    end
+end
+
+def fun_l14_n892(x)
+    if (x < 1)
+        fun_l15_n386(x)
+    else
+        fun_l15_n938(x)
+    end
+end
+
+def fun_l14_n893(x)
+    if (x < 1)
+        fun_l15_n193(x)
+    else
+        fun_l15_n110(x)
+    end
+end
+
+def fun_l14_n894(x)
+    if (x < 1)
+        fun_l15_n408(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n895(x)
+    if (x < 1)
+        fun_l15_n488(x)
+    else
+        fun_l15_n445(x)
+    end
+end
+
+def fun_l14_n896(x)
+    if (x < 1)
+        fun_l15_n572(x)
+    else
+        fun_l15_n645(x)
+    end
+end
+
+def fun_l14_n897(x)
+    if (x < 1)
+        fun_l15_n432(x)
+    else
+        fun_l15_n288(x)
+    end
+end
+
+def fun_l14_n898(x)
+    if (x < 1)
+        fun_l15_n466(x)
+    else
+        fun_l15_n877(x)
+    end
+end
+
+def fun_l14_n899(x)
+    if (x < 1)
+        fun_l15_n981(x)
+    else
+        fun_l15_n546(x)
+    end
+end
+
+def fun_l14_n900(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n198(x)
+    end
+end
+
+def fun_l14_n901(x)
+    if (x < 1)
+        fun_l15_n447(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n902(x)
+    if (x < 1)
+        fun_l15_n818(x)
+    else
+        fun_l15_n882(x)
+    end
+end
+
+def fun_l14_n903(x)
+    if (x < 1)
+        fun_l15_n86(x)
+    else
+        fun_l15_n864(x)
+    end
+end
+
+def fun_l14_n904(x)
+    if (x < 1)
+        fun_l15_n981(x)
+    else
+        fun_l15_n472(x)
+    end
+end
+
+def fun_l14_n905(x)
+    if (x < 1)
+        fun_l15_n684(x)
+    else
+        fun_l15_n314(x)
+    end
+end
+
+def fun_l14_n906(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n270(x)
+    end
+end
+
+def fun_l14_n907(x)
+    if (x < 1)
+        fun_l15_n958(x)
+    else
+        fun_l15_n293(x)
+    end
+end
+
+def fun_l14_n908(x)
+    if (x < 1)
+        fun_l15_n953(x)
+    else
+        fun_l15_n837(x)
+    end
+end
+
+def fun_l14_n909(x)
+    if (x < 1)
+        fun_l15_n448(x)
+    else
+        fun_l15_n985(x)
+    end
+end
+
+def fun_l14_n910(x)
+    if (x < 1)
+        fun_l15_n148(x)
+    else
+        fun_l15_n210(x)
+    end
+end
+
+def fun_l14_n911(x)
+    if (x < 1)
+        fun_l15_n51(x)
+    else
+        fun_l15_n714(x)
+    end
+end
+
+def fun_l14_n912(x)
+    if (x < 1)
+        fun_l15_n538(x)
+    else
+        fun_l15_n653(x)
+    end
+end
+
+def fun_l14_n913(x)
+    if (x < 1)
+        fun_l15_n374(x)
+    else
+        fun_l15_n836(x)
+    end
+end
+
+def fun_l14_n914(x)
+    if (x < 1)
+        fun_l15_n5(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n915(x)
+    if (x < 1)
+        fun_l15_n670(x)
+    else
+        fun_l15_n961(x)
+    end
+end
+
+def fun_l14_n916(x)
+    if (x < 1)
+        fun_l15_n600(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n917(x)
+    if (x < 1)
+        fun_l15_n235(x)
+    else
+        fun_l15_n542(x)
+    end
+end
+
+def fun_l14_n918(x)
+    if (x < 1)
+        fun_l15_n883(x)
+    else
+        fun_l15_n990(x)
+    end
+end
+
+def fun_l14_n919(x)
+    if (x < 1)
+        fun_l15_n988(x)
+    else
+        fun_l15_n678(x)
+    end
+end
+
+def fun_l14_n920(x)
+    if (x < 1)
+        fun_l15_n246(x)
+    else
+        fun_l15_n942(x)
+    end
+end
+
+def fun_l14_n921(x)
+    if (x < 1)
+        fun_l15_n316(x)
+    else
+        fun_l15_n503(x)
+    end
+end
+
+def fun_l14_n922(x)
+    if (x < 1)
+        fun_l15_n392(x)
+    else
+        fun_l15_n948(x)
+    end
+end
+
+def fun_l14_n923(x)
+    if (x < 1)
+        fun_l15_n79(x)
+    else
+        fun_l15_n375(x)
+    end
+end
+
+def fun_l14_n924(x)
+    if (x < 1)
+        fun_l15_n139(x)
+    else
+        fun_l15_n350(x)
+    end
+end
+
+def fun_l14_n925(x)
+    if (x < 1)
+        fun_l15_n132(x)
+    else
+        fun_l15_n27(x)
+    end
+end
+
+def fun_l14_n926(x)
+    if (x < 1)
+        fun_l15_n608(x)
+    else
+        fun_l15_n910(x)
+    end
+end
+
+def fun_l14_n927(x)
+    if (x < 1)
+        fun_l15_n447(x)
+    else
+        fun_l15_n361(x)
+    end
+end
+
+def fun_l14_n928(x)
+    if (x < 1)
+        fun_l15_n432(x)
+    else
+        fun_l15_n943(x)
+    end
+end
+
+def fun_l14_n929(x)
+    if (x < 1)
+        fun_l15_n726(x)
+    else
+        fun_l15_n19(x)
+    end
+end
+
+def fun_l14_n930(x)
+    if (x < 1)
+        fun_l15_n311(x)
+    else
+        fun_l15_n683(x)
+    end
+end
+
+def fun_l14_n931(x)
+    if (x < 1)
+        fun_l15_n988(x)
+    else
+        fun_l15_n731(x)
+    end
+end
+
+def fun_l14_n932(x)
+    if (x < 1)
+        fun_l15_n916(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n933(x)
+    if (x < 1)
+        fun_l15_n723(x)
+    else
+        fun_l15_n954(x)
+    end
+end
+
+def fun_l14_n934(x)
+    if (x < 1)
+        fun_l15_n82(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n935(x)
+    if (x < 1)
+        fun_l15_n11(x)
+    else
+        fun_l15_n407(x)
+    end
+end
+
+def fun_l14_n936(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n733(x)
+    end
+end
+
+def fun_l14_n937(x)
+    if (x < 1)
+        fun_l15_n37(x)
+    else
+        fun_l15_n617(x)
+    end
+end
+
+def fun_l14_n938(x)
+    if (x < 1)
+        fun_l15_n733(x)
+    else
+        fun_l15_n178(x)
+    end
+end
+
+def fun_l14_n939(x)
+    if (x < 1)
+        fun_l15_n989(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n940(x)
+    if (x < 1)
+        fun_l15_n297(x)
+    else
+        fun_l15_n393(x)
+    end
+end
+
+def fun_l14_n941(x)
+    if (x < 1)
+        fun_l15_n167(x)
+    else
+        fun_l15_n498(x)
+    end
+end
+
+def fun_l14_n942(x)
+    if (x < 1)
+        fun_l15_n365(x)
+    else
+        fun_l15_n158(x)
+    end
+end
+
+def fun_l14_n943(x)
+    if (x < 1)
+        fun_l15_n340(x)
+    else
+        fun_l15_n813(x)
+    end
+end
+
+def fun_l14_n944(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n150(x)
+    end
+end
+
+def fun_l14_n945(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n639(x)
+    end
+end
+
+def fun_l14_n946(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n439(x)
+    end
+end
+
+def fun_l14_n947(x)
+    if (x < 1)
+        fun_l15_n149(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n948(x)
+    if (x < 1)
+        fun_l15_n383(x)
+    else
+        fun_l15_n525(x)
+    end
+end
+
+def fun_l14_n949(x)
+    if (x < 1)
+        fun_l15_n482(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n950(x)
+    if (x < 1)
+        fun_l15_n376(x)
+    else
+        fun_l15_n743(x)
+    end
+end
+
+def fun_l14_n951(x)
+    if (x < 1)
+        fun_l15_n53(x)
+    else
+        fun_l15_n734(x)
+    end
+end
+
+def fun_l14_n952(x)
+    if (x < 1)
+        fun_l15_n437(x)
+    else
+        fun_l15_n829(x)
+    end
+end
+
+def fun_l14_n953(x)
+    if (x < 1)
+        fun_l15_n673(x)
+    else
+        fun_l15_n540(x)
+    end
+end
+
+def fun_l14_n954(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n488(x)
+    end
+end
+
+def fun_l14_n955(x)
+    if (x < 1)
+        fun_l15_n876(x)
+    else
+        fun_l15_n710(x)
+    end
+end
+
+def fun_l14_n956(x)
+    if (x < 1)
+        fun_l15_n823(x)
+    else
+        fun_l15_n841(x)
+    end
+end
+
+def fun_l14_n957(x)
+    if (x < 1)
+        fun_l15_n948(x)
+    else
+        fun_l15_n378(x)
+    end
+end
+
+def fun_l14_n958(x)
+    if (x < 1)
+        fun_l15_n941(x)
+    else
+        fun_l15_n555(x)
+    end
+end
+
+def fun_l14_n959(x)
+    if (x < 1)
+        fun_l15_n204(x)
+    else
+        fun_l15_n792(x)
+    end
+end
+
+def fun_l14_n960(x)
+    if (x < 1)
+        fun_l15_n897(x)
+    else
+        fun_l15_n287(x)
+    end
+end
+
+def fun_l14_n961(x)
+    if (x < 1)
+        fun_l15_n771(x)
+    else
+        fun_l15_n409(x)
+    end
+end
+
+def fun_l14_n962(x)
+    if (x < 1)
+        fun_l15_n597(x)
+    else
+        fun_l15_n190(x)
+    end
+end
+
+def fun_l14_n963(x)
+    if (x < 1)
+        fun_l15_n573(x)
+    else
+        fun_l15_n982(x)
+    end
+end
+
+def fun_l14_n964(x)
+    if (x < 1)
+        fun_l15_n186(x)
+    else
+        fun_l15_n363(x)
+    end
+end
+
+def fun_l14_n965(x)
+    if (x < 1)
+        fun_l15_n694(x)
+    else
+        fun_l15_n319(x)
+    end
+end
+
+def fun_l14_n966(x)
+    if (x < 1)
+        fun_l15_n312(x)
+    else
+        fun_l15_n332(x)
+    end
+end
+
+def fun_l14_n967(x)
+    if (x < 1)
+        fun_l15_n754(x)
+    else
+        fun_l15_n965(x)
+    end
+end
+
+def fun_l14_n968(x)
+    if (x < 1)
+        fun_l15_n18(x)
+    else
+        fun_l15_n723(x)
+    end
+end
+
+def fun_l14_n969(x)
+    if (x < 1)
+        fun_l15_n111(x)
+    else
+        fun_l15_n447(x)
+    end
+end
+
+def fun_l14_n970(x)
+    if (x < 1)
+        fun_l15_n3(x)
+    else
+        fun_l15_n302(x)
+    end
+end
+
+def fun_l14_n971(x)
+    if (x < 1)
+        fun_l15_n121(x)
+    else
+        fun_l15_n764(x)
+    end
+end
+
+def fun_l14_n972(x)
+    if (x < 1)
+        fun_l15_n192(x)
+    else
+        fun_l15_n692(x)
+    end
+end
+
+def fun_l14_n973(x)
+    if (x < 1)
+        fun_l15_n596(x)
+    else
+        fun_l15_n514(x)
+    end
+end
+
+def fun_l14_n974(x)
+    if (x < 1)
+        fun_l15_n845(x)
+    else
+        fun_l15_n245(x)
+    end
+end
+
+def fun_l14_n975(x)
+    if (x < 1)
+        fun_l15_n566(x)
+    else
+        fun_l15_n58(x)
+    end
+end
+
+def fun_l14_n976(x)
+    if (x < 1)
+        fun_l15_n843(x)
+    else
+        fun_l15_n35(x)
+    end
+end
+
+def fun_l14_n977(x)
+    if (x < 1)
+        fun_l15_n995(x)
+    else
+        fun_l15_n723(x)
+    end
+end
+
+def fun_l14_n978(x)
+    if (x < 1)
+        fun_l15_n534(x)
+    else
+        fun_l15_n704(x)
+    end
+end
+
+def fun_l14_n979(x)
+    if (x < 1)
+        fun_l15_n533(x)
+    else
+        fun_l15_n492(x)
+    end
+end
+
+def fun_l14_n980(x)
+    if (x < 1)
+        fun_l15_n758(x)
+    else
+        fun_l15_n655(x)
+    end
+end
+
+def fun_l14_n981(x)
+    if (x < 1)
+        fun_l15_n94(x)
+    else
+        fun_l15_n246(x)
+    end
+end
+
+def fun_l14_n982(x)
+    if (x < 1)
+        fun_l15_n873(x)
+    else
+        fun_l15_n996(x)
+    end
+end
+
+def fun_l14_n983(x)
+    if (x < 1)
+        fun_l15_n681(x)
+    else
+        fun_l15_n522(x)
+    end
+end
+
+def fun_l14_n984(x)
+    if (x < 1)
+        fun_l15_n272(x)
+    else
+        fun_l15_n501(x)
+    end
+end
+
+def fun_l14_n985(x)
+    if (x < 1)
+        fun_l15_n345(x)
+    else
+        fun_l15_n61(x)
+    end
+end
+
+def fun_l14_n986(x)
+    if (x < 1)
+        fun_l15_n517(x)
+    else
+        fun_l15_n151(x)
+    end
+end
+
+def fun_l14_n987(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n988(x)
+    if (x < 1)
+        fun_l15_n683(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n989(x)
+    if (x < 1)
+        fun_l15_n310(x)
+    else
+        fun_l15_n367(x)
+    end
+end
+
+def fun_l14_n990(x)
+    if (x < 1)
+        fun_l15_n249(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n991(x)
+    if (x < 1)
+        fun_l15_n389(x)
+    else
+        fun_l15_n176(x)
+    end
+end
+
+def fun_l14_n992(x)
+    if (x < 1)
+        fun_l15_n233(x)
+    else
+        fun_l15_n220(x)
+    end
+end
+
+def fun_l14_n993(x)
+    if (x < 1)
+        fun_l15_n161(x)
+    else
+        fun_l15_n642(x)
+    end
+end
+
+def fun_l14_n994(x)
+    if (x < 1)
+        fun_l15_n163(x)
+    else
+        fun_l15_n5(x)
+    end
+end
+
+def fun_l14_n995(x)
+    if (x < 1)
+        fun_l15_n678(x)
+    else
+        fun_l15_n108(x)
+    end
+end
+
+def fun_l14_n996(x)
+    if (x < 1)
+        fun_l15_n732(x)
+    else
+        fun_l15_n26(x)
+    end
+end
+
+def fun_l14_n997(x)
+    if (x < 1)
+        fun_l15_n805(x)
+    else
+        fun_l15_n726(x)
+    end
+end
+
+def fun_l14_n998(x)
+    if (x < 1)
+        fun_l15_n543(x)
+    else
+        fun_l15_n102(x)
+    end
+end
+
+def fun_l14_n999(x)
+    if (x < 1)
+        fun_l15_n358(x)
+    else
+        fun_l15_n986(x)
+    end
+end
+
+def fun_l15_n0(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n319(x)
+    end
+end
+
+def fun_l15_n1(x)
+    if (x < 1)
+        fun_l16_n920(x)
+    else
+        fun_l16_n27(x)
+    end
+end
+
+def fun_l15_n2(x)
+    if (x < 1)
+        fun_l16_n929(x)
+    else
+        fun_l16_n230(x)
+    end
+end
+
+def fun_l15_n3(x)
+    if (x < 1)
+        fun_l16_n135(x)
+    else
+        fun_l16_n427(x)
+    end
+end
+
+def fun_l15_n4(x)
+    if (x < 1)
+        fun_l16_n299(x)
+    else
+        fun_l16_n811(x)
+    end
+end
+
+def fun_l15_n5(x)
+    if (x < 1)
+        fun_l16_n821(x)
+    else
+        fun_l16_n717(x)
+    end
+end
+
+def fun_l15_n6(x)
+    if (x < 1)
+        fun_l16_n907(x)
+    else
+        fun_l16_n348(x)
+    end
+end
+
+def fun_l15_n7(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n180(x)
+    end
+end
+
+def fun_l15_n8(x)
+    if (x < 1)
+        fun_l16_n835(x)
+    else
+        fun_l16_n754(x)
+    end
+end
+
+def fun_l15_n9(x)
+    if (x < 1)
+        fun_l16_n25(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n10(x)
+    if (x < 1)
+        fun_l16_n73(x)
+    else
+        fun_l16_n784(x)
+    end
+end
+
+def fun_l15_n11(x)
+    if (x < 1)
+        fun_l16_n413(x)
+    else
+        fun_l16_n914(x)
+    end
+end
+
+def fun_l15_n12(x)
+    if (x < 1)
+        fun_l16_n734(x)
+    else
+        fun_l16_n688(x)
+    end
+end
+
+def fun_l15_n13(x)
+    if (x < 1)
+        fun_l16_n658(x)
+    else
+        fun_l16_n491(x)
+    end
+end
+
+def fun_l15_n14(x)
+    if (x < 1)
+        fun_l16_n839(x)
+    else
+        fun_l16_n740(x)
+    end
+end
+
+def fun_l15_n15(x)
+    if (x < 1)
+        fun_l16_n378(x)
+    else
+        fun_l16_n800(x)
+    end
+end
+
+def fun_l15_n16(x)
+    if (x < 1)
+        fun_l16_n980(x)
+    else
+        fun_l16_n83(x)
+    end
+end
+
+def fun_l15_n17(x)
+    if (x < 1)
+        fun_l16_n338(x)
+    else
+        fun_l16_n871(x)
+    end
+end
+
+def fun_l15_n18(x)
+    if (x < 1)
+        fun_l16_n497(x)
+    else
+        fun_l16_n347(x)
+    end
+end
+
+def fun_l15_n19(x)
+    if (x < 1)
+        fun_l16_n483(x)
+    else
+        fun_l16_n913(x)
+    end
+end
+
+def fun_l15_n20(x)
+    if (x < 1)
+        fun_l16_n663(x)
+    else
+        fun_l16_n432(x)
+    end
+end
+
+def fun_l15_n21(x)
+    if (x < 1)
+        fun_l16_n787(x)
+    else
+        fun_l16_n248(x)
+    end
+end
+
+def fun_l15_n22(x)
+    if (x < 1)
+        fun_l16_n257(x)
+    else
+        fun_l16_n944(x)
+    end
+end
+
+def fun_l15_n23(x)
+    if (x < 1)
+        fun_l16_n11(x)
+    else
+        fun_l16_n343(x)
+    end
+end
+
+def fun_l15_n24(x)
+    if (x < 1)
+        fun_l16_n860(x)
+    else
+        fun_l16_n752(x)
+    end
+end
+
+def fun_l15_n25(x)
+    if (x < 1)
+        fun_l16_n766(x)
+    else
+        fun_l16_n719(x)
+    end
+end
+
+def fun_l15_n26(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n963(x)
+    end
+end
+
+def fun_l15_n27(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n916(x)
+    end
+end
+
+def fun_l15_n28(x)
+    if (x < 1)
+        fun_l16_n429(x)
+    else
+        fun_l16_n272(x)
+    end
+end
+
+def fun_l15_n29(x)
+    if (x < 1)
+        fun_l16_n54(x)
+    else
+        fun_l16_n794(x)
+    end
+end
+
+def fun_l15_n30(x)
+    if (x < 1)
+        fun_l16_n273(x)
+    else
+        fun_l16_n929(x)
+    end
+end
+
+def fun_l15_n31(x)
+    if (x < 1)
+        fun_l16_n868(x)
+    else
+        fun_l16_n967(x)
+    end
+end
+
+def fun_l15_n32(x)
+    if (x < 1)
+        fun_l16_n888(x)
+    else
+        fun_l16_n283(x)
+    end
+end
+
+def fun_l15_n33(x)
+    if (x < 1)
+        fun_l16_n6(x)
+    else
+        fun_l16_n677(x)
+    end
+end
+
+def fun_l15_n34(x)
+    if (x < 1)
+        fun_l16_n248(x)
+    else
+        fun_l16_n831(x)
+    end
+end
+
+def fun_l15_n35(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n634(x)
+    end
+end
+
+def fun_l15_n36(x)
+    if (x < 1)
+        fun_l16_n221(x)
+    else
+        fun_l16_n401(x)
+    end
+end
+
+def fun_l15_n37(x)
+    if (x < 1)
+        fun_l16_n403(x)
+    else
+        fun_l16_n29(x)
+    end
+end
+
+def fun_l15_n38(x)
+    if (x < 1)
+        fun_l16_n11(x)
+    else
+        fun_l16_n517(x)
+    end
+end
+
+def fun_l15_n39(x)
+    if (x < 1)
+        fun_l16_n234(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n40(x)
+    if (x < 1)
+        fun_l16_n185(x)
+    else
+        fun_l16_n818(x)
+    end
+end
+
+def fun_l15_n41(x)
+    if (x < 1)
+        fun_l16_n169(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n42(x)
+    if (x < 1)
+        fun_l16_n111(x)
+    else
+        fun_l16_n836(x)
+    end
+end
+
+def fun_l15_n43(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n714(x)
+    end
+end
+
+def fun_l15_n44(x)
+    if (x < 1)
+        fun_l16_n167(x)
+    else
+        fun_l16_n65(x)
+    end
+end
+
+def fun_l15_n45(x)
+    if (x < 1)
+        fun_l16_n801(x)
+    else
+        fun_l16_n456(x)
+    end
+end
+
+def fun_l15_n46(x)
+    if (x < 1)
+        fun_l16_n894(x)
+    else
+        fun_l16_n103(x)
+    end
+end
+
+def fun_l15_n47(x)
+    if (x < 1)
+        fun_l16_n156(x)
+    else
+        fun_l16_n228(x)
+    end
+end
+
+def fun_l15_n48(x)
+    if (x < 1)
+        fun_l16_n167(x)
+    else
+        fun_l16_n317(x)
+    end
+end
+
+def fun_l15_n49(x)
+    if (x < 1)
+        fun_l16_n864(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n50(x)
+    if (x < 1)
+        fun_l16_n11(x)
+    else
+        fun_l16_n498(x)
+    end
+end
+
+def fun_l15_n51(x)
+    if (x < 1)
+        fun_l16_n209(x)
+    else
+        fun_l16_n399(x)
+    end
+end
+
+def fun_l15_n52(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n912(x)
+    end
+end
+
+def fun_l15_n53(x)
+    if (x < 1)
+        fun_l16_n135(x)
+    else
+        fun_l16_n349(x)
+    end
+end
+
+def fun_l15_n54(x)
+    if (x < 1)
+        fun_l16_n410(x)
+    else
+        fun_l16_n849(x)
+    end
+end
+
+def fun_l15_n55(x)
+    if (x < 1)
+        fun_l16_n989(x)
+    else
+        fun_l16_n700(x)
+    end
+end
+
+def fun_l15_n56(x)
+    if (x < 1)
+        fun_l16_n79(x)
+    else
+        fun_l16_n549(x)
+    end
+end
+
+def fun_l15_n57(x)
+    if (x < 1)
+        fun_l16_n396(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n58(x)
+    if (x < 1)
+        fun_l16_n765(x)
+    else
+        fun_l16_n225(x)
+    end
+end
+
+def fun_l15_n59(x)
+    if (x < 1)
+        fun_l16_n124(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n60(x)
+    if (x < 1)
+        fun_l16_n813(x)
+    else
+        fun_l16_n319(x)
+    end
+end
+
+def fun_l15_n61(x)
+    if (x < 1)
+        fun_l16_n568(x)
+    else
+        fun_l16_n581(x)
+    end
+end
+
+def fun_l15_n62(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n12(x)
+    end
+end
+
+def fun_l15_n63(x)
+    if (x < 1)
+        fun_l16_n176(x)
+    else
+        fun_l16_n136(x)
+    end
+end
+
+def fun_l15_n64(x)
+    if (x < 1)
+        fun_l16_n620(x)
+    else
+        fun_l16_n937(x)
+    end
+end
+
+def fun_l15_n65(x)
+    if (x < 1)
+        fun_l16_n130(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n66(x)
+    if (x < 1)
+        fun_l16_n774(x)
+    else
+        fun_l16_n109(x)
+    end
+end
+
+def fun_l15_n67(x)
+    if (x < 1)
+        fun_l16_n817(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n68(x)
+    if (x < 1)
+        fun_l16_n123(x)
+    else
+        fun_l16_n482(x)
+    end
+end
+
+def fun_l15_n69(x)
+    if (x < 1)
+        fun_l16_n173(x)
+    else
+        fun_l16_n22(x)
+    end
+end
+
+def fun_l15_n70(x)
+    if (x < 1)
+        fun_l16_n648(x)
+    else
+        fun_l16_n671(x)
+    end
+end
+
+def fun_l15_n71(x)
+    if (x < 1)
+        fun_l16_n831(x)
+    else
+        fun_l16_n126(x)
+    end
+end
+
+def fun_l15_n72(x)
+    if (x < 1)
+        fun_l16_n731(x)
+    else
+        fun_l16_n273(x)
+    end
+end
+
+def fun_l15_n73(x)
+    if (x < 1)
+        fun_l16_n695(x)
+    else
+        fun_l16_n772(x)
+    end
+end
+
+def fun_l15_n74(x)
+    if (x < 1)
+        fun_l16_n831(x)
+    else
+        fun_l16_n49(x)
+    end
+end
+
+def fun_l15_n75(x)
+    if (x < 1)
+        fun_l16_n501(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n76(x)
+    if (x < 1)
+        fun_l16_n712(x)
+    else
+        fun_l16_n762(x)
+    end
+end
+
+def fun_l15_n77(x)
+    if (x < 1)
+        fun_l16_n585(x)
+    else
+        fun_l16_n398(x)
+    end
+end
+
+def fun_l15_n78(x)
+    if (x < 1)
+        fun_l16_n811(x)
+    else
+        fun_l16_n866(x)
+    end
+end
+
+def fun_l15_n79(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n502(x)
+    end
+end
+
+def fun_l15_n80(x)
+    if (x < 1)
+        fun_l16_n885(x)
+    else
+        fun_l16_n116(x)
+    end
+end
+
+def fun_l15_n81(x)
+    if (x < 1)
+        fun_l16_n30(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n82(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n526(x)
+    end
+end
+
+def fun_l15_n83(x)
+    if (x < 1)
+        fun_l16_n760(x)
+    else
+        fun_l16_n206(x)
+    end
+end
+
+def fun_l15_n84(x)
+    if (x < 1)
+        fun_l16_n722(x)
+    else
+        fun_l16_n211(x)
+    end
+end
+
+def fun_l15_n85(x)
+    if (x < 1)
+        fun_l16_n145(x)
+    else
+        fun_l16_n222(x)
+    end
+end
+
+def fun_l15_n86(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n885(x)
+    end
+end
+
+def fun_l15_n87(x)
+    if (x < 1)
+        fun_l16_n2(x)
+    else
+        fun_l16_n180(x)
+    end
+end
+
+def fun_l15_n88(x)
+    if (x < 1)
+        fun_l16_n272(x)
+    else
+        fun_l16_n433(x)
+    end
+end
+
+def fun_l15_n89(x)
+    if (x < 1)
+        fun_l16_n31(x)
+    else
+        fun_l16_n854(x)
+    end
+end
+
+def fun_l15_n90(x)
+    if (x < 1)
+        fun_l16_n264(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n91(x)
+    if (x < 1)
+        fun_l16_n637(x)
+    else
+        fun_l16_n96(x)
+    end
+end
+
+def fun_l15_n92(x)
+    if (x < 1)
+        fun_l16_n317(x)
+    else
+        fun_l16_n56(x)
+    end
+end
+
+def fun_l15_n93(x)
+    if (x < 1)
+        fun_l16_n523(x)
+    else
+        fun_l16_n948(x)
+    end
+end
+
+def fun_l15_n94(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n948(x)
+    end
+end
+
+def fun_l15_n95(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n581(x)
+    end
+end
+
+def fun_l15_n96(x)
+    if (x < 1)
+        fun_l16_n725(x)
+    else
+        fun_l16_n931(x)
+    end
+end
+
+def fun_l15_n97(x)
+    if (x < 1)
+        fun_l16_n432(x)
+    else
+        fun_l16_n367(x)
+    end
+end
+
+def fun_l15_n98(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n165(x)
+    end
+end
+
+def fun_l15_n99(x)
+    if (x < 1)
+        fun_l16_n617(x)
+    else
+        fun_l16_n498(x)
+    end
+end
+
+def fun_l15_n100(x)
+    if (x < 1)
+        fun_l16_n32(x)
+    else
+        fun_l16_n103(x)
+    end
+end
+
+def fun_l15_n101(x)
+    if (x < 1)
+        fun_l16_n619(x)
+    else
+        fun_l16_n556(x)
+    end
+end
+
+def fun_l15_n102(x)
+    if (x < 1)
+        fun_l16_n0(x)
+    else
+        fun_l16_n925(x)
+    end
+end
+
+def fun_l15_n103(x)
+    if (x < 1)
+        fun_l16_n484(x)
+    else
+        fun_l16_n889(x)
+    end
+end
+
+def fun_l15_n104(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n465(x)
+    end
+end
+
+def fun_l15_n105(x)
+    if (x < 1)
+        fun_l16_n486(x)
+    else
+        fun_l16_n720(x)
+    end
+end
+
+def fun_l15_n106(x)
+    if (x < 1)
+        fun_l16_n281(x)
+    else
+        fun_l16_n61(x)
+    end
+end
+
+def fun_l15_n107(x)
+    if (x < 1)
+        fun_l16_n861(x)
+    else
+        fun_l16_n944(x)
+    end
+end
+
+def fun_l15_n108(x)
+    if (x < 1)
+        fun_l16_n739(x)
+    else
+        fun_l16_n192(x)
+    end
+end
+
+def fun_l15_n109(x)
+    if (x < 1)
+        fun_l16_n327(x)
+    else
+        fun_l16_n423(x)
+    end
+end
+
+def fun_l15_n110(x)
+    if (x < 1)
+        fun_l16_n541(x)
+    else
+        fun_l16_n927(x)
+    end
+end
+
+def fun_l15_n111(x)
+    if (x < 1)
+        fun_l16_n86(x)
+    else
+        fun_l16_n170(x)
+    end
+end
+
+def fun_l15_n112(x)
+    if (x < 1)
+        fun_l16_n508(x)
+    else
+        fun_l16_n554(x)
+    end
+end
+
+def fun_l15_n113(x)
+    if (x < 1)
+        fun_l16_n326(x)
+    else
+        fun_l16_n289(x)
+    end
+end
+
+def fun_l15_n114(x)
+    if (x < 1)
+        fun_l16_n309(x)
+    else
+        fun_l16_n125(x)
+    end
+end
+
+def fun_l15_n115(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n64(x)
+    end
+end
+
+def fun_l15_n116(x)
+    if (x < 1)
+        fun_l16_n942(x)
+    else
+        fun_l16_n737(x)
+    end
+end
+
+def fun_l15_n117(x)
+    if (x < 1)
+        fun_l16_n717(x)
+    else
+        fun_l16_n701(x)
+    end
+end
+
+def fun_l15_n118(x)
+    if (x < 1)
+        fun_l16_n789(x)
+    else
+        fun_l16_n901(x)
+    end
+end
+
+def fun_l15_n119(x)
+    if (x < 1)
+        fun_l16_n49(x)
+    else
+        fun_l16_n610(x)
+    end
+end
+
+def fun_l15_n120(x)
+    if (x < 1)
+        fun_l16_n578(x)
+    else
+        fun_l16_n372(x)
+    end
+end
+
+def fun_l15_n121(x)
+    if (x < 1)
+        fun_l16_n262(x)
+    else
+        fun_l16_n441(x)
+    end
+end
+
+def fun_l15_n122(x)
+    if (x < 1)
+        fun_l16_n29(x)
+    else
+        fun_l16_n837(x)
+    end
+end
+
+def fun_l15_n123(x)
+    if (x < 1)
+        fun_l16_n796(x)
+    else
+        fun_l16_n771(x)
+    end
+end
+
+def fun_l15_n124(x)
+    if (x < 1)
+        fun_l16_n354(x)
+    else
+        fun_l16_n818(x)
+    end
+end
+
+def fun_l15_n125(x)
+    if (x < 1)
+        fun_l16_n971(x)
+    else
+        fun_l16_n305(x)
+    end
+end
+
+def fun_l15_n126(x)
+    if (x < 1)
+        fun_l16_n435(x)
+    else
+        fun_l16_n307(x)
+    end
+end
+
+def fun_l15_n127(x)
+    if (x < 1)
+        fun_l16_n809(x)
+    else
+        fun_l16_n884(x)
+    end
+end
+
+def fun_l15_n128(x)
+    if (x < 1)
+        fun_l16_n794(x)
+    else
+        fun_l16_n480(x)
+    end
+end
+
+def fun_l15_n129(x)
+    if (x < 1)
+        fun_l16_n797(x)
+    else
+        fun_l16_n193(x)
+    end
+end
+
+def fun_l15_n130(x)
+    if (x < 1)
+        fun_l16_n415(x)
+    else
+        fun_l16_n255(x)
+    end
+end
+
+def fun_l15_n131(x)
+    if (x < 1)
+        fun_l16_n736(x)
+    else
+        fun_l16_n904(x)
+    end
+end
+
+def fun_l15_n132(x)
+    if (x < 1)
+        fun_l16_n753(x)
+    else
+        fun_l16_n408(x)
+    end
+end
+
+def fun_l15_n133(x)
+    if (x < 1)
+        fun_l16_n61(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n134(x)
+    if (x < 1)
+        fun_l16_n541(x)
+    else
+        fun_l16_n93(x)
+    end
+end
+
+def fun_l15_n135(x)
+    if (x < 1)
+        fun_l16_n617(x)
+    else
+        fun_l16_n765(x)
+    end
+end
+
+def fun_l15_n136(x)
+    if (x < 1)
+        fun_l16_n749(x)
+    else
+        fun_l16_n344(x)
+    end
+end
+
+def fun_l15_n137(x)
+    if (x < 1)
+        fun_l16_n431(x)
+    else
+        fun_l16_n354(x)
+    end
+end
+
+def fun_l15_n138(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n963(x)
+    end
+end
+
+def fun_l15_n139(x)
+    if (x < 1)
+        fun_l16_n500(x)
+    else
+        fun_l16_n380(x)
+    end
+end
+
+def fun_l15_n140(x)
+    if (x < 1)
+        fun_l16_n120(x)
+    else
+        fun_l16_n953(x)
+    end
+end
+
+def fun_l15_n141(x)
+    if (x < 1)
+        fun_l16_n287(x)
+    else
+        fun_l16_n154(x)
+    end
+end
+
+def fun_l15_n142(x)
+    if (x < 1)
+        fun_l16_n347(x)
+    else
+        fun_l16_n841(x)
+    end
+end
+
+def fun_l15_n143(x)
+    if (x < 1)
+        fun_l16_n562(x)
+    else
+        fun_l16_n674(x)
+    end
+end
+
+def fun_l15_n144(x)
+    if (x < 1)
+        fun_l16_n146(x)
+    else
+        fun_l16_n788(x)
+    end
+end
+
+def fun_l15_n145(x)
+    if (x < 1)
+        fun_l16_n463(x)
+    else
+        fun_l16_n590(x)
+    end
+end
+
+def fun_l15_n146(x)
+    if (x < 1)
+        fun_l16_n452(x)
+    else
+        fun_l16_n732(x)
+    end
+end
+
+def fun_l15_n147(x)
+    if (x < 1)
+        fun_l16_n840(x)
+    else
+        fun_l16_n254(x)
+    end
+end
+
+def fun_l15_n148(x)
+    if (x < 1)
+        fun_l16_n224(x)
+    else
+        fun_l16_n826(x)
+    end
+end
+
+def fun_l15_n149(x)
+    if (x < 1)
+        fun_l16_n40(x)
+    else
+        fun_l16_n267(x)
+    end
+end
+
+def fun_l15_n150(x)
+    if (x < 1)
+        fun_l16_n160(x)
+    else
+        fun_l16_n745(x)
+    end
+end
+
+def fun_l15_n151(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n567(x)
+    end
+end
+
+def fun_l15_n152(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n487(x)
+    end
+end
+
+def fun_l15_n153(x)
+    if (x < 1)
+        fun_l16_n603(x)
+    else
+        fun_l16_n549(x)
+    end
+end
+
+def fun_l15_n154(x)
+    if (x < 1)
+        fun_l16_n993(x)
+    else
+        fun_l16_n451(x)
+    end
+end
+
+def fun_l15_n155(x)
+    if (x < 1)
+        fun_l16_n358(x)
+    else
+        fun_l16_n52(x)
+    end
+end
+
+def fun_l15_n156(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n419(x)
+    end
+end
+
+def fun_l15_n157(x)
+    if (x < 1)
+        fun_l16_n138(x)
+    else
+        fun_l16_n127(x)
+    end
+end
+
+def fun_l15_n158(x)
+    if (x < 1)
+        fun_l16_n619(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n159(x)
+    if (x < 1)
+        fun_l16_n281(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n160(x)
+    if (x < 1)
+        fun_l16_n631(x)
+    else
+        fun_l16_n69(x)
+    end
+end
+
+def fun_l15_n161(x)
+    if (x < 1)
+        fun_l16_n41(x)
+    else
+        fun_l16_n734(x)
+    end
+end
+
+def fun_l15_n162(x)
+    if (x < 1)
+        fun_l16_n809(x)
+    else
+        fun_l16_n303(x)
+    end
+end
+
+def fun_l15_n163(x)
+    if (x < 1)
+        fun_l16_n851(x)
+    else
+        fun_l16_n420(x)
+    end
+end
+
+def fun_l15_n164(x)
+    if (x < 1)
+        fun_l16_n534(x)
+    else
+        fun_l16_n686(x)
+    end
+end
+
+def fun_l15_n165(x)
+    if (x < 1)
+        fun_l16_n639(x)
+    else
+        fun_l16_n155(x)
+    end
+end
+
+def fun_l15_n166(x)
+    if (x < 1)
+        fun_l16_n196(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n167(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n506(x)
+    end
+end
+
+def fun_l15_n168(x)
+    if (x < 1)
+        fun_l16_n74(x)
+    else
+        fun_l16_n442(x)
+    end
+end
+
+def fun_l15_n169(x)
+    if (x < 1)
+        fun_l16_n122(x)
+    else
+        fun_l16_n150(x)
+    end
+end
+
+def fun_l15_n170(x)
+    if (x < 1)
+        fun_l16_n805(x)
+    else
+        fun_l16_n46(x)
+    end
+end
+
+def fun_l15_n171(x)
+    if (x < 1)
+        fun_l16_n741(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n172(x)
+    if (x < 1)
+        fun_l16_n749(x)
+    else
+        fun_l16_n896(x)
+    end
+end
+
+def fun_l15_n173(x)
+    if (x < 1)
+        fun_l16_n310(x)
+    else
+        fun_l16_n517(x)
+    end
+end
+
+def fun_l15_n174(x)
+    if (x < 1)
+        fun_l16_n237(x)
+    else
+        fun_l16_n948(x)
+    end
+end
+
+def fun_l15_n175(x)
+    if (x < 1)
+        fun_l16_n402(x)
+    else
+        fun_l16_n332(x)
+    end
+end
+
+def fun_l15_n176(x)
+    if (x < 1)
+        fun_l16_n189(x)
+    else
+        fun_l16_n223(x)
+    end
+end
+
+def fun_l15_n177(x)
+    if (x < 1)
+        fun_l16_n1(x)
+    else
+        fun_l16_n577(x)
+    end
+end
+
+def fun_l15_n178(x)
+    if (x < 1)
+        fun_l16_n738(x)
+    else
+        fun_l16_n775(x)
+    end
+end
+
+def fun_l15_n179(x)
+    if (x < 1)
+        fun_l16_n80(x)
+    else
+        fun_l16_n652(x)
+    end
+end
+
+def fun_l15_n180(x)
+    if (x < 1)
+        fun_l16_n72(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n181(x)
+    if (x < 1)
+        fun_l16_n721(x)
+    else
+        fun_l16_n661(x)
+    end
+end
+
+def fun_l15_n182(x)
+    if (x < 1)
+        fun_l16_n354(x)
+    else
+        fun_l16_n681(x)
+    end
+end
+
+def fun_l15_n183(x)
+    if (x < 1)
+        fun_l16_n689(x)
+    else
+        fun_l16_n775(x)
+    end
+end
+
+def fun_l15_n184(x)
+    if (x < 1)
+        fun_l16_n923(x)
+    else
+        fun_l16_n719(x)
+    end
+end
+
+def fun_l15_n185(x)
+    if (x < 1)
+        fun_l16_n33(x)
+    else
+        fun_l16_n98(x)
+    end
+end
+
+def fun_l15_n186(x)
+    if (x < 1)
+        fun_l16_n155(x)
+    else
+        fun_l16_n880(x)
+    end
+end
+
+def fun_l15_n187(x)
+    if (x < 1)
+        fun_l16_n625(x)
+    else
+        fun_l16_n314(x)
+    end
+end
+
+def fun_l15_n188(x)
+    if (x < 1)
+        fun_l16_n284(x)
+    else
+        fun_l16_n229(x)
+    end
+end
+
+def fun_l15_n189(x)
+    if (x < 1)
+        fun_l16_n471(x)
+    else
+        fun_l16_n740(x)
+    end
+end
+
+def fun_l15_n190(x)
+    if (x < 1)
+        fun_l16_n102(x)
+    else
+        fun_l16_n766(x)
+    end
+end
+
+def fun_l15_n191(x)
+    if (x < 1)
+        fun_l16_n812(x)
+    else
+        fun_l16_n94(x)
+    end
+end
+
+def fun_l15_n192(x)
+    if (x < 1)
+        fun_l16_n797(x)
+    else
+        fun_l16_n736(x)
+    end
+end
+
+def fun_l15_n193(x)
+    if (x < 1)
+        fun_l16_n976(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n194(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n612(x)
+    end
+end
+
+def fun_l15_n195(x)
+    if (x < 1)
+        fun_l16_n510(x)
+    else
+        fun_l16_n237(x)
+    end
+end
+
+def fun_l15_n196(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n624(x)
+    end
+end
+
+def fun_l15_n197(x)
+    if (x < 1)
+        fun_l16_n515(x)
+    else
+        fun_l16_n979(x)
+    end
+end
+
+def fun_l15_n198(x)
+    if (x < 1)
+        fun_l16_n700(x)
+    else
+        fun_l16_n284(x)
+    end
+end
+
+def fun_l15_n199(x)
+    if (x < 1)
+        fun_l16_n226(x)
+    else
+        fun_l16_n32(x)
+    end
+end
+
+def fun_l15_n200(x)
+    if (x < 1)
+        fun_l16_n453(x)
+    else
+        fun_l16_n959(x)
+    end
+end
+
+def fun_l15_n201(x)
+    if (x < 1)
+        fun_l16_n132(x)
+    else
+        fun_l16_n323(x)
+    end
+end
+
+def fun_l15_n202(x)
+    if (x < 1)
+        fun_l16_n539(x)
+    else
+        fun_l16_n670(x)
+    end
+end
+
+def fun_l15_n203(x)
+    if (x < 1)
+        fun_l16_n786(x)
+    else
+        fun_l16_n633(x)
+    end
+end
+
+def fun_l15_n204(x)
+    if (x < 1)
+        fun_l16_n498(x)
+    else
+        fun_l16_n520(x)
+    end
+end
+
+def fun_l15_n205(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n573(x)
+    end
+end
+
+def fun_l15_n206(x)
+    if (x < 1)
+        fun_l16_n746(x)
+    else
+        fun_l16_n562(x)
+    end
+end
+
+def fun_l15_n207(x)
+    if (x < 1)
+        fun_l16_n500(x)
+    else
+        fun_l16_n951(x)
+    end
+end
+
+def fun_l15_n208(x)
+    if (x < 1)
+        fun_l16_n331(x)
+    else
+        fun_l16_n596(x)
+    end
+end
+
+def fun_l15_n209(x)
+    if (x < 1)
+        fun_l16_n1(x)
+    else
+        fun_l16_n69(x)
+    end
+end
+
+def fun_l15_n210(x)
+    if (x < 1)
+        fun_l16_n19(x)
+    else
+        fun_l16_n148(x)
+    end
+end
+
+def fun_l15_n211(x)
+    if (x < 1)
+        fun_l16_n770(x)
+    else
+        fun_l16_n216(x)
+    end
+end
+
+def fun_l15_n212(x)
+    if (x < 1)
+        fun_l16_n863(x)
+    else
+        fun_l16_n319(x)
+    end
+end
+
+def fun_l15_n213(x)
+    if (x < 1)
+        fun_l16_n675(x)
+    else
+        fun_l16_n797(x)
+    end
+end
+
+def fun_l15_n214(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n593(x)
+    end
+end
+
+def fun_l15_n215(x)
+    if (x < 1)
+        fun_l16_n120(x)
+    else
+        fun_l16_n232(x)
+    end
+end
+
+def fun_l15_n216(x)
+    if (x < 1)
+        fun_l16_n549(x)
+    else
+        fun_l16_n175(x)
+    end
+end
+
+def fun_l15_n217(x)
+    if (x < 1)
+        fun_l16_n784(x)
+    else
+        fun_l16_n8(x)
+    end
+end
+
+def fun_l15_n218(x)
+    if (x < 1)
+        fun_l16_n296(x)
+    else
+        fun_l16_n454(x)
+    end
+end
+
+def fun_l15_n219(x)
+    if (x < 1)
+        fun_l16_n585(x)
+    else
+        fun_l16_n628(x)
+    end
+end
+
+def fun_l15_n220(x)
+    if (x < 1)
+        fun_l16_n375(x)
+    else
+        fun_l16_n294(x)
+    end
+end
+
+def fun_l15_n221(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n771(x)
+    end
+end
+
+def fun_l15_n222(x)
+    if (x < 1)
+        fun_l16_n885(x)
+    else
+        fun_l16_n476(x)
+    end
+end
+
+def fun_l15_n223(x)
+    if (x < 1)
+        fun_l16_n929(x)
+    else
+        fun_l16_n850(x)
+    end
+end
+
+def fun_l15_n224(x)
+    if (x < 1)
+        fun_l16_n489(x)
+    else
+        fun_l16_n234(x)
+    end
+end
+
+def fun_l15_n225(x)
+    if (x < 1)
+        fun_l16_n478(x)
+    else
+        fun_l16_n744(x)
+    end
+end
+
+def fun_l15_n226(x)
+    if (x < 1)
+        fun_l16_n714(x)
+    else
+        fun_l16_n323(x)
+    end
+end
+
+def fun_l15_n227(x)
+    if (x < 1)
+        fun_l16_n146(x)
+    else
+        fun_l16_n937(x)
+    end
+end
+
+def fun_l15_n228(x)
+    if (x < 1)
+        fun_l16_n611(x)
+    else
+        fun_l16_n320(x)
+    end
+end
+
+def fun_l15_n229(x)
+    if (x < 1)
+        fun_l16_n184(x)
+    else
+        fun_l16_n129(x)
+    end
+end
+
+def fun_l15_n230(x)
+    if (x < 1)
+        fun_l16_n563(x)
+    else
+        fun_l16_n581(x)
+    end
+end
+
+def fun_l15_n231(x)
+    if (x < 1)
+        fun_l16_n585(x)
+    else
+        fun_l16_n63(x)
+    end
+end
+
+def fun_l15_n232(x)
+    if (x < 1)
+        fun_l16_n895(x)
+    else
+        fun_l16_n622(x)
+    end
+end
+
+def fun_l15_n233(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n95(x)
+    end
+end
+
+def fun_l15_n234(x)
+    if (x < 1)
+        fun_l16_n770(x)
+    else
+        fun_l16_n557(x)
+    end
+end
+
+def fun_l15_n235(x)
+    if (x < 1)
+        fun_l16_n418(x)
+    else
+        fun_l16_n382(x)
+    end
+end
+
+def fun_l15_n236(x)
+    if (x < 1)
+        fun_l16_n842(x)
+    else
+        fun_l16_n543(x)
+    end
+end
+
+def fun_l15_n237(x)
+    if (x < 1)
+        fun_l16_n677(x)
+    else
+        fun_l16_n108(x)
+    end
+end
+
+def fun_l15_n238(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n288(x)
+    end
+end
+
+def fun_l15_n239(x)
+    if (x < 1)
+        fun_l16_n467(x)
+    else
+        fun_l16_n661(x)
+    end
+end
+
+def fun_l15_n240(x)
+    if (x < 1)
+        fun_l16_n267(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n241(x)
+    if (x < 1)
+        fun_l16_n655(x)
+    else
+        fun_l16_n990(x)
+    end
+end
+
+def fun_l15_n242(x)
+    if (x < 1)
+        fun_l16_n673(x)
+    else
+        fun_l16_n390(x)
+    end
+end
+
+def fun_l15_n243(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n901(x)
+    end
+end
+
+def fun_l15_n244(x)
+    if (x < 1)
+        fun_l16_n490(x)
+    else
+        fun_l16_n627(x)
+    end
+end
+
+def fun_l15_n245(x)
+    if (x < 1)
+        fun_l16_n293(x)
+    else
+        fun_l16_n569(x)
+    end
+end
+
+def fun_l15_n246(x)
+    if (x < 1)
+        fun_l16_n818(x)
+    else
+        fun_l16_n74(x)
+    end
+end
+
+def fun_l15_n247(x)
+    if (x < 1)
+        fun_l16_n141(x)
+    else
+        fun_l16_n743(x)
+    end
+end
+
+def fun_l15_n248(x)
+    if (x < 1)
+        fun_l16_n819(x)
+    else
+        fun_l16_n141(x)
+    end
+end
+
+def fun_l15_n249(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n53(x)
+    end
+end
+
+def fun_l15_n250(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n463(x)
+    end
+end
+
+def fun_l15_n251(x)
+    if (x < 1)
+        fun_l16_n828(x)
+    else
+        fun_l16_n739(x)
+    end
+end
+
+def fun_l15_n252(x)
+    if (x < 1)
+        fun_l16_n18(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n253(x)
+    if (x < 1)
+        fun_l16_n668(x)
+    else
+        fun_l16_n501(x)
+    end
+end
+
+def fun_l15_n254(x)
+    if (x < 1)
+        fun_l16_n649(x)
+    else
+        fun_l16_n397(x)
+    end
+end
+
+def fun_l15_n255(x)
+    if (x < 1)
+        fun_l16_n376(x)
+    else
+        fun_l16_n375(x)
+    end
+end
+
+def fun_l15_n256(x)
+    if (x < 1)
+        fun_l16_n451(x)
+    else
+        fun_l16_n537(x)
+    end
+end
+
+def fun_l15_n257(x)
+    if (x < 1)
+        fun_l16_n360(x)
+    else
+        fun_l16_n330(x)
+    end
+end
+
+def fun_l15_n258(x)
+    if (x < 1)
+        fun_l16_n581(x)
+    else
+        fun_l16_n193(x)
+    end
+end
+
+def fun_l15_n259(x)
+    if (x < 1)
+        fun_l16_n738(x)
+    else
+        fun_l16_n662(x)
+    end
+end
+
+def fun_l15_n260(x)
+    if (x < 1)
+        fun_l16_n450(x)
+    else
+        fun_l16_n942(x)
+    end
+end
+
+def fun_l15_n261(x)
+    if (x < 1)
+        fun_l16_n23(x)
+    else
+        fun_l16_n534(x)
+    end
+end
+
+def fun_l15_n262(x)
+    if (x < 1)
+        fun_l16_n364(x)
+    else
+        fun_l16_n716(x)
+    end
+end
+
+def fun_l15_n263(x)
+    if (x < 1)
+        fun_l16_n528(x)
+    else
+        fun_l16_n185(x)
+    end
+end
+
+def fun_l15_n264(x)
+    if (x < 1)
+        fun_l16_n491(x)
+    else
+        fun_l16_n686(x)
+    end
+end
+
+def fun_l15_n265(x)
+    if (x < 1)
+        fun_l16_n242(x)
+    else
+        fun_l16_n986(x)
+    end
+end
+
+def fun_l15_n266(x)
+    if (x < 1)
+        fun_l16_n726(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n267(x)
+    if (x < 1)
+        fun_l16_n611(x)
+    else
+        fun_l16_n11(x)
+    end
+end
+
+def fun_l15_n268(x)
+    if (x < 1)
+        fun_l16_n993(x)
+    else
+        fun_l16_n269(x)
+    end
+end
+
+def fun_l15_n269(x)
+    if (x < 1)
+        fun_l16_n296(x)
+    else
+        fun_l16_n8(x)
+    end
+end
+
+def fun_l15_n270(x)
+    if (x < 1)
+        fun_l16_n700(x)
+    else
+        fun_l16_n692(x)
+    end
+end
+
+def fun_l15_n271(x)
+    if (x < 1)
+        fun_l16_n902(x)
+    else
+        fun_l16_n548(x)
+    end
+end
+
+def fun_l15_n272(x)
+    if (x < 1)
+        fun_l16_n39(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n273(x)
+    if (x < 1)
+        fun_l16_n520(x)
+    else
+        fun_l16_n49(x)
+    end
+end
+
+def fun_l15_n274(x)
+    if (x < 1)
+        fun_l16_n24(x)
+    else
+        fun_l16_n466(x)
+    end
+end
+
+def fun_l15_n275(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n555(x)
+    end
+end
+
+def fun_l15_n276(x)
+    if (x < 1)
+        fun_l16_n719(x)
+    else
+        fun_l16_n693(x)
+    end
+end
+
+def fun_l15_n277(x)
+    if (x < 1)
+        fun_l16_n687(x)
+    else
+        fun_l16_n987(x)
+    end
+end
+
+def fun_l15_n278(x)
+    if (x < 1)
+        fun_l16_n426(x)
+    else
+        fun_l16_n179(x)
+    end
+end
+
+def fun_l15_n279(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n36(x)
+    end
+end
+
+def fun_l15_n280(x)
+    if (x < 1)
+        fun_l16_n460(x)
+    else
+        fun_l16_n450(x)
+    end
+end
+
+def fun_l15_n281(x)
+    if (x < 1)
+        fun_l16_n42(x)
+    else
+        fun_l16_n230(x)
+    end
+end
+
+def fun_l15_n282(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n422(x)
+    end
+end
+
+def fun_l15_n283(x)
+    if (x < 1)
+        fun_l16_n305(x)
+    else
+        fun_l16_n554(x)
+    end
+end
+
+def fun_l15_n284(x)
+    if (x < 1)
+        fun_l16_n680(x)
+    else
+        fun_l16_n147(x)
+    end
+end
+
+def fun_l15_n285(x)
+    if (x < 1)
+        fun_l16_n632(x)
+    else
+        fun_l16_n767(x)
+    end
+end
+
+def fun_l15_n286(x)
+    if (x < 1)
+        fun_l16_n735(x)
+    else
+        fun_l16_n465(x)
+    end
+end
+
+def fun_l15_n287(x)
+    if (x < 1)
+        fun_l16_n17(x)
+    else
+        fun_l16_n638(x)
+    end
+end
+
+def fun_l15_n288(x)
+    if (x < 1)
+        fun_l16_n517(x)
+    else
+        fun_l16_n47(x)
+    end
+end
+
+def fun_l15_n289(x)
+    if (x < 1)
+        fun_l16_n101(x)
+    else
+        fun_l16_n882(x)
+    end
+end
+
+def fun_l15_n290(x)
+    if (x < 1)
+        fun_l16_n697(x)
+    else
+        fun_l16_n963(x)
+    end
+end
+
+def fun_l15_n291(x)
+    if (x < 1)
+        fun_l16_n468(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n292(x)
+    if (x < 1)
+        fun_l16_n817(x)
+    else
+        fun_l16_n454(x)
+    end
+end
+
+def fun_l15_n293(x)
+    if (x < 1)
+        fun_l16_n885(x)
+    else
+        fun_l16_n733(x)
+    end
+end
+
+def fun_l15_n294(x)
+    if (x < 1)
+        fun_l16_n844(x)
+    else
+        fun_l16_n564(x)
+    end
+end
+
+def fun_l15_n295(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n286(x)
+    end
+end
+
+def fun_l15_n296(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n660(x)
+    end
+end
+
+def fun_l15_n297(x)
+    if (x < 1)
+        fun_l16_n839(x)
+    else
+        fun_l16_n274(x)
+    end
+end
+
+def fun_l15_n298(x)
+    if (x < 1)
+        fun_l16_n385(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n299(x)
+    if (x < 1)
+        fun_l16_n137(x)
+    else
+        fun_l16_n548(x)
+    end
+end
+
+def fun_l15_n300(x)
+    if (x < 1)
+        fun_l16_n662(x)
+    else
+        fun_l16_n2(x)
+    end
+end
+
+def fun_l15_n301(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n186(x)
+    end
+end
+
+def fun_l15_n302(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n454(x)
+    end
+end
+
+def fun_l15_n303(x)
+    if (x < 1)
+        fun_l16_n765(x)
+    else
+        fun_l16_n519(x)
+    end
+end
+
+def fun_l15_n304(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n213(x)
+    end
+end
+
+def fun_l15_n305(x)
+    if (x < 1)
+        fun_l16_n695(x)
+    else
+        fun_l16_n545(x)
+    end
+end
+
+def fun_l15_n306(x)
+    if (x < 1)
+        fun_l16_n221(x)
+    else
+        fun_l16_n545(x)
+    end
+end
+
+def fun_l15_n307(x)
+    if (x < 1)
+        fun_l16_n555(x)
+    else
+        fun_l16_n570(x)
+    end
+end
+
+def fun_l15_n308(x)
+    if (x < 1)
+        fun_l16_n57(x)
+    else
+        fun_l16_n91(x)
+    end
+end
+
+def fun_l15_n309(x)
+    if (x < 1)
+        fun_l16_n37(x)
+    else
+        fun_l16_n516(x)
+    end
+end
+
+def fun_l15_n310(x)
+    if (x < 1)
+        fun_l16_n661(x)
+    else
+        fun_l16_n98(x)
+    end
+end
+
+def fun_l15_n311(x)
+    if (x < 1)
+        fun_l16_n119(x)
+    else
+        fun_l16_n613(x)
+    end
+end
+
+def fun_l15_n312(x)
+    if (x < 1)
+        fun_l16_n982(x)
+    else
+        fun_l16_n20(x)
+    end
+end
+
+def fun_l15_n313(x)
+    if (x < 1)
+        fun_l16_n241(x)
+    else
+        fun_l16_n555(x)
+    end
+end
+
+def fun_l15_n314(x)
+    if (x < 1)
+        fun_l16_n638(x)
+    else
+        fun_l16_n854(x)
+    end
+end
+
+def fun_l15_n315(x)
+    if (x < 1)
+        fun_l16_n580(x)
+    else
+        fun_l16_n39(x)
+    end
+end
+
+def fun_l15_n316(x)
+    if (x < 1)
+        fun_l16_n705(x)
+    else
+        fun_l16_n240(x)
+    end
+end
+
+def fun_l15_n317(x)
+    if (x < 1)
+        fun_l16_n395(x)
+    else
+        fun_l16_n114(x)
+    end
+end
+
+def fun_l15_n318(x)
+    if (x < 1)
+        fun_l16_n554(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n319(x)
+    if (x < 1)
+        fun_l16_n108(x)
+    else
+        fun_l16_n537(x)
+    end
+end
+
+def fun_l15_n320(x)
+    if (x < 1)
+        fun_l16_n554(x)
+    else
+        fun_l16_n902(x)
+    end
+end
+
+def fun_l15_n321(x)
+    if (x < 1)
+        fun_l16_n665(x)
+    else
+        fun_l16_n369(x)
+    end
+end
+
+def fun_l15_n322(x)
+    if (x < 1)
+        fun_l16_n4(x)
+    else
+        fun_l16_n572(x)
+    end
+end
+
+def fun_l15_n323(x)
+    if (x < 1)
+        fun_l16_n579(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n324(x)
+    if (x < 1)
+        fun_l16_n593(x)
+    else
+        fun_l16_n203(x)
+    end
+end
+
+def fun_l15_n325(x)
+    if (x < 1)
+        fun_l16_n678(x)
+    else
+        fun_l16_n0(x)
+    end
+end
+
+def fun_l15_n326(x)
+    if (x < 1)
+        fun_l16_n809(x)
+    else
+        fun_l16_n833(x)
+    end
+end
+
+def fun_l15_n327(x)
+    if (x < 1)
+        fun_l16_n618(x)
+    else
+        fun_l16_n381(x)
+    end
+end
+
+def fun_l15_n328(x)
+    if (x < 1)
+        fun_l16_n133(x)
+    else
+        fun_l16_n744(x)
+    end
+end
+
+def fun_l15_n329(x)
+    if (x < 1)
+        fun_l16_n488(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n330(x)
+    if (x < 1)
+        fun_l16_n205(x)
+    else
+        fun_l16_n402(x)
+    end
+end
+
+def fun_l15_n331(x)
+    if (x < 1)
+        fun_l16_n515(x)
+    else
+        fun_l16_n145(x)
+    end
+end
+
+def fun_l15_n332(x)
+    if (x < 1)
+        fun_l16_n581(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n333(x)
+    if (x < 1)
+        fun_l16_n356(x)
+    else
+        fun_l16_n155(x)
+    end
+end
+
+def fun_l15_n334(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n272(x)
+    end
+end
+
+def fun_l15_n335(x)
+    if (x < 1)
+        fun_l16_n714(x)
+    else
+        fun_l16_n245(x)
+    end
+end
+
+def fun_l15_n336(x)
+    if (x < 1)
+        fun_l16_n581(x)
+    else
+        fun_l16_n877(x)
+    end
+end
+
+def fun_l15_n337(x)
+    if (x < 1)
+        fun_l16_n558(x)
+    else
+        fun_l16_n944(x)
+    end
+end
+
+def fun_l15_n338(x)
+    if (x < 1)
+        fun_l16_n49(x)
+    else
+        fun_l16_n501(x)
+    end
+end
+
+def fun_l15_n339(x)
+    if (x < 1)
+        fun_l16_n68(x)
+    else
+        fun_l16_n448(x)
+    end
+end
+
+def fun_l15_n340(x)
+    if (x < 1)
+        fun_l16_n249(x)
+    else
+        fun_l16_n210(x)
+    end
+end
+
+def fun_l15_n341(x)
+    if (x < 1)
+        fun_l16_n720(x)
+    else
+        fun_l16_n977(x)
+    end
+end
+
+def fun_l15_n342(x)
+    if (x < 1)
+        fun_l16_n771(x)
+    else
+        fun_l16_n519(x)
+    end
+end
+
+def fun_l15_n343(x)
+    if (x < 1)
+        fun_l16_n995(x)
+    else
+        fun_l16_n759(x)
+    end
+end
+
+def fun_l15_n344(x)
+    if (x < 1)
+        fun_l16_n972(x)
+    else
+        fun_l16_n558(x)
+    end
+end
+
+def fun_l15_n345(x)
+    if (x < 1)
+        fun_l16_n184(x)
+    else
+        fun_l16_n774(x)
+    end
+end
+
+def fun_l15_n346(x)
+    if (x < 1)
+        fun_l16_n881(x)
+    else
+        fun_l16_n858(x)
+    end
+end
+
+def fun_l15_n347(x)
+    if (x < 1)
+        fun_l16_n921(x)
+    else
+        fun_l16_n640(x)
+    end
+end
+
+def fun_l15_n348(x)
+    if (x < 1)
+        fun_l16_n840(x)
+    else
+        fun_l16_n366(x)
+    end
+end
+
+def fun_l15_n349(x)
+    if (x < 1)
+        fun_l16_n835(x)
+    else
+        fun_l16_n701(x)
+    end
+end
+
+def fun_l15_n350(x)
+    if (x < 1)
+        fun_l16_n304(x)
+    else
+        fun_l16_n144(x)
+    end
+end
+
+def fun_l15_n351(x)
+    if (x < 1)
+        fun_l16_n867(x)
+    else
+        fun_l16_n247(x)
+    end
+end
+
+def fun_l15_n352(x)
+    if (x < 1)
+        fun_l16_n595(x)
+    else
+        fun_l16_n676(x)
+    end
+end
+
+def fun_l15_n353(x)
+    if (x < 1)
+        fun_l16_n125(x)
+    else
+        fun_l16_n99(x)
+    end
+end
+
+def fun_l15_n354(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n355(x)
+    if (x < 1)
+        fun_l16_n405(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n356(x)
+    if (x < 1)
+        fun_l16_n347(x)
+    else
+        fun_l16_n482(x)
+    end
+end
+
+def fun_l15_n357(x)
+    if (x < 1)
+        fun_l16_n742(x)
+    else
+        fun_l16_n531(x)
+    end
+end
+
+def fun_l15_n358(x)
+    if (x < 1)
+        fun_l16_n954(x)
+    else
+        fun_l16_n908(x)
+    end
+end
+
+def fun_l15_n359(x)
+    if (x < 1)
+        fun_l16_n670(x)
+    else
+        fun_l16_n401(x)
+    end
+end
+
+def fun_l15_n360(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n802(x)
+    end
+end
+
+def fun_l15_n361(x)
+    if (x < 1)
+        fun_l16_n12(x)
+    else
+        fun_l16_n985(x)
+    end
+end
+
+def fun_l15_n362(x)
+    if (x < 1)
+        fun_l16_n644(x)
+    else
+        fun_l16_n40(x)
+    end
+end
+
+def fun_l15_n363(x)
+    if (x < 1)
+        fun_l16_n491(x)
+    else
+        fun_l16_n255(x)
+    end
+end
+
+def fun_l15_n364(x)
+    if (x < 1)
+        fun_l16_n14(x)
+    else
+        fun_l16_n433(x)
+    end
+end
+
+def fun_l15_n365(x)
+    if (x < 1)
+        fun_l16_n652(x)
+    else
+        fun_l16_n418(x)
+    end
+end
+
+def fun_l15_n366(x)
+    if (x < 1)
+        fun_l16_n815(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n367(x)
+    if (x < 1)
+        fun_l16_n623(x)
+    else
+        fun_l16_n34(x)
+    end
+end
+
+def fun_l15_n368(x)
+    if (x < 1)
+        fun_l16_n596(x)
+    else
+        fun_l16_n382(x)
+    end
+end
+
+def fun_l15_n369(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n18(x)
+    end
+end
+
+def fun_l15_n370(x)
+    if (x < 1)
+        fun_l16_n37(x)
+    else
+        fun_l16_n626(x)
+    end
+end
+
+def fun_l15_n371(x)
+    if (x < 1)
+        fun_l16_n275(x)
+    else
+        fun_l16_n343(x)
+    end
+end
+
+def fun_l15_n372(x)
+    if (x < 1)
+        fun_l16_n951(x)
+    else
+        fun_l16_n93(x)
+    end
+end
+
+def fun_l15_n373(x)
+    if (x < 1)
+        fun_l16_n893(x)
+    else
+        fun_l16_n137(x)
+    end
+end
+
+def fun_l15_n374(x)
+    if (x < 1)
+        fun_l16_n32(x)
+    else
+        fun_l16_n663(x)
+    end
+end
+
+def fun_l15_n375(x)
+    if (x < 1)
+        fun_l16_n888(x)
+    else
+        fun_l16_n708(x)
+    end
+end
+
+def fun_l15_n376(x)
+    if (x < 1)
+        fun_l16_n745(x)
+    else
+        fun_l16_n275(x)
+    end
+end
+
+def fun_l15_n377(x)
+    if (x < 1)
+        fun_l16_n957(x)
+    else
+        fun_l16_n766(x)
+    end
+end
+
+def fun_l15_n378(x)
+    if (x < 1)
+        fun_l16_n242(x)
+    else
+        fun_l16_n309(x)
+    end
+end
+
+def fun_l15_n379(x)
+    if (x < 1)
+        fun_l16_n855(x)
+    else
+        fun_l16_n289(x)
+    end
+end
+
+def fun_l15_n380(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n261(x)
+    end
+end
+
+def fun_l15_n381(x)
+    if (x < 1)
+        fun_l16_n867(x)
+    else
+        fun_l16_n169(x)
+    end
+end
+
+def fun_l15_n382(x)
+    if (x < 1)
+        fun_l16_n646(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n383(x)
+    if (x < 1)
+        fun_l16_n181(x)
+    else
+        fun_l16_n798(x)
+    end
+end
+
+def fun_l15_n384(x)
+    if (x < 1)
+        fun_l16_n290(x)
+    else
+        fun_l16_n756(x)
+    end
+end
+
+def fun_l15_n385(x)
+    if (x < 1)
+        fun_l16_n896(x)
+    else
+        fun_l16_n14(x)
+    end
+end
+
+def fun_l15_n386(x)
+    if (x < 1)
+        fun_l16_n602(x)
+    else
+        fun_l16_n817(x)
+    end
+end
+
+def fun_l15_n387(x)
+    if (x < 1)
+        fun_l16_n908(x)
+    else
+        fun_l16_n773(x)
+    end
+end
+
+def fun_l15_n388(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n416(x)
+    end
+end
+
+def fun_l15_n389(x)
+    if (x < 1)
+        fun_l16_n42(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n390(x)
+    if (x < 1)
+        fun_l16_n245(x)
+    else
+        fun_l16_n211(x)
+    end
+end
+
+def fun_l15_n391(x)
+    if (x < 1)
+        fun_l16_n674(x)
+    else
+        fun_l16_n854(x)
+    end
+end
+
+def fun_l15_n392(x)
+    if (x < 1)
+        fun_l16_n294(x)
+    else
+        fun_l16_n299(x)
+    end
+end
+
+def fun_l15_n393(x)
+    if (x < 1)
+        fun_l16_n873(x)
+    else
+        fun_l16_n17(x)
+    end
+end
+
+def fun_l15_n394(x)
+    if (x < 1)
+        fun_l16_n375(x)
+    else
+        fun_l16_n976(x)
+    end
+end
+
+def fun_l15_n395(x)
+    if (x < 1)
+        fun_l16_n753(x)
+    else
+        fun_l16_n362(x)
+    end
+end
+
+def fun_l15_n396(x)
+    if (x < 1)
+        fun_l16_n326(x)
+    else
+        fun_l16_n878(x)
+    end
+end
+
+def fun_l15_n397(x)
+    if (x < 1)
+        fun_l16_n118(x)
+    else
+        fun_l16_n552(x)
+    end
+end
+
+def fun_l15_n398(x)
+    if (x < 1)
+        fun_l16_n931(x)
+    else
+        fun_l16_n552(x)
+    end
+end
+
+def fun_l15_n399(x)
+    if (x < 1)
+        fun_l16_n125(x)
+    else
+        fun_l16_n817(x)
+    end
+end
+
+def fun_l15_n400(x)
+    if (x < 1)
+        fun_l16_n747(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n401(x)
+    if (x < 1)
+        fun_l16_n204(x)
+    else
+        fun_l16_n644(x)
+    end
+end
+
+def fun_l15_n402(x)
+    if (x < 1)
+        fun_l16_n730(x)
+    else
+        fun_l16_n622(x)
+    end
+end
+
+def fun_l15_n403(x)
+    if (x < 1)
+        fun_l16_n718(x)
+    else
+        fun_l16_n616(x)
+    end
+end
+
+def fun_l15_n404(x)
+    if (x < 1)
+        fun_l16_n260(x)
+    else
+        fun_l16_n96(x)
+    end
+end
+
+def fun_l15_n405(x)
+    if (x < 1)
+        fun_l16_n123(x)
+    else
+        fun_l16_n377(x)
+    end
+end
+
+def fun_l15_n406(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n601(x)
+    end
+end
+
+def fun_l15_n407(x)
+    if (x < 1)
+        fun_l16_n842(x)
+    else
+        fun_l16_n936(x)
+    end
+end
+
+def fun_l15_n408(x)
+    if (x < 1)
+        fun_l16_n797(x)
+    else
+        fun_l16_n194(x)
+    end
+end
+
+def fun_l15_n409(x)
+    if (x < 1)
+        fun_l16_n930(x)
+    else
+        fun_l16_n976(x)
+    end
+end
+
+def fun_l15_n410(x)
+    if (x < 1)
+        fun_l16_n163(x)
+    else
+        fun_l16_n703(x)
+    end
+end
+
+def fun_l15_n411(x)
+    if (x < 1)
+        fun_l16_n109(x)
+    else
+        fun_l16_n276(x)
+    end
+end
+
+def fun_l15_n412(x)
+    if (x < 1)
+        fun_l16_n37(x)
+    else
+        fun_l16_n372(x)
+    end
+end
+
+def fun_l15_n413(x)
+    if (x < 1)
+        fun_l16_n995(x)
+    else
+        fun_l16_n762(x)
+    end
+end
+
+def fun_l15_n414(x)
+    if (x < 1)
+        fun_l16_n789(x)
+    else
+        fun_l16_n601(x)
+    end
+end
+
+def fun_l15_n415(x)
+    if (x < 1)
+        fun_l16_n699(x)
+    else
+        fun_l16_n853(x)
+    end
+end
+
+def fun_l15_n416(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n417(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n67(x)
+    end
+end
+
+def fun_l15_n418(x)
+    if (x < 1)
+        fun_l16_n563(x)
+    else
+        fun_l16_n248(x)
+    end
+end
+
+def fun_l15_n419(x)
+    if (x < 1)
+        fun_l16_n238(x)
+    else
+        fun_l16_n188(x)
+    end
+end
+
+def fun_l15_n420(x)
+    if (x < 1)
+        fun_l16_n369(x)
+    else
+        fun_l16_n706(x)
+    end
+end
+
+def fun_l15_n421(x)
+    if (x < 1)
+        fun_l16_n641(x)
+    else
+        fun_l16_n869(x)
+    end
+end
+
+def fun_l15_n422(x)
+    if (x < 1)
+        fun_l16_n219(x)
+    else
+        fun_l16_n333(x)
+    end
+end
+
+def fun_l15_n423(x)
+    if (x < 1)
+        fun_l16_n156(x)
+    else
+        fun_l16_n22(x)
+    end
+end
+
+def fun_l15_n424(x)
+    if (x < 1)
+        fun_l16_n443(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n425(x)
+    if (x < 1)
+        fun_l16_n892(x)
+    else
+        fun_l16_n937(x)
+    end
+end
+
+def fun_l15_n426(x)
+    if (x < 1)
+        fun_l16_n586(x)
+    else
+        fun_l16_n636(x)
+    end
+end
+
+def fun_l15_n427(x)
+    if (x < 1)
+        fun_l16_n519(x)
+    else
+        fun_l16_n269(x)
+    end
+end
+
+def fun_l15_n428(x)
+    if (x < 1)
+        fun_l16_n379(x)
+    else
+        fun_l16_n994(x)
+    end
+end
+
+def fun_l15_n429(x)
+    if (x < 1)
+        fun_l16_n588(x)
+    else
+        fun_l16_n532(x)
+    end
+end
+
+def fun_l15_n430(x)
+    if (x < 1)
+        fun_l16_n584(x)
+    else
+        fun_l16_n445(x)
+    end
+end
+
+def fun_l15_n431(x)
+    if (x < 1)
+        fun_l16_n63(x)
+    else
+        fun_l16_n678(x)
+    end
+end
+
+def fun_l15_n432(x)
+    if (x < 1)
+        fun_l16_n487(x)
+    else
+        fun_l16_n435(x)
+    end
+end
+
+def fun_l15_n433(x)
+    if (x < 1)
+        fun_l16_n673(x)
+    else
+        fun_l16_n220(x)
+    end
+end
+
+def fun_l15_n434(x)
+    if (x < 1)
+        fun_l16_n131(x)
+    else
+        fun_l16_n751(x)
+    end
+end
+
+def fun_l15_n435(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n436(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n751(x)
+    end
+end
+
+def fun_l15_n437(x)
+    if (x < 1)
+        fun_l16_n983(x)
+    else
+        fun_l16_n632(x)
+    end
+end
+
+def fun_l15_n438(x)
+    if (x < 1)
+        fun_l16_n350(x)
+    else
+        fun_l16_n492(x)
+    end
+end
+
+def fun_l15_n439(x)
+    if (x < 1)
+        fun_l16_n994(x)
+    else
+        fun_l16_n76(x)
+    end
+end
+
+def fun_l15_n440(x)
+    if (x < 1)
+        fun_l16_n756(x)
+    else
+        fun_l16_n177(x)
+    end
+end
+
+def fun_l15_n441(x)
+    if (x < 1)
+        fun_l16_n619(x)
+    else
+        fun_l16_n473(x)
+    end
+end
+
+def fun_l15_n442(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n714(x)
+    end
+end
+
+def fun_l15_n443(x)
+    if (x < 1)
+        fun_l16_n790(x)
+    else
+        fun_l16_n848(x)
+    end
+end
+
+def fun_l15_n444(x)
+    if (x < 1)
+        fun_l16_n925(x)
+    else
+        fun_l16_n113(x)
+    end
+end
+
+def fun_l15_n445(x)
+    if (x < 1)
+        fun_l16_n990(x)
+    else
+        fun_l16_n566(x)
+    end
+end
+
+def fun_l15_n446(x)
+    if (x < 1)
+        fun_l16_n589(x)
+    else
+        fun_l16_n881(x)
+    end
+end
+
+def fun_l15_n447(x)
+    if (x < 1)
+        fun_l16_n961(x)
+    else
+        fun_l16_n786(x)
+    end
+end
+
+def fun_l15_n448(x)
+    if (x < 1)
+        fun_l16_n928(x)
+    else
+        fun_l16_n631(x)
+    end
+end
+
+def fun_l15_n449(x)
+    if (x < 1)
+        fun_l16_n317(x)
+    else
+        fun_l16_n980(x)
+    end
+end
+
+def fun_l15_n450(x)
+    if (x < 1)
+        fun_l16_n276(x)
+    else
+        fun_l16_n941(x)
+    end
+end
+
+def fun_l15_n451(x)
+    if (x < 1)
+        fun_l16_n552(x)
+    else
+        fun_l16_n545(x)
+    end
+end
+
+def fun_l15_n452(x)
+    if (x < 1)
+        fun_l16_n334(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n453(x)
+    if (x < 1)
+        fun_l16_n800(x)
+    else
+        fun_l16_n548(x)
+    end
+end
+
+def fun_l15_n454(x)
+    if (x < 1)
+        fun_l16_n676(x)
+    else
+        fun_l16_n742(x)
+    end
+end
+
+def fun_l15_n455(x)
+    if (x < 1)
+        fun_l16_n722(x)
+    else
+        fun_l16_n446(x)
+    end
+end
+
+def fun_l15_n456(x)
+    if (x < 1)
+        fun_l16_n570(x)
+    else
+        fun_l16_n203(x)
+    end
+end
+
+def fun_l15_n457(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n401(x)
+    end
+end
+
+def fun_l15_n458(x)
+    if (x < 1)
+        fun_l16_n3(x)
+    else
+        fun_l16_n483(x)
+    end
+end
+
+def fun_l15_n459(x)
+    if (x < 1)
+        fun_l16_n450(x)
+    else
+        fun_l16_n468(x)
+    end
+end
+
+def fun_l15_n460(x)
+    if (x < 1)
+        fun_l16_n447(x)
+    else
+        fun_l16_n758(x)
+    end
+end
+
+def fun_l15_n461(x)
+    if (x < 1)
+        fun_l16_n531(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n462(x)
+    if (x < 1)
+        fun_l16_n628(x)
+    else
+        fun_l16_n142(x)
+    end
+end
+
+def fun_l15_n463(x)
+    if (x < 1)
+        fun_l16_n823(x)
+    else
+        fun_l16_n97(x)
+    end
+end
+
+def fun_l15_n464(x)
+    if (x < 1)
+        fun_l16_n807(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n465(x)
+    if (x < 1)
+        fun_l16_n113(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n466(x)
+    if (x < 1)
+        fun_l16_n234(x)
+    else
+        fun_l16_n369(x)
+    end
+end
+
+def fun_l15_n467(x)
+    if (x < 1)
+        fun_l16_n242(x)
+    else
+        fun_l16_n121(x)
+    end
+end
+
+def fun_l15_n468(x)
+    if (x < 1)
+        fun_l16_n38(x)
+    else
+        fun_l16_n223(x)
+    end
+end
+
+def fun_l15_n469(x)
+    if (x < 1)
+        fun_l16_n618(x)
+    else
+        fun_l16_n550(x)
+    end
+end
+
+def fun_l15_n470(x)
+    if (x < 1)
+        fun_l16_n318(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n471(x)
+    if (x < 1)
+        fun_l16_n782(x)
+    else
+        fun_l16_n876(x)
+    end
+end
+
+def fun_l15_n472(x)
+    if (x < 1)
+        fun_l16_n995(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n473(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n891(x)
+    end
+end
+
+def fun_l15_n474(x)
+    if (x < 1)
+        fun_l16_n263(x)
+    else
+        fun_l16_n278(x)
+    end
+end
+
+def fun_l15_n475(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n62(x)
+    end
+end
+
+def fun_l15_n476(x)
+    if (x < 1)
+        fun_l16_n855(x)
+    else
+        fun_l16_n153(x)
+    end
+end
+
+def fun_l15_n477(x)
+    if (x < 1)
+        fun_l16_n979(x)
+    else
+        fun_l16_n957(x)
+    end
+end
+
+def fun_l15_n478(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n479(x)
+    if (x < 1)
+        fun_l16_n479(x)
+    else
+        fun_l16_n400(x)
+    end
+end
+
+def fun_l15_n480(x)
+    if (x < 1)
+        fun_l16_n740(x)
+    else
+        fun_l16_n940(x)
+    end
+end
+
+def fun_l15_n481(x)
+    if (x < 1)
+        fun_l16_n270(x)
+    else
+        fun_l16_n802(x)
+    end
+end
+
+def fun_l15_n482(x)
+    if (x < 1)
+        fun_l16_n489(x)
+    else
+        fun_l16_n402(x)
+    end
+end
+
+def fun_l15_n483(x)
+    if (x < 1)
+        fun_l16_n505(x)
+    else
+        fun_l16_n97(x)
+    end
+end
+
+def fun_l15_n484(x)
+    if (x < 1)
+        fun_l16_n64(x)
+    else
+        fun_l16_n748(x)
+    end
+end
+
+def fun_l15_n485(x)
+    if (x < 1)
+        fun_l16_n7(x)
+    else
+        fun_l16_n627(x)
+    end
+end
+
+def fun_l15_n486(x)
+    if (x < 1)
+        fun_l16_n302(x)
+    else
+        fun_l16_n331(x)
+    end
+end
+
+def fun_l15_n487(x)
+    if (x < 1)
+        fun_l16_n771(x)
+    else
+        fun_l16_n895(x)
+    end
+end
+
+def fun_l15_n488(x)
+    if (x < 1)
+        fun_l16_n306(x)
+    else
+        fun_l16_n740(x)
+    end
+end
+
+def fun_l15_n489(x)
+    if (x < 1)
+        fun_l16_n722(x)
+    else
+        fun_l16_n848(x)
+    end
+end
+
+def fun_l15_n490(x)
+    if (x < 1)
+        fun_l16_n764(x)
+    else
+        fun_l16_n851(x)
+    end
+end
+
+def fun_l15_n491(x)
+    if (x < 1)
+        fun_l16_n357(x)
+    else
+        fun_l16_n117(x)
+    end
+end
+
+def fun_l15_n492(x)
+    if (x < 1)
+        fun_l16_n483(x)
+    else
+        fun_l16_n187(x)
+    end
+end
+
+def fun_l15_n493(x)
+    if (x < 1)
+        fun_l16_n695(x)
+    else
+        fun_l16_n727(x)
+    end
+end
+
+def fun_l15_n494(x)
+    if (x < 1)
+        fun_l16_n460(x)
+    else
+        fun_l16_n154(x)
+    end
+end
+
+def fun_l15_n495(x)
+    if (x < 1)
+        fun_l16_n130(x)
+    else
+        fun_l16_n999(x)
+    end
+end
+
+def fun_l15_n496(x)
+    if (x < 1)
+        fun_l16_n963(x)
+    else
+        fun_l16_n746(x)
+    end
+end
+
+def fun_l15_n497(x)
+    if (x < 1)
+        fun_l16_n630(x)
+    else
+        fun_l16_n852(x)
+    end
+end
+
+def fun_l15_n498(x)
+    if (x < 1)
+        fun_l16_n847(x)
+    else
+        fun_l16_n836(x)
+    end
+end
+
+def fun_l15_n499(x)
+    if (x < 1)
+        fun_l16_n100(x)
+    else
+        fun_l16_n40(x)
+    end
+end
+
+def fun_l15_n500(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n442(x)
+    end
+end
+
+def fun_l15_n501(x)
+    if (x < 1)
+        fun_l16_n355(x)
+    else
+        fun_l16_n405(x)
+    end
+end
+
+def fun_l15_n502(x)
+    if (x < 1)
+        fun_l16_n857(x)
+    else
+        fun_l16_n652(x)
+    end
+end
+
+def fun_l15_n503(x)
+    if (x < 1)
+        fun_l16_n612(x)
+    else
+        fun_l16_n779(x)
+    end
+end
+
+def fun_l15_n504(x)
+    if (x < 1)
+        fun_l16_n836(x)
+    else
+        fun_l16_n625(x)
+    end
+end
+
+def fun_l15_n505(x)
+    if (x < 1)
+        fun_l16_n872(x)
+    else
+        fun_l16_n905(x)
+    end
+end
+
+def fun_l15_n506(x)
+    if (x < 1)
+        fun_l16_n953(x)
+    else
+        fun_l16_n955(x)
+    end
+end
+
+def fun_l15_n507(x)
+    if (x < 1)
+        fun_l16_n678(x)
+    else
+        fun_l16_n663(x)
+    end
+end
+
+def fun_l15_n508(x)
+    if (x < 1)
+        fun_l16_n848(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n509(x)
+    if (x < 1)
+        fun_l16_n558(x)
+    else
+        fun_l16_n430(x)
+    end
+end
+
+def fun_l15_n510(x)
+    if (x < 1)
+        fun_l16_n424(x)
+    else
+        fun_l16_n473(x)
+    end
+end
+
+def fun_l15_n511(x)
+    if (x < 1)
+        fun_l16_n897(x)
+    else
+        fun_l16_n359(x)
+    end
+end
+
+def fun_l15_n512(x)
+    if (x < 1)
+        fun_l16_n229(x)
+    else
+        fun_l16_n205(x)
+    end
+end
+
+def fun_l15_n513(x)
+    if (x < 1)
+        fun_l16_n553(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n514(x)
+    if (x < 1)
+        fun_l16_n300(x)
+    else
+        fun_l16_n588(x)
+    end
+end
+
+def fun_l15_n515(x)
+    if (x < 1)
+        fun_l16_n819(x)
+    else
+        fun_l16_n467(x)
+    end
+end
+
+def fun_l15_n516(x)
+    if (x < 1)
+        fun_l16_n767(x)
+    else
+        fun_l16_n786(x)
+    end
+end
+
+def fun_l15_n517(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n309(x)
+    end
+end
+
+def fun_l15_n518(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n519(x)
+    if (x < 1)
+        fun_l16_n935(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n520(x)
+    if (x < 1)
+        fun_l16_n343(x)
+    else
+        fun_l16_n175(x)
+    end
+end
+
+def fun_l15_n521(x)
+    if (x < 1)
+        fun_l16_n212(x)
+    else
+        fun_l16_n987(x)
+    end
+end
+
+def fun_l15_n522(x)
+    if (x < 1)
+        fun_l16_n780(x)
+    else
+        fun_l16_n331(x)
+    end
+end
+
+def fun_l15_n523(x)
+    if (x < 1)
+        fun_l16_n452(x)
+    else
+        fun_l16_n393(x)
+    end
+end
+
+def fun_l15_n524(x)
+    if (x < 1)
+        fun_l16_n823(x)
+    else
+        fun_l16_n212(x)
+    end
+end
+
+def fun_l15_n525(x)
+    if (x < 1)
+        fun_l16_n516(x)
+    else
+        fun_l16_n906(x)
+    end
+end
+
+def fun_l15_n526(x)
+    if (x < 1)
+        fun_l16_n590(x)
+    else
+        fun_l16_n278(x)
+    end
+end
+
+def fun_l15_n527(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n714(x)
+    end
+end
+
+def fun_l15_n528(x)
+    if (x < 1)
+        fun_l16_n729(x)
+    else
+        fun_l16_n751(x)
+    end
+end
+
+def fun_l15_n529(x)
+    if (x < 1)
+        fun_l16_n863(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n530(x)
+    if (x < 1)
+        fun_l16_n472(x)
+    else
+        fun_l16_n672(x)
+    end
+end
+
+def fun_l15_n531(x)
+    if (x < 1)
+        fun_l16_n811(x)
+    else
+        fun_l16_n201(x)
+    end
+end
+
+def fun_l15_n532(x)
+    if (x < 1)
+        fun_l16_n558(x)
+    else
+        fun_l16_n602(x)
+    end
+end
+
+def fun_l15_n533(x)
+    if (x < 1)
+        fun_l16_n788(x)
+    else
+        fun_l16_n175(x)
+    end
+end
+
+def fun_l15_n534(x)
+    if (x < 1)
+        fun_l16_n497(x)
+    else
+        fun_l16_n807(x)
+    end
+end
+
+def fun_l15_n535(x)
+    if (x < 1)
+        fun_l16_n712(x)
+    else
+        fun_l16_n870(x)
+    end
+end
+
+def fun_l15_n536(x)
+    if (x < 1)
+        fun_l16_n699(x)
+    else
+        fun_l16_n879(x)
+    end
+end
+
+def fun_l15_n537(x)
+    if (x < 1)
+        fun_l16_n215(x)
+    else
+        fun_l16_n807(x)
+    end
+end
+
+def fun_l15_n538(x)
+    if (x < 1)
+        fun_l16_n569(x)
+    else
+        fun_l16_n385(x)
+    end
+end
+
+def fun_l15_n539(x)
+    if (x < 1)
+        fun_l16_n807(x)
+    else
+        fun_l16_n699(x)
+    end
+end
+
+def fun_l15_n540(x)
+    if (x < 1)
+        fun_l16_n982(x)
+    else
+        fun_l16_n436(x)
+    end
+end
+
+def fun_l15_n541(x)
+    if (x < 1)
+        fun_l16_n852(x)
+    else
+        fun_l16_n800(x)
+    end
+end
+
+def fun_l15_n542(x)
+    if (x < 1)
+        fun_l16_n401(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n543(x)
+    if (x < 1)
+        fun_l16_n373(x)
+    else
+        fun_l16_n465(x)
+    end
+end
+
+def fun_l15_n544(x)
+    if (x < 1)
+        fun_l16_n299(x)
+    else
+        fun_l16_n337(x)
+    end
+end
+
+def fun_l15_n545(x)
+    if (x < 1)
+        fun_l16_n931(x)
+    else
+        fun_l16_n68(x)
+    end
+end
+
+def fun_l15_n546(x)
+    if (x < 1)
+        fun_l16_n87(x)
+    else
+        fun_l16_n947(x)
+    end
+end
+
+def fun_l15_n547(x)
+    if (x < 1)
+        fun_l16_n287(x)
+    else
+        fun_l16_n530(x)
+    end
+end
+
+def fun_l15_n548(x)
+    if (x < 1)
+        fun_l16_n910(x)
+    else
+        fun_l16_n112(x)
+    end
+end
+
+def fun_l15_n549(x)
+    if (x < 1)
+        fun_l16_n878(x)
+    else
+        fun_l16_n737(x)
+    end
+end
+
+def fun_l15_n550(x)
+    if (x < 1)
+        fun_l16_n538(x)
+    else
+        fun_l16_n634(x)
+    end
+end
+
+def fun_l15_n551(x)
+    if (x < 1)
+        fun_l16_n109(x)
+    else
+        fun_l16_n493(x)
+    end
+end
+
+def fun_l15_n552(x)
+    if (x < 1)
+        fun_l16_n631(x)
+    else
+        fun_l16_n244(x)
+    end
+end
+
+def fun_l15_n553(x)
+    if (x < 1)
+        fun_l16_n107(x)
+    else
+        fun_l16_n718(x)
+    end
+end
+
+def fun_l15_n554(x)
+    if (x < 1)
+        fun_l16_n572(x)
+    else
+        fun_l16_n199(x)
+    end
+end
+
+def fun_l15_n555(x)
+    if (x < 1)
+        fun_l16_n109(x)
+    else
+        fun_l16_n705(x)
+    end
+end
+
+def fun_l15_n556(x)
+    if (x < 1)
+        fun_l16_n679(x)
+    else
+        fun_l16_n999(x)
+    end
+end
+
+def fun_l15_n557(x)
+    if (x < 1)
+        fun_l16_n714(x)
+    else
+        fun_l16_n121(x)
+    end
+end
+
+def fun_l15_n558(x)
+    if (x < 1)
+        fun_l16_n408(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n559(x)
+    if (x < 1)
+        fun_l16_n861(x)
+    else
+        fun_l16_n83(x)
+    end
+end
+
+def fun_l15_n560(x)
+    if (x < 1)
+        fun_l16_n597(x)
+    else
+        fun_l16_n413(x)
+    end
+end
+
+def fun_l15_n561(x)
+    if (x < 1)
+        fun_l16_n485(x)
+    else
+        fun_l16_n42(x)
+    end
+end
+
+def fun_l15_n562(x)
+    if (x < 1)
+        fun_l16_n798(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n563(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n858(x)
+    end
+end
+
+def fun_l15_n564(x)
+    if (x < 1)
+        fun_l16_n92(x)
+    else
+        fun_l16_n3(x)
+    end
+end
+
+def fun_l15_n565(x)
+    if (x < 1)
+        fun_l16_n311(x)
+    else
+        fun_l16_n953(x)
+    end
+end
+
+def fun_l15_n566(x)
+    if (x < 1)
+        fun_l16_n649(x)
+    else
+        fun_l16_n670(x)
+    end
+end
+
+def fun_l15_n567(x)
+    if (x < 1)
+        fun_l16_n598(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n568(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n569(x)
+    if (x < 1)
+        fun_l16_n447(x)
+    else
+        fun_l16_n940(x)
+    end
+end
+
+def fun_l15_n570(x)
+    if (x < 1)
+        fun_l16_n755(x)
+    else
+        fun_l16_n26(x)
+    end
+end
+
+def fun_l15_n571(x)
+    if (x < 1)
+        fun_l16_n157(x)
+    else
+        fun_l16_n582(x)
+    end
+end
+
+def fun_l15_n572(x)
+    if (x < 1)
+        fun_l16_n530(x)
+    else
+        fun_l16_n202(x)
+    end
+end
+
+def fun_l15_n573(x)
+    if (x < 1)
+        fun_l16_n95(x)
+    else
+        fun_l16_n137(x)
+    end
+end
+
+def fun_l15_n574(x)
+    if (x < 1)
+        fun_l16_n789(x)
+    else
+        fun_l16_n531(x)
+    end
+end
+
+def fun_l15_n575(x)
+    if (x < 1)
+        fun_l16_n677(x)
+    else
+        fun_l16_n686(x)
+    end
+end
+
+def fun_l15_n576(x)
+    if (x < 1)
+        fun_l16_n253(x)
+    else
+        fun_l16_n101(x)
+    end
+end
+
+def fun_l15_n577(x)
+    if (x < 1)
+        fun_l16_n579(x)
+    else
+        fun_l16_n250(x)
+    end
+end
+
+def fun_l15_n578(x)
+    if (x < 1)
+        fun_l16_n104(x)
+    else
+        fun_l16_n860(x)
+    end
+end
+
+def fun_l15_n579(x)
+    if (x < 1)
+        fun_l16_n415(x)
+    else
+        fun_l16_n480(x)
+    end
+end
+
+def fun_l15_n580(x)
+    if (x < 1)
+        fun_l16_n255(x)
+    else
+        fun_l16_n123(x)
+    end
+end
+
+def fun_l15_n581(x)
+    if (x < 1)
+        fun_l16_n40(x)
+    else
+        fun_l16_n36(x)
+    end
+end
+
+def fun_l15_n582(x)
+    if (x < 1)
+        fun_l16_n612(x)
+    else
+        fun_l16_n46(x)
+    end
+end
+
+def fun_l15_n583(x)
+    if (x < 1)
+        fun_l16_n328(x)
+    else
+        fun_l16_n638(x)
+    end
+end
+
+def fun_l15_n584(x)
+    if (x < 1)
+        fun_l16_n219(x)
+    else
+        fun_l16_n672(x)
+    end
+end
+
+def fun_l15_n585(x)
+    if (x < 1)
+        fun_l16_n67(x)
+    else
+        fun_l16_n584(x)
+    end
+end
+
+def fun_l15_n586(x)
+    if (x < 1)
+        fun_l16_n222(x)
+    else
+        fun_l16_n366(x)
+    end
+end
+
+def fun_l15_n587(x)
+    if (x < 1)
+        fun_l16_n194(x)
+    else
+        fun_l16_n54(x)
+    end
+end
+
+def fun_l15_n588(x)
+    if (x < 1)
+        fun_l16_n742(x)
+    else
+        fun_l16_n725(x)
+    end
+end
+
+def fun_l15_n589(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n688(x)
+    end
+end
+
+def fun_l15_n590(x)
+    if (x < 1)
+        fun_l16_n588(x)
+    else
+        fun_l16_n296(x)
+    end
+end
+
+def fun_l15_n591(x)
+    if (x < 1)
+        fun_l16_n756(x)
+    else
+        fun_l16_n619(x)
+    end
+end
+
+def fun_l15_n592(x)
+    if (x < 1)
+        fun_l16_n919(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n593(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n594(x)
+    if (x < 1)
+        fun_l16_n641(x)
+    else
+        fun_l16_n980(x)
+    end
+end
+
+def fun_l15_n595(x)
+    if (x < 1)
+        fun_l16_n132(x)
+    else
+        fun_l16_n120(x)
+    end
+end
+
+def fun_l15_n596(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n383(x)
+    end
+end
+
+def fun_l15_n597(x)
+    if (x < 1)
+        fun_l16_n987(x)
+    else
+        fun_l16_n685(x)
+    end
+end
+
+def fun_l15_n598(x)
+    if (x < 1)
+        fun_l16_n898(x)
+    else
+        fun_l16_n53(x)
+    end
+end
+
+def fun_l15_n599(x)
+    if (x < 1)
+        fun_l16_n589(x)
+    else
+        fun_l16_n25(x)
+    end
+end
+
+def fun_l15_n600(x)
+    if (x < 1)
+        fun_l16_n841(x)
+    else
+        fun_l16_n623(x)
+    end
+end
+
+def fun_l15_n601(x)
+    if (x < 1)
+        fun_l16_n63(x)
+    else
+        fun_l16_n515(x)
+    end
+end
+
+def fun_l15_n602(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n318(x)
+    end
+end
+
+def fun_l15_n603(x)
+    if (x < 1)
+        fun_l16_n679(x)
+    else
+        fun_l16_n31(x)
+    end
+end
+
+def fun_l15_n604(x)
+    if (x < 1)
+        fun_l16_n617(x)
+    else
+        fun_l16_n20(x)
+    end
+end
+
+def fun_l15_n605(x)
+    if (x < 1)
+        fun_l16_n635(x)
+    else
+        fun_l16_n990(x)
+    end
+end
+
+def fun_l15_n606(x)
+    if (x < 1)
+        fun_l16_n174(x)
+    else
+        fun_l16_n977(x)
+    end
+end
+
+def fun_l15_n607(x)
+    if (x < 1)
+        fun_l16_n449(x)
+    else
+        fun_l16_n658(x)
+    end
+end
+
+def fun_l15_n608(x)
+    if (x < 1)
+        fun_l16_n208(x)
+    else
+        fun_l16_n875(x)
+    end
+end
+
+def fun_l15_n609(x)
+    if (x < 1)
+        fun_l16_n665(x)
+    else
+        fun_l16_n431(x)
+    end
+end
+
+def fun_l15_n610(x)
+    if (x < 1)
+        fun_l16_n6(x)
+    else
+        fun_l16_n78(x)
+    end
+end
+
+def fun_l15_n611(x)
+    if (x < 1)
+        fun_l16_n335(x)
+    else
+        fun_l16_n558(x)
+    end
+end
+
+def fun_l15_n612(x)
+    if (x < 1)
+        fun_l16_n259(x)
+    else
+        fun_l16_n893(x)
+    end
+end
+
+def fun_l15_n613(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n519(x)
+    end
+end
+
+def fun_l15_n614(x)
+    if (x < 1)
+        fun_l16_n96(x)
+    else
+        fun_l16_n28(x)
+    end
+end
+
+def fun_l15_n615(x)
+    if (x < 1)
+        fun_l16_n166(x)
+    else
+        fun_l16_n417(x)
+    end
+end
+
+def fun_l15_n616(x)
+    if (x < 1)
+        fun_l16_n666(x)
+    else
+        fun_l16_n932(x)
+    end
+end
+
+def fun_l15_n617(x)
+    if (x < 1)
+        fun_l16_n745(x)
+    else
+        fun_l16_n967(x)
+    end
+end
+
+def fun_l15_n618(x)
+    if (x < 1)
+        fun_l16_n5(x)
+    else
+        fun_l16_n769(x)
+    end
+end
+
+def fun_l15_n619(x)
+    if (x < 1)
+        fun_l16_n108(x)
+    else
+        fun_l16_n658(x)
+    end
+end
+
+def fun_l15_n620(x)
+    if (x < 1)
+        fun_l16_n454(x)
+    else
+        fun_l16_n666(x)
+    end
+end
+
+def fun_l15_n621(x)
+    if (x < 1)
+        fun_l16_n756(x)
+    else
+        fun_l16_n580(x)
+    end
+end
+
+def fun_l15_n622(x)
+    if (x < 1)
+        fun_l16_n419(x)
+    else
+        fun_l16_n450(x)
+    end
+end
+
+def fun_l15_n623(x)
+    if (x < 1)
+        fun_l16_n793(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n624(x)
+    if (x < 1)
+        fun_l16_n78(x)
+    else
+        fun_l16_n311(x)
+    end
+end
+
+def fun_l15_n625(x)
+    if (x < 1)
+        fun_l16_n35(x)
+    else
+        fun_l16_n378(x)
+    end
+end
+
+def fun_l15_n626(x)
+    if (x < 1)
+        fun_l16_n974(x)
+    else
+        fun_l16_n483(x)
+    end
+end
+
+def fun_l15_n627(x)
+    if (x < 1)
+        fun_l16_n67(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n628(x)
+    if (x < 1)
+        fun_l16_n640(x)
+    else
+        fun_l16_n32(x)
+    end
+end
+
+def fun_l15_n629(x)
+    if (x < 1)
+        fun_l16_n297(x)
+    else
+        fun_l16_n63(x)
+    end
+end
+
+def fun_l15_n630(x)
+    if (x < 1)
+        fun_l16_n546(x)
+    else
+        fun_l16_n931(x)
+    end
+end
+
+def fun_l15_n631(x)
+    if (x < 1)
+        fun_l16_n688(x)
+    else
+        fun_l16_n542(x)
+    end
+end
+
+def fun_l15_n632(x)
+    if (x < 1)
+        fun_l16_n313(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n633(x)
+    if (x < 1)
+        fun_l16_n743(x)
+    else
+        fun_l16_n382(x)
+    end
+end
+
+def fun_l15_n634(x)
+    if (x < 1)
+        fun_l16_n224(x)
+    else
+        fun_l16_n311(x)
+    end
+end
+
+def fun_l15_n635(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n329(x)
+    end
+end
+
+def fun_l15_n636(x)
+    if (x < 1)
+        fun_l16_n735(x)
+    else
+        fun_l16_n759(x)
+    end
+end
+
+def fun_l15_n637(x)
+    if (x < 1)
+        fun_l16_n699(x)
+    else
+        fun_l16_n27(x)
+    end
+end
+
+def fun_l15_n638(x)
+    if (x < 1)
+        fun_l16_n710(x)
+    else
+        fun_l16_n194(x)
+    end
+end
+
+def fun_l15_n639(x)
+    if (x < 1)
+        fun_l16_n245(x)
+    else
+        fun_l16_n950(x)
+    end
+end
+
+def fun_l15_n640(x)
+    if (x < 1)
+        fun_l16_n488(x)
+    else
+        fun_l16_n357(x)
+    end
+end
+
+def fun_l15_n641(x)
+    if (x < 1)
+        fun_l16_n331(x)
+    else
+        fun_l16_n962(x)
+    end
+end
+
+def fun_l15_n642(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n877(x)
+    end
+end
+
+def fun_l15_n643(x)
+    if (x < 1)
+        fun_l16_n605(x)
+    else
+        fun_l16_n733(x)
+    end
+end
+
+def fun_l15_n644(x)
+    if (x < 1)
+        fun_l16_n22(x)
+    else
+        fun_l16_n176(x)
+    end
+end
+
+def fun_l15_n645(x)
+    if (x < 1)
+        fun_l16_n934(x)
+    else
+        fun_l16_n351(x)
+    end
+end
+
+def fun_l15_n646(x)
+    if (x < 1)
+        fun_l16_n224(x)
+    else
+        fun_l16_n308(x)
+    end
+end
+
+def fun_l15_n647(x)
+    if (x < 1)
+        fun_l16_n374(x)
+    else
+        fun_l16_n612(x)
+    end
+end
+
+def fun_l15_n648(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n563(x)
+    end
+end
+
+def fun_l15_n649(x)
+    if (x < 1)
+        fun_l16_n955(x)
+    else
+        fun_l16_n63(x)
+    end
+end
+
+def fun_l15_n650(x)
+    if (x < 1)
+        fun_l16_n734(x)
+    else
+        fun_l16_n194(x)
+    end
+end
+
+def fun_l15_n651(x)
+    if (x < 1)
+        fun_l16_n237(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n652(x)
+    if (x < 1)
+        fun_l16_n135(x)
+    else
+        fun_l16_n217(x)
+    end
+end
+
+def fun_l15_n653(x)
+    if (x < 1)
+        fun_l16_n565(x)
+    else
+        fun_l16_n437(x)
+    end
+end
+
+def fun_l15_n654(x)
+    if (x < 1)
+        fun_l16_n471(x)
+    else
+        fun_l16_n426(x)
+    end
+end
+
+def fun_l15_n655(x)
+    if (x < 1)
+        fun_l16_n570(x)
+    else
+        fun_l16_n64(x)
+    end
+end
+
+def fun_l15_n656(x)
+    if (x < 1)
+        fun_l16_n456(x)
+    else
+        fun_l16_n479(x)
+    end
+end
+
+def fun_l15_n657(x)
+    if (x < 1)
+        fun_l16_n446(x)
+    else
+        fun_l16_n362(x)
+    end
+end
+
+def fun_l15_n658(x)
+    if (x < 1)
+        fun_l16_n294(x)
+    else
+        fun_l16_n485(x)
+    end
+end
+
+def fun_l15_n659(x)
+    if (x < 1)
+        fun_l16_n96(x)
+    else
+        fun_l16_n60(x)
+    end
+end
+
+def fun_l15_n660(x)
+    if (x < 1)
+        fun_l16_n436(x)
+    else
+        fun_l16_n12(x)
+    end
+end
+
+def fun_l15_n661(x)
+    if (x < 1)
+        fun_l16_n5(x)
+    else
+        fun_l16_n452(x)
+    end
+end
+
+def fun_l15_n662(x)
+    if (x < 1)
+        fun_l16_n70(x)
+    else
+        fun_l16_n564(x)
+    end
+end
+
+def fun_l15_n663(x)
+    if (x < 1)
+        fun_l16_n92(x)
+    else
+        fun_l16_n333(x)
+    end
+end
+
+def fun_l15_n664(x)
+    if (x < 1)
+        fun_l16_n884(x)
+    else
+        fun_l16_n381(x)
+    end
+end
+
+def fun_l15_n665(x)
+    if (x < 1)
+        fun_l16_n816(x)
+    else
+        fun_l16_n243(x)
+    end
+end
+
+def fun_l15_n666(x)
+    if (x < 1)
+        fun_l16_n680(x)
+    else
+        fun_l16_n306(x)
+    end
+end
+
+def fun_l15_n667(x)
+    if (x < 1)
+        fun_l16_n470(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n668(x)
+    if (x < 1)
+        fun_l16_n34(x)
+    else
+        fun_l16_n261(x)
+    end
+end
+
+def fun_l15_n669(x)
+    if (x < 1)
+        fun_l16_n644(x)
+    else
+        fun_l16_n389(x)
+    end
+end
+
+def fun_l15_n670(x)
+    if (x < 1)
+        fun_l16_n313(x)
+    else
+        fun_l16_n575(x)
+    end
+end
+
+def fun_l15_n671(x)
+    if (x < 1)
+        fun_l16_n241(x)
+    else
+        fun_l16_n304(x)
+    end
+end
+
+def fun_l15_n672(x)
+    if (x < 1)
+        fun_l16_n280(x)
+    else
+        fun_l16_n996(x)
+    end
+end
+
+def fun_l15_n673(x)
+    if (x < 1)
+        fun_l16_n723(x)
+    else
+        fun_l16_n42(x)
+    end
+end
+
+def fun_l15_n674(x)
+    if (x < 1)
+        fun_l16_n503(x)
+    else
+        fun_l16_n837(x)
+    end
+end
+
+def fun_l15_n675(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n815(x)
+    end
+end
+
+def fun_l15_n676(x)
+    if (x < 1)
+        fun_l16_n441(x)
+    else
+        fun_l16_n313(x)
+    end
+end
+
+def fun_l15_n677(x)
+    if (x < 1)
+        fun_l16_n277(x)
+    else
+        fun_l16_n653(x)
+    end
+end
+
+def fun_l15_n678(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n907(x)
+    end
+end
+
+def fun_l15_n679(x)
+    if (x < 1)
+        fun_l16_n549(x)
+    else
+        fun_l16_n956(x)
+    end
+end
+
+def fun_l15_n680(x)
+    if (x < 1)
+        fun_l16_n177(x)
+    else
+        fun_l16_n238(x)
+    end
+end
+
+def fun_l15_n681(x)
+    if (x < 1)
+        fun_l16_n931(x)
+    else
+        fun_l16_n278(x)
+    end
+end
+
+def fun_l15_n682(x)
+    if (x < 1)
+        fun_l16_n923(x)
+    else
+        fun_l16_n924(x)
+    end
+end
+
+def fun_l15_n683(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n76(x)
+    end
+end
+
+def fun_l15_n684(x)
+    if (x < 1)
+        fun_l16_n828(x)
+    else
+        fun_l16_n961(x)
+    end
+end
+
+def fun_l15_n685(x)
+    if (x < 1)
+        fun_l16_n298(x)
+    else
+        fun_l16_n95(x)
+    end
+end
+
+def fun_l15_n686(x)
+    if (x < 1)
+        fun_l16_n929(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n687(x)
+    if (x < 1)
+        fun_l16_n488(x)
+    else
+        fun_l16_n543(x)
+    end
+end
+
+def fun_l15_n688(x)
+    if (x < 1)
+        fun_l16_n562(x)
+    else
+        fun_l16_n879(x)
+    end
+end
+
+def fun_l15_n689(x)
+    if (x < 1)
+        fun_l16_n348(x)
+    else
+        fun_l16_n458(x)
+    end
+end
+
+def fun_l15_n690(x)
+    if (x < 1)
+        fun_l16_n431(x)
+    else
+        fun_l16_n653(x)
+    end
+end
+
+def fun_l15_n691(x)
+    if (x < 1)
+        fun_l16_n173(x)
+    else
+        fun_l16_n600(x)
+    end
+end
+
+def fun_l15_n692(x)
+    if (x < 1)
+        fun_l16_n820(x)
+    else
+        fun_l16_n793(x)
+    end
+end
+
+def fun_l15_n693(x)
+    if (x < 1)
+        fun_l16_n611(x)
+    else
+        fun_l16_n308(x)
+    end
+end
+
+def fun_l15_n694(x)
+    if (x < 1)
+        fun_l16_n325(x)
+    else
+        fun_l16_n791(x)
+    end
+end
+
+def fun_l15_n695(x)
+    if (x < 1)
+        fun_l16_n890(x)
+    else
+        fun_l16_n98(x)
+    end
+end
+
+def fun_l15_n696(x)
+    if (x < 1)
+        fun_l16_n803(x)
+    else
+        fun_l16_n890(x)
+    end
+end
+
+def fun_l15_n697(x)
+    if (x < 1)
+        fun_l16_n182(x)
+    else
+        fun_l16_n229(x)
+    end
+end
+
+def fun_l15_n698(x)
+    if (x < 1)
+        fun_l16_n238(x)
+    else
+        fun_l16_n395(x)
+    end
+end
+
+def fun_l15_n699(x)
+    if (x < 1)
+        fun_l16_n349(x)
+    else
+        fun_l16_n903(x)
+    end
+end
+
+def fun_l15_n700(x)
+    if (x < 1)
+        fun_l16_n328(x)
+    else
+        fun_l16_n664(x)
+    end
+end
+
+def fun_l15_n701(x)
+    if (x < 1)
+        fun_l16_n924(x)
+    else
+        fun_l16_n415(x)
+    end
+end
+
+def fun_l15_n702(x)
+    if (x < 1)
+        fun_l16_n504(x)
+    else
+        fun_l16_n180(x)
+    end
+end
+
+def fun_l15_n703(x)
+    if (x < 1)
+        fun_l16_n754(x)
+    else
+        fun_l16_n580(x)
+    end
+end
+
+def fun_l15_n704(x)
+    if (x < 1)
+        fun_l16_n686(x)
+    else
+        fun_l16_n75(x)
+    end
+end
+
+def fun_l15_n705(x)
+    if (x < 1)
+        fun_l16_n295(x)
+    else
+        fun_l16_n789(x)
+    end
+end
+
+def fun_l15_n706(x)
+    if (x < 1)
+        fun_l16_n796(x)
+    else
+        fun_l16_n628(x)
+    end
+end
+
+def fun_l15_n707(x)
+    if (x < 1)
+        fun_l16_n603(x)
+    else
+        fun_l16_n864(x)
+    end
+end
+
+def fun_l15_n708(x)
+    if (x < 1)
+        fun_l16_n420(x)
+    else
+        fun_l16_n506(x)
+    end
+end
+
+def fun_l15_n709(x)
+    if (x < 1)
+        fun_l16_n417(x)
+    else
+        fun_l16_n677(x)
+    end
+end
+
+def fun_l15_n710(x)
+    if (x < 1)
+        fun_l16_n484(x)
+    else
+        fun_l16_n210(x)
+    end
+end
+
+def fun_l15_n711(x)
+    if (x < 1)
+        fun_l16_n127(x)
+    else
+        fun_l16_n423(x)
+    end
+end
+
+def fun_l15_n712(x)
+    if (x < 1)
+        fun_l16_n395(x)
+    else
+        fun_l16_n75(x)
+    end
+end
+
+def fun_l15_n713(x)
+    if (x < 1)
+        fun_l16_n388(x)
+    else
+        fun_l16_n261(x)
+    end
+end
+
+def fun_l15_n714(x)
+    if (x < 1)
+        fun_l16_n508(x)
+    else
+        fun_l16_n160(x)
+    end
+end
+
+def fun_l15_n715(x)
+    if (x < 1)
+        fun_l16_n468(x)
+    else
+        fun_l16_n784(x)
+    end
+end
+
+def fun_l15_n716(x)
+    if (x < 1)
+        fun_l16_n156(x)
+    else
+        fun_l16_n769(x)
+    end
+end
+
+def fun_l15_n717(x)
+    if (x < 1)
+        fun_l16_n219(x)
+    else
+        fun_l16_n618(x)
+    end
+end
+
+def fun_l15_n718(x)
+    if (x < 1)
+        fun_l16_n921(x)
+    else
+        fun_l16_n83(x)
+    end
+end
+
+def fun_l15_n719(x)
+    if (x < 1)
+        fun_l16_n262(x)
+    else
+        fun_l16_n170(x)
+    end
+end
+
+def fun_l15_n720(x)
+    if (x < 1)
+        fun_l16_n420(x)
+    else
+        fun_l16_n504(x)
+    end
+end
+
+def fun_l15_n721(x)
+    if (x < 1)
+        fun_l16_n485(x)
+    else
+        fun_l16_n782(x)
+    end
+end
+
+def fun_l15_n722(x)
+    if (x < 1)
+        fun_l16_n607(x)
+    else
+        fun_l16_n706(x)
+    end
+end
+
+def fun_l15_n723(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n73(x)
+    end
+end
+
+def fun_l15_n724(x)
+    if (x < 1)
+        fun_l16_n946(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n725(x)
+    if (x < 1)
+        fun_l16_n73(x)
+    else
+        fun_l16_n223(x)
+    end
+end
+
+def fun_l15_n726(x)
+    if (x < 1)
+        fun_l16_n54(x)
+    else
+        fun_l16_n681(x)
+    end
+end
+
+def fun_l15_n727(x)
+    if (x < 1)
+        fun_l16_n474(x)
+    else
+        fun_l16_n339(x)
+    end
+end
+
+def fun_l15_n728(x)
+    if (x < 1)
+        fun_l16_n780(x)
+    else
+        fun_l16_n364(x)
+    end
+end
+
+def fun_l15_n729(x)
+    if (x < 1)
+        fun_l16_n537(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n730(x)
+    if (x < 1)
+        fun_l16_n81(x)
+    else
+        fun_l16_n591(x)
+    end
+end
+
+def fun_l15_n731(x)
+    if (x < 1)
+        fun_l16_n631(x)
+    else
+        fun_l16_n626(x)
+    end
+end
+
+def fun_l15_n732(x)
+    if (x < 1)
+        fun_l16_n904(x)
+    else
+        fun_l16_n988(x)
+    end
+end
+
+def fun_l15_n733(x)
+    if (x < 1)
+        fun_l16_n933(x)
+    else
+        fun_l16_n761(x)
+    end
+end
+
+def fun_l15_n734(x)
+    if (x < 1)
+        fun_l16_n687(x)
+    else
+        fun_l16_n611(x)
+    end
+end
+
+def fun_l15_n735(x)
+    if (x < 1)
+        fun_l16_n197(x)
+    else
+        fun_l16_n210(x)
+    end
+end
+
+def fun_l15_n736(x)
+    if (x < 1)
+        fun_l16_n227(x)
+    else
+        fun_l16_n82(x)
+    end
+end
+
+def fun_l15_n737(x)
+    if (x < 1)
+        fun_l16_n981(x)
+    else
+        fun_l16_n18(x)
+    end
+end
+
+def fun_l15_n738(x)
+    if (x < 1)
+        fun_l16_n673(x)
+    else
+        fun_l16_n452(x)
+    end
+end
+
+def fun_l15_n739(x)
+    if (x < 1)
+        fun_l16_n225(x)
+    else
+        fun_l16_n555(x)
+    end
+end
+
+def fun_l15_n740(x)
+    if (x < 1)
+        fun_l16_n409(x)
+    else
+        fun_l16_n29(x)
+    end
+end
+
+def fun_l15_n741(x)
+    if (x < 1)
+        fun_l16_n550(x)
+    else
+        fun_l16_n880(x)
+    end
+end
+
+def fun_l15_n742(x)
+    if (x < 1)
+        fun_l16_n930(x)
+    else
+        fun_l16_n280(x)
+    end
+end
+
+def fun_l15_n743(x)
+    if (x < 1)
+        fun_l16_n622(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n744(x)
+    if (x < 1)
+        fun_l16_n874(x)
+    else
+        fun_l16_n921(x)
+    end
+end
+
+def fun_l15_n745(x)
+    if (x < 1)
+        fun_l16_n337(x)
+    else
+        fun_l16_n879(x)
+    end
+end
+
+def fun_l15_n746(x)
+    if (x < 1)
+        fun_l16_n668(x)
+    else
+        fun_l16_n858(x)
+    end
+end
+
+def fun_l15_n747(x)
+    if (x < 1)
+        fun_l16_n588(x)
+    else
+        fun_l16_n433(x)
+    end
+end
+
+def fun_l15_n748(x)
+    if (x < 1)
+        fun_l16_n263(x)
+    else
+        fun_l16_n389(x)
+    end
+end
+
+def fun_l15_n749(x)
+    if (x < 1)
+        fun_l16_n79(x)
+    else
+        fun_l16_n218(x)
+    end
+end
+
+def fun_l15_n750(x)
+    if (x < 1)
+        fun_l16_n586(x)
+    else
+        fun_l16_n426(x)
+    end
+end
+
+def fun_l15_n751(x)
+    if (x < 1)
+        fun_l16_n29(x)
+    else
+        fun_l16_n183(x)
+    end
+end
+
+def fun_l15_n752(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n994(x)
+    end
+end
+
+def fun_l15_n753(x)
+    if (x < 1)
+        fun_l16_n176(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n754(x)
+    if (x < 1)
+        fun_l16_n58(x)
+    else
+        fun_l16_n980(x)
+    end
+end
+
+def fun_l15_n755(x)
+    if (x < 1)
+        fun_l16_n333(x)
+    else
+        fun_l16_n949(x)
+    end
+end
+
+def fun_l15_n756(x)
+    if (x < 1)
+        fun_l16_n846(x)
+    else
+        fun_l16_n449(x)
+    end
+end
+
+def fun_l15_n757(x)
+    if (x < 1)
+        fun_l16_n341(x)
+    else
+        fun_l16_n200(x)
+    end
+end
+
+def fun_l15_n758(x)
+    if (x < 1)
+        fun_l16_n32(x)
+    else
+        fun_l16_n271(x)
+    end
+end
+
+def fun_l15_n759(x)
+    if (x < 1)
+        fun_l16_n654(x)
+    else
+        fun_l16_n978(x)
+    end
+end
+
+def fun_l15_n760(x)
+    if (x < 1)
+        fun_l16_n438(x)
+    else
+        fun_l16_n426(x)
+    end
+end
+
+def fun_l15_n761(x)
+    if (x < 1)
+        fun_l16_n218(x)
+    else
+        fun_l16_n393(x)
+    end
+end
+
+def fun_l15_n762(x)
+    if (x < 1)
+        fun_l16_n873(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n763(x)
+    if (x < 1)
+        fun_l16_n957(x)
+    else
+        fun_l16_n801(x)
+    end
+end
+
+def fun_l15_n764(x)
+    if (x < 1)
+        fun_l16_n571(x)
+    else
+        fun_l16_n369(x)
+    end
+end
+
+def fun_l15_n765(x)
+    if (x < 1)
+        fun_l16_n806(x)
+    else
+        fun_l16_n527(x)
+    end
+end
+
+def fun_l15_n766(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n911(x)
+    end
+end
+
+def fun_l15_n767(x)
+    if (x < 1)
+        fun_l16_n589(x)
+    else
+        fun_l16_n468(x)
+    end
+end
+
+def fun_l15_n768(x)
+    if (x < 1)
+        fun_l16_n846(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n769(x)
+    if (x < 1)
+        fun_l16_n350(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n770(x)
+    if (x < 1)
+        fun_l16_n200(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n771(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n442(x)
+    end
+end
+
+def fun_l15_n772(x)
+    if (x < 1)
+        fun_l16_n768(x)
+    else
+        fun_l16_n303(x)
+    end
+end
+
+def fun_l15_n773(x)
+    if (x < 1)
+        fun_l16_n414(x)
+    else
+        fun_l16_n857(x)
+    end
+end
+
+def fun_l15_n774(x)
+    if (x < 1)
+        fun_l16_n654(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n775(x)
+    if (x < 1)
+        fun_l16_n283(x)
+    else
+        fun_l16_n565(x)
+    end
+end
+
+def fun_l15_n776(x)
+    if (x < 1)
+        fun_l16_n375(x)
+    else
+        fun_l16_n897(x)
+    end
+end
+
+def fun_l15_n777(x)
+    if (x < 1)
+        fun_l16_n711(x)
+    else
+        fun_l16_n487(x)
+    end
+end
+
+def fun_l15_n778(x)
+    if (x < 1)
+        fun_l16_n445(x)
+    else
+        fun_l16_n99(x)
+    end
+end
+
+def fun_l15_n779(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n614(x)
+    end
+end
+
+def fun_l15_n780(x)
+    if (x < 1)
+        fun_l16_n330(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n781(x)
+    if (x < 1)
+        fun_l16_n680(x)
+    else
+        fun_l16_n882(x)
+    end
+end
+
+def fun_l15_n782(x)
+    if (x < 1)
+        fun_l16_n799(x)
+    else
+        fun_l16_n511(x)
+    end
+end
+
+def fun_l15_n783(x)
+    if (x < 1)
+        fun_l16_n630(x)
+    else
+        fun_l16_n946(x)
+    end
+end
+
+def fun_l15_n784(x)
+    if (x < 1)
+        fun_l16_n867(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n785(x)
+    if (x < 1)
+        fun_l16_n154(x)
+    else
+        fun_l16_n400(x)
+    end
+end
+
+def fun_l15_n786(x)
+    if (x < 1)
+        fun_l16_n166(x)
+    else
+        fun_l16_n224(x)
+    end
+end
+
+def fun_l15_n787(x)
+    if (x < 1)
+        fun_l16_n120(x)
+    else
+        fun_l16_n518(x)
+    end
+end
+
+def fun_l15_n788(x)
+    if (x < 1)
+        fun_l16_n648(x)
+    else
+        fun_l16_n56(x)
+    end
+end
+
+def fun_l15_n789(x)
+    if (x < 1)
+        fun_l16_n965(x)
+    else
+        fun_l16_n760(x)
+    end
+end
+
+def fun_l15_n790(x)
+    if (x < 1)
+        fun_l16_n880(x)
+    else
+        fun_l16_n809(x)
+    end
+end
+
+def fun_l15_n791(x)
+    if (x < 1)
+        fun_l16_n836(x)
+    else
+        fun_l16_n61(x)
+    end
+end
+
+def fun_l15_n792(x)
+    if (x < 1)
+        fun_l16_n874(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n793(x)
+    if (x < 1)
+        fun_l16_n896(x)
+    else
+        fun_l16_n72(x)
+    end
+end
+
+def fun_l15_n794(x)
+    if (x < 1)
+        fun_l16_n994(x)
+    else
+        fun_l16_n411(x)
+    end
+end
+
+def fun_l15_n795(x)
+    if (x < 1)
+        fun_l16_n289(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n796(x)
+    if (x < 1)
+        fun_l16_n190(x)
+    else
+        fun_l16_n693(x)
+    end
+end
+
+def fun_l15_n797(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n955(x)
+    end
+end
+
+def fun_l15_n798(x)
+    if (x < 1)
+        fun_l16_n572(x)
+    else
+        fun_l16_n626(x)
+    end
+end
+
+def fun_l15_n799(x)
+    if (x < 1)
+        fun_l16_n35(x)
+    else
+        fun_l16_n838(x)
+    end
+end
+
+def fun_l15_n800(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n834(x)
+    end
+end
+
+def fun_l15_n801(x)
+    if (x < 1)
+        fun_l16_n964(x)
+    else
+        fun_l16_n824(x)
+    end
+end
+
+def fun_l15_n802(x)
+    if (x < 1)
+        fun_l16_n77(x)
+    else
+        fun_l16_n62(x)
+    end
+end
+
+def fun_l15_n803(x)
+    if (x < 1)
+        fun_l16_n226(x)
+    else
+        fun_l16_n373(x)
+    end
+end
+
+def fun_l15_n804(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n915(x)
+    end
+end
+
+def fun_l15_n805(x)
+    if (x < 1)
+        fun_l16_n421(x)
+    else
+        fun_l16_n621(x)
+    end
+end
+
+def fun_l15_n806(x)
+    if (x < 1)
+        fun_l16_n303(x)
+    else
+        fun_l16_n713(x)
+    end
+end
+
+def fun_l15_n807(x)
+    if (x < 1)
+        fun_l16_n393(x)
+    else
+        fun_l16_n698(x)
+    end
+end
+
+def fun_l15_n808(x)
+    if (x < 1)
+        fun_l16_n303(x)
+    else
+        fun_l16_n341(x)
+    end
+end
+
+def fun_l15_n809(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n976(x)
+    end
+end
+
+def fun_l15_n810(x)
+    if (x < 1)
+        fun_l16_n873(x)
+    else
+        fun_l16_n822(x)
+    end
+end
+
+def fun_l15_n811(x)
+    if (x < 1)
+        fun_l16_n358(x)
+    else
+        fun_l16_n334(x)
+    end
+end
+
+def fun_l15_n812(x)
+    if (x < 1)
+        fun_l16_n599(x)
+    else
+        fun_l16_n527(x)
+    end
+end
+
+def fun_l15_n813(x)
+    if (x < 1)
+        fun_l16_n842(x)
+    else
+        fun_l16_n791(x)
+    end
+end
+
+def fun_l15_n814(x)
+    if (x < 1)
+        fun_l16_n45(x)
+    else
+        fun_l16_n280(x)
+    end
+end
+
+def fun_l15_n815(x)
+    if (x < 1)
+        fun_l16_n187(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n816(x)
+    if (x < 1)
+        fun_l16_n8(x)
+    else
+        fun_l16_n409(x)
+    end
+end
+
+def fun_l15_n817(x)
+    if (x < 1)
+        fun_l16_n670(x)
+    else
+        fun_l16_n569(x)
+    end
+end
+
+def fun_l15_n818(x)
+    if (x < 1)
+        fun_l16_n344(x)
+    else
+        fun_l16_n618(x)
+    end
+end
+
+def fun_l15_n819(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n321(x)
+    end
+end
+
+def fun_l15_n820(x)
+    if (x < 1)
+        fun_l16_n890(x)
+    else
+        fun_l16_n911(x)
+    end
+end
+
+def fun_l15_n821(x)
+    if (x < 1)
+        fun_l16_n360(x)
+    else
+        fun_l16_n742(x)
+    end
+end
+
+def fun_l15_n822(x)
+    if (x < 1)
+        fun_l16_n166(x)
+    else
+        fun_l16_n803(x)
+    end
+end
+
+def fun_l15_n823(x)
+    if (x < 1)
+        fun_l16_n765(x)
+    else
+        fun_l16_n958(x)
+    end
+end
+
+def fun_l15_n824(x)
+    if (x < 1)
+        fun_l16_n439(x)
+    else
+        fun_l16_n931(x)
+    end
+end
+
+def fun_l15_n825(x)
+    if (x < 1)
+        fun_l16_n740(x)
+    else
+        fun_l16_n901(x)
+    end
+end
+
+def fun_l15_n826(x)
+    if (x < 1)
+        fun_l16_n223(x)
+    else
+        fun_l16_n878(x)
+    end
+end
+
+def fun_l15_n827(x)
+    if (x < 1)
+        fun_l16_n969(x)
+    else
+        fun_l16_n553(x)
+    end
+end
+
+def fun_l15_n828(x)
+    if (x < 1)
+        fun_l16_n42(x)
+    else
+        fun_l16_n915(x)
+    end
+end
+
+def fun_l15_n829(x)
+    if (x < 1)
+        fun_l16_n386(x)
+    else
+        fun_l16_n430(x)
+    end
+end
+
+def fun_l15_n830(x)
+    if (x < 1)
+        fun_l16_n164(x)
+    else
+        fun_l16_n337(x)
+    end
+end
+
+def fun_l15_n831(x)
+    if (x < 1)
+        fun_l16_n465(x)
+    else
+        fun_l16_n898(x)
+    end
+end
+
+def fun_l15_n832(x)
+    if (x < 1)
+        fun_l16_n145(x)
+    else
+        fun_l16_n688(x)
+    end
+end
+
+def fun_l15_n833(x)
+    if (x < 1)
+        fun_l16_n238(x)
+    else
+        fun_l16_n624(x)
+    end
+end
+
+def fun_l15_n834(x)
+    if (x < 1)
+        fun_l16_n973(x)
+    else
+        fun_l16_n507(x)
+    end
+end
+
+def fun_l15_n835(x)
+    if (x < 1)
+        fun_l16_n24(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n836(x)
+    if (x < 1)
+        fun_l16_n307(x)
+    else
+        fun_l16_n265(x)
+    end
+end
+
+def fun_l15_n837(x)
+    if (x < 1)
+        fun_l16_n91(x)
+    else
+        fun_l16_n543(x)
+    end
+end
+
+def fun_l15_n838(x)
+    if (x < 1)
+        fun_l16_n544(x)
+    else
+        fun_l16_n397(x)
+    end
+end
+
+def fun_l15_n839(x)
+    if (x < 1)
+        fun_l16_n121(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n840(x)
+    if (x < 1)
+        fun_l16_n806(x)
+    else
+        fun_l16_n831(x)
+    end
+end
+
+def fun_l15_n841(x)
+    if (x < 1)
+        fun_l16_n629(x)
+    else
+        fun_l16_n553(x)
+    end
+end
+
+def fun_l15_n842(x)
+    if (x < 1)
+        fun_l16_n674(x)
+    else
+        fun_l16_n945(x)
+    end
+end
+
+def fun_l15_n843(x)
+    if (x < 1)
+        fun_l16_n409(x)
+    else
+        fun_l16_n469(x)
+    end
+end
+
+def fun_l15_n844(x)
+    if (x < 1)
+        fun_l16_n779(x)
+    else
+        fun_l16_n168(x)
+    end
+end
+
+def fun_l15_n845(x)
+    if (x < 1)
+        fun_l16_n258(x)
+    else
+        fun_l16_n501(x)
+    end
+end
+
+def fun_l15_n846(x)
+    if (x < 1)
+        fun_l16_n408(x)
+    else
+        fun_l16_n211(x)
+    end
+end
+
+def fun_l15_n847(x)
+    if (x < 1)
+        fun_l16_n844(x)
+    else
+        fun_l16_n458(x)
+    end
+end
+
+def fun_l15_n848(x)
+    if (x < 1)
+        fun_l16_n565(x)
+    else
+        fun_l16_n177(x)
+    end
+end
+
+def fun_l15_n849(x)
+    if (x < 1)
+        fun_l16_n111(x)
+    else
+        fun_l16_n995(x)
+    end
+end
+
+def fun_l15_n850(x)
+    if (x < 1)
+        fun_l16_n883(x)
+    else
+        fun_l16_n776(x)
+    end
+end
+
+def fun_l15_n851(x)
+    if (x < 1)
+        fun_l16_n821(x)
+    else
+        fun_l16_n352(x)
+    end
+end
+
+def fun_l15_n852(x)
+    if (x < 1)
+        fun_l16_n977(x)
+    else
+        fun_l16_n520(x)
+    end
+end
+
+def fun_l15_n853(x)
+    if (x < 1)
+        fun_l16_n602(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n854(x)
+    if (x < 1)
+        fun_l16_n819(x)
+    else
+        fun_l16_n177(x)
+    end
+end
+
+def fun_l15_n855(x)
+    if (x < 1)
+        fun_l16_n878(x)
+    else
+        fun_l16_n648(x)
+    end
+end
+
+def fun_l15_n856(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n134(x)
+    end
+end
+
+def fun_l15_n857(x)
+    if (x < 1)
+        fun_l16_n728(x)
+    else
+        fun_l16_n282(x)
+    end
+end
+
+def fun_l15_n858(x)
+    if (x < 1)
+        fun_l16_n152(x)
+    else
+        fun_l16_n725(x)
+    end
+end
+
+def fun_l15_n859(x)
+    if (x < 1)
+        fun_l16_n140(x)
+    else
+        fun_l16_n12(x)
+    end
+end
+
+def fun_l15_n860(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n159(x)
+    end
+end
+
+def fun_l15_n861(x)
+    if (x < 1)
+        fun_l16_n366(x)
+    else
+        fun_l16_n97(x)
+    end
+end
+
+def fun_l15_n862(x)
+    if (x < 1)
+        fun_l16_n812(x)
+    else
+        fun_l16_n178(x)
+    end
+end
+
+def fun_l15_n863(x)
+    if (x < 1)
+        fun_l16_n491(x)
+    else
+        fun_l16_n167(x)
+    end
+end
+
+def fun_l15_n864(x)
+    if (x < 1)
+        fun_l16_n280(x)
+    else
+        fun_l16_n463(x)
+    end
+end
+
+def fun_l15_n865(x)
+    if (x < 1)
+        fun_l16_n405(x)
+    else
+        fun_l16_n108(x)
+    end
+end
+
+def fun_l15_n866(x)
+    if (x < 1)
+        fun_l16_n956(x)
+    else
+        fun_l16_n840(x)
+    end
+end
+
+def fun_l15_n867(x)
+    if (x < 1)
+        fun_l16_n866(x)
+    else
+        fun_l16_n291(x)
+    end
+end
+
+def fun_l15_n868(x)
+    if (x < 1)
+        fun_l16_n176(x)
+    else
+        fun_l16_n192(x)
+    end
+end
+
+def fun_l15_n869(x)
+    if (x < 1)
+        fun_l16_n833(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n870(x)
+    if (x < 1)
+        fun_l16_n648(x)
+    else
+        fun_l16_n778(x)
+    end
+end
+
+def fun_l15_n871(x)
+    if (x < 1)
+        fun_l16_n237(x)
+    else
+        fun_l16_n206(x)
+    end
+end
+
+def fun_l15_n872(x)
+    if (x < 1)
+        fun_l16_n676(x)
+    else
+        fun_l16_n868(x)
+    end
+end
+
+def fun_l15_n873(x)
+    if (x < 1)
+        fun_l16_n547(x)
+    else
+        fun_l16_n731(x)
+    end
+end
+
+def fun_l15_n874(x)
+    if (x < 1)
+        fun_l16_n870(x)
+    else
+        fun_l16_n43(x)
+    end
+end
+
+def fun_l15_n875(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n654(x)
+    end
+end
+
+def fun_l15_n876(x)
+    if (x < 1)
+        fun_l16_n570(x)
+    else
+        fun_l16_n842(x)
+    end
+end
+
+def fun_l15_n877(x)
+    if (x < 1)
+        fun_l16_n272(x)
+    else
+        fun_l16_n784(x)
+    end
+end
+
+def fun_l15_n878(x)
+    if (x < 1)
+        fun_l16_n702(x)
+    else
+        fun_l16_n758(x)
+    end
+end
+
+def fun_l15_n879(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n303(x)
+    end
+end
+
+def fun_l15_n880(x)
+    if (x < 1)
+        fun_l16_n944(x)
+    else
+        fun_l16_n449(x)
+    end
+end
+
+def fun_l15_n881(x)
+    if (x < 1)
+        fun_l16_n741(x)
+    else
+        fun_l16_n254(x)
+    end
+end
+
+def fun_l15_n882(x)
+    if (x < 1)
+        fun_l16_n195(x)
+    else
+        fun_l16_n294(x)
+    end
+end
+
+def fun_l15_n883(x)
+    if (x < 1)
+        fun_l16_n776(x)
+    else
+        fun_l16_n147(x)
+    end
+end
+
+def fun_l15_n884(x)
+    if (x < 1)
+        fun_l16_n145(x)
+    else
+        fun_l16_n856(x)
+    end
+end
+
+def fun_l15_n885(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n429(x)
+    end
+end
+
+def fun_l15_n886(x)
+    if (x < 1)
+        fun_l16_n72(x)
+    else
+        fun_l16_n455(x)
+    end
+end
+
+def fun_l15_n887(x)
+    if (x < 1)
+        fun_l16_n775(x)
+    else
+        fun_l16_n43(x)
+    end
+end
+
+def fun_l15_n888(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n642(x)
+    end
+end
+
+def fun_l15_n889(x)
+    if (x < 1)
+        fun_l16_n794(x)
+    else
+        fun_l16_n277(x)
+    end
+end
+
+def fun_l15_n890(x)
+    if (x < 1)
+        fun_l16_n72(x)
+    else
+        fun_l16_n450(x)
+    end
+end
+
+def fun_l15_n891(x)
+    if (x < 1)
+        fun_l16_n417(x)
+    else
+        fun_l16_n5(x)
+    end
+end
+
+def fun_l15_n892(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n355(x)
+    end
+end
+
+def fun_l15_n893(x)
+    if (x < 1)
+        fun_l16_n352(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n894(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n16(x)
+    end
+end
+
+def fun_l15_n895(x)
+    if (x < 1)
+        fun_l16_n922(x)
+    else
+        fun_l16_n440(x)
+    end
+end
+
+def fun_l15_n896(x)
+    if (x < 1)
+        fun_l16_n808(x)
+    else
+        fun_l16_n896(x)
+    end
+end
+
+def fun_l15_n897(x)
+    if (x < 1)
+        fun_l16_n736(x)
+    else
+        fun_l16_n596(x)
+    end
+end
+
+def fun_l15_n898(x)
+    if (x < 1)
+        fun_l16_n886(x)
+    else
+        fun_l16_n386(x)
+    end
+end
+
+def fun_l15_n899(x)
+    if (x < 1)
+        fun_l16_n374(x)
+    else
+        fun_l16_n746(x)
+    end
+end
+
+def fun_l15_n900(x)
+    if (x < 1)
+        fun_l16_n623(x)
+    else
+        fun_l16_n329(x)
+    end
+end
+
+def fun_l15_n901(x)
+    if (x < 1)
+        fun_l16_n313(x)
+    else
+        fun_l16_n102(x)
+    end
+end
+
+def fun_l15_n902(x)
+    if (x < 1)
+        fun_l16_n234(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n903(x)
+    if (x < 1)
+        fun_l16_n836(x)
+    else
+        fun_l16_n492(x)
+    end
+end
+
+def fun_l15_n904(x)
+    if (x < 1)
+        fun_l16_n690(x)
+    else
+        fun_l16_n241(x)
+    end
+end
+
+def fun_l15_n905(x)
+    if (x < 1)
+        fun_l16_n129(x)
+    else
+        fun_l16_n57(x)
+    end
+end
+
+def fun_l15_n906(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n24(x)
+    end
+end
+
+def fun_l15_n907(x)
+    if (x < 1)
+        fun_l16_n609(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n908(x)
+    if (x < 1)
+        fun_l16_n483(x)
+    else
+        fun_l16_n708(x)
+    end
+end
+
+def fun_l15_n909(x)
+    if (x < 1)
+        fun_l16_n656(x)
+    else
+        fun_l16_n234(x)
+    end
+end
+
+def fun_l15_n910(x)
+    if (x < 1)
+        fun_l16_n945(x)
+    else
+        fun_l16_n753(x)
+    end
+end
+
+def fun_l15_n911(x)
+    if (x < 1)
+        fun_l16_n152(x)
+    else
+        fun_l16_n739(x)
+    end
+end
+
+def fun_l15_n912(x)
+    if (x < 1)
+        fun_l16_n855(x)
+    else
+        fun_l16_n518(x)
+    end
+end
+
+def fun_l15_n913(x)
+    if (x < 1)
+        fun_l16_n295(x)
+    else
+        fun_l16_n719(x)
+    end
+end
+
+def fun_l15_n914(x)
+    if (x < 1)
+        fun_l16_n442(x)
+    else
+        fun_l16_n803(x)
+    end
+end
+
+def fun_l15_n915(x)
+    if (x < 1)
+        fun_l16_n672(x)
+    else
+        fun_l16_n935(x)
+    end
+end
+
+def fun_l15_n916(x)
+    if (x < 1)
+        fun_l16_n908(x)
+    else
+        fun_l16_n900(x)
+    end
+end
+
+def fun_l15_n917(x)
+    if (x < 1)
+        fun_l16_n853(x)
+    else
+        fun_l16_n896(x)
+    end
+end
+
+def fun_l15_n918(x)
+    if (x < 1)
+        fun_l16_n90(x)
+    else
+        fun_l16_n56(x)
+    end
+end
+
+def fun_l15_n919(x)
+    if (x < 1)
+        fun_l16_n944(x)
+    else
+        fun_l16_n763(x)
+    end
+end
+
+def fun_l15_n920(x)
+    if (x < 1)
+        fun_l16_n303(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n921(x)
+    if (x < 1)
+        fun_l16_n599(x)
+    else
+        fun_l16_n648(x)
+    end
+end
+
+def fun_l15_n922(x)
+    if (x < 1)
+        fun_l16_n113(x)
+    else
+        fun_l16_n665(x)
+    end
+end
+
+def fun_l15_n923(x)
+    if (x < 1)
+        fun_l16_n97(x)
+    else
+        fun_l16_n757(x)
+    end
+end
+
+def fun_l15_n924(x)
+    if (x < 1)
+        fun_l16_n815(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n925(x)
+    if (x < 1)
+        fun_l16_n146(x)
+    else
+        fun_l16_n970(x)
+    end
+end
+
+def fun_l15_n926(x)
+    if (x < 1)
+        fun_l16_n74(x)
+    else
+        fun_l16_n203(x)
+    end
+end
+
+def fun_l15_n927(x)
+    if (x < 1)
+        fun_l16_n573(x)
+    else
+        fun_l16_n763(x)
+    end
+end
+
+def fun_l15_n928(x)
+    if (x < 1)
+        fun_l16_n656(x)
+    else
+        fun_l16_n691(x)
+    end
+end
+
+def fun_l15_n929(x)
+    if (x < 1)
+        fun_l16_n240(x)
+    else
+        fun_l16_n536(x)
+    end
+end
+
+def fun_l15_n930(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n145(x)
+    end
+end
+
+def fun_l15_n931(x)
+    if (x < 1)
+        fun_l16_n502(x)
+    else
+        fun_l16_n603(x)
+    end
+end
+
+def fun_l15_n932(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n259(x)
+    end
+end
+
+def fun_l15_n933(x)
+    if (x < 1)
+        fun_l16_n633(x)
+    else
+        fun_l16_n66(x)
+    end
+end
+
+def fun_l15_n934(x)
+    if (x < 1)
+        fun_l16_n657(x)
+    else
+        fun_l16_n727(x)
+    end
+end
+
+def fun_l15_n935(x)
+    if (x < 1)
+        fun_l16_n641(x)
+    else
+        fun_l16_n975(x)
+    end
+end
+
+def fun_l15_n936(x)
+    if (x < 1)
+        fun_l16_n610(x)
+    else
+        fun_l16_n256(x)
+    end
+end
+
+def fun_l15_n937(x)
+    if (x < 1)
+        fun_l16_n760(x)
+    else
+        fun_l16_n304(x)
+    end
+end
+
+def fun_l15_n938(x)
+    if (x < 1)
+        fun_l16_n395(x)
+    else
+        fun_l16_n302(x)
+    end
+end
+
+def fun_l15_n939(x)
+    if (x < 1)
+        fun_l16_n810(x)
+    else
+        fun_l16_n549(x)
+    end
+end
+
+def fun_l15_n940(x)
+    if (x < 1)
+        fun_l16_n452(x)
+    else
+        fun_l16_n914(x)
+    end
+end
+
+def fun_l15_n941(x)
+    if (x < 1)
+        fun_l16_n472(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n942(x)
+    if (x < 1)
+        fun_l16_n886(x)
+    else
+        fun_l16_n535(x)
+    end
+end
+
+def fun_l15_n943(x)
+    if (x < 1)
+        fun_l16_n162(x)
+    else
+        fun_l16_n449(x)
+    end
+end
+
+def fun_l15_n944(x)
+    if (x < 1)
+        fun_l16_n152(x)
+    else
+        fun_l16_n790(x)
+    end
+end
+
+def fun_l15_n945(x)
+    if (x < 1)
+        fun_l16_n228(x)
+    else
+        fun_l16_n391(x)
+    end
+end
+
+def fun_l15_n946(x)
+    if (x < 1)
+        fun_l16_n115(x)
+    else
+        fun_l16_n371(x)
+    end
+end
+
+def fun_l15_n947(x)
+    if (x < 1)
+        fun_l16_n359(x)
+    else
+        fun_l16_n928(x)
+    end
+end
+
+def fun_l15_n948(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n907(x)
+    end
+end
+
+def fun_l15_n949(x)
+    if (x < 1)
+        fun_l16_n448(x)
+    else
+        fun_l16_n845(x)
+    end
+end
+
+def fun_l15_n950(x)
+    if (x < 1)
+        fun_l16_n457(x)
+    else
+        fun_l16_n954(x)
+    end
+end
+
+def fun_l15_n951(x)
+    if (x < 1)
+        fun_l16_n627(x)
+    else
+        fun_l16_n684(x)
+    end
+end
+
+def fun_l15_n952(x)
+    if (x < 1)
+        fun_l16_n887(x)
+    else
+        fun_l16_n928(x)
+    end
+end
+
+def fun_l15_n953(x)
+    if (x < 1)
+        fun_l16_n782(x)
+    else
+        fun_l16_n619(x)
+    end
+end
+
+def fun_l15_n954(x)
+    if (x < 1)
+        fun_l16_n436(x)
+    else
+        fun_l16_n745(x)
+    end
+end
+
+def fun_l15_n955(x)
+    if (x < 1)
+        fun_l16_n9(x)
+    else
+        fun_l16_n604(x)
+    end
+end
+
+def fun_l15_n956(x)
+    if (x < 1)
+        fun_l16_n149(x)
+    else
+        fun_l16_n357(x)
+    end
+end
+
+def fun_l15_n957(x)
+    if (x < 1)
+        fun_l16_n664(x)
+    else
+        fun_l16_n371(x)
+    end
+end
+
+def fun_l15_n958(x)
+    if (x < 1)
+        fun_l16_n236(x)
+    else
+        fun_l16_n402(x)
+    end
+end
+
+def fun_l15_n959(x)
+    if (x < 1)
+        fun_l16_n681(x)
+    else
+        fun_l16_n410(x)
+    end
+end
+
+def fun_l15_n960(x)
+    if (x < 1)
+        fun_l16_n909(x)
+    else
+        fun_l16_n958(x)
+    end
+end
+
+def fun_l15_n961(x)
+    if (x < 1)
+        fun_l16_n400(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n962(x)
+    if (x < 1)
+        fun_l16_n949(x)
+    else
+        fun_l16_n794(x)
+    end
+end
+
+def fun_l15_n963(x)
+    if (x < 1)
+        fun_l16_n774(x)
+    else
+        fun_l16_n770(x)
+    end
+end
+
+def fun_l15_n964(x)
+    if (x < 1)
+        fun_l16_n573(x)
+    else
+        fun_l16_n73(x)
+    end
+end
+
+def fun_l15_n965(x)
+    if (x < 1)
+        fun_l16_n33(x)
+    else
+        fun_l16_n978(x)
+    end
+end
+
+def fun_l15_n966(x)
+    if (x < 1)
+        fun_l16_n8(x)
+    else
+        fun_l16_n542(x)
+    end
+end
+
+def fun_l15_n967(x)
+    if (x < 1)
+        fun_l16_n780(x)
+    else
+        fun_l16_n96(x)
+    end
+end
+
+def fun_l15_n968(x)
+    if (x < 1)
+        fun_l16_n75(x)
+    else
+        fun_l16_n560(x)
+    end
+end
+
+def fun_l15_n969(x)
+    if (x < 1)
+        fun_l16_n950(x)
+    else
+        fun_l16_n610(x)
+    end
+end
+
+def fun_l15_n970(x)
+    if (x < 1)
+        fun_l16_n254(x)
+    else
+        fun_l16_n2(x)
+    end
+end
+
+def fun_l15_n971(x)
+    if (x < 1)
+        fun_l16_n793(x)
+    else
+        fun_l16_n89(x)
+    end
+end
+
+def fun_l15_n972(x)
+    if (x < 1)
+        fun_l16_n409(x)
+    else
+        fun_l16_n967(x)
+    end
+end
+
+def fun_l15_n973(x)
+    if (x < 1)
+        fun_l16_n356(x)
+    else
+        fun_l16_n421(x)
+    end
+end
+
+def fun_l15_n974(x)
+    if (x < 1)
+        fun_l16_n539(x)
+    else
+        fun_l16_n997(x)
+    end
+end
+
+def fun_l15_n975(x)
+    if (x < 1)
+        fun_l16_n772(x)
+    else
+        fun_l16_n304(x)
+    end
+end
+
+def fun_l15_n976(x)
+    if (x < 1)
+        fun_l16_n228(x)
+    else
+        fun_l16_n420(x)
+    end
+end
+
+def fun_l15_n977(x)
+    if (x < 1)
+        fun_l16_n508(x)
+    else
+        fun_l16_n352(x)
+    end
+end
+
+def fun_l15_n978(x)
+    if (x < 1)
+        fun_l16_n878(x)
+    else
+        fun_l16_n316(x)
+    end
+end
+
+def fun_l15_n979(x)
+    if (x < 1)
+        fun_l16_n279(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n980(x)
+    if (x < 1)
+        fun_l16_n98(x)
+    else
+        fun_l16_n10(x)
+    end
+end
+
+def fun_l15_n981(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n578(x)
+    end
+end
+
+def fun_l15_n982(x)
+    if (x < 1)
+        fun_l16_n112(x)
+    else
+        fun_l16_n353(x)
+    end
+end
+
+def fun_l15_n983(x)
+    if (x < 1)
+        fun_l16_n579(x)
+    else
+        fun_l16_n946(x)
+    end
+end
+
+def fun_l15_n984(x)
+    if (x < 1)
+        fun_l16_n183(x)
+    else
+        fun_l16_n638(x)
+    end
+end
+
+def fun_l15_n985(x)
+    if (x < 1)
+        fun_l16_n500(x)
+    else
+        fun_l16_n11(x)
+    end
+end
+
+def fun_l15_n986(x)
+    if (x < 1)
+        fun_l16_n773(x)
+    else
+        fun_l16_n135(x)
+    end
+end
+
+def fun_l15_n987(x)
+    if (x < 1)
+        fun_l16_n997(x)
+    else
+        fun_l16_n645(x)
+    end
+end
+
+def fun_l15_n988(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n172(x)
+    end
+end
+
+def fun_l15_n989(x)
+    if (x < 1)
+        fun_l16_n150(x)
+    else
+        fun_l16_n163(x)
+    end
+end
+
+def fun_l15_n990(x)
+    if (x < 1)
+        fun_l16_n351(x)
+    else
+        fun_l16_n297(x)
+    end
+end
+
+def fun_l15_n991(x)
+    if (x < 1)
+        fun_l16_n676(x)
+    else
+        fun_l16_n31(x)
+    end
+end
+
+def fun_l15_n992(x)
+    if (x < 1)
+        fun_l16_n257(x)
+    else
+        fun_l16_n45(x)
+    end
+end
+
+def fun_l15_n993(x)
+    if (x < 1)
+        fun_l16_n971(x)
+    else
+        fun_l16_n60(x)
+    end
+end
+
+def fun_l15_n994(x)
+    if (x < 1)
+        fun_l16_n472(x)
+    else
+        fun_l16_n774(x)
+    end
+end
+
+def fun_l15_n995(x)
+    if (x < 1)
+        fun_l16_n559(x)
+    else
+        fun_l16_n605(x)
+    end
+end
+
+def fun_l15_n996(x)
+    if (x < 1)
+        fun_l16_n122(x)
+    else
+        fun_l16_n695(x)
+    end
+end
+
+def fun_l15_n997(x)
+    if (x < 1)
+        fun_l16_n118(x)
+    else
+        fun_l16_n613(x)
+    end
+end
+
+def fun_l15_n998(x)
+    if (x < 1)
+        fun_l16_n973(x)
+    else
+        fun_l16_n193(x)
+    end
+end
+
+def fun_l15_n999(x)
+    if (x < 1)
+        fun_l16_n652(x)
+    else
+        fun_l16_n658(x)
+    end
+end
+
+def fun_l16_n0(x)
+    if (x < 1)
+        fun_l17_n352(x)
+    else
+        fun_l17_n155(x)
+    end
+end
+
+def fun_l16_n1(x)
+    if (x < 1)
+        fun_l17_n786(x)
+    else
+        fun_l17_n961(x)
+    end
+end
+
+def fun_l16_n2(x)
+    if (x < 1)
+        fun_l17_n760(x)
+    else
+        fun_l17_n629(x)
+    end
+end
+
+def fun_l16_n3(x)
+    if (x < 1)
+        fun_l17_n788(x)
+    else
+        fun_l17_n70(x)
+    end
+end
+
+def fun_l16_n4(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n616(x)
+    end
+end
+
+def fun_l16_n5(x)
+    if (x < 1)
+        fun_l17_n470(x)
+    else
+        fun_l17_n859(x)
+    end
+end
+
+def fun_l16_n6(x)
+    if (x < 1)
+        fun_l17_n830(x)
+    else
+        fun_l17_n987(x)
+    end
+end
+
+def fun_l16_n7(x)
+    if (x < 1)
+        fun_l17_n339(x)
+    else
+        fun_l17_n284(x)
+    end
+end
+
+def fun_l16_n8(x)
+    if (x < 1)
+        fun_l17_n677(x)
+    else
+        fun_l17_n77(x)
+    end
+end
+
+def fun_l16_n9(x)
+    if (x < 1)
+        fun_l17_n7(x)
+    else
+        fun_l17_n159(x)
+    end
+end
+
+def fun_l16_n10(x)
+    if (x < 1)
+        fun_l17_n275(x)
+    else
+        fun_l17_n37(x)
+    end
+end
+
+def fun_l16_n11(x)
+    if (x < 1)
+        fun_l17_n406(x)
+    else
+        fun_l17_n588(x)
+    end
+end
+
+def fun_l16_n12(x)
+    if (x < 1)
+        fun_l17_n132(x)
+    else
+        fun_l17_n208(x)
+    end
+end
+
+def fun_l16_n13(x)
+    if (x < 1)
+        fun_l17_n87(x)
+    else
+        fun_l17_n850(x)
+    end
+end
+
+def fun_l16_n14(x)
+    if (x < 1)
+        fun_l17_n965(x)
+    else
+        fun_l17_n106(x)
+    end
+end
+
+def fun_l16_n15(x)
+    if (x < 1)
+        fun_l17_n176(x)
+    else
+        fun_l17_n966(x)
+    end
+end
+
+def fun_l16_n16(x)
+    if (x < 1)
+        fun_l17_n825(x)
+    else
+        fun_l17_n815(x)
+    end
+end
+
+def fun_l16_n17(x)
+    if (x < 1)
+        fun_l17_n939(x)
+    else
+        fun_l17_n591(x)
+    end
+end
+
+def fun_l16_n18(x)
+    if (x < 1)
+        fun_l17_n166(x)
+    else
+        fun_l17_n732(x)
+    end
+end
+
+def fun_l16_n19(x)
+    if (x < 1)
+        fun_l17_n471(x)
+    else
+        fun_l17_n175(x)
+    end
+end
+
+def fun_l16_n20(x)
+    if (x < 1)
+        fun_l17_n887(x)
+    else
+        fun_l17_n304(x)
+    end
+end
+
+def fun_l16_n21(x)
+    if (x < 1)
+        fun_l17_n545(x)
+    else
+        fun_l17_n221(x)
+    end
+end
+
+def fun_l16_n22(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n143(x)
+    end
+end
+
+def fun_l16_n23(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n902(x)
+    end
+end
+
+def fun_l16_n24(x)
+    if (x < 1)
+        fun_l17_n490(x)
+    else
+        fun_l17_n327(x)
+    end
+end
+
+def fun_l16_n25(x)
+    if (x < 1)
+        fun_l17_n588(x)
+    else
+        fun_l17_n658(x)
+    end
+end
+
+def fun_l16_n26(x)
+    if (x < 1)
+        fun_l17_n555(x)
+    else
+        fun_l17_n507(x)
+    end
+end
+
+def fun_l16_n27(x)
+    if (x < 1)
+        fun_l17_n228(x)
+    else
+        fun_l17_n808(x)
+    end
+end
+
+def fun_l16_n28(x)
+    if (x < 1)
+        fun_l17_n705(x)
+    else
+        fun_l17_n696(x)
+    end
+end
+
+def fun_l16_n29(x)
+    if (x < 1)
+        fun_l17_n711(x)
+    else
+        fun_l17_n913(x)
+    end
+end
+
+def fun_l16_n30(x)
+    if (x < 1)
+        fun_l17_n264(x)
+    else
+        fun_l17_n287(x)
+    end
+end
+
+def fun_l16_n31(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n358(x)
+    end
+end
+
+def fun_l16_n32(x)
+    if (x < 1)
+        fun_l17_n102(x)
+    else
+        fun_l17_n303(x)
+    end
+end
+
+def fun_l16_n33(x)
+    if (x < 1)
+        fun_l17_n613(x)
+    else
+        fun_l17_n921(x)
+    end
+end
+
+def fun_l16_n34(x)
+    if (x < 1)
+        fun_l17_n637(x)
+    else
+        fun_l17_n142(x)
+    end
+end
+
+def fun_l16_n35(x)
+    if (x < 1)
+        fun_l17_n8(x)
+    else
+        fun_l17_n752(x)
+    end
+end
+
+def fun_l16_n36(x)
+    if (x < 1)
+        fun_l17_n748(x)
+    else
+        fun_l17_n956(x)
+    end
+end
+
+def fun_l16_n37(x)
+    if (x < 1)
+        fun_l17_n985(x)
+    else
+        fun_l17_n133(x)
+    end
+end
+
+def fun_l16_n38(x)
+    if (x < 1)
+        fun_l17_n422(x)
+    else
+        fun_l17_n608(x)
+    end
+end
+
+def fun_l16_n39(x)
+    if (x < 1)
+        fun_l17_n455(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n40(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n874(x)
+    end
+end
+
+def fun_l16_n41(x)
+    if (x < 1)
+        fun_l17_n299(x)
+    else
+        fun_l17_n971(x)
+    end
+end
+
+def fun_l16_n42(x)
+    if (x < 1)
+        fun_l17_n788(x)
+    else
+        fun_l17_n535(x)
+    end
+end
+
+def fun_l16_n43(x)
+    if (x < 1)
+        fun_l17_n282(x)
+    else
+        fun_l17_n468(x)
+    end
+end
+
+def fun_l16_n44(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n931(x)
+    end
+end
+
+def fun_l16_n45(x)
+    if (x < 1)
+        fun_l17_n750(x)
+    else
+        fun_l17_n725(x)
+    end
+end
+
+def fun_l16_n46(x)
+    if (x < 1)
+        fun_l17_n227(x)
+    else
+        fun_l17_n769(x)
+    end
+end
+
+def fun_l16_n47(x)
+    if (x < 1)
+        fun_l17_n348(x)
+    else
+        fun_l17_n83(x)
+    end
+end
+
+def fun_l16_n48(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n398(x)
+    end
+end
+
+def fun_l16_n49(x)
+    if (x < 1)
+        fun_l17_n645(x)
+    else
+        fun_l17_n645(x)
+    end
+end
+
+def fun_l16_n50(x)
+    if (x < 1)
+        fun_l17_n191(x)
+    else
+        fun_l17_n256(x)
+    end
+end
+
+def fun_l16_n51(x)
+    if (x < 1)
+        fun_l17_n947(x)
+    else
+        fun_l17_n188(x)
+    end
+end
+
+def fun_l16_n52(x)
+    if (x < 1)
+        fun_l17_n135(x)
+    else
+        fun_l17_n923(x)
+    end
+end
+
+def fun_l16_n53(x)
+    if (x < 1)
+        fun_l17_n867(x)
+    else
+        fun_l17_n520(x)
+    end
+end
+
+def fun_l16_n54(x)
+    if (x < 1)
+        fun_l17_n450(x)
+    else
+        fun_l17_n864(x)
+    end
+end
+
+def fun_l16_n55(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n370(x)
+    end
+end
+
+def fun_l16_n56(x)
+    if (x < 1)
+        fun_l17_n754(x)
+    else
+        fun_l17_n919(x)
+    end
+end
+
+def fun_l16_n57(x)
+    if (x < 1)
+        fun_l17_n360(x)
+    else
+        fun_l17_n513(x)
+    end
+end
+
+def fun_l16_n58(x)
+    if (x < 1)
+        fun_l17_n436(x)
+    else
+        fun_l17_n618(x)
+    end
+end
+
+def fun_l16_n59(x)
+    if (x < 1)
+        fun_l17_n795(x)
+    else
+        fun_l17_n851(x)
+    end
+end
+
+def fun_l16_n60(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n305(x)
+    end
+end
+
+def fun_l16_n61(x)
+    if (x < 1)
+        fun_l17_n520(x)
+    else
+        fun_l17_n360(x)
+    end
+end
+
+def fun_l16_n62(x)
+    if (x < 1)
+        fun_l17_n297(x)
+    else
+        fun_l17_n218(x)
+    end
+end
+
+def fun_l16_n63(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n888(x)
+    end
+end
+
+def fun_l16_n64(x)
+    if (x < 1)
+        fun_l17_n800(x)
+    else
+        fun_l17_n985(x)
+    end
+end
+
+def fun_l16_n65(x)
+    if (x < 1)
+        fun_l17_n875(x)
+    else
+        fun_l17_n821(x)
+    end
+end
+
+def fun_l16_n66(x)
+    if (x < 1)
+        fun_l17_n677(x)
+    else
+        fun_l17_n705(x)
+    end
+end
+
+def fun_l16_n67(x)
+    if (x < 1)
+        fun_l17_n643(x)
+    else
+        fun_l17_n240(x)
+    end
+end
+
+def fun_l16_n68(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n885(x)
+    end
+end
+
+def fun_l16_n69(x)
+    if (x < 1)
+        fun_l17_n987(x)
+    else
+        fun_l17_n611(x)
+    end
+end
+
+def fun_l16_n70(x)
+    if (x < 1)
+        fun_l17_n546(x)
+    else
+        fun_l17_n95(x)
+    end
+end
+
+def fun_l16_n71(x)
+    if (x < 1)
+        fun_l17_n301(x)
+    else
+        fun_l17_n260(x)
+    end
+end
+
+def fun_l16_n72(x)
+    if (x < 1)
+        fun_l17_n118(x)
+    else
+        fun_l17_n110(x)
+    end
+end
+
+def fun_l16_n73(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n602(x)
+    end
+end
+
+def fun_l16_n74(x)
+    if (x < 1)
+        fun_l17_n725(x)
+    else
+        fun_l17_n606(x)
+    end
+end
+
+def fun_l16_n75(x)
+    if (x < 1)
+        fun_l17_n114(x)
+    else
+        fun_l17_n336(x)
+    end
+end
+
+def fun_l16_n76(x)
+    if (x < 1)
+        fun_l17_n930(x)
+    else
+        fun_l17_n513(x)
+    end
+end
+
+def fun_l16_n77(x)
+    if (x < 1)
+        fun_l17_n217(x)
+    else
+        fun_l17_n158(x)
+    end
+end
+
+def fun_l16_n78(x)
+    if (x < 1)
+        fun_l17_n987(x)
+    else
+        fun_l17_n538(x)
+    end
+end
+
+def fun_l16_n79(x)
+    if (x < 1)
+        fun_l17_n467(x)
+    else
+        fun_l17_n675(x)
+    end
+end
+
+def fun_l16_n80(x)
+    if (x < 1)
+        fun_l17_n553(x)
+    else
+        fun_l17_n77(x)
+    end
+end
+
+def fun_l16_n81(x)
+    if (x < 1)
+        fun_l17_n643(x)
+    else
+        fun_l17_n156(x)
+    end
+end
+
+def fun_l16_n82(x)
+    if (x < 1)
+        fun_l17_n858(x)
+    else
+        fun_l17_n300(x)
+    end
+end
+
+def fun_l16_n83(x)
+    if (x < 1)
+        fun_l17_n136(x)
+    else
+        fun_l17_n637(x)
+    end
+end
+
+def fun_l16_n84(x)
+    if (x < 1)
+        fun_l17_n71(x)
+    else
+        fun_l17_n979(x)
+    end
+end
+
+def fun_l16_n85(x)
+    if (x < 1)
+        fun_l17_n135(x)
+    else
+        fun_l17_n893(x)
+    end
+end
+
+def fun_l16_n86(x)
+    if (x < 1)
+        fun_l17_n734(x)
+    else
+        fun_l17_n254(x)
+    end
+end
+
+def fun_l16_n87(x)
+    if (x < 1)
+        fun_l17_n809(x)
+    else
+        fun_l17_n475(x)
+    end
+end
+
+def fun_l16_n88(x)
+    if (x < 1)
+        fun_l17_n931(x)
+    else
+        fun_l17_n110(x)
+    end
+end
+
+def fun_l16_n89(x)
+    if (x < 1)
+        fun_l17_n957(x)
+    else
+        fun_l17_n489(x)
+    end
+end
+
+def fun_l16_n90(x)
+    if (x < 1)
+        fun_l17_n145(x)
+    else
+        fun_l17_n861(x)
+    end
+end
+
+def fun_l16_n91(x)
+    if (x < 1)
+        fun_l17_n276(x)
+    else
+        fun_l17_n967(x)
+    end
+end
+
+def fun_l16_n92(x)
+    if (x < 1)
+        fun_l17_n657(x)
+    else
+        fun_l17_n638(x)
+    end
+end
+
+def fun_l16_n93(x)
+    if (x < 1)
+        fun_l17_n714(x)
+    else
+        fun_l17_n52(x)
+    end
+end
+
+def fun_l16_n94(x)
+    if (x < 1)
+        fun_l17_n487(x)
+    else
+        fun_l17_n380(x)
+    end
+end
+
+def fun_l16_n95(x)
+    if (x < 1)
+        fun_l17_n58(x)
+    else
+        fun_l17_n67(x)
+    end
+end
+
+def fun_l16_n96(x)
+    if (x < 1)
+        fun_l17_n9(x)
+    else
+        fun_l17_n896(x)
+    end
+end
+
+def fun_l16_n97(x)
+    if (x < 1)
+        fun_l17_n723(x)
+    else
+        fun_l17_n16(x)
+    end
+end
+
+def fun_l16_n98(x)
+    if (x < 1)
+        fun_l17_n143(x)
+    else
+        fun_l17_n31(x)
+    end
+end
+
+def fun_l16_n99(x)
+    if (x < 1)
+        fun_l17_n33(x)
+    else
+        fun_l17_n615(x)
+    end
+end
+
+def fun_l16_n100(x)
+    if (x < 1)
+        fun_l17_n318(x)
+    else
+        fun_l17_n83(x)
+    end
+end
+
+def fun_l16_n101(x)
+    if (x < 1)
+        fun_l17_n694(x)
+    else
+        fun_l17_n851(x)
+    end
+end
+
+def fun_l16_n102(x)
+    if (x < 1)
+        fun_l17_n31(x)
+    else
+        fun_l17_n881(x)
+    end
+end
+
+def fun_l16_n103(x)
+    if (x < 1)
+        fun_l17_n739(x)
+    else
+        fun_l17_n680(x)
+    end
+end
+
+def fun_l16_n104(x)
+    if (x < 1)
+        fun_l17_n123(x)
+    else
+        fun_l17_n969(x)
+    end
+end
+
+def fun_l16_n105(x)
+    if (x < 1)
+        fun_l17_n526(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n106(x)
+    if (x < 1)
+        fun_l17_n613(x)
+    else
+        fun_l17_n738(x)
+    end
+end
+
+def fun_l16_n107(x)
+    if (x < 1)
+        fun_l17_n48(x)
+    else
+        fun_l17_n107(x)
+    end
+end
+
+def fun_l16_n108(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n109(x)
+    if (x < 1)
+        fun_l17_n101(x)
+    else
+        fun_l17_n295(x)
+    end
+end
+
+def fun_l16_n110(x)
+    if (x < 1)
+        fun_l17_n257(x)
+    else
+        fun_l17_n132(x)
+    end
+end
+
+def fun_l16_n111(x)
+    if (x < 1)
+        fun_l17_n702(x)
+    else
+        fun_l17_n635(x)
+    end
+end
+
+def fun_l16_n112(x)
+    if (x < 1)
+        fun_l17_n193(x)
+    else
+        fun_l17_n931(x)
+    end
+end
+
+def fun_l16_n113(x)
+    if (x < 1)
+        fun_l17_n973(x)
+    else
+        fun_l17_n708(x)
+    end
+end
+
+def fun_l16_n114(x)
+    if (x < 1)
+        fun_l17_n110(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n115(x)
+    if (x < 1)
+        fun_l17_n769(x)
+    else
+        fun_l17_n872(x)
+    end
+end
+
+def fun_l16_n116(x)
+    if (x < 1)
+        fun_l17_n63(x)
+    else
+        fun_l17_n90(x)
+    end
+end
+
+def fun_l16_n117(x)
+    if (x < 1)
+        fun_l17_n392(x)
+    else
+        fun_l17_n3(x)
+    end
+end
+
+def fun_l16_n118(x)
+    if (x < 1)
+        fun_l17_n73(x)
+    else
+        fun_l17_n354(x)
+    end
+end
+
+def fun_l16_n119(x)
+    if (x < 1)
+        fun_l17_n173(x)
+    else
+        fun_l17_n573(x)
+    end
+end
+
+def fun_l16_n120(x)
+    if (x < 1)
+        fun_l17_n481(x)
+    else
+        fun_l17_n571(x)
+    end
+end
+
+def fun_l16_n121(x)
+    if (x < 1)
+        fun_l17_n838(x)
+    else
+        fun_l17_n736(x)
+    end
+end
+
+def fun_l16_n122(x)
+    if (x < 1)
+        fun_l17_n400(x)
+    else
+        fun_l17_n169(x)
+    end
+end
+
+def fun_l16_n123(x)
+    if (x < 1)
+        fun_l17_n806(x)
+    else
+        fun_l17_n954(x)
+    end
+end
+
+def fun_l16_n124(x)
+    if (x < 1)
+        fun_l17_n328(x)
+    else
+        fun_l17_n200(x)
+    end
+end
+
+def fun_l16_n125(x)
+    if (x < 1)
+        fun_l17_n388(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n126(x)
+    if (x < 1)
+        fun_l17_n178(x)
+    else
+        fun_l17_n122(x)
+    end
+end
+
+def fun_l16_n127(x)
+    if (x < 1)
+        fun_l17_n974(x)
+    else
+        fun_l17_n490(x)
+    end
+end
+
+def fun_l16_n128(x)
+    if (x < 1)
+        fun_l17_n731(x)
+    else
+        fun_l17_n807(x)
+    end
+end
+
+def fun_l16_n129(x)
+    if (x < 1)
+        fun_l17_n939(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n130(x)
+    if (x < 1)
+        fun_l17_n482(x)
+    else
+        fun_l17_n926(x)
+    end
+end
+
+def fun_l16_n131(x)
+    if (x < 1)
+        fun_l17_n884(x)
+    else
+        fun_l17_n179(x)
+    end
+end
+
+def fun_l16_n132(x)
+    if (x < 1)
+        fun_l17_n683(x)
+    else
+        fun_l17_n24(x)
+    end
+end
+
+def fun_l16_n133(x)
+    if (x < 1)
+        fun_l17_n968(x)
+    else
+        fun_l17_n536(x)
+    end
+end
+
+def fun_l16_n134(x)
+    if (x < 1)
+        fun_l17_n229(x)
+    else
+        fun_l17_n280(x)
+    end
+end
+
+def fun_l16_n135(x)
+    if (x < 1)
+        fun_l17_n47(x)
+    else
+        fun_l17_n12(x)
+    end
+end
+
+def fun_l16_n136(x)
+    if (x < 1)
+        fun_l17_n905(x)
+    else
+        fun_l17_n461(x)
+    end
+end
+
+def fun_l16_n137(x)
+    if (x < 1)
+        fun_l17_n992(x)
+    else
+        fun_l17_n294(x)
+    end
+end
+
+def fun_l16_n138(x)
+    if (x < 1)
+        fun_l17_n383(x)
+    else
+        fun_l17_n916(x)
+    end
+end
+
+def fun_l16_n139(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n96(x)
+    end
+end
+
+def fun_l16_n140(x)
+    if (x < 1)
+        fun_l17_n702(x)
+    else
+        fun_l17_n294(x)
+    end
+end
+
+def fun_l16_n141(x)
+    if (x < 1)
+        fun_l17_n528(x)
+    else
+        fun_l17_n650(x)
+    end
+end
+
+def fun_l16_n142(x)
+    if (x < 1)
+        fun_l17_n341(x)
+    else
+        fun_l17_n168(x)
+    end
+end
+
+def fun_l16_n143(x)
+    if (x < 1)
+        fun_l17_n85(x)
+    else
+        fun_l17_n384(x)
+    end
+end
+
+def fun_l16_n144(x)
+    if (x < 1)
+        fun_l17_n738(x)
+    else
+        fun_l17_n842(x)
+    end
+end
+
+def fun_l16_n145(x)
+    if (x < 1)
+        fun_l17_n359(x)
+    else
+        fun_l17_n691(x)
+    end
+end
+
+def fun_l16_n146(x)
+    if (x < 1)
+        fun_l17_n465(x)
+    else
+        fun_l17_n310(x)
+    end
+end
+
+def fun_l16_n147(x)
+    if (x < 1)
+        fun_l17_n610(x)
+    else
+        fun_l17_n133(x)
+    end
+end
+
+def fun_l16_n148(x)
+    if (x < 1)
+        fun_l17_n829(x)
+    else
+        fun_l17_n449(x)
+    end
+end
+
+def fun_l16_n149(x)
+    if (x < 1)
+        fun_l17_n319(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n150(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n39(x)
+    end
+end
+
+def fun_l16_n151(x)
+    if (x < 1)
+        fun_l17_n801(x)
+    else
+        fun_l17_n294(x)
+    end
+end
+
+def fun_l16_n152(x)
+    if (x < 1)
+        fun_l17_n39(x)
+    else
+        fun_l17_n113(x)
+    end
+end
+
+def fun_l16_n153(x)
+    if (x < 1)
+        fun_l17_n299(x)
+    else
+        fun_l17_n560(x)
+    end
+end
+
+def fun_l16_n154(x)
+    if (x < 1)
+        fun_l17_n220(x)
+    else
+        fun_l17_n485(x)
+    end
+end
+
+def fun_l16_n155(x)
+    if (x < 1)
+        fun_l17_n219(x)
+    else
+        fun_l17_n210(x)
+    end
+end
+
+def fun_l16_n156(x)
+    if (x < 1)
+        fun_l17_n44(x)
+    else
+        fun_l17_n394(x)
+    end
+end
+
+def fun_l16_n157(x)
+    if (x < 1)
+        fun_l17_n858(x)
+    else
+        fun_l17_n9(x)
+    end
+end
+
+def fun_l16_n158(x)
+    if (x < 1)
+        fun_l17_n298(x)
+    else
+        fun_l17_n584(x)
+    end
+end
+
+def fun_l16_n159(x)
+    if (x < 1)
+        fun_l17_n627(x)
+    else
+        fun_l17_n991(x)
+    end
+end
+
+def fun_l16_n160(x)
+    if (x < 1)
+        fun_l17_n459(x)
+    else
+        fun_l17_n686(x)
+    end
+end
+
+def fun_l16_n161(x)
+    if (x < 1)
+        fun_l17_n694(x)
+    else
+        fun_l17_n503(x)
+    end
+end
+
+def fun_l16_n162(x)
+    if (x < 1)
+        fun_l17_n331(x)
+    else
+        fun_l17_n869(x)
+    end
+end
+
+def fun_l16_n163(x)
+    if (x < 1)
+        fun_l17_n958(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n164(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n888(x)
+    end
+end
+
+def fun_l16_n165(x)
+    if (x < 1)
+        fun_l17_n639(x)
+    else
+        fun_l17_n342(x)
+    end
+end
+
+def fun_l16_n166(x)
+    if (x < 1)
+        fun_l17_n859(x)
+    else
+        fun_l17_n2(x)
+    end
+end
+
+def fun_l16_n167(x)
+    if (x < 1)
+        fun_l17_n504(x)
+    else
+        fun_l17_n726(x)
+    end
+end
+
+def fun_l16_n168(x)
+    if (x < 1)
+        fun_l17_n426(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n169(x)
+    if (x < 1)
+        fun_l17_n919(x)
+    else
+        fun_l17_n515(x)
+    end
+end
+
+def fun_l16_n170(x)
+    if (x < 1)
+        fun_l17_n394(x)
+    else
+        fun_l17_n259(x)
+    end
+end
+
+def fun_l16_n171(x)
+    if (x < 1)
+        fun_l17_n920(x)
+    else
+        fun_l17_n502(x)
+    end
+end
+
+def fun_l16_n172(x)
+    if (x < 1)
+        fun_l17_n898(x)
+    else
+        fun_l17_n984(x)
+    end
+end
+
+def fun_l16_n173(x)
+    if (x < 1)
+        fun_l17_n869(x)
+    else
+        fun_l17_n470(x)
+    end
+end
+
+def fun_l16_n174(x)
+    if (x < 1)
+        fun_l17_n959(x)
+    else
+        fun_l17_n283(x)
+    end
+end
+
+def fun_l16_n175(x)
+    if (x < 1)
+        fun_l17_n1(x)
+    else
+        fun_l17_n68(x)
+    end
+end
+
+def fun_l16_n176(x)
+    if (x < 1)
+        fun_l17_n91(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n177(x)
+    if (x < 1)
+        fun_l17_n803(x)
+    else
+        fun_l17_n335(x)
+    end
+end
+
+def fun_l16_n178(x)
+    if (x < 1)
+        fun_l17_n242(x)
+    else
+        fun_l17_n671(x)
+    end
+end
+
+def fun_l16_n179(x)
+    if (x < 1)
+        fun_l17_n944(x)
+    else
+        fun_l17_n136(x)
+    end
+end
+
+def fun_l16_n180(x)
+    if (x < 1)
+        fun_l17_n681(x)
+    else
+        fun_l17_n587(x)
+    end
+end
+
+def fun_l16_n181(x)
+    if (x < 1)
+        fun_l17_n564(x)
+    else
+        fun_l17_n965(x)
+    end
+end
+
+def fun_l16_n182(x)
+    if (x < 1)
+        fun_l17_n107(x)
+    else
+        fun_l17_n229(x)
+    end
+end
+
+def fun_l16_n183(x)
+    if (x < 1)
+        fun_l17_n467(x)
+    else
+        fun_l17_n155(x)
+    end
+end
+
+def fun_l16_n184(x)
+    if (x < 1)
+        fun_l17_n62(x)
+    else
+        fun_l17_n507(x)
+    end
+end
+
+def fun_l16_n185(x)
+    if (x < 1)
+        fun_l17_n632(x)
+    else
+        fun_l17_n792(x)
+    end
+end
+
+def fun_l16_n186(x)
+    if (x < 1)
+        fun_l17_n174(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n187(x)
+    if (x < 1)
+        fun_l17_n733(x)
+    else
+        fun_l17_n640(x)
+    end
+end
+
+def fun_l16_n188(x)
+    if (x < 1)
+        fun_l17_n968(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n189(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n381(x)
+    end
+end
+
+def fun_l16_n190(x)
+    if (x < 1)
+        fun_l17_n34(x)
+    else
+        fun_l17_n145(x)
+    end
+end
+
+def fun_l16_n191(x)
+    if (x < 1)
+        fun_l17_n407(x)
+    else
+        fun_l17_n567(x)
+    end
+end
+
+def fun_l16_n192(x)
+    if (x < 1)
+        fun_l17_n497(x)
+    else
+        fun_l17_n842(x)
+    end
+end
+
+def fun_l16_n193(x)
+    if (x < 1)
+        fun_l17_n935(x)
+    else
+        fun_l17_n394(x)
+    end
+end
+
+def fun_l16_n194(x)
+    if (x < 1)
+        fun_l17_n728(x)
+    else
+        fun_l17_n885(x)
+    end
+end
+
+def fun_l16_n195(x)
+    if (x < 1)
+        fun_l17_n974(x)
+    else
+        fun_l17_n678(x)
+    end
+end
+
+def fun_l16_n196(x)
+    if (x < 1)
+        fun_l17_n420(x)
+    else
+        fun_l17_n894(x)
+    end
+end
+
+def fun_l16_n197(x)
+    if (x < 1)
+        fun_l17_n651(x)
+    else
+        fun_l17_n569(x)
+    end
+end
+
+def fun_l16_n198(x)
+    if (x < 1)
+        fun_l17_n274(x)
+    else
+        fun_l17_n683(x)
+    end
+end
+
+def fun_l16_n199(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n343(x)
+    end
+end
+
+def fun_l16_n200(x)
+    if (x < 1)
+        fun_l17_n82(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n201(x)
+    if (x < 1)
+        fun_l17_n519(x)
+    else
+        fun_l17_n54(x)
+    end
+end
+
+def fun_l16_n202(x)
+    if (x < 1)
+        fun_l17_n858(x)
+    else
+        fun_l17_n379(x)
+    end
+end
+
+def fun_l16_n203(x)
+    if (x < 1)
+        fun_l17_n515(x)
+    else
+        fun_l17_n59(x)
+    end
+end
+
+def fun_l16_n204(x)
+    if (x < 1)
+        fun_l17_n736(x)
+    else
+        fun_l17_n880(x)
+    end
+end
+
+def fun_l16_n205(x)
+    if (x < 1)
+        fun_l17_n724(x)
+    else
+        fun_l17_n890(x)
+    end
+end
+
+def fun_l16_n206(x)
+    if (x < 1)
+        fun_l17_n92(x)
+    else
+        fun_l17_n305(x)
+    end
+end
+
+def fun_l16_n207(x)
+    if (x < 1)
+        fun_l17_n123(x)
+    else
+        fun_l17_n455(x)
+    end
+end
+
+def fun_l16_n208(x)
+    if (x < 1)
+        fun_l17_n722(x)
+    else
+        fun_l17_n142(x)
+    end
+end
+
+def fun_l16_n209(x)
+    if (x < 1)
+        fun_l17_n250(x)
+    else
+        fun_l17_n810(x)
+    end
+end
+
+def fun_l16_n210(x)
+    if (x < 1)
+        fun_l17_n118(x)
+    else
+        fun_l17_n902(x)
+    end
+end
+
+def fun_l16_n211(x)
+    if (x < 1)
+        fun_l17_n8(x)
+    else
+        fun_l17_n874(x)
+    end
+end
+
+def fun_l16_n212(x)
+    if (x < 1)
+        fun_l17_n589(x)
+    else
+        fun_l17_n731(x)
+    end
+end
+
+def fun_l16_n213(x)
+    if (x < 1)
+        fun_l17_n786(x)
+    else
+        fun_l17_n249(x)
+    end
+end
+
+def fun_l16_n214(x)
+    if (x < 1)
+        fun_l17_n80(x)
+    else
+        fun_l17_n763(x)
+    end
+end
+
+def fun_l16_n215(x)
+    if (x < 1)
+        fun_l17_n733(x)
+    else
+        fun_l17_n657(x)
+    end
+end
+
+def fun_l16_n216(x)
+    if (x < 1)
+        fun_l17_n168(x)
+    else
+        fun_l17_n881(x)
+    end
+end
+
+def fun_l16_n217(x)
+    if (x < 1)
+        fun_l17_n568(x)
+    else
+        fun_l17_n698(x)
+    end
+end
+
+def fun_l16_n218(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n388(x)
+    end
+end
+
+def fun_l16_n219(x)
+    if (x < 1)
+        fun_l17_n443(x)
+    else
+        fun_l17_n600(x)
+    end
+end
+
+def fun_l16_n220(x)
+    if (x < 1)
+        fun_l17_n901(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n221(x)
+    if (x < 1)
+        fun_l17_n374(x)
+    else
+        fun_l17_n819(x)
+    end
+end
+
+def fun_l16_n222(x)
+    if (x < 1)
+        fun_l17_n563(x)
+    else
+        fun_l17_n341(x)
+    end
+end
+
+def fun_l16_n223(x)
+    if (x < 1)
+        fun_l17_n404(x)
+    else
+        fun_l17_n201(x)
+    end
+end
+
+def fun_l16_n224(x)
+    if (x < 1)
+        fun_l17_n932(x)
+    else
+        fun_l17_n803(x)
+    end
+end
+
+def fun_l16_n225(x)
+    if (x < 1)
+        fun_l17_n970(x)
+    else
+        fun_l17_n717(x)
+    end
+end
+
+def fun_l16_n226(x)
+    if (x < 1)
+        fun_l17_n599(x)
+    else
+        fun_l17_n692(x)
+    end
+end
+
+def fun_l16_n227(x)
+    if (x < 1)
+        fun_l17_n351(x)
+    else
+        fun_l17_n177(x)
+    end
+end
+
+def fun_l16_n228(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n79(x)
+    end
+end
+
+def fun_l16_n229(x)
+    if (x < 1)
+        fun_l17_n143(x)
+    else
+        fun_l17_n702(x)
+    end
+end
+
+def fun_l16_n230(x)
+    if (x < 1)
+        fun_l17_n591(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n231(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n881(x)
+    end
+end
+
+def fun_l16_n232(x)
+    if (x < 1)
+        fun_l17_n390(x)
+    else
+        fun_l17_n580(x)
+    end
+end
+
+def fun_l16_n233(x)
+    if (x < 1)
+        fun_l17_n530(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n234(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n783(x)
+    end
+end
+
+def fun_l16_n235(x)
+    if (x < 1)
+        fun_l17_n91(x)
+    else
+        fun_l17_n142(x)
+    end
+end
+
+def fun_l16_n236(x)
+    if (x < 1)
+        fun_l17_n55(x)
+    else
+        fun_l17_n897(x)
+    end
+end
+
+def fun_l16_n237(x)
+    if (x < 1)
+        fun_l17_n471(x)
+    else
+        fun_l17_n24(x)
+    end
+end
+
+def fun_l16_n238(x)
+    if (x < 1)
+        fun_l17_n812(x)
+    else
+        fun_l17_n833(x)
+    end
+end
+
+def fun_l16_n239(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n560(x)
+    end
+end
+
+def fun_l16_n240(x)
+    if (x < 1)
+        fun_l17_n882(x)
+    else
+        fun_l17_n473(x)
+    end
+end
+
+def fun_l16_n241(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n299(x)
+    end
+end
+
+def fun_l16_n242(x)
+    if (x < 1)
+        fun_l17_n855(x)
+    else
+        fun_l17_n751(x)
+    end
+end
+
+def fun_l16_n243(x)
+    if (x < 1)
+        fun_l17_n184(x)
+    else
+        fun_l17_n997(x)
+    end
+end
+
+def fun_l16_n244(x)
+    if (x < 1)
+        fun_l17_n151(x)
+    else
+        fun_l17_n495(x)
+    end
+end
+
+def fun_l16_n245(x)
+    if (x < 1)
+        fun_l17_n181(x)
+    else
+        fun_l17_n360(x)
+    end
+end
+
+def fun_l16_n246(x)
+    if (x < 1)
+        fun_l17_n208(x)
+    else
+        fun_l17_n767(x)
+    end
+end
+
+def fun_l16_n247(x)
+    if (x < 1)
+        fun_l17_n969(x)
+    else
+        fun_l17_n15(x)
+    end
+end
+
+def fun_l16_n248(x)
+    if (x < 1)
+        fun_l17_n529(x)
+    else
+        fun_l17_n879(x)
+    end
+end
+
+def fun_l16_n249(x)
+    if (x < 1)
+        fun_l17_n729(x)
+    else
+        fun_l17_n355(x)
+    end
+end
+
+def fun_l16_n250(x)
+    if (x < 1)
+        fun_l17_n239(x)
+    else
+        fun_l17_n414(x)
+    end
+end
+
+def fun_l16_n251(x)
+    if (x < 1)
+        fun_l17_n257(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n252(x)
+    if (x < 1)
+        fun_l17_n832(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n253(x)
+    if (x < 1)
+        fun_l17_n907(x)
+    else
+        fun_l17_n548(x)
+    end
+end
+
+def fun_l16_n254(x)
+    if (x < 1)
+        fun_l17_n391(x)
+    else
+        fun_l17_n316(x)
+    end
+end
+
+def fun_l16_n255(x)
+    if (x < 1)
+        fun_l17_n163(x)
+    else
+        fun_l17_n164(x)
+    end
+end
+
+def fun_l16_n256(x)
+    if (x < 1)
+        fun_l17_n86(x)
+    else
+        fun_l17_n473(x)
+    end
+end
+
+def fun_l16_n257(x)
+    if (x < 1)
+        fun_l17_n519(x)
+    else
+        fun_l17_n556(x)
+    end
+end
+
+def fun_l16_n258(x)
+    if (x < 1)
+        fun_l17_n819(x)
+    else
+        fun_l17_n41(x)
+    end
+end
+
+def fun_l16_n259(x)
+    if (x < 1)
+        fun_l17_n330(x)
+    else
+        fun_l17_n334(x)
+    end
+end
+
+def fun_l16_n260(x)
+    if (x < 1)
+        fun_l17_n441(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n261(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n597(x)
+    end
+end
+
+def fun_l16_n262(x)
+    if (x < 1)
+        fun_l17_n537(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n263(x)
+    if (x < 1)
+        fun_l17_n511(x)
+    else
+        fun_l17_n56(x)
+    end
+end
+
+def fun_l16_n264(x)
+    if (x < 1)
+        fun_l17_n264(x)
+    else
+        fun_l17_n641(x)
+    end
+end
+
+def fun_l16_n265(x)
+    if (x < 1)
+        fun_l17_n806(x)
+    else
+        fun_l17_n432(x)
+    end
+end
+
+def fun_l16_n266(x)
+    if (x < 1)
+        fun_l17_n428(x)
+    else
+        fun_l17_n463(x)
+    end
+end
+
+def fun_l16_n267(x)
+    if (x < 1)
+        fun_l17_n39(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n268(x)
+    if (x < 1)
+        fun_l17_n502(x)
+    else
+        fun_l17_n87(x)
+    end
+end
+
+def fun_l16_n269(x)
+    if (x < 1)
+        fun_l17_n143(x)
+    else
+        fun_l17_n92(x)
+    end
+end
+
+def fun_l16_n270(x)
+    if (x < 1)
+        fun_l17_n675(x)
+    else
+        fun_l17_n629(x)
+    end
+end
+
+def fun_l16_n271(x)
+    if (x < 1)
+        fun_l17_n33(x)
+    else
+        fun_l17_n158(x)
+    end
+end
+
+def fun_l16_n272(x)
+    if (x < 1)
+        fun_l17_n480(x)
+    else
+        fun_l17_n204(x)
+    end
+end
+
+def fun_l16_n273(x)
+    if (x < 1)
+        fun_l17_n81(x)
+    else
+        fun_l17_n855(x)
+    end
+end
+
+def fun_l16_n274(x)
+    if (x < 1)
+        fun_l17_n608(x)
+    else
+        fun_l17_n969(x)
+    end
+end
+
+def fun_l16_n275(x)
+    if (x < 1)
+        fun_l17_n606(x)
+    else
+        fun_l17_n292(x)
+    end
+end
+
+def fun_l16_n276(x)
+    if (x < 1)
+        fun_l17_n494(x)
+    else
+        fun_l17_n689(x)
+    end
+end
+
+def fun_l16_n277(x)
+    if (x < 1)
+        fun_l17_n3(x)
+    else
+        fun_l17_n207(x)
+    end
+end
+
+def fun_l16_n278(x)
+    if (x < 1)
+        fun_l17_n85(x)
+    else
+        fun_l17_n59(x)
+    end
+end
+
+def fun_l16_n279(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n651(x)
+    end
+end
+
+def fun_l16_n280(x)
+    if (x < 1)
+        fun_l17_n199(x)
+    else
+        fun_l17_n77(x)
+    end
+end
+
+def fun_l16_n281(x)
+    if (x < 1)
+        fun_l17_n83(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n282(x)
+    if (x < 1)
+        fun_l17_n120(x)
+    else
+        fun_l17_n466(x)
+    end
+end
+
+def fun_l16_n283(x)
+    if (x < 1)
+        fun_l17_n667(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n284(x)
+    if (x < 1)
+        fun_l17_n248(x)
+    else
+        fun_l17_n480(x)
+    end
+end
+
+def fun_l16_n285(x)
+    if (x < 1)
+        fun_l17_n766(x)
+    else
+        fun_l17_n609(x)
+    end
+end
+
+def fun_l16_n286(x)
+    if (x < 1)
+        fun_l17_n95(x)
+    else
+        fun_l17_n341(x)
+    end
+end
+
+def fun_l16_n287(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n552(x)
+    end
+end
+
+def fun_l16_n288(x)
+    if (x < 1)
+        fun_l17_n955(x)
+    else
+        fun_l17_n434(x)
+    end
+end
+
+def fun_l16_n289(x)
+    if (x < 1)
+        fun_l17_n954(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n290(x)
+    if (x < 1)
+        fun_l17_n981(x)
+    else
+        fun_l17_n374(x)
+    end
+end
+
+def fun_l16_n291(x)
+    if (x < 1)
+        fun_l17_n153(x)
+    else
+        fun_l17_n849(x)
+    end
+end
+
+def fun_l16_n292(x)
+    if (x < 1)
+        fun_l17_n89(x)
+    else
+        fun_l17_n491(x)
+    end
+end
+
+def fun_l16_n293(x)
+    if (x < 1)
+        fun_l17_n908(x)
+    else
+        fun_l17_n75(x)
+    end
+end
+
+def fun_l16_n294(x)
+    if (x < 1)
+        fun_l17_n772(x)
+    else
+        fun_l17_n474(x)
+    end
+end
+
+def fun_l16_n295(x)
+    if (x < 1)
+        fun_l17_n577(x)
+    else
+        fun_l17_n470(x)
+    end
+end
+
+def fun_l16_n296(x)
+    if (x < 1)
+        fun_l17_n699(x)
+    else
+        fun_l17_n172(x)
+    end
+end
+
+def fun_l16_n297(x)
+    if (x < 1)
+        fun_l17_n408(x)
+    else
+        fun_l17_n314(x)
+    end
+end
+
+def fun_l16_n298(x)
+    if (x < 1)
+        fun_l17_n521(x)
+    else
+        fun_l17_n940(x)
+    end
+end
+
+def fun_l16_n299(x)
+    if (x < 1)
+        fun_l17_n804(x)
+    else
+        fun_l17_n503(x)
+    end
+end
+
+def fun_l16_n300(x)
+    if (x < 1)
+        fun_l17_n712(x)
+    else
+        fun_l17_n227(x)
+    end
+end
+
+def fun_l16_n301(x)
+    if (x < 1)
+        fun_l17_n700(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n302(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n212(x)
+    end
+end
+
+def fun_l16_n303(x)
+    if (x < 1)
+        fun_l17_n525(x)
+    else
+        fun_l17_n273(x)
+    end
+end
+
+def fun_l16_n304(x)
+    if (x < 1)
+        fun_l17_n356(x)
+    else
+        fun_l17_n359(x)
+    end
+end
+
+def fun_l16_n305(x)
+    if (x < 1)
+        fun_l17_n84(x)
+    else
+        fun_l17_n207(x)
+    end
+end
+
+def fun_l16_n306(x)
+    if (x < 1)
+        fun_l17_n566(x)
+    else
+        fun_l17_n945(x)
+    end
+end
+
+def fun_l16_n307(x)
+    if (x < 1)
+        fun_l17_n692(x)
+    else
+        fun_l17_n326(x)
+    end
+end
+
+def fun_l16_n308(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n205(x)
+    end
+end
+
+def fun_l16_n309(x)
+    if (x < 1)
+        fun_l17_n568(x)
+    else
+        fun_l17_n386(x)
+    end
+end
+
+def fun_l16_n310(x)
+    if (x < 1)
+        fun_l17_n244(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n311(x)
+    if (x < 1)
+        fun_l17_n956(x)
+    else
+        fun_l17_n546(x)
+    end
+end
+
+def fun_l16_n312(x)
+    if (x < 1)
+        fun_l17_n807(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n313(x)
+    if (x < 1)
+        fun_l17_n931(x)
+    else
+        fun_l17_n962(x)
+    end
+end
+
+def fun_l16_n314(x)
+    if (x < 1)
+        fun_l17_n64(x)
+    else
+        fun_l17_n178(x)
+    end
+end
+
+def fun_l16_n315(x)
+    if (x < 1)
+        fun_l17_n460(x)
+    else
+        fun_l17_n438(x)
+    end
+end
+
+def fun_l16_n316(x)
+    if (x < 1)
+        fun_l17_n185(x)
+    else
+        fun_l17_n25(x)
+    end
+end
+
+def fun_l16_n317(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n460(x)
+    end
+end
+
+def fun_l16_n318(x)
+    if (x < 1)
+        fun_l17_n5(x)
+    else
+        fun_l17_n947(x)
+    end
+end
+
+def fun_l16_n319(x)
+    if (x < 1)
+        fun_l17_n682(x)
+    else
+        fun_l17_n644(x)
+    end
+end
+
+def fun_l16_n320(x)
+    if (x < 1)
+        fun_l17_n151(x)
+    else
+        fun_l17_n578(x)
+    end
+end
+
+def fun_l16_n321(x)
+    if (x < 1)
+        fun_l17_n219(x)
+    else
+        fun_l17_n4(x)
+    end
+end
+
+def fun_l16_n322(x)
+    if (x < 1)
+        fun_l17_n214(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n323(x)
+    if (x < 1)
+        fun_l17_n970(x)
+    else
+        fun_l17_n275(x)
+    end
+end
+
+def fun_l16_n324(x)
+    if (x < 1)
+        fun_l17_n442(x)
+    else
+        fun_l17_n377(x)
+    end
+end
+
+def fun_l16_n325(x)
+    if (x < 1)
+        fun_l17_n783(x)
+    else
+        fun_l17_n731(x)
+    end
+end
+
+def fun_l16_n326(x)
+    if (x < 1)
+        fun_l17_n43(x)
+    else
+        fun_l17_n884(x)
+    end
+end
+
+def fun_l16_n327(x)
+    if (x < 1)
+        fun_l17_n857(x)
+    else
+        fun_l17_n593(x)
+    end
+end
+
+def fun_l16_n328(x)
+    if (x < 1)
+        fun_l17_n942(x)
+    else
+        fun_l17_n772(x)
+    end
+end
+
+def fun_l16_n329(x)
+    if (x < 1)
+        fun_l17_n309(x)
+    else
+        fun_l17_n508(x)
+    end
+end
+
+def fun_l16_n330(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n165(x)
+    end
+end
+
+def fun_l16_n331(x)
+    if (x < 1)
+        fun_l17_n981(x)
+    else
+        fun_l17_n355(x)
+    end
+end
+
+def fun_l16_n332(x)
+    if (x < 1)
+        fun_l17_n159(x)
+    else
+        fun_l17_n228(x)
+    end
+end
+
+def fun_l16_n333(x)
+    if (x < 1)
+        fun_l17_n499(x)
+    else
+        fun_l17_n565(x)
+    end
+end
+
+def fun_l16_n334(x)
+    if (x < 1)
+        fun_l17_n371(x)
+    else
+        fun_l17_n856(x)
+    end
+end
+
+def fun_l16_n335(x)
+    if (x < 1)
+        fun_l17_n717(x)
+    else
+        fun_l17_n229(x)
+    end
+end
+
+def fun_l16_n336(x)
+    if (x < 1)
+        fun_l17_n678(x)
+    else
+        fun_l17_n236(x)
+    end
+end
+
+def fun_l16_n337(x)
+    if (x < 1)
+        fun_l17_n472(x)
+    else
+        fun_l17_n566(x)
+    end
+end
+
+def fun_l16_n338(x)
+    if (x < 1)
+        fun_l17_n74(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n339(x)
+    if (x < 1)
+        fun_l17_n379(x)
+    else
+        fun_l17_n443(x)
+    end
+end
+
+def fun_l16_n340(x)
+    if (x < 1)
+        fun_l17_n233(x)
+    else
+        fun_l17_n79(x)
+    end
+end
+
+def fun_l16_n341(x)
+    if (x < 1)
+        fun_l17_n136(x)
+    else
+        fun_l17_n900(x)
+    end
+end
+
+def fun_l16_n342(x)
+    if (x < 1)
+        fun_l17_n785(x)
+    else
+        fun_l17_n63(x)
+    end
+end
+
+def fun_l16_n343(x)
+    if (x < 1)
+        fun_l17_n429(x)
+    else
+        fun_l17_n111(x)
+    end
+end
+
+def fun_l16_n344(x)
+    if (x < 1)
+        fun_l17_n226(x)
+    else
+        fun_l17_n137(x)
+    end
+end
+
+def fun_l16_n345(x)
+    if (x < 1)
+        fun_l17_n428(x)
+    else
+        fun_l17_n674(x)
+    end
+end
+
+def fun_l16_n346(x)
+    if (x < 1)
+        fun_l17_n940(x)
+    else
+        fun_l17_n987(x)
+    end
+end
+
+def fun_l16_n347(x)
+    if (x < 1)
+        fun_l17_n579(x)
+    else
+        fun_l17_n220(x)
+    end
+end
+
+def fun_l16_n348(x)
+    if (x < 1)
+        fun_l17_n502(x)
+    else
+        fun_l17_n530(x)
+    end
+end
+
+def fun_l16_n349(x)
+    if (x < 1)
+        fun_l17_n334(x)
+    else
+        fun_l17_n955(x)
+    end
+end
+
+def fun_l16_n350(x)
+    if (x < 1)
+        fun_l17_n680(x)
+    else
+        fun_l17_n41(x)
+    end
+end
+
+def fun_l16_n351(x)
+    if (x < 1)
+        fun_l17_n821(x)
+    else
+        fun_l17_n750(x)
+    end
+end
+
+def fun_l16_n352(x)
+    if (x < 1)
+        fun_l17_n212(x)
+    else
+        fun_l17_n537(x)
+    end
+end
+
+def fun_l16_n353(x)
+    if (x < 1)
+        fun_l17_n555(x)
+    else
+        fun_l17_n834(x)
+    end
+end
+
+def fun_l16_n354(x)
+    if (x < 1)
+        fun_l17_n532(x)
+    else
+        fun_l17_n940(x)
+    end
+end
+
+def fun_l16_n355(x)
+    if (x < 1)
+        fun_l17_n771(x)
+    else
+        fun_l17_n915(x)
+    end
+end
+
+def fun_l16_n356(x)
+    if (x < 1)
+        fun_l17_n844(x)
+    else
+        fun_l17_n235(x)
+    end
+end
+
+def fun_l16_n357(x)
+    if (x < 1)
+        fun_l17_n604(x)
+    else
+        fun_l17_n241(x)
+    end
+end
+
+def fun_l16_n358(x)
+    if (x < 1)
+        fun_l17_n156(x)
+    else
+        fun_l17_n832(x)
+    end
+end
+
+def fun_l16_n359(x)
+    if (x < 1)
+        fun_l17_n335(x)
+    else
+        fun_l17_n115(x)
+    end
+end
+
+def fun_l16_n360(x)
+    if (x < 1)
+        fun_l17_n563(x)
+    else
+        fun_l17_n779(x)
+    end
+end
+
+def fun_l16_n361(x)
+    if (x < 1)
+        fun_l17_n280(x)
+    else
+        fun_l17_n946(x)
+    end
+end
+
+def fun_l16_n362(x)
+    if (x < 1)
+        fun_l17_n497(x)
+    else
+        fun_l17_n390(x)
+    end
+end
+
+def fun_l16_n363(x)
+    if (x < 1)
+        fun_l17_n59(x)
+    else
+        fun_l17_n178(x)
+    end
+end
+
+def fun_l16_n364(x)
+    if (x < 1)
+        fun_l17_n509(x)
+    else
+        fun_l17_n963(x)
+    end
+end
+
+def fun_l16_n365(x)
+    if (x < 1)
+        fun_l17_n670(x)
+    else
+        fun_l17_n455(x)
+    end
+end
+
+def fun_l16_n366(x)
+    if (x < 1)
+        fun_l17_n852(x)
+    else
+        fun_l17_n590(x)
+    end
+end
+
+def fun_l16_n367(x)
+    if (x < 1)
+        fun_l17_n714(x)
+    else
+        fun_l17_n98(x)
+    end
+end
+
+def fun_l16_n368(x)
+    if (x < 1)
+        fun_l17_n456(x)
+    else
+        fun_l17_n754(x)
+    end
+end
+
+def fun_l16_n369(x)
+    if (x < 1)
+        fun_l17_n809(x)
+    else
+        fun_l17_n38(x)
+    end
+end
+
+def fun_l16_n370(x)
+    if (x < 1)
+        fun_l17_n127(x)
+    else
+        fun_l17_n395(x)
+    end
+end
+
+def fun_l16_n371(x)
+    if (x < 1)
+        fun_l17_n700(x)
+    else
+        fun_l17_n175(x)
+    end
+end
+
+def fun_l16_n372(x)
+    if (x < 1)
+        fun_l17_n705(x)
+    else
+        fun_l17_n598(x)
+    end
+end
+
+def fun_l16_n373(x)
+    if (x < 1)
+        fun_l17_n808(x)
+    else
+        fun_l17_n253(x)
+    end
+end
+
+def fun_l16_n374(x)
+    if (x < 1)
+        fun_l17_n195(x)
+    else
+        fun_l17_n47(x)
+    end
+end
+
+def fun_l16_n375(x)
+    if (x < 1)
+        fun_l17_n124(x)
+    else
+        fun_l17_n438(x)
+    end
+end
+
+def fun_l16_n376(x)
+    if (x < 1)
+        fun_l17_n261(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n377(x)
+    if (x < 1)
+        fun_l17_n702(x)
+    else
+        fun_l17_n67(x)
+    end
+end
+
+def fun_l16_n378(x)
+    if (x < 1)
+        fun_l17_n194(x)
+    else
+        fun_l17_n990(x)
+    end
+end
+
+def fun_l16_n379(x)
+    if (x < 1)
+        fun_l17_n574(x)
+    else
+        fun_l17_n379(x)
+    end
+end
+
+def fun_l16_n380(x)
+    if (x < 1)
+        fun_l17_n182(x)
+    else
+        fun_l17_n902(x)
+    end
+end
+
+def fun_l16_n381(x)
+    if (x < 1)
+        fun_l17_n963(x)
+    else
+        fun_l17_n627(x)
+    end
+end
+
+def fun_l16_n382(x)
+    if (x < 1)
+        fun_l17_n200(x)
+    else
+        fun_l17_n889(x)
+    end
+end
+
+def fun_l16_n383(x)
+    if (x < 1)
+        fun_l17_n14(x)
+    else
+        fun_l17_n422(x)
+    end
+end
+
+def fun_l16_n384(x)
+    if (x < 1)
+        fun_l17_n543(x)
+    else
+        fun_l17_n940(x)
+    end
+end
+
+def fun_l16_n385(x)
+    if (x < 1)
+        fun_l17_n762(x)
+    else
+        fun_l17_n493(x)
+    end
+end
+
+def fun_l16_n386(x)
+    if (x < 1)
+        fun_l17_n824(x)
+    else
+        fun_l17_n963(x)
+    end
+end
+
+def fun_l16_n387(x)
+    if (x < 1)
+        fun_l17_n298(x)
+    else
+        fun_l17_n831(x)
+    end
+end
+
+def fun_l16_n388(x)
+    if (x < 1)
+        fun_l17_n284(x)
+    else
+        fun_l17_n784(x)
+    end
+end
+
+def fun_l16_n389(x)
+    if (x < 1)
+        fun_l17_n461(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n390(x)
+    if (x < 1)
+        fun_l17_n829(x)
+    else
+        fun_l17_n788(x)
+    end
+end
+
+def fun_l16_n391(x)
+    if (x < 1)
+        fun_l17_n263(x)
+    else
+        fun_l17_n21(x)
+    end
+end
+
+def fun_l16_n392(x)
+    if (x < 1)
+        fun_l17_n994(x)
+    else
+        fun_l17_n646(x)
+    end
+end
+
+def fun_l16_n393(x)
+    if (x < 1)
+        fun_l17_n438(x)
+    else
+        fun_l17_n84(x)
+    end
+end
+
+def fun_l16_n394(x)
+    if (x < 1)
+        fun_l17_n660(x)
+    else
+        fun_l17_n269(x)
+    end
+end
+
+def fun_l16_n395(x)
+    if (x < 1)
+        fun_l17_n939(x)
+    else
+        fun_l17_n676(x)
+    end
+end
+
+def fun_l16_n396(x)
+    if (x < 1)
+        fun_l17_n608(x)
+    else
+        fun_l17_n483(x)
+    end
+end
+
+def fun_l16_n397(x)
+    if (x < 1)
+        fun_l17_n504(x)
+    else
+        fun_l17_n499(x)
+    end
+end
+
+def fun_l16_n398(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n489(x)
+    end
+end
+
+def fun_l16_n399(x)
+    if (x < 1)
+        fun_l17_n28(x)
+    else
+        fun_l17_n158(x)
+    end
+end
+
+def fun_l16_n400(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n21(x)
+    end
+end
+
+def fun_l16_n401(x)
+    if (x < 1)
+        fun_l17_n532(x)
+    else
+        fun_l17_n730(x)
+    end
+end
+
+def fun_l16_n402(x)
+    if (x < 1)
+        fun_l17_n593(x)
+    else
+        fun_l17_n4(x)
+    end
+end
+
+def fun_l16_n403(x)
+    if (x < 1)
+        fun_l17_n881(x)
+    else
+        fun_l17_n956(x)
+    end
+end
+
+def fun_l16_n404(x)
+    if (x < 1)
+        fun_l17_n676(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n405(x)
+    if (x < 1)
+        fun_l17_n192(x)
+    else
+        fun_l17_n301(x)
+    end
+end
+
+def fun_l16_n406(x)
+    if (x < 1)
+        fun_l17_n170(x)
+    else
+        fun_l17_n970(x)
+    end
+end
+
+def fun_l16_n407(x)
+    if (x < 1)
+        fun_l17_n268(x)
+    else
+        fun_l17_n765(x)
+    end
+end
+
+def fun_l16_n408(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n578(x)
+    end
+end
+
+def fun_l16_n409(x)
+    if (x < 1)
+        fun_l17_n301(x)
+    else
+        fun_l17_n870(x)
+    end
+end
+
+def fun_l16_n410(x)
+    if (x < 1)
+        fun_l17_n390(x)
+    else
+        fun_l17_n769(x)
+    end
+end
+
+def fun_l16_n411(x)
+    if (x < 1)
+        fun_l17_n973(x)
+    else
+        fun_l17_n545(x)
+    end
+end
+
+def fun_l16_n412(x)
+    if (x < 1)
+        fun_l17_n108(x)
+    else
+        fun_l17_n731(x)
+    end
+end
+
+def fun_l16_n413(x)
+    if (x < 1)
+        fun_l17_n842(x)
+    else
+        fun_l17_n106(x)
+    end
+end
+
+def fun_l16_n414(x)
+    if (x < 1)
+        fun_l17_n10(x)
+    else
+        fun_l17_n421(x)
+    end
+end
+
+def fun_l16_n415(x)
+    if (x < 1)
+        fun_l17_n765(x)
+    else
+        fun_l17_n584(x)
+    end
+end
+
+def fun_l16_n416(x)
+    if (x < 1)
+        fun_l17_n480(x)
+    else
+        fun_l17_n494(x)
+    end
+end
+
+def fun_l16_n417(x)
+    if (x < 1)
+        fun_l17_n977(x)
+    else
+        fun_l17_n66(x)
+    end
+end
+
+def fun_l16_n418(x)
+    if (x < 1)
+        fun_l17_n291(x)
+    else
+        fun_l17_n161(x)
+    end
+end
+
+def fun_l16_n419(x)
+    if (x < 1)
+        fun_l17_n400(x)
+    else
+        fun_l17_n99(x)
+    end
+end
+
+def fun_l16_n420(x)
+    if (x < 1)
+        fun_l17_n621(x)
+    else
+        fun_l17_n778(x)
+    end
+end
+
+def fun_l16_n421(x)
+    if (x < 1)
+        fun_l17_n286(x)
+    else
+        fun_l17_n784(x)
+    end
+end
+
+def fun_l16_n422(x)
+    if (x < 1)
+        fun_l17_n575(x)
+    else
+        fun_l17_n606(x)
+    end
+end
+
+def fun_l16_n423(x)
+    if (x < 1)
+        fun_l17_n459(x)
+    else
+        fun_l17_n198(x)
+    end
+end
+
+def fun_l16_n424(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n597(x)
+    end
+end
+
+def fun_l16_n425(x)
+    if (x < 1)
+        fun_l17_n365(x)
+    else
+        fun_l17_n73(x)
+    end
+end
+
+def fun_l16_n426(x)
+    if (x < 1)
+        fun_l17_n769(x)
+    else
+        fun_l17_n658(x)
+    end
+end
+
+def fun_l16_n427(x)
+    if (x < 1)
+        fun_l17_n980(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n428(x)
+    if (x < 1)
+        fun_l17_n210(x)
+    else
+        fun_l17_n33(x)
+    end
+end
+
+def fun_l16_n429(x)
+    if (x < 1)
+        fun_l17_n585(x)
+    else
+        fun_l17_n997(x)
+    end
+end
+
+def fun_l16_n430(x)
+    if (x < 1)
+        fun_l17_n660(x)
+    else
+        fun_l17_n883(x)
+    end
+end
+
+def fun_l16_n431(x)
+    if (x < 1)
+        fun_l17_n613(x)
+    else
+        fun_l17_n7(x)
+    end
+end
+
+def fun_l16_n432(x)
+    if (x < 1)
+        fun_l17_n764(x)
+    else
+        fun_l17_n150(x)
+    end
+end
+
+def fun_l16_n433(x)
+    if (x < 1)
+        fun_l17_n582(x)
+    else
+        fun_l17_n197(x)
+    end
+end
+
+def fun_l16_n434(x)
+    if (x < 1)
+        fun_l17_n553(x)
+    else
+        fun_l17_n107(x)
+    end
+end
+
+def fun_l16_n435(x)
+    if (x < 1)
+        fun_l17_n975(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n436(x)
+    if (x < 1)
+        fun_l17_n622(x)
+    else
+        fun_l17_n351(x)
+    end
+end
+
+def fun_l16_n437(x)
+    if (x < 1)
+        fun_l17_n681(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n438(x)
+    if (x < 1)
+        fun_l17_n329(x)
+    else
+        fun_l17_n54(x)
+    end
+end
+
+def fun_l16_n439(x)
+    if (x < 1)
+        fun_l17_n340(x)
+    else
+        fun_l17_n567(x)
+    end
+end
+
+def fun_l16_n440(x)
+    if (x < 1)
+        fun_l17_n563(x)
+    else
+        fun_l17_n134(x)
+    end
+end
+
+def fun_l16_n441(x)
+    if (x < 1)
+        fun_l17_n194(x)
+    else
+        fun_l17_n986(x)
+    end
+end
+
+def fun_l16_n442(x)
+    if (x < 1)
+        fun_l17_n926(x)
+    else
+        fun_l17_n35(x)
+    end
+end
+
+def fun_l16_n443(x)
+    if (x < 1)
+        fun_l17_n771(x)
+    else
+        fun_l17_n383(x)
+    end
+end
+
+def fun_l16_n444(x)
+    if (x < 1)
+        fun_l17_n682(x)
+    else
+        fun_l17_n1(x)
+    end
+end
+
+def fun_l16_n445(x)
+    if (x < 1)
+        fun_l17_n633(x)
+    else
+        fun_l17_n757(x)
+    end
+end
+
+def fun_l16_n446(x)
+    if (x < 1)
+        fun_l17_n95(x)
+    else
+        fun_l17_n256(x)
+    end
+end
+
+def fun_l16_n447(x)
+    if (x < 1)
+        fun_l17_n183(x)
+    else
+        fun_l17_n214(x)
+    end
+end
+
+def fun_l16_n448(x)
+    if (x < 1)
+        fun_l17_n140(x)
+    else
+        fun_l17_n371(x)
+    end
+end
+
+def fun_l16_n449(x)
+    if (x < 1)
+        fun_l17_n188(x)
+    else
+        fun_l17_n898(x)
+    end
+end
+
+def fun_l16_n450(x)
+    if (x < 1)
+        fun_l17_n710(x)
+    else
+        fun_l17_n512(x)
+    end
+end
+
+def fun_l16_n451(x)
+    if (x < 1)
+        fun_l17_n796(x)
+    else
+        fun_l17_n56(x)
+    end
+end
+
+def fun_l16_n452(x)
+    if (x < 1)
+        fun_l17_n124(x)
+    else
+        fun_l17_n304(x)
+    end
+end
+
+def fun_l16_n453(x)
+    if (x < 1)
+        fun_l17_n150(x)
+    else
+        fun_l17_n503(x)
+    end
+end
+
+def fun_l16_n454(x)
+    if (x < 1)
+        fun_l17_n369(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n455(x)
+    if (x < 1)
+        fun_l17_n514(x)
+    else
+        fun_l17_n672(x)
+    end
+end
+
+def fun_l16_n456(x)
+    if (x < 1)
+        fun_l17_n80(x)
+    else
+        fun_l17_n332(x)
+    end
+end
+
+def fun_l16_n457(x)
+    if (x < 1)
+        fun_l17_n80(x)
+    else
+        fun_l17_n32(x)
+    end
+end
+
+def fun_l16_n458(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n90(x)
+    end
+end
+
+def fun_l16_n459(x)
+    if (x < 1)
+        fun_l17_n730(x)
+    else
+        fun_l17_n170(x)
+    end
+end
+
+def fun_l16_n460(x)
+    if (x < 1)
+        fun_l17_n908(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n461(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n536(x)
+    end
+end
+
+def fun_l16_n462(x)
+    if (x < 1)
+        fun_l17_n123(x)
+    else
+        fun_l17_n216(x)
+    end
+end
+
+def fun_l16_n463(x)
+    if (x < 1)
+        fun_l17_n577(x)
+    else
+        fun_l17_n757(x)
+    end
+end
+
+def fun_l16_n464(x)
+    if (x < 1)
+        fun_l17_n750(x)
+    else
+        fun_l17_n916(x)
+    end
+end
+
+def fun_l16_n465(x)
+    if (x < 1)
+        fun_l17_n621(x)
+    else
+        fun_l17_n386(x)
+    end
+end
+
+def fun_l16_n466(x)
+    if (x < 1)
+        fun_l17_n904(x)
+    else
+        fun_l17_n732(x)
+    end
+end
+
+def fun_l16_n467(x)
+    if (x < 1)
+        fun_l17_n625(x)
+    else
+        fun_l17_n1(x)
+    end
+end
+
+def fun_l16_n468(x)
+    if (x < 1)
+        fun_l17_n762(x)
+    else
+        fun_l17_n373(x)
+    end
+end
+
+def fun_l16_n469(x)
+    if (x < 1)
+        fun_l17_n816(x)
+    else
+        fun_l17_n490(x)
+    end
+end
+
+def fun_l16_n470(x)
+    if (x < 1)
+        fun_l17_n908(x)
+    else
+        fun_l17_n701(x)
+    end
+end
+
+def fun_l16_n471(x)
+    if (x < 1)
+        fun_l17_n690(x)
+    else
+        fun_l17_n374(x)
+    end
+end
+
+def fun_l16_n472(x)
+    if (x < 1)
+        fun_l17_n753(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n473(x)
+    if (x < 1)
+        fun_l17_n602(x)
+    else
+        fun_l17_n947(x)
+    end
+end
+
+def fun_l16_n474(x)
+    if (x < 1)
+        fun_l17_n565(x)
+    else
+        fun_l17_n320(x)
+    end
+end
+
+def fun_l16_n475(x)
+    if (x < 1)
+        fun_l17_n990(x)
+    else
+        fun_l17_n431(x)
+    end
+end
+
+def fun_l16_n476(x)
+    if (x < 1)
+        fun_l17_n135(x)
+    else
+        fun_l17_n506(x)
+    end
+end
+
+def fun_l16_n477(x)
+    if (x < 1)
+        fun_l17_n57(x)
+    else
+        fun_l17_n944(x)
+    end
+end
+
+def fun_l16_n478(x)
+    if (x < 1)
+        fun_l17_n877(x)
+    else
+        fun_l17_n28(x)
+    end
+end
+
+def fun_l16_n479(x)
+    if (x < 1)
+        fun_l17_n132(x)
+    else
+        fun_l17_n280(x)
+    end
+end
+
+def fun_l16_n480(x)
+    if (x < 1)
+        fun_l17_n514(x)
+    else
+        fun_l17_n51(x)
+    end
+end
+
+def fun_l16_n481(x)
+    if (x < 1)
+        fun_l17_n55(x)
+    else
+        fun_l17_n366(x)
+    end
+end
+
+def fun_l16_n482(x)
+    if (x < 1)
+        fun_l17_n59(x)
+    else
+        fun_l17_n810(x)
+    end
+end
+
+def fun_l16_n483(x)
+    if (x < 1)
+        fun_l17_n965(x)
+    else
+        fun_l17_n55(x)
+    end
+end
+
+def fun_l16_n484(x)
+    if (x < 1)
+        fun_l17_n813(x)
+    else
+        fun_l17_n408(x)
+    end
+end
+
+def fun_l16_n485(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n126(x)
+    end
+end
+
+def fun_l16_n486(x)
+    if (x < 1)
+        fun_l17_n479(x)
+    else
+        fun_l17_n964(x)
+    end
+end
+
+def fun_l16_n487(x)
+    if (x < 1)
+        fun_l17_n267(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n488(x)
+    if (x < 1)
+        fun_l17_n787(x)
+    else
+        fun_l17_n34(x)
+    end
+end
+
+def fun_l16_n489(x)
+    if (x < 1)
+        fun_l17_n223(x)
+    else
+        fun_l17_n568(x)
+    end
+end
+
+def fun_l16_n490(x)
+    if (x < 1)
+        fun_l17_n773(x)
+    else
+        fun_l17_n11(x)
+    end
+end
+
+def fun_l16_n491(x)
+    if (x < 1)
+        fun_l17_n906(x)
+    else
+        fun_l17_n146(x)
+    end
+end
+
+def fun_l16_n492(x)
+    if (x < 1)
+        fun_l17_n221(x)
+    else
+        fun_l17_n136(x)
+    end
+end
+
+def fun_l16_n493(x)
+    if (x < 1)
+        fun_l17_n40(x)
+    else
+        fun_l17_n599(x)
+    end
+end
+
+def fun_l16_n494(x)
+    if (x < 1)
+        fun_l17_n494(x)
+    else
+        fun_l17_n591(x)
+    end
+end
+
+def fun_l16_n495(x)
+    if (x < 1)
+        fun_l17_n237(x)
+    else
+        fun_l17_n149(x)
+    end
+end
+
+def fun_l16_n496(x)
+    if (x < 1)
+        fun_l17_n501(x)
+    else
+        fun_l17_n681(x)
+    end
+end
+
+def fun_l16_n497(x)
+    if (x < 1)
+        fun_l17_n141(x)
+    else
+        fun_l17_n226(x)
+    end
+end
+
+def fun_l16_n498(x)
+    if (x < 1)
+        fun_l17_n868(x)
+    else
+        fun_l17_n837(x)
+    end
+end
+
+def fun_l16_n499(x)
+    if (x < 1)
+        fun_l17_n921(x)
+    else
+        fun_l17_n806(x)
+    end
+end
+
+def fun_l16_n500(x)
+    if (x < 1)
+        fun_l17_n117(x)
+    else
+        fun_l17_n835(x)
+    end
+end
+
+def fun_l16_n501(x)
+    if (x < 1)
+        fun_l17_n872(x)
+    else
+        fun_l17_n567(x)
+    end
+end
+
+def fun_l16_n502(x)
+    if (x < 1)
+        fun_l17_n787(x)
+    else
+        fun_l17_n785(x)
+    end
+end
+
+def fun_l16_n503(x)
+    if (x < 1)
+        fun_l17_n827(x)
+    else
+        fun_l17_n388(x)
+    end
+end
+
+def fun_l16_n504(x)
+    if (x < 1)
+        fun_l17_n328(x)
+    else
+        fun_l17_n849(x)
+    end
+end
+
+def fun_l16_n505(x)
+    if (x < 1)
+        fun_l17_n348(x)
+    else
+        fun_l17_n580(x)
+    end
+end
+
+def fun_l16_n506(x)
+    if (x < 1)
+        fun_l17_n408(x)
+    else
+        fun_l17_n236(x)
+    end
+end
+
+def fun_l16_n507(x)
+    if (x < 1)
+        fun_l17_n959(x)
+    else
+        fun_l17_n739(x)
+    end
+end
+
+def fun_l16_n508(x)
+    if (x < 1)
+        fun_l17_n496(x)
+    else
+        fun_l17_n774(x)
+    end
+end
+
+def fun_l16_n509(x)
+    if (x < 1)
+        fun_l17_n639(x)
+    else
+        fun_l17_n147(x)
+    end
+end
+
+def fun_l16_n510(x)
+    if (x < 1)
+        fun_l17_n910(x)
+    else
+        fun_l17_n697(x)
+    end
+end
+
+def fun_l16_n511(x)
+    if (x < 1)
+        fun_l17_n239(x)
+    else
+        fun_l17_n691(x)
+    end
+end
+
+def fun_l16_n512(x)
+    if (x < 1)
+        fun_l17_n923(x)
+    else
+        fun_l17_n735(x)
+    end
+end
+
+def fun_l16_n513(x)
+    if (x < 1)
+        fun_l17_n911(x)
+    else
+        fun_l17_n372(x)
+    end
+end
+
+def fun_l16_n514(x)
+    if (x < 1)
+        fun_l17_n706(x)
+    else
+        fun_l17_n27(x)
+    end
+end
+
+def fun_l16_n515(x)
+    if (x < 1)
+        fun_l17_n788(x)
+    else
+        fun_l17_n670(x)
+    end
+end
+
+def fun_l16_n516(x)
+    if (x < 1)
+        fun_l17_n507(x)
+    else
+        fun_l17_n330(x)
+    end
+end
+
+def fun_l16_n517(x)
+    if (x < 1)
+        fun_l17_n398(x)
+    else
+        fun_l17_n997(x)
+    end
+end
+
+def fun_l16_n518(x)
+    if (x < 1)
+        fun_l17_n675(x)
+    else
+        fun_l17_n383(x)
+    end
+end
+
+def fun_l16_n519(x)
+    if (x < 1)
+        fun_l17_n193(x)
+    else
+        fun_l17_n611(x)
+    end
+end
+
+def fun_l16_n520(x)
+    if (x < 1)
+        fun_l17_n884(x)
+    else
+        fun_l17_n200(x)
+    end
+end
+
+def fun_l16_n521(x)
+    if (x < 1)
+        fun_l17_n574(x)
+    else
+        fun_l17_n192(x)
+    end
+end
+
+def fun_l16_n522(x)
+    if (x < 1)
+        fun_l17_n883(x)
+    else
+        fun_l17_n399(x)
+    end
+end
+
+def fun_l16_n523(x)
+    if (x < 1)
+        fun_l17_n516(x)
+    else
+        fun_l17_n592(x)
+    end
+end
+
+def fun_l16_n524(x)
+    if (x < 1)
+        fun_l17_n653(x)
+    else
+        fun_l17_n355(x)
+    end
+end
+
+def fun_l16_n525(x)
+    if (x < 1)
+        fun_l17_n872(x)
+    else
+        fun_l17_n714(x)
+    end
+end
+
+def fun_l16_n526(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n70(x)
+    end
+end
+
+def fun_l16_n527(x)
+    if (x < 1)
+        fun_l17_n46(x)
+    else
+        fun_l17_n591(x)
+    end
+end
+
+def fun_l16_n528(x)
+    if (x < 1)
+        fun_l17_n969(x)
+    else
+        fun_l17_n289(x)
+    end
+end
+
+def fun_l16_n529(x)
+    if (x < 1)
+        fun_l17_n713(x)
+    else
+        fun_l17_n775(x)
+    end
+end
+
+def fun_l16_n530(x)
+    if (x < 1)
+        fun_l17_n374(x)
+    else
+        fun_l17_n708(x)
+    end
+end
+
+def fun_l16_n531(x)
+    if (x < 1)
+        fun_l17_n996(x)
+    else
+        fun_l17_n764(x)
+    end
+end
+
+def fun_l16_n532(x)
+    if (x < 1)
+        fun_l17_n314(x)
+    else
+        fun_l17_n445(x)
+    end
+end
+
+def fun_l16_n533(x)
+    if (x < 1)
+        fun_l17_n951(x)
+    else
+        fun_l17_n912(x)
+    end
+end
+
+def fun_l16_n534(x)
+    if (x < 1)
+        fun_l17_n760(x)
+    else
+        fun_l17_n445(x)
+    end
+end
+
+def fun_l16_n535(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n16(x)
+    end
+end
+
+def fun_l16_n536(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n693(x)
+    end
+end
+
+def fun_l16_n537(x)
+    if (x < 1)
+        fun_l17_n631(x)
+    else
+        fun_l17_n934(x)
+    end
+end
+
+def fun_l16_n538(x)
+    if (x < 1)
+        fun_l17_n944(x)
+    else
+        fun_l17_n922(x)
+    end
+end
+
+def fun_l16_n539(x)
+    if (x < 1)
+        fun_l17_n263(x)
+    else
+        fun_l17_n796(x)
+    end
+end
+
+def fun_l16_n540(x)
+    if (x < 1)
+        fun_l17_n928(x)
+    else
+        fun_l17_n604(x)
+    end
+end
+
+def fun_l16_n541(x)
+    if (x < 1)
+        fun_l17_n678(x)
+    else
+        fun_l17_n880(x)
+    end
+end
+
+def fun_l16_n542(x)
+    if (x < 1)
+        fun_l17_n286(x)
+    else
+        fun_l17_n123(x)
+    end
+end
+
+def fun_l16_n543(x)
+    if (x < 1)
+        fun_l17_n604(x)
+    else
+        fun_l17_n57(x)
+    end
+end
+
+def fun_l16_n544(x)
+    if (x < 1)
+        fun_l17_n204(x)
+    else
+        fun_l17_n950(x)
+    end
+end
+
+def fun_l16_n545(x)
+    if (x < 1)
+        fun_l17_n60(x)
+    else
+        fun_l17_n667(x)
+    end
+end
+
+def fun_l16_n546(x)
+    if (x < 1)
+        fun_l17_n472(x)
+    else
+        fun_l17_n818(x)
+    end
+end
+
+def fun_l16_n547(x)
+    if (x < 1)
+        fun_l17_n515(x)
+    else
+        fun_l17_n180(x)
+    end
+end
+
+def fun_l16_n548(x)
+    if (x < 1)
+        fun_l17_n443(x)
+    else
+        fun_l17_n159(x)
+    end
+end
+
+def fun_l16_n549(x)
+    if (x < 1)
+        fun_l17_n820(x)
+    else
+        fun_l17_n468(x)
+    end
+end
+
+def fun_l16_n550(x)
+    if (x < 1)
+        fun_l17_n938(x)
+    else
+        fun_l17_n307(x)
+    end
+end
+
+def fun_l16_n551(x)
+    if (x < 1)
+        fun_l17_n350(x)
+    else
+        fun_l17_n177(x)
+    end
+end
+
+def fun_l16_n552(x)
+    if (x < 1)
+        fun_l17_n761(x)
+    else
+        fun_l17_n35(x)
+    end
+end
+
+def fun_l16_n553(x)
+    if (x < 1)
+        fun_l17_n189(x)
+    else
+        fun_l17_n991(x)
+    end
+end
+
+def fun_l16_n554(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n721(x)
+    end
+end
+
+def fun_l16_n555(x)
+    if (x < 1)
+        fun_l17_n42(x)
+    else
+        fun_l17_n273(x)
+    end
+end
+
+def fun_l16_n556(x)
+    if (x < 1)
+        fun_l17_n261(x)
+    else
+        fun_l17_n328(x)
+    end
+end
+
+def fun_l16_n557(x)
+    if (x < 1)
+        fun_l17_n28(x)
+    else
+        fun_l17_n403(x)
+    end
+end
+
+def fun_l16_n558(x)
+    if (x < 1)
+        fun_l17_n766(x)
+    else
+        fun_l17_n363(x)
+    end
+end
+
+def fun_l16_n559(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n648(x)
+    end
+end
+
+def fun_l16_n560(x)
+    if (x < 1)
+        fun_l17_n288(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n561(x)
+    if (x < 1)
+        fun_l17_n529(x)
+    else
+        fun_l17_n908(x)
+    end
+end
+
+def fun_l16_n562(x)
+    if (x < 1)
+        fun_l17_n244(x)
+    else
+        fun_l17_n342(x)
+    end
+end
+
+def fun_l16_n563(x)
+    if (x < 1)
+        fun_l17_n535(x)
+    else
+        fun_l17_n750(x)
+    end
+end
+
+def fun_l16_n564(x)
+    if (x < 1)
+        fun_l17_n761(x)
+    else
+        fun_l17_n106(x)
+    end
+end
+
+def fun_l16_n565(x)
+    if (x < 1)
+        fun_l17_n236(x)
+    else
+        fun_l17_n95(x)
+    end
+end
+
+def fun_l16_n566(x)
+    if (x < 1)
+        fun_l17_n356(x)
+    else
+        fun_l17_n129(x)
+    end
+end
+
+def fun_l16_n567(x)
+    if (x < 1)
+        fun_l17_n297(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n568(x)
+    if (x < 1)
+        fun_l17_n735(x)
+    else
+        fun_l17_n781(x)
+    end
+end
+
+def fun_l16_n569(x)
+    if (x < 1)
+        fun_l17_n650(x)
+    else
+        fun_l17_n377(x)
+    end
+end
+
+def fun_l16_n570(x)
+    if (x < 1)
+        fun_l17_n872(x)
+    else
+        fun_l17_n52(x)
+    end
+end
+
+def fun_l16_n571(x)
+    if (x < 1)
+        fun_l17_n970(x)
+    else
+        fun_l17_n719(x)
+    end
+end
+
+def fun_l16_n572(x)
+    if (x < 1)
+        fun_l17_n380(x)
+    else
+        fun_l17_n121(x)
+    end
+end
+
+def fun_l16_n573(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n675(x)
+    end
+end
+
+def fun_l16_n574(x)
+    if (x < 1)
+        fun_l17_n269(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n575(x)
+    if (x < 1)
+        fun_l17_n480(x)
+    else
+        fun_l17_n228(x)
+    end
+end
+
+def fun_l16_n576(x)
+    if (x < 1)
+        fun_l17_n791(x)
+    else
+        fun_l17_n45(x)
+    end
+end
+
+def fun_l16_n577(x)
+    if (x < 1)
+        fun_l17_n403(x)
+    else
+        fun_l17_n887(x)
+    end
+end
+
+def fun_l16_n578(x)
+    if (x < 1)
+        fun_l17_n139(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n579(x)
+    if (x < 1)
+        fun_l17_n472(x)
+    else
+        fun_l17_n869(x)
+    end
+end
+
+def fun_l16_n580(x)
+    if (x < 1)
+        fun_l17_n738(x)
+    else
+        fun_l17_n298(x)
+    end
+end
+
+def fun_l16_n581(x)
+    if (x < 1)
+        fun_l17_n822(x)
+    else
+        fun_l17_n859(x)
+    end
+end
+
+def fun_l16_n582(x)
+    if (x < 1)
+        fun_l17_n768(x)
+    else
+        fun_l17_n814(x)
+    end
+end
+
+def fun_l16_n583(x)
+    if (x < 1)
+        fun_l17_n892(x)
+    else
+        fun_l17_n821(x)
+    end
+end
+
+def fun_l16_n584(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n276(x)
+    end
+end
+
+def fun_l16_n585(x)
+    if (x < 1)
+        fun_l17_n162(x)
+    else
+        fun_l17_n873(x)
+    end
+end
+
+def fun_l16_n586(x)
+    if (x < 1)
+        fun_l17_n932(x)
+    else
+        fun_l17_n227(x)
+    end
+end
+
+def fun_l16_n587(x)
+    if (x < 1)
+        fun_l17_n105(x)
+    else
+        fun_l17_n620(x)
+    end
+end
+
+def fun_l16_n588(x)
+    if (x < 1)
+        fun_l17_n137(x)
+    else
+        fun_l17_n941(x)
+    end
+end
+
+def fun_l16_n589(x)
+    if (x < 1)
+        fun_l17_n936(x)
+    else
+        fun_l17_n877(x)
+    end
+end
+
+def fun_l16_n590(x)
+    if (x < 1)
+        fun_l17_n280(x)
+    else
+        fun_l17_n711(x)
+    end
+end
+
+def fun_l16_n591(x)
+    if (x < 1)
+        fun_l17_n968(x)
+    else
+        fun_l17_n695(x)
+    end
+end
+
+def fun_l16_n592(x)
+    if (x < 1)
+        fun_l17_n774(x)
+    else
+        fun_l17_n674(x)
+    end
+end
+
+def fun_l16_n593(x)
+    if (x < 1)
+        fun_l17_n421(x)
+    else
+        fun_l17_n516(x)
+    end
+end
+
+def fun_l16_n594(x)
+    if (x < 1)
+        fun_l17_n830(x)
+    else
+        fun_l17_n852(x)
+    end
+end
+
+def fun_l16_n595(x)
+    if (x < 1)
+        fun_l17_n659(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n596(x)
+    if (x < 1)
+        fun_l17_n411(x)
+    else
+        fun_l17_n217(x)
+    end
+end
+
+def fun_l16_n597(x)
+    if (x < 1)
+        fun_l17_n506(x)
+    else
+        fun_l17_n721(x)
+    end
+end
+
+def fun_l16_n598(x)
+    if (x < 1)
+        fun_l17_n979(x)
+    else
+        fun_l17_n579(x)
+    end
+end
+
+def fun_l16_n599(x)
+    if (x < 1)
+        fun_l17_n423(x)
+    else
+        fun_l17_n765(x)
+    end
+end
+
+def fun_l16_n600(x)
+    if (x < 1)
+        fun_l17_n138(x)
+    else
+        fun_l17_n878(x)
+    end
+end
+
+def fun_l16_n601(x)
+    if (x < 1)
+        fun_l17_n616(x)
+    else
+        fun_l17_n531(x)
+    end
+end
+
+def fun_l16_n602(x)
+    if (x < 1)
+        fun_l17_n737(x)
+    else
+        fun_l17_n936(x)
+    end
+end
+
+def fun_l16_n603(x)
+    if (x < 1)
+        fun_l17_n106(x)
+    else
+        fun_l17_n147(x)
+    end
+end
+
+def fun_l16_n604(x)
+    if (x < 1)
+        fun_l17_n562(x)
+    else
+        fun_l17_n852(x)
+    end
+end
+
+def fun_l16_n605(x)
+    if (x < 1)
+        fun_l17_n473(x)
+    else
+        fun_l17_n771(x)
+    end
+end
+
+def fun_l16_n606(x)
+    if (x < 1)
+        fun_l17_n778(x)
+    else
+        fun_l17_n463(x)
+    end
+end
+
+def fun_l16_n607(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n341(x)
+    end
+end
+
+def fun_l16_n608(x)
+    if (x < 1)
+        fun_l17_n268(x)
+    else
+        fun_l17_n659(x)
+    end
+end
+
+def fun_l16_n609(x)
+    if (x < 1)
+        fun_l17_n734(x)
+    else
+        fun_l17_n174(x)
+    end
+end
+
+def fun_l16_n610(x)
+    if (x < 1)
+        fun_l17_n815(x)
+    else
+        fun_l17_n798(x)
+    end
+end
+
+def fun_l16_n611(x)
+    if (x < 1)
+        fun_l17_n251(x)
+    else
+        fun_l17_n694(x)
+    end
+end
+
+def fun_l16_n612(x)
+    if (x < 1)
+        fun_l17_n597(x)
+    else
+        fun_l17_n245(x)
+    end
+end
+
+def fun_l16_n613(x)
+    if (x < 1)
+        fun_l17_n990(x)
+    else
+        fun_l17_n58(x)
+    end
+end
+
+def fun_l16_n614(x)
+    if (x < 1)
+        fun_l17_n877(x)
+    else
+        fun_l17_n13(x)
+    end
+end
+
+def fun_l16_n615(x)
+    if (x < 1)
+        fun_l17_n7(x)
+    else
+        fun_l17_n787(x)
+    end
+end
+
+def fun_l16_n616(x)
+    if (x < 1)
+        fun_l17_n372(x)
+    else
+        fun_l17_n643(x)
+    end
+end
+
+def fun_l16_n617(x)
+    if (x < 1)
+        fun_l17_n592(x)
+    else
+        fun_l17_n508(x)
+    end
+end
+
+def fun_l16_n618(x)
+    if (x < 1)
+        fun_l17_n928(x)
+    else
+        fun_l17_n923(x)
+    end
+end
+
+def fun_l16_n619(x)
+    if (x < 1)
+        fun_l17_n407(x)
+    else
+        fun_l17_n885(x)
+    end
+end
+
+def fun_l16_n620(x)
+    if (x < 1)
+        fun_l17_n4(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n621(x)
+    if (x < 1)
+        fun_l17_n791(x)
+    else
+        fun_l17_n141(x)
+    end
+end
+
+def fun_l16_n622(x)
+    if (x < 1)
+        fun_l17_n529(x)
+    else
+        fun_l17_n140(x)
+    end
+end
+
+def fun_l16_n623(x)
+    if (x < 1)
+        fun_l17_n713(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n624(x)
+    if (x < 1)
+        fun_l17_n148(x)
+    else
+        fun_l17_n195(x)
+    end
+end
+
+def fun_l16_n625(x)
+    if (x < 1)
+        fun_l17_n287(x)
+    else
+        fun_l17_n662(x)
+    end
+end
+
+def fun_l16_n626(x)
+    if (x < 1)
+        fun_l17_n678(x)
+    else
+        fun_l17_n262(x)
+    end
+end
+
+def fun_l16_n627(x)
+    if (x < 1)
+        fun_l17_n217(x)
+    else
+        fun_l17_n612(x)
+    end
+end
+
+def fun_l16_n628(x)
+    if (x < 1)
+        fun_l17_n826(x)
+    else
+        fun_l17_n164(x)
+    end
+end
+
+def fun_l16_n629(x)
+    if (x < 1)
+        fun_l17_n360(x)
+    else
+        fun_l17_n221(x)
+    end
+end
+
+def fun_l16_n630(x)
+    if (x < 1)
+        fun_l17_n842(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n631(x)
+    if (x < 1)
+        fun_l17_n53(x)
+    else
+        fun_l17_n216(x)
+    end
+end
+
+def fun_l16_n632(x)
+    if (x < 1)
+        fun_l17_n628(x)
+    else
+        fun_l17_n150(x)
+    end
+end
+
+def fun_l16_n633(x)
+    if (x < 1)
+        fun_l17_n206(x)
+    else
+        fun_l17_n789(x)
+    end
+end
+
+def fun_l16_n634(x)
+    if (x < 1)
+        fun_l17_n26(x)
+    else
+        fun_l17_n376(x)
+    end
+end
+
+def fun_l16_n635(x)
+    if (x < 1)
+        fun_l17_n614(x)
+    else
+        fun_l17_n109(x)
+    end
+end
+
+def fun_l16_n636(x)
+    if (x < 1)
+        fun_l17_n626(x)
+    else
+        fun_l17_n456(x)
+    end
+end
+
+def fun_l16_n637(x)
+    if (x < 1)
+        fun_l17_n836(x)
+    else
+        fun_l17_n602(x)
+    end
+end
+
+def fun_l16_n638(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n791(x)
+    end
+end
+
+def fun_l16_n639(x)
+    if (x < 1)
+        fun_l17_n689(x)
+    else
+        fun_l17_n714(x)
+    end
+end
+
+def fun_l16_n640(x)
+    if (x < 1)
+        fun_l17_n587(x)
+    else
+        fun_l17_n203(x)
+    end
+end
+
+def fun_l16_n641(x)
+    if (x < 1)
+        fun_l17_n686(x)
+    else
+        fun_l17_n297(x)
+    end
+end
+
+def fun_l16_n642(x)
+    if (x < 1)
+        fun_l17_n394(x)
+    else
+        fun_l17_n564(x)
+    end
+end
+
+def fun_l16_n643(x)
+    if (x < 1)
+        fun_l17_n669(x)
+    else
+        fun_l17_n250(x)
+    end
+end
+
+def fun_l16_n644(x)
+    if (x < 1)
+        fun_l17_n407(x)
+    else
+        fun_l17_n631(x)
+    end
+end
+
+def fun_l16_n645(x)
+    if (x < 1)
+        fun_l17_n928(x)
+    else
+        fun_l17_n856(x)
+    end
+end
+
+def fun_l16_n646(x)
+    if (x < 1)
+        fun_l17_n344(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n647(x)
+    if (x < 1)
+        fun_l17_n540(x)
+    else
+        fun_l17_n468(x)
+    end
+end
+
+def fun_l16_n648(x)
+    if (x < 1)
+        fun_l17_n831(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n649(x)
+    if (x < 1)
+        fun_l17_n154(x)
+    else
+        fun_l17_n587(x)
+    end
+end
+
+def fun_l16_n650(x)
+    if (x < 1)
+        fun_l17_n379(x)
+    else
+        fun_l17_n421(x)
+    end
+end
+
+def fun_l16_n651(x)
+    if (x < 1)
+        fun_l17_n839(x)
+    else
+        fun_l17_n782(x)
+    end
+end
+
+def fun_l16_n652(x)
+    if (x < 1)
+        fun_l17_n408(x)
+    else
+        fun_l17_n923(x)
+    end
+end
+
+def fun_l16_n653(x)
+    if (x < 1)
+        fun_l17_n51(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n654(x)
+    if (x < 1)
+        fun_l17_n635(x)
+    else
+        fun_l17_n39(x)
+    end
+end
+
+def fun_l16_n655(x)
+    if (x < 1)
+        fun_l17_n921(x)
+    else
+        fun_l17_n641(x)
+    end
+end
+
+def fun_l16_n656(x)
+    if (x < 1)
+        fun_l17_n615(x)
+    else
+        fun_l17_n118(x)
+    end
+end
+
+def fun_l16_n657(x)
+    if (x < 1)
+        fun_l17_n673(x)
+    else
+        fun_l17_n842(x)
+    end
+end
+
+def fun_l16_n658(x)
+    if (x < 1)
+        fun_l17_n743(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n659(x)
+    if (x < 1)
+        fun_l17_n85(x)
+    else
+        fun_l17_n787(x)
+    end
+end
+
+def fun_l16_n660(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n830(x)
+    end
+end
+
+def fun_l16_n661(x)
+    if (x < 1)
+        fun_l17_n897(x)
+    else
+        fun_l17_n989(x)
+    end
+end
+
+def fun_l16_n662(x)
+    if (x < 1)
+        fun_l17_n644(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n663(x)
+    if (x < 1)
+        fun_l17_n812(x)
+    else
+        fun_l17_n159(x)
+    end
+end
+
+def fun_l16_n664(x)
+    if (x < 1)
+        fun_l17_n937(x)
+    else
+        fun_l17_n720(x)
+    end
+end
+
+def fun_l16_n665(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n516(x)
+    end
+end
+
+def fun_l16_n666(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n728(x)
+    end
+end
+
+def fun_l16_n667(x)
+    if (x < 1)
+        fun_l17_n673(x)
+    else
+        fun_l17_n735(x)
+    end
+end
+
+def fun_l16_n668(x)
+    if (x < 1)
+        fun_l17_n321(x)
+    else
+        fun_l17_n850(x)
+    end
+end
+
+def fun_l16_n669(x)
+    if (x < 1)
+        fun_l17_n873(x)
+    else
+        fun_l17_n701(x)
+    end
+end
+
+def fun_l16_n670(x)
+    if (x < 1)
+        fun_l17_n683(x)
+    else
+        fun_l17_n903(x)
+    end
+end
+
+def fun_l16_n671(x)
+    if (x < 1)
+        fun_l17_n440(x)
+    else
+        fun_l17_n178(x)
+    end
+end
+
+def fun_l16_n672(x)
+    if (x < 1)
+        fun_l17_n619(x)
+    else
+        fun_l17_n785(x)
+    end
+end
+
+def fun_l16_n673(x)
+    if (x < 1)
+        fun_l17_n185(x)
+    else
+        fun_l17_n794(x)
+    end
+end
+
+def fun_l16_n674(x)
+    if (x < 1)
+        fun_l17_n543(x)
+    else
+        fun_l17_n161(x)
+    end
+end
+
+def fun_l16_n675(x)
+    if (x < 1)
+        fun_l17_n898(x)
+    else
+        fun_l17_n590(x)
+    end
+end
+
+def fun_l16_n676(x)
+    if (x < 1)
+        fun_l17_n471(x)
+    else
+        fun_l17_n66(x)
+    end
+end
+
+def fun_l16_n677(x)
+    if (x < 1)
+        fun_l17_n764(x)
+    else
+        fun_l17_n163(x)
+    end
+end
+
+def fun_l16_n678(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n353(x)
+    end
+end
+
+def fun_l16_n679(x)
+    if (x < 1)
+        fun_l17_n851(x)
+    else
+        fun_l17_n7(x)
+    end
+end
+
+def fun_l16_n680(x)
+    if (x < 1)
+        fun_l17_n741(x)
+    else
+        fun_l17_n180(x)
+    end
+end
+
+def fun_l16_n681(x)
+    if (x < 1)
+        fun_l17_n887(x)
+    else
+        fun_l17_n258(x)
+    end
+end
+
+def fun_l16_n682(x)
+    if (x < 1)
+        fun_l17_n536(x)
+    else
+        fun_l17_n84(x)
+    end
+end
+
+def fun_l16_n683(x)
+    if (x < 1)
+        fun_l17_n447(x)
+    else
+        fun_l17_n455(x)
+    end
+end
+
+def fun_l16_n684(x)
+    if (x < 1)
+        fun_l17_n23(x)
+    else
+        fun_l17_n47(x)
+    end
+end
+
+def fun_l16_n685(x)
+    if (x < 1)
+        fun_l17_n983(x)
+    else
+        fun_l17_n470(x)
+    end
+end
+
+def fun_l16_n686(x)
+    if (x < 1)
+        fun_l17_n261(x)
+    else
+        fun_l17_n138(x)
+    end
+end
+
+def fun_l16_n687(x)
+    if (x < 1)
+        fun_l17_n791(x)
+    else
+        fun_l17_n474(x)
+    end
+end
+
+def fun_l16_n688(x)
+    if (x < 1)
+        fun_l17_n148(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n689(x)
+    if (x < 1)
+        fun_l17_n107(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n690(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n394(x)
+    end
+end
+
+def fun_l16_n691(x)
+    if (x < 1)
+        fun_l17_n193(x)
+    else
+        fun_l17_n348(x)
+    end
+end
+
+def fun_l16_n692(x)
+    if (x < 1)
+        fun_l17_n308(x)
+    else
+        fun_l17_n26(x)
+    end
+end
+
+def fun_l16_n693(x)
+    if (x < 1)
+        fun_l17_n502(x)
+    else
+        fun_l17_n517(x)
+    end
+end
+
+def fun_l16_n694(x)
+    if (x < 1)
+        fun_l17_n396(x)
+    else
+        fun_l17_n886(x)
+    end
+end
+
+def fun_l16_n695(x)
+    if (x < 1)
+        fun_l17_n179(x)
+    else
+        fun_l17_n35(x)
+    end
+end
+
+def fun_l16_n696(x)
+    if (x < 1)
+        fun_l17_n431(x)
+    else
+        fun_l17_n392(x)
+    end
+end
+
+def fun_l16_n697(x)
+    if (x < 1)
+        fun_l17_n778(x)
+    else
+        fun_l17_n766(x)
+    end
+end
+
+def fun_l16_n698(x)
+    if (x < 1)
+        fun_l17_n868(x)
+    else
+        fun_l17_n31(x)
+    end
+end
+
+def fun_l16_n699(x)
+    if (x < 1)
+        fun_l17_n277(x)
+    else
+        fun_l17_n649(x)
+    end
+end
+
+def fun_l16_n700(x)
+    if (x < 1)
+        fun_l17_n638(x)
+    else
+        fun_l17_n411(x)
+    end
+end
+
+def fun_l16_n701(x)
+    if (x < 1)
+        fun_l17_n730(x)
+    else
+        fun_l17_n188(x)
+    end
+end
+
+def fun_l16_n702(x)
+    if (x < 1)
+        fun_l17_n530(x)
+    else
+        fun_l17_n540(x)
+    end
+end
+
+def fun_l16_n703(x)
+    if (x < 1)
+        fun_l17_n691(x)
+    else
+        fun_l17_n550(x)
+    end
+end
+
+def fun_l16_n704(x)
+    if (x < 1)
+        fun_l17_n691(x)
+    else
+        fun_l17_n25(x)
+    end
+end
+
+def fun_l16_n705(x)
+    if (x < 1)
+        fun_l17_n744(x)
+    else
+        fun_l17_n333(x)
+    end
+end
+
+def fun_l16_n706(x)
+    if (x < 1)
+        fun_l17_n845(x)
+    else
+        fun_l17_n229(x)
+    end
+end
+
+def fun_l16_n707(x)
+    if (x < 1)
+        fun_l17_n784(x)
+    else
+        fun_l17_n123(x)
+    end
+end
+
+def fun_l16_n708(x)
+    if (x < 1)
+        fun_l17_n88(x)
+    else
+        fun_l17_n961(x)
+    end
+end
+
+def fun_l16_n709(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n943(x)
+    end
+end
+
+def fun_l16_n710(x)
+    if (x < 1)
+        fun_l17_n265(x)
+    else
+        fun_l17_n958(x)
+    end
+end
+
+def fun_l16_n711(x)
+    if (x < 1)
+        fun_l17_n483(x)
+    else
+        fun_l17_n577(x)
+    end
+end
+
+def fun_l16_n712(x)
+    if (x < 1)
+        fun_l17_n703(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n713(x)
+    if (x < 1)
+        fun_l17_n301(x)
+    else
+        fun_l17_n17(x)
+    end
+end
+
+def fun_l16_n714(x)
+    if (x < 1)
+        fun_l17_n455(x)
+    else
+        fun_l17_n647(x)
+    end
+end
+
+def fun_l16_n715(x)
+    if (x < 1)
+        fun_l17_n628(x)
+    else
+        fun_l17_n748(x)
+    end
+end
+
+def fun_l16_n716(x)
+    if (x < 1)
+        fun_l17_n10(x)
+    else
+        fun_l17_n632(x)
+    end
+end
+
+def fun_l16_n717(x)
+    if (x < 1)
+        fun_l17_n82(x)
+    else
+        fun_l17_n888(x)
+    end
+end
+
+def fun_l16_n718(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n719(x)
+    if (x < 1)
+        fun_l17_n811(x)
+    else
+        fun_l17_n46(x)
+    end
+end
+
+def fun_l16_n720(x)
+    if (x < 1)
+        fun_l17_n227(x)
+    else
+        fun_l17_n89(x)
+    end
+end
+
+def fun_l16_n721(x)
+    if (x < 1)
+        fun_l17_n780(x)
+    else
+        fun_l17_n941(x)
+    end
+end
+
+def fun_l16_n722(x)
+    if (x < 1)
+        fun_l17_n877(x)
+    else
+        fun_l17_n262(x)
+    end
+end
+
+def fun_l16_n723(x)
+    if (x < 1)
+        fun_l17_n649(x)
+    else
+        fun_l17_n477(x)
+    end
+end
+
+def fun_l16_n724(x)
+    if (x < 1)
+        fun_l17_n902(x)
+    else
+        fun_l17_n315(x)
+    end
+end
+
+def fun_l16_n725(x)
+    if (x < 1)
+        fun_l17_n985(x)
+    else
+        fun_l17_n232(x)
+    end
+end
+
+def fun_l16_n726(x)
+    if (x < 1)
+        fun_l17_n5(x)
+    else
+        fun_l17_n981(x)
+    end
+end
+
+def fun_l16_n727(x)
+    if (x < 1)
+        fun_l17_n730(x)
+    else
+        fun_l17_n780(x)
+    end
+end
+
+def fun_l16_n728(x)
+    if (x < 1)
+        fun_l17_n626(x)
+    else
+        fun_l17_n272(x)
+    end
+end
+
+def fun_l16_n729(x)
+    if (x < 1)
+        fun_l17_n380(x)
+    else
+        fun_l17_n289(x)
+    end
+end
+
+def fun_l16_n730(x)
+    if (x < 1)
+        fun_l17_n711(x)
+    else
+        fun_l17_n861(x)
+    end
+end
+
+def fun_l16_n731(x)
+    if (x < 1)
+        fun_l17_n351(x)
+    else
+        fun_l17_n948(x)
+    end
+end
+
+def fun_l16_n732(x)
+    if (x < 1)
+        fun_l17_n864(x)
+    else
+        fun_l17_n60(x)
+    end
+end
+
+def fun_l16_n733(x)
+    if (x < 1)
+        fun_l17_n974(x)
+    else
+        fun_l17_n475(x)
+    end
+end
+
+def fun_l16_n734(x)
+    if (x < 1)
+        fun_l17_n855(x)
+    else
+        fun_l17_n988(x)
+    end
+end
+
+def fun_l16_n735(x)
+    if (x < 1)
+        fun_l17_n740(x)
+    else
+        fun_l17_n559(x)
+    end
+end
+
+def fun_l16_n736(x)
+    if (x < 1)
+        fun_l17_n449(x)
+    else
+        fun_l17_n580(x)
+    end
+end
+
+def fun_l16_n737(x)
+    if (x < 1)
+        fun_l17_n313(x)
+    else
+        fun_l17_n462(x)
+    end
+end
+
+def fun_l16_n738(x)
+    if (x < 1)
+        fun_l17_n177(x)
+    else
+        fun_l17_n812(x)
+    end
+end
+
+def fun_l16_n739(x)
+    if (x < 1)
+        fun_l17_n518(x)
+    else
+        fun_l17_n453(x)
+    end
+end
+
+def fun_l16_n740(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n722(x)
+    end
+end
+
+def fun_l16_n741(x)
+    if (x < 1)
+        fun_l17_n509(x)
+    else
+        fun_l17_n203(x)
+    end
+end
+
+def fun_l16_n742(x)
+    if (x < 1)
+        fun_l17_n901(x)
+    else
+        fun_l17_n497(x)
+    end
+end
+
+def fun_l16_n743(x)
+    if (x < 1)
+        fun_l17_n19(x)
+    else
+        fun_l17_n789(x)
+    end
+end
+
+def fun_l16_n744(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n745(x)
+    if (x < 1)
+        fun_l17_n106(x)
+    else
+        fun_l17_n255(x)
+    end
+end
+
+def fun_l16_n746(x)
+    if (x < 1)
+        fun_l17_n942(x)
+    else
+        fun_l17_n701(x)
+    end
+end
+
+def fun_l16_n747(x)
+    if (x < 1)
+        fun_l17_n738(x)
+    else
+        fun_l17_n459(x)
+    end
+end
+
+def fun_l16_n748(x)
+    if (x < 1)
+        fun_l17_n984(x)
+    else
+        fun_l17_n501(x)
+    end
+end
+
+def fun_l16_n749(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n165(x)
+    end
+end
+
+def fun_l16_n750(x)
+    if (x < 1)
+        fun_l17_n956(x)
+    else
+        fun_l17_n210(x)
+    end
+end
+
+def fun_l16_n751(x)
+    if (x < 1)
+        fun_l17_n549(x)
+    else
+        fun_l17_n406(x)
+    end
+end
+
+def fun_l16_n752(x)
+    if (x < 1)
+        fun_l17_n671(x)
+    else
+        fun_l17_n809(x)
+    end
+end
+
+def fun_l16_n753(x)
+    if (x < 1)
+        fun_l17_n807(x)
+    else
+        fun_l17_n544(x)
+    end
+end
+
+def fun_l16_n754(x)
+    if (x < 1)
+        fun_l17_n150(x)
+    else
+        fun_l17_n705(x)
+    end
+end
+
+def fun_l16_n755(x)
+    if (x < 1)
+        fun_l17_n822(x)
+    else
+        fun_l17_n627(x)
+    end
+end
+
+def fun_l16_n756(x)
+    if (x < 1)
+        fun_l17_n429(x)
+    else
+        fun_l17_n598(x)
+    end
+end
+
+def fun_l16_n757(x)
+    if (x < 1)
+        fun_l17_n327(x)
+    else
+        fun_l17_n391(x)
+    end
+end
+
+def fun_l16_n758(x)
+    if (x < 1)
+        fun_l17_n335(x)
+    else
+        fun_l17_n779(x)
+    end
+end
+
+def fun_l16_n759(x)
+    if (x < 1)
+        fun_l17_n149(x)
+    else
+        fun_l17_n637(x)
+    end
+end
+
+def fun_l16_n760(x)
+    if (x < 1)
+        fun_l17_n83(x)
+    else
+        fun_l17_n616(x)
+    end
+end
+
+def fun_l16_n761(x)
+    if (x < 1)
+        fun_l17_n997(x)
+    else
+        fun_l17_n189(x)
+    end
+end
+
+def fun_l16_n762(x)
+    if (x < 1)
+        fun_l17_n779(x)
+    else
+        fun_l17_n175(x)
+    end
+end
+
+def fun_l16_n763(x)
+    if (x < 1)
+        fun_l17_n73(x)
+    else
+        fun_l17_n473(x)
+    end
+end
+
+def fun_l16_n764(x)
+    if (x < 1)
+        fun_l17_n784(x)
+    else
+        fun_l17_n415(x)
+    end
+end
+
+def fun_l16_n765(x)
+    if (x < 1)
+        fun_l17_n809(x)
+    else
+        fun_l17_n263(x)
+    end
+end
+
+def fun_l16_n766(x)
+    if (x < 1)
+        fun_l17_n114(x)
+    else
+        fun_l17_n898(x)
+    end
+end
+
+def fun_l16_n767(x)
+    if (x < 1)
+        fun_l17_n983(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n768(x)
+    if (x < 1)
+        fun_l17_n141(x)
+    else
+        fun_l17_n492(x)
+    end
+end
+
+def fun_l16_n769(x)
+    if (x < 1)
+        fun_l17_n216(x)
+    else
+        fun_l17_n610(x)
+    end
+end
+
+def fun_l16_n770(x)
+    if (x < 1)
+        fun_l17_n797(x)
+    else
+        fun_l17_n164(x)
+    end
+end
+
+def fun_l16_n771(x)
+    if (x < 1)
+        fun_l17_n434(x)
+    else
+        fun_l17_n876(x)
+    end
+end
+
+def fun_l16_n772(x)
+    if (x < 1)
+        fun_l17_n165(x)
+    else
+        fun_l17_n646(x)
+    end
+end
+
+def fun_l16_n773(x)
+    if (x < 1)
+        fun_l17_n359(x)
+    else
+        fun_l17_n754(x)
+    end
+end
+
+def fun_l16_n774(x)
+    if (x < 1)
+        fun_l17_n314(x)
+    else
+        fun_l17_n745(x)
+    end
+end
+
+def fun_l16_n775(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n673(x)
+    end
+end
+
+def fun_l16_n776(x)
+    if (x < 1)
+        fun_l17_n51(x)
+    else
+        fun_l17_n708(x)
+    end
+end
+
+def fun_l16_n777(x)
+    if (x < 1)
+        fun_l17_n451(x)
+    else
+        fun_l17_n30(x)
+    end
+end
+
+def fun_l16_n778(x)
+    if (x < 1)
+        fun_l17_n821(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n779(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n71(x)
+    end
+end
+
+def fun_l16_n780(x)
+    if (x < 1)
+        fun_l17_n404(x)
+    else
+        fun_l17_n42(x)
+    end
+end
+
+def fun_l16_n781(x)
+    if (x < 1)
+        fun_l17_n926(x)
+    else
+        fun_l17_n53(x)
+    end
+end
+
+def fun_l16_n782(x)
+    if (x < 1)
+        fun_l17_n499(x)
+    else
+        fun_l17_n429(x)
+    end
+end
+
+def fun_l16_n783(x)
+    if (x < 1)
+        fun_l17_n887(x)
+    else
+        fun_l17_n912(x)
+    end
+end
+
+def fun_l16_n784(x)
+    if (x < 1)
+        fun_l17_n900(x)
+    else
+        fun_l17_n163(x)
+    end
+end
+
+def fun_l16_n785(x)
+    if (x < 1)
+        fun_l17_n589(x)
+    else
+        fun_l17_n271(x)
+    end
+end
+
+def fun_l16_n786(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n296(x)
+    end
+end
+
+def fun_l16_n787(x)
+    if (x < 1)
+        fun_l17_n711(x)
+    else
+        fun_l17_n777(x)
+    end
+end
+
+def fun_l16_n788(x)
+    if (x < 1)
+        fun_l17_n426(x)
+    else
+        fun_l17_n291(x)
+    end
+end
+
+def fun_l16_n789(x)
+    if (x < 1)
+        fun_l17_n833(x)
+    else
+        fun_l17_n958(x)
+    end
+end
+
+def fun_l16_n790(x)
+    if (x < 1)
+        fun_l17_n680(x)
+    else
+        fun_l17_n707(x)
+    end
+end
+
+def fun_l16_n791(x)
+    if (x < 1)
+        fun_l17_n668(x)
+    else
+        fun_l17_n727(x)
+    end
+end
+
+def fun_l16_n792(x)
+    if (x < 1)
+        fun_l17_n948(x)
+    else
+        fun_l17_n160(x)
+    end
+end
+
+def fun_l16_n793(x)
+    if (x < 1)
+        fun_l17_n847(x)
+    else
+        fun_l17_n643(x)
+    end
+end
+
+def fun_l16_n794(x)
+    if (x < 1)
+        fun_l17_n89(x)
+    else
+        fun_l17_n704(x)
+    end
+end
+
+def fun_l16_n795(x)
+    if (x < 1)
+        fun_l17_n52(x)
+    else
+        fun_l17_n307(x)
+    end
+end
+
+def fun_l16_n796(x)
+    if (x < 1)
+        fun_l17_n632(x)
+    else
+        fun_l17_n839(x)
+    end
+end
+
+def fun_l16_n797(x)
+    if (x < 1)
+        fun_l17_n343(x)
+    else
+        fun_l17_n969(x)
+    end
+end
+
+def fun_l16_n798(x)
+    if (x < 1)
+        fun_l17_n850(x)
+    else
+        fun_l17_n975(x)
+    end
+end
+
+def fun_l16_n799(x)
+    if (x < 1)
+        fun_l17_n119(x)
+    else
+        fun_l17_n303(x)
+    end
+end
+
+def fun_l16_n800(x)
+    if (x < 1)
+        fun_l17_n870(x)
+    else
+        fun_l17_n4(x)
+    end
+end
+
+def fun_l16_n801(x)
+    if (x < 1)
+        fun_l17_n223(x)
+    else
+        fun_l17_n618(x)
+    end
+end
+
+def fun_l16_n802(x)
+    if (x < 1)
+        fun_l17_n183(x)
+    else
+        fun_l17_n358(x)
+    end
+end
+
+def fun_l16_n803(x)
+    if (x < 1)
+        fun_l17_n152(x)
+    else
+        fun_l17_n76(x)
+    end
+end
+
+def fun_l16_n804(x)
+    if (x < 1)
+        fun_l17_n487(x)
+    else
+        fun_l17_n475(x)
+    end
+end
+
+def fun_l16_n805(x)
+    if (x < 1)
+        fun_l17_n900(x)
+    else
+        fun_l17_n786(x)
+    end
+end
+
+def fun_l16_n806(x)
+    if (x < 1)
+        fun_l17_n881(x)
+    else
+        fun_l17_n523(x)
+    end
+end
+
+def fun_l16_n807(x)
+    if (x < 1)
+        fun_l17_n686(x)
+    else
+        fun_l17_n5(x)
+    end
+end
+
+def fun_l16_n808(x)
+    if (x < 1)
+        fun_l17_n841(x)
+    else
+        fun_l17_n73(x)
+    end
+end
+
+def fun_l16_n809(x)
+    if (x < 1)
+        fun_l17_n737(x)
+    else
+        fun_l17_n590(x)
+    end
+end
+
+def fun_l16_n810(x)
+    if (x < 1)
+        fun_l17_n252(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n811(x)
+    if (x < 1)
+        fun_l17_n333(x)
+    else
+        fun_l17_n418(x)
+    end
+end
+
+def fun_l16_n812(x)
+    if (x < 1)
+        fun_l17_n155(x)
+    else
+        fun_l17_n104(x)
+    end
+end
+
+def fun_l16_n813(x)
+    if (x < 1)
+        fun_l17_n933(x)
+    else
+        fun_l17_n344(x)
+    end
+end
+
+def fun_l16_n814(x)
+    if (x < 1)
+        fun_l17_n107(x)
+    else
+        fun_l17_n784(x)
+    end
+end
+
+def fun_l16_n815(x)
+    if (x < 1)
+        fun_l17_n355(x)
+    else
+        fun_l17_n184(x)
+    end
+end
+
+def fun_l16_n816(x)
+    if (x < 1)
+        fun_l17_n266(x)
+    else
+        fun_l17_n315(x)
+    end
+end
+
+def fun_l16_n817(x)
+    if (x < 1)
+        fun_l17_n821(x)
+    else
+        fun_l17_n534(x)
+    end
+end
+
+def fun_l16_n818(x)
+    if (x < 1)
+        fun_l17_n126(x)
+    else
+        fun_l17_n712(x)
+    end
+end
+
+def fun_l16_n819(x)
+    if (x < 1)
+        fun_l17_n309(x)
+    else
+        fun_l17_n39(x)
+    end
+end
+
+def fun_l16_n820(x)
+    if (x < 1)
+        fun_l17_n629(x)
+    else
+        fun_l17_n689(x)
+    end
+end
+
+def fun_l16_n821(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n250(x)
+    end
+end
+
+def fun_l16_n822(x)
+    if (x < 1)
+        fun_l17_n276(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n823(x)
+    if (x < 1)
+        fun_l17_n775(x)
+    else
+        fun_l17_n542(x)
+    end
+end
+
+def fun_l16_n824(x)
+    if (x < 1)
+        fun_l17_n739(x)
+    else
+        fun_l17_n441(x)
+    end
+end
+
+def fun_l16_n825(x)
+    if (x < 1)
+        fun_l17_n86(x)
+    else
+        fun_l17_n360(x)
+    end
+end
+
+def fun_l16_n826(x)
+    if (x < 1)
+        fun_l17_n196(x)
+    else
+        fun_l17_n406(x)
+    end
+end
+
+def fun_l16_n827(x)
+    if (x < 1)
+        fun_l17_n612(x)
+    else
+        fun_l17_n471(x)
+    end
+end
+
+def fun_l16_n828(x)
+    if (x < 1)
+        fun_l17_n409(x)
+    else
+        fun_l17_n572(x)
+    end
+end
+
+def fun_l16_n829(x)
+    if (x < 1)
+        fun_l17_n347(x)
+    else
+        fun_l17_n450(x)
+    end
+end
+
+def fun_l16_n830(x)
+    if (x < 1)
+        fun_l17_n75(x)
+    else
+        fun_l17_n185(x)
+    end
+end
+
+def fun_l16_n831(x)
+    if (x < 1)
+        fun_l17_n904(x)
+    else
+        fun_l17_n894(x)
+    end
+end
+
+def fun_l16_n832(x)
+    if (x < 1)
+        fun_l17_n889(x)
+    else
+        fun_l17_n651(x)
+    end
+end
+
+def fun_l16_n833(x)
+    if (x < 1)
+        fun_l17_n670(x)
+    else
+        fun_l17_n216(x)
+    end
+end
+
+def fun_l16_n834(x)
+    if (x < 1)
+        fun_l17_n212(x)
+    else
+        fun_l17_n445(x)
+    end
+end
+
+def fun_l16_n835(x)
+    if (x < 1)
+        fun_l17_n453(x)
+    else
+        fun_l17_n187(x)
+    end
+end
+
+def fun_l16_n836(x)
+    if (x < 1)
+        fun_l17_n614(x)
+    else
+        fun_l17_n203(x)
+    end
+end
+
+def fun_l16_n837(x)
+    if (x < 1)
+        fun_l17_n177(x)
+    else
+        fun_l17_n721(x)
+    end
+end
+
+def fun_l16_n838(x)
+    if (x < 1)
+        fun_l17_n910(x)
+    else
+        fun_l17_n510(x)
+    end
+end
+
+def fun_l16_n839(x)
+    if (x < 1)
+        fun_l17_n880(x)
+    else
+        fun_l17_n365(x)
+    end
+end
+
+def fun_l16_n840(x)
+    if (x < 1)
+        fun_l17_n336(x)
+    else
+        fun_l17_n483(x)
+    end
+end
+
+def fun_l16_n841(x)
+    if (x < 1)
+        fun_l17_n83(x)
+    else
+        fun_l17_n947(x)
+    end
+end
+
+def fun_l16_n842(x)
+    if (x < 1)
+        fun_l17_n723(x)
+    else
+        fun_l17_n209(x)
+    end
+end
+
+def fun_l16_n843(x)
+    if (x < 1)
+        fun_l17_n432(x)
+    else
+        fun_l17_n664(x)
+    end
+end
+
+def fun_l16_n844(x)
+    if (x < 1)
+        fun_l17_n906(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n845(x)
+    if (x < 1)
+        fun_l17_n147(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n846(x)
+    if (x < 1)
+        fun_l17_n296(x)
+    else
+        fun_l17_n44(x)
+    end
+end
+
+def fun_l16_n847(x)
+    if (x < 1)
+        fun_l17_n498(x)
+    else
+        fun_l17_n764(x)
+    end
+end
+
+def fun_l16_n848(x)
+    if (x < 1)
+        fun_l17_n428(x)
+    else
+        fun_l17_n575(x)
+    end
+end
+
+def fun_l16_n849(x)
+    if (x < 1)
+        fun_l17_n311(x)
+    else
+        fun_l17_n975(x)
+    end
+end
+
+def fun_l16_n850(x)
+    if (x < 1)
+        fun_l17_n482(x)
+    else
+        fun_l17_n388(x)
+    end
+end
+
+def fun_l16_n851(x)
+    if (x < 1)
+        fun_l17_n174(x)
+    else
+        fun_l17_n190(x)
+    end
+end
+
+def fun_l16_n852(x)
+    if (x < 1)
+        fun_l17_n28(x)
+    else
+        fun_l17_n598(x)
+    end
+end
+
+def fun_l16_n853(x)
+    if (x < 1)
+        fun_l17_n142(x)
+    else
+        fun_l17_n340(x)
+    end
+end
+
+def fun_l16_n854(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n226(x)
+    end
+end
+
+def fun_l16_n855(x)
+    if (x < 1)
+        fun_l17_n268(x)
+    else
+        fun_l17_n201(x)
+    end
+end
+
+def fun_l16_n856(x)
+    if (x < 1)
+        fun_l17_n52(x)
+    else
+        fun_l17_n871(x)
+    end
+end
+
+def fun_l16_n857(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n673(x)
+    end
+end
+
+def fun_l16_n858(x)
+    if (x < 1)
+        fun_l17_n794(x)
+    else
+        fun_l17_n839(x)
+    end
+end
+
+def fun_l16_n859(x)
+    if (x < 1)
+        fun_l17_n162(x)
+    else
+        fun_l17_n655(x)
+    end
+end
+
+def fun_l16_n860(x)
+    if (x < 1)
+        fun_l17_n770(x)
+    else
+        fun_l17_n879(x)
+    end
+end
+
+def fun_l16_n861(x)
+    if (x < 1)
+        fun_l17_n93(x)
+    else
+        fun_l17_n338(x)
+    end
+end
+
+def fun_l16_n862(x)
+    if (x < 1)
+        fun_l17_n468(x)
+    else
+        fun_l17_n977(x)
+    end
+end
+
+def fun_l16_n863(x)
+    if (x < 1)
+        fun_l17_n627(x)
+    else
+        fun_l17_n296(x)
+    end
+end
+
+def fun_l16_n864(x)
+    if (x < 1)
+        fun_l17_n402(x)
+    else
+        fun_l17_n515(x)
+    end
+end
+
+def fun_l16_n865(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n62(x)
+    end
+end
+
+def fun_l16_n866(x)
+    if (x < 1)
+        fun_l17_n87(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n867(x)
+    if (x < 1)
+        fun_l17_n766(x)
+    else
+        fun_l17_n162(x)
+    end
+end
+
+def fun_l16_n868(x)
+    if (x < 1)
+        fun_l17_n214(x)
+    else
+        fun_l17_n827(x)
+    end
+end
+
+def fun_l16_n869(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n285(x)
+    end
+end
+
+def fun_l16_n870(x)
+    if (x < 1)
+        fun_l17_n619(x)
+    else
+        fun_l17_n648(x)
+    end
+end
+
+def fun_l16_n871(x)
+    if (x < 1)
+        fun_l17_n150(x)
+    else
+        fun_l17_n458(x)
+    end
+end
+
+def fun_l16_n872(x)
+    if (x < 1)
+        fun_l17_n346(x)
+    else
+        fun_l17_n824(x)
+    end
+end
+
+def fun_l16_n873(x)
+    if (x < 1)
+        fun_l17_n839(x)
+    else
+        fun_l17_n188(x)
+    end
+end
+
+def fun_l16_n874(x)
+    if (x < 1)
+        fun_l17_n202(x)
+    else
+        fun_l17_n147(x)
+    end
+end
+
+def fun_l16_n875(x)
+    if (x < 1)
+        fun_l17_n779(x)
+    else
+        fun_l17_n217(x)
+    end
+end
+
+def fun_l16_n876(x)
+    if (x < 1)
+        fun_l17_n417(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n877(x)
+    if (x < 1)
+        fun_l17_n971(x)
+    else
+        fun_l17_n825(x)
+    end
+end
+
+def fun_l16_n878(x)
+    if (x < 1)
+        fun_l17_n843(x)
+    else
+        fun_l17_n431(x)
+    end
+end
+
+def fun_l16_n879(x)
+    if (x < 1)
+        fun_l17_n560(x)
+    else
+        fun_l17_n421(x)
+    end
+end
+
+def fun_l16_n880(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n101(x)
+    end
+end
+
+def fun_l16_n881(x)
+    if (x < 1)
+        fun_l17_n458(x)
+    else
+        fun_l17_n805(x)
+    end
+end
+
+def fun_l16_n882(x)
+    if (x < 1)
+        fun_l17_n590(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n883(x)
+    if (x < 1)
+        fun_l17_n753(x)
+    else
+        fun_l17_n128(x)
+    end
+end
+
+def fun_l16_n884(x)
+    if (x < 1)
+        fun_l17_n271(x)
+    else
+        fun_l17_n366(x)
+    end
+end
+
+def fun_l16_n885(x)
+    if (x < 1)
+        fun_l17_n251(x)
+    else
+        fun_l17_n581(x)
+    end
+end
+
+def fun_l16_n886(x)
+    if (x < 1)
+        fun_l17_n82(x)
+    else
+        fun_l17_n212(x)
+    end
+end
+
+def fun_l16_n887(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n476(x)
+    end
+end
+
+def fun_l16_n888(x)
+    if (x < 1)
+        fun_l17_n774(x)
+    else
+        fun_l17_n23(x)
+    end
+end
+
+def fun_l16_n889(x)
+    if (x < 1)
+        fun_l17_n258(x)
+    else
+        fun_l17_n931(x)
+    end
+end
+
+def fun_l16_n890(x)
+    if (x < 1)
+        fun_l17_n60(x)
+    else
+        fun_l17_n267(x)
+    end
+end
+
+def fun_l16_n891(x)
+    if (x < 1)
+        fun_l17_n465(x)
+    else
+        fun_l17_n298(x)
+    end
+end
+
+def fun_l16_n892(x)
+    if (x < 1)
+        fun_l17_n284(x)
+    else
+        fun_l17_n59(x)
+    end
+end
+
+def fun_l16_n893(x)
+    if (x < 1)
+        fun_l17_n485(x)
+    else
+        fun_l17_n19(x)
+    end
+end
+
+def fun_l16_n894(x)
+    if (x < 1)
+        fun_l17_n676(x)
+    else
+        fun_l17_n196(x)
+    end
+end
+
+def fun_l16_n895(x)
+    if (x < 1)
+        fun_l17_n894(x)
+    else
+        fun_l17_n667(x)
+    end
+end
+
+def fun_l16_n896(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n115(x)
+    end
+end
+
+def fun_l16_n897(x)
+    if (x < 1)
+        fun_l17_n161(x)
+    else
+        fun_l17_n47(x)
+    end
+end
+
+def fun_l16_n898(x)
+    if (x < 1)
+        fun_l17_n598(x)
+    else
+        fun_l17_n796(x)
+    end
+end
+
+def fun_l16_n899(x)
+    if (x < 1)
+        fun_l17_n191(x)
+    else
+        fun_l17_n36(x)
+    end
+end
+
+def fun_l16_n900(x)
+    if (x < 1)
+        fun_l17_n803(x)
+    else
+        fun_l17_n894(x)
+    end
+end
+
+def fun_l16_n901(x)
+    if (x < 1)
+        fun_l17_n225(x)
+    else
+        fun_l17_n608(x)
+    end
+end
+
+def fun_l16_n902(x)
+    if (x < 1)
+        fun_l17_n318(x)
+    else
+        fun_l17_n667(x)
+    end
+end
+
+def fun_l16_n903(x)
+    if (x < 1)
+        fun_l17_n815(x)
+    else
+        fun_l17_n645(x)
+    end
+end
+
+def fun_l16_n904(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n465(x)
+    end
+end
+
+def fun_l16_n905(x)
+    if (x < 1)
+        fun_l17_n789(x)
+    else
+        fun_l17_n573(x)
+    end
+end
+
+def fun_l16_n906(x)
+    if (x < 1)
+        fun_l17_n139(x)
+    else
+        fun_l17_n745(x)
+    end
+end
+
+def fun_l16_n907(x)
+    if (x < 1)
+        fun_l17_n632(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n908(x)
+    if (x < 1)
+        fun_l17_n249(x)
+    else
+        fun_l17_n279(x)
+    end
+end
+
+def fun_l16_n909(x)
+    if (x < 1)
+        fun_l17_n357(x)
+    else
+        fun_l17_n477(x)
+    end
+end
+
+def fun_l16_n910(x)
+    if (x < 1)
+        fun_l17_n796(x)
+    else
+        fun_l17_n313(x)
+    end
+end
+
+def fun_l16_n911(x)
+    if (x < 1)
+        fun_l17_n917(x)
+    else
+        fun_l17_n775(x)
+    end
+end
+
+def fun_l16_n912(x)
+    if (x < 1)
+        fun_l17_n451(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n913(x)
+    if (x < 1)
+        fun_l17_n782(x)
+    else
+        fun_l17_n998(x)
+    end
+end
+
+def fun_l16_n914(x)
+    if (x < 1)
+        fun_l17_n237(x)
+    else
+        fun_l17_n586(x)
+    end
+end
+
+def fun_l16_n915(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n676(x)
+    end
+end
+
+def fun_l16_n916(x)
+    if (x < 1)
+        fun_l17_n65(x)
+    else
+        fun_l17_n61(x)
+    end
+end
+
+def fun_l16_n917(x)
+    if (x < 1)
+        fun_l17_n861(x)
+    else
+        fun_l17_n72(x)
+    end
+end
+
+def fun_l16_n918(x)
+    if (x < 1)
+        fun_l17_n375(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n919(x)
+    if (x < 1)
+        fun_l17_n776(x)
+    else
+        fun_l17_n302(x)
+    end
+end
+
+def fun_l16_n920(x)
+    if (x < 1)
+        fun_l17_n216(x)
+    else
+        fun_l17_n804(x)
+    end
+end
+
+def fun_l16_n921(x)
+    if (x < 1)
+        fun_l17_n667(x)
+    else
+        fun_l17_n593(x)
+    end
+end
+
+def fun_l16_n922(x)
+    if (x < 1)
+        fun_l17_n499(x)
+    else
+        fun_l17_n577(x)
+    end
+end
+
+def fun_l16_n923(x)
+    if (x < 1)
+        fun_l17_n41(x)
+    else
+        fun_l17_n316(x)
+    end
+end
+
+def fun_l16_n924(x)
+    if (x < 1)
+        fun_l17_n521(x)
+    else
+        fun_l17_n86(x)
+    end
+end
+
+def fun_l16_n925(x)
+    if (x < 1)
+        fun_l17_n695(x)
+    else
+        fun_l17_n662(x)
+    end
+end
+
+def fun_l16_n926(x)
+    if (x < 1)
+        fun_l17_n379(x)
+    else
+        fun_l17_n58(x)
+    end
+end
+
+def fun_l16_n927(x)
+    if (x < 1)
+        fun_l17_n820(x)
+    else
+        fun_l17_n801(x)
+    end
+end
+
+def fun_l16_n928(x)
+    if (x < 1)
+        fun_l17_n175(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n929(x)
+    if (x < 1)
+        fun_l17_n903(x)
+    else
+        fun_l17_n644(x)
+    end
+end
+
+def fun_l16_n930(x)
+    if (x < 1)
+        fun_l17_n801(x)
+    else
+        fun_l17_n265(x)
+    end
+end
+
+def fun_l16_n931(x)
+    if (x < 1)
+        fun_l17_n292(x)
+    else
+        fun_l17_n897(x)
+    end
+end
+
+def fun_l16_n932(x)
+    if (x < 1)
+        fun_l17_n666(x)
+    else
+        fun_l17_n531(x)
+    end
+end
+
+def fun_l16_n933(x)
+    if (x < 1)
+        fun_l17_n929(x)
+    else
+        fun_l17_n205(x)
+    end
+end
+
+def fun_l16_n934(x)
+    if (x < 1)
+        fun_l17_n557(x)
+    else
+        fun_l17_n70(x)
+    end
+end
+
+def fun_l16_n935(x)
+    if (x < 1)
+        fun_l17_n831(x)
+    else
+        fun_l17_n194(x)
+    end
+end
+
+def fun_l16_n936(x)
+    if (x < 1)
+        fun_l17_n277(x)
+    else
+        fun_l17_n786(x)
+    end
+end
+
+def fun_l16_n937(x)
+    if (x < 1)
+        fun_l17_n464(x)
+    else
+        fun_l17_n482(x)
+    end
+end
+
+def fun_l16_n938(x)
+    if (x < 1)
+        fun_l17_n782(x)
+    else
+        fun_l17_n60(x)
+    end
+end
+
+def fun_l16_n939(x)
+    if (x < 1)
+        fun_l17_n780(x)
+    else
+        fun_l17_n786(x)
+    end
+end
+
+def fun_l16_n940(x)
+    if (x < 1)
+        fun_l17_n201(x)
+    else
+        fun_l17_n614(x)
+    end
+end
+
+def fun_l16_n941(x)
+    if (x < 1)
+        fun_l17_n318(x)
+    else
+        fun_l17_n210(x)
+    end
+end
+
+def fun_l16_n942(x)
+    if (x < 1)
+        fun_l17_n831(x)
+    else
+        fun_l17_n293(x)
+    end
+end
+
+def fun_l16_n943(x)
+    if (x < 1)
+        fun_l17_n368(x)
+    else
+        fun_l17_n292(x)
+    end
+end
+
+def fun_l16_n944(x)
+    if (x < 1)
+        fun_l17_n924(x)
+    else
+        fun_l17_n20(x)
+    end
+end
+
+def fun_l16_n945(x)
+    if (x < 1)
+        fun_l17_n340(x)
+    else
+        fun_l17_n268(x)
+    end
+end
+
+def fun_l16_n946(x)
+    if (x < 1)
+        fun_l17_n913(x)
+    else
+        fun_l17_n877(x)
+    end
+end
+
+def fun_l16_n947(x)
+    if (x < 1)
+        fun_l17_n577(x)
+    else
+        fun_l17_n973(x)
+    end
+end
+
+def fun_l16_n948(x)
+    if (x < 1)
+        fun_l17_n101(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n949(x)
+    if (x < 1)
+        fun_l17_n1(x)
+    else
+        fun_l17_n683(x)
+    end
+end
+
+def fun_l16_n950(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n30(x)
+    end
+end
+
+def fun_l16_n951(x)
+    if (x < 1)
+        fun_l17_n965(x)
+    else
+        fun_l17_n165(x)
+    end
+end
+
+def fun_l16_n952(x)
+    if (x < 1)
+        fun_l17_n532(x)
+    else
+        fun_l17_n887(x)
+    end
+end
+
+def fun_l16_n953(x)
+    if (x < 1)
+        fun_l17_n73(x)
+    else
+        fun_l17_n82(x)
+    end
+end
+
+def fun_l16_n954(x)
+    if (x < 1)
+        fun_l17_n518(x)
+    else
+        fun_l17_n886(x)
+    end
+end
+
+def fun_l16_n955(x)
+    if (x < 1)
+        fun_l17_n990(x)
+    else
+        fun_l17_n213(x)
+    end
+end
+
+def fun_l16_n956(x)
+    if (x < 1)
+        fun_l17_n489(x)
+    else
+        fun_l17_n937(x)
+    end
+end
+
+def fun_l16_n957(x)
+    if (x < 1)
+        fun_l17_n657(x)
+    else
+        fun_l17_n25(x)
+    end
+end
+
+def fun_l16_n958(x)
+    if (x < 1)
+        fun_l17_n988(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n959(x)
+    if (x < 1)
+        fun_l17_n142(x)
+    else
+        fun_l17_n291(x)
+    end
+end
+
+def fun_l16_n960(x)
+    if (x < 1)
+        fun_l17_n495(x)
+    else
+        fun_l17_n806(x)
+    end
+end
+
+def fun_l16_n961(x)
+    if (x < 1)
+        fun_l17_n92(x)
+    else
+        fun_l17_n137(x)
+    end
+end
+
+def fun_l16_n962(x)
+    if (x < 1)
+        fun_l17_n954(x)
+    else
+        fun_l17_n943(x)
+    end
+end
+
+def fun_l16_n963(x)
+    if (x < 1)
+        fun_l17_n761(x)
+    else
+        fun_l17_n839(x)
+    end
+end
+
+def fun_l16_n964(x)
+    if (x < 1)
+        fun_l17_n591(x)
+    else
+        fun_l17_n519(x)
+    end
+end
+
+def fun_l16_n965(x)
+    if (x < 1)
+        fun_l17_n548(x)
+    else
+        fun_l17_n190(x)
+    end
+end
+
+def fun_l16_n966(x)
+    if (x < 1)
+        fun_l17_n206(x)
+    else
+        fun_l17_n491(x)
+    end
+end
+
+def fun_l16_n967(x)
+    if (x < 1)
+        fun_l17_n895(x)
+    else
+        fun_l17_n404(x)
+    end
+end
+
+def fun_l16_n968(x)
+    if (x < 1)
+        fun_l17_n284(x)
+    else
+        fun_l17_n715(x)
+    end
+end
+
+def fun_l16_n969(x)
+    if (x < 1)
+        fun_l17_n507(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n970(x)
+    if (x < 1)
+        fun_l17_n415(x)
+    else
+        fun_l17_n718(x)
+    end
+end
+
+def fun_l16_n971(x)
+    if (x < 1)
+        fun_l17_n72(x)
+    else
+        fun_l17_n938(x)
+    end
+end
+
+def fun_l16_n972(x)
+    if (x < 1)
+        fun_l17_n661(x)
+    else
+        fun_l17_n525(x)
+    end
+end
+
+def fun_l16_n973(x)
+    if (x < 1)
+        fun_l17_n314(x)
+    else
+        fun_l17_n195(x)
+    end
+end
+
+def fun_l16_n974(x)
+    if (x < 1)
+        fun_l17_n53(x)
+    else
+        fun_l17_n562(x)
+    end
+end
+
+def fun_l16_n975(x)
+    if (x < 1)
+        fun_l17_n381(x)
+    else
+        fun_l17_n241(x)
+    end
+end
+
+def fun_l16_n976(x)
+    if (x < 1)
+        fun_l17_n919(x)
+    else
+        fun_l17_n291(x)
+    end
+end
+
+def fun_l16_n977(x)
+    if (x < 1)
+        fun_l17_n455(x)
+    else
+        fun_l17_n773(x)
+    end
+end
+
+def fun_l16_n978(x)
+    if (x < 1)
+        fun_l17_n75(x)
+    else
+        fun_l17_n737(x)
+    end
+end
+
+def fun_l16_n979(x)
+    if (x < 1)
+        fun_l17_n68(x)
+    else
+        fun_l17_n339(x)
+    end
+end
+
+def fun_l16_n980(x)
+    if (x < 1)
+        fun_l17_n719(x)
+    else
+        fun_l17_n464(x)
+    end
+end
+
+def fun_l16_n981(x)
+    if (x < 1)
+        fun_l17_n681(x)
+    else
+        fun_l17_n611(x)
+    end
+end
+
+def fun_l16_n982(x)
+    if (x < 1)
+        fun_l17_n367(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n983(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n958(x)
+    end
+end
+
+def fun_l16_n984(x)
+    if (x < 1)
+        fun_l17_n271(x)
+    else
+        fun_l17_n982(x)
+    end
+end
+
+def fun_l16_n985(x)
+    if (x < 1)
+        fun_l17_n136(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n986(x)
+    if (x < 1)
+        fun_l17_n362(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n987(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n236(x)
+    end
+end
+
+def fun_l16_n988(x)
+    if (x < 1)
+        fun_l17_n339(x)
+    else
+        fun_l17_n2(x)
+    end
+end
+
+def fun_l16_n989(x)
+    if (x < 1)
+        fun_l17_n66(x)
+    else
+        fun_l17_n378(x)
+    end
+end
+
+def fun_l16_n990(x)
+    if (x < 1)
+        fun_l17_n366(x)
+    else
+        fun_l17_n289(x)
+    end
+end
+
+def fun_l16_n991(x)
+    if (x < 1)
+        fun_l17_n977(x)
+    else
+        fun_l17_n520(x)
+    end
+end
+
+def fun_l16_n992(x)
+    if (x < 1)
+        fun_l17_n953(x)
+    else
+        fun_l17_n254(x)
+    end
+end
+
+def fun_l16_n993(x)
+    if (x < 1)
+        fun_l17_n569(x)
+    else
+        fun_l17_n63(x)
+    end
+end
+
+def fun_l16_n994(x)
+    if (x < 1)
+        fun_l17_n844(x)
+    else
+        fun_l17_n42(x)
+    end
+end
+
+def fun_l16_n995(x)
+    if (x < 1)
+        fun_l17_n184(x)
+    else
+        fun_l17_n371(x)
+    end
+end
+
+def fun_l16_n996(x)
+    if (x < 1)
+        fun_l17_n229(x)
+    else
+        fun_l17_n309(x)
+    end
+end
+
+def fun_l16_n997(x)
+    if (x < 1)
+        fun_l17_n468(x)
+    else
+        fun_l17_n653(x)
+    end
+end
+
+def fun_l16_n998(x)
+    if (x < 1)
+        fun_l17_n173(x)
+    else
+        fun_l17_n709(x)
+    end
+end
+
+def fun_l16_n999(x)
+    if (x < 1)
+        fun_l17_n625(x)
+    else
+        fun_l17_n831(x)
+    end
+end
+
+def fun_l17_n0(x)
+    if (x < 1)
+        fun_l18_n495(x)
+    else
+        fun_l18_n122(x)
+    end
+end
+
+def fun_l17_n1(x)
+    if (x < 1)
+        fun_l18_n99(x)
+    else
+        fun_l18_n84(x)
+    end
+end
+
+def fun_l17_n2(x)
+    if (x < 1)
+        fun_l18_n464(x)
+    else
+        fun_l18_n321(x)
+    end
+end
+
+def fun_l17_n3(x)
+    if (x < 1)
+        fun_l18_n391(x)
+    else
+        fun_l18_n122(x)
+    end
+end
+
+def fun_l17_n4(x)
+    if (x < 1)
+        fun_l18_n65(x)
+    else
+        fun_l18_n514(x)
+    end
+end
+
+def fun_l17_n5(x)
+    if (x < 1)
+        fun_l18_n972(x)
+    else
+        fun_l18_n802(x)
+    end
+end
+
+def fun_l17_n6(x)
+    if (x < 1)
+        fun_l18_n577(x)
+    else
+        fun_l18_n26(x)
+    end
+end
+
+def fun_l17_n7(x)
+    if (x < 1)
+        fun_l18_n988(x)
+    else
+        fun_l18_n403(x)
+    end
+end
+
+def fun_l17_n8(x)
+    if (x < 1)
+        fun_l18_n466(x)
+    else
+        fun_l18_n162(x)
+    end
+end
+
+def fun_l17_n9(x)
+    if (x < 1)
+        fun_l18_n30(x)
+    else
+        fun_l18_n438(x)
+    end
+end
+
+def fun_l17_n10(x)
+    if (x < 1)
+        fun_l18_n92(x)
+    else
+        fun_l18_n365(x)
+    end
+end
+
+def fun_l17_n11(x)
+    if (x < 1)
+        fun_l18_n230(x)
+    else
+        fun_l18_n466(x)
+    end
+end
+
+def fun_l17_n12(x)
+    if (x < 1)
+        fun_l18_n274(x)
+    else
+        fun_l18_n38(x)
+    end
+end
+
+def fun_l17_n13(x)
+    if (x < 1)
+        fun_l18_n84(x)
+    else
+        fun_l18_n951(x)
+    end
+end
+
+def fun_l17_n14(x)
+    if (x < 1)
+        fun_l18_n878(x)
+    else
+        fun_l18_n981(x)
+    end
+end
+
+def fun_l17_n15(x)
+    if (x < 1)
+        fun_l18_n592(x)
+    else
+        fun_l18_n917(x)
+    end
+end
+
+def fun_l17_n16(x)
+    if (x < 1)
+        fun_l18_n524(x)
+    else
+        fun_l18_n812(x)
+    end
+end
+
+def fun_l17_n17(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n335(x)
+    end
+end
+
+def fun_l17_n18(x)
+    if (x < 1)
+        fun_l18_n427(x)
+    else
+        fun_l18_n591(x)
+    end
+end
+
+def fun_l17_n19(x)
+    if (x < 1)
+        fun_l18_n520(x)
+    else
+        fun_l18_n240(x)
+    end
+end
+
+def fun_l17_n20(x)
+    if (x < 1)
+        fun_l18_n729(x)
+    else
+        fun_l18_n709(x)
+    end
+end
+
+def fun_l17_n21(x)
+    if (x < 1)
+        fun_l18_n100(x)
+    else
+        fun_l18_n192(x)
+    end
+end
+
+def fun_l17_n22(x)
+    if (x < 1)
+        fun_l18_n762(x)
+    else
+        fun_l18_n373(x)
+    end
+end
+
+def fun_l17_n23(x)
+    if (x < 1)
+        fun_l18_n485(x)
+    else
+        fun_l18_n736(x)
+    end
+end
+
+def fun_l17_n24(x)
+    if (x < 1)
+        fun_l18_n743(x)
+    else
+        fun_l18_n83(x)
+    end
+end
+
+def fun_l17_n25(x)
+    if (x < 1)
+        fun_l18_n750(x)
+    else
+        fun_l18_n545(x)
+    end
+end
+
+def fun_l17_n26(x)
+    if (x < 1)
+        fun_l18_n488(x)
+    else
+        fun_l18_n870(x)
+    end
+end
+
+def fun_l17_n27(x)
+    if (x < 1)
+        fun_l18_n0(x)
+    else
+        fun_l18_n675(x)
+    end
+end
+
+def fun_l17_n28(x)
+    if (x < 1)
+        fun_l18_n878(x)
+    else
+        fun_l18_n32(x)
+    end
+end
+
+def fun_l17_n29(x)
+    if (x < 1)
+        fun_l18_n906(x)
+    else
+        fun_l18_n376(x)
+    end
+end
+
+def fun_l17_n30(x)
+    if (x < 1)
+        fun_l18_n182(x)
+    else
+        fun_l18_n58(x)
+    end
+end
+
+def fun_l17_n31(x)
+    if (x < 1)
+        fun_l18_n117(x)
+    else
+        fun_l18_n592(x)
+    end
+end
+
+def fun_l17_n32(x)
+    if (x < 1)
+        fun_l18_n123(x)
+    else
+        fun_l18_n697(x)
+    end
+end
+
+def fun_l17_n33(x)
+    if (x < 1)
+        fun_l18_n672(x)
+    else
+        fun_l18_n645(x)
+    end
+end
+
+def fun_l17_n34(x)
+    if (x < 1)
+        fun_l18_n640(x)
+    else
+        fun_l18_n280(x)
+    end
+end
+
+def fun_l17_n35(x)
+    if (x < 1)
+        fun_l18_n851(x)
+    else
+        fun_l18_n723(x)
+    end
+end
+
+def fun_l17_n36(x)
+    if (x < 1)
+        fun_l18_n968(x)
+    else
+        fun_l18_n840(x)
+    end
+end
+
+def fun_l17_n37(x)
+    if (x < 1)
+        fun_l18_n153(x)
+    else
+        fun_l18_n979(x)
+    end
+end
+
+def fun_l17_n38(x)
+    if (x < 1)
+        fun_l18_n817(x)
+    else
+        fun_l18_n521(x)
+    end
+end
+
+def fun_l17_n39(x)
+    if (x < 1)
+        fun_l18_n742(x)
+    else
+        fun_l18_n576(x)
+    end
+end
+
+def fun_l17_n40(x)
+    if (x < 1)
+        fun_l18_n5(x)
+    else
+        fun_l18_n998(x)
+    end
+end
+
+def fun_l17_n41(x)
+    if (x < 1)
+        fun_l18_n442(x)
+    else
+        fun_l18_n157(x)
+    end
+end
+
+def fun_l17_n42(x)
+    if (x < 1)
+        fun_l18_n832(x)
+    else
+        fun_l18_n218(x)
+    end
+end
+
+def fun_l17_n43(x)
+    if (x < 1)
+        fun_l18_n298(x)
+    else
+        fun_l18_n132(x)
+    end
+end
+
+def fun_l17_n44(x)
+    if (x < 1)
+        fun_l18_n397(x)
+    else
+        fun_l18_n375(x)
+    end
+end
+
+def fun_l17_n45(x)
+    if (x < 1)
+        fun_l18_n974(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n46(x)
+    if (x < 1)
+        fun_l18_n340(x)
+    else
+        fun_l18_n506(x)
+    end
+end
+
+def fun_l17_n47(x)
+    if (x < 1)
+        fun_l18_n943(x)
+    else
+        fun_l18_n585(x)
+    end
+end
+
+def fun_l17_n48(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n2(x)
+    end
+end
+
+def fun_l17_n49(x)
+    if (x < 1)
+        fun_l18_n229(x)
+    else
+        fun_l18_n313(x)
+    end
+end
+
+def fun_l17_n50(x)
+    if (x < 1)
+        fun_l18_n243(x)
+    else
+        fun_l18_n562(x)
+    end
+end
+
+def fun_l17_n51(x)
+    if (x < 1)
+        fun_l18_n231(x)
+    else
+        fun_l18_n381(x)
+    end
+end
+
+def fun_l17_n52(x)
+    if (x < 1)
+        fun_l18_n509(x)
+    else
+        fun_l18_n693(x)
+    end
+end
+
+def fun_l17_n53(x)
+    if (x < 1)
+        fun_l18_n877(x)
+    else
+        fun_l18_n620(x)
+    end
+end
+
+def fun_l17_n54(x)
+    if (x < 1)
+        fun_l18_n435(x)
+    else
+        fun_l18_n3(x)
+    end
+end
+
+def fun_l17_n55(x)
+    if (x < 1)
+        fun_l18_n929(x)
+    else
+        fun_l18_n640(x)
+    end
+end
+
+def fun_l17_n56(x)
+    if (x < 1)
+        fun_l18_n913(x)
+    else
+        fun_l18_n374(x)
+    end
+end
+
+def fun_l17_n57(x)
+    if (x < 1)
+        fun_l18_n174(x)
+    else
+        fun_l18_n588(x)
+    end
+end
+
+def fun_l17_n58(x)
+    if (x < 1)
+        fun_l18_n339(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n59(x)
+    if (x < 1)
+        fun_l18_n649(x)
+    else
+        fun_l18_n986(x)
+    end
+end
+
+def fun_l17_n60(x)
+    if (x < 1)
+        fun_l18_n326(x)
+    else
+        fun_l18_n739(x)
+    end
+end
+
+def fun_l17_n61(x)
+    if (x < 1)
+        fun_l18_n692(x)
+    else
+        fun_l18_n673(x)
+    end
+end
+
+def fun_l17_n62(x)
+    if (x < 1)
+        fun_l18_n515(x)
+    else
+        fun_l18_n951(x)
+    end
+end
+
+def fun_l17_n63(x)
+    if (x < 1)
+        fun_l18_n502(x)
+    else
+        fun_l18_n781(x)
+    end
+end
+
+def fun_l17_n64(x)
+    if (x < 1)
+        fun_l18_n833(x)
+    else
+        fun_l18_n235(x)
+    end
+end
+
+def fun_l17_n65(x)
+    if (x < 1)
+        fun_l18_n483(x)
+    else
+        fun_l18_n207(x)
+    end
+end
+
+def fun_l17_n66(x)
+    if (x < 1)
+        fun_l18_n292(x)
+    else
+        fun_l18_n916(x)
+    end
+end
+
+def fun_l17_n67(x)
+    if (x < 1)
+        fun_l18_n677(x)
+    else
+        fun_l18_n937(x)
+    end
+end
+
+def fun_l17_n68(x)
+    if (x < 1)
+        fun_l18_n733(x)
+    else
+        fun_l18_n426(x)
+    end
+end
+
+def fun_l17_n69(x)
+    if (x < 1)
+        fun_l18_n186(x)
+    else
+        fun_l18_n146(x)
+    end
+end
+
+def fun_l17_n70(x)
+    if (x < 1)
+        fun_l18_n493(x)
+    else
+        fun_l18_n418(x)
+    end
+end
+
+def fun_l17_n71(x)
+    if (x < 1)
+        fun_l18_n732(x)
+    else
+        fun_l18_n584(x)
+    end
+end
+
+def fun_l17_n72(x)
+    if (x < 1)
+        fun_l18_n774(x)
+    else
+        fun_l18_n349(x)
+    end
+end
+
+def fun_l17_n73(x)
+    if (x < 1)
+        fun_l18_n833(x)
+    else
+        fun_l18_n142(x)
+    end
+end
+
+def fun_l17_n74(x)
+    if (x < 1)
+        fun_l18_n506(x)
+    else
+        fun_l18_n882(x)
+    end
+end
+
+def fun_l17_n75(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n76(x)
+    if (x < 1)
+        fun_l18_n172(x)
+    else
+        fun_l18_n426(x)
+    end
+end
+
+def fun_l17_n77(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n508(x)
+    end
+end
+
+def fun_l17_n78(x)
+    if (x < 1)
+        fun_l18_n25(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n79(x)
+    if (x < 1)
+        fun_l18_n639(x)
+    else
+        fun_l18_n644(x)
+    end
+end
+
+def fun_l17_n80(x)
+    if (x < 1)
+        fun_l18_n207(x)
+    else
+        fun_l18_n193(x)
+    end
+end
+
+def fun_l17_n81(x)
+    if (x < 1)
+        fun_l18_n200(x)
+    else
+        fun_l18_n766(x)
+    end
+end
+
+def fun_l17_n82(x)
+    if (x < 1)
+        fun_l18_n815(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n83(x)
+    if (x < 1)
+        fun_l18_n740(x)
+    else
+        fun_l18_n507(x)
+    end
+end
+
+def fun_l17_n84(x)
+    if (x < 1)
+        fun_l18_n484(x)
+    else
+        fun_l18_n158(x)
+    end
+end
+
+def fun_l17_n85(x)
+    if (x < 1)
+        fun_l18_n924(x)
+    else
+        fun_l18_n963(x)
+    end
+end
+
+def fun_l17_n86(x)
+    if (x < 1)
+        fun_l18_n614(x)
+    else
+        fun_l18_n806(x)
+    end
+end
+
+def fun_l17_n87(x)
+    if (x < 1)
+        fun_l18_n553(x)
+    else
+        fun_l18_n510(x)
+    end
+end
+
+def fun_l17_n88(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n89(x)
+    if (x < 1)
+        fun_l18_n757(x)
+    else
+        fun_l18_n248(x)
+    end
+end
+
+def fun_l17_n90(x)
+    if (x < 1)
+        fun_l18_n616(x)
+    else
+        fun_l18_n217(x)
+    end
+end
+
+def fun_l17_n91(x)
+    if (x < 1)
+        fun_l18_n997(x)
+    else
+        fun_l18_n861(x)
+    end
+end
+
+def fun_l17_n92(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n457(x)
+    end
+end
+
+def fun_l17_n93(x)
+    if (x < 1)
+        fun_l18_n264(x)
+    else
+        fun_l18_n213(x)
+    end
+end
+
+def fun_l17_n94(x)
+    if (x < 1)
+        fun_l18_n352(x)
+    else
+        fun_l18_n304(x)
+    end
+end
+
+def fun_l17_n95(x)
+    if (x < 1)
+        fun_l18_n975(x)
+    else
+        fun_l18_n868(x)
+    end
+end
+
+def fun_l17_n96(x)
+    if (x < 1)
+        fun_l18_n859(x)
+    else
+        fun_l18_n786(x)
+    end
+end
+
+def fun_l17_n97(x)
+    if (x < 1)
+        fun_l18_n610(x)
+    else
+        fun_l18_n423(x)
+    end
+end
+
+def fun_l17_n98(x)
+    if (x < 1)
+        fun_l18_n814(x)
+    else
+        fun_l18_n71(x)
+    end
+end
+
+def fun_l17_n99(x)
+    if (x < 1)
+        fun_l18_n897(x)
+    else
+        fun_l18_n412(x)
+    end
+end
+
+def fun_l17_n100(x)
+    if (x < 1)
+        fun_l18_n654(x)
+    else
+        fun_l18_n600(x)
+    end
+end
+
+def fun_l17_n101(x)
+    if (x < 1)
+        fun_l18_n185(x)
+    else
+        fun_l18_n188(x)
+    end
+end
+
+def fun_l17_n102(x)
+    if (x < 1)
+        fun_l18_n262(x)
+    else
+        fun_l18_n509(x)
+    end
+end
+
+def fun_l17_n103(x)
+    if (x < 1)
+        fun_l18_n115(x)
+    else
+        fun_l18_n497(x)
+    end
+end
+
+def fun_l17_n104(x)
+    if (x < 1)
+        fun_l18_n650(x)
+    else
+        fun_l18_n389(x)
+    end
+end
+
+def fun_l17_n105(x)
+    if (x < 1)
+        fun_l18_n939(x)
+    else
+        fun_l18_n842(x)
+    end
+end
+
+def fun_l17_n106(x)
+    if (x < 1)
+        fun_l18_n645(x)
+    else
+        fun_l18_n34(x)
+    end
+end
+
+def fun_l17_n107(x)
+    if (x < 1)
+        fun_l18_n510(x)
+    else
+        fun_l18_n313(x)
+    end
+end
+
+def fun_l17_n108(x)
+    if (x < 1)
+        fun_l18_n377(x)
+    else
+        fun_l18_n397(x)
+    end
+end
+
+def fun_l17_n109(x)
+    if (x < 1)
+        fun_l18_n884(x)
+    else
+        fun_l18_n380(x)
+    end
+end
+
+def fun_l17_n110(x)
+    if (x < 1)
+        fun_l18_n924(x)
+    else
+        fun_l18_n102(x)
+    end
+end
+
+def fun_l17_n111(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n646(x)
+    end
+end
+
+def fun_l17_n112(x)
+    if (x < 1)
+        fun_l18_n270(x)
+    else
+        fun_l18_n345(x)
+    end
+end
+
+def fun_l17_n113(x)
+    if (x < 1)
+        fun_l18_n211(x)
+    else
+        fun_l18_n672(x)
+    end
+end
+
+def fun_l17_n114(x)
+    if (x < 1)
+        fun_l18_n947(x)
+    else
+        fun_l18_n376(x)
+    end
+end
+
+def fun_l17_n115(x)
+    if (x < 1)
+        fun_l18_n219(x)
+    else
+        fun_l18_n927(x)
+    end
+end
+
+def fun_l17_n116(x)
+    if (x < 1)
+        fun_l18_n731(x)
+    else
+        fun_l18_n327(x)
+    end
+end
+
+def fun_l17_n117(x)
+    if (x < 1)
+        fun_l18_n512(x)
+    else
+        fun_l18_n658(x)
+    end
+end
+
+def fun_l17_n118(x)
+    if (x < 1)
+        fun_l18_n248(x)
+    else
+        fun_l18_n661(x)
+    end
+end
+
+def fun_l17_n119(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n56(x)
+    end
+end
+
+def fun_l17_n120(x)
+    if (x < 1)
+        fun_l18_n441(x)
+    else
+        fun_l18_n648(x)
+    end
+end
+
+def fun_l17_n121(x)
+    if (x < 1)
+        fun_l18_n122(x)
+    else
+        fun_l18_n717(x)
+    end
+end
+
+def fun_l17_n122(x)
+    if (x < 1)
+        fun_l18_n495(x)
+    else
+        fun_l18_n30(x)
+    end
+end
+
+def fun_l17_n123(x)
+    if (x < 1)
+        fun_l18_n418(x)
+    else
+        fun_l18_n686(x)
+    end
+end
+
+def fun_l17_n124(x)
+    if (x < 1)
+        fun_l18_n274(x)
+    else
+        fun_l18_n300(x)
+    end
+end
+
+def fun_l17_n125(x)
+    if (x < 1)
+        fun_l18_n677(x)
+    else
+        fun_l18_n662(x)
+    end
+end
+
+def fun_l17_n126(x)
+    if (x < 1)
+        fun_l18_n448(x)
+    else
+        fun_l18_n584(x)
+    end
+end
+
+def fun_l17_n127(x)
+    if (x < 1)
+        fun_l18_n316(x)
+    else
+        fun_l18_n507(x)
+    end
+end
+
+def fun_l17_n128(x)
+    if (x < 1)
+        fun_l18_n166(x)
+    else
+        fun_l18_n266(x)
+    end
+end
+
+def fun_l17_n129(x)
+    if (x < 1)
+        fun_l18_n890(x)
+    else
+        fun_l18_n581(x)
+    end
+end
+
+def fun_l17_n130(x)
+    if (x < 1)
+        fun_l18_n554(x)
+    else
+        fun_l18_n925(x)
+    end
+end
+
+def fun_l17_n131(x)
+    if (x < 1)
+        fun_l18_n607(x)
+    else
+        fun_l18_n43(x)
+    end
+end
+
+def fun_l17_n132(x)
+    if (x < 1)
+        fun_l18_n747(x)
+    else
+        fun_l18_n461(x)
+    end
+end
+
+def fun_l17_n133(x)
+    if (x < 1)
+        fun_l18_n399(x)
+    else
+        fun_l18_n436(x)
+    end
+end
+
+def fun_l17_n134(x)
+    if (x < 1)
+        fun_l18_n922(x)
+    else
+        fun_l18_n33(x)
+    end
+end
+
+def fun_l17_n135(x)
+    if (x < 1)
+        fun_l18_n719(x)
+    else
+        fun_l18_n70(x)
+    end
+end
+
+def fun_l17_n136(x)
+    if (x < 1)
+        fun_l18_n664(x)
+    else
+        fun_l18_n842(x)
+    end
+end
+
+def fun_l17_n137(x)
+    if (x < 1)
+        fun_l18_n626(x)
+    else
+        fun_l18_n328(x)
+    end
+end
+
+def fun_l17_n138(x)
+    if (x < 1)
+        fun_l18_n64(x)
+    else
+        fun_l18_n24(x)
+    end
+end
+
+def fun_l17_n139(x)
+    if (x < 1)
+        fun_l18_n198(x)
+    else
+        fun_l18_n658(x)
+    end
+end
+
+def fun_l17_n140(x)
+    if (x < 1)
+        fun_l18_n813(x)
+    else
+        fun_l18_n5(x)
+    end
+end
+
+def fun_l17_n141(x)
+    if (x < 1)
+        fun_l18_n8(x)
+    else
+        fun_l18_n115(x)
+    end
+end
+
+def fun_l17_n142(x)
+    if (x < 1)
+        fun_l18_n699(x)
+    else
+        fun_l18_n135(x)
+    end
+end
+
+def fun_l17_n143(x)
+    if (x < 1)
+        fun_l18_n595(x)
+    else
+        fun_l18_n607(x)
+    end
+end
+
+def fun_l17_n144(x)
+    if (x < 1)
+        fun_l18_n650(x)
+    else
+        fun_l18_n994(x)
+    end
+end
+
+def fun_l17_n145(x)
+    if (x < 1)
+        fun_l18_n14(x)
+    else
+        fun_l18_n798(x)
+    end
+end
+
+def fun_l17_n146(x)
+    if (x < 1)
+        fun_l18_n107(x)
+    else
+        fun_l18_n144(x)
+    end
+end
+
+def fun_l17_n147(x)
+    if (x < 1)
+        fun_l18_n923(x)
+    else
+        fun_l18_n482(x)
+    end
+end
+
+def fun_l17_n148(x)
+    if (x < 1)
+        fun_l18_n629(x)
+    else
+        fun_l18_n224(x)
+    end
+end
+
+def fun_l17_n149(x)
+    if (x < 1)
+        fun_l18_n363(x)
+    else
+        fun_l18_n958(x)
+    end
+end
+
+def fun_l17_n150(x)
+    if (x < 1)
+        fun_l18_n143(x)
+    else
+        fun_l18_n828(x)
+    end
+end
+
+def fun_l17_n151(x)
+    if (x < 1)
+        fun_l18_n615(x)
+    else
+        fun_l18_n561(x)
+    end
+end
+
+def fun_l17_n152(x)
+    if (x < 1)
+        fun_l18_n418(x)
+    else
+        fun_l18_n46(x)
+    end
+end
+
+def fun_l17_n153(x)
+    if (x < 1)
+        fun_l18_n331(x)
+    else
+        fun_l18_n736(x)
+    end
+end
+
+def fun_l17_n154(x)
+    if (x < 1)
+        fun_l18_n340(x)
+    else
+        fun_l18_n221(x)
+    end
+end
+
+def fun_l17_n155(x)
+    if (x < 1)
+        fun_l18_n488(x)
+    else
+        fun_l18_n995(x)
+    end
+end
+
+def fun_l17_n156(x)
+    if (x < 1)
+        fun_l18_n500(x)
+    else
+        fun_l18_n106(x)
+    end
+end
+
+def fun_l17_n157(x)
+    if (x < 1)
+        fun_l18_n76(x)
+    else
+        fun_l18_n147(x)
+    end
+end
+
+def fun_l17_n158(x)
+    if (x < 1)
+        fun_l18_n258(x)
+    else
+        fun_l18_n754(x)
+    end
+end
+
+def fun_l17_n159(x)
+    if (x < 1)
+        fun_l18_n174(x)
+    else
+        fun_l18_n676(x)
+    end
+end
+
+def fun_l17_n160(x)
+    if (x < 1)
+        fun_l18_n997(x)
+    else
+        fun_l18_n662(x)
+    end
+end
+
+def fun_l17_n161(x)
+    if (x < 1)
+        fun_l18_n614(x)
+    else
+        fun_l18_n425(x)
+    end
+end
+
+def fun_l17_n162(x)
+    if (x < 1)
+        fun_l18_n943(x)
+    else
+        fun_l18_n534(x)
+    end
+end
+
+def fun_l17_n163(x)
+    if (x < 1)
+        fun_l18_n577(x)
+    else
+        fun_l18_n670(x)
+    end
+end
+
+def fun_l17_n164(x)
+    if (x < 1)
+        fun_l18_n707(x)
+    else
+        fun_l18_n701(x)
+    end
+end
+
+def fun_l17_n165(x)
+    if (x < 1)
+        fun_l18_n316(x)
+    else
+        fun_l18_n981(x)
+    end
+end
+
+def fun_l17_n166(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n710(x)
+    end
+end
+
+def fun_l17_n167(x)
+    if (x < 1)
+        fun_l18_n763(x)
+    else
+        fun_l18_n900(x)
+    end
+end
+
+def fun_l17_n168(x)
+    if (x < 1)
+        fun_l18_n818(x)
+    else
+        fun_l18_n2(x)
+    end
+end
+
+def fun_l17_n169(x)
+    if (x < 1)
+        fun_l18_n68(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n170(x)
+    if (x < 1)
+        fun_l18_n88(x)
+    else
+        fun_l18_n431(x)
+    end
+end
+
+def fun_l17_n171(x)
+    if (x < 1)
+        fun_l18_n530(x)
+    else
+        fun_l18_n714(x)
+    end
+end
+
+def fun_l17_n172(x)
+    if (x < 1)
+        fun_l18_n636(x)
+    else
+        fun_l18_n747(x)
+    end
+end
+
+def fun_l17_n173(x)
+    if (x < 1)
+        fun_l18_n481(x)
+    else
+        fun_l18_n804(x)
+    end
+end
+
+def fun_l17_n174(x)
+    if (x < 1)
+        fun_l18_n591(x)
+    else
+        fun_l18_n121(x)
+    end
+end
+
+def fun_l17_n175(x)
+    if (x < 1)
+        fun_l18_n320(x)
+    else
+        fun_l18_n881(x)
+    end
+end
+
+def fun_l17_n176(x)
+    if (x < 1)
+        fun_l18_n524(x)
+    else
+        fun_l18_n948(x)
+    end
+end
+
+def fun_l17_n177(x)
+    if (x < 1)
+        fun_l18_n540(x)
+    else
+        fun_l18_n508(x)
+    end
+end
+
+def fun_l17_n178(x)
+    if (x < 1)
+        fun_l18_n949(x)
+    else
+        fun_l18_n492(x)
+    end
+end
+
+def fun_l17_n179(x)
+    if (x < 1)
+        fun_l18_n548(x)
+    else
+        fun_l18_n534(x)
+    end
+end
+
+def fun_l17_n180(x)
+    if (x < 1)
+        fun_l18_n591(x)
+    else
+        fun_l18_n104(x)
+    end
+end
+
+def fun_l17_n181(x)
+    if (x < 1)
+        fun_l18_n727(x)
+    else
+        fun_l18_n144(x)
+    end
+end
+
+def fun_l17_n182(x)
+    if (x < 1)
+        fun_l18_n365(x)
+    else
+        fun_l18_n628(x)
+    end
+end
+
+def fun_l17_n183(x)
+    if (x < 1)
+        fun_l18_n32(x)
+    else
+        fun_l18_n752(x)
+    end
+end
+
+def fun_l17_n184(x)
+    if (x < 1)
+        fun_l18_n778(x)
+    else
+        fun_l18_n929(x)
+    end
+end
+
+def fun_l17_n185(x)
+    if (x < 1)
+        fun_l18_n797(x)
+    else
+        fun_l18_n525(x)
+    end
+end
+
+def fun_l17_n186(x)
+    if (x < 1)
+        fun_l18_n800(x)
+    else
+        fun_l18_n799(x)
+    end
+end
+
+def fun_l17_n187(x)
+    if (x < 1)
+        fun_l18_n974(x)
+    else
+        fun_l18_n982(x)
+    end
+end
+
+def fun_l17_n188(x)
+    if (x < 1)
+        fun_l18_n259(x)
+    else
+        fun_l18_n465(x)
+    end
+end
+
+def fun_l17_n189(x)
+    if (x < 1)
+        fun_l18_n905(x)
+    else
+        fun_l18_n477(x)
+    end
+end
+
+def fun_l17_n190(x)
+    if (x < 1)
+        fun_l18_n453(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n191(x)
+    if (x < 1)
+        fun_l18_n461(x)
+    else
+        fun_l18_n251(x)
+    end
+end
+
+def fun_l17_n192(x)
+    if (x < 1)
+        fun_l18_n377(x)
+    else
+        fun_l18_n371(x)
+    end
+end
+
+def fun_l17_n193(x)
+    if (x < 1)
+        fun_l18_n252(x)
+    else
+        fun_l18_n493(x)
+    end
+end
+
+def fun_l17_n194(x)
+    if (x < 1)
+        fun_l18_n398(x)
+    else
+        fun_l18_n104(x)
+    end
+end
+
+def fun_l17_n195(x)
+    if (x < 1)
+        fun_l18_n791(x)
+    else
+        fun_l18_n4(x)
+    end
+end
+
+def fun_l17_n196(x)
+    if (x < 1)
+        fun_l18_n801(x)
+    else
+        fun_l18_n429(x)
+    end
+end
+
+def fun_l17_n197(x)
+    if (x < 1)
+        fun_l18_n106(x)
+    else
+        fun_l18_n622(x)
+    end
+end
+
+def fun_l17_n198(x)
+    if (x < 1)
+        fun_l18_n581(x)
+    else
+        fun_l18_n312(x)
+    end
+end
+
+def fun_l17_n199(x)
+    if (x < 1)
+        fun_l18_n142(x)
+    else
+        fun_l18_n296(x)
+    end
+end
+
+def fun_l17_n200(x)
+    if (x < 1)
+        fun_l18_n234(x)
+    else
+        fun_l18_n185(x)
+    end
+end
+
+def fun_l17_n201(x)
+    if (x < 1)
+        fun_l18_n486(x)
+    else
+        fun_l18_n857(x)
+    end
+end
+
+def fun_l17_n202(x)
+    if (x < 1)
+        fun_l18_n84(x)
+    else
+        fun_l18_n718(x)
+    end
+end
+
+def fun_l17_n203(x)
+    if (x < 1)
+        fun_l18_n830(x)
+    else
+        fun_l18_n618(x)
+    end
+end
+
+def fun_l17_n204(x)
+    if (x < 1)
+        fun_l18_n860(x)
+    else
+        fun_l18_n28(x)
+    end
+end
+
+def fun_l17_n205(x)
+    if (x < 1)
+        fun_l18_n244(x)
+    else
+        fun_l18_n575(x)
+    end
+end
+
+def fun_l17_n206(x)
+    if (x < 1)
+        fun_l18_n189(x)
+    else
+        fun_l18_n722(x)
+    end
+end
+
+def fun_l17_n207(x)
+    if (x < 1)
+        fun_l18_n164(x)
+    else
+        fun_l18_n197(x)
+    end
+end
+
+def fun_l17_n208(x)
+    if (x < 1)
+        fun_l18_n109(x)
+    else
+        fun_l18_n392(x)
+    end
+end
+
+def fun_l17_n209(x)
+    if (x < 1)
+        fun_l18_n629(x)
+    else
+        fun_l18_n290(x)
+    end
+end
+
+def fun_l17_n210(x)
+    if (x < 1)
+        fun_l18_n637(x)
+    else
+        fun_l18_n317(x)
+    end
+end
+
+def fun_l17_n211(x)
+    if (x < 1)
+        fun_l18_n148(x)
+    else
+        fun_l18_n702(x)
+    end
+end
+
+def fun_l17_n212(x)
+    if (x < 1)
+        fun_l18_n892(x)
+    else
+        fun_l18_n395(x)
+    end
+end
+
+def fun_l17_n213(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n859(x)
+    end
+end
+
+def fun_l17_n214(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n295(x)
+    end
+end
+
+def fun_l17_n215(x)
+    if (x < 1)
+        fun_l18_n459(x)
+    else
+        fun_l18_n407(x)
+    end
+end
+
+def fun_l17_n216(x)
+    if (x < 1)
+        fun_l18_n761(x)
+    else
+        fun_l18_n308(x)
+    end
+end
+
+def fun_l17_n217(x)
+    if (x < 1)
+        fun_l18_n350(x)
+    else
+        fun_l18_n680(x)
+    end
+end
+
+def fun_l17_n218(x)
+    if (x < 1)
+        fun_l18_n240(x)
+    else
+        fun_l18_n119(x)
+    end
+end
+
+def fun_l17_n219(x)
+    if (x < 1)
+        fun_l18_n538(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n220(x)
+    if (x < 1)
+        fun_l18_n45(x)
+    else
+        fun_l18_n643(x)
+    end
+end
+
+def fun_l17_n221(x)
+    if (x < 1)
+        fun_l18_n258(x)
+    else
+        fun_l18_n690(x)
+    end
+end
+
+def fun_l17_n222(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n998(x)
+    end
+end
+
+def fun_l17_n223(x)
+    if (x < 1)
+        fun_l18_n591(x)
+    else
+        fun_l18_n278(x)
+    end
+end
+
+def fun_l17_n224(x)
+    if (x < 1)
+        fun_l18_n433(x)
+    else
+        fun_l18_n852(x)
+    end
+end
+
+def fun_l17_n225(x)
+    if (x < 1)
+        fun_l18_n51(x)
+    else
+        fun_l18_n837(x)
+    end
+end
+
+def fun_l17_n226(x)
+    if (x < 1)
+        fun_l18_n755(x)
+    else
+        fun_l18_n949(x)
+    end
+end
+
+def fun_l17_n227(x)
+    if (x < 1)
+        fun_l18_n566(x)
+    else
+        fun_l18_n754(x)
+    end
+end
+
+def fun_l17_n228(x)
+    if (x < 1)
+        fun_l18_n915(x)
+    else
+        fun_l18_n893(x)
+    end
+end
+
+def fun_l17_n229(x)
+    if (x < 1)
+        fun_l18_n990(x)
+    else
+        fun_l18_n208(x)
+    end
+end
+
+def fun_l17_n230(x)
+    if (x < 1)
+        fun_l18_n220(x)
+    else
+        fun_l18_n292(x)
+    end
+end
+
+def fun_l17_n231(x)
+    if (x < 1)
+        fun_l18_n39(x)
+    else
+        fun_l18_n211(x)
+    end
+end
+
+def fun_l17_n232(x)
+    if (x < 1)
+        fun_l18_n669(x)
+    else
+        fun_l18_n818(x)
+    end
+end
+
+def fun_l17_n233(x)
+    if (x < 1)
+        fun_l18_n804(x)
+    else
+        fun_l18_n400(x)
+    end
+end
+
+def fun_l17_n234(x)
+    if (x < 1)
+        fun_l18_n198(x)
+    else
+        fun_l18_n393(x)
+    end
+end
+
+def fun_l17_n235(x)
+    if (x < 1)
+        fun_l18_n154(x)
+    else
+        fun_l18_n980(x)
+    end
+end
+
+def fun_l17_n236(x)
+    if (x < 1)
+        fun_l18_n46(x)
+    else
+        fun_l18_n926(x)
+    end
+end
+
+def fun_l17_n237(x)
+    if (x < 1)
+        fun_l18_n158(x)
+    else
+        fun_l18_n364(x)
+    end
+end
+
+def fun_l17_n238(x)
+    if (x < 1)
+        fun_l18_n728(x)
+    else
+        fun_l18_n864(x)
+    end
+end
+
+def fun_l17_n239(x)
+    if (x < 1)
+        fun_l18_n793(x)
+    else
+        fun_l18_n985(x)
+    end
+end
+
+def fun_l17_n240(x)
+    if (x < 1)
+        fun_l18_n619(x)
+    else
+        fun_l18_n216(x)
+    end
+end
+
+def fun_l17_n241(x)
+    if (x < 1)
+        fun_l18_n338(x)
+    else
+        fun_l18_n289(x)
+    end
+end
+
+def fun_l17_n242(x)
+    if (x < 1)
+        fun_l18_n42(x)
+    else
+        fun_l18_n360(x)
+    end
+end
+
+def fun_l17_n243(x)
+    if (x < 1)
+        fun_l18_n883(x)
+    else
+        fun_l18_n243(x)
+    end
+end
+
+def fun_l17_n244(x)
+    if (x < 1)
+        fun_l18_n474(x)
+    else
+        fun_l18_n236(x)
+    end
+end
+
+def fun_l17_n245(x)
+    if (x < 1)
+        fun_l18_n694(x)
+    else
+        fun_l18_n579(x)
+    end
+end
+
+def fun_l17_n246(x)
+    if (x < 1)
+        fun_l18_n787(x)
+    else
+        fun_l18_n349(x)
+    end
+end
+
+def fun_l17_n247(x)
+    if (x < 1)
+        fun_l18_n140(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n248(x)
+    if (x < 1)
+        fun_l18_n587(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n249(x)
+    if (x < 1)
+        fun_l18_n7(x)
+    else
+        fun_l18_n352(x)
+    end
+end
+
+def fun_l17_n250(x)
+    if (x < 1)
+        fun_l18_n330(x)
+    else
+        fun_l18_n779(x)
+    end
+end
+
+def fun_l17_n251(x)
+    if (x < 1)
+        fun_l18_n655(x)
+    else
+        fun_l18_n45(x)
+    end
+end
+
+def fun_l17_n252(x)
+    if (x < 1)
+        fun_l18_n263(x)
+    else
+        fun_l18_n668(x)
+    end
+end
+
+def fun_l17_n253(x)
+    if (x < 1)
+        fun_l18_n799(x)
+    else
+        fun_l18_n141(x)
+    end
+end
+
+def fun_l17_n254(x)
+    if (x < 1)
+        fun_l18_n868(x)
+    else
+        fun_l18_n486(x)
+    end
+end
+
+def fun_l17_n255(x)
+    if (x < 1)
+        fun_l18_n238(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n256(x)
+    if (x < 1)
+        fun_l18_n939(x)
+    else
+        fun_l18_n977(x)
+    end
+end
+
+def fun_l17_n257(x)
+    if (x < 1)
+        fun_l18_n999(x)
+    else
+        fun_l18_n241(x)
+    end
+end
+
+def fun_l17_n258(x)
+    if (x < 1)
+        fun_l18_n362(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n259(x)
+    if (x < 1)
+        fun_l18_n166(x)
+    else
+        fun_l18_n550(x)
+    end
+end
+
+def fun_l17_n260(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n453(x)
+    end
+end
+
+def fun_l17_n261(x)
+    if (x < 1)
+        fun_l18_n590(x)
+    else
+        fun_l18_n217(x)
+    end
+end
+
+def fun_l17_n262(x)
+    if (x < 1)
+        fun_l18_n703(x)
+    else
+        fun_l18_n827(x)
+    end
+end
+
+def fun_l17_n263(x)
+    if (x < 1)
+        fun_l18_n911(x)
+    else
+        fun_l18_n869(x)
+    end
+end
+
+def fun_l17_n264(x)
+    if (x < 1)
+        fun_l18_n980(x)
+    else
+        fun_l18_n598(x)
+    end
+end
+
+def fun_l17_n265(x)
+    if (x < 1)
+        fun_l18_n751(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n266(x)
+    if (x < 1)
+        fun_l18_n527(x)
+    else
+        fun_l18_n392(x)
+    end
+end
+
+def fun_l17_n267(x)
+    if (x < 1)
+        fun_l18_n257(x)
+    else
+        fun_l18_n731(x)
+    end
+end
+
+def fun_l17_n268(x)
+    if (x < 1)
+        fun_l18_n254(x)
+    else
+        fun_l18_n188(x)
+    end
+end
+
+def fun_l17_n269(x)
+    if (x < 1)
+        fun_l18_n145(x)
+    else
+        fun_l18_n987(x)
+    end
+end
+
+def fun_l17_n270(x)
+    if (x < 1)
+        fun_l18_n640(x)
+    else
+        fun_l18_n370(x)
+    end
+end
+
+def fun_l17_n271(x)
+    if (x < 1)
+        fun_l18_n767(x)
+    else
+        fun_l18_n246(x)
+    end
+end
+
+def fun_l17_n272(x)
+    if (x < 1)
+        fun_l18_n274(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n273(x)
+    if (x < 1)
+        fun_l18_n12(x)
+    else
+        fun_l18_n48(x)
+    end
+end
+
+def fun_l17_n274(x)
+    if (x < 1)
+        fun_l18_n389(x)
+    else
+        fun_l18_n353(x)
+    end
+end
+
+def fun_l17_n275(x)
+    if (x < 1)
+        fun_l18_n966(x)
+    else
+        fun_l18_n248(x)
+    end
+end
+
+def fun_l17_n276(x)
+    if (x < 1)
+        fun_l18_n459(x)
+    else
+        fun_l18_n989(x)
+    end
+end
+
+def fun_l17_n277(x)
+    if (x < 1)
+        fun_l18_n416(x)
+    else
+        fun_l18_n976(x)
+    end
+end
+
+def fun_l17_n278(x)
+    if (x < 1)
+        fun_l18_n752(x)
+    else
+        fun_l18_n282(x)
+    end
+end
+
+def fun_l17_n279(x)
+    if (x < 1)
+        fun_l18_n774(x)
+    else
+        fun_l18_n478(x)
+    end
+end
+
+def fun_l17_n280(x)
+    if (x < 1)
+        fun_l18_n713(x)
+    else
+        fun_l18_n117(x)
+    end
+end
+
+def fun_l17_n281(x)
+    if (x < 1)
+        fun_l18_n365(x)
+    else
+        fun_l18_n932(x)
+    end
+end
+
+def fun_l17_n282(x)
+    if (x < 1)
+        fun_l18_n791(x)
+    else
+        fun_l18_n331(x)
+    end
+end
+
+def fun_l17_n283(x)
+    if (x < 1)
+        fun_l18_n955(x)
+    else
+        fun_l18_n847(x)
+    end
+end
+
+def fun_l17_n284(x)
+    if (x < 1)
+        fun_l18_n409(x)
+    else
+        fun_l18_n681(x)
+    end
+end
+
+def fun_l17_n285(x)
+    if (x < 1)
+        fun_l18_n185(x)
+    else
+        fun_l18_n651(x)
+    end
+end
+
+def fun_l17_n286(x)
+    if (x < 1)
+        fun_l18_n894(x)
+    else
+        fun_l18_n827(x)
+    end
+end
+
+def fun_l17_n287(x)
+    if (x < 1)
+        fun_l18_n788(x)
+    else
+        fun_l18_n794(x)
+    end
+end
+
+def fun_l17_n288(x)
+    if (x < 1)
+        fun_l18_n361(x)
+    else
+        fun_l18_n415(x)
+    end
+end
+
+def fun_l17_n289(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n375(x)
+    end
+end
+
+def fun_l17_n290(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n85(x)
+    end
+end
+
+def fun_l17_n291(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n260(x)
+    end
+end
+
+def fun_l17_n292(x)
+    if (x < 1)
+        fun_l18_n21(x)
+    else
+        fun_l18_n497(x)
+    end
+end
+
+def fun_l17_n293(x)
+    if (x < 1)
+        fun_l18_n716(x)
+    else
+        fun_l18_n94(x)
+    end
+end
+
+def fun_l17_n294(x)
+    if (x < 1)
+        fun_l18_n462(x)
+    else
+        fun_l18_n408(x)
+    end
+end
+
+def fun_l17_n295(x)
+    if (x < 1)
+        fun_l18_n87(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n296(x)
+    if (x < 1)
+        fun_l18_n889(x)
+    else
+        fun_l18_n755(x)
+    end
+end
+
+def fun_l17_n297(x)
+    if (x < 1)
+        fun_l18_n539(x)
+    else
+        fun_l18_n130(x)
+    end
+end
+
+def fun_l17_n298(x)
+    if (x < 1)
+        fun_l18_n729(x)
+    else
+        fun_l18_n861(x)
+    end
+end
+
+def fun_l17_n299(x)
+    if (x < 1)
+        fun_l18_n605(x)
+    else
+        fun_l18_n408(x)
+    end
+end
+
+def fun_l17_n300(x)
+    if (x < 1)
+        fun_l18_n408(x)
+    else
+        fun_l18_n281(x)
+    end
+end
+
+def fun_l17_n301(x)
+    if (x < 1)
+        fun_l18_n793(x)
+    else
+        fun_l18_n188(x)
+    end
+end
+
+def fun_l17_n302(x)
+    if (x < 1)
+        fun_l18_n42(x)
+    else
+        fun_l18_n970(x)
+    end
+end
+
+def fun_l17_n303(x)
+    if (x < 1)
+        fun_l18_n904(x)
+    else
+        fun_l18_n630(x)
+    end
+end
+
+def fun_l17_n304(x)
+    if (x < 1)
+        fun_l18_n142(x)
+    else
+        fun_l18_n366(x)
+    end
+end
+
+def fun_l17_n305(x)
+    if (x < 1)
+        fun_l18_n242(x)
+    else
+        fun_l18_n111(x)
+    end
+end
+
+def fun_l17_n306(x)
+    if (x < 1)
+        fun_l18_n184(x)
+    else
+        fun_l18_n301(x)
+    end
+end
+
+def fun_l17_n307(x)
+    if (x < 1)
+        fun_l18_n297(x)
+    else
+        fun_l18_n722(x)
+    end
+end
+
+def fun_l17_n308(x)
+    if (x < 1)
+        fun_l18_n608(x)
+    else
+        fun_l18_n502(x)
+    end
+end
+
+def fun_l17_n309(x)
+    if (x < 1)
+        fun_l18_n513(x)
+    else
+        fun_l18_n828(x)
+    end
+end
+
+def fun_l17_n310(x)
+    if (x < 1)
+        fun_l18_n5(x)
+    else
+        fun_l18_n638(x)
+    end
+end
+
+def fun_l17_n311(x)
+    if (x < 1)
+        fun_l18_n404(x)
+    else
+        fun_l18_n510(x)
+    end
+end
+
+def fun_l17_n312(x)
+    if (x < 1)
+        fun_l18_n961(x)
+    else
+        fun_l18_n526(x)
+    end
+end
+
+def fun_l17_n313(x)
+    if (x < 1)
+        fun_l18_n795(x)
+    else
+        fun_l18_n24(x)
+    end
+end
+
+def fun_l17_n314(x)
+    if (x < 1)
+        fun_l18_n505(x)
+    else
+        fun_l18_n526(x)
+    end
+end
+
+def fun_l17_n315(x)
+    if (x < 1)
+        fun_l18_n458(x)
+    else
+        fun_l18_n767(x)
+    end
+end
+
+def fun_l17_n316(x)
+    if (x < 1)
+        fun_l18_n778(x)
+    else
+        fun_l18_n972(x)
+    end
+end
+
+def fun_l17_n317(x)
+    if (x < 1)
+        fun_l18_n734(x)
+    else
+        fun_l18_n289(x)
+    end
+end
+
+def fun_l17_n318(x)
+    if (x < 1)
+        fun_l18_n950(x)
+    else
+        fun_l18_n507(x)
+    end
+end
+
+def fun_l17_n319(x)
+    if (x < 1)
+        fun_l18_n597(x)
+    else
+        fun_l18_n697(x)
+    end
+end
+
+def fun_l17_n320(x)
+    if (x < 1)
+        fun_l18_n270(x)
+    else
+        fun_l18_n323(x)
+    end
+end
+
+def fun_l17_n321(x)
+    if (x < 1)
+        fun_l18_n558(x)
+    else
+        fun_l18_n357(x)
+    end
+end
+
+def fun_l17_n322(x)
+    if (x < 1)
+        fun_l18_n948(x)
+    else
+        fun_l18_n726(x)
+    end
+end
+
+def fun_l17_n323(x)
+    if (x < 1)
+        fun_l18_n787(x)
+    else
+        fun_l18_n89(x)
+    end
+end
+
+def fun_l17_n324(x)
+    if (x < 1)
+        fun_l18_n894(x)
+    else
+        fun_l18_n454(x)
+    end
+end
+
+def fun_l17_n325(x)
+    if (x < 1)
+        fun_l18_n173(x)
+    else
+        fun_l18_n815(x)
+    end
+end
+
+def fun_l17_n326(x)
+    if (x < 1)
+        fun_l18_n102(x)
+    else
+        fun_l18_n261(x)
+    end
+end
+
+def fun_l17_n327(x)
+    if (x < 1)
+        fun_l18_n83(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n328(x)
+    if (x < 1)
+        fun_l18_n675(x)
+    else
+        fun_l18_n186(x)
+    end
+end
+
+def fun_l17_n329(x)
+    if (x < 1)
+        fun_l18_n783(x)
+    else
+        fun_l18_n481(x)
+    end
+end
+
+def fun_l17_n330(x)
+    if (x < 1)
+        fun_l18_n828(x)
+    else
+        fun_l18_n829(x)
+    end
+end
+
+def fun_l17_n331(x)
+    if (x < 1)
+        fun_l18_n195(x)
+    else
+        fun_l18_n264(x)
+    end
+end
+
+def fun_l17_n332(x)
+    if (x < 1)
+        fun_l18_n842(x)
+    else
+        fun_l18_n198(x)
+    end
+end
+
+def fun_l17_n333(x)
+    if (x < 1)
+        fun_l18_n549(x)
+    else
+        fun_l18_n208(x)
+    end
+end
+
+def fun_l17_n334(x)
+    if (x < 1)
+        fun_l18_n976(x)
+    else
+        fun_l18_n316(x)
+    end
+end
+
+def fun_l17_n335(x)
+    if (x < 1)
+        fun_l18_n401(x)
+    else
+        fun_l18_n105(x)
+    end
+end
+
+def fun_l17_n336(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n54(x)
+    end
+end
+
+def fun_l17_n337(x)
+    if (x < 1)
+        fun_l18_n685(x)
+    else
+        fun_l18_n140(x)
+    end
+end
+
+def fun_l17_n338(x)
+    if (x < 1)
+        fun_l18_n301(x)
+    else
+        fun_l18_n167(x)
+    end
+end
+
+def fun_l17_n339(x)
+    if (x < 1)
+        fun_l18_n398(x)
+    else
+        fun_l18_n643(x)
+    end
+end
+
+def fun_l17_n340(x)
+    if (x < 1)
+        fun_l18_n147(x)
+    else
+        fun_l18_n27(x)
+    end
+end
+
+def fun_l17_n341(x)
+    if (x < 1)
+        fun_l18_n813(x)
+    else
+        fun_l18_n935(x)
+    end
+end
+
+def fun_l17_n342(x)
+    if (x < 1)
+        fun_l18_n319(x)
+    else
+        fun_l18_n429(x)
+    end
+end
+
+def fun_l17_n343(x)
+    if (x < 1)
+        fun_l18_n957(x)
+    else
+        fun_l18_n961(x)
+    end
+end
+
+def fun_l17_n344(x)
+    if (x < 1)
+        fun_l18_n380(x)
+    else
+        fun_l18_n604(x)
+    end
+end
+
+def fun_l17_n345(x)
+    if (x < 1)
+        fun_l18_n321(x)
+    else
+        fun_l18_n473(x)
+    end
+end
+
+def fun_l17_n346(x)
+    if (x < 1)
+        fun_l18_n346(x)
+    else
+        fun_l18_n752(x)
+    end
+end
+
+def fun_l17_n347(x)
+    if (x < 1)
+        fun_l18_n645(x)
+    else
+        fun_l18_n511(x)
+    end
+end
+
+def fun_l17_n348(x)
+    if (x < 1)
+        fun_l18_n647(x)
+    else
+        fun_l18_n997(x)
+    end
+end
+
+def fun_l17_n349(x)
+    if (x < 1)
+        fun_l18_n291(x)
+    else
+        fun_l18_n580(x)
+    end
+end
+
+def fun_l17_n350(x)
+    if (x < 1)
+        fun_l18_n745(x)
+    else
+        fun_l18_n402(x)
+    end
+end
+
+def fun_l17_n351(x)
+    if (x < 1)
+        fun_l18_n533(x)
+    else
+        fun_l18_n117(x)
+    end
+end
+
+def fun_l17_n352(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n458(x)
+    end
+end
+
+def fun_l17_n353(x)
+    if (x < 1)
+        fun_l18_n526(x)
+    else
+        fun_l18_n311(x)
+    end
+end
+
+def fun_l17_n354(x)
+    if (x < 1)
+        fun_l18_n315(x)
+    else
+        fun_l18_n306(x)
+    end
+end
+
+def fun_l17_n355(x)
+    if (x < 1)
+        fun_l18_n349(x)
+    else
+        fun_l18_n975(x)
+    end
+end
+
+def fun_l17_n356(x)
+    if (x < 1)
+        fun_l18_n764(x)
+    else
+        fun_l18_n897(x)
+    end
+end
+
+def fun_l17_n357(x)
+    if (x < 1)
+        fun_l18_n308(x)
+    else
+        fun_l18_n662(x)
+    end
+end
+
+def fun_l17_n358(x)
+    if (x < 1)
+        fun_l18_n7(x)
+    else
+        fun_l18_n807(x)
+    end
+end
+
+def fun_l17_n359(x)
+    if (x < 1)
+        fun_l18_n896(x)
+    else
+        fun_l18_n277(x)
+    end
+end
+
+def fun_l17_n360(x)
+    if (x < 1)
+        fun_l18_n606(x)
+    else
+        fun_l18_n605(x)
+    end
+end
+
+def fun_l17_n361(x)
+    if (x < 1)
+        fun_l18_n971(x)
+    else
+        fun_l18_n59(x)
+    end
+end
+
+def fun_l17_n362(x)
+    if (x < 1)
+        fun_l18_n304(x)
+    else
+        fun_l18_n604(x)
+    end
+end
+
+def fun_l17_n363(x)
+    if (x < 1)
+        fun_l18_n607(x)
+    else
+        fun_l18_n758(x)
+    end
+end
+
+def fun_l17_n364(x)
+    if (x < 1)
+        fun_l18_n454(x)
+    else
+        fun_l18_n635(x)
+    end
+end
+
+def fun_l17_n365(x)
+    if (x < 1)
+        fun_l18_n287(x)
+    else
+        fun_l18_n979(x)
+    end
+end
+
+def fun_l17_n366(x)
+    if (x < 1)
+        fun_l18_n708(x)
+    else
+        fun_l18_n480(x)
+    end
+end
+
+def fun_l17_n367(x)
+    if (x < 1)
+        fun_l18_n925(x)
+    else
+        fun_l18_n96(x)
+    end
+end
+
+def fun_l17_n368(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n765(x)
+    end
+end
+
+def fun_l17_n369(x)
+    if (x < 1)
+        fun_l18_n134(x)
+    else
+        fun_l18_n320(x)
+    end
+end
+
+def fun_l17_n370(x)
+    if (x < 1)
+        fun_l18_n167(x)
+    else
+        fun_l18_n112(x)
+    end
+end
+
+def fun_l17_n371(x)
+    if (x < 1)
+        fun_l18_n393(x)
+    else
+        fun_l18_n701(x)
+    end
+end
+
+def fun_l17_n372(x)
+    if (x < 1)
+        fun_l18_n363(x)
+    else
+        fun_l18_n934(x)
+    end
+end
+
+def fun_l17_n373(x)
+    if (x < 1)
+        fun_l18_n431(x)
+    else
+        fun_l18_n343(x)
+    end
+end
+
+def fun_l17_n374(x)
+    if (x < 1)
+        fun_l18_n111(x)
+    else
+        fun_l18_n689(x)
+    end
+end
+
+def fun_l17_n375(x)
+    if (x < 1)
+        fun_l18_n609(x)
+    else
+        fun_l18_n814(x)
+    end
+end
+
+def fun_l17_n376(x)
+    if (x < 1)
+        fun_l18_n9(x)
+    else
+        fun_l18_n711(x)
+    end
+end
+
+def fun_l17_n377(x)
+    if (x < 1)
+        fun_l18_n270(x)
+    else
+        fun_l18_n455(x)
+    end
+end
+
+def fun_l17_n378(x)
+    if (x < 1)
+        fun_l18_n432(x)
+    else
+        fun_l18_n348(x)
+    end
+end
+
+def fun_l17_n379(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n934(x)
+    end
+end
+
+def fun_l17_n380(x)
+    if (x < 1)
+        fun_l18_n737(x)
+    else
+        fun_l18_n472(x)
+    end
+end
+
+def fun_l17_n381(x)
+    if (x < 1)
+        fun_l18_n163(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n382(x)
+    if (x < 1)
+        fun_l18_n71(x)
+    else
+        fun_l18_n343(x)
+    end
+end
+
+def fun_l17_n383(x)
+    if (x < 1)
+        fun_l18_n52(x)
+    else
+        fun_l18_n0(x)
+    end
+end
+
+def fun_l17_n384(x)
+    if (x < 1)
+        fun_l18_n708(x)
+    else
+        fun_l18_n616(x)
+    end
+end
+
+def fun_l17_n385(x)
+    if (x < 1)
+        fun_l18_n525(x)
+    else
+        fun_l18_n818(x)
+    end
+end
+
+def fun_l17_n386(x)
+    if (x < 1)
+        fun_l18_n154(x)
+    else
+        fun_l18_n588(x)
+    end
+end
+
+def fun_l17_n387(x)
+    if (x < 1)
+        fun_l18_n295(x)
+    else
+        fun_l18_n462(x)
+    end
+end
+
+def fun_l17_n388(x)
+    if (x < 1)
+        fun_l18_n331(x)
+    else
+        fun_l18_n773(x)
+    end
+end
+
+def fun_l17_n389(x)
+    if (x < 1)
+        fun_l18_n221(x)
+    else
+        fun_l18_n168(x)
+    end
+end
+
+def fun_l17_n390(x)
+    if (x < 1)
+        fun_l18_n575(x)
+    else
+        fun_l18_n284(x)
+    end
+end
+
+def fun_l17_n391(x)
+    if (x < 1)
+        fun_l18_n936(x)
+    else
+        fun_l18_n71(x)
+    end
+end
+
+def fun_l17_n392(x)
+    if (x < 1)
+        fun_l18_n123(x)
+    else
+        fun_l18_n863(x)
+    end
+end
+
+def fun_l17_n393(x)
+    if (x < 1)
+        fun_l18_n664(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n394(x)
+    if (x < 1)
+        fun_l18_n456(x)
+    else
+        fun_l18_n476(x)
+    end
+end
+
+def fun_l17_n395(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n877(x)
+    end
+end
+
+def fun_l17_n396(x)
+    if (x < 1)
+        fun_l18_n192(x)
+    else
+        fun_l18_n312(x)
+    end
+end
+
+def fun_l17_n397(x)
+    if (x < 1)
+        fun_l18_n87(x)
+    else
+        fun_l18_n56(x)
+    end
+end
+
+def fun_l17_n398(x)
+    if (x < 1)
+        fun_l18_n769(x)
+    else
+        fun_l18_n597(x)
+    end
+end
+
+def fun_l17_n399(x)
+    if (x < 1)
+        fun_l18_n534(x)
+    else
+        fun_l18_n366(x)
+    end
+end
+
+def fun_l17_n400(x)
+    if (x < 1)
+        fun_l18_n284(x)
+    else
+        fun_l18_n503(x)
+    end
+end
+
+def fun_l17_n401(x)
+    if (x < 1)
+        fun_l18_n655(x)
+    else
+        fun_l18_n242(x)
+    end
+end
+
+def fun_l17_n402(x)
+    if (x < 1)
+        fun_l18_n491(x)
+    else
+        fun_l18_n81(x)
+    end
+end
+
+def fun_l17_n403(x)
+    if (x < 1)
+        fun_l18_n861(x)
+    else
+        fun_l18_n372(x)
+    end
+end
+
+def fun_l17_n404(x)
+    if (x < 1)
+        fun_l18_n600(x)
+    else
+        fun_l18_n692(x)
+    end
+end
+
+def fun_l17_n405(x)
+    if (x < 1)
+        fun_l18_n336(x)
+    else
+        fun_l18_n778(x)
+    end
+end
+
+def fun_l17_n406(x)
+    if (x < 1)
+        fun_l18_n224(x)
+    else
+        fun_l18_n277(x)
+    end
+end
+
+def fun_l17_n407(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n861(x)
+    end
+end
+
+def fun_l17_n408(x)
+    if (x < 1)
+        fun_l18_n829(x)
+    else
+        fun_l18_n213(x)
+    end
+end
+
+def fun_l17_n409(x)
+    if (x < 1)
+        fun_l18_n325(x)
+    else
+        fun_l18_n599(x)
+    end
+end
+
+def fun_l17_n410(x)
+    if (x < 1)
+        fun_l18_n850(x)
+    else
+        fun_l18_n828(x)
+    end
+end
+
+def fun_l17_n411(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n757(x)
+    end
+end
+
+def fun_l17_n412(x)
+    if (x < 1)
+        fun_l18_n755(x)
+    else
+        fun_l18_n474(x)
+    end
+end
+
+def fun_l17_n413(x)
+    if (x < 1)
+        fun_l18_n945(x)
+    else
+        fun_l18_n113(x)
+    end
+end
+
+def fun_l17_n414(x)
+    if (x < 1)
+        fun_l18_n584(x)
+    else
+        fun_l18_n815(x)
+    end
+end
+
+def fun_l17_n415(x)
+    if (x < 1)
+        fun_l18_n136(x)
+    else
+        fun_l18_n997(x)
+    end
+end
+
+def fun_l17_n416(x)
+    if (x < 1)
+        fun_l18_n57(x)
+    else
+        fun_l18_n361(x)
+    end
+end
+
+def fun_l17_n417(x)
+    if (x < 1)
+        fun_l18_n3(x)
+    else
+        fun_l18_n882(x)
+    end
+end
+
+def fun_l17_n418(x)
+    if (x < 1)
+        fun_l18_n578(x)
+    else
+        fun_l18_n719(x)
+    end
+end
+
+def fun_l17_n419(x)
+    if (x < 1)
+        fun_l18_n426(x)
+    else
+        fun_l18_n958(x)
+    end
+end
+
+def fun_l17_n420(x)
+    if (x < 1)
+        fun_l18_n384(x)
+    else
+        fun_l18_n182(x)
+    end
+end
+
+def fun_l17_n421(x)
+    if (x < 1)
+        fun_l18_n458(x)
+    else
+        fun_l18_n314(x)
+    end
+end
+
+def fun_l17_n422(x)
+    if (x < 1)
+        fun_l18_n641(x)
+    else
+        fun_l18_n678(x)
+    end
+end
+
+def fun_l17_n423(x)
+    if (x < 1)
+        fun_l18_n790(x)
+    else
+        fun_l18_n830(x)
+    end
+end
+
+def fun_l17_n424(x)
+    if (x < 1)
+        fun_l18_n207(x)
+    else
+        fun_l18_n686(x)
+    end
+end
+
+def fun_l17_n425(x)
+    if (x < 1)
+        fun_l18_n847(x)
+    else
+        fun_l18_n387(x)
+    end
+end
+
+def fun_l17_n426(x)
+    if (x < 1)
+        fun_l18_n744(x)
+    else
+        fun_l18_n9(x)
+    end
+end
+
+def fun_l17_n427(x)
+    if (x < 1)
+        fun_l18_n446(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n428(x)
+    if (x < 1)
+        fun_l18_n910(x)
+    else
+        fun_l18_n749(x)
+    end
+end
+
+def fun_l17_n429(x)
+    if (x < 1)
+        fun_l18_n918(x)
+    else
+        fun_l18_n260(x)
+    end
+end
+
+def fun_l17_n430(x)
+    if (x < 1)
+        fun_l18_n812(x)
+    else
+        fun_l18_n545(x)
+    end
+end
+
+def fun_l17_n431(x)
+    if (x < 1)
+        fun_l18_n191(x)
+    else
+        fun_l18_n260(x)
+    end
+end
+
+def fun_l17_n432(x)
+    if (x < 1)
+        fun_l18_n155(x)
+    else
+        fun_l18_n582(x)
+    end
+end
+
+def fun_l17_n433(x)
+    if (x < 1)
+        fun_l18_n374(x)
+    else
+        fun_l18_n991(x)
+    end
+end
+
+def fun_l17_n434(x)
+    if (x < 1)
+        fun_l18_n611(x)
+    else
+        fun_l18_n334(x)
+    end
+end
+
+def fun_l17_n435(x)
+    if (x < 1)
+        fun_l18_n876(x)
+    else
+        fun_l18_n386(x)
+    end
+end
+
+def fun_l17_n436(x)
+    if (x < 1)
+        fun_l18_n985(x)
+    else
+        fun_l18_n874(x)
+    end
+end
+
+def fun_l17_n437(x)
+    if (x < 1)
+        fun_l18_n715(x)
+    else
+        fun_l18_n52(x)
+    end
+end
+
+def fun_l17_n438(x)
+    if (x < 1)
+        fun_l18_n53(x)
+    else
+        fun_l18_n15(x)
+    end
+end
+
+def fun_l17_n439(x)
+    if (x < 1)
+        fun_l18_n689(x)
+    else
+        fun_l18_n498(x)
+    end
+end
+
+def fun_l17_n440(x)
+    if (x < 1)
+        fun_l18_n990(x)
+    else
+        fun_l18_n70(x)
+    end
+end
+
+def fun_l17_n441(x)
+    if (x < 1)
+        fun_l18_n369(x)
+    else
+        fun_l18_n327(x)
+    end
+end
+
+def fun_l17_n442(x)
+    if (x < 1)
+        fun_l18_n157(x)
+    else
+        fun_l18_n917(x)
+    end
+end
+
+def fun_l17_n443(x)
+    if (x < 1)
+        fun_l18_n822(x)
+    else
+        fun_l18_n472(x)
+    end
+end
+
+def fun_l17_n444(x)
+    if (x < 1)
+        fun_l18_n465(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n445(x)
+    if (x < 1)
+        fun_l18_n543(x)
+    else
+        fun_l18_n499(x)
+    end
+end
+
+def fun_l17_n446(x)
+    if (x < 1)
+        fun_l18_n662(x)
+    else
+        fun_l18_n531(x)
+    end
+end
+
+def fun_l17_n447(x)
+    if (x < 1)
+        fun_l18_n452(x)
+    else
+        fun_l18_n150(x)
+    end
+end
+
+def fun_l17_n448(x)
+    if (x < 1)
+        fun_l18_n438(x)
+    else
+        fun_l18_n552(x)
+    end
+end
+
+def fun_l17_n449(x)
+    if (x < 1)
+        fun_l18_n23(x)
+    else
+        fun_l18_n89(x)
+    end
+end
+
+def fun_l17_n450(x)
+    if (x < 1)
+        fun_l18_n896(x)
+    else
+        fun_l18_n313(x)
+    end
+end
+
+def fun_l17_n451(x)
+    if (x < 1)
+        fun_l18_n221(x)
+    else
+        fun_l18_n622(x)
+    end
+end
+
+def fun_l17_n452(x)
+    if (x < 1)
+        fun_l18_n347(x)
+    else
+        fun_l18_n43(x)
+    end
+end
+
+def fun_l17_n453(x)
+    if (x < 1)
+        fun_l18_n695(x)
+    else
+        fun_l18_n5(x)
+    end
+end
+
+def fun_l17_n454(x)
+    if (x < 1)
+        fun_l18_n829(x)
+    else
+        fun_l18_n409(x)
+    end
+end
+
+def fun_l17_n455(x)
+    if (x < 1)
+        fun_l18_n398(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n456(x)
+    if (x < 1)
+        fun_l18_n983(x)
+    else
+        fun_l18_n235(x)
+    end
+end
+
+def fun_l17_n457(x)
+    if (x < 1)
+        fun_l18_n542(x)
+    else
+        fun_l18_n819(x)
+    end
+end
+
+def fun_l17_n458(x)
+    if (x < 1)
+        fun_l18_n952(x)
+    else
+        fun_l18_n123(x)
+    end
+end
+
+def fun_l17_n459(x)
+    if (x < 1)
+        fun_l18_n249(x)
+    else
+        fun_l18_n525(x)
+    end
+end
+
+def fun_l17_n460(x)
+    if (x < 1)
+        fun_l18_n833(x)
+    else
+        fun_l18_n657(x)
+    end
+end
+
+def fun_l17_n461(x)
+    if (x < 1)
+        fun_l18_n847(x)
+    else
+        fun_l18_n396(x)
+    end
+end
+
+def fun_l17_n462(x)
+    if (x < 1)
+        fun_l18_n611(x)
+    else
+        fun_l18_n790(x)
+    end
+end
+
+def fun_l17_n463(x)
+    if (x < 1)
+        fun_l18_n944(x)
+    else
+        fun_l18_n655(x)
+    end
+end
+
+def fun_l17_n464(x)
+    if (x < 1)
+        fun_l18_n688(x)
+    else
+        fun_l18_n804(x)
+    end
+end
+
+def fun_l17_n465(x)
+    if (x < 1)
+        fun_l18_n29(x)
+    else
+        fun_l18_n324(x)
+    end
+end
+
+def fun_l17_n466(x)
+    if (x < 1)
+        fun_l18_n496(x)
+    else
+        fun_l18_n76(x)
+    end
+end
+
+def fun_l17_n467(x)
+    if (x < 1)
+        fun_l18_n317(x)
+    else
+        fun_l18_n241(x)
+    end
+end
+
+def fun_l17_n468(x)
+    if (x < 1)
+        fun_l18_n759(x)
+    else
+        fun_l18_n516(x)
+    end
+end
+
+def fun_l17_n469(x)
+    if (x < 1)
+        fun_l18_n430(x)
+    else
+        fun_l18_n355(x)
+    end
+end
+
+def fun_l17_n470(x)
+    if (x < 1)
+        fun_l18_n683(x)
+    else
+        fun_l18_n16(x)
+    end
+end
+
+def fun_l17_n471(x)
+    if (x < 1)
+        fun_l18_n46(x)
+    else
+        fun_l18_n216(x)
+    end
+end
+
+def fun_l17_n472(x)
+    if (x < 1)
+        fun_l18_n460(x)
+    else
+        fun_l18_n460(x)
+    end
+end
+
+def fun_l17_n473(x)
+    if (x < 1)
+        fun_l18_n120(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n474(x)
+    if (x < 1)
+        fun_l18_n663(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n475(x)
+    if (x < 1)
+        fun_l18_n441(x)
+    else
+        fun_l18_n460(x)
+    end
+end
+
+def fun_l17_n476(x)
+    if (x < 1)
+        fun_l18_n759(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n477(x)
+    if (x < 1)
+        fun_l18_n105(x)
+    else
+        fun_l18_n671(x)
+    end
+end
+
+def fun_l17_n478(x)
+    if (x < 1)
+        fun_l18_n849(x)
+    else
+        fun_l18_n316(x)
+    end
+end
+
+def fun_l17_n479(x)
+    if (x < 1)
+        fun_l18_n482(x)
+    else
+        fun_l18_n502(x)
+    end
+end
+
+def fun_l17_n480(x)
+    if (x < 1)
+        fun_l18_n335(x)
+    else
+        fun_l18_n795(x)
+    end
+end
+
+def fun_l17_n481(x)
+    if (x < 1)
+        fun_l18_n168(x)
+    else
+        fun_l18_n799(x)
+    end
+end
+
+def fun_l17_n482(x)
+    if (x < 1)
+        fun_l18_n981(x)
+    else
+        fun_l18_n633(x)
+    end
+end
+
+def fun_l17_n483(x)
+    if (x < 1)
+        fun_l18_n873(x)
+    else
+        fun_l18_n723(x)
+    end
+end
+
+def fun_l17_n484(x)
+    if (x < 1)
+        fun_l18_n448(x)
+    else
+        fun_l18_n954(x)
+    end
+end
+
+def fun_l17_n485(x)
+    if (x < 1)
+        fun_l18_n421(x)
+    else
+        fun_l18_n802(x)
+    end
+end
+
+def fun_l17_n486(x)
+    if (x < 1)
+        fun_l18_n477(x)
+    else
+        fun_l18_n976(x)
+    end
+end
+
+def fun_l17_n487(x)
+    if (x < 1)
+        fun_l18_n53(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n488(x)
+    if (x < 1)
+        fun_l18_n733(x)
+    else
+        fun_l18_n585(x)
+    end
+end
+
+def fun_l17_n489(x)
+    if (x < 1)
+        fun_l18_n684(x)
+    else
+        fun_l18_n537(x)
+    end
+end
+
+def fun_l17_n490(x)
+    if (x < 1)
+        fun_l18_n409(x)
+    else
+        fun_l18_n178(x)
+    end
+end
+
+def fun_l17_n491(x)
+    if (x < 1)
+        fun_l18_n335(x)
+    else
+        fun_l18_n255(x)
+    end
+end
+
+def fun_l17_n492(x)
+    if (x < 1)
+        fun_l18_n798(x)
+    else
+        fun_l18_n398(x)
+    end
+end
+
+def fun_l17_n493(x)
+    if (x < 1)
+        fun_l18_n112(x)
+    else
+        fun_l18_n83(x)
+    end
+end
+
+def fun_l17_n494(x)
+    if (x < 1)
+        fun_l18_n888(x)
+    else
+        fun_l18_n136(x)
+    end
+end
+
+def fun_l17_n495(x)
+    if (x < 1)
+        fun_l18_n726(x)
+    else
+        fun_l18_n678(x)
+    end
+end
+
+def fun_l17_n496(x)
+    if (x < 1)
+        fun_l18_n224(x)
+    else
+        fun_l18_n625(x)
+    end
+end
+
+def fun_l17_n497(x)
+    if (x < 1)
+        fun_l18_n772(x)
+    else
+        fun_l18_n14(x)
+    end
+end
+
+def fun_l17_n498(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n758(x)
+    end
+end
+
+def fun_l17_n499(x)
+    if (x < 1)
+        fun_l18_n961(x)
+    else
+        fun_l18_n570(x)
+    end
+end
+
+def fun_l17_n500(x)
+    if (x < 1)
+        fun_l18_n368(x)
+    else
+        fun_l18_n681(x)
+    end
+end
+
+def fun_l17_n501(x)
+    if (x < 1)
+        fun_l18_n768(x)
+    else
+        fun_l18_n747(x)
+    end
+end
+
+def fun_l17_n502(x)
+    if (x < 1)
+        fun_l18_n957(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n503(x)
+    if (x < 1)
+        fun_l18_n669(x)
+    else
+        fun_l18_n939(x)
+    end
+end
+
+def fun_l17_n504(x)
+    if (x < 1)
+        fun_l18_n969(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n505(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n29(x)
+    end
+end
+
+def fun_l17_n506(x)
+    if (x < 1)
+        fun_l18_n92(x)
+    else
+        fun_l18_n230(x)
+    end
+end
+
+def fun_l17_n507(x)
+    if (x < 1)
+        fun_l18_n670(x)
+    else
+        fun_l18_n744(x)
+    end
+end
+
+def fun_l17_n508(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n900(x)
+    end
+end
+
+def fun_l17_n509(x)
+    if (x < 1)
+        fun_l18_n480(x)
+    else
+        fun_l18_n6(x)
+    end
+end
+
+def fun_l17_n510(x)
+    if (x < 1)
+        fun_l18_n141(x)
+    else
+        fun_l18_n735(x)
+    end
+end
+
+def fun_l17_n511(x)
+    if (x < 1)
+        fun_l18_n622(x)
+    else
+        fun_l18_n617(x)
+    end
+end
+
+def fun_l17_n512(x)
+    if (x < 1)
+        fun_l18_n491(x)
+    else
+        fun_l18_n154(x)
+    end
+end
+
+def fun_l17_n513(x)
+    if (x < 1)
+        fun_l18_n931(x)
+    else
+        fun_l18_n730(x)
+    end
+end
+
+def fun_l17_n514(x)
+    if (x < 1)
+        fun_l18_n935(x)
+    else
+        fun_l18_n51(x)
+    end
+end
+
+def fun_l17_n515(x)
+    if (x < 1)
+        fun_l18_n751(x)
+    else
+        fun_l18_n786(x)
+    end
+end
+
+def fun_l17_n516(x)
+    if (x < 1)
+        fun_l18_n538(x)
+    else
+        fun_l18_n630(x)
+    end
+end
+
+def fun_l17_n517(x)
+    if (x < 1)
+        fun_l18_n832(x)
+    else
+        fun_l18_n932(x)
+    end
+end
+
+def fun_l17_n518(x)
+    if (x < 1)
+        fun_l18_n572(x)
+    else
+        fun_l18_n408(x)
+    end
+end
+
+def fun_l17_n519(x)
+    if (x < 1)
+        fun_l18_n961(x)
+    else
+        fun_l18_n820(x)
+    end
+end
+
+def fun_l17_n520(x)
+    if (x < 1)
+        fun_l18_n33(x)
+    else
+        fun_l18_n655(x)
+    end
+end
+
+def fun_l17_n521(x)
+    if (x < 1)
+        fun_l18_n940(x)
+    else
+        fun_l18_n436(x)
+    end
+end
+
+def fun_l17_n522(x)
+    if (x < 1)
+        fun_l18_n471(x)
+    else
+        fun_l18_n975(x)
+    end
+end
+
+def fun_l17_n523(x)
+    if (x < 1)
+        fun_l18_n752(x)
+    else
+        fun_l18_n640(x)
+    end
+end
+
+def fun_l17_n524(x)
+    if (x < 1)
+        fun_l18_n226(x)
+    else
+        fun_l18_n645(x)
+    end
+end
+
+def fun_l17_n525(x)
+    if (x < 1)
+        fun_l18_n986(x)
+    else
+        fun_l18_n858(x)
+    end
+end
+
+def fun_l17_n526(x)
+    if (x < 1)
+        fun_l18_n362(x)
+    else
+        fun_l18_n842(x)
+    end
+end
+
+def fun_l17_n527(x)
+    if (x < 1)
+        fun_l18_n273(x)
+    else
+        fun_l18_n510(x)
+    end
+end
+
+def fun_l17_n528(x)
+    if (x < 1)
+        fun_l18_n728(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n529(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n988(x)
+    end
+end
+
+def fun_l17_n530(x)
+    if (x < 1)
+        fun_l18_n472(x)
+    else
+        fun_l18_n933(x)
+    end
+end
+
+def fun_l17_n531(x)
+    if (x < 1)
+        fun_l18_n105(x)
+    else
+        fun_l18_n501(x)
+    end
+end
+
+def fun_l17_n532(x)
+    if (x < 1)
+        fun_l18_n77(x)
+    else
+        fun_l18_n616(x)
+    end
+end
+
+def fun_l17_n533(x)
+    if (x < 1)
+        fun_l18_n404(x)
+    else
+        fun_l18_n86(x)
+    end
+end
+
+def fun_l17_n534(x)
+    if (x < 1)
+        fun_l18_n312(x)
+    else
+        fun_l18_n638(x)
+    end
+end
+
+def fun_l17_n535(x)
+    if (x < 1)
+        fun_l18_n908(x)
+    else
+        fun_l18_n697(x)
+    end
+end
+
+def fun_l17_n536(x)
+    if (x < 1)
+        fun_l18_n520(x)
+    else
+        fun_l18_n379(x)
+    end
+end
+
+def fun_l17_n537(x)
+    if (x < 1)
+        fun_l18_n15(x)
+    else
+        fun_l18_n97(x)
+    end
+end
+
+def fun_l17_n538(x)
+    if (x < 1)
+        fun_l18_n312(x)
+    else
+        fun_l18_n981(x)
+    end
+end
+
+def fun_l17_n539(x)
+    if (x < 1)
+        fun_l18_n901(x)
+    else
+        fun_l18_n579(x)
+    end
+end
+
+def fun_l17_n540(x)
+    if (x < 1)
+        fun_l18_n569(x)
+    else
+        fun_l18_n512(x)
+    end
+end
+
+def fun_l17_n541(x)
+    if (x < 1)
+        fun_l18_n319(x)
+    else
+        fun_l18_n388(x)
+    end
+end
+
+def fun_l17_n542(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n422(x)
+    end
+end
+
+def fun_l17_n543(x)
+    if (x < 1)
+        fun_l18_n873(x)
+    else
+        fun_l18_n614(x)
+    end
+end
+
+def fun_l17_n544(x)
+    if (x < 1)
+        fun_l18_n104(x)
+    else
+        fun_l18_n771(x)
+    end
+end
+
+def fun_l17_n545(x)
+    if (x < 1)
+        fun_l18_n204(x)
+    else
+        fun_l18_n452(x)
+    end
+end
+
+def fun_l17_n546(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n558(x)
+    end
+end
+
+def fun_l17_n547(x)
+    if (x < 1)
+        fun_l18_n265(x)
+    else
+        fun_l18_n768(x)
+    end
+end
+
+def fun_l17_n548(x)
+    if (x < 1)
+        fun_l18_n21(x)
+    else
+        fun_l18_n44(x)
+    end
+end
+
+def fun_l17_n549(x)
+    if (x < 1)
+        fun_l18_n72(x)
+    else
+        fun_l18_n321(x)
+    end
+end
+
+def fun_l17_n550(x)
+    if (x < 1)
+        fun_l18_n473(x)
+    else
+        fun_l18_n127(x)
+    end
+end
+
+def fun_l17_n551(x)
+    if (x < 1)
+        fun_l18_n188(x)
+    else
+        fun_l18_n782(x)
+    end
+end
+
+def fun_l17_n552(x)
+    if (x < 1)
+        fun_l18_n118(x)
+    else
+        fun_l18_n466(x)
+    end
+end
+
+def fun_l17_n553(x)
+    if (x < 1)
+        fun_l18_n279(x)
+    else
+        fun_l18_n605(x)
+    end
+end
+
+def fun_l17_n554(x)
+    if (x < 1)
+        fun_l18_n760(x)
+    else
+        fun_l18_n561(x)
+    end
+end
+
+def fun_l17_n555(x)
+    if (x < 1)
+        fun_l18_n873(x)
+    else
+        fun_l18_n846(x)
+    end
+end
+
+def fun_l17_n556(x)
+    if (x < 1)
+        fun_l18_n555(x)
+    else
+        fun_l18_n955(x)
+    end
+end
+
+def fun_l17_n557(x)
+    if (x < 1)
+        fun_l18_n757(x)
+    else
+        fun_l18_n171(x)
+    end
+end
+
+def fun_l17_n558(x)
+    if (x < 1)
+        fun_l18_n684(x)
+    else
+        fun_l18_n784(x)
+    end
+end
+
+def fun_l17_n559(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n798(x)
+    end
+end
+
+def fun_l17_n560(x)
+    if (x < 1)
+        fun_l18_n472(x)
+    else
+        fun_l18_n291(x)
+    end
+end
+
+def fun_l17_n561(x)
+    if (x < 1)
+        fun_l18_n870(x)
+    else
+        fun_l18_n395(x)
+    end
+end
+
+def fun_l17_n562(x)
+    if (x < 1)
+        fun_l18_n482(x)
+    else
+        fun_l18_n281(x)
+    end
+end
+
+def fun_l17_n563(x)
+    if (x < 1)
+        fun_l18_n761(x)
+    else
+        fun_l18_n362(x)
+    end
+end
+
+def fun_l17_n564(x)
+    if (x < 1)
+        fun_l18_n586(x)
+    else
+        fun_l18_n92(x)
+    end
+end
+
+def fun_l17_n565(x)
+    if (x < 1)
+        fun_l18_n620(x)
+    else
+        fun_l18_n356(x)
+    end
+end
+
+def fun_l17_n566(x)
+    if (x < 1)
+        fun_l18_n529(x)
+    else
+        fun_l18_n985(x)
+    end
+end
+
+def fun_l17_n567(x)
+    if (x < 1)
+        fun_l18_n351(x)
+    else
+        fun_l18_n77(x)
+    end
+end
+
+def fun_l17_n568(x)
+    if (x < 1)
+        fun_l18_n659(x)
+    else
+        fun_l18_n631(x)
+    end
+end
+
+def fun_l17_n569(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n466(x)
+    end
+end
+
+def fun_l17_n570(x)
+    if (x < 1)
+        fun_l18_n374(x)
+    else
+        fun_l18_n203(x)
+    end
+end
+
+def fun_l17_n571(x)
+    if (x < 1)
+        fun_l18_n479(x)
+    else
+        fun_l18_n977(x)
+    end
+end
+
+def fun_l17_n572(x)
+    if (x < 1)
+        fun_l18_n862(x)
+    else
+        fun_l18_n323(x)
+    end
+end
+
+def fun_l17_n573(x)
+    if (x < 1)
+        fun_l18_n148(x)
+    else
+        fun_l18_n848(x)
+    end
+end
+
+def fun_l17_n574(x)
+    if (x < 1)
+        fun_l18_n29(x)
+    else
+        fun_l18_n210(x)
+    end
+end
+
+def fun_l17_n575(x)
+    if (x < 1)
+        fun_l18_n39(x)
+    else
+        fun_l18_n874(x)
+    end
+end
+
+def fun_l17_n576(x)
+    if (x < 1)
+        fun_l18_n843(x)
+    else
+        fun_l18_n5(x)
+    end
+end
+
+def fun_l17_n577(x)
+    if (x < 1)
+        fun_l18_n284(x)
+    else
+        fun_l18_n242(x)
+    end
+end
+
+def fun_l17_n578(x)
+    if (x < 1)
+        fun_l18_n768(x)
+    else
+        fun_l18_n683(x)
+    end
+end
+
+def fun_l17_n579(x)
+    if (x < 1)
+        fun_l18_n67(x)
+    else
+        fun_l18_n423(x)
+    end
+end
+
+def fun_l17_n580(x)
+    if (x < 1)
+        fun_l18_n326(x)
+    else
+        fun_l18_n200(x)
+    end
+end
+
+def fun_l17_n581(x)
+    if (x < 1)
+        fun_l18_n186(x)
+    else
+        fun_l18_n772(x)
+    end
+end
+
+def fun_l17_n582(x)
+    if (x < 1)
+        fun_l18_n151(x)
+    else
+        fun_l18_n222(x)
+    end
+end
+
+def fun_l17_n583(x)
+    if (x < 1)
+        fun_l18_n690(x)
+    else
+        fun_l18_n925(x)
+    end
+end
+
+def fun_l17_n584(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n286(x)
+    end
+end
+
+def fun_l17_n585(x)
+    if (x < 1)
+        fun_l18_n542(x)
+    else
+        fun_l18_n703(x)
+    end
+end
+
+def fun_l17_n586(x)
+    if (x < 1)
+        fun_l18_n417(x)
+    else
+        fun_l18_n364(x)
+    end
+end
+
+def fun_l17_n587(x)
+    if (x < 1)
+        fun_l18_n540(x)
+    else
+        fun_l18_n231(x)
+    end
+end
+
+def fun_l17_n588(x)
+    if (x < 1)
+        fun_l18_n859(x)
+    else
+        fun_l18_n557(x)
+    end
+end
+
+def fun_l17_n589(x)
+    if (x < 1)
+        fun_l18_n131(x)
+    else
+        fun_l18_n847(x)
+    end
+end
+
+def fun_l17_n590(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n613(x)
+    end
+end
+
+def fun_l17_n591(x)
+    if (x < 1)
+        fun_l18_n273(x)
+    else
+        fun_l18_n857(x)
+    end
+end
+
+def fun_l17_n592(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n243(x)
+    end
+end
+
+def fun_l17_n593(x)
+    if (x < 1)
+        fun_l18_n742(x)
+    else
+        fun_l18_n123(x)
+    end
+end
+
+def fun_l17_n594(x)
+    if (x < 1)
+        fun_l18_n480(x)
+    else
+        fun_l18_n290(x)
+    end
+end
+
+def fun_l17_n595(x)
+    if (x < 1)
+        fun_l18_n56(x)
+    else
+        fun_l18_n727(x)
+    end
+end
+
+def fun_l17_n596(x)
+    if (x < 1)
+        fun_l18_n901(x)
+    else
+        fun_l18_n723(x)
+    end
+end
+
+def fun_l17_n597(x)
+    if (x < 1)
+        fun_l18_n405(x)
+    else
+        fun_l18_n498(x)
+    end
+end
+
+def fun_l17_n598(x)
+    if (x < 1)
+        fun_l18_n772(x)
+    else
+        fun_l18_n543(x)
+    end
+end
+
+def fun_l17_n599(x)
+    if (x < 1)
+        fun_l18_n20(x)
+    else
+        fun_l18_n39(x)
+    end
+end
+
+def fun_l17_n600(x)
+    if (x < 1)
+        fun_l18_n657(x)
+    else
+        fun_l18_n381(x)
+    end
+end
+
+def fun_l17_n601(x)
+    if (x < 1)
+        fun_l18_n505(x)
+    else
+        fun_l18_n196(x)
+    end
+end
+
+def fun_l17_n602(x)
+    if (x < 1)
+        fun_l18_n250(x)
+    else
+        fun_l18_n503(x)
+    end
+end
+
+def fun_l17_n603(x)
+    if (x < 1)
+        fun_l18_n694(x)
+    else
+        fun_l18_n589(x)
+    end
+end
+
+def fun_l17_n604(x)
+    if (x < 1)
+        fun_l18_n27(x)
+    else
+        fun_l18_n202(x)
+    end
+end
+
+def fun_l17_n605(x)
+    if (x < 1)
+        fun_l18_n901(x)
+    else
+        fun_l18_n823(x)
+    end
+end
+
+def fun_l17_n606(x)
+    if (x < 1)
+        fun_l18_n296(x)
+    else
+        fun_l18_n854(x)
+    end
+end
+
+def fun_l17_n607(x)
+    if (x < 1)
+        fun_l18_n226(x)
+    else
+        fun_l18_n110(x)
+    end
+end
+
+def fun_l17_n608(x)
+    if (x < 1)
+        fun_l18_n205(x)
+    else
+        fun_l18_n215(x)
+    end
+end
+
+def fun_l17_n609(x)
+    if (x < 1)
+        fun_l18_n265(x)
+    else
+        fun_l18_n715(x)
+    end
+end
+
+def fun_l17_n610(x)
+    if (x < 1)
+        fun_l18_n881(x)
+    else
+        fun_l18_n106(x)
+    end
+end
+
+def fun_l17_n611(x)
+    if (x < 1)
+        fun_l18_n674(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n612(x)
+    if (x < 1)
+        fun_l18_n20(x)
+    else
+        fun_l18_n96(x)
+    end
+end
+
+def fun_l17_n613(x)
+    if (x < 1)
+        fun_l18_n880(x)
+    else
+        fun_l18_n599(x)
+    end
+end
+
+def fun_l17_n614(x)
+    if (x < 1)
+        fun_l18_n47(x)
+    else
+        fun_l18_n633(x)
+    end
+end
+
+def fun_l17_n615(x)
+    if (x < 1)
+        fun_l18_n7(x)
+    else
+        fun_l18_n165(x)
+    end
+end
+
+def fun_l17_n616(x)
+    if (x < 1)
+        fun_l18_n478(x)
+    else
+        fun_l18_n94(x)
+    end
+end
+
+def fun_l17_n617(x)
+    if (x < 1)
+        fun_l18_n97(x)
+    else
+        fun_l18_n369(x)
+    end
+end
+
+def fun_l17_n618(x)
+    if (x < 1)
+        fun_l18_n291(x)
+    else
+        fun_l18_n637(x)
+    end
+end
+
+def fun_l17_n619(x)
+    if (x < 1)
+        fun_l18_n966(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n620(x)
+    if (x < 1)
+        fun_l18_n349(x)
+    else
+        fun_l18_n413(x)
+    end
+end
+
+def fun_l17_n621(x)
+    if (x < 1)
+        fun_l18_n343(x)
+    else
+        fun_l18_n224(x)
+    end
+end
+
+def fun_l17_n622(x)
+    if (x < 1)
+        fun_l18_n452(x)
+    else
+        fun_l18_n3(x)
+    end
+end
+
+def fun_l17_n623(x)
+    if (x < 1)
+        fun_l18_n539(x)
+    else
+        fun_l18_n542(x)
+    end
+end
+
+def fun_l17_n624(x)
+    if (x < 1)
+        fun_l18_n117(x)
+    else
+        fun_l18_n348(x)
+    end
+end
+
+def fun_l17_n625(x)
+    if (x < 1)
+        fun_l18_n753(x)
+    else
+        fun_l18_n284(x)
+    end
+end
+
+def fun_l17_n626(x)
+    if (x < 1)
+        fun_l18_n146(x)
+    else
+        fun_l18_n228(x)
+    end
+end
+
+def fun_l17_n627(x)
+    if (x < 1)
+        fun_l18_n286(x)
+    else
+        fun_l18_n413(x)
+    end
+end
+
+def fun_l17_n628(x)
+    if (x < 1)
+        fun_l18_n730(x)
+    else
+        fun_l18_n311(x)
+    end
+end
+
+def fun_l17_n629(x)
+    if (x < 1)
+        fun_l18_n455(x)
+    else
+        fun_l18_n141(x)
+    end
+end
+
+def fun_l17_n630(x)
+    if (x < 1)
+        fun_l18_n300(x)
+    else
+        fun_l18_n368(x)
+    end
+end
+
+def fun_l17_n631(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n711(x)
+    end
+end
+
+def fun_l17_n632(x)
+    if (x < 1)
+        fun_l18_n310(x)
+    else
+        fun_l18_n805(x)
+    end
+end
+
+def fun_l17_n633(x)
+    if (x < 1)
+        fun_l18_n2(x)
+    else
+        fun_l18_n709(x)
+    end
+end
+
+def fun_l17_n634(x)
+    if (x < 1)
+        fun_l18_n239(x)
+    else
+        fun_l18_n394(x)
+    end
+end
+
+def fun_l17_n635(x)
+    if (x < 1)
+        fun_l18_n933(x)
+    else
+        fun_l18_n749(x)
+    end
+end
+
+def fun_l17_n636(x)
+    if (x < 1)
+        fun_l18_n54(x)
+    else
+        fun_l18_n511(x)
+    end
+end
+
+def fun_l17_n637(x)
+    if (x < 1)
+        fun_l18_n908(x)
+    else
+        fun_l18_n550(x)
+    end
+end
+
+def fun_l17_n638(x)
+    if (x < 1)
+        fun_l18_n262(x)
+    else
+        fun_l18_n485(x)
+    end
+end
+
+def fun_l17_n639(x)
+    if (x < 1)
+        fun_l18_n676(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n640(x)
+    if (x < 1)
+        fun_l18_n205(x)
+    else
+        fun_l18_n901(x)
+    end
+end
+
+def fun_l17_n641(x)
+    if (x < 1)
+        fun_l18_n834(x)
+    else
+        fun_l18_n133(x)
+    end
+end
+
+def fun_l17_n642(x)
+    if (x < 1)
+        fun_l18_n824(x)
+    else
+        fun_l18_n551(x)
+    end
+end
+
+def fun_l17_n643(x)
+    if (x < 1)
+        fun_l18_n362(x)
+    else
+        fun_l18_n684(x)
+    end
+end
+
+def fun_l17_n644(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n103(x)
+    end
+end
+
+def fun_l17_n645(x)
+    if (x < 1)
+        fun_l18_n999(x)
+    else
+        fun_l18_n995(x)
+    end
+end
+
+def fun_l17_n646(x)
+    if (x < 1)
+        fun_l18_n24(x)
+    else
+        fun_l18_n405(x)
+    end
+end
+
+def fun_l17_n647(x)
+    if (x < 1)
+        fun_l18_n71(x)
+    else
+        fun_l18_n201(x)
+    end
+end
+
+def fun_l17_n648(x)
+    if (x < 1)
+        fun_l18_n905(x)
+    else
+        fun_l18_n14(x)
+    end
+end
+
+def fun_l17_n649(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n932(x)
+    end
+end
+
+def fun_l17_n650(x)
+    if (x < 1)
+        fun_l18_n25(x)
+    else
+        fun_l18_n333(x)
+    end
+end
+
+def fun_l17_n651(x)
+    if (x < 1)
+        fun_l18_n282(x)
+    else
+        fun_l18_n197(x)
+    end
+end
+
+def fun_l17_n652(x)
+    if (x < 1)
+        fun_l18_n684(x)
+    else
+        fun_l18_n618(x)
+    end
+end
+
+def fun_l17_n653(x)
+    if (x < 1)
+        fun_l18_n201(x)
+    else
+        fun_l18_n571(x)
+    end
+end
+
+def fun_l17_n654(x)
+    if (x < 1)
+        fun_l18_n26(x)
+    else
+        fun_l18_n813(x)
+    end
+end
+
+def fun_l17_n655(x)
+    if (x < 1)
+        fun_l18_n879(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n656(x)
+    if (x < 1)
+        fun_l18_n193(x)
+    else
+        fun_l18_n635(x)
+    end
+end
+
+def fun_l17_n657(x)
+    if (x < 1)
+        fun_l18_n163(x)
+    else
+        fun_l18_n601(x)
+    end
+end
+
+def fun_l17_n658(x)
+    if (x < 1)
+        fun_l18_n794(x)
+    else
+        fun_l18_n582(x)
+    end
+end
+
+def fun_l17_n659(x)
+    if (x < 1)
+        fun_l18_n22(x)
+    else
+        fun_l18_n427(x)
+    end
+end
+
+def fun_l17_n660(x)
+    if (x < 1)
+        fun_l18_n959(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n661(x)
+    if (x < 1)
+        fun_l18_n233(x)
+    else
+        fun_l18_n852(x)
+    end
+end
+
+def fun_l17_n662(x)
+    if (x < 1)
+        fun_l18_n367(x)
+    else
+        fun_l18_n119(x)
+    end
+end
+
+def fun_l17_n663(x)
+    if (x < 1)
+        fun_l18_n511(x)
+    else
+        fun_l18_n425(x)
+    end
+end
+
+def fun_l17_n664(x)
+    if (x < 1)
+        fun_l18_n256(x)
+    else
+        fun_l18_n294(x)
+    end
+end
+
+def fun_l17_n665(x)
+    if (x < 1)
+        fun_l18_n263(x)
+    else
+        fun_l18_n549(x)
+    end
+end
+
+def fun_l17_n666(x)
+    if (x < 1)
+        fun_l18_n868(x)
+    else
+        fun_l18_n221(x)
+    end
+end
+
+def fun_l17_n667(x)
+    if (x < 1)
+        fun_l18_n703(x)
+    else
+        fun_l18_n157(x)
+    end
+end
+
+def fun_l17_n668(x)
+    if (x < 1)
+        fun_l18_n639(x)
+    else
+        fun_l18_n685(x)
+    end
+end
+
+def fun_l17_n669(x)
+    if (x < 1)
+        fun_l18_n278(x)
+    else
+        fun_l18_n366(x)
+    end
+end
+
+def fun_l17_n670(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n641(x)
+    end
+end
+
+def fun_l17_n671(x)
+    if (x < 1)
+        fun_l18_n452(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n672(x)
+    if (x < 1)
+        fun_l18_n256(x)
+    else
+        fun_l18_n282(x)
+    end
+end
+
+def fun_l17_n673(x)
+    if (x < 1)
+        fun_l18_n397(x)
+    else
+        fun_l18_n446(x)
+    end
+end
+
+def fun_l17_n674(x)
+    if (x < 1)
+        fun_l18_n499(x)
+    else
+        fun_l18_n166(x)
+    end
+end
+
+def fun_l17_n675(x)
+    if (x < 1)
+        fun_l18_n299(x)
+    else
+        fun_l18_n473(x)
+    end
+end
+
+def fun_l17_n676(x)
+    if (x < 1)
+        fun_l18_n331(x)
+    else
+        fun_l18_n590(x)
+    end
+end
+
+def fun_l17_n677(x)
+    if (x < 1)
+        fun_l18_n951(x)
+    else
+        fun_l18_n227(x)
+    end
+end
+
+def fun_l17_n678(x)
+    if (x < 1)
+        fun_l18_n874(x)
+    else
+        fun_l18_n359(x)
+    end
+end
+
+def fun_l17_n679(x)
+    if (x < 1)
+        fun_l18_n187(x)
+    else
+        fun_l18_n13(x)
+    end
+end
+
+def fun_l17_n680(x)
+    if (x < 1)
+        fun_l18_n878(x)
+    else
+        fun_l18_n902(x)
+    end
+end
+
+def fun_l17_n681(x)
+    if (x < 1)
+        fun_l18_n450(x)
+    else
+        fun_l18_n262(x)
+    end
+end
+
+def fun_l17_n682(x)
+    if (x < 1)
+        fun_l18_n759(x)
+    else
+        fun_l18_n253(x)
+    end
+end
+
+def fun_l17_n683(x)
+    if (x < 1)
+        fun_l18_n199(x)
+    else
+        fun_l18_n191(x)
+    end
+end
+
+def fun_l17_n684(x)
+    if (x < 1)
+        fun_l18_n93(x)
+    else
+        fun_l18_n275(x)
+    end
+end
+
+def fun_l17_n685(x)
+    if (x < 1)
+        fun_l18_n17(x)
+    else
+        fun_l18_n575(x)
+    end
+end
+
+def fun_l17_n686(x)
+    if (x < 1)
+        fun_l18_n971(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n687(x)
+    if (x < 1)
+        fun_l18_n942(x)
+    else
+        fun_l18_n285(x)
+    end
+end
+
+def fun_l17_n688(x)
+    if (x < 1)
+        fun_l18_n348(x)
+    else
+        fun_l18_n7(x)
+    end
+end
+
+def fun_l17_n689(x)
+    if (x < 1)
+        fun_l18_n839(x)
+    else
+        fun_l18_n532(x)
+    end
+end
+
+def fun_l17_n690(x)
+    if (x < 1)
+        fun_l18_n578(x)
+    else
+        fun_l18_n751(x)
+    end
+end
+
+def fun_l17_n691(x)
+    if (x < 1)
+        fun_l18_n85(x)
+    else
+        fun_l18_n311(x)
+    end
+end
+
+def fun_l17_n692(x)
+    if (x < 1)
+        fun_l18_n573(x)
+    else
+        fun_l18_n685(x)
+    end
+end
+
+def fun_l17_n693(x)
+    if (x < 1)
+        fun_l18_n449(x)
+    else
+        fun_l18_n749(x)
+    end
+end
+
+def fun_l17_n694(x)
+    if (x < 1)
+        fun_l18_n251(x)
+    else
+        fun_l18_n266(x)
+    end
+end
+
+def fun_l17_n695(x)
+    if (x < 1)
+        fun_l18_n69(x)
+    else
+        fun_l18_n725(x)
+    end
+end
+
+def fun_l17_n696(x)
+    if (x < 1)
+        fun_l18_n54(x)
+    else
+        fun_l18_n196(x)
+    end
+end
+
+def fun_l17_n697(x)
+    if (x < 1)
+        fun_l18_n950(x)
+    else
+        fun_l18_n423(x)
+    end
+end
+
+def fun_l17_n698(x)
+    if (x < 1)
+        fun_l18_n809(x)
+    else
+        fun_l18_n787(x)
+    end
+end
+
+def fun_l17_n699(x)
+    if (x < 1)
+        fun_l18_n211(x)
+    else
+        fun_l18_n79(x)
+    end
+end
+
+def fun_l17_n700(x)
+    if (x < 1)
+        fun_l18_n686(x)
+    else
+        fun_l18_n287(x)
+    end
+end
+
+def fun_l17_n701(x)
+    if (x < 1)
+        fun_l18_n412(x)
+    else
+        fun_l18_n769(x)
+    end
+end
+
+def fun_l17_n702(x)
+    if (x < 1)
+        fun_l18_n62(x)
+    else
+        fun_l18_n592(x)
+    end
+end
+
+def fun_l17_n703(x)
+    if (x < 1)
+        fun_l18_n628(x)
+    else
+        fun_l18_n121(x)
+    end
+end
+
+def fun_l17_n704(x)
+    if (x < 1)
+        fun_l18_n84(x)
+    else
+        fun_l18_n350(x)
+    end
+end
+
+def fun_l17_n705(x)
+    if (x < 1)
+        fun_l18_n599(x)
+    else
+        fun_l18_n174(x)
+    end
+end
+
+def fun_l17_n706(x)
+    if (x < 1)
+        fun_l18_n39(x)
+    else
+        fun_l18_n266(x)
+    end
+end
+
+def fun_l17_n707(x)
+    if (x < 1)
+        fun_l18_n196(x)
+    else
+        fun_l18_n838(x)
+    end
+end
+
+def fun_l17_n708(x)
+    if (x < 1)
+        fun_l18_n647(x)
+    else
+        fun_l18_n26(x)
+    end
+end
+
+def fun_l17_n709(x)
+    if (x < 1)
+        fun_l18_n693(x)
+    else
+        fun_l18_n660(x)
+    end
+end
+
+def fun_l17_n710(x)
+    if (x < 1)
+        fun_l18_n530(x)
+    else
+        fun_l18_n654(x)
+    end
+end
+
+def fun_l17_n711(x)
+    if (x < 1)
+        fun_l18_n580(x)
+    else
+        fun_l18_n65(x)
+    end
+end
+
+def fun_l17_n712(x)
+    if (x < 1)
+        fun_l18_n789(x)
+    else
+        fun_l18_n832(x)
+    end
+end
+
+def fun_l17_n713(x)
+    if (x < 1)
+        fun_l18_n366(x)
+    else
+        fun_l18_n168(x)
+    end
+end
+
+def fun_l17_n714(x)
+    if (x < 1)
+        fun_l18_n571(x)
+    else
+        fun_l18_n23(x)
+    end
+end
+
+def fun_l17_n715(x)
+    if (x < 1)
+        fun_l18_n552(x)
+    else
+        fun_l18_n400(x)
+    end
+end
+
+def fun_l17_n716(x)
+    if (x < 1)
+        fun_l18_n752(x)
+    else
+        fun_l18_n403(x)
+    end
+end
+
+def fun_l17_n717(x)
+    if (x < 1)
+        fun_l18_n498(x)
+    else
+        fun_l18_n173(x)
+    end
+end
+
+def fun_l17_n718(x)
+    if (x < 1)
+        fun_l18_n168(x)
+    else
+        fun_l18_n656(x)
+    end
+end
+
+def fun_l17_n719(x)
+    if (x < 1)
+        fun_l18_n75(x)
+    else
+        fun_l18_n393(x)
+    end
+end
+
+def fun_l17_n720(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n101(x)
+    end
+end
+
+def fun_l17_n721(x)
+    if (x < 1)
+        fun_l18_n445(x)
+    else
+        fun_l18_n846(x)
+    end
+end
+
+def fun_l17_n722(x)
+    if (x < 1)
+        fun_l18_n450(x)
+    else
+        fun_l18_n136(x)
+    end
+end
+
+def fun_l17_n723(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n800(x)
+    end
+end
+
+def fun_l17_n724(x)
+    if (x < 1)
+        fun_l18_n98(x)
+    else
+        fun_l18_n955(x)
+    end
+end
+
+def fun_l17_n725(x)
+    if (x < 1)
+        fun_l18_n951(x)
+    else
+        fun_l18_n319(x)
+    end
+end
+
+def fun_l17_n726(x)
+    if (x < 1)
+        fun_l18_n531(x)
+    else
+        fun_l18_n846(x)
+    end
+end
+
+def fun_l17_n727(x)
+    if (x < 1)
+        fun_l18_n888(x)
+    else
+        fun_l18_n600(x)
+    end
+end
+
+def fun_l17_n728(x)
+    if (x < 1)
+        fun_l18_n278(x)
+    else
+        fun_l18_n445(x)
+    end
+end
+
+def fun_l17_n729(x)
+    if (x < 1)
+        fun_l18_n113(x)
+    else
+        fun_l18_n991(x)
+    end
+end
+
+def fun_l17_n730(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n935(x)
+    end
+end
+
+def fun_l17_n731(x)
+    if (x < 1)
+        fun_l18_n2(x)
+    else
+        fun_l18_n969(x)
+    end
+end
+
+def fun_l17_n732(x)
+    if (x < 1)
+        fun_l18_n138(x)
+    else
+        fun_l18_n198(x)
+    end
+end
+
+def fun_l17_n733(x)
+    if (x < 1)
+        fun_l18_n845(x)
+    else
+        fun_l18_n614(x)
+    end
+end
+
+def fun_l17_n734(x)
+    if (x < 1)
+        fun_l18_n603(x)
+    else
+        fun_l18_n568(x)
+    end
+end
+
+def fun_l17_n735(x)
+    if (x < 1)
+        fun_l18_n276(x)
+    else
+        fun_l18_n58(x)
+    end
+end
+
+def fun_l17_n736(x)
+    if (x < 1)
+        fun_l18_n404(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n737(x)
+    if (x < 1)
+        fun_l18_n199(x)
+    else
+        fun_l18_n734(x)
+    end
+end
+
+def fun_l17_n738(x)
+    if (x < 1)
+        fun_l18_n327(x)
+    else
+        fun_l18_n667(x)
+    end
+end
+
+def fun_l17_n739(x)
+    if (x < 1)
+        fun_l18_n600(x)
+    else
+        fun_l18_n986(x)
+    end
+end
+
+def fun_l17_n740(x)
+    if (x < 1)
+        fun_l18_n820(x)
+    else
+        fun_l18_n615(x)
+    end
+end
+
+def fun_l17_n741(x)
+    if (x < 1)
+        fun_l18_n779(x)
+    else
+        fun_l18_n912(x)
+    end
+end
+
+def fun_l17_n742(x)
+    if (x < 1)
+        fun_l18_n55(x)
+    else
+        fun_l18_n41(x)
+    end
+end
+
+def fun_l17_n743(x)
+    if (x < 1)
+        fun_l18_n24(x)
+    else
+        fun_l18_n877(x)
+    end
+end
+
+def fun_l17_n744(x)
+    if (x < 1)
+        fun_l18_n834(x)
+    else
+        fun_l18_n10(x)
+    end
+end
+
+def fun_l17_n745(x)
+    if (x < 1)
+        fun_l18_n369(x)
+    else
+        fun_l18_n761(x)
+    end
+end
+
+def fun_l17_n746(x)
+    if (x < 1)
+        fun_l18_n534(x)
+    else
+        fun_l18_n292(x)
+    end
+end
+
+def fun_l17_n747(x)
+    if (x < 1)
+        fun_l18_n260(x)
+    else
+        fun_l18_n98(x)
+    end
+end
+
+def fun_l17_n748(x)
+    if (x < 1)
+        fun_l18_n738(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n749(x)
+    if (x < 1)
+        fun_l18_n156(x)
+    else
+        fun_l18_n322(x)
+    end
+end
+
+def fun_l17_n750(x)
+    if (x < 1)
+        fun_l18_n519(x)
+    else
+        fun_l18_n566(x)
+    end
+end
+
+def fun_l17_n751(x)
+    if (x < 1)
+        fun_l18_n599(x)
+    else
+        fun_l18_n525(x)
+    end
+end
+
+def fun_l17_n752(x)
+    if (x < 1)
+        fun_l18_n51(x)
+    else
+        fun_l18_n334(x)
+    end
+end
+
+def fun_l17_n753(x)
+    if (x < 1)
+        fun_l18_n593(x)
+    else
+        fun_l18_n799(x)
+    end
+end
+
+def fun_l17_n754(x)
+    if (x < 1)
+        fun_l18_n599(x)
+    else
+        fun_l18_n167(x)
+    end
+end
+
+def fun_l17_n755(x)
+    if (x < 1)
+        fun_l18_n799(x)
+    else
+        fun_l18_n909(x)
+    end
+end
+
+def fun_l17_n756(x)
+    if (x < 1)
+        fun_l18_n988(x)
+    else
+        fun_l18_n793(x)
+    end
+end
+
+def fun_l17_n757(x)
+    if (x < 1)
+        fun_l18_n144(x)
+    else
+        fun_l18_n279(x)
+    end
+end
+
+def fun_l17_n758(x)
+    if (x < 1)
+        fun_l18_n981(x)
+    else
+        fun_l18_n603(x)
+    end
+end
+
+def fun_l17_n759(x)
+    if (x < 1)
+        fun_l18_n576(x)
+    else
+        fun_l18_n730(x)
+    end
+end
+
+def fun_l17_n760(x)
+    if (x < 1)
+        fun_l18_n66(x)
+    else
+        fun_l18_n359(x)
+    end
+end
+
+def fun_l17_n761(x)
+    if (x < 1)
+        fun_l18_n555(x)
+    else
+        fun_l18_n553(x)
+    end
+end
+
+def fun_l17_n762(x)
+    if (x < 1)
+        fun_l18_n508(x)
+    else
+        fun_l18_n665(x)
+    end
+end
+
+def fun_l17_n763(x)
+    if (x < 1)
+        fun_l18_n911(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n764(x)
+    if (x < 1)
+        fun_l18_n162(x)
+    else
+        fun_l18_n707(x)
+    end
+end
+
+def fun_l17_n765(x)
+    if (x < 1)
+        fun_l18_n262(x)
+    else
+        fun_l18_n494(x)
+    end
+end
+
+def fun_l17_n766(x)
+    if (x < 1)
+        fun_l18_n220(x)
+    else
+        fun_l18_n144(x)
+    end
+end
+
+def fun_l17_n767(x)
+    if (x < 1)
+        fun_l18_n245(x)
+    else
+        fun_l18_n727(x)
+    end
+end
+
+def fun_l17_n768(x)
+    if (x < 1)
+        fun_l18_n875(x)
+    else
+        fun_l18_n610(x)
+    end
+end
+
+def fun_l17_n769(x)
+    if (x < 1)
+        fun_l18_n338(x)
+    else
+        fun_l18_n344(x)
+    end
+end
+
+def fun_l17_n770(x)
+    if (x < 1)
+        fun_l18_n224(x)
+    else
+        fun_l18_n682(x)
+    end
+end
+
+def fun_l17_n771(x)
+    if (x < 1)
+        fun_l18_n353(x)
+    else
+        fun_l18_n102(x)
+    end
+end
+
+def fun_l17_n772(x)
+    if (x < 1)
+        fun_l18_n122(x)
+    else
+        fun_l18_n979(x)
+    end
+end
+
+def fun_l17_n773(x)
+    if (x < 1)
+        fun_l18_n549(x)
+    else
+        fun_l18_n296(x)
+    end
+end
+
+def fun_l17_n774(x)
+    if (x < 1)
+        fun_l18_n82(x)
+    else
+        fun_l18_n748(x)
+    end
+end
+
+def fun_l17_n775(x)
+    if (x < 1)
+        fun_l18_n958(x)
+    else
+        fun_l18_n917(x)
+    end
+end
+
+def fun_l17_n776(x)
+    if (x < 1)
+        fun_l18_n173(x)
+    else
+        fun_l18_n438(x)
+    end
+end
+
+def fun_l17_n777(x)
+    if (x < 1)
+        fun_l18_n222(x)
+    else
+        fun_l18_n55(x)
+    end
+end
+
+def fun_l17_n778(x)
+    if (x < 1)
+        fun_l18_n529(x)
+    else
+        fun_l18_n548(x)
+    end
+end
+
+def fun_l17_n779(x)
+    if (x < 1)
+        fun_l18_n28(x)
+    else
+        fun_l18_n582(x)
+    end
+end
+
+def fun_l17_n780(x)
+    if (x < 1)
+        fun_l18_n818(x)
+    else
+        fun_l18_n836(x)
+    end
+end
+
+def fun_l17_n781(x)
+    if (x < 1)
+        fun_l18_n972(x)
+    else
+        fun_l18_n73(x)
+    end
+end
+
+def fun_l17_n782(x)
+    if (x < 1)
+        fun_l18_n527(x)
+    else
+        fun_l18_n999(x)
+    end
+end
+
+def fun_l17_n783(x)
+    if (x < 1)
+        fun_l18_n832(x)
+    else
+        fun_l18_n833(x)
+    end
+end
+
+def fun_l17_n784(x)
+    if (x < 1)
+        fun_l18_n987(x)
+    else
+        fun_l18_n329(x)
+    end
+end
+
+def fun_l17_n785(x)
+    if (x < 1)
+        fun_l18_n715(x)
+    else
+        fun_l18_n441(x)
+    end
+end
+
+def fun_l17_n786(x)
+    if (x < 1)
+        fun_l18_n55(x)
+    else
+        fun_l18_n682(x)
+    end
+end
+
+def fun_l17_n787(x)
+    if (x < 1)
+        fun_l18_n606(x)
+    else
+        fun_l18_n656(x)
+    end
+end
+
+def fun_l17_n788(x)
+    if (x < 1)
+        fun_l18_n254(x)
+    else
+        fun_l18_n544(x)
+    end
+end
+
+def fun_l17_n789(x)
+    if (x < 1)
+        fun_l18_n285(x)
+    else
+        fun_l18_n585(x)
+    end
+end
+
+def fun_l17_n790(x)
+    if (x < 1)
+        fun_l18_n441(x)
+    else
+        fun_l18_n716(x)
+    end
+end
+
+def fun_l17_n791(x)
+    if (x < 1)
+        fun_l18_n415(x)
+    else
+        fun_l18_n126(x)
+    end
+end
+
+def fun_l17_n792(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n753(x)
+    end
+end
+
+def fun_l17_n793(x)
+    if (x < 1)
+        fun_l18_n324(x)
+    else
+        fun_l18_n223(x)
+    end
+end
+
+def fun_l17_n794(x)
+    if (x < 1)
+        fun_l18_n913(x)
+    else
+        fun_l18_n94(x)
+    end
+end
+
+def fun_l17_n795(x)
+    if (x < 1)
+        fun_l18_n879(x)
+    else
+        fun_l18_n404(x)
+    end
+end
+
+def fun_l17_n796(x)
+    if (x < 1)
+        fun_l18_n309(x)
+    else
+        fun_l18_n65(x)
+    end
+end
+
+def fun_l17_n797(x)
+    if (x < 1)
+        fun_l18_n712(x)
+    else
+        fun_l18_n947(x)
+    end
+end
+
+def fun_l17_n798(x)
+    if (x < 1)
+        fun_l18_n238(x)
+    else
+        fun_l18_n83(x)
+    end
+end
+
+def fun_l17_n799(x)
+    if (x < 1)
+        fun_l18_n25(x)
+    else
+        fun_l18_n371(x)
+    end
+end
+
+def fun_l17_n800(x)
+    if (x < 1)
+        fun_l18_n501(x)
+    else
+        fun_l18_n386(x)
+    end
+end
+
+def fun_l17_n801(x)
+    if (x < 1)
+        fun_l18_n453(x)
+    else
+        fun_l18_n168(x)
+    end
+end
+
+def fun_l17_n802(x)
+    if (x < 1)
+        fun_l18_n763(x)
+    else
+        fun_l18_n675(x)
+    end
+end
+
+def fun_l17_n803(x)
+    if (x < 1)
+        fun_l18_n984(x)
+    else
+        fun_l18_n882(x)
+    end
+end
+
+def fun_l17_n804(x)
+    if (x < 1)
+        fun_l18_n545(x)
+    else
+        fun_l18_n79(x)
+    end
+end
+
+def fun_l17_n805(x)
+    if (x < 1)
+        fun_l18_n263(x)
+    else
+        fun_l18_n143(x)
+    end
+end
+
+def fun_l17_n806(x)
+    if (x < 1)
+        fun_l18_n232(x)
+    else
+        fun_l18_n864(x)
+    end
+end
+
+def fun_l17_n807(x)
+    if (x < 1)
+        fun_l18_n6(x)
+    else
+        fun_l18_n983(x)
+    end
+end
+
+def fun_l17_n808(x)
+    if (x < 1)
+        fun_l18_n17(x)
+    else
+        fun_l18_n426(x)
+    end
+end
+
+def fun_l17_n809(x)
+    if (x < 1)
+        fun_l18_n1(x)
+    else
+        fun_l18_n669(x)
+    end
+end
+
+def fun_l17_n810(x)
+    if (x < 1)
+        fun_l18_n191(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n811(x)
+    if (x < 1)
+        fun_l18_n16(x)
+    else
+        fun_l18_n871(x)
+    end
+end
+
+def fun_l17_n812(x)
+    if (x < 1)
+        fun_l18_n352(x)
+    else
+        fun_l18_n156(x)
+    end
+end
+
+def fun_l17_n813(x)
+    if (x < 1)
+        fun_l18_n239(x)
+    else
+        fun_l18_n314(x)
+    end
+end
+
+def fun_l17_n814(x)
+    if (x < 1)
+        fun_l18_n890(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n815(x)
+    if (x < 1)
+        fun_l18_n894(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n816(x)
+    if (x < 1)
+        fun_l18_n75(x)
+    else
+        fun_l18_n631(x)
+    end
+end
+
+def fun_l17_n817(x)
+    if (x < 1)
+        fun_l18_n118(x)
+    else
+        fun_l18_n857(x)
+    end
+end
+
+def fun_l17_n818(x)
+    if (x < 1)
+        fun_l18_n403(x)
+    else
+        fun_l18_n364(x)
+    end
+end
+
+def fun_l17_n819(x)
+    if (x < 1)
+        fun_l18_n15(x)
+    else
+        fun_l18_n232(x)
+    end
+end
+
+def fun_l17_n820(x)
+    if (x < 1)
+        fun_l18_n610(x)
+    else
+        fun_l18_n43(x)
+    end
+end
+
+def fun_l17_n821(x)
+    if (x < 1)
+        fun_l18_n949(x)
+    else
+        fun_l18_n884(x)
+    end
+end
+
+def fun_l17_n822(x)
+    if (x < 1)
+        fun_l18_n387(x)
+    else
+        fun_l18_n587(x)
+    end
+end
+
+def fun_l17_n823(x)
+    if (x < 1)
+        fun_l18_n99(x)
+    else
+        fun_l18_n653(x)
+    end
+end
+
+def fun_l17_n824(x)
+    if (x < 1)
+        fun_l18_n41(x)
+    else
+        fun_l18_n822(x)
+    end
+end
+
+def fun_l17_n825(x)
+    if (x < 1)
+        fun_l18_n325(x)
+    else
+        fun_l18_n735(x)
+    end
+end
+
+def fun_l17_n826(x)
+    if (x < 1)
+        fun_l18_n415(x)
+    else
+        fun_l18_n684(x)
+    end
+end
+
+def fun_l17_n827(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n257(x)
+    end
+end
+
+def fun_l17_n828(x)
+    if (x < 1)
+        fun_l18_n455(x)
+    else
+        fun_l18_n200(x)
+    end
+end
+
+def fun_l17_n829(x)
+    if (x < 1)
+        fun_l18_n486(x)
+    else
+        fun_l18_n528(x)
+    end
+end
+
+def fun_l17_n830(x)
+    if (x < 1)
+        fun_l18_n321(x)
+    else
+        fun_l18_n619(x)
+    end
+end
+
+def fun_l17_n831(x)
+    if (x < 1)
+        fun_l18_n910(x)
+    else
+        fun_l18_n796(x)
+    end
+end
+
+def fun_l17_n832(x)
+    if (x < 1)
+        fun_l18_n303(x)
+    else
+        fun_l18_n278(x)
+    end
+end
+
+def fun_l17_n833(x)
+    if (x < 1)
+        fun_l18_n477(x)
+    else
+        fun_l18_n733(x)
+    end
+end
+
+def fun_l17_n834(x)
+    if (x < 1)
+        fun_l18_n320(x)
+    else
+        fun_l18_n801(x)
+    end
+end
+
+def fun_l17_n835(x)
+    if (x < 1)
+        fun_l18_n672(x)
+    else
+        fun_l18_n183(x)
+    end
+end
+
+def fun_l17_n836(x)
+    if (x < 1)
+        fun_l18_n810(x)
+    else
+        fun_l18_n923(x)
+    end
+end
+
+def fun_l17_n837(x)
+    if (x < 1)
+        fun_l18_n775(x)
+    else
+        fun_l18_n884(x)
+    end
+end
+
+def fun_l17_n838(x)
+    if (x < 1)
+        fun_l18_n9(x)
+    else
+        fun_l18_n690(x)
+    end
+end
+
+def fun_l17_n839(x)
+    if (x < 1)
+        fun_l18_n843(x)
+    else
+        fun_l18_n482(x)
+    end
+end
+
+def fun_l17_n840(x)
+    if (x < 1)
+        fun_l18_n527(x)
+    else
+        fun_l18_n331(x)
+    end
+end
+
+def fun_l17_n841(x)
+    if (x < 1)
+        fun_l18_n210(x)
+    else
+        fun_l18_n119(x)
+    end
+end
+
+def fun_l17_n842(x)
+    if (x < 1)
+        fun_l18_n365(x)
+    else
+        fun_l18_n752(x)
+    end
+end
+
+def fun_l17_n843(x)
+    if (x < 1)
+        fun_l18_n855(x)
+    else
+        fun_l18_n149(x)
+    end
+end
+
+def fun_l17_n844(x)
+    if (x < 1)
+        fun_l18_n822(x)
+    else
+        fun_l18_n852(x)
+    end
+end
+
+def fun_l17_n845(x)
+    if (x < 1)
+        fun_l18_n182(x)
+    else
+        fun_l18_n145(x)
+    end
+end
+
+def fun_l17_n846(x)
+    if (x < 1)
+        fun_l18_n167(x)
+    else
+        fun_l18_n47(x)
+    end
+end
+
+def fun_l17_n847(x)
+    if (x < 1)
+        fun_l18_n350(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n848(x)
+    if (x < 1)
+        fun_l18_n264(x)
+    else
+        fun_l18_n739(x)
+    end
+end
+
+def fun_l17_n849(x)
+    if (x < 1)
+        fun_l18_n475(x)
+    else
+        fun_l18_n974(x)
+    end
+end
+
+def fun_l17_n850(x)
+    if (x < 1)
+        fun_l18_n849(x)
+    else
+        fun_l18_n68(x)
+    end
+end
+
+def fun_l17_n851(x)
+    if (x < 1)
+        fun_l18_n160(x)
+    else
+        fun_l18_n173(x)
+    end
+end
+
+def fun_l17_n852(x)
+    if (x < 1)
+        fun_l18_n353(x)
+    else
+        fun_l18_n931(x)
+    end
+end
+
+def fun_l17_n853(x)
+    if (x < 1)
+        fun_l18_n706(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n854(x)
+    if (x < 1)
+        fun_l18_n559(x)
+    else
+        fun_l18_n149(x)
+    end
+end
+
+def fun_l17_n855(x)
+    if (x < 1)
+        fun_l18_n347(x)
+    else
+        fun_l18_n559(x)
+    end
+end
+
+def fun_l17_n856(x)
+    if (x < 1)
+        fun_l18_n640(x)
+    else
+        fun_l18_n529(x)
+    end
+end
+
+def fun_l17_n857(x)
+    if (x < 1)
+        fun_l18_n410(x)
+    else
+        fun_l18_n278(x)
+    end
+end
+
+def fun_l17_n858(x)
+    if (x < 1)
+        fun_l18_n15(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n859(x)
+    if (x < 1)
+        fun_l18_n180(x)
+    else
+        fun_l18_n530(x)
+    end
+end
+
+def fun_l17_n860(x)
+    if (x < 1)
+        fun_l18_n739(x)
+    else
+        fun_l18_n817(x)
+    end
+end
+
+def fun_l17_n861(x)
+    if (x < 1)
+        fun_l18_n341(x)
+    else
+        fun_l18_n962(x)
+    end
+end
+
+def fun_l17_n862(x)
+    if (x < 1)
+        fun_l18_n994(x)
+    else
+        fun_l18_n338(x)
+    end
+end
+
+def fun_l17_n863(x)
+    if (x < 1)
+        fun_l18_n428(x)
+    else
+        fun_l18_n608(x)
+    end
+end
+
+def fun_l17_n864(x)
+    if (x < 1)
+        fun_l18_n889(x)
+    else
+        fun_l18_n974(x)
+    end
+end
+
+def fun_l17_n865(x)
+    if (x < 1)
+        fun_l18_n300(x)
+    else
+        fun_l18_n164(x)
+    end
+end
+
+def fun_l17_n866(x)
+    if (x < 1)
+        fun_l18_n195(x)
+    else
+        fun_l18_n75(x)
+    end
+end
+
+def fun_l17_n867(x)
+    if (x < 1)
+        fun_l18_n725(x)
+    else
+        fun_l18_n639(x)
+    end
+end
+
+def fun_l17_n868(x)
+    if (x < 1)
+        fun_l18_n793(x)
+    else
+        fun_l18_n925(x)
+    end
+end
+
+def fun_l17_n869(x)
+    if (x < 1)
+        fun_l18_n845(x)
+    else
+        fun_l18_n174(x)
+    end
+end
+
+def fun_l17_n870(x)
+    if (x < 1)
+        fun_l18_n202(x)
+    else
+        fun_l18_n376(x)
+    end
+end
+
+def fun_l17_n871(x)
+    if (x < 1)
+        fun_l18_n503(x)
+    else
+        fun_l18_n441(x)
+    end
+end
+
+def fun_l17_n872(x)
+    if (x < 1)
+        fun_l18_n675(x)
+    else
+        fun_l18_n180(x)
+    end
+end
+
+def fun_l17_n873(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n286(x)
+    end
+end
+
+def fun_l17_n874(x)
+    if (x < 1)
+        fun_l18_n918(x)
+    else
+        fun_l18_n438(x)
+    end
+end
+
+def fun_l17_n875(x)
+    if (x < 1)
+        fun_l18_n269(x)
+    else
+        fun_l18_n539(x)
+    end
+end
+
+def fun_l17_n876(x)
+    if (x < 1)
+        fun_l18_n417(x)
+    else
+        fun_l18_n68(x)
+    end
+end
+
+def fun_l17_n877(x)
+    if (x < 1)
+        fun_l18_n382(x)
+    else
+        fun_l18_n392(x)
+    end
+end
+
+def fun_l17_n878(x)
+    if (x < 1)
+        fun_l18_n981(x)
+    else
+        fun_l18_n997(x)
+    end
+end
+
+def fun_l17_n879(x)
+    if (x < 1)
+        fun_l18_n8(x)
+    else
+        fun_l18_n255(x)
+    end
+end
+
+def fun_l17_n880(x)
+    if (x < 1)
+        fun_l18_n634(x)
+    else
+        fun_l18_n971(x)
+    end
+end
+
+def fun_l17_n881(x)
+    if (x < 1)
+        fun_l18_n940(x)
+    else
+        fun_l18_n410(x)
+    end
+end
+
+def fun_l17_n882(x)
+    if (x < 1)
+        fun_l18_n550(x)
+    else
+        fun_l18_n959(x)
+    end
+end
+
+def fun_l17_n883(x)
+    if (x < 1)
+        fun_l18_n258(x)
+    else
+        fun_l18_n766(x)
+    end
+end
+
+def fun_l17_n884(x)
+    if (x < 1)
+        fun_l18_n841(x)
+    else
+        fun_l18_n387(x)
+    end
+end
+
+def fun_l17_n885(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n128(x)
+    end
+end
+
+def fun_l17_n886(x)
+    if (x < 1)
+        fun_l18_n872(x)
+    else
+        fun_l18_n471(x)
+    end
+end
+
+def fun_l17_n887(x)
+    if (x < 1)
+        fun_l18_n596(x)
+    else
+        fun_l18_n639(x)
+    end
+end
+
+def fun_l17_n888(x)
+    if (x < 1)
+        fun_l18_n665(x)
+    else
+        fun_l18_n999(x)
+    end
+end
+
+def fun_l17_n889(x)
+    if (x < 1)
+        fun_l18_n898(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n890(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n370(x)
+    end
+end
+
+def fun_l17_n891(x)
+    if (x < 1)
+        fun_l18_n100(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n892(x)
+    if (x < 1)
+        fun_l18_n785(x)
+    else
+        fun_l18_n552(x)
+    end
+end
+
+def fun_l17_n893(x)
+    if (x < 1)
+        fun_l18_n386(x)
+    else
+        fun_l18_n971(x)
+    end
+end
+
+def fun_l17_n894(x)
+    if (x < 1)
+        fun_l18_n128(x)
+    else
+        fun_l18_n28(x)
+    end
+end
+
+def fun_l17_n895(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n682(x)
+    end
+end
+
+def fun_l17_n896(x)
+    if (x < 1)
+        fun_l18_n470(x)
+    else
+        fun_l18_n477(x)
+    end
+end
+
+def fun_l17_n897(x)
+    if (x < 1)
+        fun_l18_n543(x)
+    else
+        fun_l18_n943(x)
+    end
+end
+
+def fun_l17_n898(x)
+    if (x < 1)
+        fun_l18_n554(x)
+    else
+        fun_l18_n431(x)
+    end
+end
+
+def fun_l17_n899(x)
+    if (x < 1)
+        fun_l18_n615(x)
+    else
+        fun_l18_n480(x)
+    end
+end
+
+def fun_l17_n900(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n831(x)
+    end
+end
+
+def fun_l17_n901(x)
+    if (x < 1)
+        fun_l18_n245(x)
+    else
+        fun_l18_n79(x)
+    end
+end
+
+def fun_l17_n902(x)
+    if (x < 1)
+        fun_l18_n332(x)
+    else
+        fun_l18_n536(x)
+    end
+end
+
+def fun_l17_n903(x)
+    if (x < 1)
+        fun_l18_n531(x)
+    else
+        fun_l18_n933(x)
+    end
+end
+
+def fun_l17_n904(x)
+    if (x < 1)
+        fun_l18_n748(x)
+    else
+        fun_l18_n210(x)
+    end
+end
+
+def fun_l17_n905(x)
+    if (x < 1)
+        fun_l18_n351(x)
+    else
+        fun_l18_n698(x)
+    end
+end
+
+def fun_l17_n906(x)
+    if (x < 1)
+        fun_l18_n112(x)
+    else
+        fun_l18_n397(x)
+    end
+end
+
+def fun_l17_n907(x)
+    if (x < 1)
+        fun_l18_n177(x)
+    else
+        fun_l18_n826(x)
+    end
+end
+
+def fun_l17_n908(x)
+    if (x < 1)
+        fun_l18_n635(x)
+    else
+        fun_l18_n885(x)
+    end
+end
+
+def fun_l17_n909(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n139(x)
+    end
+end
+
+def fun_l17_n910(x)
+    if (x < 1)
+        fun_l18_n30(x)
+    else
+        fun_l18_n113(x)
+    end
+end
+
+def fun_l17_n911(x)
+    if (x < 1)
+        fun_l18_n5(x)
+    else
+        fun_l18_n324(x)
+    end
+end
+
+def fun_l17_n912(x)
+    if (x < 1)
+        fun_l18_n626(x)
+    else
+        fun_l18_n326(x)
+    end
+end
+
+def fun_l17_n913(x)
+    if (x < 1)
+        fun_l18_n478(x)
+    else
+        fun_l18_n373(x)
+    end
+end
+
+def fun_l17_n914(x)
+    if (x < 1)
+        fun_l18_n348(x)
+    else
+        fun_l18_n420(x)
+    end
+end
+
+def fun_l17_n915(x)
+    if (x < 1)
+        fun_l18_n777(x)
+    else
+        fun_l18_n185(x)
+    end
+end
+
+def fun_l17_n916(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n286(x)
+    end
+end
+
+def fun_l17_n917(x)
+    if (x < 1)
+        fun_l18_n199(x)
+    else
+        fun_l18_n378(x)
+    end
+end
+
+def fun_l17_n918(x)
+    if (x < 1)
+        fun_l18_n282(x)
+    else
+        fun_l18_n617(x)
+    end
+end
+
+def fun_l17_n919(x)
+    if (x < 1)
+        fun_l18_n634(x)
+    else
+        fun_l18_n396(x)
+    end
+end
+
+def fun_l17_n920(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n479(x)
+    end
+end
+
+def fun_l17_n921(x)
+    if (x < 1)
+        fun_l18_n828(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n922(x)
+    if (x < 1)
+        fun_l18_n468(x)
+    else
+        fun_l18_n400(x)
+    end
+end
+
+def fun_l17_n923(x)
+    if (x < 1)
+        fun_l18_n815(x)
+    else
+        fun_l18_n0(x)
+    end
+end
+
+def fun_l17_n924(x)
+    if (x < 1)
+        fun_l18_n796(x)
+    else
+        fun_l18_n357(x)
+    end
+end
+
+def fun_l17_n925(x)
+    if (x < 1)
+        fun_l18_n4(x)
+    else
+        fun_l18_n293(x)
+    end
+end
+
+def fun_l17_n926(x)
+    if (x < 1)
+        fun_l18_n187(x)
+    else
+        fun_l18_n131(x)
+    end
+end
+
+def fun_l17_n927(x)
+    if (x < 1)
+        fun_l18_n896(x)
+    else
+        fun_l18_n257(x)
+    end
+end
+
+def fun_l17_n928(x)
+    if (x < 1)
+        fun_l18_n596(x)
+    else
+        fun_l18_n115(x)
+    end
+end
+
+def fun_l17_n929(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n62(x)
+    end
+end
+
+def fun_l17_n930(x)
+    if (x < 1)
+        fun_l18_n776(x)
+    else
+        fun_l18_n664(x)
+    end
+end
+
+def fun_l17_n931(x)
+    if (x < 1)
+        fun_l18_n424(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n932(x)
+    if (x < 1)
+        fun_l18_n734(x)
+    else
+        fun_l18_n652(x)
+    end
+end
+
+def fun_l17_n933(x)
+    if (x < 1)
+        fun_l18_n796(x)
+    else
+        fun_l18_n8(x)
+    end
+end
+
+def fun_l17_n934(x)
+    if (x < 1)
+        fun_l18_n783(x)
+    else
+        fun_l18_n177(x)
+    end
+end
+
+def fun_l17_n935(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n274(x)
+    end
+end
+
+def fun_l17_n936(x)
+    if (x < 1)
+        fun_l18_n289(x)
+    else
+        fun_l18_n938(x)
+    end
+end
+
+def fun_l17_n937(x)
+    if (x < 1)
+        fun_l18_n815(x)
+    else
+        fun_l18_n924(x)
+    end
+end
+
+def fun_l17_n938(x)
+    if (x < 1)
+        fun_l18_n145(x)
+    else
+        fun_l18_n497(x)
+    end
+end
+
+def fun_l17_n939(x)
+    if (x < 1)
+        fun_l18_n433(x)
+    else
+        fun_l18_n628(x)
+    end
+end
+
+def fun_l17_n940(x)
+    if (x < 1)
+        fun_l18_n410(x)
+    else
+        fun_l18_n461(x)
+    end
+end
+
+def fun_l17_n941(x)
+    if (x < 1)
+        fun_l18_n682(x)
+    else
+        fun_l18_n81(x)
+    end
+end
+
+def fun_l17_n942(x)
+    if (x < 1)
+        fun_l18_n948(x)
+    else
+        fun_l18_n29(x)
+    end
+end
+
+def fun_l17_n943(x)
+    if (x < 1)
+        fun_l18_n78(x)
+    else
+        fun_l18_n237(x)
+    end
+end
+
+def fun_l17_n944(x)
+    if (x < 1)
+        fun_l18_n683(x)
+    else
+        fun_l18_n936(x)
+    end
+end
+
+def fun_l17_n945(x)
+    if (x < 1)
+        fun_l18_n339(x)
+    else
+        fun_l18_n471(x)
+    end
+end
+
+def fun_l17_n946(x)
+    if (x < 1)
+        fun_l18_n903(x)
+    else
+        fun_l18_n983(x)
+    end
+end
+
+def fun_l17_n947(x)
+    if (x < 1)
+        fun_l18_n231(x)
+    else
+        fun_l18_n985(x)
+    end
+end
+
+def fun_l17_n948(x)
+    if (x < 1)
+        fun_l18_n379(x)
+    else
+        fun_l18_n385(x)
+    end
+end
+
+def fun_l17_n949(x)
+    if (x < 1)
+        fun_l18_n89(x)
+    else
+        fun_l18_n499(x)
+    end
+end
+
+def fun_l17_n950(x)
+    if (x < 1)
+        fun_l18_n851(x)
+    else
+        fun_l18_n563(x)
+    end
+end
+
+def fun_l17_n951(x)
+    if (x < 1)
+        fun_l18_n803(x)
+    else
+        fun_l18_n109(x)
+    end
+end
+
+def fun_l17_n952(x)
+    if (x < 1)
+        fun_l18_n178(x)
+    else
+        fun_l18_n886(x)
+    end
+end
+
+def fun_l17_n953(x)
+    if (x < 1)
+        fun_l18_n705(x)
+    else
+        fun_l18_n340(x)
+    end
+end
+
+def fun_l17_n954(x)
+    if (x < 1)
+        fun_l18_n207(x)
+    else
+        fun_l18_n499(x)
+    end
+end
+
+def fun_l17_n955(x)
+    if (x < 1)
+        fun_l18_n298(x)
+    else
+        fun_l18_n921(x)
+    end
+end
+
+def fun_l17_n956(x)
+    if (x < 1)
+        fun_l18_n291(x)
+    else
+        fun_l18_n768(x)
+    end
+end
+
+def fun_l17_n957(x)
+    if (x < 1)
+        fun_l18_n144(x)
+    else
+        fun_l18_n316(x)
+    end
+end
+
+def fun_l17_n958(x)
+    if (x < 1)
+        fun_l18_n375(x)
+    else
+        fun_l18_n891(x)
+    end
+end
+
+def fun_l17_n959(x)
+    if (x < 1)
+        fun_l18_n989(x)
+    else
+        fun_l18_n773(x)
+    end
+end
+
+def fun_l17_n960(x)
+    if (x < 1)
+        fun_l18_n615(x)
+    else
+        fun_l18_n252(x)
+    end
+end
+
+def fun_l17_n961(x)
+    if (x < 1)
+        fun_l18_n827(x)
+    else
+        fun_l18_n567(x)
+    end
+end
+
+def fun_l17_n962(x)
+    if (x < 1)
+        fun_l18_n792(x)
+    else
+        fun_l18_n81(x)
+    end
+end
+
+def fun_l17_n963(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n964(x)
+    if (x < 1)
+        fun_l18_n113(x)
+    else
+        fun_l18_n110(x)
+    end
+end
+
+def fun_l17_n965(x)
+    if (x < 1)
+        fun_l18_n321(x)
+    else
+        fun_l18_n557(x)
+    end
+end
+
+def fun_l17_n966(x)
+    if (x < 1)
+        fun_l18_n409(x)
+    else
+        fun_l18_n449(x)
+    end
+end
+
+def fun_l17_n967(x)
+    if (x < 1)
+        fun_l18_n316(x)
+    else
+        fun_l18_n669(x)
+    end
+end
+
+def fun_l17_n968(x)
+    if (x < 1)
+        fun_l18_n190(x)
+    else
+        fun_l18_n450(x)
+    end
+end
+
+def fun_l17_n969(x)
+    if (x < 1)
+        fun_l18_n174(x)
+    else
+        fun_l18_n425(x)
+    end
+end
+
+def fun_l17_n970(x)
+    if (x < 1)
+        fun_l18_n918(x)
+    else
+        fun_l18_n537(x)
+    end
+end
+
+def fun_l17_n971(x)
+    if (x < 1)
+        fun_l18_n923(x)
+    else
+        fun_l18_n998(x)
+    end
+end
+
+def fun_l17_n972(x)
+    if (x < 1)
+        fun_l18_n625(x)
+    else
+        fun_l18_n75(x)
+    end
+end
+
+def fun_l17_n973(x)
+    if (x < 1)
+        fun_l18_n171(x)
+    else
+        fun_l18_n180(x)
+    end
+end
+
+def fun_l17_n974(x)
+    if (x < 1)
+        fun_l18_n430(x)
+    else
+        fun_l18_n659(x)
+    end
+end
+
+def fun_l17_n975(x)
+    if (x < 1)
+        fun_l18_n88(x)
+    else
+        fun_l18_n363(x)
+    end
+end
+
+def fun_l17_n976(x)
+    if (x < 1)
+        fun_l18_n408(x)
+    else
+        fun_l18_n986(x)
+    end
+end
+
+def fun_l17_n977(x)
+    if (x < 1)
+        fun_l18_n988(x)
+    else
+        fun_l18_n818(x)
+    end
+end
+
+def fun_l17_n978(x)
+    if (x < 1)
+        fun_l18_n824(x)
+    else
+        fun_l18_n24(x)
+    end
+end
+
+def fun_l17_n979(x)
+    if (x < 1)
+        fun_l18_n182(x)
+    else
+        fun_l18_n969(x)
+    end
+end
+
+def fun_l17_n980(x)
+    if (x < 1)
+        fun_l18_n187(x)
+    else
+        fun_l18_n615(x)
+    end
+end
+
+def fun_l17_n981(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n25(x)
+    end
+end
+
+def fun_l17_n982(x)
+    if (x < 1)
+        fun_l18_n700(x)
+    else
+        fun_l18_n127(x)
+    end
+end
+
+def fun_l17_n983(x)
+    if (x < 1)
+        fun_l18_n153(x)
+    else
+        fun_l18_n831(x)
+    end
+end
+
+def fun_l17_n984(x)
+    if (x < 1)
+        fun_l18_n884(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n985(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n221(x)
+    end
+end
+
+def fun_l17_n986(x)
+    if (x < 1)
+        fun_l18_n431(x)
+    else
+        fun_l18_n884(x)
+    end
+end
+
+def fun_l17_n987(x)
+    if (x < 1)
+        fun_l18_n271(x)
+    else
+        fun_l18_n541(x)
+    end
+end
+
+def fun_l17_n988(x)
+    if (x < 1)
+        fun_l18_n419(x)
+    else
+        fun_l18_n183(x)
+    end
+end
+
+def fun_l17_n989(x)
+    if (x < 1)
+        fun_l18_n85(x)
+    else
+        fun_l18_n51(x)
+    end
+end
+
+def fun_l17_n990(x)
+    if (x < 1)
+        fun_l18_n528(x)
+    else
+        fun_l18_n380(x)
+    end
+end
+
+def fun_l17_n991(x)
+    if (x < 1)
+        fun_l18_n13(x)
+    else
+        fun_l18_n137(x)
+    end
+end
+
+def fun_l17_n992(x)
+    if (x < 1)
+        fun_l18_n655(x)
+    else
+        fun_l18_n344(x)
+    end
+end
+
+def fun_l17_n993(x)
+    if (x < 1)
+        fun_l18_n911(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n994(x)
+    if (x < 1)
+        fun_l18_n887(x)
+    else
+        fun_l18_n935(x)
+    end
+end
+
+def fun_l17_n995(x)
+    if (x < 1)
+        fun_l18_n206(x)
+    else
+        fun_l18_n374(x)
+    end
+end
+
+def fun_l17_n996(x)
+    if (x < 1)
+        fun_l18_n552(x)
+    else
+        fun_l18_n209(x)
+    end
+end
+
+def fun_l17_n997(x)
+    if (x < 1)
+        fun_l18_n540(x)
+    else
+        fun_l18_n901(x)
+    end
+end
+
+def fun_l17_n998(x)
+    if (x < 1)
+        fun_l18_n547(x)
+    else
+        fun_l18_n304(x)
+    end
+end
+
+def fun_l17_n999(x)
+    if (x < 1)
+        fun_l18_n297(x)
+    else
+        fun_l18_n868(x)
+    end
+end
+
+def fun_l18_n0(x)
+    if (x < 1)
+        fun_l19_n619(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n1(x)
+    if (x < 1)
+        fun_l19_n669(x)
+    else
+        fun_l19_n962(x)
+    end
+end
+
+def fun_l18_n2(x)
+    if (x < 1)
+        fun_l19_n235(x)
+    else
+        fun_l19_n99(x)
+    end
+end
+
+def fun_l18_n3(x)
+    if (x < 1)
+        fun_l19_n961(x)
+    else
+        fun_l19_n200(x)
+    end
+end
+
+def fun_l18_n4(x)
+    if (x < 1)
+        fun_l19_n812(x)
+    else
+        fun_l19_n764(x)
+    end
+end
+
+def fun_l18_n5(x)
+    if (x < 1)
+        fun_l19_n605(x)
+    else
+        fun_l19_n260(x)
+    end
+end
+
+def fun_l18_n6(x)
+    if (x < 1)
+        fun_l19_n146(x)
+    else
+        fun_l19_n617(x)
+    end
+end
+
+def fun_l18_n7(x)
+    if (x < 1)
+        fun_l19_n181(x)
+    else
+        fun_l19_n31(x)
+    end
+end
+
+def fun_l18_n8(x)
+    if (x < 1)
+        fun_l19_n884(x)
+    else
+        fun_l19_n341(x)
+    end
+end
+
+def fun_l18_n9(x)
+    if (x < 1)
+        fun_l19_n741(x)
+    else
+        fun_l19_n704(x)
+    end
+end
+
+def fun_l18_n10(x)
+    if (x < 1)
+        fun_l19_n610(x)
+    else
+        fun_l19_n24(x)
+    end
+end
+
+def fun_l18_n11(x)
+    if (x < 1)
+        fun_l19_n184(x)
+    else
+        fun_l19_n125(x)
+    end
+end
+
+def fun_l18_n12(x)
+    if (x < 1)
+        fun_l19_n59(x)
+    else
+        fun_l19_n30(x)
+    end
+end
+
+def fun_l18_n13(x)
+    if (x < 1)
+        fun_l19_n255(x)
+    else
+        fun_l19_n18(x)
+    end
+end
+
+def fun_l18_n14(x)
+    if (x < 1)
+        fun_l19_n661(x)
+    else
+        fun_l19_n554(x)
+    end
+end
+
+def fun_l18_n15(x)
+    if (x < 1)
+        fun_l19_n557(x)
+    else
+        fun_l19_n757(x)
+    end
+end
+
+def fun_l18_n16(x)
+    if (x < 1)
+        fun_l19_n946(x)
+    else
+        fun_l19_n403(x)
+    end
+end
+
+def fun_l18_n17(x)
+    if (x < 1)
+        fun_l19_n872(x)
+    else
+        fun_l19_n64(x)
+    end
+end
+
+def fun_l18_n18(x)
+    if (x < 1)
+        fun_l19_n531(x)
+    else
+        fun_l19_n200(x)
+    end
+end
+
+def fun_l18_n19(x)
+    if (x < 1)
+        fun_l19_n172(x)
+    else
+        fun_l19_n319(x)
+    end
+end
+
+def fun_l18_n20(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n707(x)
+    end
+end
+
+def fun_l18_n21(x)
+    if (x < 1)
+        fun_l19_n726(x)
+    else
+        fun_l19_n718(x)
+    end
+end
+
+def fun_l18_n22(x)
+    if (x < 1)
+        fun_l19_n169(x)
+    else
+        fun_l19_n117(x)
+    end
+end
+
+def fun_l18_n23(x)
+    if (x < 1)
+        fun_l19_n913(x)
+    else
+        fun_l19_n489(x)
+    end
+end
+
+def fun_l18_n24(x)
+    if (x < 1)
+        fun_l19_n950(x)
+    else
+        fun_l19_n272(x)
+    end
+end
+
+def fun_l18_n25(x)
+    if (x < 1)
+        fun_l19_n835(x)
+    else
+        fun_l19_n341(x)
+    end
+end
+
+def fun_l18_n26(x)
+    if (x < 1)
+        fun_l19_n771(x)
+    else
+        fun_l19_n805(x)
+    end
+end
+
+def fun_l18_n27(x)
+    if (x < 1)
+        fun_l19_n71(x)
+    else
+        fun_l19_n515(x)
+    end
+end
+
+def fun_l18_n28(x)
+    if (x < 1)
+        fun_l19_n472(x)
+    else
+        fun_l19_n807(x)
+    end
+end
+
+def fun_l18_n29(x)
+    if (x < 1)
+        fun_l19_n957(x)
+    else
+        fun_l19_n555(x)
+    end
+end
+
+def fun_l18_n30(x)
+    if (x < 1)
+        fun_l19_n629(x)
+    else
+        fun_l19_n113(x)
+    end
+end
+
+def fun_l18_n31(x)
+    if (x < 1)
+        fun_l19_n791(x)
+    else
+        fun_l19_n340(x)
+    end
+end
+
+def fun_l18_n32(x)
+    if (x < 1)
+        fun_l19_n852(x)
+    else
+        fun_l19_n204(x)
+    end
+end
+
+def fun_l18_n33(x)
+    if (x < 1)
+        fun_l19_n441(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n34(x)
+    if (x < 1)
+        fun_l19_n51(x)
+    else
+        fun_l19_n199(x)
+    end
+end
+
+def fun_l18_n35(x)
+    if (x < 1)
+        fun_l19_n472(x)
+    else
+        fun_l19_n589(x)
+    end
+end
+
+def fun_l18_n36(x)
+    if (x < 1)
+        fun_l19_n191(x)
+    else
+        fun_l19_n333(x)
+    end
+end
+
+def fun_l18_n37(x)
+    if (x < 1)
+        fun_l19_n412(x)
+    else
+        fun_l19_n661(x)
+    end
+end
+
+def fun_l18_n38(x)
+    if (x < 1)
+        fun_l19_n427(x)
+    else
+        fun_l19_n401(x)
+    end
+end
+
+def fun_l18_n39(x)
+    if (x < 1)
+        fun_l19_n96(x)
+    else
+        fun_l19_n235(x)
+    end
+end
+
+def fun_l18_n40(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n586(x)
+    end
+end
+
+def fun_l18_n41(x)
+    if (x < 1)
+        fun_l19_n559(x)
+    else
+        fun_l19_n382(x)
+    end
+end
+
+def fun_l18_n42(x)
+    if (x < 1)
+        fun_l19_n802(x)
+    else
+        fun_l19_n217(x)
+    end
+end
+
+def fun_l18_n43(x)
+    if (x < 1)
+        fun_l19_n693(x)
+    else
+        fun_l19_n178(x)
+    end
+end
+
+def fun_l18_n44(x)
+    if (x < 1)
+        fun_l19_n961(x)
+    else
+        fun_l19_n425(x)
+    end
+end
+
+def fun_l18_n45(x)
+    if (x < 1)
+        fun_l19_n242(x)
+    else
+        fun_l19_n949(x)
+    end
+end
+
+def fun_l18_n46(x)
+    if (x < 1)
+        fun_l19_n418(x)
+    else
+        fun_l19_n462(x)
+    end
+end
+
+def fun_l18_n47(x)
+    if (x < 1)
+        fun_l19_n56(x)
+    else
+        fun_l19_n79(x)
+    end
+end
+
+def fun_l18_n48(x)
+    if (x < 1)
+        fun_l19_n5(x)
+    else
+        fun_l19_n939(x)
+    end
+end
+
+def fun_l18_n49(x)
+    if (x < 1)
+        fun_l19_n4(x)
+    else
+        fun_l19_n262(x)
+    end
+end
+
+def fun_l18_n50(x)
+    if (x < 1)
+        fun_l19_n476(x)
+    else
+        fun_l19_n751(x)
+    end
+end
+
+def fun_l18_n51(x)
+    if (x < 1)
+        fun_l19_n687(x)
+    else
+        fun_l19_n489(x)
+    end
+end
+
+def fun_l18_n52(x)
+    if (x < 1)
+        fun_l19_n965(x)
+    else
+        fun_l19_n198(x)
+    end
+end
+
+def fun_l18_n53(x)
+    if (x < 1)
+        fun_l19_n349(x)
+    else
+        fun_l19_n603(x)
+    end
+end
+
+def fun_l18_n54(x)
+    if (x < 1)
+        fun_l19_n893(x)
+    else
+        fun_l19_n279(x)
+    end
+end
+
+def fun_l18_n55(x)
+    if (x < 1)
+        fun_l19_n816(x)
+    else
+        fun_l19_n922(x)
+    end
+end
+
+def fun_l18_n56(x)
+    if (x < 1)
+        fun_l19_n10(x)
+    else
+        fun_l19_n750(x)
+    end
+end
+
+def fun_l18_n57(x)
+    if (x < 1)
+        fun_l19_n787(x)
+    else
+        fun_l19_n446(x)
+    end
+end
+
+def fun_l18_n58(x)
+    if (x < 1)
+        fun_l19_n662(x)
+    else
+        fun_l19_n636(x)
+    end
+end
+
+def fun_l18_n59(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n604(x)
+    end
+end
+
+def fun_l18_n60(x)
+    if (x < 1)
+        fun_l19_n1(x)
+    else
+        fun_l19_n657(x)
+    end
+end
+
+def fun_l18_n61(x)
+    if (x < 1)
+        fun_l19_n657(x)
+    else
+        fun_l19_n516(x)
+    end
+end
+
+def fun_l18_n62(x)
+    if (x < 1)
+        fun_l19_n167(x)
+    else
+        fun_l19_n770(x)
+    end
+end
+
+def fun_l18_n63(x)
+    if (x < 1)
+        fun_l19_n572(x)
+    else
+        fun_l19_n224(x)
+    end
+end
+
+def fun_l18_n64(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n64(x)
+    end
+end
+
+def fun_l18_n65(x)
+    if (x < 1)
+        fun_l19_n200(x)
+    else
+        fun_l19_n724(x)
+    end
+end
+
+def fun_l18_n66(x)
+    if (x < 1)
+        fun_l19_n295(x)
+    else
+        fun_l19_n127(x)
+    end
+end
+
+def fun_l18_n67(x)
+    if (x < 1)
+        fun_l19_n81(x)
+    else
+        fun_l19_n757(x)
+    end
+end
+
+def fun_l18_n68(x)
+    if (x < 1)
+        fun_l19_n573(x)
+    else
+        fun_l19_n473(x)
+    end
+end
+
+def fun_l18_n69(x)
+    if (x < 1)
+        fun_l19_n475(x)
+    else
+        fun_l19_n8(x)
+    end
+end
+
+def fun_l18_n70(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n74(x)
+    end
+end
+
+def fun_l18_n71(x)
+    if (x < 1)
+        fun_l19_n270(x)
+    else
+        fun_l19_n12(x)
+    end
+end
+
+def fun_l18_n72(x)
+    if (x < 1)
+        fun_l19_n809(x)
+    else
+        fun_l19_n857(x)
+    end
+end
+
+def fun_l18_n73(x)
+    if (x < 1)
+        fun_l19_n329(x)
+    else
+        fun_l19_n850(x)
+    end
+end
+
+def fun_l18_n74(x)
+    if (x < 1)
+        fun_l19_n471(x)
+    else
+        fun_l19_n127(x)
+    end
+end
+
+def fun_l18_n75(x)
+    if (x < 1)
+        fun_l19_n558(x)
+    else
+        fun_l19_n626(x)
+    end
+end
+
+def fun_l18_n76(x)
+    if (x < 1)
+        fun_l19_n648(x)
+    else
+        fun_l19_n687(x)
+    end
+end
+
+def fun_l18_n77(x)
+    if (x < 1)
+        fun_l19_n690(x)
+    else
+        fun_l19_n612(x)
+    end
+end
+
+def fun_l18_n78(x)
+    if (x < 1)
+        fun_l19_n122(x)
+    else
+        fun_l19_n843(x)
+    end
+end
+
+def fun_l18_n79(x)
+    if (x < 1)
+        fun_l19_n375(x)
+    else
+        fun_l19_n56(x)
+    end
+end
+
+def fun_l18_n80(x)
+    if (x < 1)
+        fun_l19_n184(x)
+    else
+        fun_l19_n280(x)
+    end
+end
+
+def fun_l18_n81(x)
+    if (x < 1)
+        fun_l19_n588(x)
+    else
+        fun_l19_n433(x)
+    end
+end
+
+def fun_l18_n82(x)
+    if (x < 1)
+        fun_l19_n144(x)
+    else
+        fun_l19_n754(x)
+    end
+end
+
+def fun_l18_n83(x)
+    if (x < 1)
+        fun_l19_n468(x)
+    else
+        fun_l19_n951(x)
+    end
+end
+
+def fun_l18_n84(x)
+    if (x < 1)
+        fun_l19_n380(x)
+    else
+        fun_l19_n597(x)
+    end
+end
+
+def fun_l18_n85(x)
+    if (x < 1)
+        fun_l19_n651(x)
+    else
+        fun_l19_n756(x)
+    end
+end
+
+def fun_l18_n86(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n184(x)
+    end
+end
+
+def fun_l18_n87(x)
+    if (x < 1)
+        fun_l19_n851(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n88(x)
+    if (x < 1)
+        fun_l19_n808(x)
+    else
+        fun_l19_n102(x)
+    end
+end
+
+def fun_l18_n89(x)
+    if (x < 1)
+        fun_l19_n768(x)
+    else
+        fun_l19_n885(x)
+    end
+end
+
+def fun_l18_n90(x)
+    if (x < 1)
+        fun_l19_n933(x)
+    else
+        fun_l19_n284(x)
+    end
+end
+
+def fun_l18_n91(x)
+    if (x < 1)
+        fun_l19_n234(x)
+    else
+        fun_l19_n927(x)
+    end
+end
+
+def fun_l18_n92(x)
+    if (x < 1)
+        fun_l19_n901(x)
+    else
+        fun_l19_n690(x)
+    end
+end
+
+def fun_l18_n93(x)
+    if (x < 1)
+        fun_l19_n386(x)
+    else
+        fun_l19_n692(x)
+    end
+end
+
+def fun_l18_n94(x)
+    if (x < 1)
+        fun_l19_n572(x)
+    else
+        fun_l19_n795(x)
+    end
+end
+
+def fun_l18_n95(x)
+    if (x < 1)
+        fun_l19_n647(x)
+    else
+        fun_l19_n337(x)
+    end
+end
+
+def fun_l18_n96(x)
+    if (x < 1)
+        fun_l19_n794(x)
+    else
+        fun_l19_n611(x)
+    end
+end
+
+def fun_l18_n97(x)
+    if (x < 1)
+        fun_l19_n752(x)
+    else
+        fun_l19_n548(x)
+    end
+end
+
+def fun_l18_n98(x)
+    if (x < 1)
+        fun_l19_n710(x)
+    else
+        fun_l19_n685(x)
+    end
+end
+
+def fun_l18_n99(x)
+    if (x < 1)
+        fun_l19_n711(x)
+    else
+        fun_l19_n307(x)
+    end
+end
+
+def fun_l18_n100(x)
+    if (x < 1)
+        fun_l19_n834(x)
+    else
+        fun_l19_n355(x)
+    end
+end
+
+def fun_l18_n101(x)
+    if (x < 1)
+        fun_l19_n473(x)
+    else
+        fun_l19_n924(x)
+    end
+end
+
+def fun_l18_n102(x)
+    if (x < 1)
+        fun_l19_n79(x)
+    else
+        fun_l19_n87(x)
+    end
+end
+
+def fun_l18_n103(x)
+    if (x < 1)
+        fun_l19_n27(x)
+    else
+        fun_l19_n914(x)
+    end
+end
+
+def fun_l18_n104(x)
+    if (x < 1)
+        fun_l19_n327(x)
+    else
+        fun_l19_n136(x)
+    end
+end
+
+def fun_l18_n105(x)
+    if (x < 1)
+        fun_l19_n42(x)
+    else
+        fun_l19_n289(x)
+    end
+end
+
+def fun_l18_n106(x)
+    if (x < 1)
+        fun_l19_n371(x)
+    else
+        fun_l19_n453(x)
+    end
+end
+
+def fun_l18_n107(x)
+    if (x < 1)
+        fun_l19_n579(x)
+    else
+        fun_l19_n500(x)
+    end
+end
+
+def fun_l18_n108(x)
+    if (x < 1)
+        fun_l19_n351(x)
+    else
+        fun_l19_n683(x)
+    end
+end
+
+def fun_l18_n109(x)
+    if (x < 1)
+        fun_l19_n831(x)
+    else
+        fun_l19_n310(x)
+    end
+end
+
+def fun_l18_n110(x)
+    if (x < 1)
+        fun_l19_n618(x)
+    else
+        fun_l19_n113(x)
+    end
+end
+
+def fun_l18_n111(x)
+    if (x < 1)
+        fun_l19_n147(x)
+    else
+        fun_l19_n324(x)
+    end
+end
+
+def fun_l18_n112(x)
+    if (x < 1)
+        fun_l19_n97(x)
+    else
+        fun_l19_n901(x)
+    end
+end
+
+def fun_l18_n113(x)
+    if (x < 1)
+        fun_l19_n223(x)
+    else
+        fun_l19_n819(x)
+    end
+end
+
+def fun_l18_n114(x)
+    if (x < 1)
+        fun_l19_n929(x)
+    else
+        fun_l19_n143(x)
+    end
+end
+
+def fun_l18_n115(x)
+    if (x < 1)
+        fun_l19_n697(x)
+    else
+        fun_l19_n934(x)
+    end
+end
+
+def fun_l18_n116(x)
+    if (x < 1)
+        fun_l19_n143(x)
+    else
+        fun_l19_n815(x)
+    end
+end
+
+def fun_l18_n117(x)
+    if (x < 1)
+        fun_l19_n889(x)
+    else
+        fun_l19_n859(x)
+    end
+end
+
+def fun_l18_n118(x)
+    if (x < 1)
+        fun_l19_n233(x)
+    else
+        fun_l19_n6(x)
+    end
+end
+
+def fun_l18_n119(x)
+    if (x < 1)
+        fun_l19_n490(x)
+    else
+        fun_l19_n783(x)
+    end
+end
+
+def fun_l18_n120(x)
+    if (x < 1)
+        fun_l19_n930(x)
+    else
+        fun_l19_n376(x)
+    end
+end
+
+def fun_l18_n121(x)
+    if (x < 1)
+        fun_l19_n567(x)
+    else
+        fun_l19_n882(x)
+    end
+end
+
+def fun_l18_n122(x)
+    if (x < 1)
+        fun_l19_n532(x)
+    else
+        fun_l19_n294(x)
+    end
+end
+
+def fun_l18_n123(x)
+    if (x < 1)
+        fun_l19_n20(x)
+    else
+        fun_l19_n433(x)
+    end
+end
+
+def fun_l18_n124(x)
+    if (x < 1)
+        fun_l19_n301(x)
+    else
+        fun_l19_n591(x)
+    end
+end
+
+def fun_l18_n125(x)
+    if (x < 1)
+        fun_l19_n424(x)
+    else
+        fun_l19_n524(x)
+    end
+end
+
+def fun_l18_n126(x)
+    if (x < 1)
+        fun_l19_n12(x)
+    else
+        fun_l19_n537(x)
+    end
+end
+
+def fun_l18_n127(x)
+    if (x < 1)
+        fun_l19_n548(x)
+    else
+        fun_l19_n850(x)
+    end
+end
+
+def fun_l18_n128(x)
+    if (x < 1)
+        fun_l19_n463(x)
+    else
+        fun_l19_n714(x)
+    end
+end
+
+def fun_l18_n129(x)
+    if (x < 1)
+        fun_l19_n438(x)
+    else
+        fun_l19_n667(x)
+    end
+end
+
+def fun_l18_n130(x)
+    if (x < 1)
+        fun_l19_n481(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n131(x)
+    if (x < 1)
+        fun_l19_n84(x)
+    else
+        fun_l19_n370(x)
+    end
+end
+
+def fun_l18_n132(x)
+    if (x < 1)
+        fun_l19_n447(x)
+    else
+        fun_l19_n740(x)
+    end
+end
+
+def fun_l18_n133(x)
+    if (x < 1)
+        fun_l19_n807(x)
+    else
+        fun_l19_n595(x)
+    end
+end
+
+def fun_l18_n134(x)
+    if (x < 1)
+        fun_l19_n716(x)
+    else
+        fun_l19_n440(x)
+    end
+end
+
+def fun_l18_n135(x)
+    if (x < 1)
+        fun_l19_n657(x)
+    else
+        fun_l19_n683(x)
+    end
+end
+
+def fun_l18_n136(x)
+    if (x < 1)
+        fun_l19_n683(x)
+    else
+        fun_l19_n344(x)
+    end
+end
+
+def fun_l18_n137(x)
+    if (x < 1)
+        fun_l19_n228(x)
+    else
+        fun_l19_n186(x)
+    end
+end
+
+def fun_l18_n138(x)
+    if (x < 1)
+        fun_l19_n666(x)
+    else
+        fun_l19_n66(x)
+    end
+end
+
+def fun_l18_n139(x)
+    if (x < 1)
+        fun_l19_n416(x)
+    else
+        fun_l19_n398(x)
+    end
+end
+
+def fun_l18_n140(x)
+    if (x < 1)
+        fun_l19_n766(x)
+    else
+        fun_l19_n534(x)
+    end
+end
+
+def fun_l18_n141(x)
+    if (x < 1)
+        fun_l19_n370(x)
+    else
+        fun_l19_n653(x)
+    end
+end
+
+def fun_l18_n142(x)
+    if (x < 1)
+        fun_l19_n953(x)
+    else
+        fun_l19_n917(x)
+    end
+end
+
+def fun_l18_n143(x)
+    if (x < 1)
+        fun_l19_n989(x)
+    else
+        fun_l19_n862(x)
+    end
+end
+
+def fun_l18_n144(x)
+    if (x < 1)
+        fun_l19_n969(x)
+    else
+        fun_l19_n243(x)
+    end
+end
+
+def fun_l18_n145(x)
+    if (x < 1)
+        fun_l19_n379(x)
+    else
+        fun_l19_n315(x)
+    end
+end
+
+def fun_l18_n146(x)
+    if (x < 1)
+        fun_l19_n360(x)
+    else
+        fun_l19_n585(x)
+    end
+end
+
+def fun_l18_n147(x)
+    if (x < 1)
+        fun_l19_n4(x)
+    else
+        fun_l19_n372(x)
+    end
+end
+
+def fun_l18_n148(x)
+    if (x < 1)
+        fun_l19_n395(x)
+    else
+        fun_l19_n817(x)
+    end
+end
+
+def fun_l18_n149(x)
+    if (x < 1)
+        fun_l19_n237(x)
+    else
+        fun_l19_n506(x)
+    end
+end
+
+def fun_l18_n150(x)
+    if (x < 1)
+        fun_l19_n940(x)
+    else
+        fun_l19_n380(x)
+    end
+end
+
+def fun_l18_n151(x)
+    if (x < 1)
+        fun_l19_n190(x)
+    else
+        fun_l19_n925(x)
+    end
+end
+
+def fun_l18_n152(x)
+    if (x < 1)
+        fun_l19_n810(x)
+    else
+        fun_l19_n958(x)
+    end
+end
+
+def fun_l18_n153(x)
+    if (x < 1)
+        fun_l19_n69(x)
+    else
+        fun_l19_n19(x)
+    end
+end
+
+def fun_l18_n154(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n149(x)
+    end
+end
+
+def fun_l18_n155(x)
+    if (x < 1)
+        fun_l19_n179(x)
+    else
+        fun_l19_n583(x)
+    end
+end
+
+def fun_l18_n156(x)
+    if (x < 1)
+        fun_l19_n583(x)
+    else
+        fun_l19_n374(x)
+    end
+end
+
+def fun_l18_n157(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n158(x)
+    if (x < 1)
+        fun_l19_n288(x)
+    else
+        fun_l19_n715(x)
+    end
+end
+
+def fun_l18_n159(x)
+    if (x < 1)
+        fun_l19_n742(x)
+    else
+        fun_l19_n733(x)
+    end
+end
+
+def fun_l18_n160(x)
+    if (x < 1)
+        fun_l19_n994(x)
+    else
+        fun_l19_n434(x)
+    end
+end
+
+def fun_l18_n161(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n994(x)
+    end
+end
+
+def fun_l18_n162(x)
+    if (x < 1)
+        fun_l19_n400(x)
+    else
+        fun_l19_n632(x)
+    end
+end
+
+def fun_l18_n163(x)
+    if (x < 1)
+        fun_l19_n237(x)
+    else
+        fun_l19_n369(x)
+    end
+end
+
+def fun_l18_n164(x)
+    if (x < 1)
+        fun_l19_n431(x)
+    else
+        fun_l19_n276(x)
+    end
+end
+
+def fun_l18_n165(x)
+    if (x < 1)
+        fun_l19_n173(x)
+    else
+        fun_l19_n93(x)
+    end
+end
+
+def fun_l18_n166(x)
+    if (x < 1)
+        fun_l19_n875(x)
+    else
+        fun_l19_n568(x)
+    end
+end
+
+def fun_l18_n167(x)
+    if (x < 1)
+        fun_l19_n61(x)
+    else
+        fun_l19_n79(x)
+    end
+end
+
+def fun_l18_n168(x)
+    if (x < 1)
+        fun_l19_n683(x)
+    else
+        fun_l19_n958(x)
+    end
+end
+
+def fun_l18_n169(x)
+    if (x < 1)
+        fun_l19_n419(x)
+    else
+        fun_l19_n648(x)
+    end
+end
+
+def fun_l18_n170(x)
+    if (x < 1)
+        fun_l19_n152(x)
+    else
+        fun_l19_n746(x)
+    end
+end
+
+def fun_l18_n171(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n974(x)
+    end
+end
+
+def fun_l18_n172(x)
+    if (x < 1)
+        fun_l19_n142(x)
+    else
+        fun_l19_n751(x)
+    end
+end
+
+def fun_l18_n173(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n911(x)
+    end
+end
+
+def fun_l18_n174(x)
+    if (x < 1)
+        fun_l19_n256(x)
+    else
+        fun_l19_n414(x)
+    end
+end
+
+def fun_l18_n175(x)
+    if (x < 1)
+        fun_l19_n207(x)
+    else
+        fun_l19_n80(x)
+    end
+end
+
+def fun_l18_n176(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n22(x)
+    end
+end
+
+def fun_l18_n177(x)
+    if (x < 1)
+        fun_l19_n457(x)
+    else
+        fun_l19_n723(x)
+    end
+end
+
+def fun_l18_n178(x)
+    if (x < 1)
+        fun_l19_n36(x)
+    else
+        fun_l19_n44(x)
+    end
+end
+
+def fun_l18_n179(x)
+    if (x < 1)
+        fun_l19_n92(x)
+    else
+        fun_l19_n75(x)
+    end
+end
+
+def fun_l18_n180(x)
+    if (x < 1)
+        fun_l19_n878(x)
+    else
+        fun_l19_n318(x)
+    end
+end
+
+def fun_l18_n181(x)
+    if (x < 1)
+        fun_l19_n499(x)
+    else
+        fun_l19_n462(x)
+    end
+end
+
+def fun_l18_n182(x)
+    if (x < 1)
+        fun_l19_n172(x)
+    else
+        fun_l19_n91(x)
+    end
+end
+
+def fun_l18_n183(x)
+    if (x < 1)
+        fun_l19_n549(x)
+    else
+        fun_l19_n126(x)
+    end
+end
+
+def fun_l18_n184(x)
+    if (x < 1)
+        fun_l19_n484(x)
+    else
+        fun_l19_n45(x)
+    end
+end
+
+def fun_l18_n185(x)
+    if (x < 1)
+        fun_l19_n237(x)
+    else
+        fun_l19_n651(x)
+    end
+end
+
+def fun_l18_n186(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n466(x)
+    end
+end
+
+def fun_l18_n187(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n184(x)
+    end
+end
+
+def fun_l18_n188(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n251(x)
+    end
+end
+
+def fun_l18_n189(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n442(x)
+    end
+end
+
+def fun_l18_n190(x)
+    if (x < 1)
+        fun_l19_n516(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n191(x)
+    if (x < 1)
+        fun_l19_n342(x)
+    else
+        fun_l19_n750(x)
+    end
+end
+
+def fun_l18_n192(x)
+    if (x < 1)
+        fun_l19_n820(x)
+    else
+        fun_l19_n137(x)
+    end
+end
+
+def fun_l18_n193(x)
+    if (x < 1)
+        fun_l19_n514(x)
+    else
+        fun_l19_n594(x)
+    end
+end
+
+def fun_l18_n194(x)
+    if (x < 1)
+        fun_l19_n744(x)
+    else
+        fun_l19_n605(x)
+    end
+end
+
+def fun_l18_n195(x)
+    if (x < 1)
+        fun_l19_n428(x)
+    else
+        fun_l19_n528(x)
+    end
+end
+
+def fun_l18_n196(x)
+    if (x < 1)
+        fun_l19_n291(x)
+    else
+        fun_l19_n382(x)
+    end
+end
+
+def fun_l18_n197(x)
+    if (x < 1)
+        fun_l19_n238(x)
+    else
+        fun_l19_n38(x)
+    end
+end
+
+def fun_l18_n198(x)
+    if (x < 1)
+        fun_l19_n332(x)
+    else
+        fun_l19_n112(x)
+    end
+end
+
+def fun_l18_n199(x)
+    if (x < 1)
+        fun_l19_n703(x)
+    else
+        fun_l19_n108(x)
+    end
+end
+
+def fun_l18_n200(x)
+    if (x < 1)
+        fun_l19_n917(x)
+    else
+        fun_l19_n629(x)
+    end
+end
+
+def fun_l18_n201(x)
+    if (x < 1)
+        fun_l19_n402(x)
+    else
+        fun_l19_n223(x)
+    end
+end
+
+def fun_l18_n202(x)
+    if (x < 1)
+        fun_l19_n9(x)
+    else
+        fun_l19_n318(x)
+    end
+end
+
+def fun_l18_n203(x)
+    if (x < 1)
+        fun_l19_n560(x)
+    else
+        fun_l19_n77(x)
+    end
+end
+
+def fun_l18_n204(x)
+    if (x < 1)
+        fun_l19_n379(x)
+    else
+        fun_l19_n903(x)
+    end
+end
+
+def fun_l18_n205(x)
+    if (x < 1)
+        fun_l19_n185(x)
+    else
+        fun_l19_n174(x)
+    end
+end
+
+def fun_l18_n206(x)
+    if (x < 1)
+        fun_l19_n738(x)
+    else
+        fun_l19_n518(x)
+    end
+end
+
+def fun_l18_n207(x)
+    if (x < 1)
+        fun_l19_n343(x)
+    else
+        fun_l19_n567(x)
+    end
+end
+
+def fun_l18_n208(x)
+    if (x < 1)
+        fun_l19_n546(x)
+    else
+        fun_l19_n370(x)
+    end
+end
+
+def fun_l18_n209(x)
+    if (x < 1)
+        fun_l19_n589(x)
+    else
+        fun_l19_n511(x)
+    end
+end
+
+def fun_l18_n210(x)
+    if (x < 1)
+        fun_l19_n507(x)
+    else
+        fun_l19_n912(x)
+    end
+end
+
+def fun_l18_n211(x)
+    if (x < 1)
+        fun_l19_n779(x)
+    else
+        fun_l19_n133(x)
+    end
+end
+
+def fun_l18_n212(x)
+    if (x < 1)
+        fun_l19_n400(x)
+    else
+        fun_l19_n345(x)
+    end
+end
+
+def fun_l18_n213(x)
+    if (x < 1)
+        fun_l19_n214(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n214(x)
+    if (x < 1)
+        fun_l19_n829(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n215(x)
+    if (x < 1)
+        fun_l19_n835(x)
+    else
+        fun_l19_n80(x)
+    end
+end
+
+def fun_l18_n216(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n836(x)
+    end
+end
+
+def fun_l18_n217(x)
+    if (x < 1)
+        fun_l19_n861(x)
+    else
+        fun_l19_n801(x)
+    end
+end
+
+def fun_l18_n218(x)
+    if (x < 1)
+        fun_l19_n316(x)
+    else
+        fun_l19_n263(x)
+    end
+end
+
+def fun_l18_n219(x)
+    if (x < 1)
+        fun_l19_n231(x)
+    else
+        fun_l19_n315(x)
+    end
+end
+
+def fun_l18_n220(x)
+    if (x < 1)
+        fun_l19_n700(x)
+    else
+        fun_l19_n276(x)
+    end
+end
+
+def fun_l18_n221(x)
+    if (x < 1)
+        fun_l19_n654(x)
+    else
+        fun_l19_n32(x)
+    end
+end
+
+def fun_l18_n222(x)
+    if (x < 1)
+        fun_l19_n758(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n223(x)
+    if (x < 1)
+        fun_l19_n819(x)
+    else
+        fun_l19_n764(x)
+    end
+end
+
+def fun_l18_n224(x)
+    if (x < 1)
+        fun_l19_n31(x)
+    else
+        fun_l19_n51(x)
+    end
+end
+
+def fun_l18_n225(x)
+    if (x < 1)
+        fun_l19_n704(x)
+    else
+        fun_l19_n932(x)
+    end
+end
+
+def fun_l18_n226(x)
+    if (x < 1)
+        fun_l19_n635(x)
+    else
+        fun_l19_n411(x)
+    end
+end
+
+def fun_l18_n227(x)
+    if (x < 1)
+        fun_l19_n368(x)
+    else
+        fun_l19_n472(x)
+    end
+end
+
+def fun_l18_n228(x)
+    if (x < 1)
+        fun_l19_n928(x)
+    else
+        fun_l19_n357(x)
+    end
+end
+
+def fun_l18_n229(x)
+    if (x < 1)
+        fun_l19_n503(x)
+    else
+        fun_l19_n495(x)
+    end
+end
+
+def fun_l18_n230(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n73(x)
+    end
+end
+
+def fun_l18_n231(x)
+    if (x < 1)
+        fun_l19_n718(x)
+    else
+        fun_l19_n971(x)
+    end
+end
+
+def fun_l18_n232(x)
+    if (x < 1)
+        fun_l19_n314(x)
+    else
+        fun_l19_n100(x)
+    end
+end
+
+def fun_l18_n233(x)
+    if (x < 1)
+        fun_l19_n490(x)
+    else
+        fun_l19_n569(x)
+    end
+end
+
+def fun_l18_n234(x)
+    if (x < 1)
+        fun_l19_n309(x)
+    else
+        fun_l19_n806(x)
+    end
+end
+
+def fun_l18_n235(x)
+    if (x < 1)
+        fun_l19_n839(x)
+    else
+        fun_l19_n388(x)
+    end
+end
+
+def fun_l18_n236(x)
+    if (x < 1)
+        fun_l19_n158(x)
+    else
+        fun_l19_n438(x)
+    end
+end
+
+def fun_l18_n237(x)
+    if (x < 1)
+        fun_l19_n181(x)
+    else
+        fun_l19_n728(x)
+    end
+end
+
+def fun_l18_n238(x)
+    if (x < 1)
+        fun_l19_n238(x)
+    else
+        fun_l19_n41(x)
+    end
+end
+
+def fun_l18_n239(x)
+    if (x < 1)
+        fun_l19_n342(x)
+    else
+        fun_l19_n756(x)
+    end
+end
+
+def fun_l18_n240(x)
+    if (x < 1)
+        fun_l19_n873(x)
+    else
+        fun_l19_n274(x)
+    end
+end
+
+def fun_l18_n241(x)
+    if (x < 1)
+        fun_l19_n273(x)
+    else
+        fun_l19_n740(x)
+    end
+end
+
+def fun_l18_n242(x)
+    if (x < 1)
+        fun_l19_n256(x)
+    else
+        fun_l19_n99(x)
+    end
+end
+
+def fun_l18_n243(x)
+    if (x < 1)
+        fun_l19_n482(x)
+    else
+        fun_l19_n569(x)
+    end
+end
+
+def fun_l18_n244(x)
+    if (x < 1)
+        fun_l19_n598(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n245(x)
+    if (x < 1)
+        fun_l19_n320(x)
+    else
+        fun_l19_n164(x)
+    end
+end
+
+def fun_l18_n246(x)
+    if (x < 1)
+        fun_l19_n803(x)
+    else
+        fun_l19_n240(x)
+    end
+end
+
+def fun_l18_n247(x)
+    if (x < 1)
+        fun_l19_n790(x)
+    else
+        fun_l19_n55(x)
+    end
+end
+
+def fun_l18_n248(x)
+    if (x < 1)
+        fun_l19_n193(x)
+    else
+        fun_l19_n754(x)
+    end
+end
+
+def fun_l18_n249(x)
+    if (x < 1)
+        fun_l19_n122(x)
+    else
+        fun_l19_n841(x)
+    end
+end
+
+def fun_l18_n250(x)
+    if (x < 1)
+        fun_l19_n724(x)
+    else
+        fun_l19_n359(x)
+    end
+end
+
+def fun_l18_n251(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n777(x)
+    end
+end
+
+def fun_l18_n252(x)
+    if (x < 1)
+        fun_l19_n986(x)
+    else
+        fun_l19_n666(x)
+    end
+end
+
+def fun_l18_n253(x)
+    if (x < 1)
+        fun_l19_n864(x)
+    else
+        fun_l19_n320(x)
+    end
+end
+
+def fun_l18_n254(x)
+    if (x < 1)
+        fun_l19_n386(x)
+    else
+        fun_l19_n582(x)
+    end
+end
+
+def fun_l18_n255(x)
+    if (x < 1)
+        fun_l19_n434(x)
+    else
+        fun_l19_n224(x)
+    end
+end
+
+def fun_l18_n256(x)
+    if (x < 1)
+        fun_l19_n921(x)
+    else
+        fun_l19_n8(x)
+    end
+end
+
+def fun_l18_n257(x)
+    if (x < 1)
+        fun_l19_n789(x)
+    else
+        fun_l19_n546(x)
+    end
+end
+
+def fun_l18_n258(x)
+    if (x < 1)
+        fun_l19_n324(x)
+    else
+        fun_l19_n987(x)
+    end
+end
+
+def fun_l18_n259(x)
+    if (x < 1)
+        fun_l19_n279(x)
+    else
+        fun_l19_n180(x)
+    end
+end
+
+def fun_l18_n260(x)
+    if (x < 1)
+        fun_l19_n596(x)
+    else
+        fun_l19_n670(x)
+    end
+end
+
+def fun_l18_n261(x)
+    if (x < 1)
+        fun_l19_n940(x)
+    else
+        fun_l19_n982(x)
+    end
+end
+
+def fun_l18_n262(x)
+    if (x < 1)
+        fun_l19_n54(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n263(x)
+    if (x < 1)
+        fun_l19_n815(x)
+    else
+        fun_l19_n663(x)
+    end
+end
+
+def fun_l18_n264(x)
+    if (x < 1)
+        fun_l19_n794(x)
+    else
+        fun_l19_n251(x)
+    end
+end
+
+def fun_l18_n265(x)
+    if (x < 1)
+        fun_l19_n485(x)
+    else
+        fun_l19_n896(x)
+    end
+end
+
+def fun_l18_n266(x)
+    if (x < 1)
+        fun_l19_n346(x)
+    else
+        fun_l19_n151(x)
+    end
+end
+
+def fun_l18_n267(x)
+    if (x < 1)
+        fun_l19_n162(x)
+    else
+        fun_l19_n395(x)
+    end
+end
+
+def fun_l18_n268(x)
+    if (x < 1)
+        fun_l19_n76(x)
+    else
+        fun_l19_n25(x)
+    end
+end
+
+def fun_l18_n269(x)
+    if (x < 1)
+        fun_l19_n943(x)
+    else
+        fun_l19_n587(x)
+    end
+end
+
+def fun_l18_n270(x)
+    if (x < 1)
+        fun_l19_n663(x)
+    else
+        fun_l19_n255(x)
+    end
+end
+
+def fun_l18_n271(x)
+    if (x < 1)
+        fun_l19_n307(x)
+    else
+        fun_l19_n261(x)
+    end
+end
+
+def fun_l18_n272(x)
+    if (x < 1)
+        fun_l19_n478(x)
+    else
+        fun_l19_n600(x)
+    end
+end
+
+def fun_l18_n273(x)
+    if (x < 1)
+        fun_l19_n345(x)
+    else
+        fun_l19_n877(x)
+    end
+end
+
+def fun_l18_n274(x)
+    if (x < 1)
+        fun_l19_n637(x)
+    else
+        fun_l19_n27(x)
+    end
+end
+
+def fun_l18_n275(x)
+    if (x < 1)
+        fun_l19_n752(x)
+    else
+        fun_l19_n946(x)
+    end
+end
+
+def fun_l18_n276(x)
+    if (x < 1)
+        fun_l19_n571(x)
+    else
+        fun_l19_n973(x)
+    end
+end
+
+def fun_l18_n277(x)
+    if (x < 1)
+        fun_l19_n274(x)
+    else
+        fun_l19_n673(x)
+    end
+end
+
+def fun_l18_n278(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n826(x)
+    end
+end
+
+def fun_l18_n279(x)
+    if (x < 1)
+        fun_l19_n294(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n280(x)
+    if (x < 1)
+        fun_l19_n661(x)
+    else
+        fun_l19_n531(x)
+    end
+end
+
+def fun_l18_n281(x)
+    if (x < 1)
+        fun_l19_n295(x)
+    else
+        fun_l19_n961(x)
+    end
+end
+
+def fun_l18_n282(x)
+    if (x < 1)
+        fun_l19_n902(x)
+    else
+        fun_l19_n364(x)
+    end
+end
+
+def fun_l18_n283(x)
+    if (x < 1)
+        fun_l19_n147(x)
+    else
+        fun_l19_n709(x)
+    end
+end
+
+def fun_l18_n284(x)
+    if (x < 1)
+        fun_l19_n394(x)
+    else
+        fun_l19_n757(x)
+    end
+end
+
+def fun_l18_n285(x)
+    if (x < 1)
+        fun_l19_n372(x)
+    else
+        fun_l19_n45(x)
+    end
+end
+
+def fun_l18_n286(x)
+    if (x < 1)
+        fun_l19_n323(x)
+    else
+        fun_l19_n128(x)
+    end
+end
+
+def fun_l18_n287(x)
+    if (x < 1)
+        fun_l19_n50(x)
+    else
+        fun_l19_n650(x)
+    end
+end
+
+def fun_l18_n288(x)
+    if (x < 1)
+        fun_l19_n300(x)
+    else
+        fun_l19_n308(x)
+    end
+end
+
+def fun_l18_n289(x)
+    if (x < 1)
+        fun_l19_n2(x)
+    else
+        fun_l19_n27(x)
+    end
+end
+
+def fun_l18_n290(x)
+    if (x < 1)
+        fun_l19_n341(x)
+    else
+        fun_l19_n281(x)
+    end
+end
+
+def fun_l18_n291(x)
+    if (x < 1)
+        fun_l19_n797(x)
+    else
+        fun_l19_n575(x)
+    end
+end
+
+def fun_l18_n292(x)
+    if (x < 1)
+        fun_l19_n740(x)
+    else
+        fun_l19_n772(x)
+    end
+end
+
+def fun_l18_n293(x)
+    if (x < 1)
+        fun_l19_n707(x)
+    else
+        fun_l19_n456(x)
+    end
+end
+
+def fun_l18_n294(x)
+    if (x < 1)
+        fun_l19_n714(x)
+    else
+        fun_l19_n601(x)
+    end
+end
+
+def fun_l18_n295(x)
+    if (x < 1)
+        fun_l19_n298(x)
+    else
+        fun_l19_n367(x)
+    end
+end
+
+def fun_l18_n296(x)
+    if (x < 1)
+        fun_l19_n0(x)
+    else
+        fun_l19_n970(x)
+    end
+end
+
+def fun_l18_n297(x)
+    if (x < 1)
+        fun_l19_n703(x)
+    else
+        fun_l19_n673(x)
+    end
+end
+
+def fun_l18_n298(x)
+    if (x < 1)
+        fun_l19_n890(x)
+    else
+        fun_l19_n932(x)
+    end
+end
+
+def fun_l18_n299(x)
+    if (x < 1)
+        fun_l19_n152(x)
+    else
+        fun_l19_n784(x)
+    end
+end
+
+def fun_l18_n300(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n449(x)
+    end
+end
+
+def fun_l18_n301(x)
+    if (x < 1)
+        fun_l19_n161(x)
+    else
+        fun_l19_n51(x)
+    end
+end
+
+def fun_l18_n302(x)
+    if (x < 1)
+        fun_l19_n695(x)
+    else
+        fun_l19_n604(x)
+    end
+end
+
+def fun_l18_n303(x)
+    if (x < 1)
+        fun_l19_n415(x)
+    else
+        fun_l19_n752(x)
+    end
+end
+
+def fun_l18_n304(x)
+    if (x < 1)
+        fun_l19_n737(x)
+    else
+        fun_l19_n944(x)
+    end
+end
+
+def fun_l18_n305(x)
+    if (x < 1)
+        fun_l19_n833(x)
+    else
+        fun_l19_n98(x)
+    end
+end
+
+def fun_l18_n306(x)
+    if (x < 1)
+        fun_l19_n598(x)
+    else
+        fun_l19_n601(x)
+    end
+end
+
+def fun_l18_n307(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n116(x)
+    end
+end
+
+def fun_l18_n308(x)
+    if (x < 1)
+        fun_l19_n892(x)
+    else
+        fun_l19_n826(x)
+    end
+end
+
+def fun_l18_n309(x)
+    if (x < 1)
+        fun_l19_n926(x)
+    else
+        fun_l19_n119(x)
+    end
+end
+
+def fun_l18_n310(x)
+    if (x < 1)
+        fun_l19_n194(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n311(x)
+    if (x < 1)
+        fun_l19_n490(x)
+    else
+        fun_l19_n401(x)
+    end
+end
+
+def fun_l18_n312(x)
+    if (x < 1)
+        fun_l19_n727(x)
+    else
+        fun_l19_n193(x)
+    end
+end
+
+def fun_l18_n313(x)
+    if (x < 1)
+        fun_l19_n643(x)
+    else
+        fun_l19_n327(x)
+    end
+end
+
+def fun_l18_n314(x)
+    if (x < 1)
+        fun_l19_n747(x)
+    else
+        fun_l19_n938(x)
+    end
+end
+
+def fun_l18_n315(x)
+    if (x < 1)
+        fun_l19_n153(x)
+    else
+        fun_l19_n438(x)
+    end
+end
+
+def fun_l18_n316(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n471(x)
+    end
+end
+
+def fun_l18_n317(x)
+    if (x < 1)
+        fun_l19_n105(x)
+    else
+        fun_l19_n832(x)
+    end
+end
+
+def fun_l18_n318(x)
+    if (x < 1)
+        fun_l19_n652(x)
+    else
+        fun_l19_n826(x)
+    end
+end
+
+def fun_l18_n319(x)
+    if (x < 1)
+        fun_l19_n3(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n320(x)
+    if (x < 1)
+        fun_l19_n854(x)
+    else
+        fun_l19_n371(x)
+    end
+end
+
+def fun_l18_n321(x)
+    if (x < 1)
+        fun_l19_n241(x)
+    else
+        fun_l19_n51(x)
+    end
+end
+
+def fun_l18_n322(x)
+    if (x < 1)
+        fun_l19_n832(x)
+    else
+        fun_l19_n897(x)
+    end
+end
+
+def fun_l18_n323(x)
+    if (x < 1)
+        fun_l19_n472(x)
+    else
+        fun_l19_n838(x)
+    end
+end
+
+def fun_l18_n324(x)
+    if (x < 1)
+        fun_l19_n844(x)
+    else
+        fun_l19_n228(x)
+    end
+end
+
+def fun_l18_n325(x)
+    if (x < 1)
+        fun_l19_n132(x)
+    else
+        fun_l19_n424(x)
+    end
+end
+
+def fun_l18_n326(x)
+    if (x < 1)
+        fun_l19_n311(x)
+    else
+        fun_l19_n388(x)
+    end
+end
+
+def fun_l18_n327(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n98(x)
+    end
+end
+
+def fun_l18_n328(x)
+    if (x < 1)
+        fun_l19_n342(x)
+    else
+        fun_l19_n743(x)
+    end
+end
+
+def fun_l18_n329(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n762(x)
+    end
+end
+
+def fun_l18_n330(x)
+    if (x < 1)
+        fun_l19_n358(x)
+    else
+        fun_l19_n624(x)
+    end
+end
+
+def fun_l18_n331(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n35(x)
+    end
+end
+
+def fun_l18_n332(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n629(x)
+    end
+end
+
+def fun_l18_n333(x)
+    if (x < 1)
+        fun_l19_n70(x)
+    else
+        fun_l19_n150(x)
+    end
+end
+
+def fun_l18_n334(x)
+    if (x < 1)
+        fun_l19_n538(x)
+    else
+        fun_l19_n239(x)
+    end
+end
+
+def fun_l18_n335(x)
+    if (x < 1)
+        fun_l19_n818(x)
+    else
+        fun_l19_n878(x)
+    end
+end
+
+def fun_l18_n336(x)
+    if (x < 1)
+        fun_l19_n233(x)
+    else
+        fun_l19_n286(x)
+    end
+end
+
+def fun_l18_n337(x)
+    if (x < 1)
+        fun_l19_n731(x)
+    else
+        fun_l19_n416(x)
+    end
+end
+
+def fun_l18_n338(x)
+    if (x < 1)
+        fun_l19_n917(x)
+    else
+        fun_l19_n710(x)
+    end
+end
+
+def fun_l18_n339(x)
+    if (x < 1)
+        fun_l19_n638(x)
+    else
+        fun_l19_n187(x)
+    end
+end
+
+def fun_l18_n340(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n767(x)
+    end
+end
+
+def fun_l18_n341(x)
+    if (x < 1)
+        fun_l19_n9(x)
+    else
+        fun_l19_n708(x)
+    end
+end
+
+def fun_l18_n342(x)
+    if (x < 1)
+        fun_l19_n76(x)
+    else
+        fun_l19_n479(x)
+    end
+end
+
+def fun_l18_n343(x)
+    if (x < 1)
+        fun_l19_n679(x)
+    else
+        fun_l19_n85(x)
+    end
+end
+
+def fun_l18_n344(x)
+    if (x < 1)
+        fun_l19_n725(x)
+    else
+        fun_l19_n809(x)
+    end
+end
+
+def fun_l18_n345(x)
+    if (x < 1)
+        fun_l19_n680(x)
+    else
+        fun_l19_n416(x)
+    end
+end
+
+def fun_l18_n346(x)
+    if (x < 1)
+        fun_l19_n66(x)
+    else
+        fun_l19_n36(x)
+    end
+end
+
+def fun_l18_n347(x)
+    if (x < 1)
+        fun_l19_n420(x)
+    else
+        fun_l19_n879(x)
+    end
+end
+
+def fun_l18_n348(x)
+    if (x < 1)
+        fun_l19_n653(x)
+    else
+        fun_l19_n634(x)
+    end
+end
+
+def fun_l18_n349(x)
+    if (x < 1)
+        fun_l19_n134(x)
+    else
+        fun_l19_n840(x)
+    end
+end
+
+def fun_l18_n350(x)
+    if (x < 1)
+        fun_l19_n21(x)
+    else
+        fun_l19_n843(x)
+    end
+end
+
+def fun_l18_n351(x)
+    if (x < 1)
+        fun_l19_n917(x)
+    else
+        fun_l19_n101(x)
+    end
+end
+
+def fun_l18_n352(x)
+    if (x < 1)
+        fun_l19_n541(x)
+    else
+        fun_l19_n646(x)
+    end
+end
+
+def fun_l18_n353(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n648(x)
+    end
+end
+
+def fun_l18_n354(x)
+    if (x < 1)
+        fun_l19_n431(x)
+    else
+        fun_l19_n736(x)
+    end
+end
+
+def fun_l18_n355(x)
+    if (x < 1)
+        fun_l19_n294(x)
+    else
+        fun_l19_n512(x)
+    end
+end
+
+def fun_l18_n356(x)
+    if (x < 1)
+        fun_l19_n852(x)
+    else
+        fun_l19_n348(x)
+    end
+end
+
+def fun_l18_n357(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n997(x)
+    end
+end
+
+def fun_l18_n358(x)
+    if (x < 1)
+        fun_l19_n595(x)
+    else
+        fun_l19_n544(x)
+    end
+end
+
+def fun_l18_n359(x)
+    if (x < 1)
+        fun_l19_n13(x)
+    else
+        fun_l19_n838(x)
+    end
+end
+
+def fun_l18_n360(x)
+    if (x < 1)
+        fun_l19_n518(x)
+    else
+        fun_l19_n642(x)
+    end
+end
+
+def fun_l18_n361(x)
+    if (x < 1)
+        fun_l19_n333(x)
+    else
+        fun_l19_n59(x)
+    end
+end
+
+def fun_l18_n362(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n844(x)
+    end
+end
+
+def fun_l18_n363(x)
+    if (x < 1)
+        fun_l19_n14(x)
+    else
+        fun_l19_n932(x)
+    end
+end
+
+def fun_l18_n364(x)
+    if (x < 1)
+        fun_l19_n508(x)
+    else
+        fun_l19_n466(x)
+    end
+end
+
+def fun_l18_n365(x)
+    if (x < 1)
+        fun_l19_n177(x)
+    else
+        fun_l19_n365(x)
+    end
+end
+
+def fun_l18_n366(x)
+    if (x < 1)
+        fun_l19_n367(x)
+    else
+        fun_l19_n205(x)
+    end
+end
+
+def fun_l18_n367(x)
+    if (x < 1)
+        fun_l19_n353(x)
+    else
+        fun_l19_n328(x)
+    end
+end
+
+def fun_l18_n368(x)
+    if (x < 1)
+        fun_l19_n801(x)
+    else
+        fun_l19_n420(x)
+    end
+end
+
+def fun_l18_n369(x)
+    if (x < 1)
+        fun_l19_n162(x)
+    else
+        fun_l19_n670(x)
+    end
+end
+
+def fun_l18_n370(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n852(x)
+    end
+end
+
+def fun_l18_n371(x)
+    if (x < 1)
+        fun_l19_n47(x)
+    else
+        fun_l19_n130(x)
+    end
+end
+
+def fun_l18_n372(x)
+    if (x < 1)
+        fun_l19_n774(x)
+    else
+        fun_l19_n792(x)
+    end
+end
+
+def fun_l18_n373(x)
+    if (x < 1)
+        fun_l19_n124(x)
+    else
+        fun_l19_n665(x)
+    end
+end
+
+def fun_l18_n374(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n371(x)
+    end
+end
+
+def fun_l18_n375(x)
+    if (x < 1)
+        fun_l19_n484(x)
+    else
+        fun_l19_n708(x)
+    end
+end
+
+def fun_l18_n376(x)
+    if (x < 1)
+        fun_l19_n810(x)
+    else
+        fun_l19_n856(x)
+    end
+end
+
+def fun_l18_n377(x)
+    if (x < 1)
+        fun_l19_n23(x)
+    else
+        fun_l19_n817(x)
+    end
+end
+
+def fun_l18_n378(x)
+    if (x < 1)
+        fun_l19_n827(x)
+    else
+        fun_l19_n639(x)
+    end
+end
+
+def fun_l18_n379(x)
+    if (x < 1)
+        fun_l19_n557(x)
+    else
+        fun_l19_n268(x)
+    end
+end
+
+def fun_l18_n380(x)
+    if (x < 1)
+        fun_l19_n885(x)
+    else
+        fun_l19_n421(x)
+    end
+end
+
+def fun_l18_n381(x)
+    if (x < 1)
+        fun_l19_n543(x)
+    else
+        fun_l19_n230(x)
+    end
+end
+
+def fun_l18_n382(x)
+    if (x < 1)
+        fun_l19_n978(x)
+    else
+        fun_l19_n848(x)
+    end
+end
+
+def fun_l18_n383(x)
+    if (x < 1)
+        fun_l19_n31(x)
+    else
+        fun_l19_n731(x)
+    end
+end
+
+def fun_l18_n384(x)
+    if (x < 1)
+        fun_l19_n20(x)
+    else
+        fun_l19_n149(x)
+    end
+end
+
+def fun_l18_n385(x)
+    if (x < 1)
+        fun_l19_n650(x)
+    else
+        fun_l19_n268(x)
+    end
+end
+
+def fun_l18_n386(x)
+    if (x < 1)
+        fun_l19_n491(x)
+    else
+        fun_l19_n644(x)
+    end
+end
+
+def fun_l18_n387(x)
+    if (x < 1)
+        fun_l19_n537(x)
+    else
+        fun_l19_n400(x)
+    end
+end
+
+def fun_l18_n388(x)
+    if (x < 1)
+        fun_l19_n939(x)
+    else
+        fun_l19_n861(x)
+    end
+end
+
+def fun_l18_n389(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n877(x)
+    end
+end
+
+def fun_l18_n390(x)
+    if (x < 1)
+        fun_l19_n226(x)
+    else
+        fun_l19_n288(x)
+    end
+end
+
+def fun_l18_n391(x)
+    if (x < 1)
+        fun_l19_n921(x)
+    else
+        fun_l19_n754(x)
+    end
+end
+
+def fun_l18_n392(x)
+    if (x < 1)
+        fun_l19_n71(x)
+    else
+        fun_l19_n844(x)
+    end
+end
+
+def fun_l18_n393(x)
+    if (x < 1)
+        fun_l19_n310(x)
+    else
+        fun_l19_n442(x)
+    end
+end
+
+def fun_l18_n394(x)
+    if (x < 1)
+        fun_l19_n539(x)
+    else
+        fun_l19_n933(x)
+    end
+end
+
+def fun_l18_n395(x)
+    if (x < 1)
+        fun_l19_n849(x)
+    else
+        fun_l19_n719(x)
+    end
+end
+
+def fun_l18_n396(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n435(x)
+    end
+end
+
+def fun_l18_n397(x)
+    if (x < 1)
+        fun_l19_n916(x)
+    else
+        fun_l19_n399(x)
+    end
+end
+
+def fun_l18_n398(x)
+    if (x < 1)
+        fun_l19_n820(x)
+    else
+        fun_l19_n650(x)
+    end
+end
+
+def fun_l18_n399(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n678(x)
+    end
+end
+
+def fun_l18_n400(x)
+    if (x < 1)
+        fun_l19_n562(x)
+    else
+        fun_l19_n392(x)
+    end
+end
+
+def fun_l18_n401(x)
+    if (x < 1)
+        fun_l19_n298(x)
+    else
+        fun_l19_n61(x)
+    end
+end
+
+def fun_l18_n402(x)
+    if (x < 1)
+        fun_l19_n803(x)
+    else
+        fun_l19_n535(x)
+    end
+end
+
+def fun_l18_n403(x)
+    if (x < 1)
+        fun_l19_n335(x)
+    else
+        fun_l19_n431(x)
+    end
+end
+
+def fun_l18_n404(x)
+    if (x < 1)
+        fun_l19_n558(x)
+    else
+        fun_l19_n821(x)
+    end
+end
+
+def fun_l18_n405(x)
+    if (x < 1)
+        fun_l19_n608(x)
+    else
+        fun_l19_n415(x)
+    end
+end
+
+def fun_l18_n406(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n635(x)
+    end
+end
+
+def fun_l18_n407(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n923(x)
+    end
+end
+
+def fun_l18_n408(x)
+    if (x < 1)
+        fun_l19_n612(x)
+    else
+        fun_l19_n386(x)
+    end
+end
+
+def fun_l18_n409(x)
+    if (x < 1)
+        fun_l19_n1(x)
+    else
+        fun_l19_n679(x)
+    end
+end
+
+def fun_l18_n410(x)
+    if (x < 1)
+        fun_l19_n998(x)
+    else
+        fun_l19_n969(x)
+    end
+end
+
+def fun_l18_n411(x)
+    if (x < 1)
+        fun_l19_n210(x)
+    else
+        fun_l19_n642(x)
+    end
+end
+
+def fun_l18_n412(x)
+    if (x < 1)
+        fun_l19_n902(x)
+    else
+        fun_l19_n591(x)
+    end
+end
+
+def fun_l18_n413(x)
+    if (x < 1)
+        fun_l19_n417(x)
+    else
+        fun_l19_n192(x)
+    end
+end
+
+def fun_l18_n414(x)
+    if (x < 1)
+        fun_l19_n543(x)
+    else
+        fun_l19_n277(x)
+    end
+end
+
+def fun_l18_n415(x)
+    if (x < 1)
+        fun_l19_n145(x)
+    else
+        fun_l19_n157(x)
+    end
+end
+
+def fun_l18_n416(x)
+    if (x < 1)
+        fun_l19_n696(x)
+    else
+        fun_l19_n453(x)
+    end
+end
+
+def fun_l18_n417(x)
+    if (x < 1)
+        fun_l19_n593(x)
+    else
+        fun_l19_n683(x)
+    end
+end
+
+def fun_l18_n418(x)
+    if (x < 1)
+        fun_l19_n459(x)
+    else
+        fun_l19_n292(x)
+    end
+end
+
+def fun_l18_n419(x)
+    if (x < 1)
+        fun_l19_n37(x)
+    else
+        fun_l19_n281(x)
+    end
+end
+
+def fun_l18_n420(x)
+    if (x < 1)
+        fun_l19_n39(x)
+    else
+        fun_l19_n642(x)
+    end
+end
+
+def fun_l18_n421(x)
+    if (x < 1)
+        fun_l19_n942(x)
+    else
+        fun_l19_n997(x)
+    end
+end
+
+def fun_l18_n422(x)
+    if (x < 1)
+        fun_l19_n18(x)
+    else
+        fun_l19_n301(x)
+    end
+end
+
+def fun_l18_n423(x)
+    if (x < 1)
+        fun_l19_n473(x)
+    else
+        fun_l19_n231(x)
+    end
+end
+
+def fun_l18_n424(x)
+    if (x < 1)
+        fun_l19_n331(x)
+    else
+        fun_l19_n110(x)
+    end
+end
+
+def fun_l18_n425(x)
+    if (x < 1)
+        fun_l19_n786(x)
+    else
+        fun_l19_n991(x)
+    end
+end
+
+def fun_l18_n426(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n17(x)
+    end
+end
+
+def fun_l18_n427(x)
+    if (x < 1)
+        fun_l19_n294(x)
+    else
+        fun_l19_n3(x)
+    end
+end
+
+def fun_l18_n428(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n576(x)
+    end
+end
+
+def fun_l18_n429(x)
+    if (x < 1)
+        fun_l19_n818(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n430(x)
+    if (x < 1)
+        fun_l19_n360(x)
+    else
+        fun_l19_n443(x)
+    end
+end
+
+def fun_l18_n431(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n863(x)
+    end
+end
+
+def fun_l18_n432(x)
+    if (x < 1)
+        fun_l19_n591(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n433(x)
+    if (x < 1)
+        fun_l19_n955(x)
+    else
+        fun_l19_n265(x)
+    end
+end
+
+def fun_l18_n434(x)
+    if (x < 1)
+        fun_l19_n374(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n435(x)
+    if (x < 1)
+        fun_l19_n712(x)
+    else
+        fun_l19_n603(x)
+    end
+end
+
+def fun_l18_n436(x)
+    if (x < 1)
+        fun_l19_n750(x)
+    else
+        fun_l19_n852(x)
+    end
+end
+
+def fun_l18_n437(x)
+    if (x < 1)
+        fun_l19_n393(x)
+    else
+        fun_l19_n121(x)
+    end
+end
+
+def fun_l18_n438(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n33(x)
+    end
+end
+
+def fun_l18_n439(x)
+    if (x < 1)
+        fun_l19_n872(x)
+    else
+        fun_l19_n841(x)
+    end
+end
+
+def fun_l18_n440(x)
+    if (x < 1)
+        fun_l19_n828(x)
+    else
+        fun_l19_n549(x)
+    end
+end
+
+def fun_l18_n441(x)
+    if (x < 1)
+        fun_l19_n647(x)
+    else
+        fun_l19_n795(x)
+    end
+end
+
+def fun_l18_n442(x)
+    if (x < 1)
+        fun_l19_n609(x)
+    else
+        fun_l19_n837(x)
+    end
+end
+
+def fun_l18_n443(x)
+    if (x < 1)
+        fun_l19_n977(x)
+    else
+        fun_l19_n670(x)
+    end
+end
+
+def fun_l18_n444(x)
+    if (x < 1)
+        fun_l19_n649(x)
+    else
+        fun_l19_n912(x)
+    end
+end
+
+def fun_l18_n445(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n994(x)
+    end
+end
+
+def fun_l18_n446(x)
+    if (x < 1)
+        fun_l19_n868(x)
+    else
+        fun_l19_n105(x)
+    end
+end
+
+def fun_l18_n447(x)
+    if (x < 1)
+        fun_l19_n405(x)
+    else
+        fun_l19_n318(x)
+    end
+end
+
+def fun_l18_n448(x)
+    if (x < 1)
+        fun_l19_n966(x)
+    else
+        fun_l19_n214(x)
+    end
+end
+
+def fun_l18_n449(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n650(x)
+    end
+end
+
+def fun_l18_n450(x)
+    if (x < 1)
+        fun_l19_n875(x)
+    else
+        fun_l19_n697(x)
+    end
+end
+
+def fun_l18_n451(x)
+    if (x < 1)
+        fun_l19_n799(x)
+    else
+        fun_l19_n661(x)
+    end
+end
+
+def fun_l18_n452(x)
+    if (x < 1)
+        fun_l19_n677(x)
+    else
+        fun_l19_n750(x)
+    end
+end
+
+def fun_l18_n453(x)
+    if (x < 1)
+        fun_l19_n530(x)
+    else
+        fun_l19_n110(x)
+    end
+end
+
+def fun_l18_n454(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n381(x)
+    end
+end
+
+def fun_l18_n455(x)
+    if (x < 1)
+        fun_l19_n680(x)
+    else
+        fun_l19_n201(x)
+    end
+end
+
+def fun_l18_n456(x)
+    if (x < 1)
+        fun_l19_n246(x)
+    else
+        fun_l19_n972(x)
+    end
+end
+
+def fun_l18_n457(x)
+    if (x < 1)
+        fun_l19_n656(x)
+    else
+        fun_l19_n451(x)
+    end
+end
+
+def fun_l18_n458(x)
+    if (x < 1)
+        fun_l19_n612(x)
+    else
+        fun_l19_n288(x)
+    end
+end
+
+def fun_l18_n459(x)
+    if (x < 1)
+        fun_l19_n612(x)
+    else
+        fun_l19_n150(x)
+    end
+end
+
+def fun_l18_n460(x)
+    if (x < 1)
+        fun_l19_n549(x)
+    else
+        fun_l19_n917(x)
+    end
+end
+
+def fun_l18_n461(x)
+    if (x < 1)
+        fun_l19_n661(x)
+    else
+        fun_l19_n11(x)
+    end
+end
+
+def fun_l18_n462(x)
+    if (x < 1)
+        fun_l19_n172(x)
+    else
+        fun_l19_n561(x)
+    end
+end
+
+def fun_l18_n463(x)
+    if (x < 1)
+        fun_l19_n687(x)
+    else
+        fun_l19_n12(x)
+    end
+end
+
+def fun_l18_n464(x)
+    if (x < 1)
+        fun_l19_n57(x)
+    else
+        fun_l19_n835(x)
+    end
+end
+
+def fun_l18_n465(x)
+    if (x < 1)
+        fun_l19_n116(x)
+    else
+        fun_l19_n993(x)
+    end
+end
+
+def fun_l18_n466(x)
+    if (x < 1)
+        fun_l19_n932(x)
+    else
+        fun_l19_n623(x)
+    end
+end
+
+def fun_l18_n467(x)
+    if (x < 1)
+        fun_l19_n839(x)
+    else
+        fun_l19_n70(x)
+    end
+end
+
+def fun_l18_n468(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n193(x)
+    end
+end
+
+def fun_l18_n469(x)
+    if (x < 1)
+        fun_l19_n762(x)
+    else
+        fun_l19_n654(x)
+    end
+end
+
+def fun_l18_n470(x)
+    if (x < 1)
+        fun_l19_n656(x)
+    else
+        fun_l19_n42(x)
+    end
+end
+
+def fun_l18_n471(x)
+    if (x < 1)
+        fun_l19_n959(x)
+    else
+        fun_l19_n368(x)
+    end
+end
+
+def fun_l18_n472(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n357(x)
+    end
+end
+
+def fun_l18_n473(x)
+    if (x < 1)
+        fun_l19_n394(x)
+    else
+        fun_l19_n313(x)
+    end
+end
+
+def fun_l18_n474(x)
+    if (x < 1)
+        fun_l19_n826(x)
+    else
+        fun_l19_n33(x)
+    end
+end
+
+def fun_l18_n475(x)
+    if (x < 1)
+        fun_l19_n202(x)
+    else
+        fun_l19_n455(x)
+    end
+end
+
+def fun_l18_n476(x)
+    if (x < 1)
+        fun_l19_n855(x)
+    else
+        fun_l19_n375(x)
+    end
+end
+
+def fun_l18_n477(x)
+    if (x < 1)
+        fun_l19_n554(x)
+    else
+        fun_l19_n176(x)
+    end
+end
+
+def fun_l18_n478(x)
+    if (x < 1)
+        fun_l19_n705(x)
+    else
+        fun_l19_n509(x)
+    end
+end
+
+def fun_l18_n479(x)
+    if (x < 1)
+        fun_l19_n473(x)
+    else
+        fun_l19_n123(x)
+    end
+end
+
+def fun_l18_n480(x)
+    if (x < 1)
+        fun_l19_n108(x)
+    else
+        fun_l19_n125(x)
+    end
+end
+
+def fun_l18_n481(x)
+    if (x < 1)
+        fun_l19_n476(x)
+    else
+        fun_l19_n657(x)
+    end
+end
+
+def fun_l18_n482(x)
+    if (x < 1)
+        fun_l19_n800(x)
+    else
+        fun_l19_n691(x)
+    end
+end
+
+def fun_l18_n483(x)
+    if (x < 1)
+        fun_l19_n343(x)
+    else
+        fun_l19_n573(x)
+    end
+end
+
+def fun_l18_n484(x)
+    if (x < 1)
+        fun_l19_n654(x)
+    else
+        fun_l19_n114(x)
+    end
+end
+
+def fun_l18_n485(x)
+    if (x < 1)
+        fun_l19_n231(x)
+    else
+        fun_l19_n291(x)
+    end
+end
+
+def fun_l18_n486(x)
+    if (x < 1)
+        fun_l19_n877(x)
+    else
+        fun_l19_n628(x)
+    end
+end
+
+def fun_l18_n487(x)
+    if (x < 1)
+        fun_l19_n35(x)
+    else
+        fun_l19_n992(x)
+    end
+end
+
+def fun_l18_n488(x)
+    if (x < 1)
+        fun_l19_n592(x)
+    else
+        fun_l19_n951(x)
+    end
+end
+
+def fun_l18_n489(x)
+    if (x < 1)
+        fun_l19_n292(x)
+    else
+        fun_l19_n768(x)
+    end
+end
+
+def fun_l18_n490(x)
+    if (x < 1)
+        fun_l19_n191(x)
+    else
+        fun_l19_n759(x)
+    end
+end
+
+def fun_l18_n491(x)
+    if (x < 1)
+        fun_l19_n474(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n492(x)
+    if (x < 1)
+        fun_l19_n556(x)
+    else
+        fun_l19_n691(x)
+    end
+end
+
+def fun_l18_n493(x)
+    if (x < 1)
+        fun_l19_n717(x)
+    else
+        fun_l19_n714(x)
+    end
+end
+
+def fun_l18_n494(x)
+    if (x < 1)
+        fun_l19_n542(x)
+    else
+        fun_l19_n505(x)
+    end
+end
+
+def fun_l18_n495(x)
+    if (x < 1)
+        fun_l19_n154(x)
+    else
+        fun_l19_n500(x)
+    end
+end
+
+def fun_l18_n496(x)
+    if (x < 1)
+        fun_l19_n311(x)
+    else
+        fun_l19_n458(x)
+    end
+end
+
+def fun_l18_n497(x)
+    if (x < 1)
+        fun_l19_n523(x)
+    else
+        fun_l19_n475(x)
+    end
+end
+
+def fun_l18_n498(x)
+    if (x < 1)
+        fun_l19_n101(x)
+    else
+        fun_l19_n478(x)
+    end
+end
+
+def fun_l18_n499(x)
+    if (x < 1)
+        fun_l19_n243(x)
+    else
+        fun_l19_n586(x)
+    end
+end
+
+def fun_l18_n500(x)
+    if (x < 1)
+        fun_l19_n263(x)
+    else
+        fun_l19_n888(x)
+    end
+end
+
+def fun_l18_n501(x)
+    if (x < 1)
+        fun_l19_n415(x)
+    else
+        fun_l19_n808(x)
+    end
+end
+
+def fun_l18_n502(x)
+    if (x < 1)
+        fun_l19_n38(x)
+    else
+        fun_l19_n640(x)
+    end
+end
+
+def fun_l18_n503(x)
+    if (x < 1)
+        fun_l19_n218(x)
+    else
+        fun_l19_n577(x)
+    end
+end
+
+def fun_l18_n504(x)
+    if (x < 1)
+        fun_l19_n723(x)
+    else
+        fun_l19_n594(x)
+    end
+end
+
+def fun_l18_n505(x)
+    if (x < 1)
+        fun_l19_n392(x)
+    else
+        fun_l19_n984(x)
+    end
+end
+
+def fun_l18_n506(x)
+    if (x < 1)
+        fun_l19_n310(x)
+    else
+        fun_l19_n668(x)
+    end
+end
+
+def fun_l18_n507(x)
+    if (x < 1)
+        fun_l19_n278(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n508(x)
+    if (x < 1)
+        fun_l19_n230(x)
+    else
+        fun_l19_n479(x)
+    end
+end
+
+def fun_l18_n509(x)
+    if (x < 1)
+        fun_l19_n63(x)
+    else
+        fun_l19_n774(x)
+    end
+end
+
+def fun_l18_n510(x)
+    if (x < 1)
+        fun_l19_n607(x)
+    else
+        fun_l19_n433(x)
+    end
+end
+
+def fun_l18_n511(x)
+    if (x < 1)
+        fun_l19_n28(x)
+    else
+        fun_l19_n672(x)
+    end
+end
+
+def fun_l18_n512(x)
+    if (x < 1)
+        fun_l19_n684(x)
+    else
+        fun_l19_n247(x)
+    end
+end
+
+def fun_l18_n513(x)
+    if (x < 1)
+        fun_l19_n181(x)
+    else
+        fun_l19_n649(x)
+    end
+end
+
+def fun_l18_n514(x)
+    if (x < 1)
+        fun_l19_n787(x)
+    else
+        fun_l19_n281(x)
+    end
+end
+
+def fun_l18_n515(x)
+    if (x < 1)
+        fun_l19_n191(x)
+    else
+        fun_l19_n848(x)
+    end
+end
+
+def fun_l18_n516(x)
+    if (x < 1)
+        fun_l19_n796(x)
+    else
+        fun_l19_n572(x)
+    end
+end
+
+def fun_l18_n517(x)
+    if (x < 1)
+        fun_l19_n780(x)
+    else
+        fun_l19_n816(x)
+    end
+end
+
+def fun_l18_n518(x)
+    if (x < 1)
+        fun_l19_n429(x)
+    else
+        fun_l19_n681(x)
+    end
+end
+
+def fun_l18_n519(x)
+    if (x < 1)
+        fun_l19_n476(x)
+    else
+        fun_l19_n954(x)
+    end
+end
+
+def fun_l18_n520(x)
+    if (x < 1)
+        fun_l19_n537(x)
+    else
+        fun_l19_n690(x)
+    end
+end
+
+def fun_l18_n521(x)
+    if (x < 1)
+        fun_l19_n657(x)
+    else
+        fun_l19_n293(x)
+    end
+end
+
+def fun_l18_n522(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n685(x)
+    end
+end
+
+def fun_l18_n523(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n184(x)
+    end
+end
+
+def fun_l18_n524(x)
+    if (x < 1)
+        fun_l19_n6(x)
+    else
+        fun_l19_n970(x)
+    end
+end
+
+def fun_l18_n525(x)
+    if (x < 1)
+        fun_l19_n395(x)
+    else
+        fun_l19_n570(x)
+    end
+end
+
+def fun_l18_n526(x)
+    if (x < 1)
+        fun_l19_n837(x)
+    else
+        fun_l19_n992(x)
+    end
+end
+
+def fun_l18_n527(x)
+    if (x < 1)
+        fun_l19_n827(x)
+    else
+        fun_l19_n119(x)
+    end
+end
+
+def fun_l18_n528(x)
+    if (x < 1)
+        fun_l19_n819(x)
+    else
+        fun_l19_n382(x)
+    end
+end
+
+def fun_l18_n529(x)
+    if (x < 1)
+        fun_l19_n365(x)
+    else
+        fun_l19_n713(x)
+    end
+end
+
+def fun_l18_n530(x)
+    if (x < 1)
+        fun_l19_n223(x)
+    else
+        fun_l19_n346(x)
+    end
+end
+
+def fun_l18_n531(x)
+    if (x < 1)
+        fun_l19_n624(x)
+    else
+        fun_l19_n671(x)
+    end
+end
+
+def fun_l18_n532(x)
+    if (x < 1)
+        fun_l19_n522(x)
+    else
+        fun_l19_n354(x)
+    end
+end
+
+def fun_l18_n533(x)
+    if (x < 1)
+        fun_l19_n324(x)
+    else
+        fun_l19_n602(x)
+    end
+end
+
+def fun_l18_n534(x)
+    if (x < 1)
+        fun_l19_n138(x)
+    else
+        fun_l19_n259(x)
+    end
+end
+
+def fun_l18_n535(x)
+    if (x < 1)
+        fun_l19_n692(x)
+    else
+        fun_l19_n810(x)
+    end
+end
+
+def fun_l18_n536(x)
+    if (x < 1)
+        fun_l19_n694(x)
+    else
+        fun_l19_n39(x)
+    end
+end
+
+def fun_l18_n537(x)
+    if (x < 1)
+        fun_l19_n441(x)
+    else
+        fun_l19_n158(x)
+    end
+end
+
+def fun_l18_n538(x)
+    if (x < 1)
+        fun_l19_n609(x)
+    else
+        fun_l19_n54(x)
+    end
+end
+
+def fun_l18_n539(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n206(x)
+    end
+end
+
+def fun_l18_n540(x)
+    if (x < 1)
+        fun_l19_n548(x)
+    else
+        fun_l19_n558(x)
+    end
+end
+
+def fun_l18_n541(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n721(x)
+    end
+end
+
+def fun_l18_n542(x)
+    if (x < 1)
+        fun_l19_n50(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n543(x)
+    if (x < 1)
+        fun_l19_n774(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n544(x)
+    if (x < 1)
+        fun_l19_n151(x)
+    else
+        fun_l19_n75(x)
+    end
+end
+
+def fun_l18_n545(x)
+    if (x < 1)
+        fun_l19_n162(x)
+    else
+        fun_l19_n550(x)
+    end
+end
+
+def fun_l18_n546(x)
+    if (x < 1)
+        fun_l19_n892(x)
+    else
+        fun_l19_n322(x)
+    end
+end
+
+def fun_l18_n547(x)
+    if (x < 1)
+        fun_l19_n15(x)
+    else
+        fun_l19_n854(x)
+    end
+end
+
+def fun_l18_n548(x)
+    if (x < 1)
+        fun_l19_n54(x)
+    else
+        fun_l19_n627(x)
+    end
+end
+
+def fun_l18_n549(x)
+    if (x < 1)
+        fun_l19_n847(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n550(x)
+    if (x < 1)
+        fun_l19_n796(x)
+    else
+        fun_l19_n895(x)
+    end
+end
+
+def fun_l18_n551(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n854(x)
+    end
+end
+
+def fun_l18_n552(x)
+    if (x < 1)
+        fun_l19_n378(x)
+    else
+        fun_l19_n449(x)
+    end
+end
+
+def fun_l18_n553(x)
+    if (x < 1)
+        fun_l19_n188(x)
+    else
+        fun_l19_n65(x)
+    end
+end
+
+def fun_l18_n554(x)
+    if (x < 1)
+        fun_l19_n606(x)
+    else
+        fun_l19_n292(x)
+    end
+end
+
+def fun_l18_n555(x)
+    if (x < 1)
+        fun_l19_n718(x)
+    else
+        fun_l19_n926(x)
+    end
+end
+
+def fun_l18_n556(x)
+    if (x < 1)
+        fun_l19_n765(x)
+    else
+        fun_l19_n975(x)
+    end
+end
+
+def fun_l18_n557(x)
+    if (x < 1)
+        fun_l19_n987(x)
+    else
+        fun_l19_n152(x)
+    end
+end
+
+def fun_l18_n558(x)
+    if (x < 1)
+        fun_l19_n978(x)
+    else
+        fun_l19_n861(x)
+    end
+end
+
+def fun_l18_n559(x)
+    if (x < 1)
+        fun_l19_n563(x)
+    else
+        fun_l19_n532(x)
+    end
+end
+
+def fun_l18_n560(x)
+    if (x < 1)
+        fun_l19_n492(x)
+    else
+        fun_l19_n337(x)
+    end
+end
+
+def fun_l18_n561(x)
+    if (x < 1)
+        fun_l19_n967(x)
+    else
+        fun_l19_n33(x)
+    end
+end
+
+def fun_l18_n562(x)
+    if (x < 1)
+        fun_l19_n509(x)
+    else
+        fun_l19_n212(x)
+    end
+end
+
+def fun_l18_n563(x)
+    if (x < 1)
+        fun_l19_n55(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n564(x)
+    if (x < 1)
+        fun_l19_n263(x)
+    else
+        fun_l19_n386(x)
+    end
+end
+
+def fun_l18_n565(x)
+    if (x < 1)
+        fun_l19_n292(x)
+    else
+        fun_l19_n576(x)
+    end
+end
+
+def fun_l18_n566(x)
+    if (x < 1)
+        fun_l19_n16(x)
+    else
+        fun_l19_n180(x)
+    end
+end
+
+def fun_l18_n567(x)
+    if (x < 1)
+        fun_l19_n359(x)
+    else
+        fun_l19_n398(x)
+    end
+end
+
+def fun_l18_n568(x)
+    if (x < 1)
+        fun_l19_n799(x)
+    else
+        fun_l19_n616(x)
+    end
+end
+
+def fun_l18_n569(x)
+    if (x < 1)
+        fun_l19_n751(x)
+    else
+        fun_l19_n539(x)
+    end
+end
+
+def fun_l18_n570(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n197(x)
+    end
+end
+
+def fun_l18_n571(x)
+    if (x < 1)
+        fun_l19_n88(x)
+    else
+        fun_l19_n565(x)
+    end
+end
+
+def fun_l18_n572(x)
+    if (x < 1)
+        fun_l19_n213(x)
+    else
+        fun_l19_n137(x)
+    end
+end
+
+def fun_l18_n573(x)
+    if (x < 1)
+        fun_l19_n570(x)
+    else
+        fun_l19_n893(x)
+    end
+end
+
+def fun_l18_n574(x)
+    if (x < 1)
+        fun_l19_n436(x)
+    else
+        fun_l19_n285(x)
+    end
+end
+
+def fun_l18_n575(x)
+    if (x < 1)
+        fun_l19_n787(x)
+    else
+        fun_l19_n541(x)
+    end
+end
+
+def fun_l18_n576(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n371(x)
+    end
+end
+
+def fun_l18_n577(x)
+    if (x < 1)
+        fun_l19_n542(x)
+    else
+        fun_l19_n431(x)
+    end
+end
+
+def fun_l18_n578(x)
+    if (x < 1)
+        fun_l19_n829(x)
+    else
+        fun_l19_n415(x)
+    end
+end
+
+def fun_l18_n579(x)
+    if (x < 1)
+        fun_l19_n925(x)
+    else
+        fun_l19_n862(x)
+    end
+end
+
+def fun_l18_n580(x)
+    if (x < 1)
+        fun_l19_n214(x)
+    else
+        fun_l19_n67(x)
+    end
+end
+
+def fun_l18_n581(x)
+    if (x < 1)
+        fun_l19_n734(x)
+    else
+        fun_l19_n220(x)
+    end
+end
+
+def fun_l18_n582(x)
+    if (x < 1)
+        fun_l19_n971(x)
+    else
+        fun_l19_n359(x)
+    end
+end
+
+def fun_l18_n583(x)
+    if (x < 1)
+        fun_l19_n293(x)
+    else
+        fun_l19_n286(x)
+    end
+end
+
+def fun_l18_n584(x)
+    if (x < 1)
+        fun_l19_n618(x)
+    else
+        fun_l19_n866(x)
+    end
+end
+
+def fun_l18_n585(x)
+    if (x < 1)
+        fun_l19_n315(x)
+    else
+        fun_l19_n594(x)
+    end
+end
+
+def fun_l18_n586(x)
+    if (x < 1)
+        fun_l19_n230(x)
+    else
+        fun_l19_n450(x)
+    end
+end
+
+def fun_l18_n587(x)
+    if (x < 1)
+        fun_l19_n805(x)
+    else
+        fun_l19_n429(x)
+    end
+end
+
+def fun_l18_n588(x)
+    if (x < 1)
+        fun_l19_n782(x)
+    else
+        fun_l19_n133(x)
+    end
+end
+
+def fun_l18_n589(x)
+    if (x < 1)
+        fun_l19_n166(x)
+    else
+        fun_l19_n111(x)
+    end
+end
+
+def fun_l18_n590(x)
+    if (x < 1)
+        fun_l19_n26(x)
+    else
+        fun_l19_n678(x)
+    end
+end
+
+def fun_l18_n591(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n346(x)
+    end
+end
+
+def fun_l18_n592(x)
+    if (x < 1)
+        fun_l19_n882(x)
+    else
+        fun_l19_n930(x)
+    end
+end
+
+def fun_l18_n593(x)
+    if (x < 1)
+        fun_l19_n454(x)
+    else
+        fun_l19_n560(x)
+    end
+end
+
+def fun_l18_n594(x)
+    if (x < 1)
+        fun_l19_n881(x)
+    else
+        fun_l19_n929(x)
+    end
+end
+
+def fun_l18_n595(x)
+    if (x < 1)
+        fun_l19_n464(x)
+    else
+        fun_l19_n8(x)
+    end
+end
+
+def fun_l18_n596(x)
+    if (x < 1)
+        fun_l19_n247(x)
+    else
+        fun_l19_n48(x)
+    end
+end
+
+def fun_l18_n597(x)
+    if (x < 1)
+        fun_l19_n838(x)
+    else
+        fun_l19_n811(x)
+    end
+end
+
+def fun_l18_n598(x)
+    if (x < 1)
+        fun_l19_n493(x)
+    else
+        fun_l19_n975(x)
+    end
+end
+
+def fun_l18_n599(x)
+    if (x < 1)
+        fun_l19_n372(x)
+    else
+        fun_l19_n334(x)
+    end
+end
+
+def fun_l18_n600(x)
+    if (x < 1)
+        fun_l19_n971(x)
+    else
+        fun_l19_n198(x)
+    end
+end
+
+def fun_l18_n601(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n273(x)
+    end
+end
+
+def fun_l18_n602(x)
+    if (x < 1)
+        fun_l19_n778(x)
+    else
+        fun_l19_n815(x)
+    end
+end
+
+def fun_l18_n603(x)
+    if (x < 1)
+        fun_l19_n247(x)
+    else
+        fun_l19_n615(x)
+    end
+end
+
+def fun_l18_n604(x)
+    if (x < 1)
+        fun_l19_n659(x)
+    else
+        fun_l19_n613(x)
+    end
+end
+
+def fun_l18_n605(x)
+    if (x < 1)
+        fun_l19_n814(x)
+    else
+        fun_l19_n742(x)
+    end
+end
+
+def fun_l18_n606(x)
+    if (x < 1)
+        fun_l19_n988(x)
+    else
+        fun_l19_n877(x)
+    end
+end
+
+def fun_l18_n607(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n491(x)
+    end
+end
+
+def fun_l18_n608(x)
+    if (x < 1)
+        fun_l19_n600(x)
+    else
+        fun_l19_n381(x)
+    end
+end
+
+def fun_l18_n609(x)
+    if (x < 1)
+        fun_l19_n695(x)
+    else
+        fun_l19_n343(x)
+    end
+end
+
+def fun_l18_n610(x)
+    if (x < 1)
+        fun_l19_n686(x)
+    else
+        fun_l19_n154(x)
+    end
+end
+
+def fun_l18_n611(x)
+    if (x < 1)
+        fun_l19_n413(x)
+    else
+        fun_l19_n364(x)
+    end
+end
+
+def fun_l18_n612(x)
+    if (x < 1)
+        fun_l19_n86(x)
+    else
+        fun_l19_n478(x)
+    end
+end
+
+def fun_l18_n613(x)
+    if (x < 1)
+        fun_l19_n288(x)
+    else
+        fun_l19_n134(x)
+    end
+end
+
+def fun_l18_n614(x)
+    if (x < 1)
+        fun_l19_n71(x)
+    else
+        fun_l19_n95(x)
+    end
+end
+
+def fun_l18_n615(x)
+    if (x < 1)
+        fun_l19_n716(x)
+    else
+        fun_l19_n697(x)
+    end
+end
+
+def fun_l18_n616(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n365(x)
+    end
+end
+
+def fun_l18_n617(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n117(x)
+    end
+end
+
+def fun_l18_n618(x)
+    if (x < 1)
+        fun_l19_n304(x)
+    else
+        fun_l19_n115(x)
+    end
+end
+
+def fun_l18_n619(x)
+    if (x < 1)
+        fun_l19_n322(x)
+    else
+        fun_l19_n105(x)
+    end
+end
+
+def fun_l18_n620(x)
+    if (x < 1)
+        fun_l19_n213(x)
+    else
+        fun_l19_n122(x)
+    end
+end
+
+def fun_l18_n621(x)
+    if (x < 1)
+        fun_l19_n675(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n622(x)
+    if (x < 1)
+        fun_l19_n660(x)
+    else
+        fun_l19_n895(x)
+    end
+end
+
+def fun_l18_n623(x)
+    if (x < 1)
+        fun_l19_n656(x)
+    else
+        fun_l19_n698(x)
+    end
+end
+
+def fun_l18_n624(x)
+    if (x < 1)
+        fun_l19_n575(x)
+    else
+        fun_l19_n274(x)
+    end
+end
+
+def fun_l18_n625(x)
+    if (x < 1)
+        fun_l19_n44(x)
+    else
+        fun_l19_n78(x)
+    end
+end
+
+def fun_l18_n626(x)
+    if (x < 1)
+        fun_l19_n326(x)
+    else
+        fun_l19_n76(x)
+    end
+end
+
+def fun_l18_n627(x)
+    if (x < 1)
+        fun_l19_n365(x)
+    else
+        fun_l19_n453(x)
+    end
+end
+
+def fun_l18_n628(x)
+    if (x < 1)
+        fun_l19_n306(x)
+    else
+        fun_l19_n63(x)
+    end
+end
+
+def fun_l18_n629(x)
+    if (x < 1)
+        fun_l19_n116(x)
+    else
+        fun_l19_n577(x)
+    end
+end
+
+def fun_l18_n630(x)
+    if (x < 1)
+        fun_l19_n625(x)
+    else
+        fun_l19_n321(x)
+    end
+end
+
+def fun_l18_n631(x)
+    if (x < 1)
+        fun_l19_n328(x)
+    else
+        fun_l19_n989(x)
+    end
+end
+
+def fun_l18_n632(x)
+    if (x < 1)
+        fun_l19_n216(x)
+    else
+        fun_l19_n375(x)
+    end
+end
+
+def fun_l18_n633(x)
+    if (x < 1)
+        fun_l19_n942(x)
+    else
+        fun_l19_n17(x)
+    end
+end
+
+def fun_l18_n634(x)
+    if (x < 1)
+        fun_l19_n821(x)
+    else
+        fun_l19_n132(x)
+    end
+end
+
+def fun_l18_n635(x)
+    if (x < 1)
+        fun_l19_n164(x)
+    else
+        fun_l19_n679(x)
+    end
+end
+
+def fun_l18_n636(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n404(x)
+    end
+end
+
+def fun_l18_n637(x)
+    if (x < 1)
+        fun_l19_n715(x)
+    else
+        fun_l19_n955(x)
+    end
+end
+
+def fun_l18_n638(x)
+    if (x < 1)
+        fun_l19_n297(x)
+    else
+        fun_l19_n349(x)
+    end
+end
+
+def fun_l18_n639(x)
+    if (x < 1)
+        fun_l19_n835(x)
+    else
+        fun_l19_n965(x)
+    end
+end
+
+def fun_l18_n640(x)
+    if (x < 1)
+        fun_l19_n778(x)
+    else
+        fun_l19_n572(x)
+    end
+end
+
+def fun_l18_n641(x)
+    if (x < 1)
+        fun_l19_n51(x)
+    else
+        fun_l19_n497(x)
+    end
+end
+
+def fun_l18_n642(x)
+    if (x < 1)
+        fun_l19_n390(x)
+    else
+        fun_l19_n341(x)
+    end
+end
+
+def fun_l18_n643(x)
+    if (x < 1)
+        fun_l19_n961(x)
+    else
+        fun_l19_n966(x)
+    end
+end
+
+def fun_l18_n644(x)
+    if (x < 1)
+        fun_l19_n832(x)
+    else
+        fun_l19_n279(x)
+    end
+end
+
+def fun_l18_n645(x)
+    if (x < 1)
+        fun_l19_n0(x)
+    else
+        fun_l19_n266(x)
+    end
+end
+
+def fun_l18_n646(x)
+    if (x < 1)
+        fun_l19_n512(x)
+    else
+        fun_l19_n988(x)
+    end
+end
+
+def fun_l18_n647(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n390(x)
+    end
+end
+
+def fun_l18_n648(x)
+    if (x < 1)
+        fun_l19_n61(x)
+    else
+        fun_l19_n188(x)
+    end
+end
+
+def fun_l18_n649(x)
+    if (x < 1)
+        fun_l19_n772(x)
+    else
+        fun_l19_n457(x)
+    end
+end
+
+def fun_l18_n650(x)
+    if (x < 1)
+        fun_l19_n768(x)
+    else
+        fun_l19_n624(x)
+    end
+end
+
+def fun_l18_n651(x)
+    if (x < 1)
+        fun_l19_n30(x)
+    else
+        fun_l19_n663(x)
+    end
+end
+
+def fun_l18_n652(x)
+    if (x < 1)
+        fun_l19_n42(x)
+    else
+        fun_l19_n781(x)
+    end
+end
+
+def fun_l18_n653(x)
+    if (x < 1)
+        fun_l19_n59(x)
+    else
+        fun_l19_n99(x)
+    end
+end
+
+def fun_l18_n654(x)
+    if (x < 1)
+        fun_l19_n81(x)
+    else
+        fun_l19_n368(x)
+    end
+end
+
+def fun_l18_n655(x)
+    if (x < 1)
+        fun_l19_n0(x)
+    else
+        fun_l19_n321(x)
+    end
+end
+
+def fun_l18_n656(x)
+    if (x < 1)
+        fun_l19_n344(x)
+    else
+        fun_l19_n996(x)
+    end
+end
+
+def fun_l18_n657(x)
+    if (x < 1)
+        fun_l19_n384(x)
+    else
+        fun_l19_n123(x)
+    end
+end
+
+def fun_l18_n658(x)
+    if (x < 1)
+        fun_l19_n336(x)
+    else
+        fun_l19_n928(x)
+    end
+end
+
+def fun_l18_n659(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n370(x)
+    end
+end
+
+def fun_l18_n660(x)
+    if (x < 1)
+        fun_l19_n508(x)
+    else
+        fun_l19_n200(x)
+    end
+end
+
+def fun_l18_n661(x)
+    if (x < 1)
+        fun_l19_n674(x)
+    else
+        fun_l19_n95(x)
+    end
+end
+
+def fun_l18_n662(x)
+    if (x < 1)
+        fun_l19_n839(x)
+    else
+        fun_l19_n737(x)
+    end
+end
+
+def fun_l18_n663(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n77(x)
+    end
+end
+
+def fun_l18_n664(x)
+    if (x < 1)
+        fun_l19_n402(x)
+    else
+        fun_l19_n7(x)
+    end
+end
+
+def fun_l18_n665(x)
+    if (x < 1)
+        fun_l19_n357(x)
+    else
+        fun_l19_n961(x)
+    end
+end
+
+def fun_l18_n666(x)
+    if (x < 1)
+        fun_l19_n72(x)
+    else
+        fun_l19_n535(x)
+    end
+end
+
+def fun_l18_n667(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n450(x)
+    end
+end
+
+def fun_l18_n668(x)
+    if (x < 1)
+        fun_l19_n823(x)
+    else
+        fun_l19_n301(x)
+    end
+end
+
+def fun_l18_n669(x)
+    if (x < 1)
+        fun_l19_n36(x)
+    else
+        fun_l19_n660(x)
+    end
+end
+
+def fun_l18_n670(x)
+    if (x < 1)
+        fun_l19_n322(x)
+    else
+        fun_l19_n626(x)
+    end
+end
+
+def fun_l18_n671(x)
+    if (x < 1)
+        fun_l19_n408(x)
+    else
+        fun_l19_n872(x)
+    end
+end
+
+def fun_l18_n672(x)
+    if (x < 1)
+        fun_l19_n614(x)
+    else
+        fun_l19_n567(x)
+    end
+end
+
+def fun_l18_n673(x)
+    if (x < 1)
+        fun_l19_n601(x)
+    else
+        fun_l19_n429(x)
+    end
+end
+
+def fun_l18_n674(x)
+    if (x < 1)
+        fun_l19_n658(x)
+    else
+        fun_l19_n424(x)
+    end
+end
+
+def fun_l18_n675(x)
+    if (x < 1)
+        fun_l19_n248(x)
+    else
+        fun_l19_n29(x)
+    end
+end
+
+def fun_l18_n676(x)
+    if (x < 1)
+        fun_l19_n206(x)
+    else
+        fun_l19_n838(x)
+    end
+end
+
+def fun_l18_n677(x)
+    if (x < 1)
+        fun_l19_n354(x)
+    else
+        fun_l19_n700(x)
+    end
+end
+
+def fun_l18_n678(x)
+    if (x < 1)
+        fun_l19_n264(x)
+    else
+        fun_l19_n591(x)
+    end
+end
+
+def fun_l18_n679(x)
+    if (x < 1)
+        fun_l19_n73(x)
+    else
+        fun_l19_n419(x)
+    end
+end
+
+def fun_l18_n680(x)
+    if (x < 1)
+        fun_l19_n260(x)
+    else
+        fun_l19_n902(x)
+    end
+end
+
+def fun_l18_n681(x)
+    if (x < 1)
+        fun_l19_n776(x)
+    else
+        fun_l19_n148(x)
+    end
+end
+
+def fun_l18_n682(x)
+    if (x < 1)
+        fun_l19_n819(x)
+    else
+        fun_l19_n743(x)
+    end
+end
+
+def fun_l18_n683(x)
+    if (x < 1)
+        fun_l19_n831(x)
+    else
+        fun_l19_n194(x)
+    end
+end
+
+def fun_l18_n684(x)
+    if (x < 1)
+        fun_l19_n652(x)
+    else
+        fun_l19_n229(x)
+    end
+end
+
+def fun_l18_n685(x)
+    if (x < 1)
+        fun_l19_n533(x)
+    else
+        fun_l19_n600(x)
+    end
+end
+
+def fun_l18_n686(x)
+    if (x < 1)
+        fun_l19_n45(x)
+    else
+        fun_l19_n623(x)
+    end
+end
+
+def fun_l18_n687(x)
+    if (x < 1)
+        fun_l19_n287(x)
+    else
+        fun_l19_n443(x)
+    end
+end
+
+def fun_l18_n688(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n819(x)
+    end
+end
+
+def fun_l18_n689(x)
+    if (x < 1)
+        fun_l19_n872(x)
+    else
+        fun_l19_n944(x)
+    end
+end
+
+def fun_l18_n690(x)
+    if (x < 1)
+        fun_l19_n352(x)
+    else
+        fun_l19_n49(x)
+    end
+end
+
+def fun_l18_n691(x)
+    if (x < 1)
+        fun_l19_n438(x)
+    else
+        fun_l19_n592(x)
+    end
+end
+
+def fun_l18_n692(x)
+    if (x < 1)
+        fun_l19_n717(x)
+    else
+        fun_l19_n30(x)
+    end
+end
+
+def fun_l18_n693(x)
+    if (x < 1)
+        fun_l19_n132(x)
+    else
+        fun_l19_n830(x)
+    end
+end
+
+def fun_l18_n694(x)
+    if (x < 1)
+        fun_l19_n17(x)
+    else
+        fun_l19_n649(x)
+    end
+end
+
+def fun_l18_n695(x)
+    if (x < 1)
+        fun_l19_n883(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n696(x)
+    if (x < 1)
+        fun_l19_n354(x)
+    else
+        fun_l19_n927(x)
+    end
+end
+
+def fun_l18_n697(x)
+    if (x < 1)
+        fun_l19_n534(x)
+    else
+        fun_l19_n192(x)
+    end
+end
+
+def fun_l18_n698(x)
+    if (x < 1)
+        fun_l19_n911(x)
+    else
+        fun_l19_n386(x)
+    end
+end
+
+def fun_l18_n699(x)
+    if (x < 1)
+        fun_l19_n1(x)
+    else
+        fun_l19_n253(x)
+    end
+end
+
+def fun_l18_n700(x)
+    if (x < 1)
+        fun_l19_n318(x)
+    else
+        fun_l19_n323(x)
+    end
+end
+
+def fun_l18_n701(x)
+    if (x < 1)
+        fun_l19_n158(x)
+    else
+        fun_l19_n61(x)
+    end
+end
+
+def fun_l18_n702(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n842(x)
+    end
+end
+
+def fun_l18_n703(x)
+    if (x < 1)
+        fun_l19_n918(x)
+    else
+        fun_l19_n231(x)
+    end
+end
+
+def fun_l18_n704(x)
+    if (x < 1)
+        fun_l19_n136(x)
+    else
+        fun_l19_n28(x)
+    end
+end
+
+def fun_l18_n705(x)
+    if (x < 1)
+        fun_l19_n451(x)
+    else
+        fun_l19_n328(x)
+    end
+end
+
+def fun_l18_n706(x)
+    if (x < 1)
+        fun_l19_n182(x)
+    else
+        fun_l19_n434(x)
+    end
+end
+
+def fun_l18_n707(x)
+    if (x < 1)
+        fun_l19_n368(x)
+    else
+        fun_l19_n302(x)
+    end
+end
+
+def fun_l18_n708(x)
+    if (x < 1)
+        fun_l19_n370(x)
+    else
+        fun_l19_n291(x)
+    end
+end
+
+def fun_l18_n709(x)
+    if (x < 1)
+        fun_l19_n104(x)
+    else
+        fun_l19_n530(x)
+    end
+end
+
+def fun_l18_n710(x)
+    if (x < 1)
+        fun_l19_n712(x)
+    else
+        fun_l19_n325(x)
+    end
+end
+
+def fun_l18_n711(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n299(x)
+    end
+end
+
+def fun_l18_n712(x)
+    if (x < 1)
+        fun_l19_n40(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n713(x)
+    if (x < 1)
+        fun_l19_n871(x)
+    else
+        fun_l19_n72(x)
+    end
+end
+
+def fun_l18_n714(x)
+    if (x < 1)
+        fun_l19_n137(x)
+    else
+        fun_l19_n195(x)
+    end
+end
+
+def fun_l18_n715(x)
+    if (x < 1)
+        fun_l19_n534(x)
+    else
+        fun_l19_n613(x)
+    end
+end
+
+def fun_l18_n716(x)
+    if (x < 1)
+        fun_l19_n591(x)
+    else
+        fun_l19_n899(x)
+    end
+end
+
+def fun_l18_n717(x)
+    if (x < 1)
+        fun_l19_n103(x)
+    else
+        fun_l19_n333(x)
+    end
+end
+
+def fun_l18_n718(x)
+    if (x < 1)
+        fun_l19_n470(x)
+    else
+        fun_l19_n576(x)
+    end
+end
+
+def fun_l18_n719(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n765(x)
+    end
+end
+
+def fun_l18_n720(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n720(x)
+    end
+end
+
+def fun_l18_n721(x)
+    if (x < 1)
+        fun_l19_n567(x)
+    else
+        fun_l19_n280(x)
+    end
+end
+
+def fun_l18_n722(x)
+    if (x < 1)
+        fun_l19_n642(x)
+    else
+        fun_l19_n700(x)
+    end
+end
+
+def fun_l18_n723(x)
+    if (x < 1)
+        fun_l19_n775(x)
+    else
+        fun_l19_n239(x)
+    end
+end
+
+def fun_l18_n724(x)
+    if (x < 1)
+        fun_l19_n346(x)
+    else
+        fun_l19_n974(x)
+    end
+end
+
+def fun_l18_n725(x)
+    if (x < 1)
+        fun_l19_n509(x)
+    else
+        fun_l19_n90(x)
+    end
+end
+
+def fun_l18_n726(x)
+    if (x < 1)
+        fun_l19_n834(x)
+    else
+        fun_l19_n793(x)
+    end
+end
+
+def fun_l18_n727(x)
+    if (x < 1)
+        fun_l19_n588(x)
+    else
+        fun_l19_n895(x)
+    end
+end
+
+def fun_l18_n728(x)
+    if (x < 1)
+        fun_l19_n18(x)
+    else
+        fun_l19_n218(x)
+    end
+end
+
+def fun_l18_n729(x)
+    if (x < 1)
+        fun_l19_n109(x)
+    else
+        fun_l19_n970(x)
+    end
+end
+
+def fun_l18_n730(x)
+    if (x < 1)
+        fun_l19_n721(x)
+    else
+        fun_l19_n81(x)
+    end
+end
+
+def fun_l18_n731(x)
+    if (x < 1)
+        fun_l19_n935(x)
+    else
+        fun_l19_n652(x)
+    end
+end
+
+def fun_l18_n732(x)
+    if (x < 1)
+        fun_l19_n821(x)
+    else
+        fun_l19_n32(x)
+    end
+end
+
+def fun_l18_n733(x)
+    if (x < 1)
+        fun_l19_n189(x)
+    else
+        fun_l19_n469(x)
+    end
+end
+
+def fun_l18_n734(x)
+    if (x < 1)
+        fun_l19_n11(x)
+    else
+        fun_l19_n741(x)
+    end
+end
+
+def fun_l18_n735(x)
+    if (x < 1)
+        fun_l19_n575(x)
+    else
+        fun_l19_n679(x)
+    end
+end
+
+def fun_l18_n736(x)
+    if (x < 1)
+        fun_l19_n442(x)
+    else
+        fun_l19_n652(x)
+    end
+end
+
+def fun_l18_n737(x)
+    if (x < 1)
+        fun_l19_n22(x)
+    else
+        fun_l19_n950(x)
+    end
+end
+
+def fun_l18_n738(x)
+    if (x < 1)
+        fun_l19_n605(x)
+    else
+        fun_l19_n16(x)
+    end
+end
+
+def fun_l18_n739(x)
+    if (x < 1)
+        fun_l19_n888(x)
+    else
+        fun_l19_n873(x)
+    end
+end
+
+def fun_l18_n740(x)
+    if (x < 1)
+        fun_l19_n355(x)
+    else
+        fun_l19_n558(x)
+    end
+end
+
+def fun_l18_n741(x)
+    if (x < 1)
+        fun_l19_n171(x)
+    else
+        fun_l19_n513(x)
+    end
+end
+
+def fun_l18_n742(x)
+    if (x < 1)
+        fun_l19_n843(x)
+    else
+        fun_l19_n833(x)
+    end
+end
+
+def fun_l18_n743(x)
+    if (x < 1)
+        fun_l19_n774(x)
+    else
+        fun_l19_n992(x)
+    end
+end
+
+def fun_l18_n744(x)
+    if (x < 1)
+        fun_l19_n505(x)
+    else
+        fun_l19_n353(x)
+    end
+end
+
+def fun_l18_n745(x)
+    if (x < 1)
+        fun_l19_n93(x)
+    else
+        fun_l19_n476(x)
+    end
+end
+
+def fun_l18_n746(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n233(x)
+    end
+end
+
+def fun_l18_n747(x)
+    if (x < 1)
+        fun_l19_n639(x)
+    else
+        fun_l19_n239(x)
+    end
+end
+
+def fun_l18_n748(x)
+    if (x < 1)
+        fun_l19_n318(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n749(x)
+    if (x < 1)
+        fun_l19_n80(x)
+    else
+        fun_l19_n252(x)
+    end
+end
+
+def fun_l18_n750(x)
+    if (x < 1)
+        fun_l19_n546(x)
+    else
+        fun_l19_n57(x)
+    end
+end
+
+def fun_l18_n751(x)
+    if (x < 1)
+        fun_l19_n620(x)
+    else
+        fun_l19_n732(x)
+    end
+end
+
+def fun_l18_n752(x)
+    if (x < 1)
+        fun_l19_n870(x)
+    else
+        fun_l19_n696(x)
+    end
+end
+
+def fun_l18_n753(x)
+    if (x < 1)
+        fun_l19_n633(x)
+    else
+        fun_l19_n547(x)
+    end
+end
+
+def fun_l18_n754(x)
+    if (x < 1)
+        fun_l19_n860(x)
+    else
+        fun_l19_n70(x)
+    end
+end
+
+def fun_l18_n755(x)
+    if (x < 1)
+        fun_l19_n4(x)
+    else
+        fun_l19_n560(x)
+    end
+end
+
+def fun_l18_n756(x)
+    if (x < 1)
+        fun_l19_n227(x)
+    else
+        fun_l19_n189(x)
+    end
+end
+
+def fun_l18_n757(x)
+    if (x < 1)
+        fun_l19_n560(x)
+    else
+        fun_l19_n467(x)
+    end
+end
+
+def fun_l18_n758(x)
+    if (x < 1)
+        fun_l19_n777(x)
+    else
+        fun_l19_n761(x)
+    end
+end
+
+def fun_l18_n759(x)
+    if (x < 1)
+        fun_l19_n626(x)
+    else
+        fun_l19_n391(x)
+    end
+end
+
+def fun_l18_n760(x)
+    if (x < 1)
+        fun_l19_n989(x)
+    else
+        fun_l19_n629(x)
+    end
+end
+
+def fun_l18_n761(x)
+    if (x < 1)
+        fun_l19_n509(x)
+    else
+        fun_l19_n268(x)
+    end
+end
+
+def fun_l18_n762(x)
+    if (x < 1)
+        fun_l19_n49(x)
+    else
+        fun_l19_n149(x)
+    end
+end
+
+def fun_l18_n763(x)
+    if (x < 1)
+        fun_l19_n614(x)
+    else
+        fun_l19_n490(x)
+    end
+end
+
+def fun_l18_n764(x)
+    if (x < 1)
+        fun_l19_n7(x)
+    else
+        fun_l19_n686(x)
+    end
+end
+
+def fun_l18_n765(x)
+    if (x < 1)
+        fun_l19_n93(x)
+    else
+        fun_l19_n334(x)
+    end
+end
+
+def fun_l18_n766(x)
+    if (x < 1)
+        fun_l19_n30(x)
+    else
+        fun_l19_n396(x)
+    end
+end
+
+def fun_l18_n767(x)
+    if (x < 1)
+        fun_l19_n437(x)
+    else
+        fun_l19_n614(x)
+    end
+end
+
+def fun_l18_n768(x)
+    if (x < 1)
+        fun_l19_n168(x)
+    else
+        fun_l19_n915(x)
+    end
+end
+
+def fun_l18_n769(x)
+    if (x < 1)
+        fun_l19_n465(x)
+    else
+        fun_l19_n816(x)
+    end
+end
+
+def fun_l18_n770(x)
+    if (x < 1)
+        fun_l19_n692(x)
+    else
+        fun_l19_n772(x)
+    end
+end
+
+def fun_l18_n771(x)
+    if (x < 1)
+        fun_l19_n196(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n772(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n592(x)
+    end
+end
+
+def fun_l18_n773(x)
+    if (x < 1)
+        fun_l19_n649(x)
+    else
+        fun_l19_n50(x)
+    end
+end
+
+def fun_l18_n774(x)
+    if (x < 1)
+        fun_l19_n102(x)
+    else
+        fun_l19_n843(x)
+    end
+end
+
+def fun_l18_n775(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n805(x)
+    end
+end
+
+def fun_l18_n776(x)
+    if (x < 1)
+        fun_l19_n449(x)
+    else
+        fun_l19_n425(x)
+    end
+end
+
+def fun_l18_n777(x)
+    if (x < 1)
+        fun_l19_n855(x)
+    else
+        fun_l19_n345(x)
+    end
+end
+
+def fun_l18_n778(x)
+    if (x < 1)
+        fun_l19_n714(x)
+    else
+        fun_l19_n499(x)
+    end
+end
+
+def fun_l18_n779(x)
+    if (x < 1)
+        fun_l19_n131(x)
+    else
+        fun_l19_n396(x)
+    end
+end
+
+def fun_l18_n780(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n851(x)
+    end
+end
+
+def fun_l18_n781(x)
+    if (x < 1)
+        fun_l19_n104(x)
+    else
+        fun_l19_n569(x)
+    end
+end
+
+def fun_l18_n782(x)
+    if (x < 1)
+        fun_l19_n121(x)
+    else
+        fun_l19_n690(x)
+    end
+end
+
+def fun_l18_n783(x)
+    if (x < 1)
+        fun_l19_n72(x)
+    else
+        fun_l19_n522(x)
+    end
+end
+
+def fun_l18_n784(x)
+    if (x < 1)
+        fun_l19_n212(x)
+    else
+        fun_l19_n199(x)
+    end
+end
+
+def fun_l18_n785(x)
+    if (x < 1)
+        fun_l19_n168(x)
+    else
+        fun_l19_n948(x)
+    end
+end
+
+def fun_l18_n786(x)
+    if (x < 1)
+        fun_l19_n288(x)
+    else
+        fun_l19_n631(x)
+    end
+end
+
+def fun_l18_n787(x)
+    if (x < 1)
+        fun_l19_n713(x)
+    else
+        fun_l19_n232(x)
+    end
+end
+
+def fun_l18_n788(x)
+    if (x < 1)
+        fun_l19_n6(x)
+    else
+        fun_l19_n725(x)
+    end
+end
+
+def fun_l18_n789(x)
+    if (x < 1)
+        fun_l19_n893(x)
+    else
+        fun_l19_n677(x)
+    end
+end
+
+def fun_l18_n790(x)
+    if (x < 1)
+        fun_l19_n734(x)
+    else
+        fun_l19_n589(x)
+    end
+end
+
+def fun_l18_n791(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n710(x)
+    end
+end
+
+def fun_l18_n792(x)
+    if (x < 1)
+        fun_l19_n373(x)
+    else
+        fun_l19_n226(x)
+    end
+end
+
+def fun_l18_n793(x)
+    if (x < 1)
+        fun_l19_n651(x)
+    else
+        fun_l19_n292(x)
+    end
+end
+
+def fun_l18_n794(x)
+    if (x < 1)
+        fun_l19_n625(x)
+    else
+        fun_l19_n494(x)
+    end
+end
+
+def fun_l18_n795(x)
+    if (x < 1)
+        fun_l19_n463(x)
+    else
+        fun_l19_n113(x)
+    end
+end
+
+def fun_l18_n796(x)
+    if (x < 1)
+        fun_l19_n857(x)
+    else
+        fun_l19_n561(x)
+    end
+end
+
+def fun_l18_n797(x)
+    if (x < 1)
+        fun_l19_n845(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n798(x)
+    if (x < 1)
+        fun_l19_n606(x)
+    else
+        fun_l19_n822(x)
+    end
+end
+
+def fun_l18_n799(x)
+    if (x < 1)
+        fun_l19_n649(x)
+    else
+        fun_l19_n610(x)
+    end
+end
+
+def fun_l18_n800(x)
+    if (x < 1)
+        fun_l19_n619(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n801(x)
+    if (x < 1)
+        fun_l19_n947(x)
+    else
+        fun_l19_n665(x)
+    end
+end
+
+def fun_l18_n802(x)
+    if (x < 1)
+        fun_l19_n869(x)
+    else
+        fun_l19_n928(x)
+    end
+end
+
+def fun_l18_n803(x)
+    if (x < 1)
+        fun_l19_n568(x)
+    else
+        fun_l19_n624(x)
+    end
+end
+
+def fun_l18_n804(x)
+    if (x < 1)
+        fun_l19_n724(x)
+    else
+        fun_l19_n104(x)
+    end
+end
+
+def fun_l18_n805(x)
+    if (x < 1)
+        fun_l19_n687(x)
+    else
+        fun_l19_n906(x)
+    end
+end
+
+def fun_l18_n806(x)
+    if (x < 1)
+        fun_l19_n387(x)
+    else
+        fun_l19_n317(x)
+    end
+end
+
+def fun_l18_n807(x)
+    if (x < 1)
+        fun_l19_n433(x)
+    else
+        fun_l19_n211(x)
+    end
+end
+
+def fun_l18_n808(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n848(x)
+    end
+end
+
+def fun_l18_n809(x)
+    if (x < 1)
+        fun_l19_n929(x)
+    else
+        fun_l19_n751(x)
+    end
+end
+
+def fun_l18_n810(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n97(x)
+    end
+end
+
+def fun_l18_n811(x)
+    if (x < 1)
+        fun_l19_n503(x)
+    else
+        fun_l19_n173(x)
+    end
+end
+
+def fun_l18_n812(x)
+    if (x < 1)
+        fun_l19_n431(x)
+    else
+        fun_l19_n553(x)
+    end
+end
+
+def fun_l18_n813(x)
+    if (x < 1)
+        fun_l19_n215(x)
+    else
+        fun_l19_n920(x)
+    end
+end
+
+def fun_l18_n814(x)
+    if (x < 1)
+        fun_l19_n952(x)
+    else
+        fun_l19_n484(x)
+    end
+end
+
+def fun_l18_n815(x)
+    if (x < 1)
+        fun_l19_n253(x)
+    else
+        fun_l19_n20(x)
+    end
+end
+
+def fun_l18_n816(x)
+    if (x < 1)
+        fun_l19_n853(x)
+    else
+        fun_l19_n902(x)
+    end
+end
+
+def fun_l18_n817(x)
+    if (x < 1)
+        fun_l19_n606(x)
+    else
+        fun_l19_n732(x)
+    end
+end
+
+def fun_l18_n818(x)
+    if (x < 1)
+        fun_l19_n227(x)
+    else
+        fun_l19_n908(x)
+    end
+end
+
+def fun_l18_n819(x)
+    if (x < 1)
+        fun_l19_n423(x)
+    else
+        fun_l19_n511(x)
+    end
+end
+
+def fun_l18_n820(x)
+    if (x < 1)
+        fun_l19_n25(x)
+    else
+        fun_l19_n939(x)
+    end
+end
+
+def fun_l18_n821(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n776(x)
+    end
+end
+
+def fun_l18_n822(x)
+    if (x < 1)
+        fun_l19_n539(x)
+    else
+        fun_l19_n41(x)
+    end
+end
+
+def fun_l18_n823(x)
+    if (x < 1)
+        fun_l19_n764(x)
+    else
+        fun_l19_n240(x)
+    end
+end
+
+def fun_l18_n824(x)
+    if (x < 1)
+        fun_l19_n508(x)
+    else
+        fun_l19_n505(x)
+    end
+end
+
+def fun_l18_n825(x)
+    if (x < 1)
+        fun_l19_n788(x)
+    else
+        fun_l19_n245(x)
+    end
+end
+
+def fun_l18_n826(x)
+    if (x < 1)
+        fun_l19_n315(x)
+    else
+        fun_l19_n391(x)
+    end
+end
+
+def fun_l18_n827(x)
+    if (x < 1)
+        fun_l19_n210(x)
+    else
+        fun_l19_n17(x)
+    end
+end
+
+def fun_l18_n828(x)
+    if (x < 1)
+        fun_l19_n726(x)
+    else
+        fun_l19_n57(x)
+    end
+end
+
+def fun_l18_n829(x)
+    if (x < 1)
+        fun_l19_n228(x)
+    else
+        fun_l19_n44(x)
+    end
+end
+
+def fun_l18_n830(x)
+    if (x < 1)
+        fun_l19_n5(x)
+    else
+        fun_l19_n110(x)
+    end
+end
+
+def fun_l18_n831(x)
+    if (x < 1)
+        fun_l19_n409(x)
+    else
+        fun_l19_n874(x)
+    end
+end
+
+def fun_l18_n832(x)
+    if (x < 1)
+        fun_l19_n710(x)
+    else
+        fun_l19_n960(x)
+    end
+end
+
+def fun_l18_n833(x)
+    if (x < 1)
+        fun_l19_n92(x)
+    else
+        fun_l19_n869(x)
+    end
+end
+
+def fun_l18_n834(x)
+    if (x < 1)
+        fun_l19_n420(x)
+    else
+        fun_l19_n616(x)
+    end
+end
+
+def fun_l18_n835(x)
+    if (x < 1)
+        fun_l19_n705(x)
+    else
+        fun_l19_n727(x)
+    end
+end
+
+def fun_l18_n836(x)
+    if (x < 1)
+        fun_l19_n78(x)
+    else
+        fun_l19_n211(x)
+    end
+end
+
+def fun_l18_n837(x)
+    if (x < 1)
+        fun_l19_n214(x)
+    else
+        fun_l19_n504(x)
+    end
+end
+
+def fun_l18_n838(x)
+    if (x < 1)
+        fun_l19_n320(x)
+    else
+        fun_l19_n303(x)
+    end
+end
+
+def fun_l18_n839(x)
+    if (x < 1)
+        fun_l19_n168(x)
+    else
+        fun_l19_n677(x)
+    end
+end
+
+def fun_l18_n840(x)
+    if (x < 1)
+        fun_l19_n523(x)
+    else
+        fun_l19_n183(x)
+    end
+end
+
+def fun_l18_n841(x)
+    if (x < 1)
+        fun_l19_n757(x)
+    else
+        fun_l19_n554(x)
+    end
+end
+
+def fun_l18_n842(x)
+    if (x < 1)
+        fun_l19_n309(x)
+    else
+        fun_l19_n70(x)
+    end
+end
+
+def fun_l18_n843(x)
+    if (x < 1)
+        fun_l19_n316(x)
+    else
+        fun_l19_n758(x)
+    end
+end
+
+def fun_l18_n844(x)
+    if (x < 1)
+        fun_l19_n459(x)
+    else
+        fun_l19_n28(x)
+    end
+end
+
+def fun_l18_n845(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n597(x)
+    end
+end
+
+def fun_l18_n846(x)
+    if (x < 1)
+        fun_l19_n662(x)
+    else
+        fun_l19_n480(x)
+    end
+end
+
+def fun_l18_n847(x)
+    if (x < 1)
+        fun_l19_n967(x)
+    else
+        fun_l19_n764(x)
+    end
+end
+
+def fun_l18_n848(x)
+    if (x < 1)
+        fun_l19_n248(x)
+    else
+        fun_l19_n459(x)
+    end
+end
+
+def fun_l18_n849(x)
+    if (x < 1)
+        fun_l19_n306(x)
+    else
+        fun_l19_n892(x)
+    end
+end
+
+def fun_l18_n850(x)
+    if (x < 1)
+        fun_l19_n541(x)
+    else
+        fun_l19_n745(x)
+    end
+end
+
+def fun_l18_n851(x)
+    if (x < 1)
+        fun_l19_n974(x)
+    else
+        fun_l19_n593(x)
+    end
+end
+
+def fun_l18_n852(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n853(x)
+    if (x < 1)
+        fun_l19_n447(x)
+    else
+        fun_l19_n207(x)
+    end
+end
+
+def fun_l18_n854(x)
+    if (x < 1)
+        fun_l19_n261(x)
+    else
+        fun_l19_n35(x)
+    end
+end
+
+def fun_l18_n855(x)
+    if (x < 1)
+        fun_l19_n597(x)
+    else
+        fun_l19_n898(x)
+    end
+end
+
+def fun_l18_n856(x)
+    if (x < 1)
+        fun_l19_n97(x)
+    else
+        fun_l19_n109(x)
+    end
+end
+
+def fun_l18_n857(x)
+    if (x < 1)
+        fun_l19_n487(x)
+    else
+        fun_l19_n423(x)
+    end
+end
+
+def fun_l18_n858(x)
+    if (x < 1)
+        fun_l19_n804(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n859(x)
+    if (x < 1)
+        fun_l19_n935(x)
+    else
+        fun_l19_n952(x)
+    end
+end
+
+def fun_l18_n860(x)
+    if (x < 1)
+        fun_l19_n149(x)
+    else
+        fun_l19_n586(x)
+    end
+end
+
+def fun_l18_n861(x)
+    if (x < 1)
+        fun_l19_n750(x)
+    else
+        fun_l19_n962(x)
+    end
+end
+
+def fun_l18_n862(x)
+    if (x < 1)
+        fun_l19_n396(x)
+    else
+        fun_l19_n324(x)
+    end
+end
+
+def fun_l18_n863(x)
+    if (x < 1)
+        fun_l19_n231(x)
+    else
+        fun_l19_n897(x)
+    end
+end
+
+def fun_l18_n864(x)
+    if (x < 1)
+        fun_l19_n239(x)
+    else
+        fun_l19_n118(x)
+    end
+end
+
+def fun_l18_n865(x)
+    if (x < 1)
+        fun_l19_n221(x)
+    else
+        fun_l19_n771(x)
+    end
+end
+
+def fun_l18_n866(x)
+    if (x < 1)
+        fun_l19_n258(x)
+    else
+        fun_l19_n868(x)
+    end
+end
+
+def fun_l18_n867(x)
+    if (x < 1)
+        fun_l19_n629(x)
+    else
+        fun_l19_n491(x)
+    end
+end
+
+def fun_l18_n868(x)
+    if (x < 1)
+        fun_l19_n685(x)
+    else
+        fun_l19_n532(x)
+    end
+end
+
+def fun_l18_n869(x)
+    if (x < 1)
+        fun_l19_n45(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n870(x)
+    if (x < 1)
+        fun_l19_n249(x)
+    else
+        fun_l19_n677(x)
+    end
+end
+
+def fun_l18_n871(x)
+    if (x < 1)
+        fun_l19_n685(x)
+    else
+        fun_l19_n953(x)
+    end
+end
+
+def fun_l18_n872(x)
+    if (x < 1)
+        fun_l19_n270(x)
+    else
+        fun_l19_n208(x)
+    end
+end
+
+def fun_l18_n873(x)
+    if (x < 1)
+        fun_l19_n195(x)
+    else
+        fun_l19_n811(x)
+    end
+end
+
+def fun_l18_n874(x)
+    if (x < 1)
+        fun_l19_n700(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n875(x)
+    if (x < 1)
+        fun_l19_n209(x)
+    else
+        fun_l19_n304(x)
+    end
+end
+
+def fun_l18_n876(x)
+    if (x < 1)
+        fun_l19_n897(x)
+    else
+        fun_l19_n98(x)
+    end
+end
+
+def fun_l18_n877(x)
+    if (x < 1)
+        fun_l19_n400(x)
+    else
+        fun_l19_n325(x)
+    end
+end
+
+def fun_l18_n878(x)
+    if (x < 1)
+        fun_l19_n312(x)
+    else
+        fun_l19_n872(x)
+    end
+end
+
+def fun_l18_n879(x)
+    if (x < 1)
+        fun_l19_n669(x)
+    else
+        fun_l19_n729(x)
+    end
+end
+
+def fun_l18_n880(x)
+    if (x < 1)
+        fun_l19_n644(x)
+    else
+        fun_l19_n243(x)
+    end
+end
+
+def fun_l18_n881(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n495(x)
+    end
+end
+
+def fun_l18_n882(x)
+    if (x < 1)
+        fun_l19_n694(x)
+    else
+        fun_l19_n189(x)
+    end
+end
+
+def fun_l18_n883(x)
+    if (x < 1)
+        fun_l19_n610(x)
+    else
+        fun_l19_n802(x)
+    end
+end
+
+def fun_l18_n884(x)
+    if (x < 1)
+        fun_l19_n69(x)
+    else
+        fun_l19_n129(x)
+    end
+end
+
+def fun_l18_n885(x)
+    if (x < 1)
+        fun_l19_n837(x)
+    else
+        fun_l19_n521(x)
+    end
+end
+
+def fun_l18_n886(x)
+    if (x < 1)
+        fun_l19_n204(x)
+    else
+        fun_l19_n284(x)
+    end
+end
+
+def fun_l18_n887(x)
+    if (x < 1)
+        fun_l19_n2(x)
+    else
+        fun_l19_n378(x)
+    end
+end
+
+def fun_l18_n888(x)
+    if (x < 1)
+        fun_l19_n410(x)
+    else
+        fun_l19_n871(x)
+    end
+end
+
+def fun_l18_n889(x)
+    if (x < 1)
+        fun_l19_n976(x)
+    else
+        fun_l19_n581(x)
+    end
+end
+
+def fun_l18_n890(x)
+    if (x < 1)
+        fun_l19_n274(x)
+    else
+        fun_l19_n57(x)
+    end
+end
+
+def fun_l18_n891(x)
+    if (x < 1)
+        fun_l19_n983(x)
+    else
+        fun_l19_n900(x)
+    end
+end
+
+def fun_l18_n892(x)
+    if (x < 1)
+        fun_l19_n351(x)
+    else
+        fun_l19_n621(x)
+    end
+end
+
+def fun_l18_n893(x)
+    if (x < 1)
+        fun_l19_n539(x)
+    else
+        fun_l19_n847(x)
+    end
+end
+
+def fun_l18_n894(x)
+    if (x < 1)
+        fun_l19_n56(x)
+    else
+        fun_l19_n918(x)
+    end
+end
+
+def fun_l18_n895(x)
+    if (x < 1)
+        fun_l19_n906(x)
+    else
+        fun_l19_n509(x)
+    end
+end
+
+def fun_l18_n896(x)
+    if (x < 1)
+        fun_l19_n64(x)
+    else
+        fun_l19_n269(x)
+    end
+end
+
+def fun_l18_n897(x)
+    if (x < 1)
+        fun_l19_n348(x)
+    else
+        fun_l19_n983(x)
+    end
+end
+
+def fun_l18_n898(x)
+    if (x < 1)
+        fun_l19_n699(x)
+    else
+        fun_l19_n322(x)
+    end
+end
+
+def fun_l18_n899(x)
+    if (x < 1)
+        fun_l19_n754(x)
+    else
+        fun_l19_n608(x)
+    end
+end
+
+def fun_l18_n900(x)
+    if (x < 1)
+        fun_l19_n530(x)
+    else
+        fun_l19_n919(x)
+    end
+end
+
+def fun_l18_n901(x)
+    if (x < 1)
+        fun_l19_n359(x)
+    else
+        fun_l19_n739(x)
+    end
+end
+
+def fun_l18_n902(x)
+    if (x < 1)
+        fun_l19_n647(x)
+    else
+        fun_l19_n389(x)
+    end
+end
+
+def fun_l18_n903(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n680(x)
+    end
+end
+
+def fun_l18_n904(x)
+    if (x < 1)
+        fun_l19_n78(x)
+    else
+        fun_l19_n512(x)
+    end
+end
+
+def fun_l18_n905(x)
+    if (x < 1)
+        fun_l19_n514(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n906(x)
+    if (x < 1)
+        fun_l19_n320(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n907(x)
+    if (x < 1)
+        fun_l19_n666(x)
+    else
+        fun_l19_n846(x)
+    end
+end
+
+def fun_l18_n908(x)
+    if (x < 1)
+        fun_l19_n757(x)
+    else
+        fun_l19_n194(x)
+    end
+end
+
+def fun_l18_n909(x)
+    if (x < 1)
+        fun_l19_n386(x)
+    else
+        fun_l19_n965(x)
+    end
+end
+
+def fun_l18_n910(x)
+    if (x < 1)
+        fun_l19_n561(x)
+    else
+        fun_l19_n897(x)
+    end
+end
+
+def fun_l18_n911(x)
+    if (x < 1)
+        fun_l19_n281(x)
+    else
+        fun_l19_n960(x)
+    end
+end
+
+def fun_l18_n912(x)
+    if (x < 1)
+        fun_l19_n215(x)
+    else
+        fun_l19_n54(x)
+    end
+end
+
+def fun_l18_n913(x)
+    if (x < 1)
+        fun_l19_n561(x)
+    else
+        fun_l19_n353(x)
+    end
+end
+
+def fun_l18_n914(x)
+    if (x < 1)
+        fun_l19_n780(x)
+    else
+        fun_l19_n924(x)
+    end
+end
+
+def fun_l18_n915(x)
+    if (x < 1)
+        fun_l19_n663(x)
+    else
+        fun_l19_n112(x)
+    end
+end
+
+def fun_l18_n916(x)
+    if (x < 1)
+        fun_l19_n15(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n917(x)
+    if (x < 1)
+        fun_l19_n226(x)
+    else
+        fun_l19_n337(x)
+    end
+end
+
+def fun_l18_n918(x)
+    if (x < 1)
+        fun_l19_n477(x)
+    else
+        fun_l19_n12(x)
+    end
+end
+
+def fun_l18_n919(x)
+    if (x < 1)
+        fun_l19_n495(x)
+    else
+        fun_l19_n721(x)
+    end
+end
+
+def fun_l18_n920(x)
+    if (x < 1)
+        fun_l19_n551(x)
+    else
+        fun_l19_n626(x)
+    end
+end
+
+def fun_l18_n921(x)
+    if (x < 1)
+        fun_l19_n491(x)
+    else
+        fun_l19_n442(x)
+    end
+end
+
+def fun_l18_n922(x)
+    if (x < 1)
+        fun_l19_n72(x)
+    else
+        fun_l19_n165(x)
+    end
+end
+
+def fun_l18_n923(x)
+    if (x < 1)
+        fun_l19_n475(x)
+    else
+        fun_l19_n381(x)
+    end
+end
+
+def fun_l18_n924(x)
+    if (x < 1)
+        fun_l19_n655(x)
+    else
+        fun_l19_n95(x)
+    end
+end
+
+def fun_l18_n925(x)
+    if (x < 1)
+        fun_l19_n882(x)
+    else
+        fun_l19_n888(x)
+    end
+end
+
+def fun_l18_n926(x)
+    if (x < 1)
+        fun_l19_n620(x)
+    else
+        fun_l19_n85(x)
+    end
+end
+
+def fun_l18_n927(x)
+    if (x < 1)
+        fun_l19_n13(x)
+    else
+        fun_l19_n776(x)
+    end
+end
+
+def fun_l18_n928(x)
+    if (x < 1)
+        fun_l19_n797(x)
+    else
+        fun_l19_n547(x)
+    end
+end
+
+def fun_l18_n929(x)
+    if (x < 1)
+        fun_l19_n34(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n930(x)
+    if (x < 1)
+        fun_l19_n894(x)
+    else
+        fun_l19_n527(x)
+    end
+end
+
+def fun_l18_n931(x)
+    if (x < 1)
+        fun_l19_n951(x)
+    else
+        fun_l19_n261(x)
+    end
+end
+
+def fun_l18_n932(x)
+    if (x < 1)
+        fun_l19_n178(x)
+    else
+        fun_l19_n365(x)
+    end
+end
+
+def fun_l18_n933(x)
+    if (x < 1)
+        fun_l19_n813(x)
+    else
+        fun_l19_n404(x)
+    end
+end
+
+def fun_l18_n934(x)
+    if (x < 1)
+        fun_l19_n920(x)
+    else
+        fun_l19_n674(x)
+    end
+end
+
+def fun_l18_n935(x)
+    if (x < 1)
+        fun_l19_n155(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n936(x)
+    if (x < 1)
+        fun_l19_n376(x)
+    else
+        fun_l19_n29(x)
+    end
+end
+
+def fun_l18_n937(x)
+    if (x < 1)
+        fun_l19_n104(x)
+    else
+        fun_l19_n802(x)
+    end
+end
+
+def fun_l18_n938(x)
+    if (x < 1)
+        fun_l19_n340(x)
+    else
+        fun_l19_n424(x)
+    end
+end
+
+def fun_l18_n939(x)
+    if (x < 1)
+        fun_l19_n590(x)
+    else
+        fun_l19_n525(x)
+    end
+end
+
+def fun_l18_n940(x)
+    if (x < 1)
+        fun_l19_n15(x)
+    else
+        fun_l19_n48(x)
+    end
+end
+
+def fun_l18_n941(x)
+    if (x < 1)
+        fun_l19_n83(x)
+    else
+        fun_l19_n975(x)
+    end
+end
+
+def fun_l18_n942(x)
+    if (x < 1)
+        fun_l19_n219(x)
+    else
+        fun_l19_n173(x)
+    end
+end
+
+def fun_l18_n943(x)
+    if (x < 1)
+        fun_l19_n457(x)
+    else
+        fun_l19_n956(x)
+    end
+end
+
+def fun_l18_n944(x)
+    if (x < 1)
+        fun_l19_n900(x)
+    else
+        fun_l19_n363(x)
+    end
+end
+
+def fun_l18_n945(x)
+    if (x < 1)
+        fun_l19_n973(x)
+    else
+        fun_l19_n279(x)
+    end
+end
+
+def fun_l18_n946(x)
+    if (x < 1)
+        fun_l19_n155(x)
+    else
+        fun_l19_n554(x)
+    end
+end
+
+def fun_l18_n947(x)
+    if (x < 1)
+        fun_l19_n744(x)
+    else
+        fun_l19_n854(x)
+    end
+end
+
+def fun_l18_n948(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n385(x)
+    end
+end
+
+def fun_l18_n949(x)
+    if (x < 1)
+        fun_l19_n447(x)
+    else
+        fun_l19_n93(x)
+    end
+end
+
+def fun_l18_n950(x)
+    if (x < 1)
+        fun_l19_n621(x)
+    else
+        fun_l19_n467(x)
+    end
+end
+
+def fun_l18_n951(x)
+    if (x < 1)
+        fun_l19_n409(x)
+    else
+        fun_l19_n260(x)
+    end
+end
+
+def fun_l18_n952(x)
+    if (x < 1)
+        fun_l19_n992(x)
+    else
+        fun_l19_n728(x)
+    end
+end
+
+def fun_l18_n953(x)
+    if (x < 1)
+        fun_l19_n760(x)
+    else
+        fun_l19_n724(x)
+    end
+end
+
+def fun_l18_n954(x)
+    if (x < 1)
+        fun_l19_n567(x)
+    else
+        fun_l19_n857(x)
+    end
+end
+
+def fun_l18_n955(x)
+    if (x < 1)
+        fun_l19_n225(x)
+    else
+        fun_l19_n132(x)
+    end
+end
+
+def fun_l18_n956(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n449(x)
+    end
+end
+
+def fun_l18_n957(x)
+    if (x < 1)
+        fun_l19_n200(x)
+    else
+        fun_l19_n216(x)
+    end
+end
+
+def fun_l18_n958(x)
+    if (x < 1)
+        fun_l19_n684(x)
+    else
+        fun_l19_n151(x)
+    end
+end
+
+def fun_l18_n959(x)
+    if (x < 1)
+        fun_l19_n989(x)
+    else
+        fun_l19_n137(x)
+    end
+end
+
+def fun_l18_n960(x)
+    if (x < 1)
+        fun_l19_n207(x)
+    else
+        fun_l19_n736(x)
+    end
+end
+
+def fun_l18_n961(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n840(x)
+    end
+end
+
+def fun_l18_n962(x)
+    if (x < 1)
+        fun_l19_n367(x)
+    else
+        fun_l19_n155(x)
+    end
+end
+
+def fun_l18_n963(x)
+    if (x < 1)
+        fun_l19_n202(x)
+    else
+        fun_l19_n237(x)
+    end
+end
+
+def fun_l18_n964(x)
+    if (x < 1)
+        fun_l19_n932(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n965(x)
+    if (x < 1)
+        fun_l19_n269(x)
+    else
+        fun_l19_n105(x)
+    end
+end
+
+def fun_l18_n966(x)
+    if (x < 1)
+        fun_l19_n775(x)
+    else
+        fun_l19_n776(x)
+    end
+end
+
+def fun_l18_n967(x)
+    if (x < 1)
+        fun_l19_n636(x)
+    else
+        fun_l19_n460(x)
+    end
+end
+
+def fun_l18_n968(x)
+    if (x < 1)
+        fun_l19_n335(x)
+    else
+        fun_l19_n4(x)
+    end
+end
+
+def fun_l18_n969(x)
+    if (x < 1)
+        fun_l19_n987(x)
+    else
+        fun_l19_n935(x)
+    end
+end
+
+def fun_l18_n970(x)
+    if (x < 1)
+        fun_l19_n692(x)
+    else
+        fun_l19_n20(x)
+    end
+end
+
+def fun_l18_n971(x)
+    if (x < 1)
+        fun_l19_n805(x)
+    else
+        fun_l19_n139(x)
+    end
+end
+
+def fun_l18_n972(x)
+    if (x < 1)
+        fun_l19_n53(x)
+    else
+        fun_l19_n539(x)
+    end
+end
+
+def fun_l18_n973(x)
+    if (x < 1)
+        fun_l19_n620(x)
+    else
+        fun_l19_n680(x)
+    end
+end
+
+def fun_l18_n974(x)
+    if (x < 1)
+        fun_l19_n662(x)
+    else
+        fun_l19_n580(x)
+    end
+end
+
+def fun_l18_n975(x)
+    if (x < 1)
+        fun_l19_n401(x)
+    else
+        fun_l19_n428(x)
+    end
+end
+
+def fun_l18_n976(x)
+    if (x < 1)
+        fun_l19_n367(x)
+    else
+        fun_l19_n794(x)
+    end
+end
+
+def fun_l18_n977(x)
+    if (x < 1)
+        fun_l19_n204(x)
+    else
+        fun_l19_n258(x)
+    end
+end
+
+def fun_l18_n978(x)
+    if (x < 1)
+        fun_l19_n868(x)
+    else
+        fun_l19_n300(x)
+    end
+end
+
+def fun_l18_n979(x)
+    if (x < 1)
+        fun_l19_n245(x)
+    else
+        fun_l19_n460(x)
+    end
+end
+
+def fun_l18_n980(x)
+    if (x < 1)
+        fun_l19_n965(x)
+    else
+        fun_l19_n639(x)
+    end
+end
+
+def fun_l18_n981(x)
+    if (x < 1)
+        fun_l19_n903(x)
+    else
+        fun_l19_n139(x)
+    end
+end
+
+def fun_l18_n982(x)
+    if (x < 1)
+        fun_l19_n890(x)
+    else
+        fun_l19_n497(x)
+    end
+end
+
+def fun_l18_n983(x)
+    if (x < 1)
+        fun_l19_n723(x)
+    else
+        fun_l19_n705(x)
+    end
+end
+
+def fun_l18_n984(x)
+    if (x < 1)
+        fun_l19_n592(x)
+    else
+        fun_l19_n965(x)
+    end
+end
+
+def fun_l18_n985(x)
+    if (x < 1)
+        fun_l19_n660(x)
+    else
+        fun_l19_n985(x)
+    end
+end
+
+def fun_l18_n986(x)
+    if (x < 1)
+        fun_l19_n230(x)
+    else
+        fun_l19_n447(x)
+    end
+end
+
+def fun_l18_n987(x)
+    if (x < 1)
+        fun_l19_n875(x)
+    else
+        fun_l19_n86(x)
+    end
+end
+
+def fun_l18_n988(x)
+    if (x < 1)
+        fun_l19_n864(x)
+    else
+        fun_l19_n460(x)
+    end
+end
+
+def fun_l18_n989(x)
+    if (x < 1)
+        fun_l19_n834(x)
+    else
+        fun_l19_n628(x)
+    end
+end
+
+def fun_l18_n990(x)
+    if (x < 1)
+        fun_l19_n578(x)
+    else
+        fun_l19_n160(x)
+    end
+end
+
+def fun_l18_n991(x)
+    if (x < 1)
+        fun_l19_n58(x)
+    else
+        fun_l19_n839(x)
+    end
+end
+
+def fun_l18_n992(x)
+    if (x < 1)
+        fun_l19_n282(x)
+    else
+        fun_l19_n864(x)
+    end
+end
+
+def fun_l18_n993(x)
+    if (x < 1)
+        fun_l19_n957(x)
+    else
+        fun_l19_n280(x)
+    end
+end
+
+def fun_l18_n994(x)
+    if (x < 1)
+        fun_l19_n184(x)
+    else
+        fun_l19_n741(x)
+    end
+end
+
+def fun_l18_n995(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n802(x)
+    end
+end
+
+def fun_l18_n996(x)
+    if (x < 1)
+        fun_l19_n260(x)
+    else
+        fun_l19_n840(x)
+    end
+end
+
+def fun_l18_n997(x)
+    if (x < 1)
+        fun_l19_n500(x)
+    else
+        fun_l19_n142(x)
+    end
+end
+
+def fun_l18_n998(x)
+    if (x < 1)
+        fun_l19_n712(x)
+    else
+        fun_l19_n736(x)
+    end
+end
+
+def fun_l18_n999(x)
+    if (x < 1)
+        fun_l19_n366(x)
+    else
+        fun_l19_n726(x)
+    end
+end
+
+def fun_l19_n0(x)
+    if (x < 1)
+        fun_l20_n238(x)
+    else
+        fun_l20_n685(x)
+    end
+end
+
+def fun_l19_n1(x)
+    if (x < 1)
+        fun_l20_n892(x)
+    else
+        fun_l20_n786(x)
+    end
+end
+
+def fun_l19_n2(x)
+    if (x < 1)
+        fun_l20_n99(x)
+    else
+        fun_l20_n337(x)
+    end
+end
+
+def fun_l19_n3(x)
+    if (x < 1)
+        fun_l20_n40(x)
+    else
+        fun_l20_n773(x)
+    end
+end
+
+def fun_l19_n4(x)
+    if (x < 1)
+        fun_l20_n815(x)
+    else
+        fun_l20_n576(x)
+    end
+end
+
+def fun_l19_n5(x)
+    if (x < 1)
+        fun_l20_n294(x)
+    else
+        fun_l20_n362(x)
+    end
+end
+
+def fun_l19_n6(x)
+    if (x < 1)
+        fun_l20_n352(x)
+    else
+        fun_l20_n263(x)
+    end
+end
+
+def fun_l19_n7(x)
+    if (x < 1)
+        fun_l20_n920(x)
+    else
+        fun_l20_n164(x)
+    end
+end
+
+def fun_l19_n8(x)
+    if (x < 1)
+        fun_l20_n313(x)
+    else
+        fun_l20_n663(x)
+    end
+end
+
+def fun_l19_n9(x)
+    if (x < 1)
+        fun_l20_n261(x)
+    else
+        fun_l20_n769(x)
+    end
+end
+
+def fun_l19_n10(x)
+    if (x < 1)
+        fun_l20_n85(x)
+    else
+        fun_l20_n243(x)
+    end
+end
+
+def fun_l19_n11(x)
+    if (x < 1)
+        fun_l20_n560(x)
+    else
+        fun_l20_n969(x)
+    end
+end
+
+def fun_l19_n12(x)
+    if (x < 1)
+        fun_l20_n954(x)
+    else
+        fun_l20_n340(x)
+    end
+end
+
+def fun_l19_n13(x)
+    if (x < 1)
+        fun_l20_n548(x)
+    else
+        fun_l20_n689(x)
+    end
+end
+
+def fun_l19_n14(x)
+    if (x < 1)
+        fun_l20_n577(x)
+    else
+        fun_l20_n954(x)
+    end
+end
+
+def fun_l19_n15(x)
+    if (x < 1)
+        fun_l20_n43(x)
+    else
+        fun_l20_n3(x)
+    end
+end
+
+def fun_l19_n16(x)
+    if (x < 1)
+        fun_l20_n15(x)
+    else
+        fun_l20_n281(x)
+    end
+end
+
+def fun_l19_n17(x)
+    if (x < 1)
+        fun_l20_n439(x)
+    else
+        fun_l20_n26(x)
+    end
+end
+
+def fun_l19_n18(x)
+    if (x < 1)
+        fun_l20_n534(x)
+    else
+        fun_l20_n419(x)
+    end
+end
+
+def fun_l19_n19(x)
+    if (x < 1)
+        fun_l20_n456(x)
+    else
+        fun_l20_n959(x)
+    end
+end
+
+def fun_l19_n20(x)
+    if (x < 1)
+        fun_l20_n706(x)
+    else
+        fun_l20_n404(x)
+    end
+end
+
+def fun_l19_n21(x)
+    if (x < 1)
+        fun_l20_n559(x)
+    else
+        fun_l20_n61(x)
+    end
+end
+
+def fun_l19_n22(x)
+    if (x < 1)
+        fun_l20_n986(x)
+    else
+        fun_l20_n202(x)
+    end
+end
+
+def fun_l19_n23(x)
+    if (x < 1)
+        fun_l20_n935(x)
+    else
+        fun_l20_n804(x)
+    end
+end
+
+def fun_l19_n24(x)
+    if (x < 1)
+        fun_l20_n775(x)
+    else
+        fun_l20_n909(x)
+    end
+end
+
+def fun_l19_n25(x)
+    if (x < 1)
+        fun_l20_n28(x)
+    else
+        fun_l20_n631(x)
+    end
+end
+
+def fun_l19_n26(x)
+    if (x < 1)
+        fun_l20_n257(x)
+    else
+        fun_l20_n822(x)
+    end
+end
+
+def fun_l19_n27(x)
+    if (x < 1)
+        fun_l20_n198(x)
+    else
+        fun_l20_n1(x)
+    end
+end
+
+def fun_l19_n28(x)
+    if (x < 1)
+        fun_l20_n534(x)
+    else
+        fun_l20_n46(x)
+    end
+end
+
+def fun_l19_n29(x)
+    if (x < 1)
+        fun_l20_n880(x)
+    else
+        fun_l20_n995(x)
+    end
+end
+
+def fun_l19_n30(x)
+    if (x < 1)
+        fun_l20_n953(x)
+    else
+        fun_l20_n367(x)
+    end
+end
+
+def fun_l19_n31(x)
+    if (x < 1)
+        fun_l20_n165(x)
+    else
+        fun_l20_n404(x)
+    end
+end
+
+def fun_l19_n32(x)
+    if (x < 1)
+        fun_l20_n752(x)
+    else
+        fun_l20_n570(x)
+    end
+end
+
+def fun_l19_n33(x)
+    if (x < 1)
+        fun_l20_n973(x)
+    else
+        fun_l20_n357(x)
+    end
+end
+
+def fun_l19_n34(x)
+    if (x < 1)
+        fun_l20_n897(x)
+    else
+        fun_l20_n501(x)
+    end
+end
+
+def fun_l19_n35(x)
+    if (x < 1)
+        fun_l20_n607(x)
+    else
+        fun_l20_n679(x)
+    end
+end
+
+def fun_l19_n36(x)
+    if (x < 1)
+        fun_l20_n870(x)
+    else
+        fun_l20_n590(x)
+    end
+end
+
+def fun_l19_n37(x)
+    if (x < 1)
+        fun_l20_n620(x)
+    else
+        fun_l20_n462(x)
+    end
+end
+
+def fun_l19_n38(x)
+    if (x < 1)
+        fun_l20_n176(x)
+    else
+        fun_l20_n891(x)
+    end
+end
+
+def fun_l19_n39(x)
+    if (x < 1)
+        fun_l20_n850(x)
+    else
+        fun_l20_n730(x)
+    end
+end
+
+def fun_l19_n40(x)
+    if (x < 1)
+        fun_l20_n193(x)
+    else
+        fun_l20_n635(x)
+    end
+end
+
+def fun_l19_n41(x)
+    if (x < 1)
+        fun_l20_n443(x)
+    else
+        fun_l20_n398(x)
+    end
+end
+
+def fun_l19_n42(x)
+    if (x < 1)
+        fun_l20_n324(x)
+    else
+        fun_l20_n566(x)
+    end
+end
+
+def fun_l19_n43(x)
+    if (x < 1)
+        fun_l20_n817(x)
+    else
+        fun_l20_n791(x)
+    end
+end
+
+def fun_l19_n44(x)
+    if (x < 1)
+        fun_l20_n46(x)
+    else
+        fun_l20_n375(x)
+    end
+end
+
+def fun_l19_n45(x)
+    if (x < 1)
+        fun_l20_n504(x)
+    else
+        fun_l20_n64(x)
+    end
+end
+
+def fun_l19_n46(x)
+    if (x < 1)
+        fun_l20_n174(x)
+    else
+        fun_l20_n621(x)
+    end
+end
+
+def fun_l19_n47(x)
+    if (x < 1)
+        fun_l20_n756(x)
+    else
+        fun_l20_n857(x)
+    end
+end
+
+def fun_l19_n48(x)
+    if (x < 1)
+        fun_l20_n635(x)
+    else
+        fun_l20_n216(x)
+    end
+end
+
+def fun_l19_n49(x)
+    if (x < 1)
+        fun_l20_n806(x)
+    else
+        fun_l20_n291(x)
+    end
+end
+
+def fun_l19_n50(x)
+    if (x < 1)
+        fun_l20_n998(x)
+    else
+        fun_l20_n46(x)
+    end
+end
+
+def fun_l19_n51(x)
+    if (x < 1)
+        fun_l20_n685(x)
+    else
+        fun_l20_n968(x)
+    end
+end
+
+def fun_l19_n52(x)
+    if (x < 1)
+        fun_l20_n906(x)
+    else
+        fun_l20_n788(x)
+    end
+end
+
+def fun_l19_n53(x)
+    if (x < 1)
+        fun_l20_n814(x)
+    else
+        fun_l20_n343(x)
+    end
+end
+
+def fun_l19_n54(x)
+    if (x < 1)
+        fun_l20_n320(x)
+    else
+        fun_l20_n293(x)
+    end
+end
+
+def fun_l19_n55(x)
+    if (x < 1)
+        fun_l20_n608(x)
+    else
+        fun_l20_n958(x)
+    end
+end
+
+def fun_l19_n56(x)
+    if (x < 1)
+        fun_l20_n83(x)
+    else
+        fun_l20_n839(x)
+    end
+end
+
+def fun_l19_n57(x)
+    if (x < 1)
+        fun_l20_n618(x)
+    else
+        fun_l20_n483(x)
+    end
+end
+
+def fun_l19_n58(x)
+    if (x < 1)
+        fun_l20_n647(x)
+    else
+        fun_l20_n782(x)
+    end
+end
+
+def fun_l19_n59(x)
+    if (x < 1)
+        fun_l20_n664(x)
+    else
+        fun_l20_n3(x)
+    end
+end
+
+def fun_l19_n60(x)
+    if (x < 1)
+        fun_l20_n556(x)
+    else
+        fun_l20_n185(x)
+    end
+end
+
+def fun_l19_n61(x)
+    if (x < 1)
+        fun_l20_n657(x)
+    else
+        fun_l20_n162(x)
+    end
+end
+
+def fun_l19_n62(x)
+    if (x < 1)
+        fun_l20_n668(x)
+    else
+        fun_l20_n585(x)
+    end
+end
+
+def fun_l19_n63(x)
+    if (x < 1)
+        fun_l20_n913(x)
+    else
+        fun_l20_n855(x)
+    end
+end
+
+def fun_l19_n64(x)
+    if (x < 1)
+        fun_l20_n331(x)
+    else
+        fun_l20_n71(x)
+    end
+end
+
+def fun_l19_n65(x)
+    if (x < 1)
+        fun_l20_n321(x)
+    else
+        fun_l20_n314(x)
+    end
+end
+
+def fun_l19_n66(x)
+    if (x < 1)
+        fun_l20_n512(x)
+    else
+        fun_l20_n607(x)
+    end
+end
+
+def fun_l19_n67(x)
+    if (x < 1)
+        fun_l20_n649(x)
+    else
+        fun_l20_n733(x)
+    end
+end
+
+def fun_l19_n68(x)
+    if (x < 1)
+        fun_l20_n651(x)
+    else
+        fun_l20_n844(x)
+    end
+end
+
+def fun_l19_n69(x)
+    if (x < 1)
+        fun_l20_n510(x)
+    else
+        fun_l20_n675(x)
+    end
+end
+
+def fun_l19_n70(x)
+    if (x < 1)
+        fun_l20_n830(x)
+    else
+        fun_l20_n338(x)
+    end
+end
+
+def fun_l19_n71(x)
+    if (x < 1)
+        fun_l20_n110(x)
+    else
+        fun_l20_n806(x)
+    end
+end
+
+def fun_l19_n72(x)
+    if (x < 1)
+        fun_l20_n588(x)
+    else
+        fun_l20_n7(x)
+    end
+end
+
+def fun_l19_n73(x)
+    if (x < 1)
+        fun_l20_n495(x)
+    else
+        fun_l20_n293(x)
+    end
+end
+
+def fun_l19_n74(x)
+    if (x < 1)
+        fun_l20_n891(x)
+    else
+        fun_l20_n514(x)
+    end
+end
+
+def fun_l19_n75(x)
+    if (x < 1)
+        fun_l20_n419(x)
+    else
+        fun_l20_n934(x)
+    end
+end
+
+def fun_l19_n76(x)
+    if (x < 1)
+        fun_l20_n476(x)
+    else
+        fun_l20_n652(x)
+    end
+end
+
+def fun_l19_n77(x)
+    if (x < 1)
+        fun_l20_n927(x)
+    else
+        fun_l20_n656(x)
+    end
+end
+
+def fun_l19_n78(x)
+    if (x < 1)
+        fun_l20_n361(x)
+    else
+        fun_l20_n847(x)
+    end
+end
+
+def fun_l19_n79(x)
+    if (x < 1)
+        fun_l20_n584(x)
+    else
+        fun_l20_n24(x)
+    end
+end
+
+def fun_l19_n80(x)
+    if (x < 1)
+        fun_l20_n428(x)
+    else
+        fun_l20_n219(x)
+    end
+end
+
+def fun_l19_n81(x)
+    if (x < 1)
+        fun_l20_n922(x)
+    else
+        fun_l20_n758(x)
+    end
+end
+
+def fun_l19_n82(x)
+    if (x < 1)
+        fun_l20_n188(x)
+    else
+        fun_l20_n378(x)
+    end
+end
+
+def fun_l19_n83(x)
+    if (x < 1)
+        fun_l20_n239(x)
+    else
+        fun_l20_n690(x)
+    end
+end
+
+def fun_l19_n84(x)
+    if (x < 1)
+        fun_l20_n262(x)
+    else
+        fun_l20_n162(x)
+    end
+end
+
+def fun_l19_n85(x)
+    if (x < 1)
+        fun_l20_n117(x)
+    else
+        fun_l20_n117(x)
+    end
+end
+
+def fun_l19_n86(x)
+    if (x < 1)
+        fun_l20_n154(x)
+    else
+        fun_l20_n564(x)
+    end
+end
+
+def fun_l19_n87(x)
+    if (x < 1)
+        fun_l20_n560(x)
+    else
+        fun_l20_n591(x)
+    end
+end
+
+def fun_l19_n88(x)
+    if (x < 1)
+        fun_l20_n529(x)
+    else
+        fun_l20_n107(x)
+    end
+end
+
+def fun_l19_n89(x)
+    if (x < 1)
+        fun_l20_n609(x)
+    else
+        fun_l20_n287(x)
+    end
+end
+
+def fun_l19_n90(x)
+    if (x < 1)
+        fun_l20_n780(x)
+    else
+        fun_l20_n397(x)
+    end
+end
+
+def fun_l19_n91(x)
+    if (x < 1)
+        fun_l20_n587(x)
+    else
+        fun_l20_n416(x)
+    end
+end
+
+def fun_l19_n92(x)
+    if (x < 1)
+        fun_l20_n784(x)
+    else
+        fun_l20_n413(x)
+    end
+end
+
+def fun_l19_n93(x)
+    if (x < 1)
+        fun_l20_n83(x)
+    else
+        fun_l20_n560(x)
+    end
+end
+
+def fun_l19_n94(x)
+    if (x < 1)
+        fun_l20_n126(x)
+    else
+        fun_l20_n67(x)
+    end
+end
+
+def fun_l19_n95(x)
+    if (x < 1)
+        fun_l20_n22(x)
+    else
+        fun_l20_n865(x)
+    end
+end
+
+def fun_l19_n96(x)
+    if (x < 1)
+        fun_l20_n35(x)
+    else
+        fun_l20_n160(x)
+    end
+end
+
+def fun_l19_n97(x)
+    if (x < 1)
+        fun_l20_n701(x)
+    else
+        fun_l20_n139(x)
+    end
+end
+
+def fun_l19_n98(x)
+    if (x < 1)
+        fun_l20_n488(x)
+    else
+        fun_l20_n407(x)
+    end
+end
+
+def fun_l19_n99(x)
+    if (x < 1)
+        fun_l20_n636(x)
+    else
+        fun_l20_n135(x)
+    end
+end
+
+def fun_l19_n100(x)
+    if (x < 1)
+        fun_l20_n83(x)
+    else
+        fun_l20_n923(x)
+    end
+end
+
+def fun_l19_n101(x)
+    if (x < 1)
+        fun_l20_n232(x)
+    else
+        fun_l20_n955(x)
+    end
+end
+
+def fun_l19_n102(x)
+    if (x < 1)
+        fun_l20_n816(x)
+    else
+        fun_l20_n671(x)
+    end
+end
+
+def fun_l19_n103(x)
+    if (x < 1)
+        fun_l20_n366(x)
+    else
+        fun_l20_n646(x)
+    end
+end
+
+def fun_l19_n104(x)
+    if (x < 1)
+        fun_l20_n465(x)
+    else
+        fun_l20_n659(x)
+    end
+end
+
+def fun_l19_n105(x)
+    if (x < 1)
+        fun_l20_n488(x)
+    else
+        fun_l20_n720(x)
+    end
+end
+
+def fun_l19_n106(x)
+    if (x < 1)
+        fun_l20_n278(x)
+    else
+        fun_l20_n570(x)
+    end
+end
+
+def fun_l19_n107(x)
+    if (x < 1)
+        fun_l20_n630(x)
+    else
+        fun_l20_n280(x)
+    end
+end
+
+def fun_l19_n108(x)
+    if (x < 1)
+        fun_l20_n688(x)
+    else
+        fun_l20_n999(x)
+    end
+end
+
+def fun_l19_n109(x)
+    if (x < 1)
+        fun_l20_n175(x)
+    else
+        fun_l20_n633(x)
+    end
+end
+
+def fun_l19_n110(x)
+    if (x < 1)
+        fun_l20_n111(x)
+    else
+        fun_l20_n130(x)
+    end
+end
+
+def fun_l19_n111(x)
+    if (x < 1)
+        fun_l20_n405(x)
+    else
+        fun_l20_n148(x)
+    end
+end
+
+def fun_l19_n112(x)
+    if (x < 1)
+        fun_l20_n645(x)
+    else
+        fun_l20_n303(x)
+    end
+end
+
+def fun_l19_n113(x)
+    if (x < 1)
+        fun_l20_n685(x)
+    else
+        fun_l20_n122(x)
+    end
+end
+
+def fun_l19_n114(x)
+    if (x < 1)
+        fun_l20_n808(x)
+    else
+        fun_l20_n780(x)
+    end
+end
+
+def fun_l19_n115(x)
+    if (x < 1)
+        fun_l20_n136(x)
+    else
+        fun_l20_n749(x)
+    end
+end
+
+def fun_l19_n116(x)
+    if (x < 1)
+        fun_l20_n134(x)
+    else
+        fun_l20_n291(x)
+    end
+end
+
+def fun_l19_n117(x)
+    if (x < 1)
+        fun_l20_n288(x)
+    else
+        fun_l20_n759(x)
+    end
+end
+
+def fun_l19_n118(x)
+    if (x < 1)
+        fun_l20_n617(x)
+    else
+        fun_l20_n823(x)
+    end
+end
+
+def fun_l19_n119(x)
+    if (x < 1)
+        fun_l20_n412(x)
+    else
+        fun_l20_n548(x)
+    end
+end
+
+def fun_l19_n120(x)
+    if (x < 1)
+        fun_l20_n897(x)
+    else
+        fun_l20_n455(x)
+    end
+end
+
+def fun_l19_n121(x)
+    if (x < 1)
+        fun_l20_n105(x)
+    else
+        fun_l20_n753(x)
+    end
+end
+
+def fun_l19_n122(x)
+    if (x < 1)
+        fun_l20_n84(x)
+    else
+        fun_l20_n575(x)
+    end
+end
+
+def fun_l19_n123(x)
+    if (x < 1)
+        fun_l20_n326(x)
+    else
+        fun_l20_n858(x)
+    end
+end
+
+def fun_l19_n124(x)
+    if (x < 1)
+        fun_l20_n878(x)
+    else
+        fun_l20_n348(x)
+    end
+end
+
+def fun_l19_n125(x)
+    if (x < 1)
+        fun_l20_n285(x)
+    else
+        fun_l20_n182(x)
+    end
+end
+
+def fun_l19_n126(x)
+    if (x < 1)
+        fun_l20_n560(x)
+    else
+        fun_l20_n413(x)
+    end
+end
+
+def fun_l19_n127(x)
+    if (x < 1)
+        fun_l20_n597(x)
+    else
+        fun_l20_n748(x)
+    end
+end
+
+def fun_l19_n128(x)
+    if (x < 1)
+        fun_l20_n642(x)
+    else
+        fun_l20_n529(x)
+    end
+end
+
+def fun_l19_n129(x)
+    if (x < 1)
+        fun_l20_n842(x)
+    else
+        fun_l20_n228(x)
+    end
+end
+
+def fun_l19_n130(x)
+    if (x < 1)
+        fun_l20_n283(x)
+    else
+        fun_l20_n656(x)
+    end
+end
+
+def fun_l19_n131(x)
+    if (x < 1)
+        fun_l20_n699(x)
+    else
+        fun_l20_n135(x)
+    end
+end
+
+def fun_l19_n132(x)
+    if (x < 1)
+        fun_l20_n276(x)
+    else
+        fun_l20_n41(x)
+    end
+end
+
+def fun_l19_n133(x)
+    if (x < 1)
+        fun_l20_n734(x)
+    else
+        fun_l20_n157(x)
+    end
+end
+
+def fun_l19_n134(x)
+    if (x < 1)
+        fun_l20_n612(x)
+    else
+        fun_l20_n318(x)
+    end
+end
+
+def fun_l19_n135(x)
+    if (x < 1)
+        fun_l20_n345(x)
+    else
+        fun_l20_n332(x)
+    end
+end
+
+def fun_l19_n136(x)
+    if (x < 1)
+        fun_l20_n131(x)
+    else
+        fun_l20_n747(x)
+    end
+end
+
+def fun_l19_n137(x)
+    if (x < 1)
+        fun_l20_n911(x)
+    else
+        fun_l20_n84(x)
+    end
+end
+
+def fun_l19_n138(x)
+    if (x < 1)
+        fun_l20_n665(x)
+    else
+        fun_l20_n194(x)
+    end
+end
+
+def fun_l19_n139(x)
+    if (x < 1)
+        fun_l20_n301(x)
+    else
+        fun_l20_n71(x)
+    end
+end
+
+def fun_l19_n140(x)
+    if (x < 1)
+        fun_l20_n432(x)
+    else
+        fun_l20_n679(x)
+    end
+end
+
+def fun_l19_n141(x)
+    if (x < 1)
+        fun_l20_n628(x)
+    else
+        fun_l20_n268(x)
+    end
+end
+
+def fun_l19_n142(x)
+    if (x < 1)
+        fun_l20_n982(x)
+    else
+        fun_l20_n241(x)
+    end
+end
+
+def fun_l19_n143(x)
+    if (x < 1)
+        fun_l20_n35(x)
+    else
+        fun_l20_n593(x)
+    end
+end
+
+def fun_l19_n144(x)
+    if (x < 1)
+        fun_l20_n791(x)
+    else
+        fun_l20_n960(x)
+    end
+end
+
+def fun_l19_n145(x)
+    if (x < 1)
+        fun_l20_n613(x)
+    else
+        fun_l20_n366(x)
+    end
+end
+
+def fun_l19_n146(x)
+    if (x < 1)
+        fun_l20_n997(x)
+    else
+        fun_l20_n7(x)
+    end
+end
+
+def fun_l19_n147(x)
+    if (x < 1)
+        fun_l20_n206(x)
+    else
+        fun_l20_n785(x)
+    end
+end
+
+def fun_l19_n148(x)
+    if (x < 1)
+        fun_l20_n822(x)
+    else
+        fun_l20_n178(x)
+    end
+end
+
+def fun_l19_n149(x)
+    if (x < 1)
+        fun_l20_n793(x)
+    else
+        fun_l20_n860(x)
+    end
+end
+
+def fun_l19_n150(x)
+    if (x < 1)
+        fun_l20_n260(x)
+    else
+        fun_l20_n523(x)
+    end
+end
+
+def fun_l19_n151(x)
+    if (x < 1)
+        fun_l20_n848(x)
+    else
+        fun_l20_n568(x)
+    end
+end
+
+def fun_l19_n152(x)
+    if (x < 1)
+        fun_l20_n466(x)
+    else
+        fun_l20_n959(x)
+    end
+end
+
+def fun_l19_n153(x)
+    if (x < 1)
+        fun_l20_n972(x)
+    else
+        fun_l20_n780(x)
+    end
+end
+
+def fun_l19_n154(x)
+    if (x < 1)
+        fun_l20_n349(x)
+    else
+        fun_l20_n490(x)
+    end
+end
+
+def fun_l19_n155(x)
+    if (x < 1)
+        fun_l20_n658(x)
+    else
+        fun_l20_n766(x)
+    end
+end
+
+def fun_l19_n156(x)
+    if (x < 1)
+        fun_l20_n788(x)
+    else
+        fun_l20_n961(x)
+    end
+end
+
+def fun_l19_n157(x)
+    if (x < 1)
+        fun_l20_n32(x)
+    else
+        fun_l20_n155(x)
+    end
+end
+
+def fun_l19_n158(x)
+    if (x < 1)
+        fun_l20_n820(x)
+    else
+        fun_l20_n317(x)
+    end
+end
+
+def fun_l19_n159(x)
+    if (x < 1)
+        fun_l20_n818(x)
+    else
+        fun_l20_n570(x)
+    end
+end
+
+def fun_l19_n160(x)
+    if (x < 1)
+        fun_l20_n82(x)
+    else
+        fun_l20_n331(x)
+    end
+end
+
+def fun_l19_n161(x)
+    if (x < 1)
+        fun_l20_n576(x)
+    else
+        fun_l20_n134(x)
+    end
+end
+
+def fun_l19_n162(x)
+    if (x < 1)
+        fun_l20_n287(x)
+    else
+        fun_l20_n748(x)
+    end
+end
+
+def fun_l19_n163(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n97(x)
+    end
+end
+
+def fun_l19_n164(x)
+    if (x < 1)
+        fun_l20_n218(x)
+    else
+        fun_l20_n195(x)
+    end
+end
+
+def fun_l19_n165(x)
+    if (x < 1)
+        fun_l20_n179(x)
+    else
+        fun_l20_n566(x)
+    end
+end
+
+def fun_l19_n166(x)
+    if (x < 1)
+        fun_l20_n833(x)
+    else
+        fun_l20_n35(x)
+    end
+end
+
+def fun_l19_n167(x)
+    if (x < 1)
+        fun_l20_n595(x)
+    else
+        fun_l20_n344(x)
+    end
+end
+
+def fun_l19_n168(x)
+    if (x < 1)
+        fun_l20_n171(x)
+    else
+        fun_l20_n199(x)
+    end
+end
+
+def fun_l19_n169(x)
+    if (x < 1)
+        fun_l20_n531(x)
+    else
+        fun_l20_n385(x)
+    end
+end
+
+def fun_l19_n170(x)
+    if (x < 1)
+        fun_l20_n168(x)
+    else
+        fun_l20_n911(x)
+    end
+end
+
+def fun_l19_n171(x)
+    if (x < 1)
+        fun_l20_n767(x)
+    else
+        fun_l20_n521(x)
+    end
+end
+
+def fun_l19_n172(x)
+    if (x < 1)
+        fun_l20_n769(x)
+    else
+        fun_l20_n56(x)
+    end
+end
+
+def fun_l19_n173(x)
+    if (x < 1)
+        fun_l20_n521(x)
+    else
+        fun_l20_n600(x)
+    end
+end
+
+def fun_l19_n174(x)
+    if (x < 1)
+        fun_l20_n239(x)
+    else
+        fun_l20_n22(x)
+    end
+end
+
+def fun_l19_n175(x)
+    if (x < 1)
+        fun_l20_n963(x)
+    else
+        fun_l20_n497(x)
+    end
+end
+
+def fun_l19_n176(x)
+    if (x < 1)
+        fun_l20_n989(x)
+    else
+        fun_l20_n748(x)
+    end
+end
+
+def fun_l19_n177(x)
+    if (x < 1)
+        fun_l20_n105(x)
+    else
+        fun_l20_n315(x)
+    end
+end
+
+def fun_l19_n178(x)
+    if (x < 1)
+        fun_l20_n48(x)
+    else
+        fun_l20_n550(x)
+    end
+end
+
+def fun_l19_n179(x)
+    if (x < 1)
+        fun_l20_n66(x)
+    else
+        fun_l20_n595(x)
+    end
+end
+
+def fun_l19_n180(x)
+    if (x < 1)
+        fun_l20_n692(x)
+    else
+        fun_l20_n71(x)
+    end
+end
+
+def fun_l19_n181(x)
+    if (x < 1)
+        fun_l20_n639(x)
+    else
+        fun_l20_n869(x)
+    end
+end
+
+def fun_l19_n182(x)
+    if (x < 1)
+        fun_l20_n925(x)
+    else
+        fun_l20_n868(x)
+    end
+end
+
+def fun_l19_n183(x)
+    if (x < 1)
+        fun_l20_n890(x)
+    else
+        fun_l20_n924(x)
+    end
+end
+
+def fun_l19_n184(x)
+    if (x < 1)
+        fun_l20_n579(x)
+    else
+        fun_l20_n349(x)
+    end
+end
+
+def fun_l19_n185(x)
+    if (x < 1)
+        fun_l20_n313(x)
+    else
+        fun_l20_n16(x)
+    end
+end
+
+def fun_l19_n186(x)
+    if (x < 1)
+        fun_l20_n947(x)
+    else
+        fun_l20_n644(x)
+    end
+end
+
+def fun_l19_n187(x)
+    if (x < 1)
+        fun_l20_n424(x)
+    else
+        fun_l20_n815(x)
+    end
+end
+
+def fun_l19_n188(x)
+    if (x < 1)
+        fun_l20_n177(x)
+    else
+        fun_l20_n230(x)
+    end
+end
+
+def fun_l19_n189(x)
+    if (x < 1)
+        fun_l20_n556(x)
+    else
+        fun_l20_n47(x)
+    end
+end
+
+def fun_l19_n190(x)
+    if (x < 1)
+        fun_l20_n804(x)
+    else
+        fun_l20_n516(x)
+    end
+end
+
+def fun_l19_n191(x)
+    if (x < 1)
+        fun_l20_n411(x)
+    else
+        fun_l20_n779(x)
+    end
+end
+
+def fun_l19_n192(x)
+    if (x < 1)
+        fun_l20_n124(x)
+    else
+        fun_l20_n827(x)
+    end
+end
+
+def fun_l19_n193(x)
+    if (x < 1)
+        fun_l20_n514(x)
+    else
+        fun_l20_n516(x)
+    end
+end
+
+def fun_l19_n194(x)
+    if (x < 1)
+        fun_l20_n134(x)
+    else
+        fun_l20_n356(x)
+    end
+end
+
+def fun_l19_n195(x)
+    if (x < 1)
+        fun_l20_n499(x)
+    else
+        fun_l20_n809(x)
+    end
+end
+
+def fun_l19_n196(x)
+    if (x < 1)
+        fun_l20_n958(x)
+    else
+        fun_l20_n675(x)
+    end
+end
+
+def fun_l19_n197(x)
+    if (x < 1)
+        fun_l20_n847(x)
+    else
+        fun_l20_n418(x)
+    end
+end
+
+def fun_l19_n198(x)
+    if (x < 1)
+        fun_l20_n294(x)
+    else
+        fun_l20_n510(x)
+    end
+end
+
+def fun_l19_n199(x)
+    if (x < 1)
+        fun_l20_n365(x)
+    else
+        fun_l20_n952(x)
+    end
+end
+
+def fun_l19_n200(x)
+    if (x < 1)
+        fun_l20_n961(x)
+    else
+        fun_l20_n747(x)
+    end
+end
+
+def fun_l19_n201(x)
+    if (x < 1)
+        fun_l20_n731(x)
+    else
+        fun_l20_n618(x)
+    end
+end
+
+def fun_l19_n202(x)
+    if (x < 1)
+        fun_l20_n825(x)
+    else
+        fun_l20_n907(x)
+    end
+end
+
+def fun_l19_n203(x)
+    if (x < 1)
+        fun_l20_n865(x)
+    else
+        fun_l20_n886(x)
+    end
+end
+
+def fun_l19_n204(x)
+    if (x < 1)
+        fun_l20_n732(x)
+    else
+        fun_l20_n823(x)
+    end
+end
+
+def fun_l19_n205(x)
+    if (x < 1)
+        fun_l20_n305(x)
+    else
+        fun_l20_n596(x)
+    end
+end
+
+def fun_l19_n206(x)
+    if (x < 1)
+        fun_l20_n245(x)
+    else
+        fun_l20_n370(x)
+    end
+end
+
+def fun_l19_n207(x)
+    if (x < 1)
+        fun_l20_n728(x)
+    else
+        fun_l20_n917(x)
+    end
+end
+
+def fun_l19_n208(x)
+    if (x < 1)
+        fun_l20_n448(x)
+    else
+        fun_l20_n904(x)
+    end
+end
+
+def fun_l19_n209(x)
+    if (x < 1)
+        fun_l20_n90(x)
+    else
+        fun_l20_n181(x)
+    end
+end
+
+def fun_l19_n210(x)
+    if (x < 1)
+        fun_l20_n569(x)
+    else
+        fun_l20_n268(x)
+    end
+end
+
+def fun_l19_n211(x)
+    if (x < 1)
+        fun_l20_n772(x)
+    else
+        fun_l20_n770(x)
+    end
+end
+
+def fun_l19_n212(x)
+    if (x < 1)
+        fun_l20_n781(x)
+    else
+        fun_l20_n603(x)
+    end
+end
+
+def fun_l19_n213(x)
+    if (x < 1)
+        fun_l20_n733(x)
+    else
+        fun_l20_n904(x)
+    end
+end
+
+def fun_l19_n214(x)
+    if (x < 1)
+        fun_l20_n303(x)
+    else
+        fun_l20_n888(x)
+    end
+end
+
+def fun_l19_n215(x)
+    if (x < 1)
+        fun_l20_n280(x)
+    else
+        fun_l20_n428(x)
+    end
+end
+
+def fun_l19_n216(x)
+    if (x < 1)
+        fun_l20_n737(x)
+    else
+        fun_l20_n483(x)
+    end
+end
+
+def fun_l19_n217(x)
+    if (x < 1)
+        fun_l20_n780(x)
+    else
+        fun_l20_n240(x)
+    end
+end
+
+def fun_l19_n218(x)
+    if (x < 1)
+        fun_l20_n202(x)
+    else
+        fun_l20_n580(x)
+    end
+end
+
+def fun_l19_n219(x)
+    if (x < 1)
+        fun_l20_n837(x)
+    else
+        fun_l20_n83(x)
+    end
+end
+
+def fun_l19_n220(x)
+    if (x < 1)
+        fun_l20_n68(x)
+    else
+        fun_l20_n292(x)
+    end
+end
+
+def fun_l19_n221(x)
+    if (x < 1)
+        fun_l20_n289(x)
+    else
+        fun_l20_n655(x)
+    end
+end
+
+def fun_l19_n222(x)
+    if (x < 1)
+        fun_l20_n505(x)
+    else
+        fun_l20_n660(x)
+    end
+end
+
+def fun_l19_n223(x)
+    if (x < 1)
+        fun_l20_n534(x)
+    else
+        fun_l20_n391(x)
+    end
+end
+
+def fun_l19_n224(x)
+    if (x < 1)
+        fun_l20_n72(x)
+    else
+        fun_l20_n81(x)
+    end
+end
+
+def fun_l19_n225(x)
+    if (x < 1)
+        fun_l20_n194(x)
+    else
+        fun_l20_n437(x)
+    end
+end
+
+def fun_l19_n226(x)
+    if (x < 1)
+        fun_l20_n629(x)
+    else
+        fun_l20_n645(x)
+    end
+end
+
+def fun_l19_n227(x)
+    if (x < 1)
+        fun_l20_n912(x)
+    else
+        fun_l20_n425(x)
+    end
+end
+
+def fun_l19_n228(x)
+    if (x < 1)
+        fun_l20_n773(x)
+    else
+        fun_l20_n456(x)
+    end
+end
+
+def fun_l19_n229(x)
+    if (x < 1)
+        fun_l20_n247(x)
+    else
+        fun_l20_n275(x)
+    end
+end
+
+def fun_l19_n230(x)
+    if (x < 1)
+        fun_l20_n263(x)
+    else
+        fun_l20_n482(x)
+    end
+end
+
+def fun_l19_n231(x)
+    if (x < 1)
+        fun_l20_n999(x)
+    else
+        fun_l20_n146(x)
+    end
+end
+
+def fun_l19_n232(x)
+    if (x < 1)
+        fun_l20_n117(x)
+    else
+        fun_l20_n851(x)
+    end
+end
+
+def fun_l19_n233(x)
+    if (x < 1)
+        fun_l20_n889(x)
+    else
+        fun_l20_n441(x)
+    end
+end
+
+def fun_l19_n234(x)
+    if (x < 1)
+        fun_l20_n885(x)
+    else
+        fun_l20_n374(x)
+    end
+end
+
+def fun_l19_n235(x)
+    if (x < 1)
+        fun_l20_n703(x)
+    else
+        fun_l20_n962(x)
+    end
+end
+
+def fun_l19_n236(x)
+    if (x < 1)
+        fun_l20_n298(x)
+    else
+        fun_l20_n57(x)
+    end
+end
+
+def fun_l19_n237(x)
+    if (x < 1)
+        fun_l20_n821(x)
+    else
+        fun_l20_n120(x)
+    end
+end
+
+def fun_l19_n238(x)
+    if (x < 1)
+        fun_l20_n437(x)
+    else
+        fun_l20_n204(x)
+    end
+end
+
+def fun_l19_n239(x)
+    if (x < 1)
+        fun_l20_n558(x)
+    else
+        fun_l20_n645(x)
+    end
+end
+
+def fun_l19_n240(x)
+    if (x < 1)
+        fun_l20_n631(x)
+    else
+        fun_l20_n986(x)
+    end
+end
+
+def fun_l19_n241(x)
+    if (x < 1)
+        fun_l20_n418(x)
+    else
+        fun_l20_n738(x)
+    end
+end
+
+def fun_l19_n242(x)
+    if (x < 1)
+        fun_l20_n249(x)
+    else
+        fun_l20_n322(x)
+    end
+end
+
+def fun_l19_n243(x)
+    if (x < 1)
+        fun_l20_n484(x)
+    else
+        fun_l20_n270(x)
+    end
+end
+
+def fun_l19_n244(x)
+    if (x < 1)
+        fun_l20_n749(x)
+    else
+        fun_l20_n322(x)
+    end
+end
+
+def fun_l19_n245(x)
+    if (x < 1)
+        fun_l20_n562(x)
+    else
+        fun_l20_n353(x)
+    end
+end
+
+def fun_l19_n246(x)
+    if (x < 1)
+        fun_l20_n974(x)
+    else
+        fun_l20_n333(x)
+    end
+end
+
+def fun_l19_n247(x)
+    if (x < 1)
+        fun_l20_n929(x)
+    else
+        fun_l20_n885(x)
+    end
+end
+
+def fun_l19_n248(x)
+    if (x < 1)
+        fun_l20_n421(x)
+    else
+        fun_l20_n576(x)
+    end
+end
+
+def fun_l19_n249(x)
+    if (x < 1)
+        fun_l20_n757(x)
+    else
+        fun_l20_n618(x)
+    end
+end
+
+def fun_l19_n250(x)
+    if (x < 1)
+        fun_l20_n108(x)
+    else
+        fun_l20_n704(x)
+    end
+end
+
+def fun_l19_n251(x)
+    if (x < 1)
+        fun_l20_n882(x)
+    else
+        fun_l20_n994(x)
+    end
+end
+
+def fun_l19_n252(x)
+    if (x < 1)
+        fun_l20_n995(x)
+    else
+        fun_l20_n580(x)
+    end
+end
+
+def fun_l19_n253(x)
+    if (x < 1)
+        fun_l20_n869(x)
+    else
+        fun_l20_n302(x)
+    end
+end
+
+def fun_l19_n254(x)
+    if (x < 1)
+        fun_l20_n873(x)
+    else
+        fun_l20_n315(x)
+    end
+end
+
+def fun_l19_n255(x)
+    if (x < 1)
+        fun_l20_n266(x)
+    else
+        fun_l20_n263(x)
+    end
+end
+
+def fun_l19_n256(x)
+    if (x < 1)
+        fun_l20_n450(x)
+    else
+        fun_l20_n994(x)
+    end
+end
+
+def fun_l19_n257(x)
+    if (x < 1)
+        fun_l20_n552(x)
+    else
+        fun_l20_n407(x)
+    end
+end
+
+def fun_l19_n258(x)
+    if (x < 1)
+        fun_l20_n603(x)
+    else
+        fun_l20_n453(x)
+    end
+end
+
+def fun_l19_n259(x)
+    if (x < 1)
+        fun_l20_n933(x)
+    else
+        fun_l20_n609(x)
+    end
+end
+
+def fun_l19_n260(x)
+    if (x < 1)
+        fun_l20_n983(x)
+    else
+        fun_l20_n404(x)
+    end
+end
+
+def fun_l19_n261(x)
+    if (x < 1)
+        fun_l20_n123(x)
+    else
+        fun_l20_n159(x)
+    end
+end
+
+def fun_l19_n262(x)
+    if (x < 1)
+        fun_l20_n890(x)
+    else
+        fun_l20_n749(x)
+    end
+end
+
+def fun_l19_n263(x)
+    if (x < 1)
+        fun_l20_n758(x)
+    else
+        fun_l20_n123(x)
+    end
+end
+
+def fun_l19_n264(x)
+    if (x < 1)
+        fun_l20_n194(x)
+    else
+        fun_l20_n645(x)
+    end
+end
+
+def fun_l19_n265(x)
+    if (x < 1)
+        fun_l20_n71(x)
+    else
+        fun_l20_n750(x)
+    end
+end
+
+def fun_l19_n266(x)
+    if (x < 1)
+        fun_l20_n713(x)
+    else
+        fun_l20_n125(x)
+    end
+end
+
+def fun_l19_n267(x)
+    if (x < 1)
+        fun_l20_n286(x)
+    else
+        fun_l20_n227(x)
+    end
+end
+
+def fun_l19_n268(x)
+    if (x < 1)
+        fun_l20_n220(x)
+    else
+        fun_l20_n233(x)
+    end
+end
+
+def fun_l19_n269(x)
+    if (x < 1)
+        fun_l20_n263(x)
+    else
+        fun_l20_n306(x)
+    end
+end
+
+def fun_l19_n270(x)
+    if (x < 1)
+        fun_l20_n959(x)
+    else
+        fun_l20_n552(x)
+    end
+end
+
+def fun_l19_n271(x)
+    if (x < 1)
+        fun_l20_n154(x)
+    else
+        fun_l20_n212(x)
+    end
+end
+
+def fun_l19_n272(x)
+    if (x < 1)
+        fun_l20_n985(x)
+    else
+        fun_l20_n370(x)
+    end
+end
+
+def fun_l19_n273(x)
+    if (x < 1)
+        fun_l20_n763(x)
+    else
+        fun_l20_n897(x)
+    end
+end
+
+def fun_l19_n274(x)
+    if (x < 1)
+        fun_l20_n582(x)
+    else
+        fun_l20_n638(x)
+    end
+end
+
+def fun_l19_n275(x)
+    if (x < 1)
+        fun_l20_n509(x)
+    else
+        fun_l20_n366(x)
+    end
+end
+
+def fun_l19_n276(x)
+    if (x < 1)
+        fun_l20_n500(x)
+    else
+        fun_l20_n814(x)
+    end
+end
+
+def fun_l19_n277(x)
+    if (x < 1)
+        fun_l20_n726(x)
+    else
+        fun_l20_n934(x)
+    end
+end
+
+def fun_l19_n278(x)
+    if (x < 1)
+        fun_l20_n198(x)
+    else
+        fun_l20_n852(x)
+    end
+end
+
+def fun_l19_n279(x)
+    if (x < 1)
+        fun_l20_n43(x)
+    else
+        fun_l20_n614(x)
+    end
+end
+
+def fun_l19_n280(x)
+    if (x < 1)
+        fun_l20_n79(x)
+    else
+        fun_l20_n821(x)
+    end
+end
+
+def fun_l19_n281(x)
+    if (x < 1)
+        fun_l20_n269(x)
+    else
+        fun_l20_n697(x)
+    end
+end
+
+def fun_l19_n282(x)
+    if (x < 1)
+        fun_l20_n327(x)
+    else
+        fun_l20_n528(x)
+    end
+end
+
+def fun_l19_n283(x)
+    if (x < 1)
+        fun_l20_n77(x)
+    else
+        fun_l20_n743(x)
+    end
+end
+
+def fun_l19_n284(x)
+    if (x < 1)
+        fun_l20_n282(x)
+    else
+        fun_l20_n406(x)
+    end
+end
+
+def fun_l19_n285(x)
+    if (x < 1)
+        fun_l20_n129(x)
+    else
+        fun_l20_n855(x)
+    end
+end
+
+def fun_l19_n286(x)
+    if (x < 1)
+        fun_l20_n897(x)
+    else
+        fun_l20_n687(x)
+    end
+end
+
+def fun_l19_n287(x)
+    if (x < 1)
+        fun_l20_n166(x)
+    else
+        fun_l20_n5(x)
+    end
+end
+
+def fun_l19_n288(x)
+    if (x < 1)
+        fun_l20_n545(x)
+    else
+        fun_l20_n661(x)
+    end
+end
+
+def fun_l19_n289(x)
+    if (x < 1)
+        fun_l20_n630(x)
+    else
+        fun_l20_n820(x)
+    end
+end
+
+def fun_l19_n290(x)
+    if (x < 1)
+        fun_l20_n774(x)
+    else
+        fun_l20_n125(x)
+    end
+end
+
+def fun_l19_n291(x)
+    if (x < 1)
+        fun_l20_n110(x)
+    else
+        fun_l20_n721(x)
+    end
+end
+
+def fun_l19_n292(x)
+    if (x < 1)
+        fun_l20_n777(x)
+    else
+        fun_l20_n44(x)
+    end
+end
+
+def fun_l19_n293(x)
+    if (x < 1)
+        fun_l20_n504(x)
+    else
+        fun_l20_n478(x)
+    end
+end
+
+def fun_l19_n294(x)
+    if (x < 1)
+        fun_l20_n540(x)
+    else
+        fun_l20_n603(x)
+    end
+end
+
+def fun_l19_n295(x)
+    if (x < 1)
+        fun_l20_n576(x)
+    else
+        fun_l20_n417(x)
+    end
+end
+
+def fun_l19_n296(x)
+    if (x < 1)
+        fun_l20_n553(x)
+    else
+        fun_l20_n295(x)
+    end
+end
+
+def fun_l19_n297(x)
+    if (x < 1)
+        fun_l20_n56(x)
+    else
+        fun_l20_n990(x)
+    end
+end
+
+def fun_l19_n298(x)
+    if (x < 1)
+        fun_l20_n362(x)
+    else
+        fun_l20_n158(x)
+    end
+end
+
+def fun_l19_n299(x)
+    if (x < 1)
+        fun_l20_n788(x)
+    else
+        fun_l20_n70(x)
+    end
+end
+
+def fun_l19_n300(x)
+    if (x < 1)
+        fun_l20_n670(x)
+    else
+        fun_l20_n542(x)
+    end
+end
+
+def fun_l19_n301(x)
+    if (x < 1)
+        fun_l20_n960(x)
+    else
+        fun_l20_n827(x)
+    end
+end
+
+def fun_l19_n302(x)
+    if (x < 1)
+        fun_l20_n366(x)
+    else
+        fun_l20_n325(x)
+    end
+end
+
+def fun_l19_n303(x)
+    if (x < 1)
+        fun_l20_n252(x)
+    else
+        fun_l20_n931(x)
+    end
+end
+
+def fun_l19_n304(x)
+    if (x < 1)
+        fun_l20_n124(x)
+    else
+        fun_l20_n102(x)
+    end
+end
+
+def fun_l19_n305(x)
+    if (x < 1)
+        fun_l20_n678(x)
+    else
+        fun_l20_n299(x)
+    end
+end
+
+def fun_l19_n306(x)
+    if (x < 1)
+        fun_l20_n538(x)
+    else
+        fun_l20_n371(x)
+    end
+end
+
+def fun_l19_n307(x)
+    if (x < 1)
+        fun_l20_n452(x)
+    else
+        fun_l20_n879(x)
+    end
+end
+
+def fun_l19_n308(x)
+    if (x < 1)
+        fun_l20_n410(x)
+    else
+        fun_l20_n156(x)
+    end
+end
+
+def fun_l19_n309(x)
+    if (x < 1)
+        fun_l20_n259(x)
+    else
+        fun_l20_n236(x)
+    end
+end
+
+def fun_l19_n310(x)
+    if (x < 1)
+        fun_l20_n710(x)
+    else
+        fun_l20_n23(x)
+    end
+end
+
+def fun_l19_n311(x)
+    if (x < 1)
+        fun_l20_n214(x)
+    else
+        fun_l20_n649(x)
+    end
+end
+
+def fun_l19_n312(x)
+    if (x < 1)
+        fun_l20_n603(x)
+    else
+        fun_l20_n213(x)
+    end
+end
+
+def fun_l19_n313(x)
+    if (x < 1)
+        fun_l20_n874(x)
+    else
+        fun_l20_n83(x)
+    end
+end
+
+def fun_l19_n314(x)
+    if (x < 1)
+        fun_l20_n902(x)
+    else
+        fun_l20_n303(x)
+    end
+end
+
+def fun_l19_n315(x)
+    if (x < 1)
+        fun_l20_n601(x)
+    else
+        fun_l20_n801(x)
+    end
+end
+
+def fun_l19_n316(x)
+    if (x < 1)
+        fun_l20_n76(x)
+    else
+        fun_l20_n960(x)
+    end
+end
+
+def fun_l19_n317(x)
+    if (x < 1)
+        fun_l20_n926(x)
+    else
+        fun_l20_n700(x)
+    end
+end
+
+def fun_l19_n318(x)
+    if (x < 1)
+        fun_l20_n233(x)
+    else
+        fun_l20_n278(x)
+    end
+end
+
+def fun_l19_n319(x)
+    if (x < 1)
+        fun_l20_n724(x)
+    else
+        fun_l20_n181(x)
+    end
+end
+
+def fun_l19_n320(x)
+    if (x < 1)
+        fun_l20_n367(x)
+    else
+        fun_l20_n511(x)
+    end
+end
+
+def fun_l19_n321(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n601(x)
+    end
+end
+
+def fun_l19_n322(x)
+    if (x < 1)
+        fun_l20_n173(x)
+    else
+        fun_l20_n151(x)
+    end
+end
+
+def fun_l19_n323(x)
+    if (x < 1)
+        fun_l20_n628(x)
+    else
+        fun_l20_n790(x)
+    end
+end
+
+def fun_l19_n324(x)
+    if (x < 1)
+        fun_l20_n423(x)
+    else
+        fun_l20_n40(x)
+    end
+end
+
+def fun_l19_n325(x)
+    if (x < 1)
+        fun_l20_n850(x)
+    else
+        fun_l20_n698(x)
+    end
+end
+
+def fun_l19_n326(x)
+    if (x < 1)
+        fun_l20_n351(x)
+    else
+        fun_l20_n562(x)
+    end
+end
+
+def fun_l19_n327(x)
+    if (x < 1)
+        fun_l20_n717(x)
+    else
+        fun_l20_n386(x)
+    end
+end
+
+def fun_l19_n328(x)
+    if (x < 1)
+        fun_l20_n461(x)
+    else
+        fun_l20_n604(x)
+    end
+end
+
+def fun_l19_n329(x)
+    if (x < 1)
+        fun_l20_n423(x)
+    else
+        fun_l20_n506(x)
+    end
+end
+
+def fun_l19_n330(x)
+    if (x < 1)
+        fun_l20_n389(x)
+    else
+        fun_l20_n365(x)
+    end
+end
+
+def fun_l19_n331(x)
+    if (x < 1)
+        fun_l20_n858(x)
+    else
+        fun_l20_n623(x)
+    end
+end
+
+def fun_l19_n332(x)
+    if (x < 1)
+        fun_l20_n34(x)
+    else
+        fun_l20_n598(x)
+    end
+end
+
+def fun_l19_n333(x)
+    if (x < 1)
+        fun_l20_n458(x)
+    else
+        fun_l20_n619(x)
+    end
+end
+
+def fun_l19_n334(x)
+    if (x < 1)
+        fun_l20_n203(x)
+    else
+        fun_l20_n391(x)
+    end
+end
+
+def fun_l19_n335(x)
+    if (x < 1)
+        fun_l20_n745(x)
+    else
+        fun_l20_n197(x)
+    end
+end
+
+def fun_l19_n336(x)
+    if (x < 1)
+        fun_l20_n388(x)
+    else
+        fun_l20_n682(x)
+    end
+end
+
+def fun_l19_n337(x)
+    if (x < 1)
+        fun_l20_n340(x)
+    else
+        fun_l20_n836(x)
+    end
+end
+
+def fun_l19_n338(x)
+    if (x < 1)
+        fun_l20_n231(x)
+    else
+        fun_l20_n508(x)
+    end
+end
+
+def fun_l19_n339(x)
+    if (x < 1)
+        fun_l20_n376(x)
+    else
+        fun_l20_n733(x)
+    end
+end
+
+def fun_l19_n340(x)
+    if (x < 1)
+        fun_l20_n162(x)
+    else
+        fun_l20_n397(x)
+    end
+end
+
+def fun_l19_n341(x)
+    if (x < 1)
+        fun_l20_n526(x)
+    else
+        fun_l20_n431(x)
+    end
+end
+
+def fun_l19_n342(x)
+    if (x < 1)
+        fun_l20_n850(x)
+    else
+        fun_l20_n226(x)
+    end
+end
+
+def fun_l19_n343(x)
+    if (x < 1)
+        fun_l20_n936(x)
+    else
+        fun_l20_n739(x)
+    end
+end
+
+def fun_l19_n344(x)
+    if (x < 1)
+        fun_l20_n639(x)
+    else
+        fun_l20_n844(x)
+    end
+end
+
+def fun_l19_n345(x)
+    if (x < 1)
+        fun_l20_n230(x)
+    else
+        fun_l20_n8(x)
+    end
+end
+
+def fun_l19_n346(x)
+    if (x < 1)
+        fun_l20_n156(x)
+    else
+        fun_l20_n417(x)
+    end
+end
+
+def fun_l19_n347(x)
+    if (x < 1)
+        fun_l20_n823(x)
+    else
+        fun_l20_n843(x)
+    end
+end
+
+def fun_l19_n348(x)
+    if (x < 1)
+        fun_l20_n798(x)
+    else
+        fun_l20_n538(x)
+    end
+end
+
+def fun_l19_n349(x)
+    if (x < 1)
+        fun_l20_n701(x)
+    else
+        fun_l20_n949(x)
+    end
+end
+
+def fun_l19_n350(x)
+    if (x < 1)
+        fun_l20_n131(x)
+    else
+        fun_l20_n727(x)
+    end
+end
+
+def fun_l19_n351(x)
+    if (x < 1)
+        fun_l20_n661(x)
+    else
+        fun_l20_n655(x)
+    end
+end
+
+def fun_l19_n352(x)
+    if (x < 1)
+        fun_l20_n824(x)
+    else
+        fun_l20_n436(x)
+    end
+end
+
+def fun_l19_n353(x)
+    if (x < 1)
+        fun_l20_n599(x)
+    else
+        fun_l20_n581(x)
+    end
+end
+
+def fun_l19_n354(x)
+    if (x < 1)
+        fun_l20_n290(x)
+    else
+        fun_l20_n632(x)
+    end
+end
+
+def fun_l19_n355(x)
+    if (x < 1)
+        fun_l20_n495(x)
+    else
+        fun_l20_n466(x)
+    end
+end
+
+def fun_l19_n356(x)
+    if (x < 1)
+        fun_l20_n70(x)
+    else
+        fun_l20_n270(x)
+    end
+end
+
+def fun_l19_n357(x)
+    if (x < 1)
+        fun_l20_n409(x)
+    else
+        fun_l20_n635(x)
+    end
+end
+
+def fun_l19_n358(x)
+    if (x < 1)
+        fun_l20_n396(x)
+    else
+        fun_l20_n41(x)
+    end
+end
+
+def fun_l19_n359(x)
+    if (x < 1)
+        fun_l20_n302(x)
+    else
+        fun_l20_n209(x)
+    end
+end
+
+def fun_l19_n360(x)
+    if (x < 1)
+        fun_l20_n844(x)
+    else
+        fun_l20_n23(x)
+    end
+end
+
+def fun_l19_n361(x)
+    if (x < 1)
+        fun_l20_n18(x)
+    else
+        fun_l20_n20(x)
+    end
+end
+
+def fun_l19_n362(x)
+    if (x < 1)
+        fun_l20_n821(x)
+    else
+        fun_l20_n806(x)
+    end
+end
+
+def fun_l19_n363(x)
+    if (x < 1)
+        fun_l20_n710(x)
+    else
+        fun_l20_n209(x)
+    end
+end
+
+def fun_l19_n364(x)
+    if (x < 1)
+        fun_l20_n979(x)
+    else
+        fun_l20_n457(x)
+    end
+end
+
+def fun_l19_n365(x)
+    if (x < 1)
+        fun_l20_n787(x)
+    else
+        fun_l20_n582(x)
+    end
+end
+
+def fun_l19_n366(x)
+    if (x < 1)
+        fun_l20_n274(x)
+    else
+        fun_l20_n710(x)
+    end
+end
+
+def fun_l19_n367(x)
+    if (x < 1)
+        fun_l20_n461(x)
+    else
+        fun_l20_n685(x)
+    end
+end
+
+def fun_l19_n368(x)
+    if (x < 1)
+        fun_l20_n953(x)
+    else
+        fun_l20_n477(x)
+    end
+end
+
+def fun_l19_n369(x)
+    if (x < 1)
+        fun_l20_n363(x)
+    else
+        fun_l20_n976(x)
+    end
+end
+
+def fun_l19_n370(x)
+    if (x < 1)
+        fun_l20_n934(x)
+    else
+        fun_l20_n742(x)
+    end
+end
+
+def fun_l19_n371(x)
+    if (x < 1)
+        fun_l20_n769(x)
+    else
+        fun_l20_n358(x)
+    end
+end
+
+def fun_l19_n372(x)
+    if (x < 1)
+        fun_l20_n53(x)
+    else
+        fun_l20_n915(x)
+    end
+end
+
+def fun_l19_n373(x)
+    if (x < 1)
+        fun_l20_n678(x)
+    else
+        fun_l20_n930(x)
+    end
+end
+
+def fun_l19_n374(x)
+    if (x < 1)
+        fun_l20_n160(x)
+    else
+        fun_l20_n937(x)
+    end
+end
+
+def fun_l19_n375(x)
+    if (x < 1)
+        fun_l20_n54(x)
+    else
+        fun_l20_n844(x)
+    end
+end
+
+def fun_l19_n376(x)
+    if (x < 1)
+        fun_l20_n911(x)
+    else
+        fun_l20_n756(x)
+    end
+end
+
+def fun_l19_n377(x)
+    if (x < 1)
+        fun_l20_n138(x)
+    else
+        fun_l20_n673(x)
+    end
+end
+
+def fun_l19_n378(x)
+    if (x < 1)
+        fun_l20_n976(x)
+    else
+        fun_l20_n720(x)
+    end
+end
+
+def fun_l19_n379(x)
+    if (x < 1)
+        fun_l20_n704(x)
+    else
+        fun_l20_n53(x)
+    end
+end
+
+def fun_l19_n380(x)
+    if (x < 1)
+        fun_l20_n762(x)
+    else
+        fun_l20_n340(x)
+    end
+end
+
+def fun_l19_n381(x)
+    if (x < 1)
+        fun_l20_n323(x)
+    else
+        fun_l20_n634(x)
+    end
+end
+
+def fun_l19_n382(x)
+    if (x < 1)
+        fun_l20_n515(x)
+    else
+        fun_l20_n562(x)
+    end
+end
+
+def fun_l19_n383(x)
+    if (x < 1)
+        fun_l20_n160(x)
+    else
+        fun_l20_n826(x)
+    end
+end
+
+def fun_l19_n384(x)
+    if (x < 1)
+        fun_l20_n779(x)
+    else
+        fun_l20_n638(x)
+    end
+end
+
+def fun_l19_n385(x)
+    if (x < 1)
+        fun_l20_n401(x)
+    else
+        fun_l20_n4(x)
+    end
+end
+
+def fun_l19_n386(x)
+    if (x < 1)
+        fun_l20_n604(x)
+    else
+        fun_l20_n820(x)
+    end
+end
+
+def fun_l19_n387(x)
+    if (x < 1)
+        fun_l20_n694(x)
+    else
+        fun_l20_n533(x)
+    end
+end
+
+def fun_l19_n388(x)
+    if (x < 1)
+        fun_l20_n687(x)
+    else
+        fun_l20_n697(x)
+    end
+end
+
+def fun_l19_n389(x)
+    if (x < 1)
+        fun_l20_n19(x)
+    else
+        fun_l20_n457(x)
+    end
+end
+
+def fun_l19_n390(x)
+    if (x < 1)
+        fun_l20_n812(x)
+    else
+        fun_l20_n152(x)
+    end
+end
+
+def fun_l19_n391(x)
+    if (x < 1)
+        fun_l20_n773(x)
+    else
+        fun_l20_n25(x)
+    end
+end
+
+def fun_l19_n392(x)
+    if (x < 1)
+        fun_l20_n24(x)
+    else
+        fun_l20_n930(x)
+    end
+end
+
+def fun_l19_n393(x)
+    if (x < 1)
+        fun_l20_n277(x)
+    else
+        fun_l20_n727(x)
+    end
+end
+
+def fun_l19_n394(x)
+    if (x < 1)
+        fun_l20_n272(x)
+    else
+        fun_l20_n298(x)
+    end
+end
+
+def fun_l19_n395(x)
+    if (x < 1)
+        fun_l20_n661(x)
+    else
+        fun_l20_n269(x)
+    end
+end
+
+def fun_l19_n396(x)
+    if (x < 1)
+        fun_l20_n624(x)
+    else
+        fun_l20_n654(x)
+    end
+end
+
+def fun_l19_n397(x)
+    if (x < 1)
+        fun_l20_n501(x)
+    else
+        fun_l20_n625(x)
+    end
+end
+
+def fun_l19_n398(x)
+    if (x < 1)
+        fun_l20_n596(x)
+    else
+        fun_l20_n160(x)
+    end
+end
+
+def fun_l19_n399(x)
+    if (x < 1)
+        fun_l20_n612(x)
+    else
+        fun_l20_n954(x)
+    end
+end
+
+def fun_l19_n400(x)
+    if (x < 1)
+        fun_l20_n911(x)
+    else
+        fun_l20_n321(x)
+    end
+end
+
+def fun_l19_n401(x)
+    if (x < 1)
+        fun_l20_n294(x)
+    else
+        fun_l20_n382(x)
+    end
+end
+
+def fun_l19_n402(x)
+    if (x < 1)
+        fun_l20_n193(x)
+    else
+        fun_l20_n732(x)
+    end
+end
+
+def fun_l19_n403(x)
+    if (x < 1)
+        fun_l20_n929(x)
+    else
+        fun_l20_n109(x)
+    end
+end
+
+def fun_l19_n404(x)
+    if (x < 1)
+        fun_l20_n647(x)
+    else
+        fun_l20_n497(x)
+    end
+end
+
+def fun_l19_n405(x)
+    if (x < 1)
+        fun_l20_n124(x)
+    else
+        fun_l20_n395(x)
+    end
+end
+
+def fun_l19_n406(x)
+    if (x < 1)
+        fun_l20_n949(x)
+    else
+        fun_l20_n195(x)
+    end
+end
+
+def fun_l19_n407(x)
+    if (x < 1)
+        fun_l20_n249(x)
+    else
+        fun_l20_n771(x)
+    end
+end
+
+def fun_l19_n408(x)
+    if (x < 1)
+        fun_l20_n728(x)
+    else
+        fun_l20_n752(x)
+    end
+end
+
+def fun_l19_n409(x)
+    if (x < 1)
+        fun_l20_n135(x)
+    else
+        fun_l20_n774(x)
+    end
+end
+
+def fun_l19_n410(x)
+    if (x < 1)
+        fun_l20_n277(x)
+    else
+        fun_l20_n499(x)
+    end
+end
+
+def fun_l19_n411(x)
+    if (x < 1)
+        fun_l20_n634(x)
+    else
+        fun_l20_n713(x)
+    end
+end
+
+def fun_l19_n412(x)
+    if (x < 1)
+        fun_l20_n118(x)
+    else
+        fun_l20_n879(x)
+    end
+end
+
+def fun_l19_n413(x)
+    if (x < 1)
+        fun_l20_n202(x)
+    else
+        fun_l20_n146(x)
+    end
+end
+
+def fun_l19_n414(x)
+    if (x < 1)
+        fun_l20_n668(x)
+    else
+        fun_l20_n22(x)
+    end
+end
+
+def fun_l19_n415(x)
+    if (x < 1)
+        fun_l20_n673(x)
+    else
+        fun_l20_n91(x)
+    end
+end
+
+def fun_l19_n416(x)
+    if (x < 1)
+        fun_l20_n399(x)
+    else
+        fun_l20_n288(x)
+    end
+end
+
+def fun_l19_n417(x)
+    if (x < 1)
+        fun_l20_n985(x)
+    else
+        fun_l20_n63(x)
+    end
+end
+
+def fun_l19_n418(x)
+    if (x < 1)
+        fun_l20_n973(x)
+    else
+        fun_l20_n37(x)
+    end
+end
+
+def fun_l19_n419(x)
+    if (x < 1)
+        fun_l20_n907(x)
+    else
+        fun_l20_n274(x)
+    end
+end
+
+def fun_l19_n420(x)
+    if (x < 1)
+        fun_l20_n0(x)
+    else
+        fun_l20_n895(x)
+    end
+end
+
+def fun_l19_n421(x)
+    if (x < 1)
+        fun_l20_n138(x)
+    else
+        fun_l20_n941(x)
+    end
+end
+
+def fun_l19_n422(x)
+    if (x < 1)
+        fun_l20_n944(x)
+    else
+        fun_l20_n393(x)
+    end
+end
+
+def fun_l19_n423(x)
+    if (x < 1)
+        fun_l20_n7(x)
+    else
+        fun_l20_n879(x)
+    end
+end
+
+def fun_l19_n424(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n19(x)
+    end
+end
+
+def fun_l19_n425(x)
+    if (x < 1)
+        fun_l20_n11(x)
+    else
+        fun_l20_n12(x)
+    end
+end
+
+def fun_l19_n426(x)
+    if (x < 1)
+        fun_l20_n652(x)
+    else
+        fun_l20_n501(x)
+    end
+end
+
+def fun_l19_n427(x)
+    if (x < 1)
+        fun_l20_n825(x)
+    else
+        fun_l20_n547(x)
+    end
+end
+
+def fun_l19_n428(x)
+    if (x < 1)
+        fun_l20_n485(x)
+    else
+        fun_l20_n905(x)
+    end
+end
+
+def fun_l19_n429(x)
+    if (x < 1)
+        fun_l20_n800(x)
+    else
+        fun_l20_n922(x)
+    end
+end
+
+def fun_l19_n430(x)
+    if (x < 1)
+        fun_l20_n122(x)
+    else
+        fun_l20_n79(x)
+    end
+end
+
+def fun_l19_n431(x)
+    if (x < 1)
+        fun_l20_n822(x)
+    else
+        fun_l20_n228(x)
+    end
+end
+

path: root/spec/ruby/core/proc/case_compare_spec.rb

require_relative '../../spec_helper'
require_relative 'shared/call'
require_relative 'shared/call_arguments'

describe "Proc#===" do
  it_behaves_like :proc_call, :===
  it_behaves_like :proc_call_block_args, :===
end

describe "Proc#=== on a Proc created with Proc.new" do
  it_behaves_like :proc_call_on_proc_new, :===
end

describe "Proc#=== on a Proc created with Kernel#lambda or Kernel#proc" do
  it_behaves_like :proc_call_on_proc_or_lambda, :===
end